Approximation schemes for minimizing average weighted completion time with release dates

DOI10.1109/SFFCS.1999.814574MaRDI QIDQ7238266zbMATH OpenFDO

Authors Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814574

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cited in

(4)

• Traveling repairperson, unrelated machines, and other stories about average completion times
• An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
• An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
• An efficient polynomial time approximation scheme for minimizing the total weighted completion time on uniformly related machines

This page was built for publication: Approximation schemes for minimizing average weighted completion time with release dates

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