Informally, the single mode RCPSP model, simply referred
as RCPSP, is a well known project scheduling problem
(PSP) that seeks the answer to the following question:
“Given the limited availability of resources, what is the
best way to schedule the activities in order to complete the
project in the shortest possible time?”. The RCPSP is of
special interest in fields like construction and production
scheduling. Conceptually, the RCPSP is a PSP with single
mode activities, renewable constrained resources, finish-tostart
precedence relationships with zero time lags, no preemption,
and has the makespan minimization as the
performance measure. According to Bucker et al. [1], this
problem is denoted as PS | prec | Cmax (machine
scheduling domain). Herroelen et al. [2] denotes this model
as m,1 | cpm | Cmax
Informally, the single mode RCPSP model, simply referred
as RCPSP, is a well known project scheduling problem
(PSP) that seeks the answer to the following question:
“Given the limited availability of resources, what is the
best way to schedule the activities in order to complete the
project in the shortest possible time?”. The RCPSP is of
special interest in fields like construction and production
scheduling. Conceptually, the RCPSP is a PSP with single
mode activities, renewable constrained resources, finish-tostart
precedence relationships with zero time lags, no preemption,
and has the makespan minimization as the
performance measure. According to Bucker et al. [1], this
problem is denoted as PS | prec | Cmax (machine
scheduling domain). Herroelen et al. [2] denotes this model
as m,1 | cpm | Cmax
การแปล กรุณารอสักครู่..
