A simulated annealing approach to the solution of job rotation scheduling problems.
Serap Ulusam SeçkinerMustafa KurtPublished in: Appl. Math. Comput. (2007)
Keyphrases
- simulated annealing
- scheduling problem
- processing times
- flowshop
- solution quality
- job shop
- tabu search
- job shop scheduling problem
- global optimum
- greedy heuristics
- solution space
- simulated annealing algorithm
- search procedure
- single machine
- sequencing problems
- integer programming
- optimization method
- combinatorial optimization
- np complete
- single machine scheduling problem
- sequence dependent setup times
- optimal solution
- genetic algorithm
- neural network