Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
From MaRDI portal
Publication:398903
DOI10.1007/S10951-013-0326-0zbMATH Open1297.90041OpenAlexW2044543491MaRDI QIDQ398903FDOQ398903
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
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
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
- An optimal algorithm for preemptive on-line scheduling
- Bounds for List Schedules on Uniform Processors
- Randomized on-line scheduling on two uniform machines
- Title not available (Why is that?)
- On-line uniform machine scheduling with rejection
- Semi-online scheduling with decreasing job sizes
- 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
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- A lower bound for on-line scheduling on uniformly related machines
- A Level Algorithm for Preemptive Scheduling
- Semi-online preemptive scheduling: one algorithm for all variants
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
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)
