Online scheduling with rejection and withdrawal
From MaRDI portal
Publication:650898
DOI10.1016/j.tcs.2011.08.031zbMath1227.68019MaRDI QIDQ650898
Leah Epstein, Hanan Zebedat-Haider
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.031
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W27: Online algorithms; streaming algorithms
Related Items
Leasing with Uncertainty, TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Online scheduling of unit jobs on three machines with rejection: a tight result, Approximation algorithms for precedence-constrained identical machine scheduling with rejection, Rent or buy problems with a fixed time horizon
Cites Work
- Unnamed Item
- Unnamed Item
- Online scheduling with rearrangement on two related machines
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Online scheduling with reassignment
- New algorithms for an ancient scheduling problem.
- Online scheduling with reassignment on two uniform machines
- Online scheduling on two uniform machines to minimize the makespan
- Online algorithms. The state of the art
- On-line uniform machine scheduling with rejection
- On-line scheduling revisited
- New lower and upper bounds for on-line scheduling
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
- Tight bounds for bandwidth allocation on two links
- The Santa Claus problem
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Multiprocessor Scheduling with Rejection
- On-Line Load Balancing for Related Machines
- Bounds for Certain Multiprocessing Anomalies
- Randomized on-line scheduling on two uniform machines
- Preemptive multiprocessor scheduling with rejection
