New Separation Scheme for Hybrid Flowshop

Lionel Dupont Antony Vignier 1 Marie-Claude Portmann 1 Christian Proust
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The k-stage Hybrid Flowshop Scheduling Problem is addressed in this pqper in which the maximum completion time is the criterion to minimize. In previous papers, we proposed some improvements of the well known branch and bound of Brah and Hunsucker that mainly dealt with lower and upper bound computation. Here, we propose an improvement of the separation scheme in order to cut more efficiently the branching search. The paper is organized as follows. In the first part, we present the HFSP. A short survey on the methods used to solve this problem is presented. Then in the second pqrt the Branch and Bound of Brah and Hunsucker is presented. The third part is dedicated to the improvement of the separation scheme and the last one, before the conclusion, presents the experimental results, which show the efficiency of the proposed improvement.
Type de document :
Article dans une revue
Journal Européen des Systèmes Automatisées, 1998, 32 (4), pp.453-465
Liste complète des métadonnées
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:02:01
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48


  • HAL Id : inria-00098487, version 1



Lionel Dupont, Antony Vignier, Marie-Claude Portmann, Christian Proust. New Separation Scheme for Hybrid Flowshop. Journal Européen des Systèmes Automatisées, 1998, 32 (4), pp.453-465. 〈inria-00098487〉



Consultations de la notice