An optimal online algorithm for single machine scheduling to minimize total general completion time

DOI10.1007/s10878-010-9348-0zbMath1242.90078OpenAlexW2050357462WikidataQ57185658 ScholiaQ57185658MaRDI QIDQ421265

Chengbin Chu, Jiazhen Huo, Ming Liu, Yin-Feng Xu

Publication date: 23 May 2012

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

Full work available at URL: https://doi.org/10.1007/s10878-010-9348-0

zbMATH Keywords

competitive analysisonline schedulingtotal general completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time

Cites Work

• A class of on-line scheduling algorithms to minimize total completion time
• Minimizing the total completion time on-line on a single machine, using restarts
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal online algorithm for single machine scheduling to minimize total general completion time