Originally posted by: PhilippeLaborie
Your problem seems to be a particular case of Resource-Constrained Project Scheduling Problem (RCPSP): you have a precedence constraint network between a set of tasks and each task also requires a set of non-renewable resources of finite capacity (for instance task 'a' requires 3 units of resource 'R1' and 7 units of resource 'R3' between its start and end time, and each resource 'Ri' has a finite capacity that must not be exceeded at any time)
So you can also look at the generic formulation of this problem in CP Optimizer:
CPLEX_Studio128\opl\examples\opl\sched_rcpsp
In case your problem is more complex and you have different modes for executing the tasks (for instance task 'a' can be executed either in mode1 or in mode 2, if executed in mode1 it will require 3 units of resource 'R1' and 7 units of resource 'R3' whereas if it is executed in mode2 it will require 5 units of resource 'R1' and 3 units of resource 'R2' and the choice of the mode is a decision of the problem), then your problem is a special case of Multi-Mode Resource-Constrained Project Scheduling Problem (MM-RCPSP) and you can find the generic formulation of this problem in CP Optimizer in:
CPLEX_Studio128\opl\examples\opl\sched_rcpspmm
#CPOptimizer#DecisionOptimization