Online scheduling with rejection and reordering: exact algorithms for unit size jobs
From MaRDI portal
Publication:489737
DOI10.1007/s10878-012-9593-5zbMath1307.90069OpenAlexW1999669591MaRDI QIDQ489737
Leah Epstein, Hanan Zebedat-Haider
Publication date: 21 January 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9593-5
Related Items (3)
Online scheduling of unit jobs on three machines with rejection: a tight result ⋮ Single machine lot scheduling with optional job-rejection ⋮ Rent or buy problems with a fixed time horizon
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Online scheduling with rejection and withdrawal
- Online scheduling with a buffer on related machines
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- New algorithms for an ancient scheduling problem.
- Semi on-line algorithms for the partition problem
- Approximation schemes for scheduling on parallel machines
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- On-line uniform machine scheduling with rejection
- On-line scheduling revisited
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Semi-online algorithms for parallel machine scheduling problems
- New lower and upper bounds for on-line scheduling
- Tight bounds for bandwidth allocation on two links
- Online Minimum Makespan Scheduling with a Buffer
- The Santa Claus problem
- The Power of Reordering for Online Minimum Makespan Scheduling
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Multiprocessor Scheduling with Rejection
- Bounds for Certain Multiprocessing Anomalies
- Preemptive Online Scheduling with Reordering
- Max-min Online Allocations with a Reordering Buffer
- Approximation and Online Algorithms
- On-line machine covering
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Online scheduling with rejection and reordering: exact algorithms for unit size jobs
