A branch and bound algorithm for the cyclic job-shop problem with transportation

Autor(en): Brucker, Peter
Burke, Edmund K.
Groenemeyer, Sven
Stichwörter: BLOCKING; Branch and bound; Computer Science; Computer Science, Interdisciplinary Applications; Cyclic job-shop; Engineering; Engineering, Industrial; HARD; Minimal cycle time; Operations Research & Management Science; ROBOTIC CELLS; SCHEDULING PROBLEMS; TIME-WINDOW CONSTRAINTS; Transport
Erscheinungsdatum: 2012
Volumen: 39
Ausgabe: 12
Startseite: 3200
Seitenende: 3214
The cyclic job-shop problem with transportation can be used to describe optimization problems in fully automated manufacturing systems or assembly lines. We study the problem where the machines have no buffers, which rapidly decreases the number of feasible solutions and, therefore, makes it a lot harder to find those feasible solutions. After formulating the problem, we will characterize feasible solutions based on the route of the robot and their properties. With the aim of minimizing the cycle time, we have developed a tree search method to construct feasible solutions and combined it with a bounding procedure. Computational results are reported and compared to those gained by solving the problem with an LP solver. (C) 2012 Elsevier Ltd. All rights reserved.
ISSN: 03050548
DOI: 10.1016/j.cor.2012.04.008

Show full item record

Google ScholarTM