Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
2014 ◽
Vol 39
(1)
◽
pp. 17-26
◽
Keyword(s):
Abstract It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In this paper we give an O(n2) algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm
2003 ◽
Vol 31
(4)
◽
pp. 323-326
◽
Keyword(s):
2006 ◽
Vol 175
(2)
◽
pp. 769-781
◽
Keyword(s):
Keyword(s):
Keyword(s):
2018 ◽
pp. 331-348
◽
Keyword(s):
Keyword(s):
2000 ◽
Vol 33
(17)
◽
pp. 715-722
◽
2004 ◽
Vol 55
(3)
◽
pp. 277-286
◽
2007 ◽
Vol 18
(02)
◽
pp. 341-359
◽
2003 ◽
Vol 32
(5)
◽
pp. 1370-1388
◽