Scientific Programming

Scientific Programming / 2020 / Article

Research Article | Open Access

Volume 2020 |Article ID 2742437 | https://doi.org/10.1155/2020/2742437

Song Zhang, "Selection of Multimode Resource-Constrained Project Scheduling Scheme Based on DEA Method", Scientific Programming, vol. 2020, Article ID 2742437, 7 pages, 2020. https://doi.org/10.1155/2020/2742437

Selection of Multimode Resource-Constrained Project Scheduling Scheme Based on DEA Method

Academic Editor: Cristian Mateos
Received06 Oct 2019
Revised22 Mar 2020
Accepted31 Jul 2020
Published28 Aug 2020

Abstract

A multimode resource-constrained project scheduling problem (MRCPSP) may have multifeasible solutions, due to its nature of targeting multiobjectives. Given the NP-hard MRCPSP and intricate multiobjective algorithms, finding the optimized result among those solutions seems impossible. This paper adopts data envelopment analysis (DEA) to evaluate a series of solutions of an MRCPSP and to find an appropriate choice in an objective way. Our approach is applied to a typical MRCPSP in practice, and the results validate that DEA is an effective and objective method for MRCPSP solution selection.

1. Introduction

Resource-constrained project scheduling problem (RCPSP) has been intensively studied since the 1960s and a standard model for RCPSP has been widely accepted to fulfill scheduling tasks. Despite its preeminence, standard RCPSP can hardly cover all practical situations and many effective extensions have been proposed. Multimode RCPSP (MRCPSP) is one of them. It was first developed by Elmaghraby [1], and it allows multialternative modes that an activity can choose, providing different combinations of resources and durations.

Most of the previous studies focused on solutions to MRCPSP. As Brucker [2] summarized, those algorithms fell into three categories: exact algorithms, heuristics algorithms, and metaheuristic algorithms. Kolisch and Drexl [3], however, proved that whether MRCPSP has a feasible solution is an NP-hard problem when two or more renewable resources and infinite unrenewable ones coexist.

Schnell and Hartl [4] proposed new exact approaches to the MRCPSP with generalized precedence relations. They implemented the optimization framework SCIP which contained two constraint handlers “cumulativemm” and “gprecedencemm” and formulated SCIP models for the MRCPSP. Their solution obtained the outperform results especially on 50 activities when imposing time limits of 27s. Some new metaheuristics have also emerged recently including hybridization of genetic algorithm and fully informed particle swarm [5]; a column generation based distributed scheduling algorithm [6]; a hybrid optimization method which consists of a novel heuristic and unique genetic optimization algorithm for large-scale projects [7]; and an effective mirror-based genetic algorithm [8]. In terms of MRCPSP model extension, some scholars have considered renewable resource vacation and activity splitting [9]. Nemati-Lafmejani et al. [10] proposed an integrated biobjective optimization model to deal with MRCPSP and contractor selection (CS) problem, simultaneously. Hill et al. [11] proposed a reformulation of the waterway ship scheduling problem as a variant of the MRCPSP, which incorporates time-dependent resource capacities besides the earliest and latest start times for the tasks. This problem was solved through integer programming, using a compact mathematical formulation.

Typically, project scheduling achieves ultimate goals in three perspectives: duration, cost, and quality. These multiobjectives make the already complex MRCPSP even harder [12]. Researchers have sought different ways to solve it. Some scholars considered two targets: cost and duration [13]; some tried to maximize net present value and minimize duration [14]; others took all the three (duration, cost, and quality) as objectives to optimize [15].

In practice, duration is usually the most predominant goal of a project, and the priorities of resource, cost, and quality vary with different project executors. Multisolutions to an MRCPSP with different optimized goals may be available and how to evaluate each of them in a subjective way becomes a problem.

Here is a typical scenario. A project manager proposed a number of solutions to a project scheduling, and all their durations met the company’s strategic requirements. Other managers, however, imposed their respective emphases and filed different proposals. For example, CFO focused on capital investment, CHO considered resources, and CMO predicted the quality that would impact the company’s profile. Since all of the solutions were reasonable and feasible, the dilemma that CEO faced then was to evaluate them in an objective and convincible way and make decisions thereafter.

As a matter of fact, the project selection is critical and intricate due to availability of numerous projects, as well as existence of various qualitative and quantitative criteria. The decision-making can involve the enterprise in a long-term commitment. While various methods of project selection have been proposed in the literature, Naldi et al. [16] focus on the profit-fairness trade-off, they adopt a knapsack-type integer linear programming formulation to optimize both quality indicators of budget allocation, employing a fairly wide selection of fairness measures. Liu et al. [17] proposed a novel multiattribute decision-making method based on spherical fuzzy sets for selecting Yunnan Baiyao’s R&D project of toothpastes. However, although the methods mentioned above are effective, they are all targeted at specific types of project selection, which are also complicated and require a lot of information processing in advance.

Furthermore, the most notable among these methods is data envelopment analysis (DEA). DEA is a nonparametric method to measure productive efficiency of decision-making units (DMUs) that involve multi-inputs and multioutputs. This method was first proposed by Charnes et al. [18] in 1978 but rooted in the studies by Debreu [19], Koopmans [20], and Farrell [21] on the measurement of productive efficiency. Thanks to its expertise at performance evaluation, this method has taken great leaps both in theory and in practice. Researchers have applied DEA models to address transportation systems, health care, resource allocation, energy and environmental economics, and regional and national sustainability issues as well as those related to supply chain. Recent overviews of DEA can be found in Mahmoudi et al. [22], Kohl et al. [23], Yang et al. [24], Mardani et al. [25], Zhou et al. [26], Soheilirad et al. [27], Cook and Seiford [28], and Liu et al. [29].

Hitherto, DEA has been applied to solution selections for construction projects [30], and Research and Development (R&D) proposals [31], information project [32, 33], and Six Sigma project [34]. Although, it objectively selected the most efficient projects even under the influences of the executor’s subjective instincts and opinions, there has been little discussion on how to evaluate and select solutions from MRCPSP. There are two major differences. Firstly, the project selection problem deals with opting a set of best feasible proposals from a large pool of projects with making the best use of available resources, while the MRCPSP solution selection is to evaluate different solutions from the same project. Secondly, each project uses different resources and produces various outputs while the latter utilizes the same set of available but limited resources and focuses on the time, cost, quality involved in project management. Our attempt of applying DEA to MRCPSP is to evaluate advantages and disadvantages between multifeasible solutions, providing a solid reference to the decision-maker.

This paper is to investigate the selection of MRCPSP solutions. We adopt data envelopment analysis (DEA) to evaluate available solutions. The contribution of this paper is mainly reflected in two aspects. One is to deepen the application research of MRCPSP and discuss the solution selection from the perspective of relative efficiency. Second, it extends the application field of DEA and the proposed DEA approach could be applied to MRCPSP. Moreover, it provides a new perspective and useful tool for project managers to objectively evaluate a set of similar solutions in an MRCPSP.

The remainder of the paper is organized as follows. Section 2 presents a description of MRCPSP using a virtual case and the solutions of MRCPSP are presented. Section 3 introduces the solution methodology, DEA, designed to solve the problem and computational results are presented and discussed. Finally, conclusions are shown in Section 4.

2. Problem Description and Its Solutions

Suppose there is a project composed of 20 activities, including two dummy ones: the “beginning” and the “termination.” Its activity-on-node (AON) network is depicted in Figure 1. Each activity could run in one of the two modes, the normal and the speedy; the two modes cost differently and lead to different qualities. All the activities could allocate three renewable resources, and their respective totals are 12, 13, and 12. The parameters of the project are listed in Table 1.


TaskDuration (d)Cost (yuan)QualityResource
No.Speedy modeNormal modeSpeedy modeNormal modeSpeedy modeNormal modeR 1R 2R 3

0000000121312
169100110053914620.650.95400
25689119303848740.760.911000
364971893171347790.480.91003
454591330689520.860.91300
52944924484920.490.92060
66984119259844220.550.91007
768881892761343070.50.89080
849591326285000.471600
97494139445985230.620.89001
1066851892431339880.760.86050
11346988057440870.540.91070
12395994600661780.660.92003
13245620480131300.660.89080
14395990847632870.850.89300
15143320458129040.640.88005
16395990825630610.550.89008
17152620436126780.660.88007
18547478571537490.730.89010
19919703628950.60.880100
20000000000

This is a typical MRCPSP. A project consists of J activities. And two dummy activities are added: the beginning activity 0 and the termination activity J + 1, both of which need zero recourse and zero processing time. Thus, the activities can be defined as a set . Each activity holds M alternative modes. The renewable resources are encapsulated into a set , and the number of resources of type that can be used in each period is described by ; similarly, there is a set of consumable resources and it contains resources of type . , is the set of direct predecessors of activity j, which means activity j cannot begin until every activity is completed. If an activity j processes in mode m, , defines its processing time, the quantity of the renewable resource of type , and the quantity of consumable resource of type .

The ultimate goal is to minimize the total duration of the project, called makespan. Thus, this problem can be described as follows:subject towhere equation (1) defines the objective function to obtain the minimum processing time; the constraint in equation (2) defines that one activity only processes once in one mode; equation (3) qualifies the timing constraints between activities; equation (4) keeps the number of usable renewable resources in each period less than the total number of the renewable resources; and equation (5) ensures that all the used unrenewable resources cannot exceed the total nonrenewable resources. in these constraints represent the earliest and the latest time windows of an activity, respectively. Table 2lists all the parameters used in the model.


ParameterMeaning

jActivity number, j = 1, 2, …, J, where J is the total number of activities
The set of all the activities
MActivity execute modes
kResource number, k = 1, 2, …, K, where K is the total number of types of recourses
The type of renewable resources
The type of nonrenewable resources
The number of renewable resources of type k that can be used in each period
The number of nonrenewable resources of type k that can be used in each period
The set of activities immediately preceding activity j
Duration of activity j
The quantity of the renewable resources of type k that activity j requires
The quantity of the nonrenewable resources of type k that activity j requires
The earliest finish time of activity j
The latest finish time of activity j
tTime number, t = 1, 2, …, T, where T is the deadline of the whole project.

Many scholars proposed novel solutions to MRCPSP, like Van Peteghem and Vanhoucke [35], Wang and Fang [36], Ballestin et al. [37], Liu et al. [38], and Gutjahr [13]. The author of this paper adopted a genetic algorithm, developed by Liu et al., to achieve the ultimate goals. The algorithm was coded by JAVA and run in a PC with double CPUs (Pentium 2.7 GHZ) and a 2.0 GB RAM. And 32 options were selected from the results that provided nondominated solutions within 1000 days, as listed in Table 3.


No.Duration (d)QualityCostNo.Duration (d)QualityCost

1764.32560.8273123.253217739.92560.7696125.6698
2731.42680.8028128.564218764.7230.7995121.6883
3764.32560.8273123.253219789.75720.8268118.8704
4731.42680.8028128.564220808.36050.8437118.6849
5764.32560.8273123.253221858.81320.848113.3372
6765.75950.8283123.165722713.9650.7031133.9032
7716.46760.7845130.832523738.51330.7423127.0581
8736.86150.805127.050824780.86910.7696120.6025
9765.75950.8283123.165725798.77240.7971117.7562
10808.36050.8437118.684926823.87810.8236115.4423
11710.91730.7682131.881127855.73690.8473113.5001
12733.9240.8003126.961728897.970.8542112.2478
13760.70470.822123.389229713.9650.7031133.9032
14783.60340.8284120.472230734.39080.7266128.9113
15808.36050.8437118.684931766.07410.7589123.6714
16710.18310.7341131.979232791.35080.7735119.4027

The genetic algorithm eliminated dominated solutions. The results distributions are depicted in Figures 24.

Figure 2 demonstrates that the increase of the project duration can elevate the quality, but the marginal utility of the former is diminishing. Project cost, as exhibited in Figure 3, is nonlinearly related to the duration: a speedy working mode can dramatically increase the cost, but prolonging duration can hardly reduce the cost reversely. Figure 4 further explains the consequences of Figure 3: the growing cost leads to a lower quality, instead of a higher one, due to the shortened duration.

Those solutions put processing time first without any preference suggestions and leave decision-makers struggling to choose the most appropriate ones. Therefore, we adopted data envelopment analysis (DEA) to further evaluate those solutions.

3. Results of DEA Models and Discussions

3.1. Results

In our DEA model, processing time is a reverse output. The smaller it is, the better. So for the sake of simplicity, we regarded the processing time, together with the cost, as the inputs, while the quality as the output. Given the inability of traditional DEA models, like CCR and BCC, to rank efficient units and thus to choose the best one, we utilized superefficiency DEA models to complete those works. Table 4 compares four efficiencies of the 32 options, including CCR, BCC, CRS superefficiency, and VRS superefficiency.


SolutionsCCRBCCCRSVRS

11.00001.00001.00001.0000
21.00001.00001.00001.0000
31.00001.00001.00001.0000
41.00001.00001.00001.0000
51.00001.00001.00001.0000
61.00001.00001.00001.0000
70.99761.00000.99761.0057
80.99851.00000.99851.0003
91.00001.00001.00001.0000
101.00001.00001.00001.0000
110.98451.00000.98451.0049
120.99611.00000.99611.0020
130.99741.00000.99741.0007
140.99500.99890.99500.9989
151.00001.00001.00001.0000
160.94181.00000.94181.0010
170.95301.00000.95301.0001
180.97071.00000.97071.0000
190.99351.00000.99351.0028
201.00001.00001.00001.0000
211.00001.00001.00031.0003
220.89720.99470.89720.9947
230.91900.99620.91900.9962
240.92600.99550.92600.9955
250.95460.99950.95460.9995
260.98160.99990.98160.9999
271.00001.00001.00021.0005
281.00001.00001.0015inf
290.89720.99470.89720.9947
300.90160.99270.90160.9927
310.91510.99080.91510.9908
320.92670.99530.92670.9953

3.2. Discussions

Table 4 indicates that the CCR model results in 13 efficient units; the highest of the 32 efficiencies is 1 and the lowest is 0.8972. However, the BCC model obtains 22 efficient units; the highest is 1 and the lowest is 0.9908. These results imply that BCC holds a weaker ability than CCR of determining efficiency, although their minimum efficiencies are close. Among the results of the superefficiency CRS model, the highest is 1.0015 in decision-making unit (DMU) 28, and the lowest is similar to that of CCR, while for VRS model, the highest is 1.0057 in DMU 7, and the lowest equals that of BCC. CRS presents both lower maximum and lower minimum than VRS.

Notably, the maximums and the minimums of the four models are pretty close, which implies that finding the best from the 32 options is a tough task. But through comparing the four columns, one can notice that when a result of a traditional model is inefficient, it equals that of the corresponding superefficient model; otherwise, it is less than that of the corresponding superefficient model. This indicates that superefficient models can be used to further rank efficient units and find the best one. In addition, it should be noted that DMU 28 has no solution in the VRS superefficiency model, which is because we adopt an input-oriented super efficiency model, and the output value of DMU 28 (i.e., engineering quality value) is the largest among all DMU. Traditional models can help decision-makers find the worst inefficient DMU but tend to provide multiefficient DMUs with the same efficiency, due to the upper limit. Superefficiency models remove this limit and present efficient DMUs with various values; thus the best one can be easily spotted. In our study, CRS chose DMU 28 as the best while VRS chose DMU 7.

Superefficiency models can find the best among solutions to an MRCPSP in an effective and speedy way. Applying superefficiency DEA models to MRCPSP is validated to be a convincible and better approach.

MRCPSP occurs in many real-world applications, such as construction engineering, subway line selection, medical diagnosis, supplier location, cargo transportation, and software development. A very common difficulty of many real MRCPSPs is how to evaluate each of the solutions in a subjective way. The DEA approach proposed in this paper should be a good choice.

4. Conclusions

As project scheduling usually targets multigoals, solutions to multimode resource-constrained project scheduling problems can be multiple. How to select an appropriate one according to objective principles has become a problem in practice. We adopt data envelopment analysis to a typical MRCPSP and effectively propose a series of objective benchmarks that can help to evaluate those solutions to the MRCPSP and determine an appropriate one. Our approach provides an innovative perspective and an effective approach for decision-makers when selecting a proper solution to an MRCPSP.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The author has no conflicts of interest to declare.

Acknowledgments

This work was supported by the Xuzhou Medical University excellent talents scientific research start-up fund (53591420); initial funding for postdoctoral research of XZMU (53470321); and the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD).

References

  1. S. E. Elmaghraby, Activity Networks: Project Planning and Control by Network Models, Wiley, New York, NY, USA, 1977.
  2. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal Of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at: Publisher Site | Google Scholar
  3. R. Kolisch and A. Drexl, “Local search for nonpreemptive multi-mode resource-constrained project scheduling,” IIE Transactions, vol. 29, no. 11, pp. 987–999, 1997. View at: Publisher Site | Google Scholar
  4. A. Schnell and R. F. Hartl, “On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations,” Or Spectrum, vol. 38, no. 2, pp. 283–303, 2016. View at: Publisher Site | Google Scholar
  5. M. H. Sebt, M. R. Afshar, and Y. Alipouri, “Hybridization of genetic algorithm and fully informed particle swarm for solving the multi-mode resource-constrained project scheduling problem,” Engineering Optimization, vol. 49, no. 3, pp. 513–530, 2017. View at: Publisher Site | Google Scholar
  6. C. C. Liu, “A column generation based distributed scheduling algorithm for multi-mode resource constrained project scheduling problem,” Computers & Industrial Engineering, vol. 125, pp. 258–278, 2018. View at: Publisher Site | Google Scholar
  7. R. Sonmez and M. Gurel, “Hybrid optimization method for large-scale multimode resource-constrained project scheduling problem,” Journal of Management in Engineering, vol. 32, no. 6, 2016. View at: Publisher Site | Google Scholar
  8. R. Zamani, “An effective mirror-based genetic algorithm for scheduling multi-mode resource constrained projects,” Computers & Industrial Engineering, vol. 127, pp. 914–924, 2019. View at: Publisher Site | Google Scholar
  9. F. Faghih-Mohammadi, A. Seifi, and M. Khalighi-Sikaroudi, “A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting,” RAIRO-Operations Research, vol. 50, no. 1, pp. 91–118, 2016. View at: Publisher Site | Google Scholar
  10. R. Nemati-Lafmejani, H. Davari-Ardakani, and H. Najafzad, “Multi-mode resource constrained project scheduling and contractor selection: mathematical formulation and metaheuristic algorithms,” Applied Soft Computing, vol. 81, p. 22, 2019. View at: Publisher Site | Google Scholar
  11. A. Hill, E. Lalla-Ruiz, S. Voß, and M. Goycoolea, “A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem,” Journal of Scheduling, vol. 22, no. 2, pp. 173–182, 2019. View at: Publisher Site | Google Scholar
  12. B. O. Odedairo, “Relevance and applicability of multi-objective resource constrained project scheduling problem: review article,” Engineering, Technology & Applied Science Research, vol. 1, no. 6, pp. 144–150, 2011. View at: Google Scholar
  13. W. J. Gutjahr, “Bi-objective multi-mode project scheduling under risk aversion,” European Journal of Operational Research, vol. 246, no. 2, pp. 421–434, 2015. View at: Publisher Site | Google Scholar
  14. E. B. Tirkolaee, A. Goli, M. Hematian, A. K. Sangaiah, and T. Han, “Multi-objective multi-mode resource constrained project scheduling problem using pareto-based algorithms,” Computing, vol. 101, no. 6, pp. 547–570, 2019. View at: Publisher Site | Google Scholar
  15. H. Maghsoudlou, B. Afshar-Nadjafi, and S. T. A. Niaki, “A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem,” Computers & Chemical Engineering, vol. 88, pp. 157–169, 2016. View at: Publisher Site | Google Scholar
  16. M. Naldi, G. Nicosia, A. Pacifici, and U. Pferschy, “Profit-fairness trade-off in project selection,” Socio-Economic Planning Sciences, vol. 67, pp. 133–146, 2019. View at: Publisher Site | Google Scholar
  17. P. Liu, B. Zhu, and P. Wang, “A multi-attribute decision-making approach based on spherical fuzzy sets for yunnan Baiyao's R&D project selection problem,” International Journal of Fuzzy Systems, vol. 21, no. 7, pp. 2168–2191, 2019. View at: Publisher Site | Google Scholar
  18. A. Charnes, W. W. Cooper, and E. Rhodes, “Measuring the efficiency of decision making units,” European Journal of Operational Research, vol. 2, no. 6, pp. 429–444, 1978. View at: Publisher Site | Google Scholar
  19. G. Debreu, “The coefficient of resource utilization,” Econometrica, vol. 19, no. 3, Journal of the Econometric Society, 1951. View at: Publisher Site | Google Scholar
  20. T. C. Koopmans, “Analysis of production as an efficient combination of activities,” Activity Analysis of Production and Allocation, vol. 13, pp. 33–37, 1951. View at: Google Scholar
  21. M. J. Farrell, “The measurement of productive efficiency,” Journal of the Royal Statistical Society. Series A (General), vol. 120, no. 3, pp. 253–290, 1957. View at: Publisher Site | Google Scholar
  22. R. Mahmoudi, A. Emrouznejad, S.-N. Shetab-Boushehri, and S. R. Hejazi, “The origins, development and future directions of data envelopment analysis approach in transportation systems,” Socio-Economic Planning Sciences, vol. 69, 2020. View at: Publisher Site | Google Scholar
  23. S. Kohl, J. Schoenfelder, A. Fügener, and J. O. Brunner, “The use of data envelopment analysis (dea) in healthcare with a focus on hospitals,” Health Care Management Science, vol. 22, no. 2, pp. 245–286, 2019. View at: Publisher Site | Google Scholar
  24. T. T. Yang, P. C. Wang, and F. Li, “Centralized resource allocation and target setting based on data envelopment analysis model,” Mathematical Problems in Engineering, vol. 10, 2018. View at: Google Scholar
  25. A. Mardani, “Data envelopment analysis in energy and environmental economics: an overview of the state-of-the-art and recent development trends,” Energies, vol. 11, no. 8, 2018. View at: Publisher Site | Google Scholar
  26. H. Zhou, Y. Yang, Y. Chen, and J. Zhu, “Data envelopment analysis application in sustainability: the origins, development and future directions,” European Journal of Operational Research, vol. 264, no. 1, pp. 1–16, 2018. View at: Publisher Site | Google Scholar
  27. S. Soheilirad, K. Govindan, A. Mardani, E. K. Zavadskas, M. Nilashi, and N. Zakuan, “Application of data envelopment analysis models in supply chain management: a systematic review and meta-analysis,” Annals of Operations Research, vol. 271, no. 2, pp. 915–969, 2018. View at: Publisher Site | Google Scholar
  28. W. D. Cook and L. M. Seiford, “Data envelopment analysis (DEA) - thirty years on,” European Journal of Operational Research, vol. 192, no. 1, pp. 1–17, 2009. View at: Publisher Site | Google Scholar
  29. J. S. Liu, L. Y. Y. Lu, W.-M. Lu, and B. J. Y. Lin, “A survey of dea applications,” Omega, vol. 41, no. 5, pp. 893–902, 2013. View at: Publisher Site | Google Scholar
  30. M. Kapelko, “Measuring inefficiency for specific inputs using data envelopment analysis: evidence from construction industry in Spain and Portugal,” Central European Journal of Operations Research, vol. 26, no. 1, pp. 43–66, 2018. View at: Publisher Site | Google Scholar
  31. E. Karasakal and P. Aker, “A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem,” Omega, vol. 73, pp. 79–92, 2017. View at: Publisher Site | Google Scholar
  32. M. Toloo, S. Nalchigar, and B. Sohrabi, “Selecting most efficient information system projects in presence of user subjective opinions: a dea approach,” Central European Journal of Operations Research, vol. 26, no. 4, pp. 1027–1051, 2018. View at: Publisher Site | Google Scholar
  33. M. Toloo and M. Mirbolouki, “A new project selection method using data envelopment analysis,” Computers & Industrial Engineering, vol. 138, 2019. View at: Publisher Site | Google Scholar
  34. Y. Wen, Q. An, X. Xu, and Y. Chen, “Selection of six sigma project with interval data: common weight dea model,” Kybernetes, vol. 47, no. 7, pp. 1307–1324, 2018. View at: Publisher Site | Google Scholar
  35. V. Van Peteghem and M. Vanhoucke, “Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem,” Journal of Heuristics, vol. 17, no. 6, pp. 705–728, 2011. View at: Publisher Site | Google Scholar
  36. L. Wang and C. Fang, “An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem,” Computers & Operations Research, vol. 39, no. 2, pp. 449–460, 2012. View at: Publisher Site | Google Scholar
  37. F. Ballestín, A. Barrios, and V. Valls, “Looking for the best modes helps solving the mrcpsp/max,” International Journal of Production Research, vol. 51, no. 3, pp. 813–827, 2013. View at: Publisher Site | Google Scholar
  38. S. X. Liu, D. Chen, and Y. F. Wang, “Memetic algorithm for multi-mode resource-constrained project scheduling problems,” Journal of Systems Engineering and Electronics, vol. 25, no. 4, pp. 609–617, 2014. View at: Publisher Site | Google Scholar

Copyright © 2020 Song Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views264
Downloads213
Citations

Related articles

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.