Study on Multi-Objective Optimization of Hybrid Flow Shop Scheduling Problem

Article Preview

Abstract:

Due to several mutual conflicting optimized objectives in the hybrid flow shop scheduling problem, its optimized model, including three objectives of make-span, flow-time and tardiness, was firstly set up, instead of the single optimized objective. Furthermore, in order to improve the optimized efficiency and parallelism, after comparing the normal multi-objective optimized methods, an improved NSGA-II algorithm with external archive strategy was proposed. Finally, taking a piston production line as example, its performance was tested. The result showed that the multi-objective optimization of hybrid flow shop scheduling based on improved NSGA-II provided managers with a set of feasible solutions for selection in accordance to their own preference. Therefore the decision could be made more scientific and efficient, and thus brings to the factory more economic benefits.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

529-534

Citation:

Online since:

December 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Johnson S. Optimal two-and-three stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1954)61-68.

DOI: 10.1002/nav.3800010110

Google Scholar

[2] Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flow shop heuristics [J]. European Journal of Operational Research, 165(2) (2005)479-494.

DOI: 10.1016/j.ejor.2004.04.017

Google Scholar

[3] Tseng LY, Lin YT. A hybrid genetic local search algorithm for the permutation flow shop scheduling problem. European Journal of Operational Research, 198(1) (2009)84-92.

DOI: 10.1016/j.ejor.2008.08.023

Google Scholar

[4] Vallada E, Ruiz R, Minella G. Minimizing total tardiness in the m-machine flow shop problem: a review and evaluation of heuristics and meta heuristics. Computer & Operation Research, 35(4) (2008)1350-1373.

DOI: 10.1016/j.cor.2006.08.016

Google Scholar

[5] Pareto V. Cours D' Economie Politique,volume I and II. F. Rouge, Lausanne, 1896.

Google Scholar

[6] MM Yenisey, B Yagmahan. Multi-objective permutation flow shop scheduling problem: Literature review, classification andcurrent trends. Omega, 45(2014)119-135.

DOI: 10.1016/j.omega.2013.07.004

Google Scholar

[7] Deb K, Partap A, Agrawal S, et al. A fast and elitist multi objective genetic algorithm: NSGA-II[C]. Evolutionary Computation, IEEE Transactions, 6(2) (2002)182-197.

DOI: 10.1109/4235.996017

Google Scholar