"Scheduling concurrent production over a finite planning horizon: ..."

Konstantin Kogan (2000)

> Home

Details and statistics

DOI: 10.1016/S0305-0548(99)00081-7

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/Kogan00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/Kogan00
Konstantin Kogan:
Scheduling concurrent production over a finite planning horizon: polynomially solvable cases. Comput. Oper. Res. 27(14): 1409-1419 (2000)

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.