زمان بندی پروژه با منابع محدود

نویسنده

دانشکده مهندسی، موسسه آموزش عالی عمران و توسعه، همدان، ایران

چکیده

زمان بندی پروژه با منابع محدود یک مسأله NP است. یکی از رویکردهای ابتکاری حل این مسأله استفاده از قواعد اولویت‌بندی در برنامه‌ریزی فعالیتهاست. در این مقاله یازده قاعده اولویت‌بندی را به دو شیوه سری و موازی به صورت ایستا پیاده‌سازی کرده‌ و این شیوه‌ها را با معیار تکمیل پروژه در زمان کوتاهتر، به وسیله یکصد و بیست مسأله آزمون استاندارد حاوی 30 تا 120 فعالیت، با یکدیگر مقایسه کرده‌ایم. نتایج به‌دست آمده نشان می‌دهد که اولا رویکرد موازی در به کارگیری قواعد اولویت‌بندی از رویکرد سری کارآمدتر است. ثانیا به منظور بهره جستن از کارایی بیشتر رویکرد موازی, تنها کافیست حداکثر سه قاعده اولویت‌بندی دلخواه به صورت موازی به کار گرفته شوند.برای اجرای هر فعالیت به منابع متفاوتی از قبیل زمان، سرمایه، نیروی انسانی و ... نیاز است. این منابع غالباً به دو دسته تجدیدشدنی مثل نیروی انسانی و تجدیدنشدنی مانند سرمایه تقسیم می‌شوند. هر فعالیت می‌تواند در چندین حالت مختلف مثلا به صورت دستی, نیمه مکانیزه و یا مکانیزه اجرا شود. اجرای هر حالت نیازمند نوع و میزان منابع متفاوتی است

کلیدواژه‌ها

موضوعات


عنوان مقاله [English]

Project scheduling with limited resources

نویسنده [English]

  • Kiana Ahghari
Faculty of Engineering, Higher Education and Development Institute, Hamedan, Iran
چکیده [English]

The scheduling of a project with limited resources is a matter of NP. One of the innovative approaches to solving this problem is to use prioritization rules in the planning of activities. In this article, we have implemented eleven rules of prioritization in a static and parallel way, and compared these methods with the criteria for completing the project in a shorter time period, by comparing 112 of the 130 standard test questions containing 30-120 activities. The results show that, firstly, the parallel approach to applying the rules of prioritization is more efficient than the series approach. Secondly, in order to take advantage of the more efficient parallel approach, only three arbitrary priority rules can be applied in parallel.Different resources such as time, capital, human resources, etc. are needed to carry out each activity. These resources are often divided into two types of renewable, such as human and non-renewable, such as capital. Each activity can be executed in several different modes, for example, manually, semi-mechanized or mechanized. The execution of each mode requires different types and amounts of resources

کلیدواژه‌ها [English]

  • Keywords: Project Scheduling
  • Limited Resources
  • Innovative Approaches to Problem Solving
  1. Wiest, J. D. (1963), The scheduling of large projects with limited resources.D. dissertation, Carnegie Institute of Technology.
  2. Mohring, R., Schulz, A., Stork, F., and Uetz, M. (2003), Solving project scheduling problems by minimum cut computations. Management Science, 49, 3, 330-350.
  3. Hajdu, M. (1997), Network Scheduling Techniques for Construction Project Management. Kluwer Academic Publishers.
  4. Drexl, A. and Grunewald, J. (1993), Nonpreemptive multi-mode resource constrained project scheduling. IIE Trans., 25, 74-81.
  5. Herroelen, W., De Reyck, B. and Demeulemeester, E. (1998), Resource-constrained project scheduling: A survey of recent developments. Computers Ops Res., 25, 4, 279-302.
  6. Brucker, P., Schoo, A. and Thiele, O. (1966), A branch and bound algorithm for the resource constrained project scheduling problem. European Journal of O.R., 1998, 17, 143-158.
  7. Kelly, J. E., Jr. The critical path method: Resource planning and scheduling. 21 in Industrial Scheduling, J.F. Muth and G.L. Thompson (eds.), Prentice-Hall, Englewood Cliffs, NJ, 347-365.
  8. Icmeli, O. and Rom, W. O., (1996), solving the resource-constrained project scheduling problem with optimization subroutine library. Computers and O. R., 23, 801-817.
  9. Carruthers, J. A. and Battersby, A. Advances in critical path methods. Operational Research Quarterly, 17, 359-380.
  10. Petrovic, R. (1968), Optimisation of resource allocation in project planning. Operations Research, 16, 559-586.
  11. Demeulemeester, E. and Herroelen, W. (1997), New benchmark results for the resource-constrained project scheduling problem. Management Science, 43, 1485-1492.
  12. Kolisch, R., and Hartmann, S. (2006), Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update. European Journal of Operations Research, 174, 23-37.
  13. Coelho, J. and Tavares, L. (2003), Comparative analysis of meta–heuristics for the resource constrained project scheduling problem. Technical report, Department of Civil Engineering, Instituto Superior Tecnico, Portugal.
  14. Alcaraz, J., Maroto, C. and Ruiz, R. (2004), Improving the performance of genetic algorithms for the RCPS problem. Proceedings of the Ninth International Workshop on Project Management and Scheduling, Nancy, 40–43.
  15. Tareghian, H. R., Farahi, M. H. and Moarrab, M. (2007), Solving Resource Constrained Scheduling Problem by Genetic Algorithm. Shahid Chamran Univ. Journal of Science, 16, 24-35.
  16. Nonobe, K. and Ibaraki, T. (2002), Formulation and tabu search algorithm for the resource constrained project scheduling problem. In C. C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics,. Kluwer Academic Publishers, 557–588.
  17. Valls, V., Perez, M. A. and Quintanilla, M. S. (2004), Justification and RCPSP: A technique that pays. European Journal of Operations Research, 152, 134-149.
  18. Merkle, D., Middendorf, M. and Schmeck. H. (2002), Ant colony optimization for resourceconstrained project scheduling. IEEE Transactions on Evolutionary Computation, 6, 333–346.
  19. Fleszar, K. and Hindi, K. (2004), Solving the resource–constrained project scheduling problem by a variable neighbourhood search. Euro. J. Operational Research, 155, 402–413.
  20. Debels, D., De Reyck, B., Leus, R. and Vanhoucke, M. (2006), A hybrid scatter search Electromagnetism meta–heuristic for project scheduling. European Journal of Operational Research, 169(2), 638-653.
  21. Tormos P. and Lova, A. (2003), An efficient multi-pass heuristic for project scheduling with constrained resources. International J. of Production Research, 41, 5, 1071–1086.
  22. Sprecher, A. (2002), Network decomposition techniques for resource-constrained project scheduling. Journal of the Operational Research Society, 53, 4, 405–414.
  23. Boctor, F. (1990), Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of O.R., 49, 3-13.
  24. Kolisch, R., Sprecher, A. and Drexl, A. (1995), Characterization and generation of a general class of resource-constrained project scheduling problem. Mngmt Sci., 41, 10, 1693-1703.
  25. Kolisch, R. and Sprecher. A. (1996), PSPLIB – A project scheduling problem library. European Journal of R., 96, 205-216.