HE, CHENG; LIN, YIXUN; YUAN, JINJIANG - In: Asia-Pacific Journal of Operational Research (APJOR) 27 (2010) 05, pp. 577-585
It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time....