Minimizing makespan in a two-stage system with open and discrete shop
碩士 === 中原大學 === 工業工程研究所 === 94 === This paper addresses the two-stage system with open shop in the first stage and discrete shop in the second stage. The performance considered is the minimum makespan. The approaches includes one optimization algorithm and three heusitic algorithms. The optimization...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13974464816365863594 |
| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 94 === This paper addresses the two-stage system with open shop in the first stage and discrete shop in the second stage. The performance considered is the minimum makespan. The approaches includes one optimization algorithm and three heusitic algorithms. The optimization algorithm is the branch and bound algorithm. The first heuristic algorithm is developed by construct a sequence with the minimum makespan to the open shop and then use the FCFS rule to sequence the job in discrete processor. The second heuristic algorithm is generated by adopting the Johnson's rule to the open shop and also use the FCFS rule to the discreate processor. The last heuristic adopts an index according to the property developed in this work . Experimental results show that the solution qualities of these three heursitic are 84%, 96% and 97%, respectively. Finally, an optimal algorithm of specail case in which the minimum processing time of discreate processor is larger than the maximum processing time of the open shop is developoed.
|
|---|