Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

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

자원제약 프로젝트 스케쥴링 문제에 적용 가능한 부분 최적화 방법들의 성능 분석

  • Yim, Dong-Soon (Department of Industrial and Management Engineering, Hannam University)
  • 임동순 (한남대학교 산업경영공학과)
  • Received : 2011.08.22
  • Accepted : 2011.11.10
  • Published : 2011.12.01
Download PDF
⟨ Previous Next ⟩

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

References

  1. Ahuja, R., Orlin, J., and Sharma, D. (2000), Very Large-Scale Neighborhood Search, International Transactions in Operations Research, 7, 301-317. https://doi.org/10.1111/j.1475-3995.2000.tb00201.x
  2. Blazewicz, J., Lenstra, L., and Kan R. (1998), Scheduling Subject to Resource Constraints : Classification and Complexity, Discrete Mathematics, 5, 11-24.
  3. 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. https://doi.org/10.1016/S0377-2217(98)00204-5
  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. https://doi.org/10.1016/j.ins.2009.11.044
  5. 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.
  6. 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. https://doi.org/10.1016/j.ejor.2005.01.065
  7. Kolisch, R. and Sprecher, A. (1996), PSPLIB-A project scheduling library, European Journal of Operational Research, 96, 205-216.
  8. 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 https://doi.org/10.1080/0020754021000033904
  9. Tseng, L. and Chen, S. (2006), A Hybrid Metaheuristic for the Resource- Constrained Project Scheduling Problem, European Journal of Operational Research, 175, 707-721. https://doi.org/10.1016/j.ejor.2005.06.014
  10. 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. https://doi.org/10.1023/B:ANOR.0000039524.09792.c9
  11. Valls, V., Ballestin, F. and Quintanilla, S. (2005), Justification and RCPSP : A Technique that Pays, European Journal of Operational Research, 165, 375-386. https://doi.org/10.1016/j.ejor.2004.04.008
  12. 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. https://doi.org/10.1016/j.ejor.2006.12.033