Randomized algorithms for that ancient scheduling problem

DOI10.1007/3-540-63307-3_61MaRDI QIDQ5096939zbMATH OpenOpenAlexFDO

Authors S. S. 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

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

Recommendations

• New algorithms for an ancient scheduling problem.
• A lower bound for randomized on-line scheduling algorithms
• Randomized On-line Scheduling of Parallel Jobs
• Randomized on-line scheduling on three processors.
• Online randomized multiprocessor scheduling

Cites work

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 1003243 (Why is no real title available?)
• scientific article; zbMATH DE number 1559597 (Why is no real title available?)
• A Better Algorithm for an Ancient Scheduling Problem
• A better lower bound for on-line scheduling
• A lower bound for randomized on-line scheduling algorithms
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Bounds for Certain Multiprocessing Anomalies
• New algorithms for an ancient scheduling problem.
• New lower and upper bounds for on-line scheduling

Cited in

(16)

• Optimal randomized scheduling by replacement
• Semi-online scheduling with decreasing job sizes
• A manifesto for the computational method
• Competitive ratio of list scheduling on uniform machines and randomized heuristics
• Randomized On-line Scheduling of Parallel Jobs
• Barely random algorithms for multiprocessor scheduling
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• Preemptive multiprocessor scheduling with rejection
• New algorithms for an ancient scheduling problem.
• Approximation and Online Algorithms
• A lower bound for randomized on-line scheduling algorithms
• Randomized on-line scheduling on three processors.
• An optimal online algorithm for scheduling two machines with release times
• scientific article; zbMATH DE number 1617257 (Why is no real title available?)
• Online randomized multiprocessor scheduling
• scientific article; zbMATH DE number 5629900 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096939)