GA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines.
Panneerselvam SenthilkumarSockalingam NarayananPublished in: Intell. Inf. Manag. (2011)
Keyphrases
- single machine scheduling problem
- variable neighborhood search
- combinatorial optimization
- lagrangian relaxation
- branch and bound algorithm
- search procedure
- release dates
- weighted tardiness
- processing times
- sequence dependent setup times
- single machine
- optimal solution
- setup times
- dynamic programming
- simulated annealing
- genetic algorithm ga
- genetic algorithm
- tabu search
- resource consumption
- precedence constraints
- scheduling problem
- linear programming
- lower and upper bounds
- mixed integer programming
- integer programming
- fitness function
- feasible solution
- job shop scheduling problem
- cost function
- search algorithm