상세정보
학술지
다수 자원 제약 하에서의 프로젝트 일정 계획에 관한 연구
Cited - time in 
Download 0 time
Share 
Download 0 time
Share
- 저자
- 이정훈, 김판술, 문일경
- 발행일
- 201012
- 출처
- 대한산업공학회지, v.36 no.4, pp.219-229
- ISSN
- 1225-0988
- 출판사
- 대한산업공학회
- 협약과제
- 10MC1100, 실시간 우편물류 운영기술 개발, 박종흥
- 초록
- The PERT/CPM are considered as the base procedures for the most successful project scheduling programs.Unfortunately, it is not easy to apply these procedures to real-life projects. This is due to the fact that PERT/CPM assume an infinite number of resources for each activity in project networks. Obviously, the completion time under no constraints is less than when constraints are imposed. One way of approaching this problem is to use heuristic solution techniques. In this paper, we present three heuristics; MRU (Maximum Resource Use)rule, STU (Shortest Time Use) rule, MRUP (Max Resource Use and Period) rule for allocating resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule that has been widely used in practice (Elsayed and Boucher, 1994).
- KSP 제안 키워드
- Completion Time, Heuristic rules, Heuristic solution, Project scheduling, Resource constraints, Resource use, Solution techniques, Successful project, time use