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

Citation

Brucker P, Burke E & Groenemeyer S (2012) A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers and Operations Research, 39 (12), pp. 3200-3214. https://doi.org/10.1016/j.cor.2012.04.008

Abstract
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.

Keywords
Cyclic job-shop; Transport; Blocking; Branch and bound; Minimal cycle time; Operations Research/Decision Theory; Organization/Planning; Operations research; Business logistics; Economics/Management Science; Operations Research/Decision Theory; Mathematical Programming

Journal
Computers and Operations Research: Volume 39, Issue 12