A heuristic for the single machine tardiness problem Article

Panwalkar, SS, Smith, ML, Koulamas, CP. (1993). A heuristic for the single machine tardiness problem . 70(3), 304-310. 10.1016/0377-2217(93)90241-E



cited authors

  • Panwalkar, SS; Smith, ML; Koulamas, CP

fiu authors

abstract

  • A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time. © 1993.

publication date

  • November 12, 1993

Digital Object Identifier (DOI)

start page

  • 304

end page

  • 310

volume

  • 70

issue

  • 3