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 |
相似書籍
-
Novel MILP models for scheduling permutation flowshops
由: Pitty, S.S., et al.
出版: (2014) -
Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints
由: Zhao, Z.Y.J., et al.
出版: (2014) -
A comparative study of algorithms for the flowshop scheduling problem
由: Liu, S., et al.
出版: (2014) -
Airport Gate Scheduling with Time Windows
由: LIM, Andrew, et al.
出版: (2005) -
A m-Parallel Crane Scheduling Problem with a Non-Crossing Constraint
由: LIM, Andrew, et al.
出版: (2007)