Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking

Kun Yuan 1 Nathalie Sauer 2, 1 Christophe Sauvey 1
1 LGIPM - Laboratoire de Génie Industriel et de Production de Metz
2 COSTEAM - Optimal and secure management of manufacturing systems
Inria Nancy - Grand Est, UPVM - Université Paul Verlaine - Metz
Abstract : In this paper, we consider hybrid flow shop (HFS) scheduling problem with a special blocking constraint. Objective function is makespan minimization. HFS and RCb blocking constraint are firstly presented. Then, an integer linear model is presented to find the optimal solution and a lower bound is proposed for high size problems. In order to faster obtain a solution, especially for big size problems, an electromagnetism-like (EM) algorithm is proposed and some mechanisms are introduced to adapt EM-algorithm to HFS scheduling problems. Its performances are compared with optimal solutions when they have been obtained and lower bound for more complex problems. Opportunity to develop and adapt such a meta-heuristic is clearly demonstrated with presented solutions accuracy and time.
Type de document :
Communication dans un congrès
14th IEEE International Conference on Emerging Technologies and Factory Automation - ETFA 2009, Sep 2009, Mallorca, Spain. IEEE, pp.1 - 7, 2009, 〈10.1109/ETFA.2009.5347066〉
Liste complète des métadonnées
https://hal.inria.fr/inria-00600396
Contributeur : Ist Inria Nancy Grand Est <>
Soumis le : mardi 14 juin 2011 - 17:03:13
Dernière modification le : vendredi 16 mars 2018 - 16:12:02

Identifiants

Collections

INRIA | LGIPM | TDS-MACS | UNIV-LORRAINE

Citation

Kun Yuan, Nathalie Sauer, Christophe Sauvey. Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking. 14th IEEE International Conference on Emerging Technologies and Factory Automation - ETFA 2009, Sep 2009, Mallorca, Spain. IEEE, pp.1 - 7, 2009, 〈10.1109/ETFA.2009.5347066〉. 〈inria-00600396〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

128

Contact


archive-ouverte@inria.fr