Solving No-wait Batch Scheduling Problems by Genetic Algorithm
碩士 === 國立臺灣科技大學 === 工業管理系 === 95 === A no-wait scheduling problem indicates a circumstance where there are no allowed buffers within each operation from job release to finish with the technological constraint. Common examples of a no-wait restriction are the production line in semiconductor fabricat...
Main Authors: | Wan-Jou Lee, 李宛柔 |
---|---|
Other Authors: | Ruey-Huei Yeh |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/x8tq3y |
Similar Items
-
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) -
Solving Multi-objective Scheduling Problem of Incompatible Families on Batch Processing Machines by Genetic Algorithm
by: Han-ChienHsiao, et al.
Published: (2014) -
Solving Scheduling Problems of Identical Machines with Mold Constraints Based on Genetic Algorithms
by: Sheng-Shin-Jou, et al.
Published: (2009) -
A Novel Fast Parallel Batch Scheduling Algorithm for Solving the Independent Job Problem
by: Bin Zhang, et al.
Published: (2020-01-01) -
Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint
by: Hua Gong, et al.
Published: (2014-01-01)