A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times.
Paolo BrandimarteEdoardo FaddaPublished in: Comput. Oper. Res. (2024)
Keyphrases
- total weighted tardiness
- job shop scheduling problem
- sequence dependent setup times
- variable neighborhood search
- scheduling problem
- single machine scheduling problem
- single machine
- job shop scheduling
- tabu search
- benchmark instances
- simulated annealing
- flowshop
- memetic algorithm
- benchmark problems
- parallel machines
- precedence constraints
- job shop
- setup times
- genetic algorithm
- graph model
- metaheuristic
- release dates
- lot sizing
- processing times
- combinatorial optimization problems
- combinatorial optimization
- heuristic methods
- traveling salesman problem
- path relinking
- neural network
- minimum spanning tree
- routing problem
- search procedure
- lagrangian relaxation
- np complete
- optimization problems