The Journal of the Korea Contents Association (한국콘텐츠학회논문지)

The Korea Contents Association (한국콘텐츠학회)
권호 표지
DOI QR코드

DOI QR Code

Efficient Genetic Algorithm for Resource Constrained Project Scheduling Problem

자원 제약이 있는 프로젝트 스케줄링을 위한 효율적인 유전알고리즘

  • 이상욱 (목원대학교 정보통신공학과)
  • Received : 2011.05.03
  • Accepted : 2011.06.13
  • Published : 2011.06.28
Download PDF
⟨ Previous Next ⟩

Abstract

Resource constrained project scheduling problem with multiple resource constraints as well as precedence constraints is well-known as one of the NP-hard problem. Since these problems can't be solved by the deterministic method during reasonable time, the heuristics are generally used for getting a sub-optimal during reasonable time. In this paper, we introduce an efficient genetic algorithm for resource constrained project scheduling problem using crossover which is applying schema theory and real world tournament selection strategy. Experimental results showed that the proposed algorithm is superior to conventional algorithm.

자원 제약이 있는 프로젝트 스케줄링 문제는 자원의 양은 제한되어 있고 작업들 간에 선행조건이 있는 일정계획 문제로서 NP-hard 문제 중에 하나로 알려져 있다. 이러한 문제는 결정론적인 방법을 사용해서는 주어진 시간 내에 최적해를 구하기 어렵기 때문에 근사 최적해를 빠른 시간에 구할 수 있는 휴리스틱 방법을 이용한다. 본 논문에서는 자원 제약이 있는 프로젝트 스케줄링 문제를 효율적으로 해결할 수 있는 유전알고리즘을 소개한다. 제안한 유전알고리즘은 스키마 이론을 적용한 교차 연산자와 실세계 토너먼트 선택 전략을 이용하였다. 표준 문제에 실험한 결과는 제안한 알고리즘이 기존의 알고리즘 보다 우수함을 보여주었다.

Keywords

References

  1. J. Kelley, "The critical path method: Resource planning and scheduling," In Muth, J. and G. Thompson, editors, Industrial Scheduling, pp.347-365, Prentice Hall, Englewood Cliffs, New Jersey, 1963.
  2. J. Blazewicz, "Complexity of computer scheduling algorithms under resource constraints," In Proc. First meeting AFCETSMF on Applied Mathematics, pp.169-178, 1978.
  3. R. Alvarez-Valdes and J. Tamarit, "Heuristic algorithms for resource constrained project scheduling: A review and an empirical analysis," In Slowinski, R. and J. Weglarz, editors, Advances in Project Scheduling, pp.113-134, Elsevier Science Publishers, Amsterdam, 1989.
  4. H. J. Holland, "Adaptation in Natural and Artificial Systems," University of Michigan Press, Ann Arbor, 1975.
  5. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms: part I. Representation," International Journal of Computers and Industrial Engineering, Vol.30, No.4, pp.983-997, 1996. https://doi.org/10.1016/0360-8352(96)00047-2
  6. R. Cheng and M. Gen, "Resource constrained project scheduling problem using genetic algorithms," International Journal of Intelligent Automation and Soft Computing, Vol.3, No.3, pp.273-286, 1997. https://doi.org/10.1080/10798587.1997.10750708
  7. S. Lee, S. Soak, K. Kim, H. Park, and M. Jeon, "Statistical properties analysis of real world tournament selection in genetic algorithms," Applied Intelligence, Vol.28, No2, pp.195-205, 2008(4). https://doi.org/10.1007/s10489-007-0062-2
  8. S. Hartmann, "A Competitive Genetic Algorithm for Resource-Constrained Project Scheduling," Naval research logistics, Vol.45, No.7, pp.733-750, 1998. https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C
  9. http://people.brunel.ac.uk/-mastjjb/jeb/info.html