Robust Two-machine Flow Shop Scheduling Model for Minimizing Makespan
碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 99 === Real-world manufacturing systems usually operate in highly uncertain environments in which production schedules can not be executed exactly. Review of the literature, most of studies with respect to robust scheduling founded on single-machine scheduling prob...
Main Authors: | Chong-Yu Jiang, 江崇宇 |
---|---|
Other Authors: | 應國卿 |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/8vg49r |
Similar Items
-
Makespan Minimization for Two-Machine Flow-Shop Scheduling with Batch Delivery
by: Shao-Chuan Chiang, et al.
Published: (2005) -
Scheduling stochastic two-machine flow shop problems to minimize expected makespan
by: Mehdi Heydari, et al.
Published: (2013-07-01) -
The dynamic scheduling of Open shop to minimize makespan
by: Hsiu-Chuan Lin, et al.
Published: (2003) -
Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times
by: Yuri N. Sotskov, et al.
Published: (2020-08-01) -
An improved NEH heuristic to minimize makespan for flow shop scheduling problems
by: Sharma, Meenakshi, et al.
Published: (2021-01-01)