A hybridshiftingbottleneck-tabusearchheuristicforthejobshoptotal weightedtardinessproblem

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.