Scheduling jobs on a k-stage flexible flow-shop

Abstract

We consider the problem of makespan minimization on a flexible flow shop with k stages and m s machines at any stage. We propose a heuristic algorithm based on the identification and exploitation of the bottleneck stage, which is simple to use and to understand by practitioners. A computational experiment is conducted to evaluate the performance of the proposed method. The study shows that our method is, in average, comparable with other bottleneck-based algorithms, but with smaller variance, and that it requires less computational effort.

Comments on “Scheduling jobs on a k-stage flexible flow-shop” [Annals of Operations Research (2008) 164: 29–40]

“…The proposed model by Paternina-Arboleda et al (2008) cannot consider this solution. According to Fig.…”

“…The proposed model by Paternina-Arboleda et al (2008) considers sequence of jobs at stages after assigning jobs to the machines. If we have one machine in each stage it is true but having more than one machine in a stage we should determine sequence of assigned jobs on each machine in that stage.…”

“…The comment is about the proposed mathematical formulation and the modification of it is suggested. Keywords Flexible flow-shop scheduling problem · Mathematical formulation 1 Mathematical formulationThe following notations were considered in Paternina-Arboleda et al (2008). …”

Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm

“…The MIP model and heuristics proposed are tested against a comprehensive benchmark, and the results are evaluated by advanced statistical tools that make the use of decision trees and experimental designs. Paternina-Arboleda et al [16] considered the problem of the makespan minimization on a flexible flow shop with k stages and m machines at any stage. They proposed a heuristic algorithm based on the identification and exploitation of the bottleneck stage.…”

Practical Solutions for a Dock Assignment Problem with Trailer Transportation

“…Gupta et al (2002) generalize well-known heuristic approaches and present constructive algorithms based on job insertion techniques and iterative algorithms based on local search. Paternina-Arboleda et al (2008) propose a heuristic for makespan minimization that focuses on the identification and exploitation of the bottleneck stage.…”