Skip to main content
Log in

Algorithms of Optimal Supply of Resources to a Group of Projects (Stochastic Networks)

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

Abstract

Several concurrently realized PERT-like network projects with random lengths of the their activities were considered. Each activity consumes several kinds of resources of fixed powers, all resources being reproducible in the course of their service. For each project, the schedule date and the admissible confidence probability of timely completion of the project were defined. The initial instants of realization of all projects, the required total power of each of the reproducible resources (for each project), the delivery schedule of rare reproducible resources that are not at the disposal of the project management system, and the schedule of beginning all activities (for each project) were determined. The minimal nonoperational costs (penalty provisions for failure to execute the project in time, fines for idling of the rare external resources, costs of resource lease, et al.,) were used as the target function.

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

Access this article

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. Kolish, R., Project Scheduling Under Resource Constraints, New York: Phisica, 1995.

    Google Scholar 

  2. Shtub, A., Bard, J., and Globerson, S., Project Management: Engineering, Technology, and Implementation, New York: Prentice-Hall, 1994.

    Google Scholar 

  3. Zhan, J., Heuristics for Scheduling Resource-Constrained Projects in MPM Networks, Eur. J. Oper. Res., 1994, vol. 76 (1), pp. 192-205.

    Google Scholar 

  4. Golenko-Ginzburg, D. and Gonik, A., Job-Shop Resource Scheduling via Simulating Random Operations, J. Math. Comput. Simulat., 1997, vol. 44, pp. 427-440.

    Google Scholar 

  5. Golenko-Ginzburg, D. and Gonik, A., Stochastic Network Project Scheduling with Nonconsumable Limited Resources, Int. J. Prod. Econ., 1997, vol. 48, pp. 29-37.

    Google Scholar 

  6. Golenko-Ginzburg, D. and Gonik, A., A Heuristic for Network Project Scheduling with Random Activity Durations Depending on the Resource Reallocation, Int. J. Prod. Econ., 1998, vol. 55, pp. 149-162.

    Google Scholar 

  7. Gonik, A., Resource Scheduling Model with Cost Objectives for Stochastic Network Projects, Commun. Dependability Quality Manag., 1999, vol. 2, no. 1, pp. 102-108.

    Google Scholar 

  8. Voropajev, V., Ljubkin, S., Golenko-Ginzburg, D., and Gonik, A., A Model for Supplying with Constrained Resources in Project Management under Random Disturbances, Project Manag., 1999, vol. 5, no. 1, pp. 68-73.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Golenko-Ginzburg, D.I., Lyubkin, S.M., Rezer, V.S. et al. Algorithms of Optimal Supply of Resources to a Group of Projects (Stochastic Networks). Automation and Remote Control 62, 1366–1375 (2001). https://doi.org/10.1023/A:1010270015512

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010270015512

Keywords

Navigation