| Two-machine flowshops with material handling (2006) | |||||||||||||
Abstract | |||||||||||||
| This paper concerns the minimization of the makespan when producing different parts in a 2-machine cell with a robot as the material handling. In the literature, two problems have been studied independently: the flowshop problem with a robot which is NP-hard and the robotic flowshop problem which is polynomially solvable. In this paper, we clarify the difference between both configurations. Then, we describe general results on equivalent configurations and we prove that the no-wait flowshop problem with a robot (where the parts are available at the first machine and leave the cell when the processing is finished on the second machine) is polynomially solvable. | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||