Preemptive online algorithms for scheduling on three machines with hierarchies

MaRDI QIDQ4980800zbMATH OpenFDO

Authors Ran Yao, Guang-Ting Chen, An Zhang, Yong Chen

Publication date 30 June 2014

zbMATH Keywords

competitive ratiohierarchyonline schedulingpreemptive

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive scheduling on a small number of hierarchical machines
• Online parallel machines scheduling with two hierarchies
• Optimal online algorithms for hierarchical scheduling on three parallel machines
• Online scheduling on uniform machines with two hierarchies
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

Cited in

(3)

• Task splitting for three machine preemptive scheduling
• scientific article; zbMATH DE number 6671683 (Why is no real title available?)
• Online scheduling on three uniform machines

This page was built for publication: Preemptive online algorithms for scheduling on three machines with hierarchies

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