Lin, R., Feng, H., & Li, W. (2025). Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions. Discrete Applied Mathematics, 370, 71. https://doi.org/10.1016/j.dam.2025.03.008
Chicago Style (17th ed.) CitationLin, Ran, Huiyan Feng, and Wenhua Li. "Optimal Algorithms for Online Batch Scheduling with All Possible Equal-processing Times Under Periodic Pulse Interruptions." Discrete Applied Mathematics 370 (2025): 71. https://doi.org/10.1016/j.dam.2025.03.008.
MLA (9th ed.) CitationLin, Ran, et al. "Optimal Algorithms for Online Batch Scheduling with All Possible Equal-processing Times Under Periodic Pulse Interruptions." Discrete Applied Mathematics, vol. 370, 2025, p. 71, https://doi.org/10.1016/j.dam.2025.03.008.