A simulated annealing approach to minimize the maximum lateness on uniform parallel machines.
Kai LiShanlin YangHua-Wei MaPublished in: Math. Comput. Model. (2011)
Keyphrases
- maximum lateness
- simulated annealing
- single machine
- scheduling problem
- flowshop
- tabu search
- precedence constraints
- parallel machines
- sequence dependent setup times
- release dates
- genetic algorithm
- processing times
- metaheuristic
- evolutionary algorithm
- single machine scheduling problem
- combinatorial optimization
- solution quality
- batch processing machines
- optimization method
- branch and bound algorithm
- genetic algorithm ga
- reinforcement learning
- hybrid algorithm
- global constraints
- particle swarm optimization pso
- setup times
- supply chain
- upper bound
- np hard