This study proposes a simulated annealing-based approach for simultaneously solving balancing and sequencing problems of mixed-model U-lines. The proposed approach is capable of minimizing the number of workstations required on the mixed-model U-line as well as minimizing absolute deviation of workloads (ADW) among workstations. An experiment to evaluate the performance of the algorithm is also...

Abstract In some applications, acquiring covariates comes at a cost which is not negligible. For example in the medical domain, order to classify whether patient has diabetes or not, measuring glucose tolerance can be expensive. Assuming that of each covariate, and misclassification specified by user, our goal minimize (expected) total classification, i.e. plus acquired covariates. We formalize...

We focus on a three-stage supply chain problem for fast moving consumer goods including a supplier, a manufacturer and customers. There are different orders over identical cycles, to be processed in production site. The problem is to find a joint cyclic schedule of raw material procurement and job scheduling minimized the total cost comprised of raw material ordering cost and holding cost, prod...

Machine learning algorithms are increasingly used in large-scale industrial settings. Here, the operational cost during test-time has to be taken into account when an algorithm is designed. This operational cost is affected by the average running time and the computation time required for feature extraction. When a diverse set of features is used, the latter can vary drastically. In this paper ...

Currently, cash distribution experts know the importance of supporting decisions in an optimization model. Different enterprises and institutions design their routes empirical way, without using robust theoretical tools that minimize transport costs maximize levels customer satisfaction. Particularly, considering case Bank Mexico, metallic coins is a fundamental process. However, there are area...

A group of mobile entities is given a task to explore an edge-weighted tree T , i.e. every vertex of T has to be visited by at least one agent. There is no centralized unit to coordinate their actions, but they can freely communicate with each other and they know the structure of T in advance. The goal is to construct a deterministic strategy which allows robots to complete their task optimally...

A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attacker cannot launch an attack if its cost is beyond his available budget or its probability of success falls below a threshold level. The proposed branch-andbound algorithm includes, among other features, a dynamic progra...