Better Algorithms for Online Bin Stretching
From MaRDI portal
Publication:3453280
DOI10.1007/978-3-319-18263-6_3zbMath1457.68314OpenAlexW2140470980MaRDI QIDQ3453280
Jiří Sgall, Rob van Stee, Pavel Veselý, Martin Böhm
Publication date: 20 November 2015
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2381/32322
Related Items
Online makespan minimization with parallel schedules, Improved lower bounds for the online bin stretching problem, A two-phase algorithm for bin stretching with stretching factor 1.5, An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, Online bin stretching with three bins, Online bin stretching with bunch techniques, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum, Discovering and certifying lower bounds for the online bin stretching problem
Cites Work