Priority rules for job shops with weighted tardiness costs
Management Science
The shifting bottleneck procedure for job shop scheduling
Management Science
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Decomposition methods for large job shops
Computers and Operations Research
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems
Journal of Heuristics
Minimizing Total Weighted Tardiness in a Generalized Job Shop
Journal of Scheduling
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A new model for the preemptive earliness-tardiness scheduling problem
Computers and Operations Research
A linear programming-based method for job shop scheduling
Journal of Scheduling
Computers and Operations Research
Hi-index | 0.01 |
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 re-optimization 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.