A class of on-line scheduling algorithms to minimize total completion time
type: Item
instance of: scholarly article
title: A class of on-line scheduling algorithms to minimize total completion time
zbMATH Open document ID: 1013.90067
DOI: 10.1016/S0167-6377(03)00016-6
published in: Operations Research Letters
publication date: 2003-06-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1929389
author: Xiwen Lu
author: René A. Sitters
author: L. Stougie
MaRDI profile type: Publication
cites work: Approximation techniques for average completion time scheduling
cites work: Q4658190
cites work: Minimizing mean flow time with release time constraint
cites work: Optimal on-line algorithms for single-machine scheduling
cites work: Q4055377
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: Online algorithms. The state of the art
cites work: Q4368485
Recommended article: Approximation and Online Algorithms
Recommended article: Q4875178
Recommended article: On-line scheduling to minimize average completion time revisited.
Recommended article: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
Recommended article: On-line scheduling on a single machine: Minimizing the total completion time
Recommended article: On-line scheduling of parallel machines to minimize total completion times
Recommended article: An optimal online algorithm for single machine scheduling to minimize total general completion time
Recommended article: Total completion time minimization in online hierarchical scheduling of unit-size jobs
Recommended article: Q4828982
Recommended article: Minimizing completion time for a class of scheduling problems
description: scientific article; zbMATH DE number 1929389