Machine covering in the random-order model
From MaRDI portal
Publication:6103518
DOI10.1007/S00453-022-01011-0arXiv2110.09161OpenAlexW3206545831MaRDI QIDQ6103518
Waldo Gálvez, Maximilian Janke, Susanne Albers
Publication date: 5 June 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09161
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List's worst-average-case or WAC ratio
- New algorithms for an ancient scheduling problem.
- A better lower bound for on-line scheduling
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A survey on makespan minimization in semi-online environments
- Best fit bin packing with random order revisited
- Improved online algorithms for Knapsack and GAP in the random order model
- The Santa Claus problem
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- Online Appointment Scheduling in the Random Order Model
- A Knapsack Secretary Problem with Applications
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Primal Beats Dual on Online Packing LPs in the Random-Order Model
- Online and Random-order Load Balancing Simultaneously
- Matroid Secretary Problems
- A Better Algorithm for an Ancient Scheduling Problem
- Random-Order Models
- Algorithms with Predictions
- Online Scheduling via Learned Weights
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- Bounds for Certain Multiprocessing Anomalies
- Dynamic Programming and Decision Theory
- Symmetry Exploitation for Online Machine Covering with Bounded Migration
- Max-min Online Allocations with a Reordering Buffer
- Approximation and Online Algorithms
- On-line machine covering
This page was built for publication: Machine covering in the random-order model
