A Model Suggestion for Cleaning Staff Scheduling Problem with Goal Programming Approach
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
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.
