A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem.
Yuichi NagataIsao OnoPublished in: Comput. Oper. Res. (2018)
Keyphrases
- evolutionary computation
- job shop scheduling problem
- guided local search
- memetic algorithm
- tabu search
- genetic algorithm
- job shop scheduling
- metaheuristic
- critical path
- simulated annealing
- search procedure
- combinatorial optimization problems
- benchmark problems
- scheduling problem
- vehicle routing problem
- vehicle routing problem with time windows
- search algorithm
- feasible solution
- combinatorial optimization
- graph model
- traveling salesman problem
- particle swarm optimization
- heuristic methods
- optimization problems
- upper bound
- multi objective
- search space