Minimizing number of tardy jobs in a two-stage system with identical parallel machines
碩士 === 中原大學 === 工業與系統工程研究所 === 97 === This research explores two-stage flowshop including identical parallel machines and the main purpose is to minimize the number of tardy jobs. At the first stage and the second stage, the identical parallel machine can only process one task at a time. The restric...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39133483679198383796 |
| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 97 === This research explores two-stage flowshop including identical parallel machines and the main purpose is to minimize the number of tardy jobs. At the first stage and the second stage, the identical parallel machine can only process one task at a time. The restricted version of the problem under study is strongly NP-hard, which implies the general problem is also strongly NP-hard. This paper proposes two heuristics. Two kinds of algorithms will be adopted and along with a lower bound algorithm in order to solve the problem in this study. Experiment results show that the CPU time for heuristic one is less than the others, and the solution for heuristic two is best.
|
|---|