| Issue |
RAIRO-Oper. Res.
Volume 53, Number 1, January–March 2019
ROADEF 2017
|
|
|---|---|---|
| Page(s) | 351 - 365 | |
| DOI | https://doi.org/10.1051/ro/2018062 | |
| Published online | 15 February 2019 | |
Two-machine flow shop with synchronized periodic maintenance
1
LAMIH UMR CNRS 8201, Polytechnic University of Hauts de France, France
2
Complex Systems Engineering & Human Systems, Mohammed VI Polytechnic University, Morocco
3
Mohammed V University in Rabat, Mohammadia School of Engineers, Morocco
* Corresponding author: issam.krimi@etu.univ-valenciennes.fr; issam.krimi1@gmail.com
Received:
30
May
2017
Accepted:
28
July
2018
In the literature, some works deal with the two-machine flow shop scheduling problem under availability constraints. Most of them consider those constraints only for one machine at a time and also with limited unavailability periods. In this work, we were interested by the unlimited periodic and synchronized maintenance applied on both machines. The problem is NP-hard. We proposed a mixed integer programming model and a variable neighborhood search for solving large instances in order to minimize the makespan. Computational experiments show the efficiency of the proposed methods.
Mathematics Subject Classification: 90B35 / 90C11
Key words: Flow shop scheduling / preventive maintenance / mixed integer programming model / variable neighborhood search
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.