Fairness in parallel job scheduling

DOI<297::AID-JOS50>3.0.CO;2-D 10.1002/1099-1425(200009/10)3:5<297::AID-JOS50>3.0.CO;2-DzbMath0992.90030OpenAlexW2056702805WikidataQ130471502 ScholiaQ130471502MaRDI QIDQ1588058

Uwe Schwiegelshohn, Ramin Yahyapour

Publication date: 10 May 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/1099-1425(200009/10)3:5<297::aid-jos50>3.0.co;2-d

zbMATH Keywords

makespan criterioncompetitive factorsfair on-line schedulingweighted completion time criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Greedy scheduling with custom-made objectives ⋮ A system-centric metric for the evaluation of online job schedules ⋮ Scheduling parallel jobs using migration and consolidation in the cloud ⋮ On cluster resource allocation for multiple parallel task graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic scheduling on parallel machines
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Complexity of Scheduling Parallel Task Systems
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Smart SMART Bounds for Weighted Response Time Scheduling
• Preemptive weighted completion time scheduling of parallel jobs
• Scheduling independent tasks to reduce mean finishing time
• Scheduling Parallel Machines On-Line

This page was built for publication: Fairness in parallel job scheduling