Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
Crossref DOI link: https://doi.org/10.1007/s10878-025-01280-9
Published Online: 2025-03-23
Published Print: 2025-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Liu, Minqin
Yu, Wei https://orcid.org/0000-0002-6127-1264
Liu, Zhaohui
Guo, Xinmeng
Funding for this research was provided by:
National Natural Science Foundation of China (12371317)
Text and Data Mining valid from 2025-03-23
Version of Record valid from 2025-03-23
Article History
Accepted: 4 March 2025
First Online: 23 March 2025
Declarations
:
: The authors declare no competing interests.