[1]
“A faster way to approximately schedule equally divided jobs with preemptions on a single machine by subsequent job importance growth”, МІА, vol. 41, pp. 80–87, Apr. 2019, doi: 10.26565/2304-6201-2019-41-09.