Online scheduling with rejection and reordering: exact algorithms for unit size jobs
From MaRDI portal
Publication:489737
Recommendations
Cites work
- scientific article; zbMATH DE number 5764829 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- A Better Algorithm for an Ancient Scheduling Problem
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
- Approximation and Online Algorithms
- Approximation schemes for scheduling on parallel machines
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Better Bounds for Online Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Max-min online allocations with a reordering buffer
- Multiprocessor Scheduling with Rejection
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- On-line machine covering
- On-line scheduling revisited
- On-line uniform machine scheduling with rejection
- Online minimum makespan scheduling with a buffer
- Online scheduling with a buffer on related machines
- Online scheduling with rejection and withdrawal
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Preemptive multiprocessor scheduling with rejection
- Preemptive online scheduling with reordering
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Semi on-line algorithms for the partition problem
- Semi-online algorithms for parallel machine scheduling problems
- The Power of Reordering for Online Minimum Makespan Scheduling
- The Santa Claus problem
- Tight bounds for bandwidth allocation on two links
Cited in
(6)- Erratum to: ``A survey on offline scheduling with rejection
- Rent or buy problems with a fixed time horizon
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Single machine lot scheduling with optional job-rejection
- The Power of Reordering for Online Minimum Makespan Scheduling
This page was built for publication: Online scheduling with rejection and reordering: exact algorithms for unit size jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489737)
