Risk-averse single machine scheduling: complexity and approximation
Crossref DOI link: https://doi.org/10.1007/s10951-019-00599-6
Published Online: 2019-02-28
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kasperski, Adam
Zieliński, Paweł
Funding for this research was provided by:
Narodowe Centrum Nauki (2017/25/B/ST6/00486, 2017/25/B/ST6/00486)
Text and Data Mining valid from 2019-02-28
Article History
First Online: 28 February 2019