Scheduling job families on non-identical parallel machines with time constraints |
| |
Authors: | Ali Obeid Stéphane Dauzère-Pérès Claude Yugma |
| |
Institution: | 1. école des Mines de Saint-Etienne, Centre Microélectronique de Provence, 880 Avenue de Mimet, 13541, Gardanne, France
|
| |
Abstract: | This paper studies the scheduling of lots (jobs) of different product types (job family) on parallel machines, where not all machines are able to process all job families (non-identical machines). A special time constraint, associated to each job family, should be satisfied for a machine to remain qualified for processing a job family. This constraint imposes that the time between the executions of two consecutive jobs of the same family on a qualified machine must not exceed the time threshold of the family. Otherwise, the machine becomes disqualified. This problem comes from semiconductor manufacturing, when Advanced Process Control constraints are considered in scheduling problems. To solve this problem, two Mixed Integer Linear Programming models are proposed that use different types of variables. Numerical experiments show that the second model is much more effective, and that there is a trade-off between optimizing the scheduling objective and maximizing the number of machines that remain qualified for the job families. Two heuristics are also presented and studied in the numerical experiments. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|