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

• Published in: European journal of operational research Vol. 275; no. 1; pp. 35 - 44
• Main Authors: Arkhipov, Dmitry, Battaïa, Olga, Lazarev, Alexander
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 16.05.2019; Elsevier
• Subjects: Computer Science; Lower bounds; Operations Research; Project scheduling; Pseudo-polynomial algorithms; RCPSP; Scheduling; Lower bounds; Project scheduling; Scheduling; Pseudo-polynomial algorithms; RCPSP

•New task domain adjustment techniques for project scheduling problem are presented.•A pseudo-polynomial algorithm is developed for a lower bound on project duration.•The efficiency of the algorithms is shown on benchmark and industrial instances. Several algorithms for finding a lower bound on the...