A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling.
Dipak LahaPublished in: SEMCCO (2012)
Keyphrases
- minimizing makespan
- simulated annealing
- maximum tardiness
- tabu search
- scheduling problem
- setup times
- flowshop
- solution quality
- genetic algorithm
- metaheuristic
- combinatorial optimization
- hill climbing
- processing times
- simulated annealing algorithm
- evolutionary algorithm
- search procedure
- hybrid algorithm
- global optimum
- single machine
- feasible solution
- genetic algorithm ga
- heuristic methods
- np hard
- optimal solution
- strongly np hard
- hybrid meta heuristic
- neural network
- parallel machines
- objective function
- bayesian networks