A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
From MaRDI portal
Publication:763490
DOI10.1016/j.ipl.2011.09.014zbMath1233.68228MaRDI QIDQ763490
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
scheduling; competitive analysis; online algorithms; total general completion time; delayed shortest processing time
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68W27: Online algorithms; streaming algorithms
Related Items
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, Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Cites Work