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

Warning The system is temporarily closed to updates for reporting purpose.

Bülbül, Kerem (2010) A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. [Working Paper / Technical Report] Sabanci University ID:SU_FENS_2010/0002

[thumbnail of jobshop_WT_updated.pdf] PDF
jobshop_WT_updated.pdf

Download (412kB)

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: Working Paper / Technical Report
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)
Divisions: Faculty of Engineering and Natural Sciences
Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Depositing User: Kerem Bülbül
Date Deposited: 13 May 2010 16:21
Last Modified: 26 Apr 2022 10:48
URI: https://research.sabanciuniv.edu/id/eprint/13951

Actions (login required)

View Item
View Item