A Simulated Annealing algorithm for integrated production and delivery

This paper constructs a scheduling method of an integrated production and delivery scheduling system based on Simulated Annealing approach. The system includes one distributor and one manufacturer with a single machine. The jobs are released at different times, and the goal is to minimize the sum of waiting punishment cost and delivery cost. The problem is NP-hard in the strong sense. To reduce the search space effectively, a method of solution presentation and two methods of neighbor generation are proposed and used to construct a Simulated Annealing algorithm. The performance of the algorithm is tested through random data. It is shown that the proposed algorithm can offer satisfied solutions with high quality in reasonable time.