A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm

DOI10.1007/978-3-540-69733-6_65zbMath1148.90325OpenAlexW1580125762MaRDI QIDQ3511378

Tianping Shuai, Dong-lei Du

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_65

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• An optimal algorithm for preemptive on-line scheduling
• A lower bound for on-line scheduling on uniformly related machines
• Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors
• Load balancing of temporary tasks in the \(\ell _{p}\) norm
• Optimal preemptive scheduling for general target functions
• Scheduling with Deadlines and Loss Functions
• All-Norm Approximation Algorithms
• Convex programming for scheduling unrelated parallel machines
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Algorithm Theory - SWAT 2004
• Preemptive Online Scheduling: Optimal Algorithms for All Speeds
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm