5 citations to 10.1007/s10479-011-0975-3 (Crossref Cited-By Service)

1. E. V. Shchepin, “On the complexity of constructing multiprocessor little-preemptive schedules”, Proc. Steklov Inst. Math., 290, № 1, 2015, 166  
2. Wieslaw Kubiak, 325, A Book of Open Shop Scheduling, 2022, 31  
3. Viktor Ivanovich Buslaev, Victor Matveevich Buchstaber, Alexander Nikolaevich Dranishnikov, Vitalii Mendelevich Kliatskin, Sergey Aleksandrovich Melikhov, L Montejano, Sergei Petrovich Novikov, Pavel Vladimirovich Semenov, “Евгений Витальевич Щепин (к семидесятилетию со дня рождения)”, Успехи математических наук, 77, № 3(465), 2022, 182  
4. Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour, T.C.E. Cheng, “Four decades of research on the open-shop scheduling problem to minimize the makespan”, European Journal of Operational Research, 295, № 2, 2021, 399  
5. Viktor Ivanovich Buslaev, Victor Matveevich Buchstaber, Alexander Nikolaevich Dranishnikov, Vitalii Mendelevich Kliatskin, Sergey Aleksandrovich Melikhov, L Montejano, Sergei Petrovich Novikov, Pavel Vladimirovich Semenov, “Evgenii Vital'evich Shchepin (on his 70th birthday)”, Russian Math. Surveys, 77, № 3, 2022, 559