Login / Signup

Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability.

Marie-Laure EspinousePiotr FormanowiczBernard Penz
Published in: J. Oper. Res. Soc. (2001)
Keyphrases
  • approximation algorithms
  • worst case
  • strongly np hard
  • special case
  • vertex cover
  • np hard
  • np hardness
  • flowshop
  • minimum cost
  • scheduling problem
  • approximation schemes
  • precedence constraints
  • network design problem