A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times.
Purushothaman DamodaranMario C. Vélez-GallegoPublished in: Expert Syst. Appl. (2012)
Keyphrases
- batch processing machines
- simulated annealing algorithm
- maximum lateness
- simulated annealing
- single machine
- genetic algorithm
- scheduling problem
- search algorithm
- sequence dependent setup times
- release dates
- parallel machines
- flowshop
- precedence constraints
- single machine scheduling problem
- mutation operator
- shared memory
- hybrid algorithm
- lower bound