Publisher
Springer International Publishing
Reference19 articles.
1. Azar, Y., Cohen, S.: An improved algorithm for online machine minimization. Oper. Res. Lett. 46(1), 128–133 (2018)
2. van Bevern, R., Niedermeier, R., Suchý, O.: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Scheduling 20(3), 255–265 (2016). https://doi.org/10.1007/s10951-016-0478-9
3. Chen, C., Zhang, H., Xu, Y.: Online machine minimization with lookahead. J. Comb. Optim. (2020). https://doi.org/10.1007/s10878-020-00633-w
4. Chen, L., Megow, N., Schewior, K.: An $$\cal{O}$$(log m)-competitive algorithm for online machine minimization. SIAM J. Comput. 47(6), 2057–2077 (2018)
5. Chuzhoy, J., Guha, S., Khanna, S., Naor, J.S.: Machine minimization for scheduling jobs with interval constraints. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 81–90. IEEE (2004)