Robust buffer allocation for scheduling of a project with predefined milestones

Abstract

The paper discusses the problem of robust buffer allocation for Resource-Constrained Project Scheduling Problem (RCPSP) with predefined milestones1 , for which execution deadlines have been established. To solve the problem, an algorithm is proposed supporting insertion of unit time buffers, with the simultaneous maximisation of new metrics of arrangement robustness. The presented results of experimental research speak for usability of the solutions proposed. The effectiveness is studied with use of test tasks2 included in the Project Scheduling Problem Library (PSPLIB) with additionally specified project milestones.