Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine

DOI10.1016/J.ORL.2012.12.001zbMATH Open1263.90032OpenAlexW2046770574MaRDI QIDQ1949673FDOQ1949673

Authors: James M. Davis, Rajiv Gandhi, Vijay H. Kothari 

Publication date: 14 May 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.12.001

Recommendations

• scientific article; zbMATH DE number 871909
• Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• scientific article; zbMATH DE number 2119710
• Single machine scheduling with release dates

zbMATH Keywords

algorithmsonlineapproximationschedulingprimal-dualdual fitting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• LP rounding and combinatorial algorithms for minimizing active and busy time
• \(N\)-extendible posets, and how to minimize total weighted completion time
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
• On scheduling coflows

This page was built for publication: Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine

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