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

DOI10.1016/J.TCS.2016.08.022MaRDI QIDQ338376zbMATH OpenOpenAlexFDO

Authors 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

schedulingbounded job sizessemi-onlineuniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Semi-online scheduling with known maximum job size on two uniform machines
• Semi-online scheduling on two uniform machines with the known largest size
• Two semi-online scheduling problems on two uniform machines
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Semi-online scheduling on two uniform processors

Cites work

• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
• Bin stretching revisited
• Bounds for LPT Schedules on Uniform Processors
• Bounds for List Schedules on Uniform Processors
• Bounds on Schedules for Independent Tasks with Similar Execution Times
• Optimal non-preemptive semi-online scheduling on two related machines
• Optimal preemptive semi-online scheduling on two uniform processors
• Randomized on-line scheduling on two uniform machines
• Semi on-line scheduling on two identical machines
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
• Semi-online scheduling with ``end of sequence information
• Semi-online scheduling with known maximum job size on two uniform machines
• The optimal on-line parallel machine scheduling
• Two semi-online scheduling problems on two uniform machines

Cited in

(9)

• A survey on makespan minimization in semi-online environments
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
• Semi-online scheduling on two uniform machines with the known largest size
• Semi-online scheduling problems on two uniform machines under a grade of service provision
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
• Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
• Semi-online scheduling with known maximum job size on two uniform machines
• scientific article; zbMATH DE number 1929942 (Why is no real title available?)
• Semi-online scheduling: a survey

This page was built for publication: Semi-online scheduling with bounded job sizes on two uniform machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338376)