Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
Roger Z. Ríos-MercadoJonathan F. BardPublished in: Comput. Oper. Res. (1998)
Keyphrases
- cost function
- experimental evaluation
- recognition algorithm
- optimization algorithm
- computationally efficient
- preprocessing
- significant improvement
- dynamic programming
- high accuracy
- learning algorithm
- detection algorithm
- worst case
- k means
- search space
- segmentation algorithm
- objective function
- similarity measure
- times faster
- selection algorithm
- improved algorithm
- flowshop scheduling
- np hard
- probabilistic model
- simulated annealing
- search algorithm
- ant colony optimization
- path planning
- neural network