Advertisement

Automation and Remote Control

, Volume 75, Issue 7, pp 1231–1240 | Cite as

Financing and reliability analysis for schedules in the project calendar planning problem

  • E. A. KazakovtsevaEmail author
  • V. V. Servakh
Topical Issue

Abstract

We continue our earlier studies of the profit maximization problem in calendar planning of investment projects taking into account reinvesting of the obtained revenue and possible credit financing. We construct the corresponding model and describe a situation when only part of the jobs is financed with own money and credits, and the rest is raised by reinvesting the revenue. We study the calendar planning problem where incomes from various jobs are random values. We study the risks related both to getting a smaller income than expected and to failing a project. We propose an approach to estimate the reliability of job schedules.

Keywords

Income Interest Rate Remote Control Time Moment Investment Project 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1975.Google Scholar
  2. 2.
    Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-Stage Systems), Moscow: Nauka, 1984.Google Scholar
  3. 3.
    Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multi-Stage Systems), Moscow: Nauka, 1989.Google Scholar
  4. 4.
    Sotskov, Yu.N., Strusevich, V.A., and Tanaev, V.S., Matematicheskie modeli i metody kalendarnogo planirovaniya (Mathematical Models and Methods of Calendar Planning), Minsk: Universitetskoe, 1994.Google Scholar
  5. 5.
    Servakh, V.V., A Dynamic Programming Algorithm for Some Project Management Problems, Proc. Int. Workshop “Discrete Optimization Methods in Scheduling and Computer-Aided Design,” Minsk, 2000, pp. 90–92.Google Scholar
  6. 6.
    Project Scheduling: Recent Models, Algorithms, and Applications, Weglarz, J., Ed., New York: Kluwer, 1999.Google Scholar
  7. 7.
    Gimadi, E.Kh., Zalyubovskii, V.V., and Sevast’yanov, S.V., Polynomial Solvability of Calendar Planning Problems with Warehoused Resources and Deadlines, Diskret. Anal. Issled. Oper., Ser. 2, 2000, vol. 7, no. 1, pp. 9–34.zbMATHMathSciNetGoogle Scholar
  8. 8.
    Servakh, V.V. and Shcherbinina, T.A., On the Complexity of Calendar Planning Problems for Projects, Vestn. NGU, Ser. Mat., Mekh., Informat., 2008, vol. 8, no. 3, pp. 105–111.zbMATHGoogle Scholar
  9. 9.
    Gimadi, E. and Sevastianov, S., On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign, in Operations Research Proceedings 2002, Berlin: Springer, 2002, pp. 241–246.Google Scholar
  10. 10.
    Russell, A.H., Cash Flows in Networks, Manag. Sci., 1970, vol. 16, no. 5, pp. 357–373.CrossRefzbMATHGoogle Scholar
  11. 11.
    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.CrossRefGoogle Scholar
  12. 12.
    Demeulemeester, E., Herroelen, W., and Van Dommelen, P., An Optimal Recursive Search Procedure for the Deterministic Max-npv Project Scheduling Problem, Res. Report 9603, Belgium, Leuven: Katholieke Univ. Leuven, 1996.Google Scholar
  13. 13.
    Icmeli, O. and Erenguc, S.S., A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash-Flows, Manag. Sci., 1996, vol. 42, no. 10, pp. 1395–1408.CrossRefzbMATHGoogle Scholar
  14. 14.
    Patterson, J.H., S-lowiński, R., Talbot, F.B., et al., An Algorithm for a General Class of Precedence and Resource Constrained Scheduling Problems, in Advances in Project Scheduling, S-lowiński R. and Węglarz J., Eds., Amsterdam: Elsevier, 1989, pp. 3–28.CrossRefGoogle Scholar
  15. 15.
    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.CrossRefGoogle Scholar
  16. 16.
    Gimadi, E.Kh, Goncharov, E.N, Zalyubovskii, V.V., et al., On Software and Mathematical Foundations of the Resource Calendar Planning for the East-Siberian Oil and Gas Complex, Vestn. NGU, Ser. Mat., Mekh., Informat., 2010, no. 4, pp. 51–62.Google Scholar
  17. 17.
    Martynova, E.A. and Servakh, V.V., On Scheduling Credited Projects, Autom. Remote Control, 2012, vol. 73, no. 3, pp. 508–516.CrossRefGoogle Scholar
  18. 18.
    Fazar, W., The Origin of PERT, The Controller, 1962, vol. 30, pp. 598–621.Google Scholar
  19. 19.
    Kelley, J.E., Critical-Path Planning and Scheduling: Mathematical Basis, Oper. Res., 1961, vol. 9, pp. 296–320.CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Martynova, E.A. and Servakh, V.V., Estimating Reliability of Schedules in Calendar Planning Problems for Projects, Proc. V Int. School-Symp. “Analysis, Modeling, Control, and Development of Economic Systems” AMUR-2011, Sevastopol, 2011, pp. 229–231.Google Scholar
  21. 21.
    Martynova, E.A. and Servakh, V.V., A Study of Reliability of Schedules in Planning Investments Projects, Proc. V All-Russian Conf. “Optimization Problems and Economic Applications,” Omsk, 2012, p. 149.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Omsk State UniversityOmskRussia
  2. 2.Omsk Branch of Sobolev Institute of Mathematics, Siberian BranchRussian Academy of SciencesOmskRussia

Personalised recommendations