Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem

Résumé

This paper studies the scheduling of jobs of different families on parallel machines with qualification constraints. Originating from semiconductor manufacturing, this constraint imposes a time threshold between the execution of two jobs of the same family. Otherwise, the machine becomes disqualified for this family. The goal is to minimize both the flow time and the number of disqualifications. Recently, an efficient constraint programming model has been proposed. However, when priority is given to the flow time objective, the efficiency of the model can be improved. This paper uses a polynomial-time algorithm which minimize the flow time for a single machine relaxation where disqualifications are not considered. Using this algorithm one can derived filtering rules on different variables of the model. Experimental results are presented showing the effectiveness of these rules. They improve the competitiveness with the mixed integer linear program of the literature.
Fichier principal
Vignette du fichier
submissionCP2020_noStyle.pdf (216.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03013857 , version 1 (19-11-2020)

Identifiants

Citer

Margaux Nattaf, Arnaud Malapert. Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem. CP 2020: Principles and Practice of Constraint Programming, pp.462-477, 2020, ⟨10.1007/978-3-030-58475-7_27⟩. ⟨hal-03013857⟩
37 Consultations
66 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More