"Complexity Results for Scheduling Tasks with Discrete Starting Times."

Kazuo Nakajima, S. Louis Hakimi (1982)

> Home

Details and statistics

DOI: 10.1016/0196-6774(82)90030-X

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/NakajimaH82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/NakajimaH82
Kazuo Nakajima, S. Louis Hakimi:
Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3(4): 344-361 (1982)

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.