The dynamic scheduling of Open shop to minimize makespan
碩士 === 中原大學 === 工業工程研究所 === 91 === This study considers the dynamic open shop scheduling problem with the objective of minimizing the makespan. It has been established that the problem is NP-hard. An efficient heuristic, MDLTRP( modified longest total remaining processing on other machines first), i...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02893538751161672657 |