Abstract
Consideration was given to scheduling investment projects with regard for possible use of credits. The net reduced profit was used as the optimization criterion. The problem was studied, a mathematical model constructed, an algorithm to solve it was suggested, and a polynomially solvable case was specified.
Similar content being viewed by others
References
Fazar, W., The Origin of PERT, The Controller, 1962, pp. 598–621.
Kelley, J.E., Critical-Path Planning and Scheduling: Mathematical Basis, Oper. Res., 1961, vol. 9, pp. 296–320.
Blaźewicz, J., Lenstra, J.K., and Rinnoy Kan, A.H.G., Scheduling Subject to Resource Constraints: Classification and Complexity, Discret. Appl. Math., 1983, vol. 5, no. 1, pp. 11–24.
Brucker, P., Drexl, A., Mohring, R., et al., Resource-constrained Project Scheduling: Notation, Classification, Models, and Methods, Eur. J. Oper. Res., 1999, vol. 112, pp. 3–41.
Project Scheduling: Recent Model, Algorithm and Applications, Weglarz, J., Ed., Boston: Kluwer, 1999.
Russell, A.H., Cash Cows in Networks, Manage. Sci., 1970, pp. 357–373.
Elmaghraby, S.E. and Herroelen, W.S., The Scheduling of Activities to Maximize the Net Present Value, Eur. J. Oper. Res., 1990, vol. 49, pp. 35–49.
Demeulemeester, E., Herroelen, W., and Van Dommelen, P., An Optimal Recursive Search Procedure for the Deterministic max-npv Project Scheduling Problem, Res. Report 9603, Dept. Appl. Econom., Leuven: Katholieke Universiteit Leuven, 1996.
Doersch, R.H. and Patterson, J.H., Scheduling a Project to Maximize its Net Present Value: A Zero-One Programming Approach, Manage. Sci., 1977, vol. 23, pp. 882–889.
Icmeli, O. and Erenguc, S.S., A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash-flows, Manage. Sci., 1996, vol. 42, no. 10, pp. 1395–1408.
Tavares, L.V., Multicriteria Scheduling of a Railway Renewal Program, Eur. J. Oper. Res., 1986, vol. 25, pp. 395–405.
Patterson, J.H., S-lowiński, R., Talbot, F.B., and Węglarz, J., An Algorithm for a General Class of Precedence and Resource Constrained Scheduling Problems, in Advances in Project Scheduling, S-lowi’nski, R. and Węglarz, J., Eds., Elsevire, 1989, pp. 3–28.
Yang, K.K., Talbot, F.B., and Patterson, J.H., Scheduling a Project to Maximize its Net Present Value: An Integer Programming Approach, Eur. J. Oper. Res., 1992, vol. 64, pp. 188–198.
Gimadi, E.Kh., Zalyubovskii, V.V., and Sevast’yanov, S.V., Polynomial Solvability of the Scheduling Problem with Stored Resources and Deadlines, Diskret. Anal. Issled. Oper., 2000, Ser. 2, vol. 7, no. 1, pp. 9–34.
Gimadi, E. and Sevastianov, S., On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign, in Operations Research Proceedings 2002, Leopold-Wildburger, U., Rendl, F., and Wäscher, G., Eds., Berlin: Springer, 2003, pp. 241–246.
Servakh, V.V. and Shcherbinina, T.A., On Complexity of the Project Scheduling Problem, Vestn. NGU, Ser. Mat. Mekh. Inf., 2008, vol. 8, no. 3, pp. 105–111.
Servakh, V.V., An Effectively Solvable Case of the Scheduling Problem with Renewable Resource, Diskret. Anal. Issled. Oper., 2000, Ser. 2, vol. 7, no. 1, pp. 75–82.
Kostochka, A.V., Diskretnaya matematika. Uch. pos. (Textbook of Discrete Mathematics), part 2, Novosibirsk: NGU, 1985.
Aigner, M., Combinatorial Theory, Berlin: Springer, 1979. Translated under the title Kombinatornaya teoriya, Moscow: Mir, 1982.
Servakh, V.V. and Sukhikh, S.L., Hybrid Algorithm for Scheduling with Regard for Reinvestment of Profits, Autom. Remote Control, 2004, vol. 65, no. 3, pp. 449–455.
Author information
Authors and Affiliations
Additional information
Original Russian Text © E.A. Martynova, V.V. Servakh, 2012, published in Avtomatika i Telemekhanika, 2012, no. 3, pp. 107–116.
Rights and permissions
About this article
Cite this article
Martynova, E.A., Servakh, V.V. On scheduling credited projects. Autom Remote Control 73, 508–516 (2012). https://doi.org/10.1134/S0005117912030095
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117912030095