Polynomially solvable total tardiness problems: Review and extensions Article

Koulamas, C. (1997). Polynomially solvable total tardiness problems: Review and extensions . OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 25(2), 235-239. 10.1016/S0305-0483(96)00064-3

cited authors

  • Koulamas, C

authors

abstract

  • This paper shows that all polynomially solvable cases of the single machine total tardiness problem center around or are direct extensions of three well known results for that problem. A new polynomially solvable case for the problem is developed as well. It is also shown that two of these well known results for the single machine total tardiness problem are valid for the parallel machine total tardiness problem as well. © 1997 Elsevier Science Ltd.

publication date

  • January 1, 1997

published in

Digital Object Identifier (DOI)

start page

  • 235

end page

  • 239

volume

  • 25

issue

  • 2