Crossmark

A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time

Published Online: 2025-06-04

Authors

Lin, Ran

Li, Wen-Hua https://orcid.org/0000-0002-3925-9066
Ma, Xiao

Hu, Sheng-Nan
Funding

Funding for this research was provided by:

National Natural Science Foundation of China (12271491)

Natural Science Foundation of Henan Province (242300421211, 12401424, 12471305)
License Information

Text and Data Mining valid from 2025-06-04

Version of Record valid from 2025-06-04
More Information

Article History

Received: 13 June 2024

Revised: 5 April 2025

Accepted: 9 April 2025

First Online: 4 June 2025

Conflict of Interest

: The authors declare that they have no conflict of interest.

Document is current