Waldo Gálvez
Abstract
Online models that allow recourse can be highly effective in situations where classical online models are too pessimistic. One such problem is the online machine covering problem on identical machines. In this setting, jobs arrive one by one and must be assigned to machines with the objective of maximizing the minimum machine load. When a job arrives, we are allowed to reassign some jobs as long as their total size is (at most) proportional to the processing time of the arriving job. The proportionality constant is called the migration factor of the algorithm.
Using a rounding procedure with useful structural properties for online packing and covering problems, we design first a simple (1.7 + ε)-competitive algorithm using a migration factor of O(1/ε), which maintains at every arrival a locally optimal solution with respect to the Jump neighborhood. After that, we present as our main contribution a more involved (4/3+ε)-competitive algorithm using a migration factor of Ō(1/ε 3). At every arrival, we run an adaptation of the Largest Processing Time first (LPT) algorithm. Since the new job can cause a complete change of the assignment of smaller jobs in both cases, a low migration factor is achieved by carefully exploiting the highly symmetric structure obtained by the rounding procedure.
- Y. Azar and L. Epstein. 1998. On-line machine covering. J. Sched. 1 (1998), 67--77.Google Scholar
Cross Ref
- S. Berndt, K. Jansen, and K. Klein. 2018. Fully dynamic bin packing revisited. Math. Program. (2018).Google Scholar
- Xujin Chen, Leah Epstein, Elena Kleiman, and Rob van Stee. 2013. Maximizing the minimum load: The cost of selfishness. Theor. Comput. Sci. 482 (2013), 9--19.Google ScholarCross Ref
- J. Csirik, H. Kellerer, and G. Woeginger. 1992. The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11 (1992), 281--287.Google ScholarDigital Library
- B. Deuermeyer, D. Friesen, and M. Langston. 1982. Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIJADM 3 (1982), 190--196.Google Scholar
- L. Epstein and A. Levin. 2009. A robust APTAS for the classical bin packing problem. Math. Program. 119 (2009), 33--49.Google ScholarDigital Library
- L. Epstein and A. Levin. 2014. Robust algorithms for preemptive scheduling. Algorithmica 69 (2014), 26--57.Google ScholarCross Ref
- A. Frangioni, E. Necciari, and M. Scutellà. 2004. A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J. Comb. Optim. 8 (2004), 195--220.Google ScholarCross Ref
- A. Gu, A. Gupta, and A. Kumar. 2016. The power of deferral: Maintaining a constant-competitive Steiner tree online. SIAM J. Comput. 45 (2016), 1--28.Google ScholarCross Ref
- D. Hochbaum and D. Shmoys. 1988. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17 (1988), 539--551.Google ScholarDigital Library
- K. Jansen and K. Klein. 2013. A robust AFPTAS for online bin packing with polynomial migration. In ICALP 2013. 589--600.Google Scholar
- K. Jansen, K. Klein, and J. Verschae. 2016. Closing the gap for makespan scheduling via sparsification techniques. In ICALP 2016. 1--13.Google Scholar
- J. Łacki, J. Oćwieja, M. Pilipczuk, P. Sankowski, and A. Zych. 2015. The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree. In STOC 2015. 11--20.Google ScholarDigital Library
- N. Megow, M. Skutella, J. Verschae, and A. Wiese. 2016. The power of recourse for online MST and TSP. SIAM J. Comput. 45 (2016), 859--880.Google ScholarCross Ref
- D. Recalde, C. Rutten, P. Schuurman, and T. Vredeveld. 2010. Local search performance guarantees for restricted related parallel machine scheduling. LATIN 2010 (2010), 108--119.Google Scholar
- P. Sanders, N. Sivadasan, and M. Skutella. 2009. Online scheduling with bounded migration. Math. Oper. Res. 34 (2009), 481--498.Google ScholarDigital Library
- P. Schuurman and T. Vredeveld. 2007. Performance guarantees of local search for multiprocessor scheduling. INFORMS J. Comput. 19 (2007), 52--63.Google ScholarDigital Library
- M. Skutella and J. Verschae. 2016. Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures. Math. Oper. Res. 41 (2016), 991--1021.Google ScholarDigital Library
- B. Vöcking. 2007. Selfish load balancing. In Algorithmic Game Theory. 517--542.Google Scholar
- G. Woeginger. 1997. A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20 (1997), 149--154.Google ScholarDigital Library
Index Terms
- Symmetry Exploitation for Online Machine Covering with Bounded Migration
Recommendations
On-line machine covering on two machines with local migration
We study an on-line machine covering problem, in which jobs arrive one by one and their processing times are known upon their arrival, and jobs are allowed to migrate between machines when a new job is added in the system. However, the total processing ...
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
In this paper, we consider the semi-online preemptive scheduling problem with decreasing job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent ...
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem, in which jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed ...
Comments