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

DOI10.1007/s10951-013-0326-0zbMath1297.90041MaRDI QIDQ398903

Hanan Zebedat-Haider, Leah Epstein

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

preemptive scheduling; online scheduling; speed ratio; uniformly related machines

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Non-Preemptive Flow-Time Minimization via Rejections, Online scheduling of unit jobs on three machines with rejection: a tight result, Approximation algorithms for precedence-constrained identical machine scheduling with rejection, Rejecting jobs to minimize load and maximum flow-time

Cites Work

• Unnamed Item
• Semi-online preemptive scheduling: one algorithm for all variants
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Preemptive online scheduling: Optimal algorithms for all speeds
• Preemptive on-line scheduling for two uniform processors
• On-line uniform machine scheduling with rejection
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• An optimal algorithm for preemptive on-line scheduling
• A lower bound for on-line scheduling on uniformly related machines
• Bounds for List Schedules on Uniform Processors
• A Level Algorithm for Preemptive Scheduling
• Multiprocessor Scheduling with Rejection
• Semi-online scheduling with decreasing job sizes
• Randomized on-line scheduling on two uniform machines
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
• Preemptive multiprocessor scheduling with rejection