Title of article
A hybridshiftingbottleneck-tabusearchheuristicforthejobshoptotal weightedtardinessproblem
Author/Authors
Kerem B¨ ulb ¨ ul ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
17
From page
967
To page
983
Abstract
In thispaper,westudythejobshopschedulingproblemwiththeobjectiveofminimizingthetotal
weightedtardiness.Weproposeahybridshiftingbottleneck-tabusearch(SB-TS)algorithmbyreplacing
the re-optimizationstepintheshiftingbottleneck(SB)algorithmbyatabusearch(TS).Intermsofthe
shiftingbottleneckheuristic,theproposedtabusearchoptimizesthetotalweightedtardinessforpartial
schedulesinwhichsomemachinesarecurrentlyassumedtohaveinfinitecapacity.Inthecontextof
tabu search,theshiftingbottleneckheuristicfeaturesalong-termmemorywhichhelpstodiversifythe
local search.Weexploitthissynergytodevelopastate-of-the-artalgorithmforthejobshoptotal
weightedtardinessproblem(JS-TWT).Thecomputationaleffectivenessofthealgorithmisdemon-
strated onstandardbenchmarkinstancesfromtheliterature.
Keywords
Weighted tardiness , Shifting bottleneck , Tabu search , Transportation problem , Preemption , Job shop
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927916
Link To Document