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: HUANG, Gaofeng, LIM, Andrew, RODRIGUES, Brian
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2007
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/608
https://doi.org/10.1007/s10589-007-9018-z
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English