Non-clairvoyantly scheduling to minimize convex functions

DOI10.1007/s00453-019-00597-2zbMath1430.90262OpenAlexW2953196173WikidataQ127673110 ScholiaQ127673110MaRDI QIDQ2319644

Sungjin Im, Kyle Fox, Benjamin Moseley, Janardhan Kulkarni

Publication date: 20 August 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00597-2

zbMATH Keywords

scheduling theorycompetitive analysisonline algorithms

Mathematics Subject Classification ID

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

Related Items (1)

A best possible online algorithm for minimizing the total completion time and the total soft penalty cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online weighted flow time and deadline scheduling
• Minimizing total flow time and total completion time with immediate dispatching
• Greedy multiprocessor server scheduling
• Approximating total flow time on parallel machines
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Minimizing the Flow Time Without Migration
• Scalably scheduling processes with arbitrary speedup curves
• A unified approach to scheduling on unrelated parallel machines
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Speed is as powerful as clairvoyance
• Fair Scheduling via Iterative Quasi-Uniform Sampling
• All-norm approximation algorithms
• Better Scalable Algorithms for Broadcast Scheduling
• The Geometry of Scheduling
• Algorithms for minimizing weighted flow time
• Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Non-clairvoyantly scheduling to minimize convex functions