A dynamic resource constrained project scheduling problem

André Renato Villela Da Silva, Luiz Satoru Ochi
2013 International Journal of Data Mining Modelling and Management  
In this paper, we present a variant of classical scheduling problems which deal with restricted resources. Unlike other models studied in the literature, the proposed model has no upper bound for the amount of available resources. The objective of this variant is to find a solution that maximises this amount at the end of the planning horizon. A hybrid evolutionary algorithm is proposed for this problem presenting very promising computational results.
doi:10.1504/ijdmmm.2013.057685 fatcat:q6cm5u76vvgorjpbfpnmkyra6u