Maximizing job completions online

DOI10.1016/S0196-6774(03)00074-9zbMath1064.68024OpenAlexW2080158054MaRDI QIDQ4820905

Bala Kalyanasundaram, Kirk R. Pruhs

Publication date: 1 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00074-9

zbMATH Keywords

competitive analysisreal-time schedulingresource augmentation analysis

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (16)

Scheduling Multipacket Frames with Frame Deadlines ⋮ A competitive algorithm for throughput maximization on identical machines ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ On-line scheduling with tight deadlines. ⋮ Scheduling multipacket frames with frame deadlines ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Minimizing the maximum starting time on-line ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ How to whack moles ⋮ A competitive algorithm for throughput maximization on identical machines ⋮ A general framework for handling commitment in online throughput maximization ⋮ Maximizing the number of rides served for time-limited Dial-a-Ride* ⋮ Online knapsack revisited

This page was built for publication: Maximizing job completions online