Semi-online scheduling on two identical machines with rejection

DOI10.1007/S10878-011-9435-XMaRDI QIDQ385491zbMATHOpenAlexFDO

Authors Xiao Min, Yuqing Wang, Min Jiang, Jing Liu

Publication date 2 December 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-011-9435-x

zbMATH Keywords

competitive ratiorejectionsemi-online schedulingbufferreassignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Semi on-line scheduling on two identical machines with rejection
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines
• Preemptive semi-on-line scheduling on two identical machines with rejection
• Semi on-line preemptive scheduling on two uniform machines with rejection
• A semi-online algorithm for single machine scheduling with rejection

Cites work

• scientific article; zbMATH DE number 2077624 (Why is no real title available?)
• scientific article; zbMATH DE number 1930822 (Why is no real title available?)
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Multiprocessor Scheduling with Rejection
• On-line uniform machine scheduling with rejection
• Online scheduling with reassignment
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Preemptive scheduling with rejection

Cited in

(10)

• Preemptive semi-on-line scheduling on two identical machines with rejection
• scientific article; zbMATH DE number 6671683 (Why is no real title available?)
• Online scheduling of unit jobs on three machines with rejection: a tight result
• Semi on-line scheduling on two identical machines with rejection
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines
• A semi-online algorithm for single machine scheduling with rejection

This page was built for publication: Semi-online 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 Q385491)