A two-phase algorithm for bin stretching with stretching factor 1.5
From MaRDI portal
Publication:1680492
DOI10.1007/s10878-017-0114-4zbMath1382.90085arXiv1601.08111OpenAlexW2963501126MaRDI QIDQ1680492
Jiří Sgall, Rob van Stee, Martin Böhm, Pavel Veselý
Publication date: 16 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.08111
Related Items (7)
A survey on makespan minimization in semi-online environments ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Semi-online scheduling: a survey ⋮ Bin stretching with migration on two hierarchical machines ⋮ Online bin stretching with three bins ⋮ An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Cites Work
- Semi-online scheduling revisited
- Online bin stretching with bunch techniques
- Preemptive online scheduling: Optimal algorithms for all speeds
- Semi on-line algorithms for the partition problem
- Online bin stretching with three bins
- Improved lower bounds for the online bin stretching problem
- An efficient algorithm for bin stretching
- Better Algorithms for Online Bin Stretching
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-Line Load Balancing for Related Machines
- Bounds on Multiprocessing Timing Anomalies
- On-line bin-stretching
This page was built for publication: A two-phase algorithm for bin stretching with stretching factor 1.5
