A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

Authors:
C. Gicquel;L. Hege;M. Minoux;W. van Canneyt
Affiliations:
Laboratoire de Genie Industriel, Grande Voie des Vignes, 92290 Chatenay-Malabry, France;Laboratoire de Genie Industriel, Grande Voie des Vignes, 92290 Chatenay-Malabry, France;Laboratoire d'Informatique de Paris 6, 4 place Jussieu, 75005 Paris, France;Danisco-Genencor Division Komvest 43, 8000 Brugge, Belgium
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 0

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
A hybrid two-stage flowshop with limited waiting time constraints

Computers and Industrial Engineering
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

Computers and Operations Research
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal
No-wait flexible flowshop scheduling with no-idle machines

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study a real-world complex hybrid flow-shop scheduling problem arising from a bio-process industry. There are a variety of constraints to be taken into account, in particular zero intermediate capacity and limited waiting time between processing stages. We propose an exact solution approach for this optimization problem, based on a discrete time representation and a mixed-integer linear programming formulation. The proposed solution algorithm makes use of a new family of valid inequalities exploiting the fact that a limited waiting time is imposed on jobs between two successive production stages. The results of our computational experiments confirm that the proposed method produces good feasible schedules for industrial instances.