Scheduling In the random-order model
From MaRDI portal
Publication:1979454
DOI10.1007/s00453-021-00841-8OpenAlexW3167755729MaRDI QIDQ1979454
Maximilian Janke, Susanne Albers
Publication date: 2 September 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.00386
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for randomized on-line multiprocessor scheduling
- Semi-on-line multiprocessor scheduling with given total processing time
- List's worst-average-case or WAC ratio
- New algorithms for an ancient scheduling problem.
- Semi on-line algorithms for the partition problem
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- On-line scheduling revisited
- An efficient algorithm for bin stretching
- Online Scheduling with Bounded Migration
- The Power of Reordering for Online Minimum Makespan Scheduling
- Online Appointment Scheduling in the Random Order Model
- A Knapsack Secretary Problem with Applications
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Online and Random-order Load Balancing Simultaneously
- Matroid Secretary Problems
- Improved Bounds for the Online Scheduling Problem
- A Better Algorithm for an Ancient Scheduling Problem
- Online Makespan Scheduling with Sublinear Advice
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
- Primal beats dual on online packing LPs in the random-order model
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Scheduling In the random-order model
