"A note on the proof of the complexity of the little-preemptive open-shop ..."

Evgeny V. Shchepin, Nodari Vakhania (2011)

> Home

Details and statistics

DOI: 10.1007/S10479-011-0975-3

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/ShchepinV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/ShchepinV11
Evgeny V. Shchepin, Nodari Vakhania:
A note on the proof of the complexity of the little-preemptive open-shop problem. Ann. Oper. Res. 191(1): 251-253 (2011)

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.