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

Authors:
Zne-Jung Lee;Chen-Chia Chuang;Kuo-Ching Ying
Affiliations:
Deptartment of Information Management, Huafan University, No. 1, Huafan Rd. Shihding Township, Taipei County, 22301, Taiwan, R.O.C.;Department of Electrical Engineering, National Ilan University, Taiwan, R.O.C.;Deptartment of Industrial Engineering and Management Information, Huafan University, No. 1, Huafan Rd. Shihding Township, Taipei County, 22301, Taiwan, R.O.C.
Venue:
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Year:
2007

Citing 12
Cited 0

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions

Computers and Operations Research
Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

Computers and Industrial Engineering
Using tabu search to solve the common due date early/tardy machine scheduling problem

Computers and Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Ant Colony Optimization

Ant Colony Optimization
Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

Journal of Heuristics
A hybrid search algorithm with heuristics for resource allocation problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.