A decomposition algorithm for the single machine total tardiness problem

Baker, 1978, Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks, Operations Res., 26, 111, 10.1287/opre.26.1.111

Emmons, 1969, One-machine sequencing to minimize certain functions of job tardiness, Operations Res., 17, 701, 10.1287/opre.17.4.701

Fisher, 1976, A dual algorithm for the one-machine scheduling problem, Math. Programming, 11, 229, 10.1007/BF01580393

Lawler, 1977, A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math., 1, 331, 10.1016/S0167-5060(08)70742-8

Picard, 1978, The time-dependent traveling salesman problem and applications to the tardiness problem in one-machine scheduling, Operations Res., 26, 88, 10.1287/opre.26.1.86

Rinnooy Kan, 1975, Minimizing total costs in one-machine scheduling, Operations Res., 23, 908, 10.1287/opre.23.5.908

Schrage, 1978, Dynamic programming solution of sequencing problems with precedence constraints, Operations Res., 26, 444, 10.1287/opre.26.3.444

Shwimer, 1972, On the n-job, one-machine sequence-independent scheduling problem with tardiness penalties: A branch and bound solution, Management Sci., 18, 301, 10.1287/mnsc.18.6.B301

Srinivasan, 1971, A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness, Naval Res. Logist. Quart., 18, 317, 10.1002/nav.3800180304