Preemptive semi-online algorithms for parallel machine scheduling with known total size

DOI10.1007/S10114-005-0686-2zbMath1130.90327OpenAlexW2031803346MaRDI QIDQ2508575

Yiwei Jiang, Hao Zhou, Yong He

Publication date: 13 October 2006

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0686-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Linear time algorithms for parallel machine scheduling ⋮ Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ Semi-online scheduling: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• Semi on-line algorithms for the partition problem
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Preemptive machine covering on parallel machines
• Scheduling with Deadlines and Loss Functions
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

This page was built for publication: Preemptive semi-online algorithms for parallel machine scheduling with known total size