HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

No-wait scheduling in supply chain environment

Abstract : This paper presents an approach to schedule a project online in a supply chain without rescheduling or disturbing the previous schedules. The information at hand are the project requirements and the resources availability i.e. the busy status of resources. The objective is to find the shortest project completion time while following the no-wait strategy. Three algorithms are proposed. The first algorithm schedules the jobs online optimally for production processes that do not include assembly operations. The second algorithm utilizes the functionality of the first algorithm for scheduling the ordinary assembly processes (single assembly operation at the end of the processes). The third algorithm extends the approach of ordinary assembly process to schedule the complex assembly processes. A complex assembly process contains one assembly operation (if it is not the last one) or more than one assembly operations.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:50:41 PM
Last modification on : Friday, February 4, 2022 - 3:21:59 AM
Long-term archiving on: : Tuesday, February 22, 2011 - 12:02:58 PM


  • HAL Id : inria-00072121, version 1



Satyaveer Singh Chauhan, Valery Gordon, Jean-Marie Proth. No-wait scheduling in supply chain environment. [Research Report] RR-4467, INRIA. 2002, pp.21. ⟨inria-00072121⟩



Record views


Files downloads