Parallel machine scheduling subject to auxiliary resource constraints |
| |
Authors: | E Cakici |
| |
Institution: | Department of Industrial Engineering , University of Arkansas , Arkansas |
| |
Abstract: | This paper is motivated by scheduling photolithography machines in semiconductor manufacturing wherein reticle requirements are the auxiliary resource constraints. As the problem is NP hard, two different heuristic solution approaches are developed. The performance of our network-based mathematical model and heuristics are evaluated through an extensive set of problem instances. The best performing heuristic method typically produces solutions that are 1.72% above optimal. If this method is used as the seed solution for a Tabu search-based post processing algorithm, schedules that are 0.78% above the optimal solution, on average, are possible. |
| |
Keywords: | Machine scheduling Optimization Heuristics Semiconductor manufacturing |
|
|