A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times.
Qiao ZhangHervé ManierMarie-Ange ManierPublished in: Comput. Oper. Res. (2012)
Keyphrases
- search procedure
- job shop scheduling
- tabu search
- scheduling problem
- processing times
- job shop scheduling problem
- single machine
- genetic algorithm
- flowshop
- simulated annealing
- single machine scheduling problem
- precedence constraints
- path relinking
- job shop
- memetic algorithm
- feasible solution
- hybrid algorithm
- release dates
- production scheduling
- np hard
- test problems
- worst case performance ratio
- hill climbing
- metaheuristic
- search algorithm
- vehicle routing problem
- parallel machines
- search heuristics
- variable neighborhood search
- identical machines
- constraint programming
- search procedures
- multi objective
- search space
- benchmark problems
- max sat
- constraint satisfaction
- resource consumption
- combinatorial problems
- np complete
- hyper heuristics
- particle swarm optimization
- evolutionary algorithm