Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes

Asaf Levin. Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf. Process. Lett., 174:106211, 2022. [doi]

@article{Levin22,
  title = {Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes},
  author = {Asaf Levin},
  year = {2022},
  doi = {10.1016/j.ipl.2021.106211},
  url = {https://doi.org/10.1016/j.ipl.2021.106211},
  researchr = {https://researchr.org/publication/Levin22},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {174},
  pages = {106211},
}