Hybrid Flow Shop Scheduling with Availability Constraints

Hamid Allaoui , Abdelhakim Artiba (1)

1 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

The success of a product depends on the costs incurred through its entire processing. Indeed, an efficient schedule can significantly reduce the total costs. Most of the literature on scheduling assumes that machines are always available. However, due to maintenance activities machines cannot operate continuously without some unavailability periods. This chapter deals with scheduling a hybrid flow shop with availability constraints to minimize makespan. We investigate exact methods to solve two special cases of this problem to optimality. We formulate a dynamic programming to solve two-machine flow shop and a branch and bound algorithm to solve the two-stage hybrid flow shop.

Mots clés: "Schedule Problem"; "Completion Time"; "Flow Shop"; "Preventive Maintenance"; "Short Processing Time"

Domaines: Informatique [cs]

Hamid Allaoui, Abdelhakim Artiba. Hybrid Flow Shop Scheduling with Availability Constraints. Essays in Production, Project Planning and Scheduling, 200, Springer US, pp.277-299, 2014, International Series in Operations Research & Management Science, ⟨10.1007/978-1-4614-9056-2_12⟩. ⟨hal-03379052⟩