Optimal preemptive scheduling on a fixed number of identical parallel machines
From MaRDI portal
Publication:2488216
DOI10.1016/j.orl.2004.06.002zbMath1099.90022OpenAlexW2078653236MaRDI QIDQ2488216
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.06.002
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (6)
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Linear programming based algorithms for preemptive and non-preemptive RCPSP ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Preemptive scheduling and antichain polyhedra ⋮ A polynomial algorithm for recognizing the \(\mathcal A\)-order class
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- Preemptive scheduling of interval orders is polynomial
- A relation between multiprocessor scheduling and linear programming
- Optimal scheduling on parallel machines for a new order class
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Review of properties of different precedence graphs for scheduling problems
- Scheduling Interval-Ordered Tasks
- A New Algorithm for Preemptive Scheduling of Trees
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Optimal Preemptive Scheduling on Two-Processor Systems
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
This page was built for publication: Optimal preemptive scheduling on a fixed number of identical parallel machines
