A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
1997
INFOR. Information systems and operational research
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m > 2 and K > 3, and for m > 3 and K > 2, where m is the number of machines and K is the number of pallets in the system. RESUME Nous regions ici le statut de la complexite algorithmique du probleme de la duree
doi:10.1080/03155986.1997.11732335
fatcat:xwsmbnki6vcprfo4y6eghovxry