A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem

Author

Gaofeng HUANG, Hong Kong University of Science and Technology
Andrew LIM, Hong Kong University of Science and Technology
Brian RODRIGUES, Singapore Management UniversityFollow

Publication Type

Journal Article

Publication Date

6-2007

Abstract

In this work, we introduce a local search strategy for combinatorial optimization problems which explores neighborhoods obtained using fragments of current solutions.We apply the approach to the well-knownNP-hard 2-machine bicriteria flowshop scheduling problem. Computational experiments using benchmark data show the approach to be effective when compared to other algorithms available for the problem.

Keywords

Local search, Bicriteria flowshop scheduling

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Computational Optimization and Applications

Volume

37

Issue

2

First Page

219

Last Page

229

ISSN

0926-6003

Identifier

10.1007/s10589-007-9018-z

Publisher

Springer Verlag

Citation

HUANG, Gaofeng; LIM, Andrew; and RODRIGUES, Brian. A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem. (2007). Computational Optimization and Applications. 37, (2), 219-229.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/608

Additional URL

https://doi.org/10.1007/s10589-007-9018-z