Estimating The Makespan of The Two-Valued Restricted Assignment Problem

zum Volltext (867 kB)   ZIP
Beteiligte Person(en) / Institution(en)Autor :
DatumErschienen :
  • Mai 2015
Seitenbereich28 S.

We consider a special case of the scheduling problem on unrelated machines,namely the Restricted Assignment Problem with two different processing times.We show that the configuration LP has an integrality gap of at most~$\frac{5}{3} + \frac{1}{156} \approx 1.6731$ for this problem. This allows us to estimate the optimal makespan within a factor of~$\frac{5}{3} + \frac{1}{156}$,improving upon the previously best known estimation algorithm with ratio~$\frac{11}{6} \approx \numprint{1.833}$ due to Chakrabarty, Khanna, and Li \cite{CKL15}.
Statische URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000272
 
URN:NBNurn:nbn:de:gbv:8:1-zs-00000272-a3
IDNummer des Berichts :
  • TR_1505