A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release Times and Job Compatibilities
Crossref DOI link: https://doi.org/10.1007/s40305-023-00480-6
Published Online: 2023-04-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Miao, Li-Yun
Tian, Ji
Fu, Ru-Yan
Text and Data Mining valid from 2023-04-04
Version of Record valid from 2023-04-04
Article History
Received: 25 May 2022
Revised: 25 February 2023
Accepted: 26 February 2023
First Online: 4 April 2023
Conflict of interest
: The authors declare that they have no conflict of interest.