"A parameterized complexity view on non-preemptively scheduling ..."

René van Bevern, Rolf Niedermeier, Ondrej Suchý (2017)

> Home

Details and statistics

DOI: 10.1007/S10951-016-0478-9

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/BevernNS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/BevernNS17
René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Sched. 20(3): 255-265 (2017)

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.