Flexible Project Scheduling Algorithms

Abstract

Despite the emerging importance of flexible project management approaches, such as agile extreme and hybrid methodologies, the algorithmic support of these approaches is still insufficient. In addition, single project scheduling has received far more attention than have schedules of multilevel projects, such as project portfolios or multi projects. This lack of scheduling techniques is especially true for flexible portfolios, such as agile, hybrid, and extreme project portfolios. While multilevel project scheduling algorithms already exist for fixed multilevel project structures, they are not able to handle flexible structures. This chapter proposes algorithms to schedule both flexible single and multilevel projects. The proposed algorithms handle both flexible and unplanned tasks and dependencies. They handle both single and multimode completion modes, and both renewable and nonrenewable resources. In addition, this chapter proposes a matrix-based risk-valuation framework to evaluate risk effects for flexible projects and portfolios. With this framework, project scheduling approaches are compared.

1. Introduction

Despite the flexibility, such as agile (APMa), hybrid (HPMa), and extreme (EPMa), project management approaches come from the software project environment [16], and they are being increasingly used in nonsoftware environments as well. Flexible project management methods require flexible project scheduling methods, which allow flexible project structure [5]. Because of the time complexity, only a few methods handle the flexible nature of the projects. Nevertheless, in recent years, a new family of flexible scheduling methods [13] has been proposed. Instead of network-based methods, these algorithms are based on domain mapping (DMM) [4] and multidomain mapping matrices (MDMs) [1]. To support the agile project management approach, the proposed matrix-based methods handle both the priority of the task completions and the flexibility of dependencies between tasks [5, 8]. In addition to supporting extreme project management approaches, unplanned tasks can be scheduled [7]. The proposed matrix-based method can also be used to plan traditional, nonflexible projects. In this way, multimode completions can be specified. Nevertheless, the multimode and flexible project structures can also be combined to support hybrid project management approaches. The proposed flexible scheduling algorithms can be used not only in the projects but also at the project portfolio level [6].

The proposed matrix-based algorithm is based on the former studies [5, 6, 7, 8]; however, they are unified into the common matrix-based model, and they are extended to handle nonrenewable resources too. The proposed matrix-based model and the scheduling algorithm have the following features.

1. They handle fixed, but also flexibledependencies and mandatory but also supplementarytasks; therefore, traditional but agileproject plans can also be modeled.

2. They handle planned, but also unplannedtasks, therefore, they can also model extremeproject plans.

3. They handle single, but multimodecompletion modes; therefore they can also model traditional, but hybridproject plans, too.

4. They can handle renewable, but non-renewableresources, too.

5. They can model single, but also multilevelproject plans.

In order to keep the adaptability of the proposed method, all features in italic style are optional. It means, when scheduling traditional project plans, there is no need to plan any supplementary tasks, flexible dependencies, or unplanned tasks; however, these features are optionally used in a flexible, such as agile, hybrid, or extreme project planning. Selecting from the multiple completion modes (called discrete technologies) is only relevant if there are more alternative technology. And last but not least, planning in a multilevel project environment is also an optional feature; however, it is crucial in the case of planning the resource sharing within the multi-projects.

In addition to the tasks, the risk effects of project scheduling can also be modeled [10]. The matrix-based risk evaluation has the following features:

1. Risk factors, risk effects, goals, and stakeholders can be modeled in a unified matrix-based model.

2. It handles independent, but also interdependent risk factors.

3. Both the planning and the tracking phases are covered.

All the proposed algorithms have software application support [9]. Therefore, after the model has been developed, the proposed methods can be compared. The MATLAB add-on [9] with examples guides users from the project planning to the risk evaluation.

The aim of this chapter is twofold. First, the chapter shows how to model flexible single and multilevel project plans and their risks. Second, the chapter summarizes the algorithms, so-called project management agents, that simulate a decision maker. In this way, the different project management approaches can compete, and the best one can be selected.

2. Matrix-based project planning models

In terms of scheduling, a project is a set of tasks, which has to be solved,

1. within a time-frame (= time constraint, $C_t$),

2. within the budget (= cost constraint, $C_c$),

3. within the renewable/nonrenewable resources (${\mathbf{C}}_r,{\mathbf{C}}_n$), and

4. with adequate quality ($C_q$),

5. with adequate scope ($C_s$).

The fixed dependency between (successor and a predecessor) tasks specifies, that a successor task may start if the predecessor task has finished (sequential completion). While flexible dependency, based on a later decision either allows either a sequential or a parallel completion.

In terms of planning and scheduling, the multilevel project is the set of projects. Within a multilevel project, at least two overlapping projects specify a multiproject[3], if they have common resources. While at least two projects specify programs, if the goals of the projects are similar and they have dependency between them. In terms of scheduling, project portfolioscan contain single projects, multiprojects, and programs too. While, multilevel projectscan contain project portfolios, too.

Apart from network planning methods, matrix-based project planning is used to model complex project plans [2]. Matrix-based project planning methods are often based on the design (or dependency) structure matrix (DSM) [14]. The domain mapping matrix (DMM) is an extended version of the DSM, with multiple domains [4]. In this chapter, a modified project-oriented version of a domain mapping matrix (DMM) is used, which is called the project domain matrix (PDM) [5].

The PDM contains two mandatory and four supplementary domains.

LDThe logic domain is an $n$by $n$matrix, where $n$is the number of tasks. Each cell contains a value from the [0,1] interval.

TDThe time domain is an $n$by $m$matrix with positive real values, where $m$is the number of completion modes¹.

The first mandatory domain is the logic domain. Diagonal values in $\mathbf{LD}$represent the priority values of the tasks. If a diagonal value is $0$, then this task will not be completed. If the diagonal value is $1$, then the task is a mandatory task, while if the diagonal value is between $0$and $1$, then it is a supplementary task, which means that depending on the decision, either it will be completed or omitted/postponed. Out-diagonal values represent the dependency between tasks. If an out-diagonal value ${\left[\mathbf{LD}\right]}_{\mathit{ij}}\in \mathbf{LD}$is $1$, then task $i$precedes task $j$. In the case of ${\left[\mathbf{LD}\right]}_{\mathit{ij}}=0$, there is no precedence relation from task $i$to task $j$. If $0<{\left[\mathbf{LD}\right]}_{\mathit{ij}}<1$, then there is a flexible dependency between task $i$and task $j$, which means the dependency is on whether decision task $i$precedes task $j$. Since all project networks from the considered databases do not contain any cycle, in other words, they can be ordered topologically, the logic domain of the topologically ordered project networks is an upper triangular (sub) matrix. Formally ${\left[\mathbf{LD}\right]}_{\mathit{ij}}≔0$, if $i>j$. The other mandatory domain of the PDM is the time domain. The positive values of the time domains represent the possible duration of tasks. For each task, $k$duration values can be assigned; nevertheless, the duration values may also match each other.

The additional supplementary domains are:

CDCost domain, which is an $n$by $m$nonnegative matrix of task costs

QDQuality domain, which is an $n$by $m$nonnegative matrix of quality parameters of tasks

NDThe nonrenewable resource domain is an $n$by $m\cdot \eta$nonnegative matrix of nonrenewable resource demands, where $\eta$is the number of types of nonrenewable resources.

RDThe renewable resource domain is an $n$by $m\cdot \rho$nonnegative matrix of renewable resource demands, where $\rho$is the number of types of renewable resources.

Table 1 shows an example of a fully filled PDM matrix. There are 3 (2 mandatory, 1 supplementary) tasks, 3 (2 fixed, 1 flexible) dependencies, 2 completion modes, 2 nonrenewable resources, and 3 renewable resources. The optional domains can be either ignored or filled out with zero values.

P D M	Logic domain			Time domain		Cost domain		Quality domain		Nonrenewable resource domain				Renewable resource domain
	A	B	C	$t_1$	$t_2$	$c_1$	$c_2$	$q_1$	$q_2$	$n_{11}$	$n_{12}$	$n_{21}$	$n_{22}$	$r_{11}$	$r_{12}$	$r_{21}$	$r_{22}$	$r_{31}$	$r_{31}$
A	1	1	.6	1	2	3	2	.7	.8	4	5	3	6	3	6	3	5	4	2
B	0	.7	1	2	2	4	3	.8	.9	3	3	4	4	4	7	4	6	4	3
C	0	0	1	4	3	5	3	.9	.8	4	2	5	3	4	2	4	7	6	4

Table 1.

The structure of the project domain matrix.

Since PDM can model flexible dependencies and task priorities, it can be used to model both traditional and flexible approaches, such as agile and extreme approaches, and hybrid project planning approaches (see details in Section 3). Nevertheless, handling completion priorities and flexible dependencies alone raises the number of possible project plans.

The project can be organized into a multilevel project. The projects in the applied M${}^5$(matrix-based multimode multilevel (project) management model) share their domains. Table 2 shows an example of a multilevel project plan. The common logic domain allows us to plan flexible dependencies both within and between projects. It handles the different completion modes; therefore, all the traditional, hybrid, and agile project plans can be planned (see Table 2).

Table 2.

Matrix-based multimode multilevel (project) management model.

Because of the numerous possible project plans, there is no chance to compute all possible projects or multilevel project plans. A fast, exact method is required to find the best project or multilevel project structure.

After deciding which tasks are completed, which flexible dependency is required, and which completion mode is selected, we obtain a (multilevel) project plan. Table 3 shows, a single (a) and a multilevel (b) project schedule matrix (PSM).

Table 3.

Single and multilevel PSM.

Table 3(a) shows a project schedule matrix of PDM (see Table 1), which contains 6 domains. Table 3(b) shows a possible project schedule M${}^5$matrix representation of a hybrid multilevel project (see Table 2), where there are 4 domains. In both models, empty cells represent 0 values, and ‘X’ represents 1 value. ‘X’ also indicates that this value is the result of a decision. The decision is always binary: either include or exclude a task or a dependency. The PSM contains only one mode, i.e., the selected completion mode for every task. PSM optionally contains the scheduled starts (SS) of tasks. Otherwise, the default start is the early start (ES) of tasks.

3. Project management agents

Previously, [16] found that in his study of the practices of software project managers, only 20% of IT projects were managed by a traditional project management (TPM) methodology. Generally, methods for investment and construction projects cannot be directly applied to software development or R&D projects, as these are managed by agile project management (APM) approaches. Currently, hybrid (i.e., combinations of traditional and agile and extreme) approaches are becoming increasingly popular [11]. However, flexible approaches are thus far not privileges for software development projects [15]. Rapidly changing environments increasingly enforce flexible approaches. Project planning and scheduling algorithms can support decision makers in managing projects; however, there are only a few algorithmic procedures that can support flexible approaches. Therefore, it is important to study how to extend project planning and scheduling methods to handle flexible and changing environments. Planning and scheduling methods, as agents, can also imitate decision makers; therefore, not only the methods but also the scheduling and project planning approaches can be modeled (see Table 4).

While, a project manager who follows a traditional project management (TPM) approach can use tradeoff or multimode methods to reduce task duration or cost/resource demands, an agile and extreme project manager tries to restructure the project. If the project structure is flexible (see Table 4), then the project duration can be reduced without increasing the project cost by reducing the number of flexible dependencies. In addition, in real project situations, decision makers can choose from different kinds of technologies (i.e. completion modes); therefore, the TPM and APM approaches can be integrated. Agile approaches usually split the projects into smaller so-called “sprints” that are usually 2−6 weeks. The content of sprints is specified by the customer and developers together. However, when running a sprint, unplanned new tasks and new requirements can be involved only until the next sprint. The extreme project management (EPM) approach handles the new tasks and new requirements during the implementation of the project. Extreme project management can confirm the extra costs and the increased project duration due to the extra tasks.

Flexible approaches require flexible project structures; however, in addition to the opportunity to reorganize the project, different kinds of technology (completion modes) should also be considered; therefore, traditional and flexible approaches should be combined into hybrid project management approaches [11, 12, 15]. Nevertheless, hybrid approaches should be supported by algorithmic methods to help decision makers ensure the project’s success.

There are different combinations of agile and traditional project management approaches [11, 12, 15]. However, there are very few exact algorithms (see, e.g., [7, 8]) that can be used to solve hybrid multimode problems that can handle unplanned tasks and dependencies. Nevertheless, R&D and IT projects, such as introducing and setting up new information systems, may require reorganizing part of the project, and R&D projects may require handling unplanned tasks, particularly in the development phase. However, decreasing the time demands of mandatory tasks and those of the new unplanned tasks may also be an important requirement. Neither the agile approach, nor the extreme approach can handle this situation properly, nor can traditional approaches. Traditional approaches, or network-based methods, assume static logic plans, but the reorganization of projects may produce insufficient reductions in project duration and/or supplementary tasks, and important tasks may be excluded from the project due to budget constraints and/or project deadlines. A hybrid project management (HPM) approach can combine traditional, agile, and extreme approaches; however, these kinds of HPM approaches are not yet supported by project planning methods. The proposed algorithm combines agile, extreme, and traditional approaches. This method extends the traditional multi-mode resource-constrained project scheduling problem by allowing for the restructuring and reorganizing of projects and handling of unplanned new tasks.

The proposed hybrid time–cost and hybrid time-quality-cost tradeoff models [8] and multimode methods [7] manage flexible project plans and allow us to restructure or reorganize these project plans to satisfy customer and management claims. In contrast to the traditional project scoring and selection methods, there is no need to specify all project alternatives to select the most desirable project scenario or the one with the shortest duration or lowest cost. The following definition specifies a matrix representation of a flexible (multilevel) project plan and its possible realization.

Definition 1.Denotes $\left\{\cdot \right\}$as a supplementary domain, which can be an empty matrix. Denote $\mathbf{M}=\left[\mathbf{LD},\mathbf{TD},\left\{\mathbf{CD}\right\},\left\{\mathbf{QD}\right\},\left\{\mathbf{ND}\right\},\left\{\mathbf{RD}\right\}\right]$as a flexible (multilevel) project plan, where $\mathbf{LD}$and $\mathbf{TD}$are mandatory but $\mathbf{CD},\mathbf{QD},\mathbf{ND},\mathbf{RD}$are supplementary domains. ${\mathbf{M}}^{″}=\left[\mathbf{L}{\mathbf{D}}^{″},\mathbf{T}{\mathbf{D}}^{″},\left\{\mathbf{C}{\mathbf{D}}^{″}\right\},\left\{\mathbf{Q}{\mathbf{D}}^{″}\right\},\left\{\mathbf{N}{\mathbf{D}}^{″}\right\},\left\{\mathbf{R}{\mathbf{D}}^{″}\right\}\right]$is a realized (fixed) (multilevel) project plan of $\mathbf{M}$if ${\mathbf{M}}^{″}$is at least an $n$by $n+1$but maximum $n$by $n+3+\eta +\rho$matrix with two mandatory and six supplementary domains. The following properties are satisfied: if $m$denotes the number of nodes, $\rho$denotes the number of renewable resources, $\eta$denotes the number of nonrenewable resources, and $p$denotes the number of projects, then.

LD″:$n$by $n$logic domain, where ${\mathcal{L}}_{i_k,j_s}^{″}={\left[\mathbf{L}{\mathbf{D}}^{″}\right]}_{i_k,j_s}\in \left\{0,1\right\}.$. ${\mathcal{L}}_{i_k,j_s}^{″}={\mathcal{L}}_{i_k,j_s}={\left[\mathbf{LD}\right]}_{i_k,j_s}$, if ${\mathcal{L}}_{i_k,j_s}\in \left\{0,1\right\}$and either ${\mathcal{L}}_{i_k,j_s}^{″}=1$or ${\mathcal{L}}_{i_k,j_s}^{″}=0$, if $0<{\mathcal{L}}_{i_k,j_s}<1,k,j=1,..,p$.

TD″:$n$by 1 column vector (time domain), where ${\mathcal{T}}_i^{″}={\left[\mathbf{T}{\mathbf{D}}^{″}\right]}_{i_k}={\mathcal{T}}_{i_k,{\omega }_{i_k}}={\left[\mathbf{TD}\right]}_{i_k,{\omega }_{i_k}}$, and $i_k=1,2,..,n_k,{\omega }_{i_k}\in \left\{1,2,..,m\right\},k=1,2,..,p$.

CD″:$n$by 1 column vector (cost domain), where ${\mathcal{C}}_i^{″}={\left[\mathbf{C}{\mathbf{D}}^{″}\right]}_{i_k}={\mathcal{C}}_{i_k,{\omega }_{i_k}}={\left[\mathbf{CD}\right]}_{i_k,{\omega }_{i_k}}$, and $i_k=1,2,..,n_k,{\omega }_{i_k}\in \left\{1,2,..,m\right\},k=1,2,..,p$.

QD″:$n$by 1 column vector (quality domain), where $Q_i^{″}={\left[\mathbf{Q}{\mathbf{D}}^{″}\right]}_{i_k}={\mathcal{Q}}_{i_k,{\omega }_{i_k}}={\left[\mathbf{Q}{\mathbf{D}}^{″}\right]}_{i_k,{\omega }_{i_k}}$, and $i_k=1,2,..,n_k,{\omega }_{i_k}\in \left\{1,2,..,m\right\},k=1,2,..,p$.

ND″:$n$by $\eta$nonrenewable resource domain, where ${\mathcal{N}}_{i_k,w}^{″}={\left[\mathbf{R}{\mathbf{D}}^{″}\right]}_{i_k,w}={\mathcal{N}}_{i_k,m\cdot \left(w-1\right)+{\omega }_{i_k}}={\left[\mathbf{ND}\right]}_{i_k,m\cdot \left(w-1\right)+{\omega }_{i_k}}$, and $i_k=1,2,..,n_k,{\omega }_i\in 1,2,..,m,k=1,2,..,p,w\in \left\{1,..,\eta \right\}$.

RD″:$n$by $\rho$renewable resource domain, where ${\mathrm{ℛ}}_{i_k,r}^{″}={\left[\mathbf{R}{\mathbf{D}}^{″}\right]}_{i_k,r}={\mathrm{ℛ}}_{i_k,m\cdot \left(r-1\right)+{\omega }_{i_k}}={\left[\mathbf{RD}\right]}_{i_k,m\cdot \left(r-1\right)+{\omega }_{i_k}}$, and $i_k=1,2,..,n_k,{\omega }_i\in 1,2,..,m,k=1,2,..,p,r\in \left\{1,..,\rho \right\}$.

Definition 1 proposes a unified matrix-based model, both for single and multilevel project plans, and both for single and multimode completions. In addition, by increasing $n$allows involving the unplanned tasks.

3.1 Demands

Definition 2.Let ${\mathbf{M}}^{″}=\left[\mathbf{L}{\mathbf{D}}^{″},\mathbf{T}{\mathbf{D}}^{″},\left\{\mathbf{C}{\mathbf{D}}^{″}\right\},\left\{\mathbf{Q}{\mathbf{D}}^{″}\right\},\left\{\mathbf{N}{\mathbf{D}}^{″}\right\},\left\{\mathbf{R}{\mathbf{D}}^{″}\right\}\right]$be a matrix representation of the realized (multilevel) project, which contains $p>1$projects. Assume that $i_k<j_k\Rightarrow {\left[\mathbf{L}{\mathbf{D}}^{″}\right]}_{i_k,j_k}=0$. Denote ${\mathit{SF}}_{i_k}={\mathit{SS}}_{i_k}+{\mathcal{T}}_{i_k}$as the scheduled finish time of task $i_k$from project $k$, where ${\mathit{SS}}_{i_k}$is the scheduled start time and $t_{i_k}$is the duration of task $i$from project $k$. Denote $R_{r,k}\left(\tau \right)$as the maximum resource demand of renewable resource $r$for project $k$at a time $\tau$. Denote ${\tau }_{0_k}$as the start time of project $k$and ${\tau }_0$as the start time of the multilevel project. The total project values are defined as follows:

TPT:Total project time ${\mathit{TPT}}_k{\mathbf{M}}^{″}$) of project $k$and the duration of the multilevel project ($\mathit{TPT}{\mathbf{M}}^{″}$).

$${\mathit{TPT}}_k{\mathbf{M}}^{″}=\underset{i_k}{max}{\mathit{SF}}_{i_k},$$E1

$$\mathit{TPT}{\mathbf{M}}^{″}=\underset{i}{max}{\mathit{SF}}_i.$$E2

TPC:Total project cost (${\mathit{TPC}}_k{\mathbf{M}}^{″}$) of project $k$and the total cost of the multilevel project ($\mathit{TPC}{\mathbf{M}}^{″}$).

$${\mathit{TPC}}_k{\mathbf{M}}^{″}=\sum _{i_k}{\left[\mathbf{C}{\mathbf{D}}^{″}\right]}_{i_k},$$E3

$$\mathit{TPC}{\mathbf{M}}^{″}=\sum _k{\mathit{TPC}}_k{\mathbf{M}}^{″}$$E4

TPQ:(relative) total project quality (${\mathit{TPQ}}_k{\mathbf{M}}^{″}$) of project $k$and the total quality of the multilevel project ($\mathit{TPQ}{\mathbf{M}}^{″}$).

$${\mathit{TPQ}}_k{\mathbf{M}}^{″}=\sum _{i_k}{\left[\mathbf{Q}{\mathbf{D}}^{″}\right]}_{i_k}/\underset{m}{max}{\left[\mathbf{QD}\right]}_{i_{m,k}},$$E5

$$\mathit{TPQ}{\mathbf{M}}^{″}=\sum _k{\mathit{TPQ}}_k{\mathbf{M}}^{″}/\underset{m}{max}{\left[\mathbf{QD}\right]}_{i_{m,k}}$$E6

where $m$is the completion mode.

TPN:Total project nonrenewable resource demands $j$(${\mathit{TPN}}_{e,k}{\mathbf{M}}^{″}$) of project $k$and the total nonrenewable resource $e$of the multilevel project (${\mathit{TPN}}_e{\mathbf{M}}^{″}$).

$${\mathit{TPN}}_{e,k}{\mathbf{M}}^{″}=\sum _{i_k}{\left[\mathbf{N}{\mathbf{D}}^{″}\right]}_{i_k},$$E7

$${\mathit{TPN}}_e{\mathbf{M}}^{″}=\sum _k{\mathit{TPN}}_{e,k}{\mathbf{M}}^{″}$$E8

TPR:Total project renewable resources (${\mathit{TPR}}_{r,k}{\mathbf{M}}^{″}$) of project $k$and the total project resources of the multilevel project for resource $r$(${\mathit{TPR}}_r{\mathbf{M}}^{″}$).

$${\mathit{TPR}}_{r,k}{\mathbf{M}}^{″}=\underset{{\tau }_{0_k}\le \tau \le {\mathit{TPT}}_k{\mathbf{M}}^{″}}{max}{R}_{r,k}\tau ,$$E9

$${\mathit{TPR}}_r{\mathbf{M}}^{″}=\underset{{\tau }_0\le \tau \le \mathit{TPT}{\mathbf{M}}^{″}}{max}{R}_r\tau$$E10

TPS:Total project score (${\mathit{TPS}}_k\mathbf{M},{\mathbf{M}}^{″}$) of project $k$and the total score of the multilevel project ($\mathit{TPS}\mathbf{M},{\mathbf{M}}^{″}$).

$${\mathit{TPS}}_k\mathbf{M},{\mathbf{M}}^{″}=\sum _{l_{i_k,i_k}^{″}=1}{l}_{i_k,i_k},$$E11

$$\mathit{TPS}\mathbf{M},{\mathbf{M}}^{″}=\sum _{l_{i,i}^{″}=1}{l}_{i,i}.$$E12

3.2 Relative constraints

Definition 3.Denote $C_X,X\in \left\{T,C,Q,N,R,S\right\}$as the time, cost, quality, nonrenewable resource, renewable resource, and score constraints, respectively. Denote $C_X\%=\frac{C_X-{\mathit{TPX}}_{\min }}{{\mathit{TPX}}_{\max }-{\mathit{TPX}}_{\min }}$as the relative constraints.

It is important to note that the relative constraint should be within the [0,1] interval ($C_X\%\in \left[0,1\right]$) to find a feasible solution. Nevertheless, the minimal and maximal demands (${\mathit{TPX}}_{\max },{\mathit{TPX}}_{\min }$) can be calculated without specifying all possible solutions (see Section 3.4).

($C_{X_k}$) constraints can be defined not only for project $k=1,..,p$but also for multilevel projects.

3.3 Target function

Either simple or composite target functions can be specified both for single and multilevel projects.

Simple target functions:

$${\mathit{TPT}}_k\to min,\mathit{TPT}\to min.$$E13

$${\mathit{TPC}}_k\to min,\mathit{TPC}\to min.$$E14

$${\mathit{TPQ}}_k\to max,\mathit{TPQ}\to max.$$E15

$${\mathit{TPN}}_{e,k}\to min,{\mathit{TPN}}_e\to min.$$E16

$${\mathit{TPN}}_{r,k}\to min,{\mathit{TPN}}_r\to min.$$E17

$${\mathit{TPS}}_k\to max,\mathit{TPS}\to max.$$E18

where $k=1,..,p,e=1,..,\eta ,r=1,..,\rho$.

The composite target function handles all possible targets with their importance:

$$\prod _{X\in \left\{T,C,N,R\right\}}{\left(\frac{\mathit{TPX}-{\mathit{TPX}}_{\min }}{{\mathit{TPX}}_{\max }-{\mathit{TPX}}_{\min }}\right)}^{v_X}\cdot \prod _{X\in \left\{Q,S\right\}}{\left(\frac{{\mathit{TPX}}_{\max }-\mathit{TPX}}{{\mathit{TPX}}_{\max }-{\mathit{TPX}}_{\min }}\right)}^{v_X}\to min$$E19

where $v_X$is the weight of the importance of demands (${\sum }_X{v}_X≔1$).

3.4 Main properties of the exact evaluation

Due to the size constraints, only the main feature of the proposed algorithm is summarized. See the details in [6, 8].

1. The evaluation contains three steps.

   1. First, the diagonal values of the LDare evaluated. All supplementary tasks ($0<{\left[\mathbf{LD}\right]}_{\mathit{ii}}<1$) are decided either to exclude from or to include in the (multilevel) project.

   2. In the second step, all flexible tasks ($0<{\left[\mathbf{LD}\right]}_{\mathit{ij}}<1,i>j$) are evaluated. They are either excluded or included.

   3. In the third step, all completion modes are evaluated. For every task, a completion mode is selected.

2. For every kind of multilevel project plan, the minimal (maximal) demands can be specified without calculating all possible solutions.

   1. If all supplementary tasks are excluded (included), the $\mathit{TPS}$is minimal (maximal).

   2. If all supplementary tasks are excluded (included), and all completion modes require minimal (maximal) demands, $\mathit{TPC}$and $\mathit{TPN}$are minimal (maximal).

   3. If all supplementary tasks are excluded (included), and all dependencies are excluded (included) and all completion modes require minimal (maximal) demands, $\mathit{TPT}$is minimal (maximal).

   4. If all supplementary tasks are excluded (included), but all dependencies are included (excluded) and all completion modes require minimal (maximal) demands, $\mathit{TPR}$is minimal (maximal).

3. Due to the evaluation, if the minimal (maximal) demands are greater (lower) than the constraint, neither the project plan nor their derived plans are feasible.

Based on these properties, exact back and forth algorithms are proposed to find a single project schedule [7] or multilevel project structure [6]. All methods contain three phases. In the first phase, binary decisions select supplementary tasks to include the project plan. The excluded tasks’ demands and dependencies (i.e., rows and columns in the PDM) are also ignored. The result is a project scenario, which still contains flexible dependencies, but it is decided that all tasks will be completed. Phase two decides flexible dependencies to include or exclude, or in other words, the flexible dependency between tasks either to be specified or to be ignored. A single (multilevel) project structureis the result of this phase, which contains only fixed dependencies. In the last phase, we obtain traditional project plans, which must be solved by standard project scheduling algorithms. The result of this phase is the single (multilevel) project schedule, where the completion modes and start times of all tasks are specified.

Table 5 shows an example for the computation process of a single project, where the target function is the minimal project duration. Task E is unplanned, which means, the constraints are specified before task E occurs. Table 5(a) shows the original project plan, where there are 3 completion modes, 2 renewable resources, cost demands, and quality parameters. There is no nonrenewable resource, however, the cost demand can be considered as a special nonrenewable resource. While keeping constraints, the algorithm has to find a minimal project duration.

Planning approaches	Features
	Project structure	New tasks	Multimode	Constraints
Traditional (TPM)	Fixed	Not allowed	Handled	Fixed
Agile (APM)	Flexible	Not allowed	Not handled	Fixed
Extreme (EPM)	Flexible	Allowed	Not handled	Flexible
Hybrid (HPM)	Flexible	Allowed	Handled	Optional

Table 4.

Comparison of the traditional and flexible approaches.

Table 5.

The phases of the computation.

The minimal TPT occurs if all flexible tasks and dependencies are excluded, however, neither the scope nor the quality constraint does not allow to exclude all tasks (see Table 5(b)), but only task D. In addition, all flexible dependencies cannot be excluded. For example, in the case of the parallel execution of task A and task C, the resource constraint cannot be kept (see Table 5(c)). The algorithm excludes the infeasible structures in phases 1−2. The result of phase 2 provides a multimode resource-constrained project scheduling problem, which can be solved by traditional scheduling algorithms. The final result is a project schedule matrix (PSM) (see Table 5(d)), where both the structure of the project plan and its demands are specified (see Table 5(e)).

4. Risk evaluation

Kosztyán et al. [10] proposed a flexible matrix-based method for risk evaluation for single projects, where all the risk factors, such as changes of durations, changes of resource demands, or even the changes of the task priorities; risk effects, such as delays, overbudgets, etc.; stakeholders, such as managers, vendors and developers and their goals, such as minimal project duration, minimal costs, maximal quality, etc., and their inter-dependencies can be modeled. Nevertheless, phases of risk evaluation can be extended to the multiproject level.

The proposed survival analysis-based risk evaluation (SABER) contains three stages (or phases). In all phases, the feasibility of the projects is checked. A project plan is a surviving project plan if it is still feasible at the end of the risk evaluation process.The evaluation process covers the preparatory, planning, and tracking stages. With SABER, the agents can be compared and competed with each other. The decision maker decides whether a traditional approach, such as TPMa, or a flexible approach, such as APMa, EPMa, or even the hybrid (HPMa) approach, should be applied. The SABER contains the following stages:

1. Since before starting projects, the boundary conditions of the project are agreed upon, at stage one, the effects of changing constraints are examined.

2. At stage two, a two-step Monte Carlo Analysis (MCA) is applied. In the first step, the set of tasks and the relationship of risk factors are selected, while in the second step, the changes in demands and priorities are changed for the selected tasks.

3. At stage three, the two-step MCA is also applied, but only for the remaining and running tasks of running projects.

Figure 1 shows the simulation framework of the SABER.

Figure 1.

The simulation framework.

The simulation framework indicates, which project plans survive. It shows the performances of applied agents and sensitivities of risk effects, and in addition, the interdependency of risk factors and risk effects, see in detail in [10].

5. Computer applications

There are free available matrix-based project planning tools for flexible projects [9]. This plug-in can be applied both for project planning and for risk evaluation. It contains 5 domains, such as LD, TD, CD, QD, and RD. It solves several project scheduling problems (PSPs) for flexible projects, such as Pareto-optimal (multimode) resource-constrained PSPs for a single target function and their Pareto-optimal solutions for multiple targets.

6. Application examples

The application example guides us through matrix-based planning and risk evaluation phases.

The first step is to specify a matrix-based project plan. It can come from the original network-based project plan, but it can be generated. In this case, at least the number of tasks, number of modes, and number of resources have to be specified.

Figure 2(a) shows the logic structure of the flexible project plan. The minimal structures and their demands contain only mandatory tasks and fixed dependencies, while the maximal structure and its demands save all tasks and dependencies, and therefore, all demands. Figure 2 shows the minimal/maximal demands.

Figure 2.

Minimal/maximal structures and demands (the number of tasks was 30, and the number of completion modes and the number of renewable resources was 2).

Figure 2 shows that there are significant differences between the minimal and maximal structures and their demands. Flexible and hybrid approaches can reorganize project structures and reprioritize task completion to save the project plan as feasible. Figure 3(a) shows the result project structures of the project management approaches. Figure 3(b) compares the project demands. The target function was the minimal distance from the minimal demands, while the constraint was 2/3 of the maximal demands. The vertical axis of 3(b) is the performance ($\mathit{TPX}\%$) of the project plans, which is the relative distance between the minimal demands.

Figure 3.

The comparison of project management approaches.

$$\mathit{TPX}\%=\frac{\mathit{TPX}-{\mathit{TPX}}_{\min }}{{\mathit{TPX}}_{\max }-{\mathit{TPX}}_{\min }}$$E20

If $\mathit{TPX}\%\in \left[0,1\right]$for all demands, then the project plan is feasible.

Figure 3 shows that the flexible and hybrid project management approaches try to parallelize task completions and exclude low priority tasks, while TPMa tries to reduce demands but keeps all tasks.

Figure 4 shows the comparison of scheduling performances of the project management approaches under risks. Figure 4 shows that in this case, only the HPMa ensures the survival of the project plan.

Figure 4.

The scheduling performances of project management approaches under risks.

7. Conclusions

In this chapter, matrix-based approaches are proposed to schedule traditional, flexible, and hybrid project plans. In addition, a risk evaluation tool is proposed to compare project management approaches. It is important to note that there is usually no superior project management approach. If the goal is to complete all tasks, traditional approaches are required; however, flexible projects require flexible project management approaches. Nevertheless, hybrid approaches can better ensure the survival of the project. The study also offers freely available matrix-based project planning applications; therefore, all traditional, flexible, and hybrid project management, planning and scheduling approaches can be supported.

Conflict of interest

The authors declare no conflict of interest.

Nomenclature

CD	cost domain
LD	logic domain
ND	nonrenewable resource domain
QD	quality domain
RD	renewable resource domain
TD	time domain
n	number of tasks
m	number of completion modes
p	number of projects
η	number of nonrenewable resources
ρ	number of renewable resources
τ	actual time of a running project
Ct	time constraint (upper bound, scalar)
Cc	cost constraint (upper bound, scalar)
Cq	quality constraint (lower bound, scalar)
Cn	nonrenewable resource constraint (upper bound, 1 by η vector)
Cr	renewable resource constraint (upper bound, 1 by ρ vector)
Cs	score/scope constraint (lower bound, scalar)
TPT→min	minimize project duration
TPC→min	minimize project cost
TPQ→max	maximize project quality
TPNe→min	minimize the sum of nonrenewable resources e, e=1,..,η
TPRr→min	minimize the maximum of renewable resources r, r=1,..,ρ
TPS→max	maximize project score/scope
APM(a)	agile project management (agent)
DMM	domain mapping matrix
DSM	design/dependency structure matrix
EF	early/earliest finish time
EPM(a)	extreme project management (agent)
ES	early/earliest start time
HPM(a)	hybrid project management (agent)
LF	late/latest finish time
LS	late/latest start time
M5	matrix-based multimode multilevel (project) management model
MCA	Monte Carlo analysis [MDM] multidomain matrix
MPE	reverse extreme project management
MPR	multilevel project ranking algorithm
NDSM	numerical dependency structure matrix
PDM	project domain matrix
PSP	project scheduling problem
PSM	project schedule matrix
SABER	survival analysis-based risk evaluation
SF	scheduled finish time
SS	scheduled start time
TPC	total project cost
TPM(a)	traditional project management (agent)
TPN	total project nonrenewable resources
TPQ	total project quality
TPR	total project renewable resources
TPS	total project scenario score
TPT	total project time