HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Genetic Algorithms for the Flow Shop Scheduling Problem with availability constraints

Riad Aggoune 1 Abdel Halim Mahdi 1 Marie-Claude Portmann 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Most of the papers on scheduling take the common assumption that the machines are always available. In this paper, we consider a flow shop problem with availability constraints (FSPAC), in which unavailability times of the machines are known in advance as a preventive maintenance activity. Contrary to the majority of previous works, preemption of tasks is not allowed. Two approaches are considered to deal with the maintenance activity: either the maintenance tasks are totally fixed or the location of some of them is optimized. As the problem is NP-hard, a genetic algorithm approach is proposed to solve the makespan and the total weighted tardiness minimization problems. Numerical experiments are presented to test the efficiency of the approach.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:46:24 PM
Last modification on : Friday, February 4, 2022 - 3:30:04 AM


  • HAL Id : inria-00100516, version 1



Riad Aggoune, Abdel Halim Mahdi, Marie-Claude Portmann. Genetic Algorithms for the Flow Shop Scheduling Problem with availability constraints. IEEE International Conference on Systems, Man, and Cybernetics 2001, 2001, Tucson, Arizona. ⟨inria-00100516⟩



Record views