An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
From MaRDI portal
Publication:2043022
DOI10.1016/j.tcs.2021.06.002OpenAlexW3167251529MaRDI QIDQ2043022
Tomas Olaj, Hans Kellerer, Zsolt Tuza, György Dósa
Publication date: 22 July 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.002
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-online scheduling revisited
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-online scheduling problems on two identical machines with inexact partial information
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi on-line algorithms for the partition problem
- Bin stretching revisited
- On-line scheduling revisited
- A survey on makespan minimization in semi-online environments
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Online bin stretching with three bins
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Improved lower bounds for the online bin stretching problem
- An efficient algorithm for bin stretching
- The on-line multiprocessor scheduling problem with known sum of the tasks
- Recent Advances for a Classical Scheduling Problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- On-line bin-stretching
