Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties
Crossref DOI link: https://doi.org/10.1007/s10878-025-01314-2
Published Online: 2025-05-21
Published Print: 2025-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Guo, Tianjiao
Liu, Wen
Zhang, Gengsheng
Hou, Bo
Text and Data Mining valid from 2025-05-21
Version of Record valid from 2025-05-21
Article History
Accepted: 30 April 2025
First Online: 21 May 2025
Declarations
:
: The authors declare that there is no conflict of interests regarding the publication of this paper.