Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints.
Moussa AbderrahimAbdelghani BekrarDamien TrentesauxNassima AissaniKarim BouamranePublished in: Optim. Lett. (2022)
Keyphrases
- job shop scheduling problem
- variable neighborhood search
- tabu search
- benchmark instances
- total weighted tardiness
- memetic algorithm
- metaheuristic
- simulated annealing
- neighborhood search
- scheduling problem
- benchmark problems
- path relinking
- genetic algorithm
- feasible solution
- vehicle routing problem
- heuristic methods
- search algorithm
- search procedure
- combinatorial optimization problems
- graph model
- combinatorial optimization
- scatter search
- evolutionary algorithm
- global constraints
- constraint programming
- test problems
- routing problem
- combinatorial problems
- evolutionary computation
- genetic programming
- optimization problems
- np hard
- special case