Browse > Article
http://dx.doi.org/10.7232/JKIIE.2011.37.4.408

Performance Analysis of Local Optimization Algorithms in Resource-Constrained Project Scheduling Problem  

Yim, Dong-Soon (Department of Industrial and Management Engineering, Hannam University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.37, no.4, 2011 , pp. 408-414 More about this Journal
Abstract
The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.
Keywords
Resource-Constrained Project Scheduling; Local Optimization Algorithm; Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Valls, V., Ballestin, F., and Quintanilla, S. (2004), A Population-Based Approach to the Resource-Constrained Project Scheduling Problem, Annals of Operations Research, 131, 305-324.   DOI
2 Valls, V., Ballestin, F. and Quintanilla, S. (2005), Justification and RCPSP : A Technique that Pays, European Journal of Operational Research, 165, 375-386.   DOI   ScienceOn
3 Valls, V., Ballestin, F., and Quintanilla, S. (2008), A Hybrid Genetic Algorithm for the Resource-Constrained Project Scheduling Problem, European Journal of Operational Research, 185, 495-508.   DOI   ScienceOn
4 Chen, W., Shi, Y., Teng, H., Lan, X., and Hu, L. (2010), An Efficient Hybrid Algorithm for Resource-Constrained Project Scheduling, Information Sciences, 180, 1031-1039.   DOI   ScienceOn
5 Ahuja, R., Orlin, J., and Sharma, D. (2000), Very Large-Scale Neighborhood Search, International Transactions in Operations Research, 7, 301-317.   DOI   ScienceOn
6 Blazewicz, J., Lenstra, L., and Kan R. (1998), Scheduling Subject to Resource Constraints : Classification and Complexity, Discrete Mathematics, 5, 11-24.
7 Brucker, P., Drexl, A., Mohring, R., Neumann, K., and Presch, E. (1999), Resource-Constrained Project Scheduling : Notation, Classification, Models, and Methods, European Journal of Operational Research, 112, 3-41.   DOI   ScienceOn
8 Kolisch, R. and Hartman, S. (1999), Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem : Classification and Computational Analysis in Handbook on Recent Advances in Project Scheduling, Kluwer; Weglarz, J(Ed), 147-178.
9 Kolisch, R. and Hartman, S. (2006), Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling : An Update, European Journal of Operational Research, 174, 23-37.   DOI   ScienceOn
10 Kolisch, R. and Sprecher, A. (1996), PSPLIB-A project scheduling library, European Journal of Operational Research, 96, 205-216.
11 Tormos, P. and Lova, A. (2003), An Efficient Multi-Pass Heuristic for Project Scheduling with Constrained Resources, International Journal of Production Research, 41(5), 1071-1086   DOI   ScienceOn
12 Tseng, L. and Chen, S. (2006), A Hybrid Metaheuristic for the Resource- Constrained Project Scheduling Problem, European Journal of Operational Research, 175, 707-721.   DOI   ScienceOn