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

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

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 bench...

Full description

Saved in:
Bibliographic Details
Main Authors: HUANG, Gaofeng, LIM, Andrew, RODRIGUES, Brian
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Local search
Bicriteria flowshop scheduling
Operations and Supply Chain Management
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/608
https://doi.org/10.1007/s10589-007-9018-z
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.

Similar Items