İş paketi sürelerinin belirli olduğu kaynak kısıtlı proje planlama problemi için öncelik kuralı

Öz

Proje planlaması, projenin zamanında tamamlanabilmesi ve düzenli bir şekilde ilerleyebilmesi için proje yönetiminde büyük önem taşımaktadır. Kullanılabilecek kaynağın sınırlı olduğu Kaynak Kısıtlı Proje Planlama Problemi için yapılan çalışmalar, bütün problemler için optimum çözümü bulmada kullanılabilecek bir öncelik kuralı bulunmadığını ve öncelik kuralı seçiminin önemli olduğunu göstermektedir. Bu çalışmada iş paketleri sürelerinin belli olduğu kaynak kısıtlı proje planlama probleminin çözümü için kullanılabilecek bir öncelik kuralı önerilmektedir. Önerilen öncelik kuralı PSPLib J30, J60, J120 veri kümeleri üzerinde test edilmiş ve kaynak kullanımı ile proje süresinin büyüklüğünün beraber dikkate alınmasının optimum çözümü bulmak için önemli olduğu gösterilmiştir. Önerilen alan ve kaynak kullanımı kuralı ile elde edilen ortalama sapma değerleri seri çizelgeleme için j30’da %5.59, j60’ta %4.76, j120’de %8.37; paralel çizelgeleme içinse j30’da%3.38, j60’ta %3.08, j120’de %3.67’dir.

Anahtar Kelimeler

• Kaynak Kısıtlı Proje Planlama,Proje Yönetimi,Proje Planlama,Öncelik Kuralları,Çizelgeleme

Priority rule for resource constrained project planning problem with predetermined work package durations

Öz

Project planning has a significant role in project management to progress regularly and complete the project on time. The studies for the Resource Constrained Project Scheduling Problem, where the available resource is limited, indicate that since there is no priorities for finding the optimum solution for all problems, the choice of priority rule affect the success of planning. In this study, a priority rule that can be used to solve the resource constrained project planning problem in which work packages are determined is proposed. The proposed priority rule has been tested on the PSPLib J30, J60, J120 datasets and it has been shown that considering the size of the resource usage and project time together is important to find the optimum solution. The average deviation values ​​obtained for serial scheduling are 5.59%, 4.76%, and 8.37% for parallel scheduling are 3.38%, 3.08%, and 3.67% for j30, j60 and j120, respectively by using area and resource usage.

Anahtar Kelimeler

• Resource Constrained Project Scheduling,Project Management,Project Planning,Priority Rules,Scheduling

Kaynakça

1. Tapkan, P. Z., Özbakır L. et al., Modelling and solving railway crew rostering problem, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 33, n. 3, apr. 2018. ISSN 1304-4915.
2. Uçar U. Ü., İşleyen S. K., Solving Makeup Course Timetabling Problem (MCTP) WithMathematical Modelling: A Real Case Applicatio, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 31, n. 2, jun. 2016. ISSN 1304-4915.
3. Demir Y., Çelik C., An Integer Programming Approach For Curriculum BasedTimetabling Problem Solution, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 31, n. 1, mar. 2016. ISSN 1304-4915.
4. Ertogral K., Erkoç M., Ülker D. H., A Production Scheduling Model And Analysis For TheMaintenance Repair And Overhaul Service Providers, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 30, n. 3, Oct. 2015. ISSN 1304-4915.
5. Bektur G., Saraç T., Two parallel injection machine scheduling under crane constraint, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 31, n. 4, dec. 2016. ISSN 1304-4915.
6. Bibiks K., Hu Y. F. et al., Improved discrete cuckoo search for the resource-constrained project scheduling problem, Appl. Soft Comput. J., c. 69, ss. 493–503, 2018.
7. W. Xiao, H. Deng et al., Factored Grey Wolf Optimizer With Application, ICIC International, c. 14, no 3, ss. 881–897, 2018.
8. Gonzalez-Pardo A., Del Ser J., Camacho D., Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems, Appl. Soft Comput. J., c. 60, ss. 241–255, 2017.

9. Afshar-Nadjafi B., Basati M., Maghsoudlou H., Project scheduling for minimizing temporary availability cost of rental resources and tardiness penalty of activities, Appl. Soft Comput. J., c. 61, ss. 536–548, 2017.
10. Đumić M., Šišejković D. et al.,Evolving priority rules for resource constrained project scheduling problem with genetic programming, Futur. Gener. Comput. Syst., c. 86, ss. 211–221, 2018.
11. Jedrzejowicz P., Ratajczak-Ropel E., Reinforcement Learning strategies for A-Team solving the Resource-Constrained Project Scheduling Problem, Neurocomputing, c. 146, ss. 301–307, 2014.
12. Zheng X. L., Wang L., A multi-agent optimization algorithm for resource constrained project scheduling problem, Expert Syst. Appl., c. 42, sayı 15–16, ss. 6039–6049, 2015.
13. Coelho J., Vanhoucke M., An exact composite lower bound strategy for the resource-constrained project scheduling problem, Comput. Oper. Res., c. 93, ss. 135–150, 2018.
14. Elsayed S., Sarker R. et al., Consolidated optimization algorithm for resource-constrained project scheduling problems, Inf. Sci. (Ny)., c. 418–419, ss. 346–362, 2017.
15. Koulinas G., Kotsikas L., Anagnostopoulos K., A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem, Inf. Sci. (Ny)., c. 277, ss. 680–693, 2014.
16. Kumar N., Vidyarthi D. P., A model for resource-constrained project scheduling using adaptive PSO, Soft Comput., c. 20, no 4, ss. 1565–1580, 2016.
17. Wang Y., He Z. et al., On the performance of priority rules for the stochastic resource constrained multi-project scheduling problem, Comput. Ind. Eng., c. 114, sayı June, ss. 223–234, 2017.
18. Chen Z., Demeulemeester E. et. al, S. Bai, ve Y. Guo, Efficient priority rules for the stochastic resource-constrained project scheduling problem, Eur. J. Oper. Res., c. 270, sayı 3, ss. 957–967, 2018.
19. Eren T., Minimizing The Maximum Lateness In A Scheduling ProblemWith A Time-Dependent Learning Effect: A Non-Linear Programming Model, Journal of the Faculty of Engineering and Architecture of Gazi University, [S.l.], v. 23, n. 2, Mar. 2008. ISSN 1304-4915.
20. Chand S., Huynh Q. et al., On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems, Inf. Sci. (Ny)., c. 432, ss. 146–163, 2018.
21. Šišejkovi´c D., Evolution Of Scheduling Heuristics For The Resource Constrained, University of Zagreb, 2016.
22. PSPSolver. https://pspsolver.soft112.com/. Erişim tarihi: Mart 2019.
23. Box Stacking Problem. https://people.cs.clemson.edu/~bcdean/dp_practice/. Erişim tarihi: Mart 2019
24. PSPLib. Web Sitesi: http://www.om-db.wi.tum.de /psplib/getdata.cgi?mode=sm. Erişim tarihi: Mart 2019
25. Graphviz. Web Sitesi: http://www.graphviz.org. Erişim tarihi: Mart 2019