Scheduling Job Families on Non-Identical Parallel Machines with Time Constraints

Abstract : This paper studies the scheduling of lots (jobs) of different product types (jobfamily) 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, shouldbe satisfied for a machine to remain qualified for processing a job family. This constraintimposes that the time between the executions of two consecutive jobs of the same family ona qualified machine must not exceed the time threshold of the family. Otherwise, the machinebecomes disqualified. This problem comes from semiconductor manufacturing, whenAdvanced Process Control constraints are considered in scheduling problems. To solve thisproblem, two Mixed Integer Linear Programming models are proposed that use differenttypes 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 maximizingthe number of machines that remain qualified for the job families. Two heuristics arealso presented and studied in the numerical experiments.
Type de document :
Article dans une revue
Annals of Operations Research, Springer Verlag, 2014, 213 (1), pp.221-234
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01095731
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mardi 16 décembre 2014 - 10:33:18
Dernière modification le : mercredi 29 novembre 2017 - 10:06:30

Identifiants

  • HAL Id : emse-01095731, version 1

Collections

Citation

Ali Obeid, Stéphane Dauzere-Peres, Claude Yugma. Scheduling Job Families on Non-Identical Parallel Machines with Time Constraints. Annals of Operations Research, Springer Verlag, 2014, 213 (1), pp.221-234. 〈emse-01095731〉

Partager

Métriques

Consultations de la notice

48