Scheduling hybrid flowshops with parallel batch, release time, and machine eligibility constraints
碩士 === 國立成功大學 === 製造工程研究所碩博士班 === 97 === This paper investigates a difficult scheduling problem on a specialized two-stage hybrid flow shop with multiple processors (FSMP) that often appears in semiconductor manufacturing industry, where the first and second stages process serial and parallel batche...
Main Authors: | Yu-Bang Chang, 張聿邦 |
---|---|
Other Authors: | Taho Yang |
Format: | Others |
Language: | zh-TW |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/57596378082308229558 |
Similar Items
-
The Parallel Batch Machine Scheduling with Machine Eligibility and Waiting Time Constraints to Minimize Total Completion Time
by: Yi-Hua Huang, et al.
Published: (2018) -
Use MIP to Solve The Problem Of Parallel Batch Machine Scheduling with Machine Eligibility and Waiting Time Constraints
by: Ying-Shan Chen, et al.
Published: (2019) -
Parallel Machine Scheduling with Machine Availability and Eligibility Constraints
by: Baw-Ho Lu, et al.
Published: (2005) -
Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
by: Lika Ben-Dati, et al.
Published: (2009-01-01) -
Optimal Parallel Machine Scheduling with Machine Availability and Eligibility Constraints
by: Lu-Wen Liao, et al.
Published: (2006)