Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines.
Panneerselvam SenthilkumarSockalingam NarayananPublished in: Intell. Inf. Manag. (2011)
Keyphrases
- simulated annealing algorithm
- single machine scheduling problem
- simulated annealing
- branch and bound algorithm
- combinatorial optimization
- weighted tardiness
- processing times
- search procedure
- search algorithm
- hybrid algorithm
- single machine
- precedence constraints
- genetic algorithm
- lagrangian relaxation
- lower bound
- particle swarm optimization pso
- upper bound
- mutation operator
- branch and bound
- tabu search
- dynamic programming
- evolutionary algorithm
- resource consumption