A Hybrid Metaheuristic for Solving Single Machine Scheduling Problem.
Adrian SerbencuViorel MînzuDaniela CernegaAdriana SerbencuPublished in: ICINCO-ICSO (2009)
Keyphrases
- single machine scheduling problem
- hybrid metaheuristic
- variable neighborhood search
- combinatorial optimization
- metaheuristic
- vehicle routing problem
- branch and bound algorithm
- scatter search
- processing times
- traveling salesman problem
- resource consumption
- precedence constraints
- path relinking
- neural network
- simulated annealing
- single machine
- branch and bound
- multi objective
- hybrid method
- routing problem
- heuristic methods
- lagrangian relaxation
- search procedure
- minimum spanning tree
- tabu search
- artificial neural networks