The article presents a model for the Resource-Constrained Project Scheduling Problem (RCPSP) with defined project milestone deadlines. A priority-based buffer allocation algorithm is proposed for this model. The effectiveness of the described algorithm is tested using the J and J instance sets from the PSPLIB (Project Scheduling Problem LIBrary).1. INTRODUCTION
The article presents a model for project scheduling with limited resource availability and defined project stage deadlines (project milestones). The proposed model can be used in the implementation of large construction or development projects. It introduces progress control throughout the entire venture. Timely completion of milestones reduces the risk of overall project failure.
During project planning, predictive-reactive scheduling [1][10] is used – an approach utilized in dynamic, variable production systems. In the predictive scheduling phase, a nominal schedule is generated, which is then made resilient during proactive scheduling, also known as robust scheduling. Meanwhile, during project execution, reactive scheduling is used to make necessary changes to the planned schedule to resolve time or resource conflicts.
A proactive schedule is intended to counteract the instability of nominal schedules by accounting for the uncertainty of production system parameters.
A robust schedule should be characterized by acceptable quality, even after the occurrence of unpredictable disruptions. It is created, among other methods, by inserting time buffers in parts of the schedule most susceptible to disruptions.
Determining a robust allocation of time buffers is the subject of research in this paper.
The ability of the schedule to mitigate the effects of increases (or fluctuations) in activity durations, which may be caused by uncontrolled factors, is analyzed. (…)
The article contains 30,317 characters.
Source: Czasopismo Logistyka