Online makespan scheduling with job migration on uniform machines
type: Item
instance of: scholarly article
title: Online makespan scheduling with job migration on uniform machines
author: Matthias Englert
author: David Mezlaf
author: Matthias Westermann
published in: Algorithmica
publication date: 2022-01-18T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7458811
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: minimum makespan scheduling
zbMATH Keywords: job migration
MaRDI profile type: Publication
full work available at URL: s00453-021-00852-5
OpenAlex ID: W3193491322
cites work: Better Bounds for Online Scheduling
cites work: On the value of job migration in online makespan minimization
cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling
cites work: New algorithms for an ancient scheduling problem.
cites work: A better lower bound for on-line scheduling
cites work: On-Line Load Balancing for Related Machines
cites work: New lower and upper bounds for on-line scheduling
cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end
cites work: Online minimum makespan scheduling with a buffer
cites work: Online scheduling with a buffer on related machines
cites work: Preemptive Online Scheduling with Reordering
cites work: Online scheduling with rearrangement on two related machines
cites work: A lower bound on deterministic online algorithms for scheduling on related machines without preemption
cites work: The Power of Reordering for Online Minimum Makespan Scheduling
cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines
cites work: Max-min Online Allocations with a Reordering Buffer
cites work: Q3031924
cites work: On-line scheduling revisited
cites work: Tighter Bounds for LPT Scheduling on Uniform Processors
cites work: Q4198056
cites work: Q4952670
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: A Better Algorithm for an Ancient Scheduling Problem
cites work: Semi on-line algorithms for the partition problem
cites work: Online scheduling on two uniform machines to minimize the makespan
cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
cites work: Q4821818
cites work: Improved Bounds for the Online Scheduling Problem
cites work: Online Scheduling with Bounded Migration
cites work: Online scheduling with reassignment
cites work: Online scheduling with one rearrangement at the end: revisited
DOI: 10.1007/S00453-021-00852-5
Recommended article: Online Makespan Scheduling with Job Migration on Uniform Machines
Recommended article: A new algorithm for online uniform-machine scheduling to minimize the makespan
Recommended article: Online scheduling on two uniform machines to minimize the makespan
Recommended article: Online scheduling on unbounded parallel-batch machines to minimize the makespan
Recommended article: Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
Recommended article: A parametric scheme for online uniform-machine scheduling to minimize the makespan
Recommended article: Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
Recommended article: Online scheduling with migration on two hierarchical machines
Recommended article: On-line preemptive scheduling on uniform machines
Recommended article: Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
description: scientific article; zbMATH DE number 7458811