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

Authors:
Gerardo Minella;Rubén Ruiz;Michele Ciavotta
Affiliations:
Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Valencia, Spain;Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Valencia, Spain;Dipartimento di Informatica e Automazione, Università degli studi Roma Tre, Roma, Italy
Venue:
INFORMS Journal on Computing
Year:
2008

Citing 0
Cited 18

Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

Computers and Operations Research
The distributed permutation flowshop scheduling problem

Computers and Operations Research
Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

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

ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Adaptive "Anytime" two-phase local search

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

Computers and Operations Research
NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems

Expert Systems with Applications: An International Journal
Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems

Computers and Operations Research
Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology

Computers and Industrial Engineering
Improving the anytime behavior of two-phase local search

Annals of Mathematics and Artificial Intelligence
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems

Computers and Operations Research
A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates

Engineering Applications of Artificial Intelligence
Multi-objective no-wait hybrid flowshop scheduling problem with transportation times

International Journal of Computational Science and Engineering
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm

Computers and Operations Research
Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations

Computers and Operations Research
An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting, and Pareto approaches have been reviewed. Exact, heuristic, and metaheuristic methods have been surveyed. Furthermore, a complete computational evaluation is also carried out. A total of 23 different algorithms including both flowshop-specific methods as well as general multiobjective optimization approaches have been tested under three different two-criteria combinations with a comprehensive benchmark. All methods have been studied under recent state-of-the-art quality measures. Parametric and nonparametric statistical testing is profusely employed to support the observed performance of the compared methods. As a result, we have identified the best-performing methods from the literature, which along with the review, constitutes a reference work for further research.