Priority rules for job shops with weighted tardiness costs
Management Science
Scheduling in a sequence dependent setup environment with genetic search
Computers and Operations Research - Special issue on genetic algorithms
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
Computers and Operations Research
Raising the hit rate for wafer fabrication by a simple constructive heuristic
Expert Systems with Applications: An International Journal
A hybrid electromagnetism-like algorithm for single machine scheduling problem
Expert Systems with Applications: An International Journal
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Expert Systems with Applications: An International Journal
Computers and Operations Research
Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm
Journal of Systems and Software
Computers and Operations Research
A GRASP based on DE to solve single machine scheduling problem with SDST
Computational Optimization and Applications
Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times
Expert Systems with Applications: An International Journal
Computers and Operations Research
Journal of Parallel and Distributed Computing
Hi-index | 12.05 |
The single-machine tardiness problem with sequence dependent setup times is a core topic for scheduling studies. Tardiness is actually a difficult criterion to deal with, even in a relatively simple manufacturing system, such as a single-machine is strongly NP-hard. Motivated by the computational complexity of this problem, a simple iterated greedy (IG) heuristic is proposed to solve it. To validate and verify the proposed IG heuristic, computational experiments were conducted on three benchmark problem sets that included weighted and un-weighted tardiness problems. The experiment results clearly indicate that the proposed IG heuristic is highly effective as compared to the state-of-the-art meta-heuristics on the same benchmark instances. In terms of both solution quality and computational expense, this study successfully develops an effective and efficient approach for single-machine total tardiness problems with sequence dependent setup times.