ABSTRACT.
This doctoral Thesis presents a new approach for the GRCPSP 
(Generalized Resource-Constrained Project Scheduling Problem) 
with PDM (Precedence Diagramming Method) splitting allowed 
graphs in realistic environments where tasks are distinguished by 
production or no production tasks, and linked not only with the 
classical start to start, start to finish and finish to finish 
precedence relations. A new concept of activity relationships is 
presented based on classical lead/lag factors but also on delays 
depending on the amount of production needed to start or 
pending to finish an activity or even both conditions 
simultaneously. 
This approach better represents the complex reality where 
projects are based on production processes and totally eliminate 
the possibility of reverse critical jobs. This new approach allows 
applying classical concepts in productions planning like the 
“learning curves” and cost optimization with TCTP (Time Cost 
Trade-Off Problem) models.
A new heuristic algorithm to compute the PDM (Precedence 
Diagramming Method) splitting and non-splitting is presented, 
with relations based on classical lead/lag factors but also on 
delays depending on the amount of production with variable 
productivity and fuzzy values for durations and resources, that 
totally eliminate the possibility of reverse critical jobs and its 
perverse effects.
Keyboards: PDM; Precedence Diagramming Method; RCPSP; 
GRCPSP; Generalized Precedence; Time-Cost; Heuristic; 
Project scheduling; Splitting allowed; Production planning; 
learning curve, Construction scheduling, fuzzy scheduling.