Robust algorithms for total completion time

DOI10.1016/J.DISOPT.2019.03.001MaRDI QIDQ2010916zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsschedulingbounded migration factor

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 6767525 (Why is no real title available?)
• A class of on-line scheduling algorithms to minimize total completion time
• A robust AFPTAS for online bin packing with polynomial migration
• A robust APTAS for the classical bin packing problem
• A theory and algorithms for combinatorial reoptimization
• Approximation techniques for average completion time scheduling
• Improved bounds for on-line load balancing
• Introduction to algorithms.
• Load Balancing for Response Time
• Minimizing average completion time in the presence of release dates
• Online scheduling with bounded migration
• Online strip packing with polynomial migration
• Optimal on-line algorithms for single-machine scheduling
• Robust algorithms for preemptive scheduling
• Robust approximation schemes for cube packing
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• Scheduling algorithms
• Scheduling independent tasks to reduce mean finishing time
• Scheduling. Theory, algorithms, and systems
• Technical Note—Minimizing Average Flow Time with Parallel Machines

Cited in

(8)

• Online minimization of the maximum starting time: migration helps
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• Robust algorithms for preemptive scheduling
• 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
• Reoptimization of the minimum total flow-time scheduling problem
• 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)