Scheduling chains on a single machine with non-negative time lags

Abstract : Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the operations have the same duration p and all the delays are equal to a constant l. Next, we consider that the length of any delay is less than the shortest processing time and we present an algorithm to minimize the makespan and another one to minimize the flow time when all the processing times are equal.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185777
Contributor : Lip6 Publications <>
Submitted on : Friday, August 21, 2015 - 2:57:57 PM
Last modification on : Monday, December 17, 2018 - 1:27:36 AM

Links full text

Identifiers

Collections

Citation

Alix Munier-Kordon, Francis Sourd. Scheduling chains on a single machine with non-negative time lags. Mathematical Methods of Operations Research, Springer Verlag, 2003, 57 (1), pp.111-123. ⟨10.1007/s001860200242⟩. ⟨hal-01185777⟩

Share

Metrics

Record views

114