Solving Parallel Machine Scheduling Problems by an Iterated Greedy Heuristic
碩士 === 華梵大學 === 工業工程與經營資訊學系碩士班 === 97 === Dynamic parallel machinescheduling problems (DPMSPs) with sequence dependent setup times (SDSTs) represent a very important production scheduling problem but remain under-represented in research literature. In this study, an iterated greedy (IG) algorithm...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/62322377514706379297 |