Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
