Open Access. Powered by Scholars. Published by Universities.®
Management Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Management Information Systems
A Branch-And-Bound Procedure For The Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
A Branch-And-Bound Procedure For The Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
We present an optimal solution procedure for the resource-constrained project scheduling problem (RCPSP) with generalized precedence relations (RCPSP-GPR) with the objective of minimizing the project makespan. The RCPSPGPR extends the RCPSP to arbitrary minimal and maximal time lags between the starting and completion times of activities. The proposed procedure is suited for solving a general class of project scheduling problems and allows for arbitrary precedence constraints, activity ready times and deadlines, multiple renewable resource constraints with time-varying resource requirements and availabilities, several types of permissible and mandatory activity overlaps and multiple projects. It can be extended to other regular and …