An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes

International Journal of Production Economics

Volumn 117, Issue 2, 2009, Pages 302-316

  Lova, Antonio ^a   Tormos, Pilar ^a   Cervantes, Mariamar ^a,b   Barber, Federico ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSIDAD DE LA SABANA   (Colombia)

Author keywords

Genetic Algorithms; Multimode forward backward improving method; Project management and scheduling; Renewable and non renewable resources

Indexed keywords

ALGORITHMS; CONSTRAINED OPTIMIZATION; FLOW MEASUREMENT; FUNCTION EVALUATION; GENETIC ALGORITHMS; PROBABILITY DENSITY FUNCTION; PROJECT MANAGEMENT; SCHEDULING ALGORITHMS;

COMPUTATIONAL RESULTS; FITNESS FUNCTIONS; HYBRID GENETIC ALGORITHMS; MULTIMODE FORWARD-BACKWARD IMPROVING METHOD; OBJECTIVE FUNCTIONS; PROJECT MANAGEMENT AND SCHEDULING; RENEWABLE AND NON-RENEWABLE RESOURCES; RESOURCE CONSTRAINTS;

SCHEDULING;

EID: 58949096631     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2008.11.002     Document Type: Article

References (27)

1. Alcaraz J., Maroto C., and Ruiz R. Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with Genetic Algorithms. Journal of the Operational Research Society 54 (2003) 614-626
2. Blazewicz J., Lenstra J., and Kan R. Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5 (1983) 11-24
3. Boctor F.F. Heuristics for scheduling projects with resource restrictions and several resource-duration modes. International Journal of Production Research 31 (1993) 2547-2558
4. Boctor F.F. A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes. European Journal of Operational Research 90 (1996) 349-361
5. Boctor F.F. Resource-constrained project scheduling by simulated annealing. International Journal of Production Research 34 (1996) 2335-2351
6. Bouleimen K., and Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149 (2003) 268-281
7. Brucker P., Drexl A., Möhring R., Neumann K., and Pesch E. Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research 112 (1999) 3-41
8. Demeulemeester E., and Herroelen W. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38 (1992) 1803-1818
9. Demeulemeester E., DeReyck B., and Herroelen W. The discrete time/resource trade-off problem in project networks: a branch-and-bound approach. IIE Transactions 32 (2000) 1059-1069
10. Drexl A., and Grünewald J. Nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions 25 (1993) 74-81
11. Hartmann S. Project scheduling with multiple modes: a genetic algorithm. Annals of Operations Research 102 (2001) 111-135
12. Hartmann S., and Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127 (2000) 394-407
13. Hartmann S., and Kolisch R. Experimental investigation of heuristics for resource-constrained project scheduling: an update. European Journal of Operational Research 174 (2006) 23-37
14. Józefowska J., Mika M., Rozycki R., Waligora G., and Weglarz J. Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling. Annals of Operations Research 102 (2001) 137-155
15. Kadrou, Y., Najid, N.M., 2006. A new heuristic to solve RCPSP with multiple execution modes and multi-skilled labor. In: Proceedings of IMACS Multiconference on Computational Engineering in Systems Applications.
16. Kolisch R., and Drexl A. Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions 29 (1997) 987-999
17. Kolisch R., and Hartmann S. Heuristic algorithms for solving the resource-constrained project scheduling problem. Project Scheduling-Recent Models, Algorithms and Applications (1999), Kluwer Academic Publishers, Boston, MA 147-178
18. Kolisch R., and Sprecher A. PSPLIB-a project scheduling problem library. European Journal of Operational Research 96 (1996) 205-216
19. Özdamar L. A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man and Cybernetics-Part C 29 (1999) 44-59
20. Özdamar L., and Ulusoy G. A local constraint based analysis approach to project scheduling under general resource constraints. European Journal of Operational Research 79 (1994) 287-298
21. Patterson J.H., Slowinski R., Talbot F.B., and Weglarz J. An algorithm for a general class of precedence and resource constrained scheduling problems. In: Slowinski R., and Weglarz J. (Eds). Advances in Project Scheduling (1989), Elsevier, Amsterdam 3-28
22. Slowinski R., Soniewicki B., and Weglarz J. DSS for multiobjective project scheduling. European Journal of Operational Research 79 (1994) 220-229
23. Sprecher A., and Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107 (1998) 431-450
24. Sprecher A., Hartmann S., and Drexl A. An exact algorithm for project scheduling with multiple modes. OR Spektrum 19 (1997) 195-203
25. Talbot B. Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case. Management Science 28 (1982) 1197-1210
26. Tormos P., and Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research 102 (2001) 65-81
27. Valls V., Ballestín F., and Quintanilla S. Justification and rcpsp: a technique that pays. European Journal of Operational Research 165 (2005) 375-386