Optimal preemptive scheduling for general target functions

DOI10.1016/j.jcss.2005.08.002zbMath1105.68009OpenAlexW2045822042MaRDI QIDQ2581760

Leah Epstein, Tamir Tassa

Publication date: 10 January 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.08.002

zbMATH Keywords

OptimizationMathematical programmingSchedulingPreemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ Robust algorithms for preemptive scheduling ⋮ Preemptive Scheduling on Selfish Machines ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• Approximation schemes for scheduling on parallel machines
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: Optimal preemptive scheduling for general target functions