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

DOI10.1023/A:1024693103802zbMath1035.90030OpenAlexW1954214013MaRDI QIDQ1402544

Jairo R. Montoya-Torres

Publication date: 28 August 2003

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

Full work available at URL: https://doi.org/10.1023/a:1024693103802

zbMATH Keywords

competitive analysissingle-machinecompletion timeon-line scheduling

Mathematics Subject Classification ID

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

Related Items (2)

iGreen: green scheduling for peak demand minimization ⋮ Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine

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