A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem.
Marco Antonio Cruz-ChavezJuan Frausto SolísPublished in: MICAI (2006)
Keyphrases
- critical path
- job shop scheduling problem
- job shop scheduling
- simulated annealing
- benchmark problems
- tabu search
- memetic algorithm
- benchmark instances
- optimization algorithm
- combinatorial optimization
- objective function
- tabu search algorithm
- scheduling problem
- dynamic programming
- graph model
- search strategy
- optimization problems
- combinatorial optimization problems
- np hard
- information retrieval