On a Discrete Transformation of the Discrete-Continuous Project Scheduling Problem

In this paper we consider a discrete-continuous project scheduling problem (DCPSP). In this problem activities simultaneously require discrete and continuous resources. The processing rate of each activity depends on the amount of a continuous resource allotted to this activity at a time. Activities are nonpreemptable, the resources are renewable and the objective is to minimize the project duration. A transformation of this problem to a classical, i.e. discrete multimode resource-constrained project scheduling problem (MRCPSP) is presented. A simulated annealing (SA) algorithm used to solve this problem is described. Some results of a computational experiment are reported