A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from a sequence and re-inserted into all possible positions of the remaining seque...
Saved in:
Main Authors: | , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/107365 http://hdl.handle.net/10220/17525 http://dx.doi.org/10.1016/j.cor.2013.01.005 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |