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: | Hsiu-Chuan Lin, 林秀娟 |
---|---|
Other Authors: | Ling-Huey Su |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02893538751161672657 |
Similar Items
-
Makespan Minimization for Two-Machine Flow-Shop Scheduling with Batch Delivery
by: Shao-Chuan Chiang, et al.
Published: (2005) -
Minimizing makespan in reentrant shops
by: Jen-Shiang Chen, et al.
Published: (2003) -
Scheduling on Multiple Flowshops to Minimize the Makespan
by: Y.T. Lin, et al.
Published: (2007) -
Robust Two-machine Flow Shop Scheduling Model for Minimizing Makespan
by: Chong-Yu Jiang, et al.
Published: (2011) -
An improved NEH heuristic to minimize makespan for flow shop scheduling problems
by: Sharma, Meenakshi, et al.
Published: (2021-01-01)