Arabian Journal for Science and Engineering

, Volume 44, Issue 3, pp 2503–2517 | Cite as

Experimental Evaluation of Overlapping Strategy for the Multimode Resource-Constrained Project Scheduling Problem

  • Zihao Chu
  • Zhe XuEmail author
  • Fang Xie
Research Article - Systems Engineering


Reduction in project completion time is important in today’s competitive environment. This paper presents a solution to the realistic problem of scheduling activities to minimize the project duration, in which the activities (a) require units of multiple renewable and non-renewable resources for which a limited availability is imposed, (b) are performed in one of several modes, and (c) can be executed in parallel by allowing the downstream activity to start before the end of the upstream activity based on preliminary information. To solve the above-mentioned problem, a mixed-integer nonlinear programming model is built and an efficient genetic algorithm combined with design structure matrix is proposed. A revised serial schedule generation scheme, which considers resource constraints, precedence relation constraints and overlapping relation constraints, is designed to decode the chromosome. An example illustrates that the implementation of overlapping strategy can benefit from multimode and thus accelerate the project process. Results based on a large set of generated instances demonstrate the effectiveness of the proposed algorithm and reveal the impacts of significant factors on the time reduction in project makespan.


Resource-constrained project scheduling Multimode Overlapping Genetic algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



This paper is supported by National Natural Science Foundation of China (Grant No: 71571005,71271019), the Humanities and Social Sciences Foundation of the Ministry of Education of China (Grant No: 17YJC630177), the Natural Science Foundation of Shandong Province of China (Grant No: ZR201709240250).

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.


  1. 1.
    Blazewicz, J.; Lenstra, J.K.; Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bianco, L.; Caramia, M.: An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur. J. Oper. Res. 219, 73–85 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    De Reyck, B.; Herroelen, W.: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. 111, 152–174 (1998)CrossRefzbMATHGoogle Scholar
  4. 4.
    Sprecher, A.; Hartmann, S.; Drexl, A.: An exact algorithm for project scheduling with multiple modes. Oper. Spectr. 19, 195–203 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Mingozzi, A.; Maniezzo, V.; Ricciardelli, S.; Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag. Sci. 44, 714–729 (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Brinkmann, K.; Neumann, K.: Heuristic procedures for resource—constrained project scheduling with minimal and maximal time lags: the resource—levelling and minimum project–duration problems. J. Decis. Syst. 5, 129–155 (1996)CrossRefGoogle Scholar
  7. 7.
    Hartmann, S.; Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127, 394–407 (2000)CrossRefzbMATHGoogle Scholar
  8. 8.
    Kolisch, R.; Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174, 23–37 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Lee, J.K.; Kim, Y.D.: Search heuristics for resource constrained project scheduling. J. Oper. Res. Soc. 47, 678–689 (1996)CrossRefzbMATHGoogle Scholar
  10. 10.
    Bouleimen, K.; Lecocq, H.: 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 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Log. 45, 733–750 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Elmaghraby,; Eldin, S.: Activity Networks: Project Planning and Control by Network Models. Wiley, New York (1977)Google Scholar
  13. 13.
    Sprecher, A.; Drexl, A.: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res. 107, 431–450 (1998)CrossRefzbMATHGoogle Scholar
  14. 14.
    Drexl, A.; Gruenewald, J.: Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans. 25, 74–81 (1993)CrossRefGoogle Scholar
  15. 15.
    Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Ann. Oper. Res. 102, 111–135 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Alcaraz, J.; Maroto, C.; Ruiz, R.: Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. J. Oper. Res. Soc. 54, 614–626 (2003)CrossRefzbMATHGoogle Scholar
  17. 17.
    Józefowska, J.; Mika, M.; Różycki, R.; Waligóra, G.; Wȩglarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling. Ann. Oper. Res. 102, 137–155 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Jarboui, B.; Damak, N.; Siarry, P.; Rebai, A.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195, 299–308 (2008)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Roemer, T.A.; Wang, R.H.; Ahmadi, R.: Time-cost trade-offs in overlapped product development. Oper. Res. 48, 858–865 (2000)CrossRefGoogle Scholar
  20. 20.
    Galvez, E.D.; Capuz-Rizo, S.F.: Assessment of global sensitivity analysis methods for project scheduling. Comput. Ind. Eng. 93, 110–120 (2016)CrossRefGoogle Scholar
  21. 21.
    Krishnan, V.; Eppinger, S.D.; Whitney, D.E.: A model-based framework to overlap product development activities. Manag. Sci. 43, 437–451 (1997)CrossRefzbMATHGoogle Scholar
  22. 22.
    Bogus, S.M.; Molenaar, K.R.; Diekmann, J.E.: Concurrent engineering approach to reducing design delivery time. J. Constr. Eng. Manag. 131, 1179–1185 (2005)CrossRefGoogle Scholar
  23. 23.
    Loch, C.H.; Terwiesch, C.: Communication and uncertainty in concurrent engineering. Manag. Sci. 44, 1032–1048 (1998)CrossRefzbMATHGoogle Scholar
  24. 24.
    Srour, I.M.; Abdul-Malak, M.U.; Yassine, A.A.; Ramadan, M.: A methodology for scheduling overlapped design activities based on dependency information. Autom. Constr. 29, 1–11 (2013)CrossRefGoogle Scholar
  25. 25.
    Thiagarasu, V.; Devi, T.: Multi-agent coordination in project scheduling: priority rules based resource allocation. Int. J. Recent Trends Eng. 1, 42–46 (2009)Google Scholar
  26. 26.
    Gerk, J.E.V.; Qassim, R.Y.: Project acceleration via activity crashing, overlapping, and substitution. IEEE Trans. Eng. Manag. 55, 590–601 (2008)CrossRefGoogle Scholar
  27. 27.
    Cho, S.H.; Eppinger, S.D.: A simulation-based process model for managing complex design projects. IEEE Trans. Eng. Manag. 52, 316–328 (2005)CrossRefGoogle Scholar
  28. 28.
    Koyuncu, E.; Erol, R.: PSO based approach for scheduling NPD projects including overlapping process. Comput. Ind. Eng. 85, 316–327 (2015)CrossRefGoogle Scholar
  29. 29.
    Dehghan, R.; Hazini, K.; Ruwanpura, J.: Optimization of overlapping activities in the design phase of construction projects. Autom. Constr. 59, 81–95 (2015)CrossRefGoogle Scholar
  30. 30.
    De Reyck, B.; Herroelen, W.: The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. 119, 538–556 (1999)CrossRefzbMATHGoogle Scholar
  31. 31.
    Drexl, A.; Nissen, R.; Patterson, J.H.; Salewski, F.: ProGen/\(\pi \)x—an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125, 59–72 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Sabzehparvar, M.; Seyed-Hosseini, S.M.: A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. J. Supercomput. 44, 257–273 (2008)CrossRefzbMATHGoogle Scholar
  33. 33.
    Bagherinejad, J.; Rafie Majd, Z.: Solving the MRCPSP/max with the objective of minimizing tardiness/earliness cost of activities with double genetic algorithms. Int. J. Adv. Manuf. Technol. 70, 573–582 (2014)CrossRefGoogle Scholar
  34. 34.
    Greze, L.; Pellerin, R.; Leclaire, P.; Perrier, N.: CIGI2011: a heuristic method for resource-constrained project scheduling with activity overlapping. J Intell. Manuf. 25, 797–811 (2014)CrossRefGoogle Scholar
  35. 35.
    Browning, T.R.: Applying the design structure matrix to system decomposition and integration problems: a review and new directions. IEEE Trans. Eng. Manag. 48, 292–306 (2001)CrossRefGoogle Scholar
  36. 36.
    Steward, D.V.: The design structure system: a method for managing the design of complex systems. IEEE Trans. Eng. Manag. 28, 71–74 (1981)CrossRefGoogle Scholar
  37. 37.
    Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90, 320–333 (1996)CrossRefzbMATHGoogle Scholar
  38. 38.
    Kolisch, R.; Sprecher, A.: PSPLIB—a project scheduling problem library. Eur. J. Oper. Res. 96, 205–216 (1997)CrossRefzbMATHGoogle Scholar
  39. 39.
    Li, H.; Demeulemeester, E.: A genetic algorithm for the robust resource leveling problem. J. Sched. 19, 43–60 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Yassine, A.A.; Mostafa, O.; Browning, T.R.: Scheduling multiple, resource-constrained, iterative, product development projects with genetic algorithms. Comput. Ind. Eng. 107, 39–56 (2017)CrossRefGoogle Scholar
  41. 41.
    Chen, P.H.; Weng, H.: A two-phase GA model for resource-constrained project scheduling. Autom. Constr. 18, 485–498 (2009)CrossRefGoogle Scholar

Copyright information

© King Fahd University of Petroleum & Minerals 2018

Authors and Affiliations

  1. 1.School of Economics and ManagementBeihang UniversityBeijingChina
  2. 2.College of FinanceShandong Technology and Business UniversityYantai, ShandongChina

Personalised recommendations