Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine

DOI10.1007/S10898-010-9549-1MaRDI QIDQ625659zbMATH OpenOpenAlexFDO

Authors Jiping Tao, Zhijun Chao, Yugeng Xi

Publication date 25 February 2011

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-010-9549-1

zbMATH Keywords

competitive analysissingle-machine schedulingtotal completion time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
• A competitive online algorithm for minimizing total weighted completion time on uniform machines
• An optimal online algorithm for single machine scheduling to minimize total general completion time
• An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
• On-line scheduling on a single machine: Minimizing the total completion time
• A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions

Cites work

• Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• Online algorithms. The state of the art

Cited in

(2)

• Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
• A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time

This page was built for publication: Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine

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