Online scheduling with rejection and withdrawal
DOI10.1016/J.TCS.2011.08.031zbMATH Open1227.68019OpenAlexW2057203675MaRDI QIDQ650898FDOQ650898
Authors: 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
Recommendations
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
- Scheduling with rejection and non-identical job arrivals
- Online scheduling with machine cost and rejection
- A survey on job scheduling with rejection
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- Online algorithms. The state of the art
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Bounds for Certain Multiprocessing Anomalies
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- Online scheduling with reassignment
- The Santa Claus problem
- Randomized on-line scheduling on two uniform machines
- On-line uniform machine scheduling with rejection
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Online scheduling on two uniform machines to minimize the makespan
- Better Bounds for Online Scheduling
- New lower and upper bounds for on-line scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- On-Line Load Balancing for Related Machines
- Title not available (Why is that?)
- Tight bounds for bandwidth allocation on two links
- Online scheduling with rearrangement on two related machines
- Online scheduling with reassignment on two uniform machines
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
Cited In (8)
- A survey on offline scheduling with rejection
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Leasing with uncertainty
- Online scheduling with reassignment
- Online scheduling of unit jobs on three machines with rejection: a tight result
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
- Rent or buy problems with a fixed time horizon
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
This page was built for publication: Online scheduling with rejection and withdrawal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650898)
