Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem

Authors:
Rym M'Hallah;Ali Alhajraf
Affiliations:
Department of Statistics and Operations Research, Kuwait University, Safat, Kuwait 13060;Department of Statistics and Operations Research, Kuwait University, Safat, Kuwait 13060
Venue:
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Year:
2008

Citing 12
Cited 0

The single machine early/tardy problem

Management Science
A composite heuristic for the single machine early/tardy job scheduling problem

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

Computers and Operations Research
A Graph-based Ant system and its convergence

Future Generation Computer Systems
An ant colony system for permutation flow-shop sequencing

Computers and Operations Research
Ant Colony Optimization

Ant Colony Optimization
Improved heuristics for the early/tardy scheduling problem with no idle time

Computers and Operations Research
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

Computers and Operations Research
Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method

Robotics and Computer-Integrated Manufacturing
Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system

Expert Systems with Applications: An International Journal
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an ant colony optimization hybrid heuristic (ACH) for the total earliness tardiness single machine scheduling problem where jobs have different processing times and distinct due dates, and the machine can not be idle. ACH is an ant colony system with daemon actions that intensify the search around good quality solutions. The computational results show the effectiveness of ACH.