Non-Clairvoyant Precedence Constrained Scheduling.

DOI10.4230/LIPIcs.ICALP.2019.63OpenAlexW2965922709MaRDI QIDQ5091220

Anupam Gupta, Amit Kumar, Sahil Singla, Naveen Garg

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1905.02133

zbMATH Keywords

schedulingonline algorithmsprimal-dual analysisNash welfare

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonclairvoyant scheduling
• Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
• The Bargaining Problem
• Competitive Algorithms from Competitive Equilibria
• Scalably scheduling processes with arbitrary speedup curves
• Towards Tight Lower Bounds for Scheduling Problems
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Speed is as powerful as clairvoyance
• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.
• Bounds for Certain Multiprocessing Anomalies
• Scheduling in the dark

This page was built for publication: Non-Clairvoyant Precedence Constrained Scheduling.