An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

Dmitry I. Arkhipov, Olga Battaïa, Alexander A. Lazarev. An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. European Journal of Operational Research, 275(1):35-44, 2019. [doi]

Abstract

Abstract is missing.