Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

DOI10.1007/S10951-013-0326-0MaRDI QIDQ398903zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Hanan Zebedat-Haider

Publication date 18 August 2014

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-013-0326-0

zbMATH Keywords

online schedulingpreemptive schedulingspeed ratiouniformly related machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Semi on-line preemptive scheduling on two uniform machines with rejection
• Preemptive semi-on-line scheduling on two identical machines with rejection
• A special case of on-line scheduling on two uniformly machines with rejection
• On-line scheduling of unit time jobs with rejection on uniform machines

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• A Level Algorithm for Preemptive Scheduling
• A lower bound for on-line scheduling on uniformly related machines
• An optimal algorithm for preemptive on-line scheduling
• Bounds for List Schedules on Uniform Processors
• Multiprocessor Scheduling with Rejection
• On-line uniform machine scheduling with rejection
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Preemptive multiprocessor scheduling with rejection
• Preemptive on-line scheduling for two uniform processors
• Preemptive online scheduling: Optimal algorithms for all speeds
• Randomized on-line scheduling on two uniform machines
• Semi-online preemptive scheduling: one algorithm for all variants
• Semi-online scheduling with decreasing job sizes

Cited in

(7)

• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Online preemptive hierarchical scheduling on two uniform machines with rejection
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Preemptive scheduling with rejection
• Online scheduling of unit jobs on three machines with rejection: a tight result
• Non-preemptive flow-time minimization via rejections
• Rejecting jobs to minimize load and maximum flow-time

This page was built for publication: Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

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