A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem

Published Online:https://doi.org/10.1287/opre.1060.0358

References

  • Alcaraz J., Maroto C. A robust genetic algorithm for resource allocation in project scheduling. Ann. Oper. Res. (2001) 102:83–109CrossrefGoogle Scholar
  • Alcaraz J., Maroto C., Ruiz R. Improving the performance of genetic algorithms for the RCPS problem. Proc. Ninth Internat. Workshop Project Management and Scheduling (2004) Nancy, France:40–43Google Scholar
  • Baar T., Brucker P., Knust S., Voss S., Martello S., Osmon I. H. Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1998) (Kluwer Academic Publishers, Norwell, MA) 1–8Google Scholar
  • 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. (2003) 149:268–281CrossrefGoogle Scholar
  • Brucker P., Knust S., Schoo A., Thiele O. A branch & bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. (1998) 107:272–288CrossrefGoogle Scholar
  • Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling: Notation, classification, models and methods. Eur. J. Oper. Res. (1999) 112:3–41CrossrefGoogle Scholar
  • Coelho J., Tavares L. Comparative analysis of meta-heuristics for the resource constrained project scheduling problem. (2003) . Technical report, Department of Civil Engineering, Instituto Superior Tecnico, Lisbon, PortugalGoogle Scholar
  • Debels D., De Reyck B., Leus R., Vanhoucke M. A hybrid scatter-search/electromagnetism meta-heuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. (2006) 169(3):638–653CrossrefGoogle Scholar
  • Demeulemeester E., Herroelen W. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. (1992) 38:1803–1818LinkGoogle Scholar
  • Demeulemeester E., Herroelen W. New benchmark results for the resource-constrained project scheduling problem. Management Sci. (1997) 43:1485–1492LinkGoogle Scholar
  • Demeulemeester E., Vanhoucke M., Herroelen W. A random generator for activity-on-the-node networks. J. Scheduling (2003) 6:13–34CrossrefGoogle Scholar
  • Hartmann S. A competitive genetic algorithm for the resource-constrained project scheduling. Naval Res. Logist. (1998) 45:733–750CrossrefGoogle Scholar
  • Hartmann S. A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res. Logist. (2002) 49:433–448CrossrefGoogle Scholar
  • Hartmann S., Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. (2000) 127:394–407CrossrefGoogle Scholar
  • Herroelen W., Demeulemeester E., De Reyck B., Weglarz J. A classification scheme for project scheduling. Project Scheduling—Recent Models, Algorithms and Applications. International Series in Operations Research and Management Science (1999) 14(Kluwer Academic Publishers, Boston, MA) 77–106CrossrefGoogle Scholar
  • Herroelen W., De Reyck B., Demeulemeester E. Resource-constrained project scheduling: A survey of recent developments. Comput. Oper. Res. (1998) 25(4):279–302CrossrefGoogle Scholar
  • Holland J. H.Adaptation in Natural and Artificial Systems (1975) (The University of Michigan Press, Ann Arbor, MI) Google Scholar
  • Icmeli O., Erenguc S. S., Zappe C. J. Project scheduling problems: A survey. Internat. J. Oper. Productions Management (1993) 13(11):80–91CrossrefGoogle Scholar
  • Kochetov Y., Stolyar A. Evolutionary local search with variable neighbourhood for the resource constrained project scheduling problem. Proc. 3rd Internat. Workshop of Comput. Sci. Inform. Tech. (2003) Ufa, RussiaGoogle Scholar
  • Kolisch R.Project Scheduling Under Resource Constraints—Efficient Heuristics for Several Problem Classes (1995) (Physica-Verlag, Heidelberg, Germany) CrossrefGoogle Scholar
  • Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. J. Oper. Management (1996a) 14:179–192CrossrefGoogle Scholar
  • Kolisch R. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur. J. Oper. Res. (1996b) 43:23–40Google Scholar
  • Kolisch R., Drexl A. Adaptive search for solving hard project scheduling problems. Naval Res. Logist. (1996) 43:23–40CrossrefGoogle Scholar
  • Kolisch R., Hartmann S., Weglarz J. Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. Project Scheduling—Recent Models, Algorithms and Applications (1999) (Kluwer Academic Publishers, Boston, MA) 147–178CrossrefGoogle Scholar
  • Kolisch R., Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling: An update. (2004) . Working paper, Technical University of Munich, Munich, GermanyGoogle Scholar
  • Kolisch R., Padman R. An integrated survey of deterministic project scheduling. Omega (2001) 49(3):249–272CrossrefGoogle Scholar
  • Kolisch R., Sprecher A. PSPLIB—A project scheduling library. Eur. J. Oper. Res. (1997) 96:205–216CrossrefGoogle Scholar
  • Leon V. J., Ramamoorthy B. Strength and adaptability of problem-space based neighbourhoods for resource-constrained scheduling. OR Spektrum (1995) 17:173–182CrossrefGoogle Scholar
  • Li K. Y., Willis R. J. An iterative scheduling technique for resource-constrained project scheduling. Eur. J. Oper. Res. (1992) 56:370–379CrossrefGoogle Scholar
  • Mausser H. E., Lawrence S. R., Glover F., Osman I., Kelley J. Exploiting block structure to improve resource-constrained project schedules. Metaheuristics 1995: State of the Art (1997) (Kluwer)Google Scholar
  • Merkle D., Middendorf M., Schmeck H. Ant colony optimization for resource constrained project scheduling. IEEE Trans. Evolutionary Comput. (2002) 6(4):333–346CrossrefGoogle Scholar
  • Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Sci. (1998) 44:715–729LinkGoogle Scholar
  • Nonobe K., Ibaraki T., Ribeiro C. C., Hansen P. Formulation and tabu search algorithm for the resource constrained project scheduling problem (RCPSP). Essays and Surveys in Meta-Heuristics (2002) (Kluwer Academic Publishers, Boston, MA) 557–588CrossrefGoogle Scholar
  • Özdamar L., Ulusoy G. A survey on the resource-constrained project scheduling problem. IIE Trans. (1995) 27:574–586CrossrefGoogle Scholar
  • Palpant M., Artigues C., Michelon P. LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search. Ann. Oper. Res. (2004) 131:237–257CrossrefGoogle Scholar
  • Schirmer A. Case-based reasoning and improved adaptive search for project scheduling. Naval Res. Logist. (2000) 47:201–222CrossrefGoogle Scholar
  • Sprecher A. Scheduling resource-constrained projects competitively at modest resource requirements. Management Sci. (2000) 46:710–723LinkGoogle Scholar
  • Sprecher A. Network decomposition techniques for resource-constrained project scheduling. J. Oper. Res. Soc. (2002) 53(4):405–414CrossrefGoogle Scholar
  • Tormos P., Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Ann. Oper. Res. (2001) 102:65–81CrossrefGoogle Scholar
  • Tormos P., Lova A. An efficient multi-pass heuristic for project scheduling with constrained resources. Internat. J. Production Res. (2003a) 41:1071–1086CrossrefGoogle Scholar
  • Tormos P., Lova A. Integrating heuristics for resource constrained project scheduling: One step forward. (2003b) . Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia, Valencia, SpainGoogle Scholar
  • Valls V., Ballestín F., Quintanilla S. A hybrid genetic algorithm for the resource-constrained project scheduling problem with the peak crossover operator. Eighth Internat. Workshop on Project Management and Scheduling (2002) 368–371Google Scholar
  • Valls V., Ballestín, F., Quintanilla S. A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. (2004) 131:305–324CrossrefGoogle Scholar
  • Valls V., Ballestin F., Quintanilla S. Justification and RCPSP: A technique that pays. Eur. J. Oper. Res. (2005) 165(2):375–386CrossrefGoogle Scholar
  • Valls V., Quintanilla S., Ballestín F. Resource-constrained project scheduling: A critical activity reordering heuristic. Eur. J. Oper. Res. (2003) 149:282–301CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.