Minimizing the maximum starting time on-line

DOI10.1016/J.IC.2004.09.001zbMath1101.68439OpenAlexW2046052133MaRDI QIDQ1763375

Leah Epstein, Rob van Stee

Publication date: 22 February 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.09.001

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General topics in the theory of software (68N01)

Related Items (3)

Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ Online minimization of the maximum starting time: migration helps ⋮ Starting time minimization for the maximum job variant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New algorithms for an ancient scheduling problem.
• Resource augmentation in load balancing.
• Applying extra-resource analysis to load balancing.
• On-line scheduling revisited
• Better Bounds for Online Scheduling
• Maximizing job completions online
• A Better Algorithm for an Ancient Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies
• Scheduling in the dark
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Minimizing the maximum starting time on-line