A polynomial time algorithms for the UET permutation flowshop problem with time delays - Archive ouverte HAL
Article Dans Une Revue Computers and Operations Research Année : 2008

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

Djamal Rebaine
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-01195974 , version 1 (08-09-2015)

Identifiants

Citer

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⟩
72 Consultations
0 Téléchargements

Altmetric

Partager

More