On the value of job migration in online makespan minimization
From MaRDI portal
Publication:2408930
DOI10.1007/s00453-016-0209-9zbMath1372.68039arXiv1111.0773OpenAlexW2516478317MaRDI QIDQ2408930
Matthias Hellwig, Susanne Albers
Publication date: 10 October 2017
Published in: Algorithmica, Algorithms – ESA 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0773
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
A survey on makespan minimization in semi-online environments, Online makespan minimization with parallel schedules, Semi-online scheduling: a survey, Parallel solutions for preemptive makespan scheduling on two identical machines, Station assignment with reallocation, Online Makespan Scheduling with Job Migration on Uniform Machines, Online makespan scheduling with job migration on uniform machines, Online scheduling with migration on two hierarchical machines
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for randomized on-line multiprocessor scheduling
- Online scheduling with reassignment
- New algorithms for an ancient scheduling problem.
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- On-line scheduling revisited
- An optimal algorithm for preemptive on-line scheduling
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
- Online Scheduling with Bounded Migration
- The Power of Reordering for Online Minimum Makespan Scheduling
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- A Better Algorithm for an Ancient Scheduling Problem
- The load rebalancing problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
