A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints.
Hatem HaddaPublished in: Optim. Lett. (2009)
Keyphrases
- special case
- np hard
- learning algorithm
- computational complexity
- detection algorithm
- experimental evaluation
- optimization algorithm
- optimal solution
- cost function
- objective function
- improved algorithm
- preprocessing
- recognition algorithm
- dynamic programming
- np complete
- probabilistic model
- greedy algorithm
- worst case
- significant improvement
- k means
- search algorithm
- particle swarm optimization
- high accuracy
- genetic algorithm
- closed form
- convergence rate
- constrained optimization
- approximation ratio
- approximation schemes