Skip to Main content Skip to Navigation
Journal articles

Scheduling job families on non-identical parallel machines with time constraints

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Stéphane Dauzère-Pérès Connect in order to contact the contributor
Submitted on : Tuesday, July 4, 2017 - 11:23:56 AM
Last modification on : Wednesday, February 24, 2021 - 4:24:02 PM

Links full text



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. ⟨10.1007/s10479-012-1107-4⟩. ⟨emse-01555520⟩



Les métriques sont temporairement indisponibles