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

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 314-316)

Edited by:

Jian Gao

Pages:

2353-2357

DOI:

10.4028/www.scientific.net/AMR.314-316.2353

Citation:

P. Kaweegitbundit "A Single Machine Scheduling Problem with Earliness and Tardiness Penalties Using Memetic Algorithm", Advanced Materials Research, Vols. 314-316, pp. 2353-2357, 2011

Online since:

August 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.