Online scheduling with migration on two hierarchical machines
type: Item
instance of: scholarly article
title: Online scheduling with migration on two hierarchical machines
zbMATH Open document ID: 1505.90050
author: Islam Akaria
author: Leah Epstein
published in: Journal of Combinatorial Optimization
publication date: 2022-10-31T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7610140
zbMATH Keywords: hierarchical machines
zbMATH Keywords: competitive ratio
zbMATH Keywords: migration factor
Wikidata QID: Q114225841
MaRDI profile type: Publication
full work available at URL: s10878-022-00906-6
OpenAlex ID: W4297052981
cites work: On the value of job migration in online makespan minimization
cites work: The Competitiveness of On-Line Assignments
cites work: On-line load balancing in a hierarchical server topology
cites work: Fully dynamic bin packing revisited
cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end
cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements
cites work: On-line algorithms for the channel assignment problem in cellular networks.
cites work: A robust APTAS for the classical bin packing problem
cites work: Robust algorithms for preemptive scheduling
cites work: Robust algorithms for total completion time
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: Symmetry exploitation for online machine covering with bounded migration
cites work: Online scheduling on parallel machines with two goS levels
cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service
cites work: Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
cites work: Improved bounds for online scheduling with eligibility constraints
cites work: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
cites work: Semi-online hierarchical load balancing problem with bounded processing times
cites work: Optimal algorithm for semi-online scheduling on two machines under GoS levels
cites work: Online and semi-online scheduling of two machines under a grade of service provision
cites work: Online Scheduling with Bounded Migration
cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
cites work: Online hierarchical scheduling: an approach using mathematical programming
cites work: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
cites work: Online parallel machines scheduling with two hierarchies
DOI: 10.1007/S10878-022-00906-6
description: scientific article; zbMATH DE number 7610140