An online algorithm for hierarchical scheduling on two identical machines with rejection

DOI10.15960/J.CNKI.ISSN.1007-6093.2018.03.012MaRDI QIDQ5197263zbMATH OpenFDO

Authors Xiao Min, Junlei Zhu, Jing Liu

Publication date 20 September 2019

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2018.03.012

zbMATH Keywords

competitive ratiohierarchyidentical machinesonline schedulingrejection

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel machine scheduling with hierarchical and rejection
• Online preemptive hierarchical scheduling on two uniform machines with rejection
• Parallel machine scheduling with service hierarchy and rejection
• Online parallel machines scheduling with two hierarchies
• Online hierarchical scheduling on two uniform machines with bounded job sizes

Cited in

(6)

• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Online preemptive hierarchical scheduling on two uniform machines with rejection
• Parallel machine scheduling with hierarchical and rejection
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Parallel machine scheduling with service hierarchy and rejection

This page was built for publication: An online algorithm for hierarchical scheduling on two identical machines with rejection

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