An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
Crossref DOI link: https://doi.org/10.1007/s10878-020-00594-0
Published Online: 2020-05-27
Published Print: 2022-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhang, Long
Zhang, Yuzhong
Bai, Qingguo
Funding for this research was provided by:
the National Science Foundation of China (11771251, 71771138)
Text and Data Mining valid from 2020-05-27
Version of Record valid from 2020-05-27
Article History
First Online: 27 May 2020