Minimizing the Makespan for the Flow Shop Scheduling Problem with Availability Constraints

Riad Aggoune 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper deals with the scheduling of a flow shop with availability constraints (FSPAC). In such a problem, machines are not continuously available for processing jobs due to a preventive maintenance activity. A small number of solution methods exists in the literature for solving problems with at most two machines and to the author's knowledge only a few of them make use of the non-preemptive constraint. In this paper, two variants of the non-preemptive FSPAC with an arbitrary number of machines and an arbitrary number of unavailability periods on each of them are considered. In the first variant, starting times of maintenance tasks are fixed while in the second one the maintenance tasks must be performed on given time windows. Since the FSPAC is NP-hard in the strong sense, a genetic algorithm and a tabu search approach are proposed to approximately solve the makespan minimization problem. Computational experiments are performed on randomly generated instances to show the efficiency of the proposed approaches.
Type de document :
Communication dans un congrès
Operational Research Peripatetic Post-Graduate Programme - ORP3, Sep 2001, Paris, France, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00100517
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:46:24
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100517, version 1

Collections

Citation

Riad Aggoune. Minimizing the Makespan for the Flow Shop Scheduling Problem with Availability Constraints. Operational Research Peripatetic Post-Graduate Programme - ORP3, Sep 2001, Paris, France, 2001. 〈inria-00100517〉

Partager

Métriques

Consultations de la notice

127