System Development of a Simulated Annealing Algorithm for Job-Shop Scheduling Problem Based on Delphi

Abstract

The job-shop scheduling is the key element of a manufacturing execution system (MES). It is significant for enterprises to utilize resources rationally, enhance product quality, shorten production cycle, reduce production cost, and improve its market competitiveness. In the paper, Simulated Annealing (SA) algorithm is adopted to solve the job-shop scheduling problem. SA algorithm is a random search method proposed to solve large-scale combinatorial optimization problems. As an efficient and general method, the optimization and convergence performance of SA algorithm is mainly affected by the problem and several factors. In order to facilitate use’s employment, a job-shop scheduling system based on SA algorithm is developed using Delphi. The system developed is verified by an example. The results show that it is an effective solution to the job-shop scheduling problems.