Showing 1 - 10 of 31
Persistent link: https://www.econbiz.de/10005337388
In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the...
Persistent link: https://www.econbiz.de/10005311738
In this paper, we study the identical parallel machine scheduling problem with a planned maintenance period on each machine to minimize the sum of completion times. This paper is a first approach for this problem. We propose three exact methods to solve the problem at hand: mixed integer linear...
Persistent link: https://www.econbiz.de/10005253919
Most scheduling problems are complex combinatorial problems and very difficult to solve [Manage. Sci. 35 (1989) 164; F.S. Hillier, G.J. Lieberman, Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967]. That is why, lots of methods focus on the optimization according to a single...
Persistent link: https://www.econbiz.de/10010749196
Persistent link: https://www.econbiz.de/10008752148
Persistent link: https://www.econbiz.de/10005417791
This paper addresses cyclic scheduling of a no-wait robotic cell with multiple robots. In contrast to many previous studies, we consider r-degree cyclic (r  1) schedules, in which r identical parts with constant processing times enter and leave the cell in each cycle. We propose an...
Persistent link: https://www.econbiz.de/10004973640
The traditional hypothesis of “rationality” is far from perfect. Models of fairness solely based on consequence cannot explain why the same consequence of an action is perceived and reciprocated differently. A reciprocity model which accounts for both consequence and its underlying intention...
Persistent link: https://www.econbiz.de/10011097732
This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move...
Persistent link: https://www.econbiz.de/10010760060
A Vendor Managed Inventory (VMI) system consists of a manufacturing vendor and a number of retailers. In such a system, it is essential for the vendor to optimally determine retailer selection and other related decisions, such as the product’s replenishment cycle time and the wholesale price,...
Persistent link: https://www.econbiz.de/10010871104