"Time complexity of single- and identical parallel-machine scheduling with ..."

Jürgen Zimmermann (1999)

> Home

Details and statistics

DOI: 10.1007/PL00020914

access: closed

type: Journal Article

metadata version: 2020-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mmor/Zimmermann99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/Zimmermann99
Jürgen Zimmermann:
Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints. Math. Methods Oper. Res. 49(2): 221-238 (1999)

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.