Semi-online scheduling with known maximum job size on two uniform machines

DOI10.1007/S10878-009-9214-0MaRDI QIDQ613661zbMATH OpenOpenAlexFDO

Authors Qian Cao, Zhaohui Liu

Publication date 21 December 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9214-0

zbMATH Keywords

schedulingsemi-onlineuniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Semi-online scheduling on two uniform machines with the known largest size
• Semi-online scheduling with bounded job sizes on two uniform machines
• Two semi-online scheduling problems on two uniform machines
• Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

Cites work

• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
• A linear compound algorithm for uniform machine scheduling
• Bounds for LPT Schedules on Uniform Processors
• Bounds for List Schedules on Uniform Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Optimal non-preemptive semi-online scheduling on two related machines
• Randomized on-line scheduling on two uniform machines
• Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
• Semi-on-line scheduling with ordinal data on two uniform machines
• Semi-online scheduling with ``end of sequence information

Cited in

(17)

• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Semi-online scheduling with known partial information about job sizes on two identical machines
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
• A survey on makespan minimization in semi-online environments
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
• Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
• Semi-online scheduling with bounded job sizes on two uniform machines
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
• Preemptive semi-online algorithms for parallel machine scheduling with known total size
• Two semi-online scheduling problems on two uniform machines
• Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
• SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
• Semi-online machine covering on two uniform machines with known total size
• Semi-online scheduling problems on two uniform machines under a grade of service provision
• Semi-online scheduling on two uniform machines with the known largest size
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

This page was built for publication: Semi-online scheduling with known maximum job size on two uniform machines

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