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...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
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 |
Be the first to leave a comment!