Semi-online hierarchical scheduling problems with buffer or rearrangements
From MaRDI portal
Publication:1943630
DOI10.1016/j.ipl.2012.12.007zbMath1259.68255OpenAlexW1994612842MaRDI QIDQ1943630
Xin Han, Zhenzhen Xu, Xin Chen, He Jiang, György Dósa
Publication date: 20 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.12.007
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (11)
Semi-online scheduling: a survey ⋮ Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ Optimal algorithm for semi-online scheduling on two machines under GoS levels ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Online scheduling with migration on two hierarchical machines
This page was built for publication: Semi-online hierarchical scheduling problems with buffer or rearrangements
