2015

chapter in monograph

english

EN In this chapter project scheduling under an additional continuous resource is considered. In particular, we deal with discrete-continuous project scheduling problems to minimize the project duration. These problems are characterized by the fact that activities of a project simultaneously require discrete and continuous resources for their execution. A class of the problems is considered, where the number of discrete resources is arbitrary, and there is one continuous, renewable resource, whose total amount available at a time is limited. Activities are nonpreemptable, and the processing rate of an activity is a continuous, increasing function of the amount of the continuous resource allotted to the activity at a time. Theoretical results for the cases of convex and concave processing rate functions of activities are presented, and the methodology developed for solving the problems with concave functions is described in detail. Some conclusions and final remarks are given.

191 - 202

10.1007/978-3-319-05443-8_10

https://link.springer.com/chapter/10.1007/978-3-319-05443-8_10

Handbook on Project Management and Scheduling. Vol.1