A tabu search algorithm for the single machine total weighted tardiness problem

A tabu search algorithm for the single machine total weighted tardiness problem

0.00 Avg rating0 Votes
Article ID: iaor20084378
Country: Netherlands
Volume: 176
Issue: 3
Start Page Number: 1423
End Page Number: 1435
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics: tabu search
Abstract:

In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveals that the problem is NP-hard, rendering it a challenging area for meta-heuristic approaches. This paper presents a totally deterministic TS algorithm with a hybrid neighborhood and dynamic tenure structure, and investigates the strength of several candidate list strategies based on problem specific characteristics in increasing the efficiency of the search. The proposed TS approach yields very high quality results for a set of benchmark problems obtained from the literature.

Reviews

Required fields are marked *. Your email address will not be published.