Skip to Main content Skip to Navigation
Journal articles

A Discrete Time Exact Solution Approach for a Complex Hybrid Flowshop Scheduling Problem with limited Wait Constraints

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01170465
Contributor : Lip6 Publications <>
Submitted on : Tuesday, June 28, 2016 - 4:06:26 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM
Long-term archiving on: : Thursday, September 29, 2016 - 11:57:24 AM

File

GicquelHegeMinouxCanneyt2011.p...
Files produced by the author(s)

Identifiers

Citation

Céline Gicquel, Laura Hege, Michel Minoux, W. van Canneyt. A Discrete Time Exact Solution Approach for a Complex Hybrid Flowshop Scheduling Problem with limited Wait Constraints. Computers and Operations Research, Elsevier, 2012, 39 (3), pp.629-636. ⟨10.1016/j.cor.2011.02.017⟩. ⟨hal-01170465⟩

Share

Metrics

Record views

295

Files downloads

583