A case study on the wafer probing scheduling problem

Production Planning and Control

Volumn 13, Issue 1, 2002, Pages 66-75

  Pearn, W L ^a   Chung, S H ^a   Yang, Ming Hsien ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Integer programming; Parallel machine scheduling; Sequence dependent setup time; Wafer probing

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; INTEGRATED CIRCUIT MANUFACTURE; KNITTING MACHINERY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING; TEXTILE MILLS; WSI CIRCUITS;

PARALLEL-MACHINE SCHEDULING; WAFER PROBING SCHEDULING PROBLEMS (WPSP);

PRODUCTION CONTROL;

EID: 0036274180     PISSN: 09537287     EISSN: None     Source Type: Journal    
DOI: 10.1080/09537280110061593     Document Type: Article

References (13)

1. Parallel machine scheduling with release time and machine eligibility restrictions
2. Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation
3. Parallel machine scheduling problem using memetic algorithms
4. Scheduling vehicles from a central depot to a number of delivery points
5. Scheduling jobs within time windows on identical parallel machines: New model and algorithms
6. Minimizing the number of tardy jobs for in parallel machines
7. Scheduling jobs on parallel machines with sequence-dependent setup times
8. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup time
9. Decomposition methods for scheduling semiconductor testing facilities
10. Search heuristics for a parallel machine scheduling problem with ready time and due dates
11. On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent changeover costs
12. Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem
13. Parallel machine scheduling with release dates, due dates and family setup times