Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems

Authors:
Wajdi Trabelsi;Christophe Sauvey;Nathalie Sauer
Affiliations:
LGIPM, Paul Verlaine University of Metz, France;LGIPM, Paul Verlaine University of Metz, France;LGIPM, Paul Verlaine University of Metz, France
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 0

Outline for a Logical Theory of Adaptive Systems

Journal of the ACM (JACM)
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
Advances in Metaheuristics for Hard Optimization (Natural Computing Series)

Advances in Metaheuristics for Hard Optimization (Natural Computing Series)
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

Computers and Operations Research
Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
A genetic algorithm with genes-association recognition for flowshop scheduling problems

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. The last two cases can lead to blocking situations. In flowshop scheduling literature, many studies have been performed about classical flowshop problems and also about some problems with only one blocking situation between all machines. This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem description and definitions of different blocking constraints, a mathematical model is presented and heuristics are developed to propose quick solutions to these kinds of problems. Then, metaheuristics are used to improve found solutions. A comparison between heuristics and metaheuristics is then performed.