A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

• المؤلفون الرئيسيون: DE REYCK, Bert, HERROELEN, Willy
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 1998
• الموضوعات: Project management; Critical path methods; Branch-and-bound; Generalized precedence relations; Business Administration, Management, and Operations; Management Information Systems
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/6742; https://ink.library.smu.edu.sg/context/lkcsb_research/article/7763/viewcontent/1_s2.0_S0377221797003056_main.pdf

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 star...