Hybrid solving algorithm for complex machine scheduling problem.
Javad BehnamianSeyyed M. T. Fatemi GhomiMostafa ZandiehPublished in: IEEM (2011)
Keyphrases
- np hard
- scheduling problem
- objective function
- combinatorial optimization
- computational cost
- gradient projection
- strongly np hard
- times faster
- linear programming
- high accuracy
- experimental evaluation
- dynamic programming
- preprocessing
- cost function
- significant improvement
- search space
- ant colony optimization
- computational complexity
- hybrid algorithm
- optimization algorithm
- clustering method
- tabu search
- convergence rate
- recognition algorithm
- data structure
- neural network