Using Genetic Algorithm for Single Batch Processing Machine with Compatible Job
碩士 === 國立勤益科技大學 === 工業工程與管理系 === 98 === The final test burn-in of the semiconductor industry is chosen as the theme for exploring single batch processing machine. A GA-based heuristic, denoted by GA_BH, is developed to solve the problem. The objective is total tardiness minimization. This paper appl...
Main Authors: | Yu-Wen Huang, 黃郁雯 |
---|---|
Other Authors: | Li-Man Liao |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/98643729008277365612 |
Similar Items
-
Using Genetic Algorithm for batch processing machine with compatible job
by: Sin-Cheng, Lin, et al.
Published: (2014) -
Single Batch Processing Machine with Compatible Job
by: Yi-Ming Chen, et al.
Published: (2009) -
Algorithms for Scheduling Parallel Batch Processing Machines with Non-Identical Job Ready Times
by: Vélez Gallego, Mario César
Published: (2009) -
Order batching heuristic based on genetic algorithms in warehouse minimizing travel distance
by: Ya-wen Huang, et al.
Published: (2009) -
An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
by: Javad Rezaeian, et al.
Published: (2018-07-01)