Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems

Authors:
R. Maheswaran;S. G. Ponnambalam;N. Jawahar
Affiliations:
Department of Computer Science and Engineering, MEPCO Schlenk Engineering College, Sivakasi 626005, Virudunagar District, Tamilnadu, India.;School of Engineering, Monash University, Sunway Campus, Petaling Jaya 46150, Selangor, Malaysia.;Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai 625 015, Tamilnadu, India
Venue:
International Journal of Intelligent Systems Technologies and Applications
Year:
2008

Citing 6
Cited 1

A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem

Computers and Industrial Engineering - Special issue on computer aided maintenance
Scheduling Algorithms

Scheduling Algorithms
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Operations Research Letters

Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.