A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
Crossref DOI link: https://doi.org/10.1007/s10951-021-00681-y
Published Online: 2021-04-02
Published Print: 2021-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hashimoto, Susumu http://orcid.org/0000-0002-1646-4358
Mizuno, Shinji
Funding for this research was provided by:
Japan Society for the Promotion of Science (19H00808)
Text and Data Mining valid from 2021-04-02
Version of Record valid from 2021-04-02
Article History
Accepted: 12 March 2021
First Online: 2 April 2021