A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times.
Tamer F. AbdelmaguidPublished in: Appl. Math. Comput. (2015)
Keyphrases
- job shop scheduling
- scheduling problem
- sequence dependent setup times
- neighborhood search
- single machine
- flowshop
- job shop scheduling problem
- parallel machines
- tabu search
- precedence constraints
- variable neighborhood search
- simulated annealing
- single machine scheduling problem
- processing times
- np hard
- heuristic methods
- traveling salesman problem
- path relinking
- special case
- combinatorial optimization problems
- cost function
- lower bound
- genetic algorithm
- vehicle routing problem
- evolutionary computation
- optimization problems