Recent author's papers have shown new opportunities resulting from the treatment of resource planning in project scheduling as the optimization problem for a hybrid system. This approach gives the possibility to work out the optimum resource sharing in an iteration process of branch‐and‐bound type. The present paper concentrates on the most standard case of the problem in question for which all the relationships may be represented in the linear form. Two exact finite methods are proposed. The first method is obtained using the piecewise‐linear form of Bellman function, the second evolves from the decomposition approach for dynamic linear programming problem.
Valuev, A. (2008). On calculation of linear resource planning models for optimal project scheduling. Mathematical Modelling and Analysis, 13(2), 275-288. https://doi.org/10.3846/1392-6292.2008.13.275-288
Authors who publish with this journal agree to the following terms
that this article contains no violation of any existing copyright or other third party right or any material of a libelous, confidential, or otherwise unlawful nature, and that I will indemnify and keep indemnified the Editor and THE PUBLISHER against all claims and expenses (including legal costs and expenses) arising from any breach of this warranty and the other warranties on my behalf in this agreement;
that I have obtained permission for and acknowledged the source of any illustrations, diagrams or other material included in the article of which I am not the copyright owner.
on behalf of any co-authors, I agree to this work being published in the above named journal, Open Access, and licenced under a Creative Commons Licence, 4.0 https://creativecommons.org/licenses/by/4.0/legalcode. This licence allows for the fullest distribution and re-use of the work for the benefit of scholarly information.
For authors that are not copyright owners in the work (for example government employees), please contact VILNIUS TECHto make alternative agreements.
