A simulated annealing algorithm for job shop scheduling problem

Abstract

Job shop scheduling problem (JSSP) is an optimization problem in computer science and operations research where jobs are allocated to resources at a specific time. This paper discusses the job shop scheduling problem based on a simulated annealing algorithm, and uses the IBM's optimization engine CPLEX solver to solve the same small data and low complexity instance. The solution results of the simulated annealing algorithm are compared with those of the CPLEX using two indicators-solution result and algorithm time. The comparative results indicate that the our proposed simulated annealing algorithm easily dominates the CPLEX solver.