Paper
4 September 2024 Price of fairness in two-agents single machine scheduling
Yongzhi Wu, Baoqiang Fan, Tingting Liu, Zhenxuan Liu
Author Affiliations +
Proceedings Volume 13259, International Conference on Automation Control, Algorithm, and Intelligent Bionics (ACAIB 2024); 1325921 (2024) https://doi.org/10.1117/12.3039590
Event: Fourth International Conference on Automation Control, Algorithm, and Intelligent Bionics (ICAIB 2024), 2024, Yinchuan, China
Abstract
There are two agents A and B with each having their own jobs. One agent wants to minimize the total weighted completion time. Another agent wants to minimize the total completion time. Some structural properties of Pareto optimal solutions are given and a bigger WSPT scheduling set is found which contains all Pareto optimal solutions. In the WSPT scheduling set, we design an algorithm in polynomial time to get total KS-fair schedules while it proves that the upper bound of PoF value equals a half. Moreover, the above algorithm can be modified to get the KS-fair schedules in Pareto optimal schedule set, and prove that the bound of PoF is exactly a half.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Yongzhi Wu, Baoqiang Fan, Tingting Liu, and Zhenxuan Liu "Price of fairness in two-agents single machine scheduling", Proc. SPIE 13259, International Conference on Automation Control, Algorithm, and Intelligent Bionics (ACAIB 2024), 1325921 (4 September 2024); https://doi.org/10.1117/12.3039590
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Design

Algorithms

Analytical research

Binary data

Back to Top