Online Minimum Makespan Scheduling with a Buffer
From MaRDI portal
Publication:2897991
DOI10.1007/978-3-642-29700-7_15zbMath1304.90096OpenAlexW2204188595MaRDI QIDQ2897991
Xin Han, Yan Lan, Ning Ding, Xin Chen, György Dósa
Publication date: 16 July 2012
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_15
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (7)
Semi-online scheduling: a survey ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Improved semi-online makespan scheduling with a reordering buffer ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
This page was built for publication: Online Minimum Makespan Scheduling with a Buffer
