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

DOI10.1016/J.IPL.2011.09.014MaRDI QIDQ763490zbMATH OpenOpenAlexFDO

Authors 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

competitive analysisdelayed shortest processing timeonline algorithmsschedulingtotal general completion time

Mathematics Subject Classification ID

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

Recommendations

• An optimal online algorithm for single machine scheduling to minimize total general completion time
• Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• An alternative proof of an optimal online algorithm for single-machine scheduling with deteriorating jobs
• Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

Cites work

• A class of on-line scheduling algorithms to minimize total completion time
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1235242 (Why is no real title available?)
• Minimizing average completion time in the presence of release dates

Cited in

(6)

• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
• Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
• Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763490)