Minimizing the total completion time and total earliness time functions for a machine scheduling problem using local search methods

Abstract

In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems 1//(∑Cj ∑Ej) and 1//∑Cj + ∑Ej. The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.