Name
Abstract | ||
|---|---|---|
Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the primary criterion and the minimization of the number of machines used as the secondary criterion. Although the need to consider multiple criteria in real-world WSSPs is widely recognized, the present study is the first attempt to investigate this argument with setups consideration. In view of the strongly NP-hard nature of this problem, three meta-heuristic algorithms-an ant colony system algorithm, a Genetic algorithm, and a Tabu search algorithm are proposed. The proposed meta-heuristics are empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor and found to be very effective in terms of finding good quality solutions. Journal of the Operational Research Society (2011) 62, 165-174. doi:10.1057/jors.2009.182 Published online 3 February 2010 |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1057/jors.2009.182 | JORS |
Keywords | Field | DocType |
investment,production,communications technology,project management,information technology,operational research,location,scheduling problem,operations research,heuristic algorithm,management science,computer science,scheduling,reliability,logistics,inventory,information systems,marketing,forecasting | Particle swarm optimization,Search algorithm,Job shop scheduling,Computer science,Swarm intelligence,Algorithm,Sorting,Wafer testing,Tabu search,Genetic algorithm,Operations management | Journal |
Volume | Issue | ISSN |
62 | 1 | 0160-5682 |
Citations | PageRank | References |
5 | 0.49 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shih-Wei Lin | 1 | 123 | 8.43 |
| Zne-Jung Lee | 2 | 940 | 43.45 |
| Kuo-Ching Ying | 3 | 712 | 36.47 |
| Rong-Ho Lin | 4 | 148 | 7.76 |