Preemptive and non-preemptive scheduling on two unrelated parallel machines
From MaRDI portal
Publication:2093189
DOI10.1007/s10951-022-00753-7zbMath1501.90034OpenAlexW4296962586MaRDI QIDQ2093189
Vitaly A. Strusevich, Alan J. Soper
Publication date: 4 November 2022
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00753-7
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Approximability of average completion time scheduling on unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- An approximation algorithm for the generalized assignment problem
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
- A comment on scheduling on uniform machines under chain-type precedence constraints
- Algorithms with limited number of preemptions for scheduling on parallel machines
- Single parameter analysis of power of preemption on two and three uniform machines
- Schedules with a single preemption on uniform parallel machines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling with Deadlines and Loss Functions
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
- Power of Preemption on Uniform Parallel Machines
- Optimal Preemptive Scheduling of Two Unrelated Processors
- Preemptive Scheduling of Uniform Processor Systems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Parallel Processor Scheduling with Limited Number of Preemptions
- Parallel Machine Scheduling: Impact of Adding Extra Machines
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders