A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems

In this article, the multi-objective flexible flow shop scheduling problem with limited intermediate buffers is addressed. The objectives considered in this problem consist of minimizing the completion time of jobs and minimizing the total tardiness time of jobs. A hybrid water flow algorithm for so...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Engineering optimization Ročník 45; číslo 4; s. 483 - 502
Hlavní autori: Tran, Trung Hieu, Ng, Kien Ming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis 01.04.2013
Taylor & Francis Ltd
Predmet:
Algorithms
Erosion
Evaporation
flexible flow shop scheduling
Fluid dynamics
Mathematical models
metaheuristics
multi-objective optimization
nature-inspired optimization
Neighbouring
Optimization
Pareto optimality
Precipitation
Scheduling
Water flow
water flow algorithm
ISSN:0305-215X, 1029-0273
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article, the multi-objective flexible flow shop scheduling problem with limited intermediate buffers is addressed. The objectives considered in this problem consist of minimizing the completion time of jobs and minimizing the total tardiness time of jobs. A hybrid water flow algorithm for solving this problem is proposed. Landscape analysis is performed to determine the weights of objective functions, which guide the exploration of feasible regions and movement towards the optimal Pareto solution set. Local and global neighbourhood structures are integrated in the erosion process of the algorithm, while evaporation and precipitation processes are included to enhance the solution exploitation capability of the algorithm in unexplored neighbouring regions. An improvement process is used to reinforce the final Pareto solution set obtained. The performance of the proposed algorithm is tested with benchmark and randomly generated instances. The computational results and comparisons demonstrate the effectiveness and efficiency of the proposed algorithm.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2012.685072