Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems
by R. Maheswaran, S.G. Ponnambalam, N. Jawahar
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 4, No. 1/2, 2008

Abstract: This paper addresses on solving a well known Non Polynomial (NP) hard type problem, namely the single machine total weighted-tardiness problem. The performances of three hybrid heuristic algorithms to solve the single machine scheduling problems with the objective of minimising the total weighted tardiness are presented and compared. In the first hybrid algorithm, a dynamic dispatching rule, namely Modified Due Date (MDD), is hybridised with local search mechanism. In the second hybrid algorithm, a greedy heuristic, namely backward phase, is proposed and hybridised with local search mechanisms. The third hybrid algorithm hybridises the backward phase heuristics with an iterated local search (ILS) having an evolutionary perturbation tool. The algorithms are tested by solving all the 125 benchmark problem instances available in the OR-Library for different sizes and compared with the best known values. It is observed that the hybrid algorithm with evolutionary perturbation tool is performing better than the others.

Online publication date: Sat, 22-Dec-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com