A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine

Author

Tasgetiren, M. Fatih ; Pan, Quan-ke ; Liang, Yun-Chia ; Suganthan, P.N.

Author_Institution

Dept. of Operations Manage. & Busisness Stat., Sultan Qaboos Univ., Muscat

fYear

2007

fDate

1-5 April 2007

Firstpage

271

Lastpage

278

Abstract

In this paper, a discrete differential evolution (DDE) algorithm is presented to solve the single machine total earliness and tardiness penalties with a common due date. A new binary swap mutation operator called Bswap is presented. In addition, the DDE algorithm is hybridized with a local search algorithm to further improve the performance of the DDE algorithm. The performance of the proposed DDE algorithm is tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library. The computational experiments showed that the proposed DDE algorithm has generated better results than those in the literature in terms of both solution quality and computational time

Keywords

genetic algorithms; mathematical operators; search problems; single machine scheduling; Bswap; binary swap mutation operator; discrete differential evolution algorithm; local search algorithm; single machine tardiness penalties; single machine total earliness; Benchmark testing; Computational intelligence; Genetic algorithms; Genetic mutations; Heuristic algorithms; Libraries; Optimal scheduling; Processor scheduling; Scheduling algorithm; Single machine scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Conference_Location

Honolulu, HI

Print_ISBN

1-4244-0704-4

Type

conf

DOI

10.1109/SCIS.2007.367701

Filename

4218628