Local search metaheuristics for discrete-continuous scheduling problems.
Joanna JózefowskaMarek MikaRafal RózyckiGrzegorz WaligóraJan WeglarzPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- scheduling problem
- tabu search
- job shop scheduling problem
- discrete space
- simulated annealing
- continuous domains
- combinatorial optimization
- memetic algorithm
- continuous variables
- genetic algorithm
- metaheuristic
- np hard
- continuous action
- continuous data
- discrete data
- iterated local search
- discrete variables
- flowshop
- continuous space
- path relinking
- single machine
- continuous optimization
- job shop
- continuous valued
- continuous functions
- multi start
- discrete valued
- optimal solution
- processing times
- initial solution
- job shop scheduling
- search procedure
- search algorithm
- variable neighborhood search
- setup times
- vehicle routing problem
- precedence constraints
- global search
- scatter search
- hill climbing
- search procedures
- parallel machines
- search strategies
- optimization problems
- continuous state spaces
- lower bound
- evolutionary algorithm
- search space
- greedy randomized adaptive search procedure
- greedy heuristics
- special case
- particle swarm optimization
- nature inspired
- benchmark problems