Randomized algorithms for that ancient scheduling problem

DOI10.1007/3-540-63307-3_61zbMath1497.68581OpenAlexW1802738979MaRDI QIDQ5096939

Steve Seiden

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_61

Mathematics Subject Classification ID

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

Related Items (3)

Semi-online scheduling with decreasing job sizes ⋮ Preemptive multiprocessor scheduling with rejection ⋮ An optimal online algorithm for scheduling two machines with release times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New algorithms for an ancient scheduling problem.
• A better lower bound for on-line scheduling
• A lower bound for randomized on-line scheduling algorithms
• New lower and upper bounds for on-line scheduling
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• A Better Algorithm for an Ancient Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Randomized algorithms for that ancient scheduling problem