"A note on proving the strong NP-hardness of some scheduling problems with ..."

Radoslaw Rudek (2012)

> Home

Details and statistics

DOI: 10.1007/S11590-011-0330-2

access: open

type: Journal Article

metadata version: 2020-07-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ol/Rudek12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/Rudek12
Radoslaw Rudek:
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times. Optim. Lett. 6(5): 1021-1025 (2012)

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.