Robust algorithms for total completion time

DOI10.1016/J.DISOPT.2019.03.001zbMATH Open1506.90097OpenAlexW2930331340MaRDI QIDQ2010916FDOQ2010916

Authors: 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

Recommendations

• Robust algorithms for preemptive scheduling
• Robust algorithms for preemptive scheduling
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• Online scheduling with bounded migration
• Automata, Languages and Programming

zbMATH Keywords

algorithmsschedulingbounded migration factor

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Title not available (Why is that?)
• A class of on-line scheduling algorithms to minimize total completion time
• Scheduling algorithms
• Optimal on-line algorithms for single-machine scheduling
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Title not available (Why is that?)
• Scheduling independent tasks to reduce mean finishing time
• A robust APTAS for the classical bin packing problem
• Minimizing average completion time in the presence of release dates
• Approximation techniques for average completion time scheduling
• Online scheduling with bounded migration
• Robust approximation schemes for cube packing
• Robust algorithms for preemptive scheduling
• Load Balancing for Response Time
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
• Title not available (Why is that?)
• Improved bounds for on-line load balancing
• A theory and algorithms for combinatorial reoptimization
• Scheduling

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010916)