Sevastyanov, S. (2026). Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions. Journal of Scheduling, 29(3), 203. https://doi.org/10.1007/s10951-025-00867-8
Παραπομπή σε μορφή Chicago (17η εκδ.)Sevastyanov, Sergey. "Efficient Approximation Algorithms for Scheduling Problems with Uniform P-batch Machines and Arbitrary Processing Set Restrictions." Journal of Scheduling 29, no. 3 (2026): 203. https://doi.org/10.1007/s10951-025-00867-8.
Παραπομπή σε μορφή MLA (9th εκδ.)Sevastyanov, Sergey. "Efficient Approximation Algorithms for Scheduling Problems with Uniform P-batch Machines and Arbitrary Processing Set Restrictions." Journal of Scheduling, vol. 29, no. 3, 2026, p. 203, https://doi.org/10.1007/s10951-025-00867-8.