A system-centric metric for the evaluation of online job schedules

DOI10.1007/s10951-010-0206-9zbMath1280.90068OpenAlexW2069013317MaRDI QIDQ2434258

Uwe Schwiegelshohn

Publication date: 5 February 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-010-0206-9

zbMATH Keywords

competitive analysisjob schedulingonline schedulingnonclairvoyant scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters

Cites Work

• Unnamed Item
• Unnamed Item
• Fairness in parallel job scheduling
• On an on-line scheduling problem for parallel jobs
• Structure of a simple scheduling polyhedron
• Utilization of nonclairvoyant online schedules
• Server scheduling in the L _p norm
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm

This page was built for publication: A system-centric metric for the evaluation of online job schedules