Minimizing total completion time on two stage flexible flowshop with uniform parallel machines in the first stage and uniform batch parallel machines in the second stage
碩士 === 中原大學 === 工業與系統工程研究所 === 101 === This research consider two-stage flexible flow shop with batching scheduling problem. This research have a different type of jobs scheduling, first stage is on uniform parallel machines and the second stage is process of uniform batch parallel machines. The bat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83830282688924383393 |
| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 101 === This research consider two-stage flexible flow shop with batching scheduling problem. This research have a different type of jobs scheduling, first stage is on uniform parallel machines and the second stage is process of uniform batch parallel machines. The batches only include jobs on the same type. The objective is to minimize the total completion time.
This problem is shown to be NP-Hard, therefore propose a heuristic algorithms. First using SPT-FOE rule batching jobs to arranged batch in the second stage like Backward rule, then with taking the virtual start time of second stage of batch to assign jobs. Furthermore put the earliest completion time in the first stage machine. Basis on this, this research using greedy algorithm to reduce idle time of machine and early jobs of completion time to develop heuristic.
|
|---|