A Branch & Bound Algorithm for the Open-shop Problem.
Peter BruckerJohann L. HurinkBernd JurischBirgit WöstmannPublished in: Discret. Appl. Math. (1997)
Keyphrases
- branch bound
- dynamic programming
- open shop
- optimal solution
- computational complexity
- search space
- particle swarm optimization
- objective function
- approximation algorithms
- markov random field
- simulated annealing
- linear programming
- expectation maximization
- np complete
- energy function
- particle swarm optimization algorithm
- memetic algorithm