An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times

From MaRDI portal
Revision as of 15:02, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1926488

DOI10.1016/j.disopt.2012.07.005zbMath1254.90076OpenAlexW2049627958MaRDI QIDQ1926488

Shlomo Karhi, Dvir Shabtay

Publication date: 28 December 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.07.005




Related Items (4)



Cites Work


This page was built for publication: An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times