TY - JOUR
T1 - Maximal workload, minimal workload, maximal workload difference
T2 - Optimizing all criteria at once
AU - Deschamps, Sébastien
AU - Meunier, Frédéric
N1 - Publisher Copyright:
© 2024 Elsevier B.V.
PY - 2024/5/1
Y1 - 2024/5/1
N2 - In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.
AB - In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.
KW - Bipartite graph
KW - Fairness
KW - Load balancing
UR - https://www.scopus.com/pages/publications/85189566532
U2 - 10.1016/j.orl.2024.107110
DO - 10.1016/j.orl.2024.107110
M3 - Article
AN - SCOPUS:85189566532
SN - 0167-6377
VL - 54
JO - Operations Research Letters
JF - Operations Research Letters
M1 - 107110
ER -