Semi-online scheduling with bounded job sizes on two uniform machines
From MaRDI portal
Publication:338376
DOI10.1016/j.tcs.2016.08.022zbMath1356.90052OpenAlexW2512747565MaRDI QIDQ338376
Publication date: 4 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.022
Related Items
Cites Work
- Semi-online scheduling with known maximum job size on two uniform machines
- Optimal preemptive semi-online scheduling on two uniform processors
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- The optimal on-line parallel machine scheduling
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Bounds for List Schedules on Uniform Processors
- Bounds on Schedules for Independent Tasks with Similar Execution Times
- Bounds for LPT Schedules on Uniform Processors
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
- Optimal non-preemptive semi-online scheduling on two related machines
- Randomized on-line scheduling on two uniform machines