A very fast TS/SA algorithm for the job shop scheduling problem.
Chaoyong ZhangPeigen LiYunqing RaoZailin GuanPublished in: Comput. Oper. Res. (2008)
Keyphrases
- job shop scheduling problem
- simulated annealing
- hybrid algorithm
- critical path
- optimization algorithm
- computational complexity
- cost function
- job shop scheduling
- dynamic programming
- multi objective
- search space
- tabu search
- objective function
- genetic algorithm
- bayesian networks
- benchmark problems
- memetic algorithm
- particle swarm optimization
- benchmark instances
- total weighted tardiness
- makespan minimization
- graphical models
- linear programming
- worst case
- scheduling problem
- probabilistic model
- optimal solution
- similarity measure