Belirsizlik altında kaynak kısıtlı çok modlu çoklu proje çizelgeleme

Öz

Bu makalede, faaliyet sürelerinin stokastik olması durumunda, kaynak kısıtlı çok modlu çoklu proje çizelgeleme problemi (KKÇMÇPÇP) ele alınmaktadır. Problemin amacı, öncüllük ilişkileri ve kaynak kısıtlarına bağlı olarak tüm projelere göre toplam ağırlıklı gecikmeyi en aza indirmektir. Ele alınan problem, sınırlı yenilenebilir ve yenilenemez kaynaklar ve faaliyetler için tanımlı, farklı zaman-kaynak kullanım alternatiflerini gösteren modları içerir. Bu çalışmada kaynakların paylaşılarak her bir projeye tahsis edilmesini benimseyen ve kaynak tahsis politikası olarak isimlendirilen, kaynak yönetim politikası kullanılmıştır. Problem, şans kısıtlı programlama (ŞKP) modeli olarak formüle edilmiştir. Çözüm yaklaşımının etkinliği, test problemleri üzerinde yapılan sayısal analizler ile gösterilmiştir.

Anahtar Kelimeler

• çok modlu
• Çoklu proje çizelgeleme
• Kaynak tahsisi
• Şans kısıtlı programlama
• Stokastik faaliyet süreleri

Multi-mode resource constrained multi-project scheduling under uncertainty

Öz

This paper considers the multi-mode resource constrained multi-project scheduling problem (MMRCMPSP) with stochastic activity times. The objective of the problem is to minimize the total weighted tardiness for all projects, subject to precedence and resource constraints. The problem involves limited renewable and non-renewable resources and different modes which state different time-resource alternatives for activities. Resource dedication policy is used as a resource management policy, that resources are dedicated to each project. In this study, the problem is formulated as a chance constrained programming (CCP) model. The effectiveness of the solution approach is demonstrated by computational analyses on a set of test problems.

Anahtar Kelimeler

• Multi-mode
• Multi-project scheduling
• Resource dedication
• Chance-constrained programming
• Stochastic activity duration

Kaynakça

1. Ashtiani B, Leus R ve Aryanezhad M-B (2011). New competitive results for the stochastic resource-constrained project scheduling problem: Exploring the benefits of pre-processing. Journal of Scheduling. 14(2),157-171.
2. Atalay K. D ve Apaydın A (2011). Şans kısıtlı stokastik programlama problemlerinin deterministik eşitlikleri. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi. 1(1),1-18.
3. Beşikçi U, Bilge Ü ve Ulusoy G (2013). Resource dedication problem in a multi-project environment. Flexible Services and Manufacturing Journal. 25,206–229.
4. Beşikçi U, Bilge Ü ve Ulusoy G (2015). Multi-mode resource constrained multi-project scheduling and resource portfolio problem. European Journal of Operational Research. 240,22–31. doi: https://doi.org/10.1016/j.ejor.2014.06.025.
5. Brucker P, Drexl A, Möhring R, Neumann K ve Pesch E (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research. 112,3–41. doi: https://doi.org/10.1016/S0377-2217(98)00204-5.
6. Chakrabortty RK, Sarker RA ve Essam DL (2017). Resource constrained project scheduling with uncertain activity durations. Computers and Industrial Engineering. 112,537-550. doi: https://doi.org/10.1016/j.cie.2016.12.040.
7. Charnes A ve Cooper WW (1959). Chance-constrained programming. Management Science. 6(1),73–79. doi: https://doi.org/10.1287/mnsc.6.1.73.
8. Charnes A ve Cooper WW (1962). Chance constraints and normal deviates. The American Statistical Association Journal. 57,134–148.

9. Golenko-Ginzburg D ve Gonik A (1998). A heuristic for network project scheduling with random activity durations depending on the resource allocation. International Journal on Production Economics. 55,149–162. doi: https://doi.org/10.1016/S0925-5273(98)00044-9.
10. Gonçalves JF, Mendes JJM ve Resende MGC (2008). A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research. 189,1171–1190. doi: https://doi.org/10.1016/j.ejor.2006.06.074.
11. Herroelen W ve Leus R (2015). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research. 165,289–306. doi: https://doi.org/10.1016/j.ejor.2004.04.002.
12. Ke H ve Liu B (2005). Project scheduling problem with stochastic activity duration times. Applied Mathematics and Computation. 168(1),342–353. doi: https://doi.org/10.1016/j.amc.2004.09.002.
13. Kolisch R, Sprecher A ve Drexl A (1995). Characterization and generation of a general class of resource constrained project scheduling problems. Management Science. 41(10),1693–1703. doi: https://doi.org/10.1287/mnsc.41.10.1693.
14. Kolisch R ve Sprecher A (1997). PSPLIB-a project scheduling problem library. European Journal of Operation Research. 96,205-216. doi: https://doi.org/10.1016/S0377-2217(96)00170-1.
15. Krüger D ve Scholl A (2009). A heuristic solution framework for the resource constrained (multi-) project scheduling problem with sequence-dependent transfer times. European Journal of Operational Research. 197,492-508. doi: https://doi.org/10.1016/j.ejor.2008.07.036.
16. Kurtulus IS ve Narula SC (1985). Multi-project scheduling: analysis of project performance. IIE Transactions. 17(1),58–66. doi: https://doi.org/10.1080/07408178508975272.
17. Lawrence SR ve Morton TE (1993). Resource-constrained multi-project scheduling with tardy costs: Comparing myobic, bottleneck and resource pricing heuristics. European Journal of Operational Research. 64,168-187. doi: https://doi.org/10.1016/0377-2217(93)90175-M
18. Lova A, Maroto C ve Tormos P (2000). A multicriteria heuristic method to improve resource allocation in multiproject scheduling. European Journal of Operational Research. 127,408-424. doi: https://doi.org/10.1016/S0377-2217(99)00490-7
19. Payne JH (1995). Management of multiple simultaneous projects: a state-of-the-art review. International Journal of Project Management. 13,163-168. doi: https://doi.org/10.1016/0263-7863(94)00019-9
20. Pritsker AAB, Waiters LJ ve Wolfe PM (1969). Multiproject scheduling with limited resources: a zero one programming approach. Management Science. 16,93-108. Doi: https:// doi.org/10.1287/ mnsc.16.1.93
21. Stork F (2000). Branch-and-bound algorithms for stochastic resource-constrained project scheduling. Berlin: Technische Universität Berlin. 702.
22. Tsai YW ve Gemmil DD (1998). Using tabu search to schedule activities of stochastic resource-constrained projects. European Journal of Operational Research. 111,129–141. doi: https://doi.org/10.1016/S0377-2217(97)00311-1
23. Uysal F, Işleyen SK ve Çetinkaya C (2018). Resource constrained project scheduling with stochastic resources. Journal of Applied Research on Industrial Engineering. 5(1),39-49. doi: 10.22105/jarie.2018.98906.1019
24. Wang L, Huang H ve Ke H (2015) Chance-constrained model for RCPSP with uncertain durations. Journal of Uncertainty Analysis and Applications. 3(12).
25. Yang I-T ve Chang C-Y (2005). Stochastic resource-constrained scheduling for repetitive construction projects with uncertain supply of resources and funding. International Journal of Project Management. 23,546-553. doi: https://doi.org/10.1016/j.ijproman.2005.03.003
26. Zhu G, Bard JF ve Yu G (2006). A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. Informs Journal on Computing. 18(3),377-390. doi: https://doi.org/10.1287/ijoc.1040.0121