Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times.
Miguel A. GonzálezMaría R. SierraCamino R. VelaRamiro VarelaJorge PuentePublished in: ICSOFT (2) (2006)
Keyphrases
- job shop scheduling problem
- makespan minimization
- total weighted tardiness
- sequence dependent setup times
- scheduling problem
- tabu search
- single machine
- parallel machines
- flowshop
- job shop scheduling
- simulated annealing
- setup times
- benchmark instances
- benchmark problems
- weighted tardiness
- production scheduling
- single machine scheduling problem
- release dates
- genetic algorithm
- metaheuristic
- memetic algorithm
- precedence constraints
- processing times
- combinatorial optimization problems
- combinatorial optimization
- job shop
- lot sizing
- variable neighborhood search
- graph model
- vehicle routing problem
- hybrid algorithm
- particle swarm optimization
- neural network
- dynamic programming
- polynomial time approximation
- optimization problems
- feasible solution
- search procedure