Total Tardiness Problem on Identical Parallel Machines

The total tardiness problem on identical parallel machines is to find an optimal schedule that minimizes the total tardiness of given n jobs by processing them on m identical parallel machines.

[TA08] S. Tanaka and M. Araki. A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics 113(5), p. 446-458, 2008. DOI: 10.1016/j.ijpe.2007.10.006

m=2, 3, 4, 5, 6, 7, 8, 9, 10

• n=20
  • [pmttbench_n=20.zip]
• n=30
  • [pmttbench_n=25.zip]

Optimal values and computation times on a desktop computer with an Intel Pentium4 CPU at 2.4GHz and 512MB RAM.

• n=20
  • [pmttopt_n=20.zip]
• n=30
  • [pmttopt_n=25.zip]