A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines.
Rainer AmorimBruno DiasRosiane de Freitas RodriguesEduardo UchoaPublished in: GECCO (Companion) (2013)
Keyphrases
- scheduling problem
- identical parallel machines
- tabu search
- job shop scheduling problem
- processing times
- scheduling jobs
- single machine
- np hard
- flowshop
- strongly np hard
- search algorithm
- memetic algorithm
- search procedure
- setup times
- parallel machines
- release dates
- precedence constraints
- search space
- sequence dependent setup times
- simulated annealing
- optimal solution
- combinatorial optimization
- genetic algorithm
- special case
- evolutionary algorithm