How good are SPT schedules for fair optimality criteria

DOI10.1007/s10479-007-0267-0zbMath1152.90422OpenAlexW1969215996MaRDI QIDQ940873

Evripidis Bampis, Fanny Pascual, Eric Angel

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0267-0

zbMATH Keywords

multiprocessor schedulingapproximation algorithmsfairness measuresSPT

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Inequity averse optimization in operational research ⋮ Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ Notes on a hierarchical scheduling problem on identical machines ⋮ Scheduling to minimize the maximum total completion time per machine

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Fairness Measures for Resource Allocation

This page was built for publication: How good are SPT schedules for fair optimality criteria