A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts.
Atabak ElmiMaghsud SolimanpurSeyda TopalogluAfshin ElmiPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- job shop
- simulated annealing algorithm
- scheduling problem
- simulated annealing
- tabu search
- job shop scheduling
- open shop
- flowshop
- single machine
- np hard
- genetic algorithm
- search algorithm
- job shop scheduling problem
- processing times
- parallel machines
- metaheuristic
- mutation operator
- cost function
- linear programming
- feasible solution
- benchmark problems
- premature convergence
- special case
- completion times
- lower bound