Makespan minimization for unrelated parallel machine problem with sequence dependent setup times
碩士 === 國立臺灣科技大學 === 工業管理系 === 97 === This thesis focuses on an unrelated parallel machine scheduling problem with sequence dependent setup times. The objective of the problem is to minimize the makespan. Due to the complexity of the problem, finding optimal solutions for large problems is very diffi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87602826212742924334 |