The wafer probing scheduling problem (WPSP)

Journal of the Operational Research Society

Volumn 53, Issue 8, 2002, Pages 864-874

  Pearn, W L ^a   Chung, S H ^a   Yang, M H ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL UNITED UNIVERSITY   (Taiwan)

Author keywords

Parallel machine scheduling; Vehicle routing with time windows; Wafer probing

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; INTEGRATED CIRCUIT MANUFACTURE; JOB ANALYSIS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SCHEDULING;

WAFER PROBING SCHEDULING PROBLEM (WPSP);

OPERATIONS RESEARCH;

EID: 0036682471     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601362     Document Type: Article

References (19)

1. A state-of-the-art review of parallel-machine scheduling research
2. Scheduling jobs within time windows on identical parallel machines: New model and algorithms
3. Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed
4. Evaluating scheduling heuristics for non-identical parallel processors
5. Textile production systems: A succession for non-identical parallel processors shops
6. Parallel machine scheduling with release time and machine eligibility restrictions
7. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup time
8. Decomposition methods for scheduling semiconductor testing facilities
9. On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent changeover costs
10. Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost
11. Batch scheduling to minimize total completion time
12. Algorithms for the vehicle routing and scheduling problem with time window constraints
13. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
14. Hybrid heuristics for the vehicle routing problem with time windows
15. Heuristics approaches to vehicle routing with backhauls and time windows
16. Classical and modern heuristics for the vehicle routing problem
17. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
18. An overview of a heuristic for vehicle for vehicle routing problem with time windows
19. Minimizing the total machine workload for the wafer probing scheduling problem (WPSP)