A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
type: Item
instance of: scholarly article
title: A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
zbMATH Open document ID: 1233.68228
author: Prudence W. H. Wong
author: Sheng Yu
published in: Information Processing Letters
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6013686
zbMATH Keywords: online algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: total general completion time
zbMATH Keywords: delayed shortest processing time
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.09.014
OpenAlex ID: W2085352696
cites work: Q4223058
cites work: A class of on-line scheduling algorithms to minimize total completion time
cites work: Minimizing average completion time in the presence of release dates
cites work: Q4223483
DOI: 10.1016/J.IPL.2011.09.014
description: scientific article; zbMATH DE number 6013686