New Separation Scheme for Hybrid Flowshop
Résumé
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.