Semi-online scheduling with bounded job sizes on two uniform machines

DOI10.1016/j.tcs.2016.08.022zbMath1356.90052OpenAlexW2512747565MaRDI QIDQ338376

Qian Cao, Zhaohui Liu

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

zbMATH Keywords

schedulinguniform machinessemi-onlinebounded job sizes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on makespan minimization in semi-online environments, Semi-online scheduling: a survey

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