A metaheuristic for the fixed job scheduling problem under spread time constraints.
André RossiAlok SinghMarc SevauxPublished in: Comput. Oper. Res. (2010)
Keyphrases
- metaheuristic
- tabu search
- scheduling problem
- flowshop
- combinatorial problems
- iterated local search
- processing times
- makespan minimization
- ant colony optimization
- simulated annealing
- optimization problems
- optimal solution
- scatter search
- path relinking
- single machine
- vehicle routing problem
- combinatorial optimization
- precedence constraints
- genetic algorithm
- release dates
- memetic algorithm
- benchmark instances
- setup times
- single machine scheduling problem
- np hard
- sequence dependent setup times
- search procedure
- completion times
- search space
- variable neighborhood search
- nature inspired
- multi start
- global constraints
- feasible solution
- particle swarm optimization
- heuristic methods
- parallel machines
- set of benchmark instances
- job shop scheduling problem
- approximation algorithms
- branch and bound
- traveling salesman problem
- constraint satisfaction
- evolutionary algorithm
- search algorithm
- hybrid metaheuristic
- dantzig wolfe
- guided local search