title   
  

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Bülbül, Kerem (2010) A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. (Submitted)

WarningThere is a more recent version of this item available.

[img]
Preview
PDF (This is a RoMEO green publisher - author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
415Kb

Abstract

In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-TS) algorithm by replacing the reoptimization step in the shifting bottleneck (SB) algorithm by a tabu search (TS). In terms of the shifting bottleneck heuristic, the proposed tabu search optimizes the total weighted tardiness for partial schedules in which some machines are currently assumed to have infinite capacity. In the context of tabu search, the shifting bottleneck heuristic features a long-term memory which helps to diversify the local search. We exploit this synergy to develop a state-of-the-art algorithm for the job shop total weighted tardiness problem (JS-TWT). The computational effectiveness of the algorithm is demonstrated on standard benchmark instances from the literature.

Item Type:Article
Uncontrolled Keywords:job shop; weighted tardiness; shifting bottleneck; tabu search; preemption; transportation problem.
Subjects:Q Science > QA Mathematics
T Technology > TA Engineering (General). Civil engineering (General)
ID Code:13948
Deposited By:Kerem Bülbül
Deposited On:13 May 2010 10:53
Last Modified:06 Dec 2010 15:49

Available Versions of this Item

Repository Staff Only: item control page