Job scheduling on Identical Parallel Machines to Minimize Total Tardiness

The scheduling problem for identical parallel machines, with the objective of minimizing total tardiness, holds significant importance in production scheduling. However, addressing large-scale instances of this scheduling problem, involving numerous jobs and machines, has proven challenging. The application of metaheuristic approaches, such as Simulated Annealing, has been observed efficient in solving complex combinatorial optimization problems. This paper presents a Simulated Annealing algorithm to address the identical machine scheduling problem aimed at minimizing total tardiness. A practical application of scheduling jobs on identical machines in die casting industry is presented through a numerical example.