Optimal preemptive scheduling for general target functions

DOI10.1016/J.JCSS.2005.08.002MaRDI QIDQ2581760zbMATH OpenOpenAlexFDO

Authors 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

Mathematical programmingOptimizationPreemptive schedulingScheduling

Mathematics Subject Classification ID

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

Recommendations

• Mathematical Foundations of Computer Science 2004
• Preemptive Online Scheduling: Optimal Algorithms for All Speeds
• Preemptive online scheduling: Optimal algorithms for all speeds
• Optimal and online preemptive scheduling on uniformly related machines
• scientific article; zbMATH DE number 1688367

Cites work

• A 13/12 approximation algorithm for bin packing with extendable bins
• A Level Algorithm for Preemptive Scheduling
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Approximation algorithms for extensible bin packing
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• Approximation schemes for scheduling on parallel machines
• Convex separable optimization is not much harder than linear optimization
• scientific article; zbMATH DE number 1947446 (Why is no real title available?)
• scientific article; zbMATH DE number 1405790 (Why is no real title available?)
• Preemptive Scheduling of Uniform Processor Systems

Cited in

(9)

• 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
• 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
• Mathematical Foundations of Computer Science 2004
• Preemptive Scheduling on Selfish Machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581760)