Preemptive scheduling of equal-length jobs to maximize weighted throughput.
From MaRDI portal
Publication:1426730
DOI10.1016/j.orl.2003.09.004zbMath1045.90026arXivcs/0209033OpenAlexW2015429079MaRDI QIDQ1426730
Christoph Dürr, Marek Chrobak, Nodari Vakhania, Wojciech Jawor, Philippe Baptiste
Publication date: 15 March 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0209033
Related Items (9)
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Preemptive scheduling of equal-length jobs in polynomial time ⋮ Parallel machine problems with equal processing times: a survey ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ A decomposition scheme for single stage scheduling problems ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
This page was built for publication: Preemptive scheduling of equal-length jobs to maximize weighted throughput.
