Online minimization of the maximum starting time: migration helps

DOI10.1007/S00453-023-01097-0OpenAlexW4318069711MaRDI QIDQ6174813

Asaf Levin

Publication date: 17 August 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-023-01097-0

zbMATH Keywords

schedulingonline algorithmsmigration factor

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Robust algorithms for preemptive scheduling
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• A robust APTAS for the classical bin packing problem
• Parameterized on-line open-end bin packing
• Approximation schemes for the min-max starting time problem
• Minimizing the maximum starting time on-line
• Robust algorithms for total completion time
• Starting time minimization for the maximum job variant
• Robust online algorithms for certain dynamic packing problems
• Fully dynamic bin packing revisited
• Robust Approximation Schemes for Cube Packing
• Integer Programming with a Fixed Number of Variables
• Online Scheduling with Bounded Migration
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
• Sensitivity theorems in integer linear programming
• Online Single Machine Scheduling to Minimize the Maximum Starting Time
• Fully-Dynamic Bin Packing with Little Repacking
• Online Bin Covering with Limited Migration
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration
• Symmetry Exploitation for Online Machine Covering with Bounded Migration
• A note on an open-end bin packing problem

This page was built for publication: Online minimization of the maximum starting time: migration helps