Skip to main content
SpringerLink
Log in

Hybrid Algorithm for Scheduling with Regard for Reinvestment of Profits

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Scheduling of the interrelated jobs of an investment project was considered. The project can be partially financed from the means obtained by executing its jobs. The net profit value was used as the optimization criterion. This problem is NP-hard. A new hybrid algorithm based on a combination of the branch-and-bound and dynamic algorithms was proposed to determine its optimal solution.

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. Sukhikh, S.L., On Complexity of Scheduling Projects with Unit Job Durations, Preprint of Omsk State Univ., Omsk, 2002.

  2. Sukhikh, S.L., On Complexity of Project Scheduling with Regard for Profit Reinvestment, Proc. Ross. Conf. “Discrete Anal. Oper. Res.”, Novosibirsk, 2002, pp. 222.

  3. Herroelen, W.S., Van Dommelen, P., and Demeulemeester, E.L., Project Network Models with Discounted Cash Flows A Guided Tour Through Recent Developments, Eur. J. Oper. Res., 1997, vol. 100, pp. 97–121.

    Google Scholar 

  4. Kolish, R. and Padman, R., An Integrated Survey of Deterministic Project Scheduling, OMEGA, 2001, vol. 29, pp. 249–272.

    Google Scholar 

  5. Sukhikh, S.L., Some Properties of the Problem of Project Scheduling, Proc. XII Baikal Int. Conf. “Methods of Optimization and Their Applications”, Irkutsk, 2001, vol. 1, pp. 193–198.

    Google Scholar 

  6. Gimadi, E. and Sevastianov, S., On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign, in Oper. Res. Proc., Berlin: Springer, 2002, pp. 241–246.

    Google Scholar 

  7. Servakh, V.V., Effectively Solvable Case of Scheduling with Restorable Resources, Diskr. Anal. Issl. Operats., 2000, ser. 2, vol. 2, no. 1, pp. 75–82.

    Google Scholar 

  8. Servakh, V.V., A Dynamic Algorithm for some Project Management Problems, Proc. Int. Workshop “Discrete Optimization Methods in Scheduling and Computer-aided Design”, Minsk, 2000, pp. 90–92.

  9. Brucker, P., Knust, S., Schoo, A., and Thiele, O., A Branch and Bound Algorithm for the Resourceconstrained Project Scheduling Problem, Eur. J. Oper. Res., 1998, no. 107, pp. 272–288.

  10. Project Scheduling: Recent Model, Algorithm, and Applications, Weglarz, J., Ed., New York: Kluwer, 1999.

  11. Servakh, V.V. and Soukhikh, S.L., The Reinvestment Profit for the Project Management Problem, Abstracts Eighth Int. Workshop “Project Management and Scheduling” (PMS 2002), Valencia, Spain, 2002, pp. 318–321.

  12. Kolisch, R. and Sprecher, F., PSPLIB—A Project Scheduling Problem Library, Eur. J. Oper. Res., 1997, no. 96, pp. 205–216.

Download references

Author information

Authors and Affiliations

  1. Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia

    V. V. Servakh & S. L. Sukhikh

Authors
  1. V. V. Servakh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. L. Sukhikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Servakh, V.V., Sukhikh, S.L. Hybrid Algorithm for Scheduling with Regard for Reinvestment of Profits. Automation and Remote Control 65, 449–455 (2004). https://doi.org/10.1023/B:AURC.0000019377.90714.90

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000019377.90714.90

Keywords

Search

Navigation