A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant
2002 ◽
Vol 19
(5)
◽
pp. 59-67
◽
2010 ◽
Vol 110
(8-9)
◽
pp. 325-330
◽
Keyword(s):
2016 ◽
Vol 33
(05)
◽
pp. 1650034
◽
2013 ◽
Vol 787
◽
pp. 1020-1024
2013 ◽
Vol 2013
◽
pp. 1-6
◽
1998 ◽
Vol 21
(2)
◽
pp. 189-196
◽
Keyword(s):
2015 ◽
Vol 775
◽
pp. 449-452
2013 ◽
Vol 7
(2)
◽
pp. 206
◽
Keyword(s):