Minimizing the Makespan of Two-machine Flow Shop with Deteriorating Jobs and Truncated Learning Effect Setup time
碩士 === 國立成功大學 === 工業與資訊管理學系 === 102 === This study investigates the two-machine flow shop scheduling problem with deteriorating jobs and truncated learning effect setup time. The objective is to minimize the makespan. A dominance property, five upper bounds and two lower bounds are employed to const...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35550740297867710524 |
| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系 === 102 === This study investigates the two-machine flow shop scheduling problem with deteriorating jobs and truncated learning effect setup time. The objective is to minimize the makespan. A dominance property, five upper bounds and two lower bounds are employed to construct the branch and bound algorithm. Furthermore, a genetic algorithm is developed to find a near optimal solution efficiently. Finally, computation experiments are conducted to evaluate the performance of these two algorithms.
|
|---|