Berndt, Sebastian, Eberle, Franziska and Megow, Nicole (2022) Online load balancing with general reassignment cost. Operations Research Letters, 50 (3). 322 - 328. ISSN 0167-6377
![]() |
Text (1-s2.0-S0167637722000487-main)
- Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (368kB) |
Abstract
We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines with the goal to minimize the maximum machine load. Since strong lower bounds rule out any competitive ratio of o(logn), we may reassign jobs at a certain job-individual cost. We generalize a result by Gupta, Kumar, and Stein (SODA 2014) by giving a O(loglogmn)-competitive algorithm with constant amortized reassignment cost.
Item Type: | Article |
---|---|
Official URL: | https://www.sciencedirect.com/journal/operations-r... |
Additional Information: | © 2022 The Authors |
Divisions: | Mathematics |
Subjects: | Q Science > QA Mathematics > QA76 Computer software H Social Sciences > HD Industries. Land use. Labor |
Date Deposited: | 21 Apr 2022 16:09 |
Last Modified: | 03 Aug 2024 02:24 |
URI: | http://eprints.lse.ac.uk/id/eprint/114914 |
Actions (login required)
![]() |
View Item |