Fairness in parallel job scheduling
type: Item
instance of: scholarly article
title: Fairness in parallel job scheduling
zbMATH Open document ID: 0992.90030
author: Uwe Schwiegelshohn
author: Ramin Yahyapour
published in: Journal of Scheduling
publication date: 2001-05-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1538788
zbMATH Keywords: competitive factors
zbMATH Keywords: makespan criterion
zbMATH Keywords: weighted completion time criterion
zbMATH Keywords: fair on-line scheduling
MaRDI profile type: Publication
cites work: Dynamic scheduling on parallel machines
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Complexity of Scheduling Parallel Task Systems
cites work: Bounds for Multiprocessor Scheduling with Resource Constraints
cites work: Smart SMART Bounds for Weighted Response Time Scheduling
cites work: Q4818873
cites work: Preemptive weighted completion time scheduling of parallel jobs
cites work: Q4875180
cites work: Scheduling Parallel Machines On-Line
cites work: Q4526975
cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
OpenAlex ID: W2056702805
Wikidata QID: Q130471502
DOI: 10.1002/1099-1425(200009/10)3:5%3C297::AID-JOS50%3E3.0.CO;2-D
full work available at URL: https://doi.org/10.1002/1099-1425(200009/10)3:5%3C297::aid-jos50%3E3.0.co
description: scientific article; zbMATH DE number 1538788