Skip to main content
SpringerLink
Log in

On scheduling credited projects

  • Applications of Mathematical Programming
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fazar, W., The Origin of PERT, The Controller, 1962, pp. 598–621.

  2. Kelley, J.E., Critical-Path Planning and Scheduling: Mathematical Basis, Oper. Res., 1961, vol. 9, pp. 296–320.

    Article  MathSciNet  MATH  Google Scholar 

  3. 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.

    Article  MATH  Google Scholar 

  4. 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.

    Article  MATH  Google Scholar 

  5. Project Scheduling: Recent Model, Algorithm and Applications, Weglarz, J., Ed., Boston: Kluwer, 1999.

    Google Scholar 

  6. Russell, A.H., Cash Cows in Networks, Manage. Sci., 1970, pp. 357–373.

  7. 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.

    Article  Google Scholar 

  8. 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.

    Google Scholar 

  9. 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.

    Article  MATH  Google Scholar 

  10. 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.

    Article  MATH  Google Scholar 

  11. Tavares, L.V., Multicriteria Scheduling of a Railway Renewal Program, Eur. J. Oper. Res., 1986, vol. 25, pp. 395–405.

    Article  MathSciNet  Google Scholar 

  12. 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.

  13. 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.

    Article  Google Scholar 

  14. 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.

    MathSciNet  MATH  Google Scholar 

  15. 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.

    Chapter  Google Scholar 

  16. 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.

    Google Scholar 

  17. 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.

    MathSciNet  MATH  Google Scholar 

  18. Kostochka, A.V., Diskretnaya matematika. Uch. pos. (Textbook of Discrete Mathematics), part 2, Novosibirsk: NGU, 1985.

    Google Scholar 

  19. Aigner, M., Combinatorial Theory, Berlin: Springer, 1979. Translated under the title Kombinatornaya teoriya, Moscow: Mir, 1982.

    MATH  Google Scholar 

  20. 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.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk State University, Omsk, Russia

    E. A. Martynova & V. V. Servakh

Authors
  1. E. A. Martynova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. V. Servakh
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117912030095

Keywords

Search

Navigation