Please use this identifier to cite or link to this item:
https://doi.org/10.1080/0305215X.2012.685072
Title: | A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems | Authors: | Tran, T.H. Ng, K.M. |
Keywords: | flexible flow shop scheduling metaheuristics multi-objective optimization nature-inspired optimization water flow algorithm |
Issue Date: | 1-Apr-2013 | Citation: | Tran, T.H., Ng, K.M. (2013-04-01). A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems. Engineering Optimization 45 (4) : 483-502. ScholarBank@NUS Repository. https://doi.org/10.1080/0305215X.2012.685072 | Abstract: | 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. © 2013 Taylor & Francis Group, LLC. | Source Title: | Engineering Optimization | URI: | http://scholarbank.nus.edu.sg/handle/10635/54285 | ISSN: | 0305215X | DOI: | 10.1080/0305215X.2012.685072 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.