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

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

A Study on Project Scheduling under Multiple Resource Constraints

다수 자원제약 하에서의 프로젝트 일정계획에 관한 연구

  • Lee, Jeong-Hun (Postal & Logistics Technology Research Department, ETRI) ;
  • Kim, Pan-Sool (Kori Nuclear Power Site, Korea Hydro & Nuclear Power Co. LTD.) ;
  • Moon, Il-Kyeong (Department of Industrial Engineering, Pusan National University)
  • 이정훈 (한국전자통신연구원 우정물류기술연구부) ;
  • 김판술 (한국수력원자력(주) 고리원자력본부) ;
  • 문일경 (부산대학교 산업공학과)
  • Received : 2010.07.14
  • Accepted : 2010.09.10
  • Published : 2010.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

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).

Keywords

References

  1. Bedworth, D. D. (1973), Industrial Systems : Planning, Analysis, Control, The Ronald Press Company, New York.
  2. Bedworth, D. D. and Bailey, J. E. (1994), Integrated Production Control Systems : Management, Analysis, Design, 2nd edition, Prentice Hall, New York.
  3. Brooks, J. R. (1963), Algorithm for Activity Scheduling to Satisfy Constraints on Resource Availability, unpublished paper, Arizona State University.
  4. Elsayed, E. A. (1982), Algorithm for Project Scheduling with Resource Constraints, International Journal of Production Research, 20(1), 95-103. https://doi.org/10.1080/00207548208947751
  5. Elsayed, E. A. and Boucher, T. O. (1994), Analysis and Control of Production Systems, 2nd edition, Prentice Hall, New York.
  6. Elsayed, E. A. and Nasr, N. Z. (1986), Heuristic for Resource-Constrained Scheduling, International Journal of Production Research, 24(2), 299-310. https://doi.org/10.1080/00207548608919730
  7. Herroelen, W. S. (2005), Project scheduling-Theory and practice, Production and Operations Management, 14, 413-432.
  8. Khattab, M. M. and Choobineh, F. (1991), A New Approach for Project Scheduling with Limited Resource, International Journal of Production Research, 29(1), 185-198. https://doi.org/10.1080/00207549108930056
  9. Kruger, D. and Scholl, A. (2010), Managing and Modelling General Resource Transfers in (multi-)Project Scheduling, OR Spectrum, 32, 369-394. https://doi.org/10.1007/s00291-008-0144-5
  10. Kumanan, S., Jose, G. J., and Raja, K. (2006), Multi-project Scheduling using an Heuristic and a Genetic Algorithm, The International Journal of Advanced Manufacturing Technology, 31, 360-366. https://doi.org/10.1007/s00170-005-0199-2
  11. Mason, R. (1970), An Adaptation of the Brook's Algorithm for Scheduling Projects under Multiple Source Constraints, M. S. thesis, Arizona State University.
  12. Nasr, N. Z. (1983), New Algorithms for Project Scheduling under Resource Constraints, M. S. thesis, Rutgers University.
  13. Nazareth, T., Verma, S., Bhattacharya, S., and Bagchi, A. (1999), The Multiple Resource Constrained Project Scheduling Problem : A Breadth- first Approach, European Journal of Operational Research, 112, 347-366. https://doi.org/10.1016/S0377-2217(97)00402-5
  14. Whitehouse, G. E. and Brown, J. R. (1979), GENRES : An Extension of Brooks Algorithm for Project Scheduling with Resource Constraints, Computers and Industrial Engineering, 3, 262-268.