SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION
2010 ◽
Vol 27
(05)
◽
pp. 577-585
◽
Keyword(s):
Np Hard
◽
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. And in this paper we present some algorithms for these problems with running time O(n log n).
2011 ◽
Vol 328-330
◽
pp. 404-407
2012 ◽
Vol 112
(3)
◽
pp. 72-76
◽
Keyword(s):
2001 ◽
Vol 132
(1)
◽
pp. 224-242
◽
Keyword(s):
2016 ◽
Vol 248
(1)
◽
pp. 123-135
◽
2018 ◽
Vol 30
(1)
◽
pp. 168-180
◽
2019 ◽
Keyword(s):
2019 ◽
Vol 102
◽
pp. 130-140
◽
Keyword(s):