Hybrid Flow Shop Scheduling with Availability Constraints

Hamid Allaoui () and Abdelhakim Artiba ()
Additional contact information
Hamid Allaoui: Universitè de Lille Nord de France, Universit/‘e dÁrtois
Abdelhakim Artiba: Universitè de Lille Nord de France, Universitè de Valenciennes

Chapter 12 in Essays in Production, Project Planning and Scheduling, 2014, pp 277-299 from Springer

Abstract: 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.

Keywords: Schedule Problem; Completion Time; Flow Shop; Preventive Maintenance; Short Processing Time (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-9056-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461490562

DOI: 10.1007/978-1-4614-9056-2_12

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().