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

DOI10.1007/S10114-005-0686-2MaRDI QIDQ2508575zbMATH OpenOpenAlexFDO

Authors Yong He, Hao Zhou, Yiwei Jiang

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)

Recommendations

• Semi-online algorithms for parallel machine scheduling problems
• SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
• Semi-online scheduling with known maximum job size on two uniform machines

Cites work

• scientific article; zbMATH DE number 2077624 (Why is no real title available?)
• scientific article; zbMATH DE number 1932350 (Why is no real title available?)
• scientific article; zbMATH DE number 1930822 (Why is no real title available?)
• Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• Preemptive machine covering on parallel machines
• Scheduling with deadlines and loss functions
• Semi on-line algorithms for the partition problem
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

Cited in

(5)

• Semi-online scheduling: a survey
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
• Algorithms and Computation
• Linear time algorithms for parallel machine scheduling
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines

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

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