The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem.
Marco Antonio Cruz-ChavezJuan Frausto SolísFernando Ramos-QuintanaPublished in: International Conference on Computational Intelligence (2004)
Keyphrases
- critical path
- job shop scheduling problem
- benchmark instances
- job shop scheduling
- benchmark problems
- tabu search
- scheduling problem
- genetic algorithm
- simulated annealing
- memetic algorithm
- combinatorial optimization problems
- graph model
- combinatorial optimization
- tabu search algorithm
- optimization problems
- neural network