Wieslaw Kubiak, 325, A Book of Open Shop Scheduling, 2022, 31
Alan J. Soper, Vitaly A. Strusevich, “Preemptive and non-preemptive scheduling on two unrelated parallel machines”, J Sched, 25, no. 6, 2022, 659
Lin-Hui Sun, Kai Cui, Ju-Hong Chen, Jun Wang, Xian-Chen He, “Research on permutation flow shop scheduling problems with general position-dependent learning effects”, Ann Oper Res, 211, no. 1, 2013, 473
Zhaohui Liu, Wen-Chiung Lee, Jen-Ya Wang, “Resource consumption minimization with a constraint of maximum tardiness on parallel machines”, Computers & Industrial Engineering, 97, 2016, 191
Nodari Vakhania, “On preemptive scheduling on unrelated machines using linear programming”, MATH, 8, no. 3, 2023, 7061
Evgeny V. Shchepin, Nodari Vakhania, “A note on the proof of the complexity of the little-preemptive open-shop problem”, Ann Oper Res, 191, no. 1, 2011, 251
Alan J. Soper, Vitaly A. Strusevich, “Parametric analysis of the quality of single preemption schedules on three uniform parallel machines”, Ann Oper Res, 298, no. 1-2, 2021, 469
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, no. 2, 2021, 399
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, no. 3, 2022, 559
Lin-Hui Sun, Kai Cui, Ju-Hong Chen, Jun Wang, Xian-Chen He, “Some results of the worst-case analysis for flow shop scheduling with a learning effect”, Ann Oper Res, 211, no. 1, 2013, 481