The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
From MaRDI portal
Publication:5891554
DOI10.1287/moor.1110.0520zbMath1238.90062OpenAlexW1987536045WikidataQ65553903 ScholiaQ65553903MaRDI QIDQ5891554
José R. Correa, Martin Skutella, José Verschae
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/138162
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (17)
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines ⋮ Scheduling maintenance jobs in networks ⋮ Schedules with a single preemption on uniform parallel machines ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines ⋮ Splitting versus setup trade-offs for scheduling to minimize weighted completion time ⋮ The benefit of preemption for single machine scheduling so as to minimize total weighted completion time ⋮ Parallel machine covering with limited number of preemptions ⋮ Robust algorithms for preemptive scheduling ⋮ On the configuration-LP for scheduling on unrelated machines ⋮ Task assignment algorithms for two-type heterogeneous multiprocessors ⋮ Real-time scheduling with resource sharing on heterogeneous multiprocessors ⋮ Algorithms with limited number of preemptions for scheduling on parallel machines ⋮ Algorithms for hierarchical and semi-partitioned parallel scheduling ⋮ Scheduling MapReduce jobs on identical and unrelated processors ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Preemptive and non-preemptive scheduling on two unrelated parallel machines
This page was built for publication: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
