Bin stretching with migration on two hierarchical machines

DOI10.1007/s00186-023-00830-3arXiv2206.06102OpenAlexW4384823759MaRDI QIDQ6093406

Islam Akaria, Leah Epstein

Publication date: 6 September 2023

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.06102

zbMATH Keywords

competitive ratiosemi-online schedulingmigration factorhierarchical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Semi-online scheduling problems on a small number of machines
• Semi-online scheduling revisited
• Robust algorithms for preemptive scheduling
• Online bin stretching with bunch techniques
• Semi-on-line multiprocessor scheduling with given total processing time
• Online hierarchical scheduling: an approach using mathematical programming
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• 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
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
• Online scheduling on parallel machines with two goS levels
• A robust APTAS for the classical bin packing problem
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bin stretching revisited
• On-line algorithms for the channel assignment problem in cellular networks.
• A two-phase algorithm for bin stretching with stretching factor 1.5
• Online bin stretching with three bins
• Semi-on-line problems on two identical machines with combined partial information
• Semi-online algorithms for parallel machine scheduling problems
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
• Robust algorithms for total completion time
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
• Online scheduling with migration on two hierarchical machines
• Fully dynamic bin packing revisited
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• Improved lower bounds for the online bin stretching problem
• An efficient algorithm for bin stretching
• The on-line multiprocessor scheduling problem with known sum of the tasks
• 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
• Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Bounds for Certain Multiprocessing Anomalies
• Symmetry Exploitation for Online Machine Covering with Bounded Migration
• Randomized on-line scheduling on two uniform machines
• On-line bin-stretching
• Optimal algorithm for semi-online scheduling on two machines under GoS levels

This page was built for publication: Bin stretching with migration on two hierarchical machines