《2016 A branch and bound algorithm for the cyclic job-shop problem with transportation 》.pdf

Computers Operations Research 39 (2012) 3200–3214 Contents lists available at SciVerse ScienceDirect Computers Operations Research journal homepage: /locate/caor A branch and bound algorithm for the cyclic job-shop problem with transportation Peter Brucker a, Edmund K. Burke b, Sven Groenemeyer b,n a ¨ ¨ ¨ Universitat Osnabruck, Fachbereich Mathematik/Informatik, 49069 Osnabruck, Germany b University of Nottingham, School of Computer Science, Jubilee Campus, Nottingham NG8 1BB, United Kingdom a r t i c l e i n f o a b s t r a c t Available online 14 April 2012 The cyclic job-shop problem with transportation can be used to describe optimization problems in fully Keywords: automated manufacturing systems or assembly lines. We study the problem where the machines have Cyclic job-shop no buffers, which rapidly decreases the number of feasible solutions and, therefore, makes it a lot Transport harder to find those feasible solutions. After formulating the problem, we will characterize feasible Blocking solutions based on the route of the robot and their properties. With the aim of minimizing the cycle Branch and bound time, we have developed a tree search method to construct feasible solutions and combined it with a Minimal cycle time bounding procedure. Computational results are reported and compared to those gained b