Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough

DOI10.1007/978-3-540-75520-3_65zbMath1151.90431arXivcs/0612088OpenAlexW1945689612MaRDI QIDQ3527263

Julien Robert, Nicolas Schabanel

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0612088

zbMATH Keywords

fairnessonline schedulingbatch schedulingequi-partitionmakespan and overall set completion time minimizationnon-clairvoyant algorithm

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 (3)

Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor

This page was built for publication: Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough