A local search using solution fragments for the 2-machine bicriteria scheduling problem

  • Authors:

  • Gaofeng Huang;Andrew Lim;Brian Rodrigues

  • Affiliations:

  • Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Lee Kong Chian School of Business, Singapore Management University, Singapore, Singapore 178899

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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-known $\mathcal{NP}$ -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.