Approximation Algorithms for Flexible Job Shop Problems.
Klaus JansenMonaldo MastrolilliRoberto Solis-ObaPublished in: LATIN (2000)
Keyphrases
- approximation algorithms
- open shop
- job shop
- vertex cover
- approximation schemes
- np hard
- special case
- minimum cost
- scheduling problem
- randomized algorithms
- job shop scheduling
- production scheduling
- worst case
- optimization problems
- constant factor
- neural network
- tabu search
- low cost
- disjoint paths
- constant factor approximation