An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem

Lucien Mousin 1, 2, 3, 4 Marie-Eléonore Kessaci 1, 2, 3, 4 Clarisse Dhaenens 1, 2, 3, 4
3 ORKAD - Operational Research, Knowledge And Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
4 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem , with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP hard combinatorial problem we conducted an analysis of the structure of good quality solutions. This study shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs. After a discussion on the way to identify these sub-sequences, we propose to exploit them into the well-known Iterated Greedy algorithm. Experiments are conducted on Taillard's instances. The experimental results show the proposed approach is efficient and robust, and is able to find out new best solutions for all the largest instances.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01579768
Contributor : Lucien Mousin <>
Submitted on : Thursday, August 31, 2017 - 3:55:04 PM
Last modification on : Friday, March 22, 2019 - 1:33:39 AM
Long-term archiving on: Friday, December 1, 2017 - 7:05:44 PM

File

MIC 2017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01579768, version 1

Collections

Citation

Lucien Mousin, Marie-Eléonore Kessaci, Clarisse Dhaenens. An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem. MIC 2017 - 12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain. ⟨hal-01579768⟩

Share

Metrics

Record views

220

Files downloads

36