Online bin stretching with bunch techniques
From MaRDI portal
Publication:497684
DOI10.1016/j.tcs.2015.07.065zbMath1329.68299OpenAlexW2207216697MaRDI QIDQ497684
Vladimir Kotov, Nadia Brauner, Michaël Gabay
Publication date: 25 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.065
Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (9)
A survey on makespan minimization in semi-online environments ⋮ Online makespan minimization with parallel schedules ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Improved lower bounds for the online bin stretching problem ⋮ Semi-online scheduling: a survey ⋮ A two-phase algorithm for bin stretching with stretching factor 1.5 ⋮ Bin stretching with migration on two hierarchical machines ⋮ Online bin stretching with three bins ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Cites Work
- Semi-online scheduling revisited
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Semi-on-line multiprocessor scheduling with given total processing time
- Two semi-online scheduling problems on two uniform machines
- Semi on-line algorithms for the partition problem
- On-line scheduling revisited
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- Algorithms for on-line bin-packing problems with cardinality constraints
- An efficient algorithm for bin stretching
- The on-line multiprocessor scheduling problem with known sum of the tasks
- Better Algorithms for Online Bin Stretching
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Semi-online scheduling with decreasing job sizes
- On-line bin-stretching
This page was built for publication: Online bin stretching with bunch techniques
