Online preemptive hierarchical scheduling on two uniform machines with rejection

MaRDI QIDQ2948894zbMATH OpenFDO

Authors Xiao Min, Jing Liu, Yanxia Dong, Ming Jiang

Publication date 6 October 2015

zbMATH Keywords

hierarchypreemptionschedulingrejectionuniform machines

Mathematics Subject Classification ID

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

Recommendations

• An online algorithm for hierarchical scheduling on two identical machines with rejection
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Parallel machine scheduling with hierarchical and rejection
• A special case of on-line scheduling on two uniformly machines with rejection
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

Cited in

(5)

• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Parallel machine scheduling with service hierarchy and rejection
• An online algorithm for hierarchical scheduling on two identical machines with rejection
• Parallel machine scheduling with hierarchical and rejection

This page was built for publication: Online preemptive hierarchical scheduling on two uniform machines with rejection

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