Paper Info
Title
An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date
Abstract
In this paper, an intelligent algorithm for scheduling jobs on a single machine with a common due date is introduced. This problem of scheduling jobs on a single machine, known as NP-complete problem, is against the common due date with respect to earliness and tardiness penalties. In the proposed algorithm, the properties of scheduling jobs on a single machine with a common due date are well derived with ant colony optimization (ACO). Furthermore, the heuristic is embedded into ACO as local search to escape from local optima. Simulation results show that the proposed intelligent algorithm yields the best performance among existing algorithms.
Year
DOI
Venue
2007
10.1007/978-3-540-74827-4_87
KES (2)
Keywords
Field
DocType
scheduling jobs,ant colony optimization,local optimum,single machine,common due date,intelligent algorithm,np-complete problem,best performance,proposed algorithm,local search,proposed intelligent algorithm yield,np complete problem
Ant colony optimization algorithms,Heuristic,Mathematical optimization,Tardiness,Scheduling (computing),Local optimum,Computer science,Algorithm,Local search (optimization)
Conference
Volume
ISSN
Citations 
4693
0302-9743
2
PageRank 
References 
Authors
0.37
15
3
Name
Order
Citations
PageRank
Zne-Jung Lee194043.45
Chen-Chia Chuang254034.02
Kuo-Ching Ying371236.47