Simultaneous approximation ratios for parallel machine scheduling problems

DOI10.1007/s40305-019-00253-0zbMath1438.90121arXiv1304.4073OpenAlexW2959016378WikidataQ127519436 ScholiaQ127519436MaRDI QIDQ2326082

Jinjiang Yuan, Long Wan

Publication date: 4 October 2019

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

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

zbMATH Keywords

schedulingglobal fairnesssimultaneous approximation ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• The exact LPT-bound for maximizing the minimum completion time
• Scheduling with Deadlines and Loss Functions
• Approximate majorization and fair online load balancing
• Fairness Measures for Resource Allocation
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Fairness in routing and load balancing
• Combining fairness with throughput: Online routing with multiple objectives