Multiobjective permutation flow shop scheduling using a memetic algorithm with an NEH-based local search

Authors:
Tsung-Che Chiang;Hsueh-Chien Cheng;Li-Chen Fu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.
Venue:
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Year:
2009

Citing 11
Cited 1

Multiobjective Scheduling by Genetic Algorithms

Multiobjective Scheduling by Genetic Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Combining convergence and diversity in evolutionary multiobjective optimization

Evolutionary Computation
Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems

Expert Systems with Applications: An International Journal
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

Computers and Operations Research
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem

INFORMS Journal on Computing
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
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

A simulation-based approach for solving the flowshop problem

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address scheduling of the permutation flow shop with minimization of makespan and total flow time as the objectives. We propose a memetic algorithm (MA) to search for the set of nondominated solutions (the Pareto optimal solutions). The proposed MA adopts the permutation-based encoding and the fitness assignment mechanism of NSGAII. The main feature is the introduction of an NEH-based neighborhood function into the local search procedure. We also adjust the size of the neighborhood dynamically during the execution of the MA to strike a balance between exploration and exploitation. Forty public benchmark problem instances are used to compare the performance of our MA with that of twenty-seven existing algorithms. Our MA provides close performance for small-scale instances and much better performance for large-scale instances. It also updates more than 90% of the net set of non-dominated solutions for the large-scale instances.