On-line scheduling to minimize average completion time revisited.
type: Item
instance of: scholarly article
title: On-line scheduling to minimize average completion time revisited.
zbMATH Open document ID: 1054.90037
author: Nicole Megow
author: Andreas S. Schulz
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2125910
zbMATH Keywords: Scheduling
zbMATH Keywords: On-line algorithm
zbMATH Keywords: Approximation algorithm
zbMATH Keywords: Competitive analysis
Wikidata QID: Q57399779
MaRDI profile type: Publication
full work available at URL: j.orl.2003.11.008
OpenAlex ID: W1964085249
cites work: Q4828982
cites work: Approximation techniques for average completion time scheduling
cites work: Single machine scheduling with release dates
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Q3217922
cites work: Q4055377
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: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: The power of \(\alpha\)-points in preemptive single machine scheduling.
cites work: Scheduling Unrelated Machines by Randomized Rounding
cites work: Q4368485
DOI: 10.1016/J.ORL.2003.11.008
description: scientific article; zbMATH DE number 2125910