## Abstract

We study the generalized load-balancing (GLB) problem, where we are given n jobs, each of which needs to be assigned to one of m unrelated machines with processing times {pij}. Under a job assignment σ, the load of each machine i is ψi(p_{i}[σ]) where (Equation presented) is a symmetric monotone norm and (Equation presented) is the ndimensional vector (Equation presented). Our goal is to minimize the generalized makespan ϕ(load(σ)), where (Equation presented) is another symmetric monotone norm and load(σ) is the m-dimensional machine load vector. This problem significantly generalizes many classic optimization problems, e.g., makespan minimization, set cover, minimum-norm load-balancing, etc. We also study the special case of identical machine scheduling, i.e., pij = pj for all machine i. Our main result is a polynomial time randomized algorithm that achieves an approximation factor of O(log n), matching the lower bound of set cover (which is special case of GLB) up to constant factor. We achieve this by rounding a novel configuration LP relaxation with exponential number of variables. To approximately solve the configuration LP, we design an approximate separation oracle for its dual program. In particular, the separation oracle can be reduced to the norm minimization with a linear constraint (NormLin) problem and we devise a polynomial time approximation scheme (PTAS) for it, which may be of independent interest. We also obtain constant factor approximation algorithms for some special cases.

Original language | American English |
---|---|

Title of host publication | 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023 |

Publisher | Association for Computing Machinery |

Pages | 2898-2916 |

Number of pages | 19 |

ISBN (Electronic) | 9781611977554 |

State | Published - 2023 |

Event | 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023 - Florence, Italy Duration: 22 Jan 2023 → 25 Jan 2023 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

Volume | 2023-January |

### Conference

Conference | 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023 |
---|---|

Country/Territory | Italy |

City | Florence |

Period | 22/01/23 → 25/01/23 |

### Bibliographical note

Funding Information:This work was done when Shichuan Deng was a student at Tsinghua University. Shichuan Deng and Jian Li are supported in part by the National Natural Science Foundation of China Grant 62161146004, Turing AI Institute of Nanjing and Xi’an Institute for Interdisciplinary Information Core Technology. Yuval Rabani is supported in part by ISF grants 3565-21 and 389-22, and by BSF grant 2018687.

Funding Information:

This work was done when Shichuan Deng was a student at Tsinghua University. Shichuan Deng and Jian Li are supported in part by the National Natural Science Foundation of China Grant 62161146004, Turing AI Institute of Nanjing and Xi'an Institute for Interdisciplinary Information Core Technology. Yuval Rabani is supported in part by ISF grants 3565-21 and 389-22, and by BSF grant 2018687.

Publisher Copyright:

Copyright © 2023 by SIAM.