ITEM METADATA RECORD
Title: Minimizing makespan in flowshops with pallet requirements: Computational complexity
Authors: Wang, Wei Wen ×
Sethi, S
Sriskandarajah, C
Van De Velde, S #
Issue Date: 1997
Publisher: Infor
Series Title: Infor vol:35 issue:4 pages:277-285
Abstract: 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 greater than or equal to 2 and K greater than or equal to 3, and for m greater than or equal to 3 and K greater than or equal to 2, where m is the number of machines and K is the number of pallets in the system.
URI: 
ISSN: 0315-5986
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Sinology, Leuven
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy

 




All items in Lirias are protected by copyright, with all rights reserved.

© Web of science