A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time

DOI10.1016/j.ipl.2011.09.014zbMath1233.68228OpenAlexW2085352696MaRDI QIDQ763490

Prudence W. H. Wong, Sheng Yu

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.014

zbMATH Keywords

schedulingcompetitive analysisonline algorithmstotal general completion timedelayed shortest processing time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

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, Online scheduling with linear deteriorating jobs to minimize the total weighted completion time

Cites Work

• Minimizing average completion time in the presence of release dates
• A class of on-line scheduling algorithms to minimize total completion time
• Unnamed Item
• Unnamed Item