An Efficient Branch-And-Bound Algorithm For The Two-Machine Bicriteria Flowshop Scheduling Problem

Yeh, W

An Efficient Branch-And-Bound Algorithm For The Two-Machine Bicriteria Flowshop Scheduling Problem

Yeh, W

Permalink

Publisher:: Soc Manufacturing Engineers
Publication Type:: Journal Article
Citation:: Journal Of Manufacturing Systems, 2001, 20 (2), pp. 113 - 123
Issue Date:: 2001-01

Closed Access

	Filename	Description	Size
	2010004138OK.pdf		6.89 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.date.issued	2001-01	en_US
dc.identifier.citation	Journal Of Manufacturing Systems, 2001, 20 (2), pp. 113 - 123	en_US
dc.identifier.issn	0278-6125	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14513
dc.description.abstract	In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-bound algorithm is presented. The proposed algorithm and the existing ones are compared on randomly generated problems. The computational analysis on problems up to 20 jobs shows that the proposed branch-andbound algorithm is more efficient than the others, including the best-known algorithm. The upper bound used in the proposed branch-and-bound algorithm, a two-phase hybrid heuristic method, is also shown to be efficient. Its overall average error on the randomly generated problems is 0.000139, that is, almost equal to the optimal solution.	en_US
dc.publisher	Soc Manufacturing Engineers	en_US
dc.relation.ispartof	Journal Of Manufacturing Systems	en_US
dc.relation.isbasedon	10.1016/S0278-6125(01)80034-0	en_US
dc.subject.classification	Industrial Engineering & Automation	en_US
dc.title	An Efficient Branch-And-Bound Algorithm For The Two-Machine Bicriteria Flowshop Scheduling Problem	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	20	en_US
utslib.location.activity	ISI:000171459300005	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0910 Manufacturing Engineering	en_US
dc.location.activity	ISI:000171459300005	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	false	en_US
pubs.issue	2	en_US
pubs.volume	20	en_US

Abstract:

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-bound algorithm is presented. The proposed algorithm and the existing ones are compared on randomly generated problems. The computational analysis on problems up to 20 jobs shows that the proposed branch-andbound algorithm is more efficient than the others, including the best-known algorithm. The upper bound used in the proposed branch-and-bound algorithm, a two-phase hybrid heuristic method, is also shown to be efficient. Its overall average error on the randomly generated problems is 0.000139, that is, almost equal to the optimal solution.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/14513