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

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.
Type de document :
Communication dans un congrès
12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain. 〈http://mic2017.upf.edu/〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01579768
Contributeur : Lucien Mousin <>
Soumis le : jeudi 31 août 2017 - 15:55:04
Dernière modification le : mercredi 25 avril 2018 - 15:44:15
Document(s) archivé(s) le : vendredi 1 décembre 2017 - 19:05:44

Fichier

 Accès restreint
Fichier visible le : 2019-11-30

Connectez-vous pour demander l'accès au fichier

Identifiants

  • 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. 12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain. 〈http://mic2017.upf.edu/〉. 〈hal-01579768〉

Partager

Métriques

Consultations de la notice

141