"Risk-averse single machine scheduling: complexity and approximation."

Adam Kasperski, Pawel Zielinski (2019)

> Home

Details and statistics

DOI: 10.1007/S10951-019-00599-6

access: open

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/scheduling/Kasperski019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/Kasperski019
Adam Kasperski, Pawel Zielinski:
Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22(5): 567-580 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.