A Model Suggestion for Cleaning Staff Scheduling Problem with Goal Programming Approach

Year 2017, Volume: 7 Issue: 2, 114 - 127, 15.12.2017

Tamer Eren , Emir Hüseyin Özder , Emre Varlı

https://doi.org/10.31466/kfbd.342344

Cited By: 10

Abstract

The proper operation of cleaning personnel is
one of the major problems in public institutions. By assigning the cleaning
personnel to the most appropriate duty areas, cleaning service can be provided
in the best conceivable way. In this study, the problem of assigning the
cleaning personnel is discussed to the most appropriate places to clean. As a
place of application, a university hospital was dealt with which is serving 24
hours with a total of 58 rooms. A goal programming model has been established
for the problem that a total of 70 cleaning personnel will be scheduled for a
month. ILOG CPLEX Studio IDE Optimization program was used to solve the
mathematical model. The mathematical model has shown that the intended goals
are achieved, and better results are obtained from the existing schedule.

Keywords

Cleaning staff scheduling, Personnel assignment, Goal programming

Hedef Programlama Yaklaşımı İle Temizlik Personeli Çizelgeleme Problemi İçin Bir Model Önerisi

Abstract

Kamu sektöründe temizlik personellerinin doğru
ve uygun çalıştırılması önemli problemlerden biridir. Temizlik personelinin en
uygun görev yerlerine atanması ile temizlik hizmetinin en iyi şekilde verilmesi
sağlanabilir. Bu çalışmada personelin, temizlik yapılacak en uygun yerlere
atanması problemi ele alınmıştır. Uygulama yeri olarak 7 katlı, 58 odalı, yirmi
dört saat hizmet veren bir üniversite hastanesi ele alınmıştır. Toplamda 70
temizlik personelinin bir aylık çizelgeleneceği problem için hedef programlama
modeli kurulmuştur. Kurulan matematiksel modelin çözümünde ILOG CPLEX Studio
IDE Optimizasyon programı kullanılmıştır. Matematiksel model ile amaçlanan hedefler
gerçekleştirilmiş ve mevcut çizelgeden daha iyi sonuçlar elde edildiği gösterilmiştir.

Keywords

Personel atama, Temizlik personeli çizelgeleme, Hedef programlama

References

• Azaiez, M.N., ve Al-Sharif, S.S., (2005), A 0–1 goal programming model for nurse scheduling, Computers and Operations Research, 32, 491–507.
• Bağ, N., Özdemir, M., ve Eren, T., (2012), 0-1 Hedef Programlama ve ANP Yöntemi ile Hemşire Çizelgeleme Problemi Çözümü. International Journal of Engineering Research and Development, 1,2-6.
• Bard, J.F., Binici, C. ve De Silva, A.H., (2003), Staff scheduling at the United States Postal Service, Computers and Operations Research, 30, 745–771.
• Bektur, G. ve Hasgül, S., (2013), Kıdem seviyelerine göre işgücü çizelgeleme problemi: Hizmet sektöründe bir uygulama, Afyon Kocatepe Üniversitesi İktisadi ve İdari ve Bilimler Fakültesi Dergisi, 15, 385-402.
• Bergh, J.V., Beliën, J., Bruecker, P., Demeulemeester, E. ve Boeck, L., (2013), Personnel scheduling: A literature review, European Journal of Operations Research, 226, 367–385. Charnes, A. ve Cooper, W.W., (1977), Goal programming and multipleobjective optimizations, European Journal of Operational Research I, 39-54.
• Chu, S. C. K., (2007), Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport, European Journal of Operational Research, 177, 1764-1778.
• Corominas, A., Lusa, A., ve Pastor, R., (2004), Planning annualised hours with a finite set of weekly working hours and joint holidays, Annals of Operations Research, 128, 217-233.
• Corominas, A., Lusa, A., ve Pastor, R., (2007), Using a MILP model to establish a framework for an annualised hours agreement, European Journal of Operational Research, 177, 1495-1506.
• Çetin, E.İ., Kuruüzüm, A. ve Irmak, S., (2008), Ekip Çizelgeleme Probleminin Küme Bölme Modeli ile Çözümü, Havacılık ve Uzay Teknolojileri Dergisi, 3, 47-54.
• Dantzig, B. G., Letter to the Editor—A Comment on Edie’s Traffic Delays at Toll Booths, Operations Research, 2, 339–341, 1954.
• De Matta, R. ve Peters, E., (2009), Developing work schedules for an inter-city transit system wit hmultiple driver types and fleet types, European Journal of Operational Research, 192, 852-865.
• Edie, L. C., (1954), Traffic delays at toll booths, Operations Research, 2, 107–138.
• Ernst, A.T., Jiang, H., Krishnamoorthy, M., ve Sier, D., (2004), Staff scheduling and rostering: a review of applications, methods and models, European Journal of Operations Research, 153, 3–27.
• Fırat, M. ve Hurkens, C.A.J., (2011), An improved MIP-based approach for a multi-skill workforce scheduling problem, Journal of Scheduling, 15, 363–380.
• Güneş, A., Kahvecioğlu, A. ve Tuncel, H., (2005), Askeri nöbet çizelgelerinin genetik algoritma kullanılarak en iyilenmesi, Elektrik-Elektronik- Bilgisayar Mühendisliği 11'inci Ulusal Kongresi ve Fuarı, İstanbul, 470-474.
• Horn, M., Jiang, H.ve Kilby, P., (2007), Scheduling patrol boats and crews for the Royal Australian Navy, Journal of the Operational Research Society, 58, 1284-1293.
• Hung-Tso, L., Yen-Ting, C., Tsung-Yu, C. ve Yi-Chun, L., (2012), Crew rostering with multiple goals: an empirical study, Computers and Industrial Engineering, 63, 483–493.
• Kassa, B. A. ve Tizazu, A. E., (2013), Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels, Springer Plus, 2:333, 1-7.
• Labidi, M., Mrad, M., Gharbi, A., ve Louly, M.A., (2014), Scheduling IT Staff at a Bank: A Mathematical Programming Approach, The Scientific World Journal, Article ID 768374.
• Lezaun, M., Perez, G., ve De La Maza, E. S., (2006), Crew rostering problem in a public transport company, Journal of the Operational Research Society, 57, 1173-1179.
• Lezaun, M., Perez, G., ve De La Maza, E. S., (2007), Rostering in a rail passenger carrier, Journal of Scheduling, 10, 245-254.
• Lezaun, M., Perez, G., ve De La Maza, E. S., (2010), Staff rostering for the station personnel of a railway company, Journal of the Operational Research Society, 61, 1104-1111.
• Li, J., Burke, E.K., Curtois, T., Petrovic, S. ve Rong, Q., (2012), The falling tide algorithm: a new multi-objective approach for complex workforce scheduling, Omega, 40, 283–293.
• Louly, M.A., (2013), A goal programming model for staff scheduling at a telecommunications center, Journal of Mathematical Modelling and Algorithms in Operations Research, 12, 167-178.
• Özder, E. H., (2015), Tedarikçi seçiminde analitik ağ süreci ve hedef programlama tekniklerinin entegrasyonu: Örnek olay çalışması, Yüksek Lisans Tezi, Kırıkkale Üniversitesi, Endüstri Mühendisliği Bölümü, Yöneylem Araştırması Anabilim Dalı.
• Öztürkoğlu, Y. ve Çalışkan, F., (2014), Hemşire Çizelgelemesinde Esnek Vardiya Planlaması ve Hastane Uygulaması, Dokuz Eylül Üniversitesi Sosyal Bilimler Enstitüsü Dergisi, 16, 115-133, 2014.
• Romero, C., (2010), Extended lexicographic goal programming: A unifying approach, Omega, The International Journal of Management Science, 29: 63-71.
• Rönnberg, E. ve Larsson, T., (2010), Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study, Health Care Management Science, 13, 35-53.
• Sinreich, D. ve Jabali, O., (2007), Staggered workshifts: a way to downsize and restructure an emergency department workforce yet maintain current operational performance, Health Care Management Science, 10, 293-308.
• Sungur, B., (2008), Bir güzellik salonunun tur çizelgeleme problemi için karma tamsayılı hedef programlama modelinin geliştirilmesi, İstanbul Üniversitesi İşletme Fakültesi Dergisi, 37, 49-64.
• Şahiner M., Aktürk M. S., Ünlüsoy S., Bedir N., Varlı E., Eren T., (2017), Hemşire Çizelgeleme İçin Model Önerisi: Örnek Uygulama, Trakya Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 10 (2), 185-197.
• Tamiz, M. ve Jones, D.F., (1997), Interactive Framework For Investigation Of Goal Programming Models: Theory And Practice, Journal of Multi-Criteria Decision Analysis, 6: 52-60.
• Tamiz, M., Mirrazavi, S.K. ve Jones, D.F., (1999), Extensions of Pareto Efficiency Analysis to Integer Goal Programming, Omega, 27, (2): 179-188.
• Thompson, G. M. ve Pullman, M. E., (2007), Scheduling workforce relief breaks in advance versus in real-time, European Journal of Operational Research, 181, 139-155.
• Todovic, D., Makajic-Nikolic, D., Kostic-Stankovic, M., ve Martic, M., (2015), Police officer scheduling using goal programming, Policing: An International Journal of Police Strategies and Management, 38, 295-313.
• Topaloğlu, S., (2006), A multi-objective programming model for scheduling emergency medicine residents, Computers and Industrial Engineering, 51, 375–388.
• Trilling, L., Guinet, A., ve Le Magny, D., (2006), Nurse scheduling using integer linear programming and constraint programming, 12th IFAC International Symposium, Elsevier, 3,651-656.
• Tsai, C.C. ve. Li, S.H.A, (2009), A two-stage modeling with genetic algorithms for the nurse scheduling problem, Expert Systems with Applications, 36, 9506–9512.
• Ünal, F.M. ve Eren, T., (2016), Hedef Programlama ile Nöbet Çizelgeleme Probleminin Çözümü, Akademik Platform Mühendislik ve Fen Bilimleri Dergisi, 4 (1), 28-37.
• Varlı, E., Eren, T., Gençer, M. A., ve Çetin, S., (2016), Ankara Metrosu M1 Hattındaki Vatmanların Vardiya Saatlerinin Çizelgelenmesi, 3.Uluslararası Raylı Sistemler Mühendisliği Sempozyumu-Karabük.
• Yunes, T. H., Moura, A. V., ve De Souza, C. C., (2005), Hybrid column generation approaches for urban transit crew management problems, Transportation Science, 39, 273-288.
• Zolfaghari, S., Quan, V., El-Bouri, A. ve Khashayardoust, M., (2010), Application of a genetic algorithm to staff scheduling in retail sector, International Journal of Industrial and Systems Engineering, 5, 20–47.