Semi-online scheduling on two uniform machines with the known largest size

DOI10.1007/s10878-009-9254-5zbMath1319.90029OpenAlexW2029751005MaRDI QIDQ491206

Sheng-Yi Cai, Qi-Fan Yang

Publication date: 24 August 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9254-5

zbMATH Keywords

analysis of algorithmscompetitive ratiouniform machinessemi-online scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (3)

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision

Cites Work

• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Two semi-online scheduling problems on two uniform machines
• Semi on-line algorithms for the partition problem
• Preemptive on-line scheduling for two uniform processors
• Bin stretching revisited
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Semi-online scheduling with ``end of sequence information
• Semi-online scheduling on two uniform processors
• Bounds for List Schedules on Uniform Processors
• Optimal non-preemptive semi-online scheduling on two related machines
• Randomized on-line scheduling on two uniform machines

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