Developing a Robust Multi-Skill, Multi-Mode Resource-Constrained Project Scheduling Model with Partial Preemption, Resource Leveling, and Time Windows

Abstract

Real-world projects encounter numerous issues, challenges, and assumptions that lead to changes in scheduling. This exposure has prompted researchers to develop new scheduling models, such as those addressing constrained resources, multi-skill resources, and activity pre-emption. Constrained resources arise from competition among projects for limited access to renewable resources. This research presents a scheduling model with constrained multi-skill and multi-mode resources, where activity durations vary under different scenarios and allow for partial pre-emption due to resource shortages. The main innovation is the pre-emption of activities when resources are unavailable, with defined minimum and maximum delivery time windows. For this purpose, a multi-objective mathematical programming model is developed that considers Bertsimas and Sim’s robust model in uncertain conditions. The model aims to minimize resource consumption, idleness, and project duration. The proposed model was solved using a multi-objective genetic algorithm and finally, its validation was completed and confirmed. Analysis shows that limited renewable resources can lead to increased activity pre-emption and extended project timelines. Additionally, higher demand raises resource consumption, reducing availability and prolonging project duration. Increasing the upper time window extends project time while decreasing the lower bound pressures resources, leading to higher consumption and resource scarcity.

1. Introduction

Scheduling has an intrinsic impact on the production or manufacturing process, and it is also requisite in optimization engineering. Scheduling is the mechanism of organizing, governing, and optimizing the work and workloads of a project. Ordinarily, a project gets diverse forms in various business, production, management, and engineering. But every project is comprised numerous tasks and each task is fixed with a given start and end time. Each task also requires one or more resources to perform its execution. As resources and time are perpetual, projects demand tight scheduling for diminishing project continuation [1]. An issue that is extremely important in various projects is the possibility of planning and scheduling a project and finally accurately predicting its duration project. For this purpose, various methods for project scheduling have been provided. Comprehensive research has been completed and shows that traditional time-based techniques do not give information about the consumption of resources. These methods cannot consider the resource limitation, and at the same time, provide poor information regarding the project duration [2]. Although companies work in a constrained resource environment, traditional techniques such as the Critical Path Method and the Program Evaluation and Review Technique consider only an unconstrained resource state [3].

One of the important factors is constrained resources. Project scheduling with constrained resources refers to the fact that every activity from start to finish requires finite resources. Therefore, attention should be paid to its consumption so that the project does not incur additional costs. Project scheduling problems with constrained resources seek to minimize the project duration and at the same time try to realize resource limitations and precedence relations between activities. However, the multi-mode situation for activities is a topic that has received attention in recent years and is an appendix to the problem of project scheduling with constrained resources, in which several modes are considered to perform an activity and the activities are not completed only in one mode [4].

In recent decades, research on project scheduling with constrained resources has been very extensive, and the problem of project scheduling with constrained resources has resulted in the creation of many articles that show different optimization procedures [5]. The goal of the project scheduling problem with constrained resources is to minimize the cost or time of the project according to precedence and succession relationships and scarcity of resources. The activities are set in the form of start and end times and resources are allocated to the activities to create a justifiable schedule. Constrained resources in project scheduling issues are based on the fact that there is always competition between resources and projects must compete with each other to obtain better resources. A type of resource in which competitiveness is discussed seriously is renewable resources.

There are different types of project scheduling problems with constrained resources, and multi-skill constrained resources with multi-mode activities is an improved form of it [6]. In this type of problem, in addition to constrained resources, they have different types of skills and do not have one level of skills. On the other hand, activities can be completed in different modes, for example, manual and machine modes. In this type of problem, there may be situations where one activity has excess resources while another activity has a lack of resources. It is here that the concept of resource leveling is proposed in such a way that resources are planned in such a way that excess and lack of resources are minimized, that is, resources for activities should not be in such a way that the excess of resources leads to the lack of resources in other activities [7].

On the other hand, activities can generally be pre-empted, i.e., pre-empted for a period of time and restarted, but a new hypothesis has been proposed in the research literature under the title of partial pre-emption of activities, in which the activities subject to pre-emption are pre-empted for a period and resumed again in such a way that the pre-emption of the activity is not postponed to the next period of time [8], so this concept is considered as the pre-emption of activities, which, despite being widely used in real projects, has not been addressed in research. Another important topic in project scheduling problems that has not been addressed is the time window issue, which is generally assigned to routing and flow shop scheduling problems, while it should also be considered in project scheduling problems. In such a way that the project must be completed in a specific time and of course, if this issue is considered as an interval, it is more appropriate because the time of completion of each activity can be limited in the upper and lower bounds of the interval and from this it should not go beyond this time. In this way, the floating for the project is also determined, and the time for the activities is limited to this period. The discussion of interval time windows is rarely considered in research and can be considered as a new issue in the project scheduling problem.

Regarding the mentioned cases and considering that the combination of the above cases has not been investigated in comprehensive research, and on the other hand, issues such as the interval time window and partial pre-emption of activities are rarely considered in project scheduling problems, this research aims to present a project scheduling model considering the above facts. This research presents a multi-objective project scheduling model that considers Bertsimas and Sim’s robust model in uncertain conditions.

In the current research model, the meaning of resources is human resources.

The structure of this paper is as follows: in Section 2, the review of the literature and the review of past research related to this article is discussed. Further, the literature review is presented and then the research gap is extracted. Section 3 introduces the proposed multi-objective mathematical model. Subsequently, in Section 4 the solving of the multi-objective mathematical proposed model is presented. And finally in Section 5, results and discussion are presented and then the analysis of findings and conclusions are presented.

2. Literature Review

The resource-constrained project scheduling problem (RCPSP) is aimed at finding appropriate start/finish times of activities regarding prerequisite relations and resource constraints. This Non-Deterministic Polynomial Time problem (NP-Hard problem) was first introduced by [9], In the project scheduling literature, standard RCPSP has been the subject of many developments and modifications, for example, the introduction of multiple operating modes for activities, generalized precedence relations, preempted activities, and also other approaches for generalizing the resource constraints.

In this section, a review of the literature regarding the latest research in the field of project scheduling with constrained resources is discussed, which probably has considered at least one of the assumptions in the current research. Based on the literature review completed in this section, the study gap is determined at the end and the focal and neglected parts of the research are identified. These points are shown in

Table 1. Literature Review.

Researchers	Year	Goal	Resource Constraints	Partial Preemption	Time Window	Resource Leveling	Multi-Skill Resources	Multi-Mode Activities	Uncertainty
Mejia et al. [9]	2019	Identifying the indicators of justifiability and memory in the scheduling of multi-skill projects with constrained resources	√				√
Moradi et al. [10]	2019	stable scheduling for multi-mode projects under the determined floating under the uncertainty of the duration of the activity						√	√
Hosseinian and Baradaran [11]	2021	Presenting a two-stage approach to solve the multi-project scheduling problem with constrained multi-skill resources in the construction industry	√				√
Etminani Esfahani et al. [12]	2022	An efficient modified algorithm for the project scheduling problem with constrained resources	√
Damci et al. [13]	2022	Using the float consumption rates of activities in leveling the resources of construction projects				√
Ardakani et al. [14]	2022	Multi-objective optimization of project selection with multiple-mode constrained resources and resource leveling	√			√
Lotfi et al. [15]	2022	The problem of balancing the environment, energy, quality, cost, and time under the conditions of constrained resources	√
Ramos et al. [16]	2023	Presenting a model for multi-mode project scheduling problem with constrained resources	√				√
Liu et al. [17]	2023	Presenting a branch and bound algorithm for project scheduling problem with constrained resources	√
Zhang et al. [18]	2023	Investigating the project scheduling problem with complex time constraints in water projects	√						√
Dadhich et al. [19]	2023	Distribution and leveling of resources in construction projects				√
Aristotelous and Nearchou [20]	2023	Resource leveling using hybrid metaheuristics				√			√
Snauwaert and Vanhoucke [21]	2023	Classification of issues about the project scheduling problem with constrained resources	√
Zhao et al. [22]	2023	A project scheduling model with fuzzy activity duration	√						√
Nigar et al. [23]	2023	Multi-objective dynamic software project scheduling problem	√
Pierto et al. [24]	2023	Application of GPT chat for scheduling construction projects					√	√	√
Cheraghi et al. [25]	2023	Scheduling and resource management in construction projects	√						√
Present Research		Presenting a robust multi-skill multi-mode resource-constrained project scheduling model considering partial pre-emption of activities, resource leveling, and interval time window	√	√	√	√	√	√	√

at the end of this section. The reviewed research covers the period from 2019 to 2023.

Mejia et al. pay attention to the indicators of justifiability and memory in the scheduling of multi-skill projects with constrained resources and identify them [9]. Moradi et al. consider stable scheduling for multi-mode projects under the determined floating under the uncertainty of the duration of the activity [10]. Hosseinian and Baradaran sought to present a two-stage approach to solve the multi-project scheduling problem with constrained multi-skill resources in the construction industry [11]. Etminani Esfahani et al. provide an efficient modified algorithm for the project scheduling problem with constrained resources [12]. Damci et al. take advantage of the float consumption rates of activities in leveling the resources of construction projects [13]. Ardakani and Dehghani present a multi-objective scheduling model considering multi-mode resource constraints, with the aim of minimizing the construction time and maximizing the net present value of project cash flows [14]. Lotfi et al. consider the problem of balancing the environment, energy, quality, cost, and time under the conditions of constrained resources, taking into account blockchain technology, risk, and robustness in health sector projects [15].

Ramos et al. present a model for the multi-mode resource-constrained project scheduling problem using a multi-start iterated local search algorithm [16]. Liu et al. present a branch-and-bound algorithm for the resource-constrained project scheduling problem of unit capacity considering the transfer time [17]. Zhang et al. investigate the project scheduling problem with complex time constraints in water projects [18]. Dadhich et al. study the distribution and leveling of resources in construction projects [19]. Aristotelous and Nearchou perform resource leveling using hybrid iterated models [20]. Snauwaert and Vanhoucke deal with the classification of the project scheduling problem with constrained resources [21].

Zhao et al. present a project scheduling problem with partially fuzzy activity durations by formulating three types of fuzzy models, namely, cost minimization models, creditability maximization models, and time-cost trade-off models. In this research, a solution framework based on a new operational rule is presented [22]. Nigar et al. deal with the multi-objective dynamic software project scheduling problem. In this research, a new approach to managing the addition of employees is presented [23]. Pierto et al. deal with the use of chat GPT for scheduling construction projects [24]. Cheraghi et al. deal with scheduling and resource management in construction projects [25].

As can be seen in Table 1, none of the above-mentioned researches contain all the assumptions and innovations described. For example, there is rarely any research on the combination of resource leveling and project scheduling considering resource constraints and multi-skill resources, or the multiple-mode status of activities in combination with other cases is rarely considered. Regarding the interval time window, in the above research, it is not possible to find research that deals with this issue, and partial pre-emption is only mentioned in a study by Mejia et al. [9], which is pioneering research in the field of partial pre-emption in activities. As mentioned earlier, resource leveling is rarely considered alongside resource limitation, while it can be said that there is a close relationship between resource limitation and resource leveling in the project scheduling issue, which cannot be neglected. Considering the shortcomings of the previous research, the present research aims to fill the study gaps.

3. The Proposed Multi-Objective Programming Model

In this section, the research model is presented. The model includes a project scheduling model that is subject to resource constraints. In other words, there are a number of activities that allocate a certain amount of resources to each activity, but the resources are limited, that is, the desired resource may not be available in a period. On the other hand, resources are multi-skill and activities can be performed in different situations.

3.1. Assumptions of the Model

The assumptions of the model are as follows:

• The time of activitiesajadis is uncertain.
• Activities can be pre-empted.
• The time window is considered as an interval.
• Resources are constrained.
• Resources are multi-skill.
• The activities are multi-mode.
• Resources can be leveled.
• It is a multi-period project.
• The model is considered as a scenario.

The indices related to the project scheduling model are listed in

Table 2. Indices.

Row	Index	Meaning
1	$\mathrm{i}$	Project activities
2	$\mathrm{r}$	Project resources
3	$\mathrm{m}$	Activity mode
4	$\mathrm{n}$	Skill
5	$\mathrm{t}$	Period
6	$\mathrm{s}$	Scenario

.

The parameters related to the project scheduling model and the explanations related to the parameters are listed in

Table 3. Parameters.

Row	Parameter	Meaning
1	${\mathrm{R}\mathrm{R}}_{\mathrm{r}}$	Total resources r available
2	${\mathrm{S}\mathrm{D}}_{\mathrm{i}}$	The lower bound of the delivery interval of activity j
3	${\mathrm{F}\mathrm{D}}_{\mathrm{i}}$	The upper bound of the delivery interval of activity j
4	${\mathrm{T}\mathrm{T}}_{\mathrm{i}\mathrm{r}\mathrm{m}\mathrm{n}\mathrm{s}}$	Time to perform activity i using resource r with skill level n under mode m under scenario s
5	${\mathrm{p}}_{\mathrm{i}\mathrm{r}\mathrm{t}}$	If resource r is released during activity interruption periods i then 1, otherwise 0
6	${\mathrm{b}}_{\mathrm{i}\mathrm{r}\mathrm{n}}$	Demand resource r with skill level n for activity i

.

The Decision Variables related to the project scheduling model and the explanations related to the Decision Variables are listed in

Table 4. Decision Variables.

Row	Variable	Meaning
1	${\mathrm{X}}_{\mathrm{i}\mathrm{t}}$	If activity i is running on day t then 1, otherwise 0
2	${\mathrm{Y}}_{\mathrm{i}\mathrm{t}}$	If activity i is interrupted on day t then 1, otherwise 0
3	${\mathrm{Z}}_{\mathrm{r}\mathrm{n}\mathrm{i}\mathrm{t}}$	If resource r with skill level n is assigned to activity i in period t
4	$\mathrm{C}\mathrm{m}\mathrm{a}\mathrm{x}$	Project completion time
5	${\mathrm{U}}_{\mathrm{i}\mathrm{t}}$	If activity i starts in period t then 1, otherwise 0
6	${\mathrm{V}}_{\mathrm{i}\mathrm{t}}$	If activity i is finished in period t then 1, otherwise 0
7	${\mathrm{k}}_{\mathrm{t}}$	The amount of resource consumption in period t
8	δ	Time delays between project activities
9	${\mathrm{L}\mathrm{S}}_{\mathrm{i}}$	The latest start time
10	${\mathrm{E}\mathrm{S}}_{\mathrm{i}}$	The earliest start time
11	${\mathrm{r}}_{\mathrm{r}\mathrm{i}}$	Resource type consumption
12	${\mathrm{S}}_{\mathrm{i}}$	Start time of activity i
13	${\mathrm{F}}_{\mathrm{i}}$	End time of activity i
14	${\mathrm{W}}_{\mathrm{r}}$	Total resources used

.

3.2. Formulation of the Mathematical Model in the Proposed Multi-Objective Programming Model

In this section, the objective functions of the project scheduling model and the limitations of the model are presented according to the assumptions and information in Table 2, Table 3 and Table 4 in Section 3.1.

The Objective functions of the model are as follows:

$$\min \mathrm{z}={{\displaystyle \sum }}_{\mathrm{t}=1}^{\mathrm{T}}\left({\mathrm{k}}_{\mathrm{t}}+{\mathrm{k}}_{\mathrm{t}+1}\right)$$

(1)

The above relationship seeks to minimize the consumption of total resources in two days.

$$\min \mathrm{z}={{\displaystyle \sum }}_{\mathrm{r}=1}^{\mathrm{R}}{{\displaystyle \sum }}_{\mathrm{i}=1}^{\mathrm{I}}\left|{\mathrm{W}}_{\mathrm{r}}-{\mathrm{r}}_{\mathrm{r}\mathrm{i}}\right|$$

(2)

The above relationship minimizes the idleness rate of resources.

$$\min \mathrm{z}3=\mathrm{C}\mathrm{m}\mathrm{a}\mathrm{x}$$

(3)

The above relationship seeks to minimize the total project time.

The constraints of the model are as follows:

$${\mathrm{k}}_{\mathrm{i}}={{\displaystyle \sum }}_{\mathrm{r}=1}^{\mathrm{n}}{{\displaystyle \sum }}_{\mathrm{i}=1}^{\mathrm{I}}{\mathrm{r}}_{\mathrm{r}\mathrm{i}}$$

(4)

The above relationship shows the consumption of resources.

$${\mathrm{W}}_{\mathrm{r}}={{\displaystyle \sum }}_{\mathrm{t}=1}^{\mathrm{T}}{\mathrm{k}}_{\mathrm{t}}$$

(5)

The above relationship shows the total consumption of resources.

$${\mathrm{r}}_{\mathrm{i}\mathrm{r}}\le \mathrm{R}{\mathrm{R}}_{\mathrm{r} }$$

(6)

The above relationship shows that the consumption of resources cannot be more than the available resources.

$${\mathrm{S}}_{\mathrm{i}}-{\mathrm{S}}_{\mathrm{i}+1}\ge \mathrm{\delta }$$

(7)

The above relationship seeks to minimize the amount of delays.

$$\mathrm{E}{\mathrm{S}}_{\mathrm{i}}\le {\mathrm{S}}_{\mathrm{i} }$$

(8)

The above relationship indicates the earliest time to perform the activity.

$${\mathrm{S}}_{\mathrm{i}}\le \mathrm{L}{\mathrm{S}}_{\mathrm{i}}-\mathrm{E}{\mathrm{S}}_{\mathrm{i} }$$

(9)

The above relation calculates the latest time of the activity.

$$\mathrm{E}{\mathrm{S}}_{\mathrm{i}}\le {\mathrm{F}}_{\mathrm{i}-1 }$$

(10)

The above relationship shows the earliest time to start the activity.

$$\mathrm{L}{\mathrm{S}}_{\mathrm{i}}\le {\mathrm{S}}_{\mathrm{i}+1 }$$

(11)

The above relationship shows the latest activity start time.

$${\mathrm{S}}_{\mathrm{i}}+\mathrm{T}{\mathrm{T}}_{\mathrm{i}\mathrm{r}\mathrm{m}\mathrm{n}\mathrm{s}}={\mathrm{F}}_{\mathrm{i} }$$

(12)

The above relation calculates the termination time of an activity.

$${\mathrm{S}}_{\mathrm{i}}+\mathrm{T}{\mathrm{T}}_{\mathrm{i}\mathrm{r}\mathrm{m}\mathrm{n}\mathrm{s}}={\mathrm{S}}_{\mathrm{i}+1 }$$

(13)

The above relationship shows the start time of the next activity.

$${\mathrm{F}}_{\mathrm{i}}\ge \mathrm{S}{\mathrm{D}}_{\mathrm{i} }$$

(14)

The above relationship states that the end time of the activity cannot end earlier than the lower bound of the delivery deadline.

$${\mathrm{F}}_{\mathrm{i}}\le \mathrm{F}{\mathrm{D}}_{\mathrm{i} }$$

(15)

The above relationship states that the end time of the activity cannot be later than the upper bound of the delivery deadline.

$$\left({{\displaystyle \sum }}_{\mathrm{i}}^{\mathrm{I}}{\mathrm{X}}_{\mathrm{i}\mathrm{t}}+{{\displaystyle \sum }}_{\mathrm{i}}^{\mathrm{I}}{\mathrm{p}}_{\mathrm{i}\mathrm{r}\mathrm{t}}{\mathrm{Y}}_{\mathrm{i}\mathrm{t}}\right){\mathrm{b}}_{\mathrm{i}\mathrm{r}}\le \mathrm{R}{\mathrm{R}}_{\mathrm{r} }$$

(16)

The above relationship guarantees that the total demand for a resource at time t does not exceed its capacity. An activity occupies resources at time t if the activity is running at time t or if the activity has a partial pre-emption at time t and if the resource for this activity cannot be released.

$${\mathrm{p}}_{\mathrm{i}\mathrm{r}\mathrm{t}}\left(1-{\mathrm{X}}_{\mathrm{i}\mathrm{t}}\right)\ge {\displaystyle \sum }_{\mathrm{t}=1}^{\mathrm{I}}{\mathrm{X}}_{\mathrm{i}\mathrm{t}}$$

(17)

The above relation states that for each precedence and succession constraint, activity j cannot be completed before the completion of the previous activity.

$${\mathrm{U}}_{\mathrm{i}\mathrm{t}}\ge {\mathrm{X}}_{\mathrm{i}\mathrm{t}}$$

(18)

The above relationship shows that a variable is started in a period if it was in progress in the previous period.

$${\mathrm{V}}_{\mathrm{i}\mathrm{t}}\ge {\mathrm{X}}_{\mathrm{i}\mathrm{t}}$$

(19)

The above relationship states that an activity is ended in a period if it has been running in that period.

$${\mathrm{Y}}_{\mathrm{i}\mathrm{t}}={\mathrm{U}}_{\mathrm{i}\mathrm{t}}+{\mathrm{V}}_{\mathrm{i}\mathrm{t}}-{\mathrm{X}}_{\mathrm{i}\mathrm{t}}-1$$

(20)

The above relationship states that a partially pre-empted activity is pre-empted if it was not running at time t while it was running in the periods before and after t.

$${\mathrm{U}}_{\mathrm{i}\mathrm{t}}+{\mathrm{V}}_{\mathrm{i}\mathrm{t}}-{\mathrm{X}}_{\mathrm{i}\mathrm{t}}=1$$

(21)

The above relation states that a continuous activity must be completed at time t if it was running before and after t.

$$\mathrm{C}\mathrm{m}\mathrm{a}\mathrm{x}\ge {\mathrm{F}}_{\mathrm{i}}$$

(22)

The above relationship shows that the completion time of a project cannot be less than the completion time of any activity.

3.3. Uncertainty Approach

Robust optimization is one of the latest techniques introduced in the field of mathematical modeling and optimization. The main nature of this method is based on the principle that uncertain parameters can be controlled in the mathematical model. The main assumption of mathematical modeling and its optimization in the classical mode is that the value of all parameters is known accurately and definitively. However, in real conditions, some parameters may not be known definitively. Using methods of dealing with uncertainty helps us to model and then optimize various problems that have uncertain parameters. The concept of robustness refers to the fact that due to the changes in uncertain parameters, the value of the objective function also changes and fluctuates. Now, among the different values of this uncertain parameter, one should choose a value that provides the most suitable value of the objective function from the point of view of the decision maker and also the least fluctuation in the value of the objective function. This approach was initially introduced by Soyster and later developed by more researchers such as Bertsimas and Sim.

In robust optimization, very simply, a range of parameters is first introduced. The lower and upper bounds of these parameters can be determined based on numerical estimates. In the next step, the mathematical model is rewritten and a robust model is presented by performing the calculations specified by Bertsimas and Sim. In fact, Bertsimas and Sim proposed a different approach to control the conservatism level of the solution, this approach has the advantage of leading to a linear optimization model, so this approach can be used directly for discrete optimization models. If in the following model:

$$\begin{array}{l}\max \mathrm{z}={\displaystyle {\displaystyle \sum }_{\mathrm{j}=1}^{\mathrm{n}}}{\mathrm{c}}_{\mathrm{j}}{\mathrm{x}}_{\mathrm{j}}\\ \mathrm{s}.\mathrm{t}: {\displaystyle {\displaystyle \sum }_{\mathrm{j}=1}^{\mathrm{n}}}{\mathrm{a}}_{\mathrm{i}\mathrm{j}}{\mathrm{x}}_{\mathrm{j}}\le {\mathrm{b}}_{\mathrm{i}} \forall \mathrm{i}=1. 2\dots .\mathrm{m}\\ {\mathrm{x}}_{\mathrm{j}}\ge 0 \forall \mathrm{j}=1.2. \dots \mathrm{n}\end{array}$$

(23)

Assuming that parameters ${\mathrm{c}}_{\mathrm{j}}$ and ${\mathrm{b}}_{\mathrm{i}}$ contain definite numbers and parameters ${\mathrm{a}}_{\mathrm{i}\mathrm{j}}$ contain uncertain data. Assuming that each of the coefficients ${\mathrm{a}}_{\mathrm{i}\mathrm{j}}$ is modeled as an independent random variable with symmetric and bounded distribution ${\tilde{\mathrm{a}}}_{\mathrm{i}\mathrm{j}}$ and takes a value in the interval $\left[{\mathrm{a}}_{\mathrm{i}\mathrm{j}}-{\widehat{\mathrm{a}}}_{\mathrm{i}\mathrm{j}},{\mathrm{a}}_{\mathrm{i}\mathrm{j}}+{\widehat{\mathrm{a}}}_{\mathrm{i}\mathrm{j}}\right]$, where ${\mathrm{a}}_{\mathrm{i}\mathrm{j}}$ and ${\tilde{\mathrm{a}}}_{\mathrm{i}\mathrm{j}}$ are the nominal value and the maximum deviation from the nominal value. Also, consider ${\mathrm{J}}_{\mathrm{i}}$ as the set of imprecise parameters in the i-th constraint.

Bertsimas and Sim introduced the ${\mathsf{\Gamma }}_{\mathrm{i}}$ parameter for each constraint i, which is called the uncertainty budget, to achieve the robustness of the solution. The parameter ${\mathsf{\Gamma }}_{\mathrm{i}}$ takes value in the interval $\left[0, \left|{\mathsf{\Gamma }}_{\mathrm{i}}\right|\right]$, so that $\left|{\mathsf{\Gamma }}_{\mathrm{i}}\right|$ represents the number of imprecise technical coefficients in the i-th limit. The role of parameter Γ_i in the constraints is to adjust the level of robustness against the level of conservatism of the solution, and the higher it is, the level of conservatism of the solution increases.

Bertsimas and Sim’s robust counterpart for the linear programming model is defined as follows, assuming uncertain technical coefficients:

$$\begin{array}{l}\max \mathrm{z}={\displaystyle {\displaystyle \sum }_{\mathrm{j}=1}^{\mathrm{n}}}{\mathrm{c}}_{\mathrm{j}}{\mathrm{x}}_{\mathrm{j}}\\ \mathrm{s}.\mathrm{t}: {\displaystyle {\displaystyle \sum }_{\mathrm{j}=1}^{\mathrm{n}}}{\mathrm{a}}_{\mathrm{i}\mathrm{j}}{\mathrm{x}}_{\mathrm{j}}+{\mathrm{z}}_{\mathrm{i}}{\mathsf{\Gamma }}_{\mathrm{i}}+{\displaystyle {\displaystyle \sum }_{\mathrm{j}=1}^{\mathrm{n}}}{\mathrm{p}}_{\mathrm{i}\mathrm{j}}\le {\mathrm{b}}_{\mathrm{i}} \forall \mathrm{i}=1,\dots ,\mathrm{m}\\ {\mathrm{z}}_{\mathrm{i}}+{\mathrm{p}}_{\mathrm{i}\mathrm{j}}\ge {\widehat{\mathrm{a}}}_{\mathrm{i}\mathrm{j}}{\mathrm{y}}_{\mathrm{j}} \forall \mathrm{i}=1,\dots \mathrm{m} , \mathrm{j}=1, \dots ,\mathrm{n}\\ -{\mathrm{y}}_{\mathrm{j}}\le {\mathrm{x}}_{\mathrm{j}}\le {\mathrm{y}}_{\mathrm{j}} \forall \mathrm{j}=1,\dots ,\mathrm{n}\\ {\mathrm{x}}_{\mathrm{j}},{\mathrm{y}}_{\mathrm{j}}\ge 0\\ {\mathrm{z}}_{\mathrm{i}}\ge 0\\ {\mathrm{p}}_{\mathrm{i}\mathrm{j}}\ge 0\end{array}$$

(24)

The role of uncertainty budget in the above model is defined as follows:

• If ${\mathsf{\Gamma }}_{\mathrm{i}}=0$, the i-th constraint is not protected against uncertainty.
• If ${\mathsf{\Gamma }}_{\mathrm{i}}=\left|{\mathrm{J}}_{\mathrm{i}}\right|$, the i-th constraint is completely protected against uncertainty.
• If ${\mathsf{\Gamma }}_{\mathrm{i}}=\left(0, \left|{\mathrm{J}}_{\mathrm{i}}\right|\right)$, the decision maker can make a trade-off between the protection level of the i-th constraint and the degree of conservatism of the solution.

4. Solving Multi-Objective Mathematical Proposed Model

Genetic Algorithm (GA) have been widely used in the last three decades to address multi-criteria decision problems. The basic feature of this algorithm is multiple directional and global searches through maintaining a population of potential solutions from one generation to the next generation. The population-to-population approach is useful when exploring Pareto solutions. Moreover, GAs do not have many mathematical requirements and can handle all types of objective functions and constraints; hence, their use in the multi-objective era is promising (Tavakkoli-Moghaddam. R, 2010 [26]).

4.1. Displaying the Answer in Multi-Objective Genetic Algorithm

In this research, a multi-objective genetic algorithm or Non-dominated Sorting Genetic Algorithm (NSGAII algorithm) is used to solve the three-objective model of this research. The objective functions of the proposed model include minimizing resource consumption, minimizing resource idleness, and minimizing project time. Displaying the answer includes how to draw the answer according to the variables of a model. According to the present problem, which is a multi-objective problem, several objectives are drawn in the form of a chromosome and each decision variable is considered as a gene in this chromosome.

The two objective functions have the nature of integers and the third objective function has the nature of permutation. Therefore, the type of chromosomes used includes integer and permutation chromosomes. Because the variables in the objective functions are of integer type and permutation, the sample of chromosomes that includes the values of resource consumption in the first and second objective functions is as follows:

The first objective function is the minimizing the resource consumption.

Table 5. Display of the integer answer vector for the amount of resource consumption in the first objective function.

14

21

37

31

44

53

29

35

32

18

is an example that Display of the integer answer vector for the amount of resource consumption in the first objective function.

The second objective function is the minimizing the unemployment of resources.

Table 6. Display of the integer answer vector for the amount of resource idleness in the second objective function.

8

11

5

14

12

23

14

10

6

7

is an example that Display of the integer answer vector for the amount of resource idleness in the second objective function.

As it can be seen, the two mentioned chromosomes are integers that can be repeated in every cell, and the Arithmetic method is used for the operation of Crossover and mutation according to the nature of their integers. However, when determining the sequence of performing activities in a specific order, a permutation chromosome should be used. The permutation chromosome for the third objective function in the present research is as follows:

The third objective function is the minimizing the total project time.

Table 7. Display of the permutation answer vector for optimal sequence of activities of a project in the third objective.

10

8

5

7

2

1

3

9

6

4

is an example that Display of the permutation answer vector for optimal sequence of activities of a project in the third objective.

As can be seen, it is not possible to repeat the numbers in the above chromosome because it is permutative and each index in each cell is a sign of performing an activity and shows the sequence of activities. In order to update the above chromosome, crossover, and single-point mutation operations are used. In this way, only two genes are moved with each other so that the updating process takes place. In single-point mutation, a gene is randomly selected and a change is made in it so that the act of mutation is simulated. Finally, after obtaining the best values for the objective functions, that value is placed in the best category and the repetition of the algorithm continues with the end of the determined repetition.

Also, regarding how to deal with unjustified answers, it should be said that the penalty method is used. In order to solve invalid answers, penalty methods and optimal correction of the answer are used. In such a way that if any value in a limit is violated and exceeds the set limit, a penalty is considered in the objective function for that decision variable. Moreover, in the method of optimal modification of the solution using MATLAB software (R2018b), the maximum value of integer variables is equal to the parameter on the right side of the specified limit.

4.2. Analysis

In this section, the findings are analyzed. First, the validation of the model is completed, and then the effect of demand, renewable resources, upper and lower bounds of delivery, and finally uncertainty on the objective functions are investigated. In

Table 8. Dimensions of the problem.

No.	Number of Activities	Resources	Activity Status	Skill	Period	Scenario
1	10	1	2	1	1	1
2	10	1	2	1	2	1
3	10	1	2	2	3	1
4	15	2	2	2	4	1
5	20	2	2	2	5	2
6	22	3	2	3	6	2
7	24	3	2	3	7	2
8	26	4	2	3	8	2
9	28	4	2	3	9	3
10	30	5	2	3	10	3
11	35	5	2	4	11	3
12	40	5	2	4	12	3
13	45	6	2	4	13	3
14	50	6	2	5	14	3
15	55	6	2	5	15	3
16	60	7	2	6	16	3
17	65	7	2	6	17	3
18	70	8	2	6	18	3
19	80	8	2	7	19	3
20	90	9	2	7	20	3

, the dimensions of the model are first introduced and then its solution has been completed in different dimensions, the results of which are presented below. The numerical examples presented are based on the research of Ramos et al. [16], Mejia et al. [9], and Liu et al. [17].

As it can be seen in Table 8, 20 examples are presented, and based on these 20 examples, the model is validated in such a way that in each example, an increase in dimensions is created compared to the previous example, and naturally this increase should be lead to an increase in the values of the objective functions and calculation time. The result of solving the model in different dimensions is presented in

Table 9. Solving the model in different Dimensions.

No.	Resource Consumption	Resource Idleness	Project Total Time	Calculation Time
1	138	1646	38	18
2	147	1745	48	22
3	152	1808	53	24
4	158	1858	60	26
5	165	1909	69	30
6	172	1972	75	32
7	181	2038	81	34
8	186	2103	90	38
9	194	2187	95	43
10	199	2255	100	45
11	204	2343	105	49
12	209	2432	113	51
13	216	2515	123	54
14	221	2571	129	58
15	227	2632	134	60
16	230	2732	140	63
17	236	2781	147	66
18	243	2802	149	71
19	252	2891	153	76
20	257	2979	158	81

.

The results of solving the model show that in each example there has been a change and actually an increase compared to the previous problem. In order to better analyze, the graphs of the effect of increasing dimensions on resource consumption, resource idleness, total project time, and problem-solving time are used.

As shown in Figure 1, with the increase in dimensions, resource consumption also increases.

As shown in Figure 2, with the increase in dimensions, resource idleness also increases.

As shown in Figure 3, with the increase in dimensions, the total project time also increases.

As shown in Figure 4, with the increase in dimensions, the calculation time also increases.

As it can be seen, all three objective functions as well as the calculation time have increased due to the increase in dimensions, which is the logical result of solving the model in different dimensions, and therefore, based on this, it can be said that the model has the necessary validity. In the following, the effect of renewable resources will be investigated. Considering that renewable resources are considered constrained in this research, therefore, the effect of this restriction on the objective functions should be shown. In

Table 10. The effect of reducing renewable resources on objective functions.

Reduction in Renewable Resources	Number of Pre-empted Activities	Resource Consumption	Resource Idleness	Project Total Time
0%	5	199	2255	100
10%	8	193	3706	111
20%	12	180	6232	136
30%	17	162	10,734	178
40%	24	138	16,603	237
50%	32	105	24,354	310
Reduction in Renewable Resources	Percentage Change in Number of Pre-empted Activities	Percentage Change in Resource Consumption	Percentage Change in Resource Idleness	Percentage Change in Project Total Time
0%	0	0	0	0
10%	0.6	−0.03015	0.643459	0.11
20%	0.5	−0.06736	0.681597	0.225225
30%	0.416667	−0.1	0.722401	0.308824
40%	0.411765	−0.14815	0.546767	0.331461
50%	0.333333	−0.23913	0.466843	0.308017

, this review is shown in quantitative and percentage form.

In the following, the effect of renewable resources, demand, and upper and lower bounds on all three objective functions is investigated. Due to lack of space, in the following, only the relevant Figures are presented and only the table of renewable resources described in the previous section is presented.

Figure 5 shows the effect of renewable resources on the objective functions. According to the information in table number 10, this diagram was obtained. In fact, by reducing the amount of renewable resources, the percentage of changes is shown in the Number of Pre-empted Activities, Resource Consumption, Resource Idleness, and Project Total Time.

As can be seen, the reduction in renewable resources increases the project completion time by 30%, and the reason for this is that due to the lack of resources, more activities are pre-empted. This pre-emption can be seen up to a 40% increase in activities. Although the blue graph shows that this increase is up to 60% at first and then less than 40%. On the other hand, the idleness of resources also increases due to this pre-emption in activities, but the consumption of resources decreases due to the decrease in the number of renewable resources, and this objective function is the only decreasing objective function due to the increase in renewable resources.

Figure 6 shows the effect of demand on the objective functions. In fact, by increasing the demand for resources, the percentage of changes is shown in the Number of Pre-empted Activities, Resource Consumption, Resource Idleness, and Project Total Time.

Figure 6 shows the effect of demand on objective functions. In this section, it is assumed that the demand for resources will increase, this will cause more activities to be pre-empted, because the increase in demand generally leads to a decrease in the available resources, and in fact, the same effect as Figure 5, which shows renewable resources is repeated here. On the other hand, the project completion time increased due to more pre-emptions, but the idleness of resources decreased slightly due to the increase in demand. Resource consumption also increases. Therefore, the demand has a negative effect on the total project time and the consumption of more resources due to the effect it has on the pre-emption of activities.

Figure 7 shows the effect of increasing the upper bound on the objective functions. In fact, by increasing the upper bound, the percentage of changes is shown in the Number of Pre-empted Activities, Resource Consumption, Resource Idleness, and Project Total Time. In Figure 7, the maximum delivery time has increased, which increases the total project time, while it has no effect on pre-emption activities, that is, it does not increase it, and on the other hand, it does not cause idleness of resources.

In Figure 7 and Figure 8, the upper and lower bounds, which are one of the innovations of the present research that considers the time window, are analyzed. In the lower bound, the minimum delivery time of activities and projects is proposed, while in the upper bound, the maximum is desired. In Figure 7, the maximum delivery time has increased, which increases the total project time, while it has no effect on pre-emption activities, that is, it does not increase it, and on the other hand, it does not cause idleness of resources. However, it increases resource consumption. While the lower bound, which is the minimum delivery time, if it is reduced, i.e., the requirement for early delivery, causes an increase in the activities with partial pre-emptions, and as a result, the consumption of resources also increases. As a result, the idleness of resources is reduced, and the total time is also reduced. The interesting thing to note is that in case of reduction in renewable resources, the idleness of resources will be affected more than other things. However, in the case of increasing demand and decreasing the lower bound, the number of pre-empted activities shows the greatest reaction. The increase in the number of pre-empted activities affects the project time, but it is the result of increasing the consumption of resources, decreasing the available resources, and increasing the demand.

In the following, uncertainty will be investigated. The activity time parameter is considered a scenario parameter that is considered under three optimistic, medium, and pessimistic scenarios. In this section, the aim of the research is to find out whether different scenarios have an effect on the goals or not. The results are presented in

Table 11. Time to perform activities under Uncertainty.

Increasing Activities Time	Optimistic			Medium			Pessimistic
	Resource Consumption	Resource Idleness	Project Total Time	Resource Consumption	Resource Idleness	Project Total Time	Resource Consumption	Resource Idleness	Project Total Time
0%	199	2255	100	217	2420	115	228	2601	135
10%	209	2355	114	232	2556	130	239	2763	151
20%	219	2484	124	252	2678	148	250	2952	171
30%	230	2675	142	263	2808	158	264	3073	185
40%	250	2862	153	278	2982	168	275	3200	204
50%	261	2975	171	292	3171	181	292	3375	220

.

Figure 9 is designed based on the information in Table 11. It shows the Project Total Time under three scenarios.

Figure 10 is designed based on the information in Table 11. It shows the Resource consumption under three scenarios.

Figure 11 is designed based on the information in Table 11. It shows the idleness of resources under three scenarios.

Based on Figure 9, Figure 10 and Figure 11, it can be seen that the time of different scenarios can have an effect on the project completion time, that is, under the optimistic scenario, the project completion time is less than the middle and pessimistic scenarios, even with an increase in the time of activities. It was expected. However, regarding the consumption of resources, there is not much difference between the existing scenarios, although the optimistic scenario is still better than the other two scenarios. The two middle and pessimistic scenarios do not show much difference in terms of resource consumption. Figure 11 shows the idleness of resources under different scenarios, which shows the difference between the three scenarios, and of course, the optimistic scenario is better than the other two scenarios. Therefore, apart from the consumption of resources, it should be said that different scenarios cause changes in the values of the objective functions.

5. Results and Discussion

In today’s world, the implementation and management of projects have changed a lot and unlike the past, they are not managed without considering unpredictable realities. Naturally, every project has lack of resources, increase in time and unpredictable costs. Therefore, finding an optimal project schedule considering different project objectives is vital for managers to achieve stakeholders’ satisfaction [27]. Project managers schedule activities and allocate resources to activities regarding time, cost and quality objectives [28]. Regarding the project schedule, it should be noted that the lack of resources can have a significant effect on the time of the activities, as the results of the present research show that the reduction in resources can significantly reduce the time of the project. In this regard, project planners should pay more attention to reducing resources uctuations in many projects during the planning stage of project management [29]. The reason for that is a partial pre-emption in the activities, so the supply of renewable resources can prevent such a situation from happening. On the other hand, the idleness of resources, which can be detrimental to the project management, occurs due to the pre-emption of activities, and one of the main goals of this research to reduce idleness is resources. On the other hand, demand is a factor affecting the pre-emption of activities in a partial way, that is, it can cause the pre-emption of activity in a specific period, the reason for which is the increase in the need for resources, the consumption of resources, and as a result, the lack of resources. Therefore, project management should not ignore the effect of demand. Another important issue raised in the present research is determining the upper and lower bounds for carrying out activities in such a way that an activity should not be delivered earlier than one time and finished later than another time. This shows that early delivery is not always appropriate in some projects, and the present research also addresses this issue. The results show that the upper bound of the delivery time if increased, cannot lead to an increase in pre-empted activities, while it can increase the consumption of resources, but it does not have an effect on idleness, and it can be said that it only affects the consumption of resources, thus intensifying one goal. Though, if it is necessary to make the delivery earlier, as a result, the activities will be partially pre-empted, and consequently, the consumption of resources, which is one of the objectives of the present research, will be intensified.

Therefore, the management approach in the present research should be to issues such as demand, change in delivery time, and also renewable resources, i.e., these three factors are factors that seriously arouse the sensitivity of the issue and should be considered as serious and effective factors in scheduling a project, and each of them can intensify a goal in its place, even if they do not affect other goals.

In general, projects are delayed for various reasons. one of the ways to reduce the project time is to reduce the time of the project activities. Project experts are usually concerned about satisfying or mitigating delays and achieve this by compressing the schedule to shorten the project duration [30]. But a point that is very important and should be considered is resource limitations and uncertainty.

In fact, it can be said that the current research has succeeded in solving a model that has been neglected in previous research in the field of project planning. For example, the current research has managed to provide a model for project scheduling by considering uncertainty, where resources are limited, and on the other hand, leveling of resources should be completed according to resource constraints. In this paper, resources are not single-skilled, and partial interruption of activities has been implemented as one of the main innovations of this research. The results of this research show that partial pre-emption of multiple-mode activities in a project can be implemented considering other assumptions.

In this paper, the effect of resource constraints and time window, on the project scheduling was investigated despite the partial pre-emption of activities. In general, the addition of resource constraints to a scheduling problem may affect its computational complexity [31]. In the partial pre-emption of activities, it is considered that the activities can be pre-empted in a certain period and the reason is the lack of resources. The results of this research show that the lack of renewable resources has increased the pre-emption of activities, and this increase can naturally affect the total project time. Of course, the effect of increasing interruptions or interrupted activities is only on the project schedule, while resource consumption decreases due to resource limitations. On the other hand, the unemployment of resources, which can lead to an increase and impose more costs for a project, also increases. Therefore, for a project that is implemented with renewable resources, it is necessary that these resources are always available, and its reduction is prevented because it has the greatest effect on all three goals. On the other hand, demand can be increased, although idleness reduces resources, but it increases consumption and on the other hand, it leads to a lack of available resources. This should also be properly managed by the project managers and the demand discussion should be taken seriously as an important issue.

Assuming the existence of an upper bound and a lower bound for the delivery time, it should be noted that the upper bound can lead to a reduction in resource consumption and create more adjustments in resources, while on the other hand, it can increase the total time because total time is a function of delivery time. However, the lower bound is effective on the minimum delivery time, and the more this time decreases, the more pressure is put on the resources, and as a result, it can lead to pre-emption of activities, an increase in resource consumption, and an increase in project time, because the increase in project time depends on the number of pre-empted activities. Finally, the uncertainty in the time of carrying out the activities shows that under different scenarios it is only the consumption of resources that does not show much change between the optimistic and the middle scenario, but the idleness of resources and the project completion time are completely different under different scenarios.

It is suggested that in future research, the risk of activities in partial pre-emption conditions should be taken into consideration. On the other hand, in the future, researchers can consider topics such as skill switches regarding multi-skill problems, as well as the risk of performing activities in different situations. Economic topics such as the current value of the project due to the pre-emption of activities can also be considered in future research.