Abstract
Several concurrently realized i>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, i>et al.,) were used as the target function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
