| dc.contributor.author | Krimi, Issam | |
| dc.contributor.author | Benmansour, Rachid | |
| dc.contributor.author | Hanafi, Said | |
| dc.contributor.author | Elhachemi, Nizar | |
| dc.date.accessioned | 2022-07-06T06:37:45Z | |
| dc.date.available | 2022-07-06T06:37:45Z | |
| dc.date.issued | 2018 | |
| dc.identifier.citation | Krimi, I., Benmansour, R., Hanafi, S., & Elhachemi, N. (2019). Two-machine flow shop with synchronized periodic maintenance. RAIRO-Operations Research, 53(1), 351-365. | en_US |
| dc.identifier.uri | https://dspace.adu.ac.ae/handle/1/3883 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | EDP Sciences | en_US |
| dc.subject | Flow shop scheduling | en_US |
| dc.subject | Preventive maintenance | en_US |
| dc.subject | Mixed integer programming model | en_US |
| dc.subject | variable neighborhood search | en_US |
| dc.title | Two-machine flowshop with synchronized periodic maintenance | en_US |
| dc.title.alternative | RAIRO-Operations Research | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | https://doi.org/10.1051/ro/2018062 | |
