The study on dynamic parallel machine scheduling problems
碩士 === 中原大學 === 工業工程研究所 === 89 === The research addresses the problem of dynamic parallel machine scheduling. Three different models are considered according to machines,jobs and operators. In the first case, we consider the dynamic parallel machines in a single stage with the objective of makes...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/88343390929017485399 |
| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 89 === The research addresses the problem of dynamic parallel machine scheduling. Three different
models are considered according to machines,jobs and operators.
In the first case, we consider the dynamic parallel machines in a single stage with the objective of makespan minimization. The problem is extended to the objective with total tardiness minimization. Finally, we consider the problem for the case in which the job is preemptive within each operator, provided that the setup time is separated from the processing time.
All three problems are known to be NP-hard even for the case of two identical parallel machines. An integer programming model and a heuristic algorithm are provided for each case. Experimental results show that the proposed heuristic algorithms are effective and efficient.
|
|---|