Flow Shop Scheduling Problem with Limited Machine Availability: A Heuristic Approach

Article dans revue scientifique avec comité de lecture. internationale.International audienceThis paper addresses the flow shop scheduling problem with limited machine availability. In such a problem, n jobs have to be scheduled on m machines under the makespan criterion and under the assumption that the machines are not always available during the planning horizon. Since the makespan minimization is strongly NP-hard, we propose a heuristic approach to approximately solve the problem that consists in scheduling the jobs two by two according to an input sequence, and using a polynomial algorithm. This algorithm is an extension of the geometric approach developed for the two-job shop scheduling problem. || Ce papier s'intéresse au problème d'ordonnancement de type flow shop avec des contraintes d'indisponibilité des machines. Dans ce problème, n travaux doivent être exécutés sur m machines avec pour objectif la minimisation de la durée totale, sous la cont