An evolutionary algorithm for constraint flow shops with multi-criteria optimization

Author

Liao, Xiao-ping ; Deng, Jing ; Li, Xiao-ping

Author_Institution

Coll. of Comput. & Inf. Eng., Hohai Univ., Nanjing

Volume

2

fYear

2008

fDate

12-15 July 2008

Firstpage

904

Lastpage

908

Abstract

In this paper, an evolutionary algorithm is introduced for the NP-hard multi-criteria no-wait flow shop scheduling problems. Both makespan and total flowtime are taken into account. The proposed algorithm makes use of non-dominated sorting strategy. Corresponding objective increment properties are analyzed to improve efficiency for searching Pareto solutions. Experimental results show that the proposal outperforms the other three heuristics currently available.

Keywords

Pareto optimisation; evolutionary computation; flow shop scheduling; NP-hard problems; Pareto solutions; constraint flow shops; evolutionary algorithm; flow shop scheduling problems; multicriteria no-wait problems; multicriteria optimization; nondominated sorting strategy; objective increment properties; Computer science; Constraint optimization; Cybernetics; Educational institutions; Evolutionary computation; Job shop scheduling; Machine learning; Pareto optimization; Processor scheduling; Sorting; Constraint Flowshop; Makespan; Objective Increment; Total flowtime;

fLanguage

English

Publisher

ieee

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

Type

conf

DOI

10.1109/ICMLC.2008.4620533

Filename

4620533