An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

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

Résumé

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.
Fichier principal
Vignette du fichier
MIC 2017.pdf (407.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01579768 , version 1 (31-08-2017)

Identifiants

  • HAL Id : hal-01579768 , version 1

Citer

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⟩
175 Consultations
64 Téléchargements

Partager

Gmail Facebook X LinkedIn More