- E. V. Shchepin, “On the complexity of constructing multiprocessor little-preemptive schedules”, Proc. Steklov Inst. Math., 290, no. 1, 2015, 166
- Jan Karel Lenstra, Nodari Vakhania, “On the complexity of scheduling unrelated parallel machines with limited preemptions”, Operations Research Letters, 51, no. 2, 2023, 187
- Viktor Ivanovich Buslaev, Victor Matveevich Buchstaber, Alexander Nikolaevich Dranishnikov, Vitalii Mendelevich Kliatskin, Sergey Aleksandrovich Melikhov, L Montejano, Sergei Petrovich Novikov, Pavel Vladimirovich Semenov, “Евгений Витальевич Щепин (к семидесятилетию со дня рождения)”, Успехи математических наук, 77, no. 3(465), 2022, 182
- Alan J. Soper, Vitaly A. Strusevich, “Schedules with a single preemption on uniform parallel machines”, Discrete Applied Mathematics, 261, 2019, 332