Online bin stretching with bunch techniques
From MaRDI portal
Publication:497684
DOI10.1016/J.TCS.2015.07.065zbMATH Open1329.68299OpenAlexW2207216697MaRDI QIDQ497684FDOQ497684
Authors: Michaël Gabay, V. M. Kotov, Nadia Brauner 
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
Recommendations
Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- Semi-online scheduling revisited
- Semi-on-line multiprocessor scheduling with given total processing time
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Algorithms for on-line bin-packing problems with cardinality constraints
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- Two semi-online scheduling problems on two uniform machines
- Semi on-line algorithms for the partition problem
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Semi-online scheduling with decreasing job sizes
- The on-line multiprocessor scheduling problem with known sum of the tasks
- On-line bin-stretching
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- An efficient algorithm for bin stretching
- Better Algorithms for Online Bin Stretching
Cited In (12)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A two-phase algorithm for bin stretching with stretching factor 1.5
- A survey on makespan minimization in semi-online environments
- Online bin stretching with three bins
- An efficient algorithm for bin stretching
- Online makespan minimization with parallel schedules
- Bunch technique for semionline with two groups of items
- Bin stretching with migration on two hierarchical machines
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Semi-online scheduling: a survey
- Improved lower bounds for the online bin stretching problem
- Better algorithms for online bin stretching via computer search
This page was built for publication: Online bin stretching with bunch techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497684)
