An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date

Zne-Jung Lee,Kuo-Ching Ying,Chen-Chia Chuang

doi:10.1007/978-3-540-74827-4_87

An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date

Zne-Jung Lee, Kuo-Ching Ying + Show 1 more

https://doi.org/10.1007/978-3-540-74827-4_87

Copy DOI

Publication Date: Jan 1, 2007

Citations: 17

Affiliation: Huafan University, National Ilan University

#Common Due Date #Single Machine + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text