A hierarchical approach to schedule the two-machine flow shop problem with flexible periodic synchronised maintenance

Nahla Chabbah Sekma and Hatem Hadda

European Journal of Industrial Engineering, 2024, vol. 18, issue 5, 669-690

Abstract: This paper tackles the makespan minimisation for the well-known two-machine flow shop problem with flexible periodic maintenance activities on both machines. The maintenance starting dates are to be decided along with the job's sequence. We adopt a hierarchical approach in which we first decide the job's sequence and then the maintenance starting dates. We identify a dominance rule and a polynomial case, and construct an enhancement procedure. We develop and test several variants of Tabu search and simulated annealing metaheuristics. We also propose an adaptation of the well-known NEH heuristic. The experimental study shows the superiority of one of the variants of simulated annealing and the efficiency of the dominance rule. [Received: 15 July 2022; Accepted: 8 May 2023]

Keywords: flow shop scheduling; flexible maintenance; Tabu search; simulated annealing. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=140743 (text/html)
Access to full text is restricted to subscribers.

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:ids:eujine:v:18:y:2024:i:5:p:669-690

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().