"Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling."

Eugeniusz Nowicki, Czeslaw Smutnicki (1991)

> Home

Details and statistics

DOI: 10.1016/0167-6377(91)90025-K

access: closed

type: Journal Article

metadata version: 2019-05-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/NowickiS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/NowickiS91
Eugeniusz Nowicki, Czeslaw Smutnicki:
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Oper. Res. Lett. 10(8): 473-480 (1991)

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.