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

DOI10.1007/s10898-010-9549-1zbMath1206.90048OpenAlexW2031179233MaRDI QIDQ625659

Jiping Tao, Zhijun Chao, Yu-Geng 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

single-machine schedulingcompetitive analysistotal completion time

Mathematics Subject Classification ID

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

Cites Work

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

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