A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times
作者:
ROGERZ. RIOS-MERCADO,
JONATHANF. BARD,
期刊:
IIE Transactions
(Taylor Available online 1999)
卷期:
Volume 31,
issue 8
页码: 721-731
ISSN:0740-817X
年代: 1999
DOI:10.1080/07408179908969871
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
This paper presents a branch-and-bound enumeration scheme for the makespan minimization of the permutation flow shop scheduling problem with sequence-dependent setup times. The algorithm includes the implementation of both lower and upper bounding procedures, a dominance elimination criterion, and special features such as a partial enumeration strategy. A computational evaluation of the overall scheme demonstrates the effectiveness of each component. Test results are provided for a wide range of problem instances.
点击下载:
PDF (874KB)
返 回