A fast algorithm to minimize maximum lateness for the two-machine flow-shop problem

Cheng, Jinliang; Stephenson, Paul A.; Steiner, George; McMaster University, Michael G. DeGroote School of Business

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/5566

Full metadata record

DC Field	Value	Language
dc.contributor.author	Cheng, Jinliang	en_US
dc.contributor.author	Stephenson, Paul A.	en_US
dc.contributor.author	Steiner, George	en_US
dc.contributor.author	McMaster University, Michael G. DeGroote School of Business	en_US
dc.date.accessioned	2014-06-17T20:36:26Z	-
dc.date.available	2014-06-17T20:36:26Z	-
dc.date.created	2013-12-23	en_US
dc.date.issued	1999-06	en_US
dc.identifier.other	dsb/27	en_US
dc.identifier.other	1026	en_US
dc.identifier.other	4944047	en_US
dc.identifier.uri	http://hdl.handle.net/11375/5566	-
dc.description	<p>28 leaves : ; Includes bibliographical references (leaf 28). ; "June, 1999".</p> <p>This research was supported in part by the Natural Sciences and Engineering Research Council of Canada, under Grant No. OGPOOOl 798.</p>	en_US
dc.description.abstract	<p>We consider the two-machine flow-shop problem with release times where the objective is to minimize the maximum lateness. We derive a new dominance order and incorporate it into an efficient branch and bound algorithm which uses an adaptive branching scheme together with new fuzzy dominance properties for scheduling and searching. The algorithm performed very well. It solved within a few seconds more than 973 of the test problems with up to 200 jobs in a large-scale computational experiment. For the unsolved problems, the average gap between the best solution found and the optimum was less than 0.53.</p>	en_US
dc.relation.ispartofseries	Research and working paper series (Michael G. DeGroote School of Business)	en_US
dc.relation.ispartofseries	no. 439	en_US
dc.subject	Scheduling	en_US
dc.subject	Permutation flow shop	en_US
dc.subject	Lateness	en_US
dc.subject	Release times	en_US
dc.subject	Dominance orders	en_US
dc.subject	Algorithm	en_US
dc.subject	Business	en_US
dc.subject	Business	en_US
dc.subject.lcc	Production scheduling Production control Branch and bound algorithms	en_US
dc.title	A fast algorithm to minimize maximum lateness for the two-machine flow-shop problem	en_US
dc.type	article	en_US
Appears in Collections:	DeGroote School of Business Working Paper Series

Files in This Item:

File	Size	Format
fulltext.pdf Open Access	752.63 kB	Adobe PDF	View/Open

Show simple item record