Single machine scheduling for multi-assembly jobs with preemption
© 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://repository.li.mahidol.ac.th/handle/123456789/43270 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Mahidol University |
| 總結: | © 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the exact algorithm (Branch and Bound) in Lingo 12 is not capable of solve the large-sized problems. Balancing tardiness and set-up cost (BTS) algorithm, therefore, is developed and is capable to solve much larger size of the problem with reasonable solution quality and computational time. |
|---|