An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
2019 ◽
Vol 275
(1)
◽
pp. 35-44
◽
2018 ◽
Vol 93
◽
pp. 135-150
◽
2011 ◽
Vol 38
(1)
◽
pp. 14-20
◽
1998 ◽
Vol 11
(3)
◽
pp. 274-287
◽