Ran Lin, Wen-Hua Li, Xiao Ma, Sheng-Nan Hu. A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time. // Journal of the Operations Research Society of China. – 2025. – DOI: 10.1007/s40305-025-00604-0. – URL: https://doi.org/10.1007/s40305-025-00604-0
Ran Lin, Wen-Hua Li, Xiao Ma, & Sheng-Nan Hu (2025). A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time. Journal of the Operations Research Society of China. https://doi.org/10.1007/s40305-025-00604-0
Ran Lin, et al. “A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time.” Journal of the Operations Research Society of China, 2025. doi:10.1007/s40305-025-00604-0.
@article{Lin2025,
title = {A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time},
author = {Lin, Ran and Li, Wen-Hua and Ma, Xiao and Hu, Sheng-Nan},
journal = {Journal of the Operations Research Society of China},
year = {2025},
doi = {10.1007/s40305-025-00604-0},
url = {https://doi.org/10.1007/s40305-025-00604-0}
}