Multiobjective scheduling of a reentrant hybrid flowshop - Université de technologie de Troyes Access content directly
Conference Papers Year : 2009

Multiobjective scheduling of a reentrant hybrid flowshop


This paper deals with the multiobjective scheduling of a two stages reentrant hybrid flow shop. The system studied here is reentrant: jobs have to be processed more than once at each stage which is made of several identical parallel machines. Furthermore, the sequence is the same on each stage. In this study the two objectives are the minimization of both the maximum completion time and the sum of the tardiness. Two evolutionary algorithms are proposed : our Lorenz non dominated sorting genetic algorithm (L-NSGA) and the strength Pareto evolutionary algorithm version 2 (SPEA2). Several configurations of the system are tested and the results of the two algorithms are compared with the Pareto optimal front with respect to two different measures. The results show that our L-NSGA is more efficient than SPEA2 in 81% of the configurations. Furthermore the L-NSGA reaches optimal solutions for some instances.
No file

Dates and versions

hal-02499411 , version 1 (05-03-2020)



Frédéric Dugardin, Lionel Amodeo, Farouk Yalaoui. Multiobjective scheduling of a reentrant hybrid flowshop. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.193-195, ⟨10.1109/ICCIE.2009.5223775⟩. ⟨hal-02499411⟩


12 View
0 Download



Gmail Facebook X LinkedIn More