Priority rules for job shops with weighted tardiness costs
Management Science
The shifting bottleneck procedure for job shop scheduling
Management Science
Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
A fast taboo search algorithm for the job shop problem
Management Science
Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Decomposition methods for large job shops
Computers and Operations Research
A heuristic for job shop scheduling to minimize total weighted tardiness
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Minimizing Total Weighted Tardiness in a Generalized Job Shop
Journal of Scheduling
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling Algorithms
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A hybrid immune simulated annealing algorithm for the job shop scheduling problem
Applied Soft Computing
A distributed shifting bottleneck heuristic for complex job shops
Computers and Industrial Engineering
Engineering Applications of Artificial Intelligence
Computers and Operations Research
Hi-index | 0.01 |
In modern manufacturing systems, due date related performance is becoming increasingly important in maintaining a high service reputation. However, compared with the extensive research on makespan minimization, research on the total weighted tardiness objective is comparatively scarce, partly because this objective function is more difficult and complex to optimize. In this paper, we focus on the job shop scheduling problem with the objective of minimizing total weighted tardiness. First, we discuss the mathematical programming model and its duality when the processing orders for each machine are fixed. Then, a block-based neighborhood structure is defined and its important properties are shown. Finally, a simulated annealing algorithm is designed which directly utilizes the features of this neighborhood. According to the computational results, the new neighborhood considerably promotes the searching capability of simulated annealing and helps it converge to high-quality solutions.