"On the complexity of scheduling tasks with discrete starting times."

J. Mark Keil (1992)

> Home

Details and statistics

DOI: 10.1016/0167-6377(92)90087-J

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Keil92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Keil92
J. Mark Keil:
On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12(5): 293-295 (1992)

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.