A new batch scheduling problem in machining environment

Abstract : This presentation concerns a new scheduling problem for machining lines. This problem can be formulated as scheduling for a single max-batch machine with inclusion, exclusion and precedence constraints between jobs and under the condition that the time of a batch can exceed the time of its longest job. This problem is solved using the constrained shortest path approach. Dominance properties were developed to decrease the digraph's size. An illustrative example is reported.
Document type :
Conference papers
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00673241
Contributor : Florent Breuil <>
Submitted on : Thursday, February 23, 2012 - 10:31:03 AM
Last modification on : Monday, January 14, 2019 - 12:08:18 PM

Identifiers

  • HAL Id : emse-00673241, version 1

Citation

Alexandre Dolgui, Olga Guschinskaya, Nikolai Guschinsky, Genrikh Levin. A new batch scheduling problem in machining environment. 23rd European Conference on Operational Research, Jul 2009, Bonn, Germany. ⟨emse-00673241⟩

Share

Metrics

Record views

109