A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem

Yeh, W

A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem

Yeh, W

Permalink

Publisher:: Pergamon-Elsevier Science Ltd
Publication Type:: Journal Article
Citation:: Computers & Operations Research, 1999, 26 (13), pp. 1293 - 1310
Issue Date:: 1999-01

Closed Access

	Filename	Description	Size
	2010004143OK.pdf		253.34 kB	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	1999-01	en_US
dc.identifier.citation	Computers & Operations Research, 1999, 26 (13), pp. 1293 - 1310	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14519
dc.description.abstract	In this study, a special situation involving a computationally di$cult #owshop scheduling problem is discussed. The objective of this problem is to minimize a weighted combination of job #owtime and schedule makespan. An e$cient Branch-and-Bound approach is developed here to solve this problem. The primary reason for developing this Branch-and-Bound approach is that its results can usefully guide other heuristic techniques, such as simulated annealing, tabu search, and genetic algorithms, in "nding optimal or good quality solutions to larger sized problems. As evidence of the utility of the proposed approach, we present extensive computational results on random test problems. Our results compare favorably with previously developed algorithms in the literature.	en_US
dc.publisher	Pergamon-Elsevier Science Ltd	en_US
dc.relation.ispartof	Computers & Operations Research	en_US
dc.relation.isbasedon	10.1016/S0305-0548(98)00106-3	en_US
dc.subject.classification	Operations Research	en_US
dc.title	A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem	en_US
dc.type	Journal Article
utslib.citation.volume	13	en_US
utslib.citation.volume	26	en_US
utslib.location.activity	ISI:000082714800003	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
dc.location.activity	ISI:000082714800003	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	13	en_US
pubs.volume	26	en_US

Abstract:

In this study, a special situation involving a computationally di$cult #owshop scheduling problem is discussed. The objective of this problem is to minimize a weighted combination of job #owtime and schedule makespan. An e$cient Branch-and-Bound approach is developed here to solve this problem. The primary reason for developing this Branch-and-Bound approach is that its results can usefully guide other heuristic techniques, such as simulated annealing, tabu search, and genetic algorithms, in "nding optimal or good quality solutions to larger sized problems. As evidence of the utility of the proposed approach, we present extensive computational results on random test problems. Our results compare favorably with previously developed algorithms in the literature.

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

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