A note on the complexity of two supply chain scheduling problems
Crossref DOI link: https://doi.org/10.1007/s10951-021-00692-9
Published Online: 2021-08-12
Published Print: 2021-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhang, Yuan
Yuan, Jinjiang http://orcid.org/0000-0002-9814-615X
Funding for this research was provided by:
National Natural Science Foundation of China (12071442, 11771406)
Text and Data Mining valid from 2021-08-01
Version of Record valid from 2021-08-01
Article History
Accepted: 11 June 2021
First Online: 12 August 2021