"Complexity results and approximation algorithms for the two machine ..."

Marie-Laure Espinouse, Piotr Formanowicz, Bernard Penz (2001)

> Home

Details and statistics

DOI: 10.1057/PALGRAVE.JORS.2601025

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jors/EspinouseFP01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jors/EspinouseFP01
Marie-Laure Espinouse, Piotr Formanowicz, Bernard Penz:
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability. J. Oper. Res. Soc. 52(1): 116-121 (2001)

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.