A study of minimizing the makespan on a two-machine flowshop problem with deterioration considerations
碩士 === 逢甲大學 === 統計與精算所 === 94 === This paper introduces a two-machine flowshop makespan scheduling problem where job processing times are not constant but varies as time passes, i.e. they are assumed as increasing functions of their starting times. Some elimination rule and a lowered are established...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/05384972283570792573 |
| Summary: | 碩士 === 逢甲大學 === 統計與精算所 === 94 === This paper introduces a two-machine flowshop makespan scheduling problem where job processing times are not constant but varies as time passes, i.e. they are assumed as increasing functions of their starting times. Some elimination rule and a lowered are established in this paper. Throughout our simulation, an exact algorithm is proposed to solve problem up to 32 jobs in a reasonable time. Then three heuristic algorithms are provided to derive the near-optimal solutions. In addition, the impact of deterioration rate is also investigated.
|
|---|