An optimal algorithm for preemptive scheduling on non-simultaneously available uniform machines
Crossref DOI link: https://doi.org/10.1631/FITEE.2300767
Published Online: 2025-04-07
Published Print: 2025-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhou, Hao
Cao, Liping
Wei, Qi
Shu, Zhenyu
Jiang, Yiwei https://orcid.org/0000-0002-9779-0613
Text and Data Mining valid from 2025-03-01
Version of Record valid from 2025-03-01
Article History
Received: 9 November 2023
Accepted: 29 March 2024
First Online: 7 April 2025
Conflict of interest
: All the authors declare that they have no conflict of interest.