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

Alix Munier-Kordon 1 Djamal Rebaine
1 CIAN - Circuits Intégrés Numériques et Analogiques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01311531
Contributor : Lip6 Publications <>
Submitted on : Wednesday, May 4, 2016 - 1:41:06 PM
Last modification on : Thursday, March 21, 2019 - 1:03:50 PM

Identifiers

  • HAL Id : hal-01311531, version 1

Citation

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⟩

Share

Metrics

Record views

52