Skip to Main content Skip to Navigation
Book sections

Hybrid Flow Shop Scheduling with Availability Constraints

Abstract : 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.
Document type :
Book sections
Complete list of metadata
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Thursday, October 14, 2021 - 6:41:53 PM
Last modification on : Monday, April 11, 2022 - 5:32:02 PM




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⟩



Record views