The dynamic scheduling of Open shop to minimize makespan

• Main Authors: Hsiu-Chuan Lin, 林秀娟
• Other Authors: Ling-Huey Su
• Format: Others
• Language: zh-TW
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/02893538751161672657

碩士 === 中原大學 === 工業工程研究所 === 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), is therefore proposed. A point of time is picked among the earliest available job release time and machine ready time. A job with the largest remaining processing time is selected to process at that time. Computational results show that the heuristic outperforms the existing algorithm.