Approximation algorithm for constrained coupled-tasks scheduling problem.
Gilles SimoninBenoît DartiesJean-Claude KönigRodolphe GiroudeauPublished in: CoDIT (2014)
Keyphrases
- scheduling problem
- np hard
- experimental evaluation
- preprocessing
- search space
- computational cost
- dynamic programming
- matching algorithm
- high accuracy
- optimal solution
- cost function
- times faster
- ant colony optimization
- worst case
- k means
- objective function
- multi objective
- computational complexity
- recognition algorithm
- segmentation algorithm
- optimization algorithm
- learning algorithm
- path planning
- convex hull
- polygonal approximation
- approximation methods
- approximation algorithms
- single machine
- neural network
- list scheduling
- closed form
- metaheuristic
- clustering method
- simulated annealing
- probabilistic model
- special case
- genetic algorithm