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

Soft Computing

Volumn 13, Issue 6, 2009, Pages 597-610

  Mahdi Mobini, M D ^a   Rabbani, M ^a   Amalnik, M S ^a   Razmi, J ^a   Rahimi Vahed, A R ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Makespan; Path relinking; Project scheduling; Resource constrained; Scatter search algorithm

Indexed keywords

ALGORITHMS; BENCHMARKING; LEARNING ALGORITHMS; SCHEDULING;

MAKESPAN; PATH RELINKING; PROJECT SCHEDULING; RESOURCE CONSTRAINED; SCATTER SEARCH ALGORITHM;

SCHEDULING ALGORITHMS;

EID: 59149093294     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-008-0337-5     Document Type: Article

References (32)

1. 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
2. Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints. Discrete Appl Math 5:11-24
3. 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
4. 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
5. 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
6. 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
7. Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155:402-413
8. Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Naval Res Logistics 45:733-50
9. Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res Logistics 49:433-448
10. 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
11. Herroelen W, Demeulemeester E, De Reyck B (1998) Resource constrained project scheduling - a survey of recent developments. Comput Oper Res 25(4):279-302
12. Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur J Oper Res 90:320-33
13. Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification computational analysis. In: WRglarz J(eds) Project scheduling: recent models, algorithms and applications. Kluwer, Berlin, pp 147-178
14. Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update. Eur J Oper Res 174:23-37
15. Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29:249-272
16. Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library. Eur J Oper Res 96:205-216
17. 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
18. Li KY, Willis RJ (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56:370-379
19. Marti R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169:359-372
20. 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
21. 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
22. 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
23. Reza Zamani M (2001) A high-performance exact method for the resource-constrained project scheduling problem. Comput Oper Res 28:1387-1401
24. Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102:65-81
25. 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
26. 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
27. Valls V, Ballestin F, Quintanilla MS (2005) Justification and RCPSP: A technique that pays. Eur J Oper Res 165:375-386
28. Valls V, Ballestin F, Quintanilla MS (2004) A population based approach to the resource-constrained project scheduling problem. Ann Oper Res 131:305-324
29. 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
30. Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169:623-637
31. Zhang H, Li H, Tam CM (2006) Particle swarm optimization for resource-constrained project scheduling. Int J Project Manage 24:83-92
32. Zhu D, Padman R (1996) A tabu search approach for scheduling resource-constrained projects with cash flows, Working Paper 96-30, Carnegie-Mellon University