Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm

Authors:
Hang-Min Cho;Suk-Joo Bae;Jungwuk Kim;In-Jae Jeong
Affiliations:
Department of Industrial Engineering, Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul 133-791, Republic of Korea;Department of Industrial Engineering, Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul 133-791, Republic of Korea;Samsung SDS Co. Ltd., 707-19 Yoksam-2dong, Kangnam-gu, Seoul 135-918, Republic of Korea;Department of Industrial Engineering, Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul 133-791, Republic of Korea
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 7
Cited 1

Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Mixed binary integer programming formulations for the reentrant job shop scheduling problem

Computers and Operations Research
Muiltiobjective optimization using nondominated sorting in genetic algorithms

Evolutionary Computation
An overview of evolutionary algorithms in multiobjective optimization

Evolutionary Computation
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

Pareto process optimization of product development project using bi-objective hybrid genetic algorithm

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with a scheduling problem for reentrant hybrid flowshop with serial stages where each stage consists of identical parallel machines. In a reentrant flowshop, a job may revisit any stage several times. Local-search based Pareto genetic algorithms with Minkowski distance-based crossover operator is proposed to approximate the Pareto optimal solutions for the minimization of makespan and total tardiness in a reentrant hybrid flowshop. The Pareto genetic algorithms are compared with existing multi-objective genetic algorithm, NSGA-II in terms of the convergence to optimal solution, the diversity of solution and the dominance of solution. Experimental results show that the proposed crossover operator and local search are effective and the proposed algorithm outperforms NSGA-II by statistical analysis.