Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem.
Nilsen KundakciOsman KulakPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- job shop scheduling problem
- minimizing makespan
- scheduling problem
- hybrid genetic algorithm
- job shop scheduling
- genetic operators
- critical path
- tabu search
- genetic algorithm
- benchmark problems
- simulated annealing
- memetic algorithm
- single machine
- flowshop
- graph model
- benchmark instances
- quadratic assignment problem
- np hard
- parallel machines
- precedence constraints
- setup times
- metaheuristic
- neural network
- genetic programming
- combinatorial optimization problems
- processing times
- vehicle routing problem