An approximation algorithm for the UET two-machine open shop problem with time delays
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.