Skip to Main content Skip to Navigation
Journal articles

Multi-stage supply chain scheduling with non-preemptive continuous operations and execution control

Dmitry Ivanov Boris Sokolov Alexandre Dolgui 1
1 Laboratoire en Sciences et Technologies de l'Information
LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes, DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
Abstract : An integrated multi-stage scheduling and routing problem with alternative machines at each supply chain (SC) stage and non-preemptive operations is studied. The peculiarity of the considered problem is the consideration of both continuous flows in operations and discrete assignments. Such problems are typical in the process industry. Taking into account the basic aspects that pertain to this case, a dynamic decomposition of the problem on the basis of optimal programme control is proposed. A particular feature and novelty of the presented study is the consideration of non-preemptive operations and their execution dynamics. The solution is based on a combined application of discrete and continuous optimization. With the special properties of the proposed scheduling model, it becomes possible to develop an optimal solution to the integrated scheduling and routing of jobs. Since the schedule generation is formulated in control terms, the models of scheduling and adaptation can be integrated. From the practical point of view, such integration can be advantageous subject to further dynamic analysis of the robustness, stability, and adaptability of SC schedules.
Document type :
Journal articles
Complete list of metadata
Contributor : Florent Breuil Connect in order to contact the contributor
Submitted on : Friday, November 8, 2013 - 9:27:53 AM
Last modification on : Wednesday, August 4, 2021 - 3:42:04 PM



Dmitry Ivanov, Boris Sokolov, Alexandre Dolgui. Multi-stage supply chain scheduling with non-preemptive continuous operations and execution control. International Journal of Production Research, Taylor & Francis, 2013, Article first published online. ⟨10.1080/00207543.2013.793429⟩. ⟨emse-00881314⟩



Record views