An approximation algorithm for the UET two-machine open shop problem with time delays - Archive ouverte HAL
Communication Dans Un Congrès Année : 2007

An approximation algorithm for the UET two-machine open shop problem with time delays

Djamal Rebaine
  • Fonction : Auteur

Résumé

This paper addresses the problem of scheduling n unit execution time (UET) jobs with time delays considerations on a two-machine open-shop environment. The criterion we are considering is the makespan. A simple approximation algorithm, with an asymptotic performance guarantee of 5/ 4 , is presented and proved.
Fichier non déposé

Dates et versions

hal-01311531 , version 1 (04-05-2016)

Identifiants

  • HAL Id : hal-01311531 , version 1

Citer

Alix Munier-Kordon, Djamal Rebaine. An approximation algorithm for the UET two-machine open shop problem with time delays. MISTA Multidisciplinary International Scheduling Conference: Theory and Applications, Aug 2007, Paris, France. pp.377-385. ⟨hal-01311531⟩
52 Consultations
0 Téléchargements

Partager

More