Generalized Unrelated Machine Scheduling Problem

Shichuan Deng*, Jian Li, Yuval Rabani

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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(pi[σ]) 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 languageAmerican English
Title of host publication34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023
PublisherAssociation for Computing Machinery
Number of pages19
ISBN (Electronic)9781611977554
StatePublished - 2023
Event34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023 - Florence, Italy
Duration: 22 Jan 202325 Jan 2023

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms


Conference34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023

Bibliographical note

Publisher Copyright:
Copyright © 2023 by SIAM.


Dive into the research topics of 'Generalized Unrelated Machine Scheduling Problem'. Together they form a unique fingerprint.

Cite this