Skip to main content
SpringerLink
Log in

Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The resource-constrained project scheduling problem is one of the classical problems in the field of operations research. There are many criteria to efficiently determine the desired schedule of a project. In this paper, a well-known criterion namely project’s makespan is considered. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional methods. Therefore, an enhanced scatter search, based on a new path relinking and two prominent permutation-based and crossover operators, is devised to solve the problem. In order to validate the performance of the proposed algorithm, in terms of solution quality, the algorithm is applied to various test problems available on the literature and the reliability of it, is compared with well-reported benchmark algorithms. The computational results reveal that the proposed algorithm has appropriate results in comparison with the existing benchmark algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alcaraz J, Maroto C, Ruiz R (2004) Improving the performance of genetic algorithms for the RCPS problem. In: Proceedings of the ninth international workshop on project management and scheduling, Nancy, pp 40–43

  • Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints. Discrete Appl Math 5: 11–24

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models and methods. Eur J Oper Res 112: 3–41

    Article  MATH  Google Scholar 

  • Debles D, Reyck BD, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169: 638–653

    Article  Google Scholar 

  • Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155: 402–413

    Article  MATH  MathSciNet  Google Scholar 

  • Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Naval Res Logistics 45: 733–50

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  Google Scholar 

  • Herroelen W, Demeulemeester E, De Reyck B (1998) Resource constrained project scheduling—a survey of recent developments. Comput Oper Res 25(4): 279–302

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification computational analysis. In: Weglarz J(eds) Project scheduling: recent models, algorithms and applications. Kluwer, Berlin, pp 147–178

    Google Scholar 

  • Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174: 23–37

    Article  MATH  Google Scholar 

  • Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29: 249–272

    Article  Google Scholar 

  • Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library. Eur J Oper Res 96: 205–216

    Article  Google Scholar 

  • Kochetov Y, Stolyar A (2003) Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd international workshop of computer science and information technologies, Russia

  • Li KY, Willis RJ (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56: 370–379

    Article  MATH  Google Scholar 

  • Marti R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169: 359–372

    Article  MATH  MathSciNet  Google Scholar 

  • Nonobe K, Ibaraki T (2002) Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro CC, Hansen P(eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 557–588

    Google Scholar 

  • Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. In: Proceedings of the first IEEE international conference on evolutionary computation, New York, pp 376–384

  • Palpant M, Artigues C, Michelon P (2004) LSSPER: solving the resource-constrained project scheduling problem with large neighborhood search. Ann Oper Res 131: 237–257

    Article  MATH  MathSciNet  Google Scholar 

  • Reza Zamani M (2001) A high-performance exact method for the resource-constrained project scheduling problem. Comput Oper Res 28: 1387–1401

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Tormos P, Lova A (2003) Integrating heuristics for resource constrained project scheduling: one step forward. Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia

  • Valls V, Ballestin F, Quintanilla MS (2003) A hybrid genetic algorithm for the RCPSP. Technical report, Department of Statistics and Operations Research, University of Valencia

  • Valls V, Ballestin F, Quintanilla MS (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165: 375–386

    Article  MATH  Google Scholar 

  • Valls V, Ballestin F, Quintanilla MS (2004) A population based approach to the resource-constrained project scheduling problem. Ann Oper Res 131: 305–324

    Article  MATH  MathSciNet  Google Scholar 

  • Vanhoucke M, Demeulemeester E, Herroelen W (2001) Scheduling projects with linear time dependent cash flows to maximize the net present value. Int J Prod Res 39: 3159–3181

    Article  MATH  Google Scholar 

  • Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169: 623–637

    Article  MATH  MathSciNet  Google Scholar 

  • Zhang H, Li H, Tam CM (2006) Particle swarm optimization for resource-constrained project scheduling. Int J Project Manage 24: 83–92

    Article  Google Scholar 

  • Zhu D, Padman R (1996) A tabu search approach for scheduling resource-constrained projects with cash flows, Working Paper 96-30, Carnegie-Mellon University

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Tehran, P.O. Box 11365, 4563, Tehran, Iran

    M. D. Mahdi Mobini, M. Rabbani, M. S. Amalnik & J. Razmi

  2. Center for Research on Transportation, University of Montreal, P.O.Box 6128, Succursale Centre-ville, Montreal, H3C 3J7, Canada

    A. R. Rahimi-Vahed

Authors
  1. M. D. Mahdi Mobini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Rabbani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. S. Amalnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Razmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. A. R. Rahimi-Vahed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Rabbani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mahdi Mobini, M.D., Rabbani, M., Amalnik, M.S. et al. Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft Comput 13, 597–610 (2009). https://doi.org/10.1007/s00500-008-0337-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-008-0337-5

Keywords

Search

Navigation