An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint.
Joachim BreitPublished in: Inf. Process. Lett. (2004)
Keyphrases
- preprocessing
- detection algorithm
- significant improvement
- improved algorithm
- objective function
- k means
- dynamic programming
- optimal solution
- worst case
- computational cost
- experimental evaluation
- np hard
- particle swarm optimization
- cost function
- times faster
- error bounds
- energy function
- closed form
- constraint satisfaction problems
- expectation maximization
- mobile robot
- input data
- linear programming
- high accuracy
- neural network
- special case
- computational complexity
- bayesian networks
- learning algorithm