scholarly journals 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 ◽  
Author(s):  
Dmitry Arkhipov ◽  
Olga Battaïa ◽  
Alexander Lazarev
Sign in / Sign up

Export Citation Format

Share Document