Minimizing Makespan in Flowshops with Pallet Requirements : Computational Complexity

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

MoreLess

Year of publication:	2010
Authors:	Wang, M. W.
Other Persons:	Sethi, Suresh (contributor) ; Sriskandarajah, Chelliah (contributor) ; van de Velde, S. L. (contributor)
Publisher:	[2010]: [S.l.] : SSRN
Subject:	Durchlaufzeit \| Lead time \| Scheduling-Verfahren \| Scheduling problem \| Heuristik \| Heuristics \| Mathematische Optimierung \| Mathematical programming \| Theorie \| Theory \| Operations Research \| Operations research \| Fließfertigung \| Assembly-line production

Extent:	1 Online-Ressource (10 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	In: INFOR, Vol. 35 Issue 4, pp. 277-285, November 1997
Classification:	M11 - Production Management ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10013152472