About this document
New Lower Bound for Project Scheduling by professoraamanda84 is a document available to read on EtoBox.
This paper introduces a new lower bound for the resource-constrained project scheduling problem (RCPSP) that incorporates generalized precedence relationships (GPRs). The proposed lower bound is derived from a relaxation of resource constraints among independent activities and is represented using an acyclic network model. Computational results demonstrate that this method outperforms existing approaches in the literature.
- Author
- professoraamanda84
- Language
- EN