Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic.
Kuo-Ching YingShih-Wei LinPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- metaheuristic
- scheduling problem
- single machine
- tabu search
- processing times
- search space
- simulated annealing
- ant colony optimization
- flowshop
- optimization problems
- iterated local search
- search algorithm
- scatter search
- np hard
- optimal solution
- path relinking
- combinatorial optimization
- setup times
- genetic algorithm
- vehicle routing problem
- constraint satisfaction
- feasible solution
- release dates
- solution space
- job shop scheduling problem
- precedence constraints
- guided local search
- multi start
- particle swarm optimization
- parallel machines
- memetic algorithm
- nature inspired
- harmony search
- metaheuristic algorithms
- benchmark instances
- evolutionary algorithm
- search procedure
- variable neighborhood search
- approximation algorithms
- single machine scheduling problem
- constraint propagation
- swarm intelligence