Abstract
In this paper, a new approach for the computation of the weight-matrix of a neural network (NN) for resource leveling (RL) is introduced. The proposed method achieves significantly improved efficiency over the conventional technique of employing the functional expressions of the weights, by exploiting the structural properties of the matrices arising in the formulation of the RL problem as a quadratic zero-one optimization. These structural properties are identified, and stated in terms of template-matrix contributions of the cost and constraint functions of the quadratic optimization, to the weight-matrix of the NN. It is shown that by using these templates, the weight-matrix can be filled-in directly, based on the early start schedule of a project.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
