Non-clairvoyant scheduling for minimizing mean slowdown
type: Item
instance of: scholarly article
title: Non-clairvoyant scheduling for minimizing mean slowdown
zbMATH Open document ID: 1082.68010
author: N. Bansal
author: Kedar Dhamdhere
author: Jochen Könemann
author: Amitabh Sinha
published in: Algorithmica
publication date: 2004-11-05T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2113915
zbMATH Keywords: Scheduling
zbMATH Keywords: Slowdown
zbMATH Keywords: Online algorithms
zbMATH Keywords: Non-clairvoyant algorithms
zbMATH Keywords: Resource augmentation
MaRDI profile type: Publication
full work available at URL: s00453-004-1115-0
OpenAlex ID: W2123219527
DOI: 10.1007/S00453-004-1115-0
Recommended article: Q4418655
Recommended article: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
Recommended article: Non-clairvoyantly scheduling to minimize convex functions
Recommended article: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Recommended article: Non-clairvoyant scheduling for weighted flow time
Recommended article: Q4515625
Recommended article: Non-Clairvoyant Precedence Constrained Scheduling.
Recommended article: Q5414590
Recommended article: Non-preemptive scheduling to maximize the minimum global inter-completion time
Recommended article: Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
description: scientific article; zbMATH DE number 2113915