A Single Machine Scheduling Problem with Earliness and Tardiness Penalties Using Memetic Algorithm

Abstract

This paper considers single machine scheduling problem. The objective is to determine sum of earliness and tardiness cost has been minimized. The memetic algorithm is developed to solve this problem. To evaluate performance of memetic algorithm, the solution of propose method is compare with the optimal solution. The results show that the average percentage deviation is less than 10. Here, the computational time required by the MA is significantly less than the time required by the optimal solution method. This result is more emphasized as the problem size is getting larger.

Untitled

“…A single machine scheduling problem with controllable processing times without inserted idle time to minimize total tardiness and earliness is presented by Kayvanfar et al [5]. Kaweegitbundit developed a memetic algorithm for minimizing earliness and tardiness penalties [6] Kedad Sidhoum and Sourd proposed a neighborhood search algorithm for the single machine earliness-tardiness which jobs have distinct due dates [7]. Allaoua and Osmane proposed a new genetic algorithm inspired by the philosophy of dynamic programming, where the chromosome and the population lengths are varied from one iteration to another for earliness and tardiness problem [8].…”