Recommendations
Cites work
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- 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
- An efficient algorithm for bin stretching
- Better Algorithms for Online Bin Stretching
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- On-line bin-stretching
- On-line scheduling revisited
- Semi on-line algorithms for the partition problem
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-online scheduling revisited
- Semi-online scheduling with decreasing job sizes
- The on-line multiprocessor scheduling problem with known sum of the tasks
- Two semi-online scheduling problems on two uniform machines
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
Cited in
(11)- A survey on makespan minimization in semi-online environments
- Online bin stretching with three bins
- Better algorithms for online bin stretching via computer search
- An efficient algorithm for bin stretching
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- Bunch technique for semionline with two groups of items
- Improved lower bounds for the online bin stretching problem
- Bin stretching with migration on two hierarchical machines
- Semi-online scheduling: a survey
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- A two-phase algorithm for bin stretching with stretching factor 1.5
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)
