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

Alix Munier-Kordon (1) , Francis Sourd (2)

1 ASIM - Architecture des Systèmes intégrés et Micro électronique
2 SYSDEF - Systèmes d'aide à la décision et à la formation

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.

Domaines: Informatique [cs]

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