Algorithms for a realistic variant of flowshop scheduling

Authors:
B. Naderi;Rubén Ruiz;M. Zandieh
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática (ITI), Ciudad Politécnica de la Innovación, Edificio 8G, Acceso B, Universidad Polité ...;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, Tehran, Iran
Venue:
Computers and Operations Research
Year:
2010

Citing 8
Cited 3

The lessons of flowshop scheduling research

Operations Research
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Design and Analysis of Experiments

Design and Analysis of Experiments
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers

Information Sciences: an International Journal
Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber

Computers and Industrial Engineering
An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be visited by all jobs. Lastly, we also consider job sequence dependent setup times per stage. The optimization criterion considered is makespan minimization. While many approaches for hybrid flowshops have been proposed, hybrid flexible flowshops have been rarely studied. The situation is even worse with the addition of sequence dependent setups. In this study, we propose two advanced algorithms that specifically deal with the flexible and setup characteristics of this problem. The first algorithm is a dynamic dispatching rule heuristic, and the second is an iterated local search metaheuristic. The proposed algorithms are evaluated by comparison against seven other high performing existing algorithms. The statistically sound results support the idea that the proposed algorithms are very competitive for the studied problem.