Improving Heuristics and the Hybrid Genetic Algorithm for minimizing the maximum completion time of the Wafer Probing Scheduling Problem (WPSP)
碩士 === 國立交通大學 === 工業工程與管理系所 === 92 === The wafer probing scheduling problem (WPSP) is a practical version of the parallel-machine scheduling problem, which has many real-world applications including the integrated circuit (IC) manufacturing industry and other industries. WPSP carries the objective...
Main Authors: | Yu-Lin Tsai, 蔡育燐 |
---|---|
Other Authors: | Wen-Lea Pearn |
Format: | Others |
Language: | en_US |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/f5vh36 |
Similar Items
-
The Wafer Probing Scheduling Problem (WPSP): on Identical Parallel-Machine Modeling, Algorithms, and Applications
by: Ming-Hsien Yang, et al.
Published: (2001) -
An Iterated Greedy Heuristic Approach for Wafer Probing Scheduling Problems
by: Hsien_Lung Chen, et al.
Published: (2009) -
An Application of Genetic Algorithm in Scheduling Problem of Wafer Probe Center
by: Wu, Jung Sheng, et al.
Published: (1996) -
The Integration of Network Algorithms for the Wafer Probing Scheduling Problem
by: Jing-shi Liao, et al.
Published: (2001) -
Two Stage Hybrid Flow Shop Scheduling with Job Splitting Property for Minimizing the Maximum Completion Time
by: Shao-wei Huang, et al.
Published: (2014)