Parallel Machine Scheduling with Time Constraints on Machine Qualifications

Abstract : This paper studies the scheduling of jobs of different families on parallel machines, where not all machines are qualified (eligible) to process all job families. Originating from semiconductor manufacturing, an important constraint imposes that the time between the processing of two consecutive jobs of the same family on a machine does not exceed a given time limit. Otherwise, the machine becomes disqualified for this family. The goal is to minimize both the flow time and the number of disqualifications of job families on machines. To solve this problem, an integer linear programming model and a constraint programming model are proposed, as well as two improvement procedures of existing heuristics: A Recursive Heuristic and a Simulated Annealing algorithm. Numerical experiments on randomly generated instances compare the performances of each method.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02067750
Contributor : Claude Yugma <>
Submitted on : Thursday, March 14, 2019 - 12:45:41 PM
Last modification on : Tuesday, April 2, 2019 - 2:41:04 AM

Identifiers

Citation

Margaux Nattaf, Stéphane Dauzère-Pérès, Claude Yugma, Cheng-Hung Wu. Parallel Machine Scheduling with Time Constraints on Machine Qualifications. Computers and Operations Research, Elsevier, 2019, 107, pp.61-76. ⟨10.1016/j.cor.2019.03.004⟩. ⟨hal-02067750⟩

Share

Metrics

Record views

47