MINIMIZING THE MAKESPAN IN THE 3-MACHINE ASSEMBLY-TYPE FLOWSHOP SCHEDULING PROBLEM

dc.citation.epage	625	en_US
dc.citation.issue	5	en_US
dc.citation.spage	616	en_US
dc.citation.volume	39	en_US
dc.citation.woscount	101
dc.contributor.author	LEE, CY	en_US
dc.contributor.author	CHENG, TCE	en_US
dc.contributor.author	LIN, BMT	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2014-12-08T15:20:07Z
dc.date.available	2014-12-08T15:20:07Z
dc.date.issued	1993-05-01	en_US
dc.description.abstract	This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and present the solution algorithms. Next, a branch and bound solution scheme is suggested. Finally, three heuristics to find approximate solutions to the general problem are proposed and their error bounds are analyzed.	en_US
dc.identifier.issn	0025-1909	en_US
dc.identifier.journal	MANAGEMENT SCIENCE	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/14263
dc.identifier.wosnumber	WOS:A1993LE85000008
dc.language.iso	en_US	en_US
dc.subject	FLOWSHOP	en_US
dc.subject	SCHEDULING	en_US
dc.subject	ASSEMBLY-TYPE PRODUCTION	en_US
dc.title	MINIMIZING THE MAKESPAN IN THE 3-MACHINE ASSEMBLY-TYPE FLOWSHOP SCHEDULING PROBLEM	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1