Online scheduling with migration on two hierarchical machines

DOI10.1007/s10878-022-00906-6zbMath1505.90050OpenAlexW4297052981WikidataQ114225841 ScholiaQ114225841MaRDI QIDQ2091110

Leah Epstein, Islam Akaria

Publication date: 31 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00906-6

zbMATH Keywords

competitive ratiomigration factorhierarchical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Bin stretching with migration on two hierarchical machines

Cites Work

• Robust algorithms for preemptive scheduling
• Online hierarchical scheduling: an approach using mathematical programming
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Optimal algorithms for online scheduling with bounded rearrangement at the end
• Improved bounds for online scheduling with eligibility constraints
• Online parallel machines scheduling with two hierarchies
• Online and semi-online scheduling of two machines under a grade of service provision
• Semi-online hierarchical load balancing problem with bounded processing times
• Online scheduling on parallel machines with two goS levels
• A robust APTAS for the classical bin packing problem
• On-line algorithms for the channel assignment problem in cellular networks.
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Robust algorithms for total completion time
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
• Fully dynamic bin packing revisited
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• On the value of job migration in online makespan minimization
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• On-Line Load Balancing in a Hierarchical Server Topology
• Online Scheduling with Bounded Migration
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• The Competitiveness of On-Line Assignments
• Symmetry exploitation for online machine covering with bounded migration
• Optimal algorithm for semi-online scheduling on two machines under GoS levels

This page was built for publication: Online scheduling with migration on two hierarchical machines