Robust algorithms for total completion time

DOI10.1016/j.disopt.2019.03.001zbMath1506.90097OpenAlexW2930331340MaRDI QIDQ2010916

Leah Epstein, Asaf Levin

Publication date: 28 November 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2019.03.001

zbMATH Keywords

algorithmsschedulingbounded migration factor

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Robustness in mathematical programming (90C17)

Related Items (4)

Bin stretching with migration on two hierarchical machines ⋮ Online minimization of the maximum starting time: migration helps ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ Online scheduling with migration on two hierarchical machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust algorithms for preemptive scheduling
• A robust APTAS for the classical bin packing problem
• Improved bounds for on-line load balancing
• Minimizing average completion time in the presence of release dates
• A theory and algorithms for combinatorial reoptimization
• A class of on-line scheduling algorithms to minimize total completion time
• Approximation Techniques for Average Completion Time Scheduling
• Robust Approximation Schemes for Cube Packing
• Online Scheduling with Bounded Migration
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
• Optimal on-line algorithms for single-machine scheduling
• Scheduling independent tasks to reduce mean finishing time
• Load Balancing for Response Time
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Scheduling

This page was built for publication: Robust algorithms for total completion time