Skip to main content

Considering Project Management Activities for Engineering Design Groups

Abstract

This paper explores the topic of benefit-augmenting project planning. Accept that an array of potentially beneficial activities is available, but restricted usable resources may not allow each of them to be pursued. Benefit profiles of undertakings are considered to be non-expanding aspects of the time of completion of activities. Formal numerical models are comprehensive for the different variants of the problem, including those incorporating a third group arrangement view. The nature of the problem is analyzed, and the degree of information is improved with respect to the importance of the undertaking, in particular. Future exploration territories include the identification of the general conditions under which the prioritization of tasks can contribute to an optimal arrangement. The increase of better upper limits of the verifiable list program is additionally a hobby. It would also be exciting to understand how the mutual deviation data can be fed back to the preceding phases of the choice of mission and booking.

Introduction

The Webster word definition characterizes a project as an “ordered undertaking.” Extensive operations date back a few thousand years before, for example, the building of pyramids in Egypt, the Mayan sanctuaries in Central America, and the Great Wall of China. Truth be told, in comparison to the non-stop, repetitive activities that an agency or group undertakes, a project is usually a set of tasks/occupations/exercises that it undertakes to carry out with planned start dates and completion dates to achieve those objectives [18, 20, 22, 31, 34]. In this article, we are going to take a gander on a project arrangement and group arrangement problem. We must devote limited resources to the tasks chosen and plan for their execution. They also need to do away with people, such as design architects, to project classes. Our goal is to increase the overall benefit. We are currently considering the different parts of our problem.

The main part of our problem is the reality about the profit impact of time-to-market. When all is said to be finished, the time-to-market of the applicant and the request for admission shall have a significant effect on the consequent pace of the overall industry. Prior and wide contestants have a remarkable and continuing favorable position over adherents on the part of the industry as a whole and consequently profit. The effect of time-to-market on the arrival of a piece of pie has received a great deal of attention from supporting science research [12, 38].

The first viewpoint, we considered relates to portfolio allocation and capital planning. A number of points of view are included in the mission or capital planning question for the organization. The critical goal should be decided to begin with. The second point of view is the distinction between possible undertakings. The third angle is to discuss the resource requirements of the projects, as well as the availability of the organization. The fourth point of view is to choose a measure worthy of the undertaking and to assess/allow quality for every task. The last point of view is then to choose an arrangement of projects to improve the key target [7, 8, 32, 33].

In this article, we are concerned with amplifying the overall turnover of the undertaking. Correspondingly, we choose the finishing edge as a measure of value for tasks. We assume that the design administrator has formally identified an arrangement of possible tasks and that the needs and availability of resources are also known. Therefore, we agree that the gain profile as an aspect of time is equally accessible for every task.

A notable aspect of this discovery has to do with the Resource Constraint Project Scheduling Problem (RCPSP). The argument in the RCPSP is to identify the best planning arrangement of activities with the base time of the project completion time.

Essential restrictions, between the exercises and the most extreme usable measure of each renewable asset in the accessible areas of the project, are two groups of constraints on scheduling activities in this area. Each movement has a structure and the time of operation and the need for an asset arrangement is thought to be steady.

A typical project planning issue involves the coordination of tasks (assignments or jobs) that should be performed in order to complete the mission. Such jobs, in large part, have learned the word and need to comply with certain priority ties. The issue is to find an arrangement of attainable calendars (beginning times or completion dates) for jobs that minimizes the completion time of the mission.

There is a capital dimension to the problem of project planning. That is, jobs usually consume or require capital while they are being performed [4, 9]. The simple project booking problem, which accepts unlimited resources, can be effectively eliminated by the Critical Path Method (CPM) or the Project Evaluation and Review Technique (PERT). CPM is a deterministic model. Perky acknowledges that the length of the campaign is subjective. The basic business planning issue turns into a key resource-restricted project scheduling problem (RCPSP) when forced by limited renewable resources, i.e., resources that are available in a limited amount at any time during which the project is to be booked. The RCPSP has been shown to be NP-hard in the solid sense [49].

The last aspect of our analysis is the arrangement of synergistic classes. Occupations also oblige groups of workers, usually with heterogeneous attitudes. In order to achieve the profession, the workers in the company must impart. More than one model for effective community collaboration can be found in literature. The following part (writing audit section) will give a speech on a few models, but we’d only look at the one we are using here.

A few writers have suggested models to explain group cooperative energy—what behavior and productivity come about when you set up people together to form a group. In Kolbe [79], this style is depicted. By large experimental engagement with free-test fortification, a model of powerful community cooperative energy has been established in the light of a combination of the instinctive behaviors of colleagues.

In the synopsis, in this article, we are dealing with three stages. They consider the organization of operations, the revenues of which are at the height of time. For insufficient renewable resources, we need to schedule the execution of all activities of choice. With regard to HR, we consider the issue of positive community cooperation using the Kolbe cooperative energy measure. Our general objective is to improve the benefits while retaining a large group of cooperative resources.

Literature Review

In the following three areas, we will speak about critical writing: the impact of time-to-market-resourced mandatory project planning and community arrangements.

Effect of Time-to-Market on Profit

In today’s creative commercial enterprises, the pace and rate at which businesses can put products into operation is unfair in terms of maintaining a game-changer and a part of the market as a whole. A McKinsey & Company report has shown that a cutting-edge item coming into business 6 months late would reduce its profit by 33% over the next 5 years [90]. A modest calculation in Clark et al. [35] indicates that an auto bid of $10,000 each day of postponing the item presentation would cost the automaker more than $1 million in lost benefits.

Experts have shown early market access points of interest. For example, Robinson and Fornell [99] and Urban et al. [117] observed as early entrants had a long-term advantage of a greater part of the overall market than later competitors in consumer goods.

Urban et al. [117] conducted an extensive analysis of the effect of the appeal of a company segment on its pie piece. We consider the relative part of the pie of the contending competitor to be the connecting variable of the pioneer contestant, as shown by the log direct potential of four free variables: demand for passage, advertising, time in the center of pages, and place of adequacy. Their significant findings include the beneficial outcomes of publicizing and evaluating feasibility and the negative impact of the demand for a passage.

A separate further analysis of time-to-market has also been conducted. Datar et al. [38], for example, bolstered the impact of new item advancement (NPD) methodologies on time-to-market, and Cohen et al. [36] and Calantone and Benedetto [27] inspected the correlation between item execution and time-to-market.

Resource Constrained Project Scheduling

RCPSP has a strong relationship with other primary combination issues, such as concurrent building change and job shop booking problems [39]. Early order and analysis of the RCPSP can be found in [39, 69]. RCPSP is a NP-hard combination problem. The evidence can be found in the work of Demeulemeester and Herroelen [49]. RCPSP has a strong relationship with other primary combination issues, such as concurrent building change and job shop booking problems [39]. One interesting difference between them is that any move in project booking is “standout” while those in the other two issues are mostly monotonous. The goal of task planning usually describes the completion of one thing, while the modification of the mechanical production system and the hiring of workshops entail numerous things and long-distance outcomes [6, 15, 16].

RCPSP work can typically be separated into two worldly cycles. The main timeline is from the late 1960s to the mid 1990s, and the second timeframe is the last twenty or more years. During the first phase, most of the research centered on the RCPSP. Exact/analytical/optimal methodology of specification sorting and single-pass heuristics requires control sorting that overwhelms the exploration range. Many forms of entire number of programming concepts have been suggested by different scientists. Such formulations have been considered more comprehensive in Table 1.

Table 1 A classification of different methods for RCPSP

Before the end of the primary timeframe, Demeulemeester and Herroelen [45] set up a procedure that is most likely to be the fastest to resolve the established RCPSP by a wide margin. The D&H method is a profundity first-inquiry branch-and-bound calculation that examines the arrangement space by disseminating at-time occurrences that encounter asset clashes. Every branch speaks to a decision to postpone the organization of the exercises, keeping in mind the final goal of deciding the current battle.

During the first period, priority rule-based booking heuristics were arranged through two noteworthy systems during the first period: “sequential” planning versus “parallel” booking. Policy needs to be addressed in a serial manner before planning (cf. [75]). In a parallel approach, however, the need for movement is addressed on—the-fly (amid booking). Numerous priority guidelines have been formulated, tried, and thought out. During the second period, much attention has been given to developing the RCPSP and progress has been made at an increasing speed. The examination described above highlights the established RCPSP, i.e., minimizing the make-up of a project network with a final-start priority relationship, fixed terms of action, and consistent accessibility of assets.

Over the last 10 years, important research efforts have been dedicated to the expansion of the existing RCPSP. One significant increase that has gained remarkable attention will be the number of modes of execution of acts. In this situation, there are choices as to how assets will be connected after some time to complete the action. In this way, the duration and the pre-requisites of the asset fluctuate with the mode of execution decision. The other real expansion is the non-regular objective of boosting the current net estimate of the venture. In this situation, the returns of undertakings are recognized at the peak of the turning points, i.e., specific exercises, and reduced to the start time of the undertaking as the net present value to be maximized.

Issues to develop a complete starting priority link to summarize the priority have been further studied [42,43,44, 47, 51], some of them, including intervention planned conditions and due dates. The Summed Priority Relationship specifies the minimum/maximum time interval from the beginning (complete) of one operation to the beginning (complete) of another activity. As far as solution procedure, improvement by branch-and-bound stayed vital. New need rules have likewise been proposed. Heuristics exploration is no longer limited to single-pass need management systems. Impressive efforts have been made towards more entangled approaches, such as multi-pass running techniques, inspecting strategies, and meta-heuristic strategies; new methods, such as constraint programming, have also been introduced. Hartmann and Kolisch [65] did a trial analysis of cutting-edge needs rule-dependent heuristics and meta-heuristics and concluded that meta-heuristics is best performed in their review and that a movement list representation, where the response is given to a logical priority rundown of all exercises, is best performed.

Taken as a whole by the most recent 4 years of RCPSP review, a few points of view are qualified to be stated here. The main point is the truth of lower bound advancements. Lower limits are critical to the speeding-up of the arrangement techniques, particularly for branch-and-bound. The second point concerns the laws of power. Predominance also assumes a key part in reducing the scope of the arrangement from a clear assessment. Cases include the left motion intensity criterion demonstrated by Schrage [104], the device cuts provided by Talbot and Patterson [113], and the cutest predominance tenet suggested by Demeulemeester and Herroelen [49]. The third point talks about the stretching/specification of truth. The primary method, the priority tree stretching strategy, relies on the assumption that any solid start schedule (and therefore additionally any ideal promising start calendar) can be accomplished by posting all exercises in a group that there is no misuse of a priority relation. This approach was initiated [92] and further enhanced [110]. The second approach, proposed by Stinson et al. [112], seeks a combination of activities.

The third strategy, suggested by Demeulemeester and Herroelen [45], involves the (non-dominated) limited deferring choices, which are a set of occupations that would be deferred to settle an asset conflict at the present time and that none of these sets contains an alternative as a subset.

The fourth scheme, presented by Igelmund and Radermacher [71], analyzes the idea of prohibited schemes, which are sets of employments that can be planned simultaneously without damaging priority relationships, but which are not feasible due to asset limitations. Despite the four plans mentioned above, there are three other methodologies discussed in Demeulemeester and Herroelen [50]: scheduling, float splitting, and limiting priority relations.

Some important theoretical work, other than formulating arrangements, has been completed. Sprecher et al. [110] gave the formal sense of the semi-dynamic, dynamic, and non-deferred plans for the RCPSP. Kolisch [81] returned to the theory of serial and parallel planning strategies in the RCPSP and provided hypothetical results on the class of timetables generated by each strategy.

Synergistic Team Formation

Expanded weight on experts to carry out their assignments with less members, quicker tempo, higher quality, and better customer response makes it necessary to work together [107]. Self-monitoring communities are generally presented as the purpose of collective development projects [88, 107]. Successful group association research, for example, has been carried out in the work of Hackman [59] and Wechsler [123]. A mix of instruments for measuring viable group collaboration is available.

The first is the Belbin Team Part and Self-Inspection Stock Thoughts [17]. The community portion, as Dr. Belbin has shown, depicts the courses in which people with special personalities and capacities contribute to the gathering. Self-Perception Inventory, on the other hand, is a request response means to help one evaluate his/her best collection part. Furnham et al. [56] evaluated the psychometric properties of this Belbin test, and suggested that the test should not produce good, in-between steady-state scores that are related in the manner proposed by the hypothesis.

The second is the Myers-Briggs Type Indicator (MBTI) (MBTI) [60]. MBTI tests the inclinations of a man using four scales: (1) extraversion/introspection, (2) sensation/natural, (3) considering/feeling, and (4) judging/seeing. Herrmann [68] also suggested the Herrmann Brain Dominance Instrument (HBDI). The HBDI theory is built in the light of Paul McLean’s Triune Brain Theory, Roger Sperry’s Left Brain/Right Brain Hypothesis, and the concept of human predominance.

The one Kolbe Model calculation, which is used as part of this research, has shown reliability, validity, and feasibility in the assessment of people’s conative qualities and is a useful tool in the creation of groups [79, 80]. The Kolbe paradigm divides the inalienable part of human identity into three parts: cognitive, affective, and conation [79]. In addition to the documents listed above, in our written survey, we select an extensive number of papers produced over the last 40 years. As we have recently said, Table 1 provides a summary of our results.

This paper examines the benefit of expanding the choice of venture and the planning issue. Expect that an arrangement of potentially profitable undertakings is accessible, yet constrained accessible assets may not allow any of them to be sought. Formal numerical models are conceived for different renditions of the issue, including those joining the third group development point of view. The structure of the issue is inspected and bits of knowledge are collected with regard to the prioritization of the venture, in particular. Despite the fact that prioritization is imperfect when all is said to be done, heuristic arrangement strategies are sought in view of prioritization, since the booking sub-issue itself is NP-hard. Initially, a deterioration heuristic system is proposed to acquire large-scale arrangements using less computational time. Enhancing heuristic disintegration-based prioritization, a verifiable identification is proposed. This calculation does not analyze all the necessities of succession, but ensures ideal necessities’ arrangement when the calculation is finished. Future research territories incorporate the recognition of the general conditions under which the prioritization of tasks would lead to an ideal arrangement. The improvement of better upper limits for the verifiable identity program is also an intrigue. The point of view of the group structure has yet to be dealt with computationally. It would also have some importance in evaluating how cooperative energy variance data could be promoted back to the earlier phases of venture determination and preparation. Exchange of benefits and cooperative community resources may also be discussed later.

Problem Depiction

In this section, we are going to give a structured picture of the problem. Going for the design of qualified arrangement calculations, we will also investigate the layout of the arrangement space and offer a few bits of information.

Model Description

In the simple dialect, we take the gander to the role of choosing, preparing, and distributing resources. We have a set of tasks to choose from a selection of open activities. We need to define limited resources to choose projects and to plan for activities to be carried out. We also need, for example, to put individuals, outline engineers, into task groups. Our aim is to expand the general benefit subject to acceptable group structures. In particular, we agree that each job has an arrival profile as a non-expanding ability of the undertaking’s output time, V(p,t), which is the estimated net present estimation of the gain recognized by project p on the off chance that it will be completed in period t. A simple case would be to set V(p,t) as a direct capacity of t. More practical benefit capacity would depend on the expected benefit of the information likely to come from an organization’s advertising office. Nonetheless, such an arrangement of the gain potential for the applicant’s activities is pre-defined and is assumed to be established. Marked down income data could also be included in this phase.

In addition, for each project, we know the organization of the tasks that should be completed, the time/resource requirements for those undertakings, and the priority needs between them. We need such data to coordinate the execution of assignments and the allocation of resources to them. Right now, we are preparing the problem. In this field, we find the tool to be a compulsory undertaking and assignment booking model with variable errand power. In the following region, we might then be able to expand the plan to join the community arrangement perspective. Initially, Askin [11] talked about integrated project determination and variable power errand planning. We accept that every assignment of an undertaking has a normal level of movement, yet the duration of the action required can be changed by shifting the measure of the associated resource. First, we proclaim the choice of variables and parameters. For the purpose of compliance, the rehashed assertion (with respect to past segments) of the choice of variables and parameters is not intentionally circumvented.

Decision variables:

  • Yp = 1 if project p is selected, 0 otherwise

  • Xpat = intensity level of project p, activity a, in period t, \( 0\le {X}_{pat}\le {X}_{pat}^{\mathrm{max}} \)

  • Spat = 1 if activity pa is ready to be started by t, 0 otherwise

  • Cpat = 1 if activity pa completes in period t, 0 otherwise

Technological coefficients and parameters:

  • n = number of candidate projects

  • fp = final task for project p

  • V(p,t) = expected profit or discounted present worth of expected profit if project p completes in period t

  • dpa = duration of activity pa at the normal activity level

  • I(pa) = set of immediate predecessor tasks for pa

  • rpak = resource k requirement for activity pa at the normal level

  • Rkt = resource k available in t

Formulation:

$$ {\displaystyle \begin{array}{c}\max \\ {}s.t.\end{array}}\kern1.50em \sum \limits_p\sum \limits_{t=1}^T{C}_{p{A}_pt}.V\left(p,t\right) $$
(1)
$$ {\displaystyle \begin{array}{l}\kern2.00em \sum \limits_{t=1}^T{C}_{pat}=T\kern0.5em \forall pa\\ {}\end{array}} $$
(2)
$$ \kern2.00em \sum \limits_t{X}_{pa t}={d}_{pa}.{Y}_p\kern0.5em \forall pat $$
(3)
$$ \kern2.00em {S}_{pat}.\left|I(pa)\right|\le \sum \limits_{\tau =1}^{t-1}\sum \limits_{p^{\prime },{a}^{\prime}\in I(p.a)}{C}_{p^{\prime }{a}^{\prime}\tau}\kern0.5em \forall pata $$
(4)
$$ \kern2.00em \sum \limits_{\tau =1}^T{X}_{pa\tau}\le {d}_{pa}.\sum \limits_{\tau =1}^T{C}_{pa\tau}\kern0.5em \forall pat $$
(5)
$$ \kern2.00em \sum \limits_{\tau =1}^T{X}_{pa t}\le {S}_{pa}.{d}_{pa t}\kern0.5em \forall pat $$
(6)
$$ \kern2.00em \sum \limits_{\tau =1}^T{r}_{pak}{X}_{pat}\le {R}_{kt}\kern0.5em \forall k,t $$
(7)
$$ \kern2.00em 0\le {X}_{pat}\le {X}_{pat}^{\mathrm{max}}\kern0.5em {X}_{pat},{C}_{pat},{Y}_p\in \left\{0,1\right\} $$
(8)

The goal, (1), is to maximize the overall benefits of finalizing the chosen ventures. Constraint (2) guarantees that all jobs of the chosen undertaking is completed. It further implements that none of the duties of an unselected undertaking is carried out. Constraints (3) and (4) deal with the relationship of priority, including the relationship of sub-projects. Constraints (5), (6), and (7) are not, to the extent possible, damaged for any kind of asset and for any period of time. Constraint (8) sets out the factors of choice.

Project Selection, VI Task Scheduling, and Team Activation

In this section, the specifics of the past chapter are changed to incorporate group similarity. We accept reliable resource accessibility for effortlessness and streamline Rkt to Rk until further notice. Let Hk be the structure of staff having a place in the human resource class k (non-human resource classes are still shown as above). Notwithstanding the past, we announce the accompanying choice of variables and parameters:

Decision variables:

  • θwpt= proportion of individual w’s time assigned to project p at time t. Note that we have

$$ \left|{H}_k\right|=\sum \limits_{w\in {H}_k}1={R}_k. $$

Additional coefficients:

  • ewαβ= 1 if worker w exhibits instinctual behavior of type β (1 = prevent, 2 = accommodate, 3 = initiate) for action mode α (1 = fact finder, 2 = patterner, 3 = quick start, 4 = Implementer); and 0 otherwise. For human resource types, we replace the corresponding resource constraints (7) by (17) and add a set of synergy constraints, (18). We then have the following PSTSTAP model.

Formulation:

$$ {\displaystyle \begin{array}{c}\max \\ {}s.t.\end{array}}{\displaystyle \begin{array}{ccc}& & \end{array}}\sum \limits_p\sum \limits_{t=1}^T{C}_{p{A}_pt}.V\left(p,t\right)\kern0.5em $$
(9)
$$ \kern1.50em \sum \limits_{t=1}^T{C}_{pat}={Y}_i{\displaystyle \begin{array}{cc}& \end{array}}\forall ij $$
(10)
$$ \kern1.50em \sum \limits_t{X}_{pat}={d}_{ij}.{Y}_i{\displaystyle \begin{array}{cc}& \forall ij\end{array}} $$
(11)
$$ \kern1.50em \sum \limits_w\sum \limits_t{\theta}_{wpt}\le 1.2.{Y}_p.W.T{\displaystyle \begin{array}{cc}& \forall p\end{array}} $$
(12)
$$ \kern1.50em {S}_{pat}.\left|I(pa)\right|\le \sum \limits_{\tau =1}^{t-1}\sum \limits_{p^{\prime },{a}^{\prime}\in I\left(p,a\right)}{C}_{p^{\prime }{a}^{\prime}\tau }{\displaystyle \begin{array}{cc}& \forall pat\end{array}}{\displaystyle \begin{array}{cc}& \end{array}} $$
(13)
$$ \kern1.50em \sum \limits_{\tau =1}^T{X}_{pa\tau}\le {d}_{pa}.\sum \limits_{\tau =1}^T{C}_{pa\tau}{\displaystyle \begin{array}{cc}& \end{array}}\forall pat $$
(14)
$$ \kern1.50em \sum \limits_{\tau =1}^t{X}_{pa t}={d}_{pa}.{S}_{pa t}{\displaystyle \begin{array}{cc}& \end{array}}\forall pat $$
(15)
$$ \kern1.50em \sum \limits_{pa}{r}_{pa k}.{X}_{pa t}\le {R}_{kt}{\displaystyle \begin{array}{cc}& \end{array}}\forall t,k\in unanimate{\displaystyle \begin{array}{cc} resource& \end{array}} $$
(16)
$$ \kern1.50em \sum \limits_a{r}_{pak}.{X}_{pat}\le \sum \limits_{p\in {H}_k}{\theta}_{wpt}{\displaystyle \begin{array}{cc}& \end{array}}\forall ptk\in human{\displaystyle \begin{array}{cc} resource& \end{array}} $$
(17)
$$ \kern1.50em 4.{N}_{\beta}^{\mathrm{min}}.\sum \limits_w{\theta}_{w pt}\le \sum \limits_{\alpha}\sum \limits_p{\theta}_{w pt}.{e}_{w\alpha \beta}\le 4.{N}_{\beta}^{\mathrm{max}}.\sum \limits_w{\theta}_{w pt}{\displaystyle \begin{array}{cc}& \forall \beta =1,2,3;p,t\end{array}} $$
(18)
$$ \kern1.50em \sum \limits_w{\theta}_{w pt}.{e}_{w\alpha \beta}\le {I}_{\alpha \beta}^{\mathrm{max}}.\sum \limits_w{\theta}_{w pt}{\displaystyle \begin{array}{cc}& \end{array}}\forall \alpha =1,2,3,4;\beta =1,2,3;p,t $$
(19)
$$ \kern1.50em \sum \limits_w{\theta}_{w pt}.{e}_{w\alpha 2}\ge {I}_{\alpha 2}^{\mathrm{min}}.\sum \limits_w{\theta}_{w pt}{\displaystyle \begin{array}{cc}& \end{array}}\forall \alpha =1,2,3,4;\beta =2;p,t $$
(20)
$$ \kern1.50em 0\le {X}_{pat}\le {X}_{pat}^{\mathrm{max}};{S}_{pat},{C}_{pat},{Y}_p\in \left\{0,1\right\} $$
(21)
$$ \kern1.50em \sum \limits_p{\theta}_{wpt}\le 1.2{\displaystyle \begin{array}{cc}& \end{array}}\forall w,t $$
(22)

The objective function (9) seeks to maximize the normal benefit of the chosen undertakings. Constraint (10) ensures that every undertaking having a chosen place of business is completed. Constraint (11) ensures that the aggregate exercise power for errands in chosen ventures is adequate for the completion of the assignment. Constraints (12), (13), and (14) assist in the application of priority relations. Constraint (15) maintains that the “permit to-start” motion for assignment is not on until every prompt antecedent has shown its fulfillment of the “flags” before t. Constraints (14) and (15) are essentially the embodiment of the execution of the assignment to take place within the time period.

Constraints (16) to (18) are, as far as possible, necessary to prohibit the use of more assets than is available at any time for any class of assets. Constraints (19) to (22) eventually enforce the containment points for assignment exercise and the binary existence of the predictor variables.

We may need to settle the exercise at a consistent level throughout the length of time of the errand. In the event that specific activities involve a particular fluctuating level of consideration from the resource classes in the course of their implementation, such assignments may be divided into sub-tasks in the description referred to above. For now, all resources within a class are deemed to be gifted/profitable. Both expenditure and productivity could be differentiated by a specific resource unit. A notable increase would be to allow the assignment span to be stochastic. This would have an effect on both the resource requirements and the revenue. We agree that the question of agreement is often decided, and thus the predicted gain is a sensible model. Asymmetries influenced by the undertaking’s completion postponements are not addressed in the current model.

Problem Structure

Two aspects of the problem are examined: one with non-preventive assignments and one with pre-emptive undertakings.

Prioritization of Projects, Fixed Intensity, Non-Preemptive

As demonstrated by the empirical findings introduced later, we have found that arranging activities actually streamlines calculations and is often appropriate when designating resources to maximize benefits. In any case, we also observed that giving full need to a solitary project at once would not generally lead to an ideal arrangement, given that assignments are not pre-emptive. We have demonstrated this result in this field.

Evidence by a counter case: Fig. 1 indicates two undertakings. The two operations include two undertakings. The number over each errand is the length of time it takes to execute the assignment. The number below is the number of resource units required (per time unit) to perform the assignment. The bolts serve for the partnership of priority. The little circles are talking to the fake begin/end errands.

Fig. 1
figure1

Project networks

In addition, we agree that the value profiles as components of project time are both directly decreasing:

$$ {\displaystyle \begin{array}{l}{profit}_A=64.\left(1-\left({t}_A-32\right).{r}_A\right)\\ {}{profit}_B=60.\left(1-\left({t}_B-28\right).10\%\right)\end{array}} $$

Note that tA(tB) refers to the time of undertaking A(B) and rA is the rate of benefit reduction per time period of delay for project A. The rate of benefit reduction for undertaking B is set at 10%. At the end of the day, we accept that there are 6 resource units accessible each time period. In order to process the maximum benefit that we can obtain, we defined every imaginable calendar and discovered the corresponding arrangement of three timetables (Fig. 2).

Fig. 2
figure2

A set of potential optimal schedules

In the meantime, we see that calendar (i) comes about because of the full need for project A. Plan (iii) is the product of the full need for project B. In any case, plan (ii) does not make either of the projects absolutely necessary. Looking at the aggregate gain acknowledged by each calendar, we have the following outcome:

$$ {\displaystyle \begin{array}{l}{profit}_i=76+128.{r}_A\\ {}{profit}_{ii}=94\\ {}{profit}_{ii i}=112-256.{r}_A\end{array}} $$

Plotting the benefit capacity against rA give us Fig. 3.

Fig. 3
figure3

Profit functions for the example

The ideal advantage, which is the upper envelope of the three straight capacities, is:

$$ {profit}^{\ast }=\left\{\begin{array}{l}112-256{r}_A\begin{array}{cc}& {r}_A\le 7.03\%\end{array}\\ {}94\begin{array}{cccc}& & & 7.03\%<{r}_A\le 14.06\%\end{array}\\ {}76+128{r}_A\begin{array}{cccc}& & {r}_A>14.06\%& \end{array}\end{array}\right.\kern0.5em $$

When rA ≤ 7.03% the schedule (iii) – giving full priority to project B, the schedule of the champions shall be as follows. When rA > 14.06% schedule (i) – gives full priority to project A, the maximum profit is achieved. However, when 7.03 %  < rA < 14.06%, it is not optimal to give full priority to any project. Description is complete.

Prioritization of Projects, Fixed Intensity, Pre-Emptive

We have shown that, under the suspicion of a non-preventive undertaking, it is not ideal, by and large, to organize projects. On the off chance that it is along these lines, we would have had the capacity to reduce the issue to a much less difficult one. In this section, we believe, first of all, that arranging undertakings are optimal when tasks are preventive. In order to demonstrate motivation, we show an example derived from the one above. Then, we are going to demonstrate the idea for an unusual case. In addition, and sadly, we find another counter case, which is that the notice is not true for the general case.

We propose that, under settled force and pre-emptive errand suspicion, it is ideal to give full need to one project at a time, given that we have identified an appropriate need for succession. Here’s the situation that sparks our imagination. We expect that we will have the same systems of enterprise as in the past segment. They also assume the same functions of profit:

$$ {\displaystyle \begin{array}{l}{profit}_A=64.\left(1-\left({t}_A-32\right).{r}_A\right)\\ {}{profit}_B=60.\left(1-\left({t}_B-7\right).10\%\right)\end{array}} $$

As before, we plan to have 6 resource units available at any time of the year. When every conceivable calendar is counted, the structure of conceivable ideal timetables is comparative, as some time recently, apart from that calendar (i) the calendar (iv) is actually superseded (Fig. 4).

Fig. 4
figure4

Set of potential optimal schedules, pre-emptive case

When we quantify the income obtained by these three schedules as rA functions, we have the following:

$$ {\displaystyle \begin{array}{l}{profit}_i=94+128.{r}_A\\ {}{profit}_{ii}=94\\ {}{profit}_{ii i}=112-256.{r}_A\end{array}} $$

Plotting the profit functions against rA, we have Fig. 5.

Fig. 5
figure5

Profit functions, pre-emptive case

The optimal profit function is then:

$$ {profit}^{\ast }=\left\{\begin{array}{l}112-256.{r}_A,{r}_A\le 4.69\%\\ {}94+128.{r}_A,{r}_A>4.69\%\end{array}\right.\kern0.5em $$

Project (ii) will never, as should be apparent, be the perfect timetable for this scenario. For any significant amount of rA (> 0), it would be optimal either to organize project A, as in (iv), or to organize project B as in (iii). The key change in this sample, instead of the previous one, is licensed to the pre-emptive undertaking assumption. This sample prompts our above speculation.

Experimental Results

This section archives the layout of the computational trials and the relative bits of knowledge collected. The main significant segment will show the test opportunity era. The second area discusses important variables with respect to the exploratory configuration. Computational results and conclusions are reported in the third segment. The last segment will wrap up with a rundown.

Problem Instance Generation

An example of a complete issue is the arrangement of project systems, in which the length of time, the need for resources, and the priority relationship are described. In addition, a capacity for benefit must be established for each undertaking. Second, the availability of services must be assessed for the incident. A complete example is shown in the accompanying segment.

Case in point, the two project structures may have a case, as shown in Fig. 6. The primary task (named “pat2”) has 7 assignments (5 in the event that a start/end assignment is avoided) and the second project (named “pat3”) has 13 assignments. All undertakings are dedicated to three forms of services. Every circle refers to a task that needs to be completed.

Fig. 6
figure6

Example project networks

The duration and the resource needed for the complex period of assignment are shown above and below each circle, separately.

Beneficiary profiles for undertakings, for example, may include the type of straight-cutting elements of the finishing time:

$$ {\displaystyle \begin{array}{l}{profit}_{pat2}={p}_2.\left(1-\left({t}_2-24\right).{r}_2\right)\\ {}{profit}_{pat3}={p}_3.\left(1-\left({t}_3-72\right).{r}_3\right)\end{array}} $$

The resource accessibility may take the accompanying structure:

$$ \left[{\mathrm{R}}_1,{\mathrm{R}}_2,{\mathrm{R}}_3\right]=\left[24,21,24\right] $$

where Ri remains in each time period for the quantity of units available for resource type i. For lack of effort, resource accessibility is thought to be appropriate in this case. On the other hand, the measurements are intended to address both non-steady and consistent resource accessibility. For one case, the potential for profit of each undertaking is naturally produced in an accompanying manner. Initially, the overall resource usage of the undertaking, TRi, is believed to be following:

$$ {TR}_p=\sum \limits_{a,k}{r}_{pa k}.{d}_{pa} $$

The most extreme gain that can be obtained by the function, pi, is then found as TRi, where a random number is drawn from the intermediate [0.5c, 1.5c], with c being a consistent parameter. Therefore, by including any irregularity in c, we are able to acquire projects of unequal benefit/resource proportion. In addition, the discriminating length of the project i, CPLi, is registered and the rate of benefit reduction is indicated as ri. In the long run, the benefit information is calculated by taking the following straight-forward diminishing function:

$$ P\left(i,t\right):= {p}_i.\left[1-\left(t-{CPL}_i\right).{r}_i\right] $$

where P(i, t) speaks of the return benefits of project i on the off chance that it will be completed in time t. Characterize resource snugness, wk, as the proportion of accessible resource, Rk, over (unrestricted) crest resource utilization, pk, if all tasks are pursued after their most timely schedules.

Experimental Design Considerations

The main element we noticed was the number of optimistic undertakings per event. We consider two levels, 10 projects for each event and 25 activities for each example. As far as resource snugness is concerned, we find two levels: 20% versus 60% (wk = 0.20 or 0.60). The third factor we are studying is the rate of benefit reduction.

We consider two levels for this component: 5% and 25%. With a 5% lowering rate, the project would become non-profitable 20 time periods after its critical path length (CPL). The complete factorial outline is shown in Table 2:

Table 2 A complete factorial design

Under the three-stage deterioration heuristic method, we definitely have three variables of choice when we collect a complete estimate for the benefit optimizing the commitment and preparation of the undertaking. Such three components are shown in Table 3.

Table 3 Factors for a complete algorithm

The rates of most variables may be increased. Case in point, we may investigate additional requirements for element 2 standards, and we may also look at a single-task planning calculation for element 3. We guided the progression of the numerical tests to assess the calculations. The aggregate profit is the basic list of executions. Two other implementation steps that may be of concern include the total number of projects selected and the use of money. The main area will be dedicated to updating the guidelines for prioritization of programs. After that, the discussion on the feasibility of multidimensional knapsack problem (MKP) should take place.

Comparison of Project Priority Rules

The main question we wish to raise is the reality of the location of the criteria of need. In this context, the investigation is incorporated in the accompanying request: (1) the measurement of the creations we used; (2) the arrangement of the information used by the undertaking; (3) the analysis of the information provided; (4) the dialogs.

Algorithm

We agree to inactivate the MKP option for the first variable. We decide to run the single-pass need principle for the third element. In this way, for every standard need, we record its execution when it is coupled with a single-pass need guideline. We can take note of the calculation as follows:

$$ \left(w/ oMKP\right)\times \left(7 rules\right)\times (MINSLK) $$

Test Instances

There are three potential configurations in the estimate. The main set originates from the Pat arrangement of 70 different undertakings, all of which have three kinds of resources. The second set of examples originates from the J30 package of practices. This project arrangement includes 400 unmistakable activities, all with 4 resource types. The third set of examples originates from the J60 package of practices. This mission structure additionally covers 400 specific projects, all with 4 resource types. These three examples can be seen as an extension of the requirement for computational power. Pat set contains 10 tasks per scenario. The J30 set the higher bar to be 25 projects for each example. By comparison to the J30 package, each project in the J60 set contains twice the number of assignments.

Trial Runs

In synopsis, we run the information set out in Table 4 for every need. Quality advantages and CPU times are added by each package.

Table 4 Experimental design for comparing project priority rules

The list of priority rules and profit data for the Pat Set are presented in Tables 5 and 6. The normal benefit for each information cell is recorded in Table 7. In contrast to the benchmark standard, the benefit rate is also recorded as the normal benefit achieved by any requirement principle (rule 7). Such gain levels are shown in Fig. 7.

Table 5 List of priority rules
Table 6 Profit data of pat set
Table 7 Average profit per cell (pat set)
Fig. 7
figure7

Profit percentage for pat set

From the benefit percentage statistic, we can see that rules 1, 3, and 5 of the three “top” guidelines are clearly superior to the subjective need concept. These are the “absolute gain,” the “minimum cost,” and the “total benefit/price” rules, individually. It seems that the eager “full value” theory has the best effect. We trust that the concept of “full advantage” is working well in the light of our belief that the gain of an undertaking should be strongly linked to its use of resources. We trust that this presumption is substantial in all and that we have produced information on our benefits as indicated by it. The third effective standard, “max benefit/resource,” performs sensibly well throughout the distinctive information cells. Standard improvements to the subjective guideline are 38.7%, 27.9%, and 21.2% separately.

Compared with Other Methods of Solving the Problem

In this section, the performance of the proposed algorithm for solving the RCPSP problem is compared with the best meta-heuristic methods presented for this problem using the examples available in the project scheduling problem library (PSPLIB) [83]. The number of issues per set of problems in PSPLIB is given in Table 8. This set contains problems with 10, 14, 18, 20, 30, and 40 non-virtual activities, in which there are 3 implementation methods for each activity. Performing each activity in any way requires values of 2 non-renewable and 2 non-renewable. The time of each activity in each method is a number between 1 and 10. For problems more than 30 activities, only the best answers are available with heuristic methods. So this set of problems is not used. In order to compare the proposed algorithm with other methods, the number of generated solutions was first considered, so programming was done with Matlab software. Program inputs include project components and resources and time required to execute them, and outputs are scheduling and overall project cost from different paths. Therefore, the problem dimensions actually consist of a matrix containing all project activities and resources and time required for them, and objective function 9 and constraints 10 to 22 should also be considered as important equations within the mathematical structure of the problem and related coding.

Table 8 Number of issues per set of problems in PSPLIB

Then, by comparing the solution time of the program written with C ++, we came to the conclusion that Matlab loses its competitiveness by the time criterion. So for the purpose of comparing time, the program code was translated to C ++. Comparison of the performance of the proposed algorithm with other algorithms, for PSPLIB problems with known optimal solutions, based on the number of solutions produced and the solution time are presented in Tables 9 and 10, respectively. In these tables, the mean deviation from optimal response to percentage (ADO) and percentage of optimum response (POF) in each example set is reported for each method.

Table 9 Comparison of the results of the proposed algorithm with other methods based on 10,000 generated answers
Table 10 Comparison of the results of the proposed algorithm with other methods based on 0.10 s per activity

In Table 9, the performance of the proposed algorithm with Van Peteghem and Vanhoucke [119], Lova et al. [86], Geiger [57], and Van Den Eeckhout et al. [118] genetic algorithms, Ranjbar et al. [96], Roghanian et al. [100], and Chakrabortty et al. [29] sparse search, and Józefowska et al. [74], Xu et al. [125], and Altintas and Azizoglu [5] simulated annealing are compared based on the 10,000 generated results. That is, for each set of problems, the operation is stopped after producing 10,000 answers and the best answer is obtained until that moment is reported as the answer to the problem. As the results show, in the problems with 10 and 14 activities, the proposed algorithm is ranked second with a slight difference, but it has the best performance for the problems with 18 and 20 activities.

In Table 10, the performance of the proposed solution method compared with the proposed algorithms of Jarboui et al. [72], Damak et al. [37], Muritiba et al. [89], and Lemos et al. [84] based on 0.10 s solution time per activity. That is, for each problem group of size n, the operation is stopped after the 0.10 × n second and the best response is obtained until that moment is reported as the answer to the problem.

Discussion

So far, various methods have been proposed to solve the project scheduling problem with limited resources and multi-modal activities (i.e., the possibility of selecting different execution methods for the activities), most of which result from the development of the proposed method for the single-mode implementation. However, none of these methods can be used to solve big problems because they are not able to find the optimal solution in a reasonable amount of time. In this paper, an integrated method for solving the model is presented and the problem is divided into two sub-issues: determining the execution method of each activity and then finding the best timing of activities to minimize project time.

The covetous theory of “full gain” appears and works best. The other two common principles are the “greatest resource” concept and the “most extreme gain per resource unit” rule. The “full prof/res” rule is usually applied decently by all accounts under any circumstances. As far as the “max resource” rule is concerned, we trust that it will be a good way to manage the length of the gain that is clearly related to the use of resources. We are generating our test examples on the basis of this hypothesis, and we trust that this is a reasonable assumption.

For activities that increase a number of resources but do not expect that would be particularly advantageous, they should not, in any case, be inserted into the hopeful pool, unless another thought overwhelms the benefit-enhancing goal. Non-orderly computational examination shows that the verifiable identification of single-task booking calculation is computational extravagant but does not indicate much change in benefits. Since the branch-and-bound calculation is extremely time-intensive, it is possible to use the finding of the past section that says that MKP will minimize the applicant’s risk pool measure precisely in some situations. Also, we performed the progress of the calculation examinations. The discovery of the three key need criteria is a significant result. The description of the main stage of the MKP does not seem to work admirably, at any pace, if the concept of decent need is applied. Nonetheless, it may serve as a stand-alone option guide for undertaking screening before considering task plans. The implicit enumeration (IE) algorithm for a single-task planning calculation does not reveal much promise either.

Future research regions shall include the following points:

  1. 1.

    It would be an excitement to investigate whether prioritization is ideal for changing the variable force of our problem.

  2. 2.

    We may need to tackle two separate renditions of the question of venture determination and undertaking scheduling: another with variable control and the other with set intensity and pre-emptive assignments. It is enticing to construct exceptional calculations in order to find the ideal answer for the two forms.

  3. 3.

    The imperative of future research is to report a tighter upper bound (than the definition of LP-relaxation) for the ideal gain.

  4. 4.

    The dimension of the group structure has yet to be dealt with computationally. It would also be of any significance to understand how cooperative energy deviation data could be used in the pre-project collection and planning processes.

References

  1. 1.

    Agrawal S, Singh RK, Murtaza Q (2016) Prioritizing critical success factors for reverse logistics implementation using fuzzy-TOPSIS methodology. J Ind Eng Int 12:15–27

    Google Scholar 

  2. 2.

    Alcaraz J, Maroto C (2001) A robust genetic algorithm for resource allocation in project scheduling. Ann Oper Res 102:83–109

    Google Scholar 

  3. 3.

    Alcaraz J, Maroto C, Ruiz R (2003) Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. J Oper Res Soc 54:614–626

    Google Scholar 

  4. 4.

    Alham MH, Elshahed M, Ibrahim DK, El Zahab EEDA (2017) Optimal operation of power system incorporating wind energy with demand side management. Ain Shams Eng J. https://doi.org/10.1016/j.asej.2015.07.004

  5. 5.

    Altintas C, Azizoglu M (2020) A resource constrained project scheduling problem with multi-modes. Int J Inf Technol Proj Manag 11:55–70

    Google Scholar 

  6. 6.

    Alzraiee H, Zayed T, Moselhi O (2015) Dynamic planning of construction activities using hybrid simulation. Autom Constr B 49:176–192. https://doi.org/10.1016/j.autcon.2014.08.011

    Article  Google Scholar 

  7. 7.

    Amans P, Mazars-Chapelon A, Villesèque-Dubus F (2015) Budgeting in institutional complexity: the case of performing arts organizations. Manag Account Res 27:47–66. https://doi.org/10.1016/j.mar.2015.03.001

    Article  Google Scholar 

  8. 8.

    Andor G, Mohanty SK, Toth T (2015) Capital budgeting practices: a survey of Central and Eastern European firms. Emerg Mark Rev 23:148–172. https://doi.org/10.1016/j.ememar.2015.04.002

    Article  Google Scholar 

  9. 9.

    Ardenghi JI, Vazquez GE, Brignole NB (2015) Parallel optimization by means of a Spectral-Projected-Gradient approach. Comput Chem Eng 81:344–354. https://doi.org/10.1016/j.compchemeng.2015.04.010

    Article  Google Scholar 

  10. 10.

    Arrow KJ, Lind RC (2014) Uncertainty and the evaluation of public investment decisions. J Nat Resour Policy Res 6:29–44

    Google Scholar 

  11. 11.

    Askin RG (2003) Multiproject Selection and Scheduling with Capacitated, Renewable Resources. In: Proceedings of the Industrial Engineering Research Conference, Portland, OR

  12. 12.

    Bai A et al (2016) Social and economic possibilities for the energy utilization of fitomass in the valley of the river Hernád. Renew Energy 85:777–789. https://doi.org/10.1016/j.renene.2015.06.069

    Article  Google Scholar 

  13. 13.

    Balas E (1968) Project scheduling with resource constraints. DTIC Document

  14. 14.

    Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17:941–957

    Google Scholar 

  15. 15.

    Barbosa J, Leitão P, Adam E, Trentesaux D (2015) Dynamic self-organization in holonic multi-agent manufacturing systems: the ADACOR evolution. Comput Ind 66:99–111. https://doi.org/10.1016/j.compind.2014.10.011

    Article  Google Scholar 

  16. 16.

    Baumann T, Harfst S, Swanger A, Bayer D, Cell A, Boswell W (2015) Managing successful project teams in a diverse stakeholder environment: merging industry best practices with an education system to address critical human factors procedia. Soc Behav Sci 194:20–32. https://doi.org/10.1016/j.sbspro.2015.06.140

    Article  Google Scholar 

  17. 17.

    Belbin RM (1975) Management teams: why they succeed or fail. Willey, New York

  18. 18.

    Berre D, Vayssières J, Boussemart J-P, Leleu H, Tillard E, Lecomte P (2015) A methodology to explore the determinants of eco-efficiency by combining an agronomic whole-farm simulation model and efficient frontier. Environ Model Softw 71:46–59. https://doi.org/10.1016/j.envsoft.2015.05.008

    Article  Google Scholar 

  19. 19.

    Beşikci U, Bilge Ü, Ulusoy G (2015) Multi-mode resource constrained multi-project scheduling and resource portfolio problem. Eur J Oper Res 240:22–31

    Google Scholar 

  20. 20.

    Bhanot N, Rao PV, Deshmukh SG (2015) Enablers and barriers of sustainable manufacturing: results from a survey of researchers and industry professionals. Procedia CIRP 29:562–567. https://doi.org/10.1016/j.procir.2015.01.036

    Article  Google Scholar 

  21. 21.

    Bilolikar VS, Jain K, Sharma M (2016) An adaptive crossover genetic algorithm with simulated annealing for multi mode resource constrained project scheduling with discounted cash flows. Int J Oper Res 25:28–46

    Google Scholar 

  22. 22.

    Bochenina K, Butakov N, Boukhanovsky A (2016) Static scheduling of multiple workflows with soft deadlines in non-dedicated heterogeneous environments. Futur Gener Comput Syst. https://doi.org/10.1016/j.future.2015.08.009

  23. 23.

    Böttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Manag Sci 45:543–559

    Google Scholar 

  24. 24.

    Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Oper Res 149:268–281

    Google Scholar 

  25. 25.

    Brucker P, Knust S (2003) Lower bounds for resource-constrained project scheduling problems. Eur J Oper Res 149:302–313

    Google Scholar 

  26. 26.

    Brucker P, Knust S, Schoo A, Thiele O (1998) A branch and bound algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 107:272–288

    Google Scholar 

  27. 27.

    Calantone R, Benedetto CD (2000) Performance and time to market: accelerating cycle time with overlapping stages. IEEE Trans Eng Manag 47:232–244

    Google Scholar 

  28. 28.

    Chakrabortty RK, Sarker RA, Essam DL (2016) Multi-mode resource constrained project scheduling under resource disruptions. Comput Chem Eng 88:13–29

    Google Scholar 

  29. 29.

    Chakrabortty RK, Abbasi A, Ryan MJ (2020) Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic. Int Trans Oper Res 27:138–167

    Google Scholar 

  30. 30.

    Chen W-N, Zhang J (2013) Ant colony optimization for software project scheduling and staffing with an event-based scheduler. IEEE Trans Softw Eng 39:1–17

    Google Scholar 

  31. 31.

    Chen R, Sun H, Guo Q, Jin H, Wu W, Zhang B (2015) Profit-seeking energy-intensive enterprises participating in power system scheduling: model and mechanism. Appl Energy 158:263–274. https://doi.org/10.1016/j.apenergy.2015.08.018

    Article  Google Scholar 

  32. 32.

    Cherchi C, Badruzzaman M, Oppenheimer J, Bros CM, Jacangelo JG (2015) Energy and water quality management systems for water utility's operations: a review. J Environ Manag 153:108–120. https://doi.org/10.1016/j.jenvman.2015.01.051

    Article  Google Scholar 

  33. 33.

    Chiu W-C, Peña JI, Wang C-W (2015) Industry characteristics and financial risk contagion. J Bank Financ 50:411–427. https://doi.org/10.1016/j.jbankfin.2014.04.003

    Article  Google Scholar 

  34. 34.

    Choi B-C, Park M-J (2015) A continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs. Eur J Oper Res 244:748–752. https://doi.org/10.1016/j.ejor.2015.02.022

    Article  Google Scholar 

  35. 35.

    Clark KB, Chew B, Fujimoto T (1987) Product development in the world auto industry. Brook Pap Econ Act 3:729–771

    Google Scholar 

  36. 36.

    Cohen M, Eliashberg J, TH H (1996) New product development: the performance and time-to-market tradeoff. Manag Sci 42:173–186

    Google Scholar 

  37. 37.

    Damak N, Jarboui B, Siarry P, Loukil T (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36:2653–2659

    Google Scholar 

  38. 38.

    Datar S, Jordan C, Kekre S, Rajiv S, Srinivasan K (1997) New product development structures and time-to-market. Manag Sci 43:452–464

    Google Scholar 

  39. 39.

    Davis EW (1973) Project scheduling under resource constraints: historical review and categorisation of procedures. AIIE Trans 5:297–313

    Google Scholar 

  40. 40.

    Davis EW, Heidorn GE (1971) An algorithm for optimal project scheduling under multiple resource constraints. Manag Sci 17:B-803–B-816

    Google Scholar 

  41. 41.

    De Reyck B, Demeulemeester E, Herroelen W (1998) Local search methods for the discrete time/resource trade-off problem in project networks. Naval Research Logistics (NRL), 45(6):553–578

  42. 42.

    De Reyck B (1998) A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur J Oper Res 111:152–174

    Google Scholar 

  43. 43.

    De Reyck B, Herroelen W (1998) An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Comput Oper Res 25:1–17

    Google Scholar 

  44. 44.

    De Reyck B, Herroelen W (1999) The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur J Oper Res 119:538–556

    Google Scholar 

  45. 45.

    Demeulemeester E, Herroelen W (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag Sci 38:1803–1818

    Google Scholar 

  46. 46.

    Demeulemeester EL, Herroelen WS (1996) An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. Eur J Oper Res 90:334–348

    Google Scholar 

  47. 47.

    Demeulemeester EL, Herroelen WS (1997) A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Oper Res 45:201–212

    Google Scholar 

  48. 48.

    Demeulemeester E, Herroelen W (2000) The discrete time/resource trade-off problem in project networks: a branch-and-bound approach. IIE Trans 32:1059–1069

    Google Scholar 

  49. 49.

    Demeulemeester EL, Herroelen WS (2002) Project scheduling: a research handbook. Kluwer Academic Publishers, New York

  50. 50.

    Demeulemeester EL, Herroelen WS (2006) Project scheduling: a research handbook, vol 49. Springer Science & Business Media, Berlin

  51. 51.

    Dorndorf U, Pesch E, Phan-Huy T (2000) A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Manag Sci 46:1365–1384

    Google Scholar 

  52. 52.

    Drexl A, Gruenewald J (1993) Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans 25:74–81

    Google Scholar 

  53. 53.

    Erenguc SS, Ahn T, Conway DG (2001) The resource constrained project scheduling problem with multiple crashable modes: an exact solution method. Nav Res Logist 48:107–127

    Google Scholar 

  54. 54.

    Fang C, Kolisch R, Wang L, Mu C (2015) An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem. Flex Serv Manuf J 27:585–605

    Google Scholar 

  55. 55.

    Franck B, Neumann K, Schwindt C (2001) Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR-Spektrum 23:297–324

    Google Scholar 

  56. 56.

    Furnham A, Steele H, Pendleton D (1993) A psychometric assessment of the Belbin team-role self-perception inventory. J Occup Organ Psychol 66:245–257

    Google Scholar 

  57. 57.

    Geiger MJ (2017) A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. Eur J Oper Res 256:729–741

    Google Scholar 

  58. 58.

    Goto H, Yokoyama H (2015) Minimization of the makespan a project in the critical chain project management framework using a max-plus linear representation. In: Industrial Engineering and Engineering Management (IEEM), 2015 IEEE International Conference on, IEEE, pp 234–238

  59. 59.

    Hackman JR (1986) The psychology of self-management in organizations. American Psychological Association, Washington, D.C.

  60. 60.

    Hammer AL (1996) MBTI applications: a decade of research on the Myers-Briggs type Indicator. Consulting Psychologists Press, San Jose

  61. 61.

    Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Nav Res Logist 45:733–750

    Google Scholar 

  62. 62.

    Hartmann S (2001) Project scheduling with multiple modes: a genetic algorithm. Ann Oper Res 102:111–135

    Google Scholar 

  63. 63.

    Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Nav Res Logist 49:433–448

    Google Scholar 

  64. 64.

    Hartmann S, Drexl A (1998) Project scheduling with multiple modes: a comparison of exact algorithms. Networks 32:283–297

    Google Scholar 

  65. 65.

    Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127:394–407

    Google Scholar 

  66. 66.

    Heilmann R (2001) Resource–constrained project scheduling: a heuristic for the multi–mode case. OR-Spektrum 23:335–357

    Google Scholar 

  67. 67.

    Heilmann R (2003) A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. Eur J Oper Res 144:348–365

    Google Scholar 

  68. 68.

    Herrmann N (1991) The creative brain. J Creat Behav 25:275–295

    Google Scholar 

  69. 69.

    Herroelen W (1972) Resource constrained project scheduling-the state of the art. Oper Res Q 23:261–275

    Google Scholar 

  70. 70.

    Icmeli O, Erenguc SS (1996) A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Manag Sci 42:1395–1408

    Google Scholar 

  71. 71.

    Igelmund G, Radermacher FJ (1983) Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13:1–28

    Google Scholar 

  72. 72.

    Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comput 195:299–308

    Google Scholar 

  73. 73.

    Javanmard H, Koraeizadeh A-W (2016) Optimizing the preventive maintenance scheduling by genetic algorithm based on cost and reliability in National Iranian Drilling Company. J Ind Eng Int 12:509–516

    Google Scholar 

  74. 74.

    Józefowska J, Mika M, Różycki R, Waligóra G, Węglarz J (2001) Simulated annealing for multi-mode resource-constrained project scheduling. Ann Oper Res 102:137–155

    Google Scholar 

  75. 75.

    Kelley JE (1963) The critical-path method: resources planning and scheduling. Ind Sched 13:347–365

    Google Scholar 

  76. 76.

    Klein R (2000) Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur J Oper Res 127:619–638

    Google Scholar 

  77. 77.

    Klein R, Scholl A (2000) PROGRESS: optimally solving the generalized resource-constrained project scheduling problem. Math Meth Oper Res 52:467–488

    Google Scholar 

  78. 78.

    Knotts G, Dror M, Hartman BC (2000) Agent-based project scheduling. IIE Trans 32:387–401

    Google Scholar 

  79. 79.

    Kolbe K (2004) Pure instinct. Kolbe Corp, Phoenix. https://books.google.com/books?id=t9cCXZ-BvDwC&lpg=PP13&ots=frLHnFfxm&dq=Pure%20instinct&lr&pg=PA1#v=onepage&q=Pure%20instinct&f=false

  80. 80.

    Kolisch R (1996a) Efficient priority rules for the resource-constrained project scheduling problem. J Oper Manag 14:179–192

    Google Scholar 

  81. 81.

    Kolisch R (1996b) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90:320–333

    Google Scholar 

  82. 82.

    Kolisch R, Drexl A (1997) Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans 29:987–999

    Google Scholar 

  83. 83.

    Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur J Oper Res 96:205–216

    Google Scholar 

  84. 84.

    Lemos FK, Cherri AC, de Araujo SA (2020) The cutting stock problem with multiple manufacturing modes applied to a construction industry. Int J Prod Res:1–19

  85. 85.

    Leyman P, Vanhoucke M (2017) Capital-and resource-constrained project scheduling with net present value optimization. Eur J Oper Res 256:757–776

    Google Scholar 

  86. 86.

    Lova A, Tormos P, Cervantes M, Barber F (2009) An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int J Prod Econ 117:302–316

    Google Scholar 

  87. 87.

    Masmoudi M, HaïT A (2013) Project scheduling under uncertainty using fuzzy modelling and solving techniques. Eng Appl Artif Intell 26:135–149

    Google Scholar 

  88. 88.

    Mohrman SA, Cohen SG, Mohrman AMJ (1995) Designing team-based organizations. Jossey-Bass Publishers, San Fransisco

    Google Scholar 

  89. 89.

    Muritiba AEF, Rodrigues CD, da Costa FA (2018) A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem. Comput Oper Res 92:145–154

    Google Scholar 

  90. 90.

    Musselwhile WC (1990) Time-based innovation: the new competitive advantage. Train Dev J 44(1):53–57

  91. 91.

    Neumann K, Zimmermann J (2000) Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. Eur J Oper Res 127:425–443

    Google Scholar 

  92. 92.

    Patterson JH (1984) A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Manag Sci 30:854–867

    Google Scholar 

  93. 93.

    Petković D (2015) Adaptive neuro-fuzzy optimization of the net present value and internal rate of return of a wind farm project under wake effect. J CENTRUM Cathedra Bus Econ Res J 8:11–28

    Google Scholar 

  94. 94.

    Qureshi SM, Kang C (2015) Analysing the organizational factors of project complexity using structural equation modelling. Int J Proj Manag 33:165–176

    Google Scholar 

  95. 95.

    Rabieh M, Soukhakian MA, Shirazi ANM (2016) Two models of inventory control with supplier selection in case of multiple sourcing: a case of Isfahan Steel Company. J Ind Eng Int 12:243–254

    Google Scholar 

  96. 96.

    Ranjbar M, De Reyck B, Kianfar F (2009) A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. Eur J Oper Res 193:35–48

    Google Scholar 

  97. 97.

    Ranjbar M, Khalilzadeh M, Kianfar F, Etminani K (2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62:264–270

    Google Scholar 

  98. 98.

    Rathi R, Khanduja D, Sharma SK (2016) Efficacy of fuzzy MADM approach in Six Sigma analysis phase in automotive sector. J Ind Eng Int 12(3):377–387

  99. 99.

    Robinson WT, Fornell C (1985) Sources of market pioneer advantages in consumer goods industries. J Mark Res 13(1):107–116

  100. 100.

    Roghanian E, Alipour M, Rezaei M (2018) An improved fuzzy critical chain approach in order to face uncertainty in project scheduling. Int J Constr Manag 18:1–13

    Google Scholar 

  101. 101.

    Schirmer A (2000) Case-based reasoning and improved adaptive search for project scheduling. Nav Res Logist 47:201–222

    Google Scholar 

  102. 102.

    Schirmer A (2001) Resource-constrained project scheduling: an evaluation of adaptive control schemes for parameterized sampling heuristics. Int J Prod Res 39:1343–1365

    Google Scholar 

  103. 103.

    Schnell A, Hartl RF (2016) On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations. Oper Res Spectr 38:283–303

    Google Scholar 

  104. 104.

    Schrage L (1970) Solving resource-constrained network problems by implicit enumeration - nonpreemptive case. Oper Res 18:263–275

    Google Scholar 

  105. 105.

    Schrage L (1972) Solving resource-constrained network problems by implicit enumeration—preemptive case. Oper Res 20:668–677

    Google Scholar 

  106. 106.

    Shahriari M (2016) Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm. J Ind Eng Int 12:159–169

    Google Scholar 

  107. 107.

    Slem C, Levi D (1995) Team work in research and development organizations: the characteristics of successful teams. Int J Ind Ergon 16:29–42

    Google Scholar 

  108. 108.

    Sprecher A (2000) Scheduling resource-constrained projects competitively at modest memory requirements. Manag Sci 46:710–723

    Google Scholar 

  109. 109.

    Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Oper Res 107:431–450

    Google Scholar 

  110. 110.

    Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94–102

    Google Scholar 

  111. 111.

    Sprecher A, Hartmann S, Drexl A (1997) An exact algorithm for project scheduling with multiple modes. OR-Spektrum 19:195–203

    Google Scholar 

  112. 112.

    Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource–constrained scheduling using branch and bound. AIIE Trans 10:252–259

    Google Scholar 

  113. 113.

    Talbot FB, Patterson JH (1978) An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Manag Sci 24:1163–1174

    Google Scholar 

  114. 114.

    Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102:65–81

    Google Scholar 

  115. 115.

    Tormos P, Lova A (2003) An efficient multi-pass heuristic for project scheduling with constrained resources. Int J Prod Res 41:1071–1086

    Google Scholar 

  116. 116.

    Ulusoy G, Sivrikaya-Şerifoğlu F, Şahin Ş (2001) Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Ann Oper Res 102:237–261

    Google Scholar 

  117. 117.

    Urban GL, Carter T, Gaskin S, Mucha Z (1986) Market share rewards to pioneering brands: an empirical analysis and strategic implications. Manag Sci 32:645–659

    Google Scholar 

  118. 118.

    Van Den Eeckhout M, Maenhout B, Vanhoucke M (2019) A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints. Comput Oper Res 101:144–161

    Google Scholar 

  119. 119.

    Van Peteghem V, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409–418

    Google Scholar 

  120. 120.

    Vanhoucke M, Demeulemeester E, Herroelen W (2001a) An exact procedure for the resource-constrained weighted earliness–tardiness project scheduling problem. Ann Oper Res 102:179–196

    Google Scholar 

  121. 121.

    Vanhoucke M, Demeulemeester E, Herroelen W (2001b) On maximizing the net present value of a project under renewable resource constraints. Manag Sci 47:1113–1121

    Google Scholar 

  122. 122.

    Vommi VB, Kakollu SR (2017) A simple approach to multiple attribute decision making using loss functions. J Ind Eng Int 13(1):107–116

  123. 123.

    Wechsler D (1997) Cognitive, conative, and non-intellective intelligence (1950). In: Notterman JM (Ed.), The evolution of psychology: Fifty years of the American Psychologist. American Psychological Association, Washington, DC, pp 22–32

  124. 124.

    Xu J, Zheng H, Zeng Z, Wu S, Shen M (2012) Discrete time–cost–environment trade-off problem for large-scale construction systems with multiple modes under fuzzy uncertainty and its application to Jinping-II Hydroelectric Project. Int J Proj Manag 30:950–966

    Google Scholar 

  125. 125.

    Xu M, Ouyang M, Mao Z, Xu X (2019) Improving repair sequence scheduling methods for postdisaster critical infrastructure systems. Comput Aided Civ Infrastruct Eng 34:506–522

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Abdollah Arasteh.

Ethics declarations

Conflict of Interest

The author declares that there is no conflict of interest.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Arasteh, A. Considering Project Management Activities for Engineering Design Groups. SN Oper. Res. Forum 1, 30 (2020). https://doi.org/10.1007/s43069-020-00037-w

Download citation

Keywords

  • Project management
  • Project selection
  • Design groups
  • Scheduling