A polynomial time algorithms for the UET permutation flowshop problem with time delays

Alix Munier-Kordon (1) , Djamal Rebaine

1 CIAN - Circuits Intégrés Numériques et Analogiques

This paper addresses the problem of scheduling a set of n unit execution time (UET) jobs on an m-permutation flowshop with arbitrary time delays, so as to minimize the makespan criterion. A polynomial time algorithm is exhibited for the three-machine and four-machine cases, respectively.

Domaines: Informatique [cs]

Alix Munier-Kordon, Djamal Rebaine. A polynomial time algorithms for the UET permutation flowshop problem with time delays. Computers and Operations Research, 2008, 35 (2), pp.525-537. ⟨10.1016/j.cor.2006.03.018⟩. ⟨hal-01195974⟩