Title :
A new hybrid genetic algorithm for the bi-criteria no-wait flowshop scheduling problem with makespan and total flow time minimization
Author :
Liu, You-gen ; Zhu, Xia ; Li, Xiao-ping
Author_Institution :
Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing
Abstract :
Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flowshop scheduling problems with both the makespan and the total flow time minimization. The proposed algorithm makes use of the principle of non-dominated sorting, coupled with the use of elitist solutions strategy. To improve efficiency, two effective multi-objective local search procedures based on objective increment are applied on each chromosome in the archive. Experimental results show that the proposal outperforms the other three heuristics both on effectiveness and efficiency.
Keywords :
flow shop scheduling; genetic algorithms; minimisation; search problems; bicriteria no-wait flowshop scheduling problem; elitist solutions strategy; hybrid genetic algorithm; multiobjective flowshop scheduling problems; multiobjective local search procedures; nondominated sorting; objective increment; total flow time minimization; Computer networks; Computer science; Genetic algorithms; Genetic engineering; Job shop scheduling; Laboratories; Machine learning; Minimization methods; Processor scheduling; Scheduling algorithm; Bi-criteria; Genetic algorithm; No-wait flowshop; Objective increment;
Conference_Titel :
Machine Learning and Cybernetics, 2008 International Conference on
Conference_Location :
Kunming
Print_ISBN :
978-1-4244-2095-7
Electronic_ISBN :
978-1-4244-2096-4
DOI :
10.1109/ICMLC.2008.4620529