The lessons of flowshop scheduling research
Operations Research
Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
Permutation flowshop scheduling problems with maximal and minimal time lags
Computers and Operations Research
Evolutionary computing in manufacturing industry: an overview of recent applications
Applied Soft Computing
Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
Mathematical and Computer Modelling: An International Journal
Minimizing makespan in hybrid flowshops
Operations Research Letters
Minimizing makespan in two-stage hybrid cross docking scheduling problem
Computers and Operations Research
Computers and Industrial Engineering
Computers and Operations Research
Algorithms for a realistic variant of flowshop scheduling
Computers and Operations Research
The distributed permutation flowshop scheduling problem
Computers and Operations Research
Computers and Operations Research
Local search in complex scheduling problems
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
International Journal of Metaheuristics
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems
Journal of Intelligent Manufacturing
Computers and Operations Research
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
Computers and Operations Research
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
A heuristic method for two-stage hybrid flow shop with dedicated machines
Computers and Operations Research
Increasing the Reliability of Production Schedules in a Pharmaceutical Packaging Department
Journal of Medical Systems
Computers and Industrial Engineering
Hi-index | 0.01 |
This paper aims to contribute to the recent research efforts to bridge the gap between the theory and the practice of scheduling by modelizing a realistic manufacturing environment and analyzing the effect of the inclusion of several characteristics in the problem formulation. There are several constraints and characteristics that affect the scheduling operations at companies. While these constraints are many times tackled in the literature, they are seldom considered together inside the same problem formulation. We propose a formulation along with a mixed integer modelization and some heuristics for the problem of scheduling n jobs on m stages where at each stage we have a known number of unrelated machines. The jobs might skip stages and, therefore, we have what we call a hybrid flexible flowshop problem. We also consider per machine sequence-dependent setup times which can be anticipatory and non-anticipatory along with machine lags, release dates for machines, machine eligibility and precedence relationships among jobs. Manufacturing environments like this appear in sectors like food processing, ceramic tile manufacturing and several others. The optimization criterion considered is the minimization of the makespan. The MIP model and the heuristics proposed are tested against a comprehensive benchmark and the results evaluated by advanced statistical tools that make use of decision trees and experimental designs. The results allow us to identify the constraints that increase the difficulty.