AN INTEGER PROGRAMMING MODEL FOR HIERARCHICAL WORKFORCE

Öz

The model presented in this paper is based on the model developed by Billionnet for the hierarchical workforce problem. In Billionnet’s Model, while determining the workers’ weekly costs, weekly working hours of workers are not taken into consideration. In our model, the weekly costs per worker are reduced in proportion to the working hours per week. Our model is illustrated on the Billionnet’s Example. The models in question are compared and evaluated on the basis of the results obtained from the example problem. A reduction is achieved in the total cost by the proposed model.

Anahtar Kelimeler

• Workforce Scheduling, Integer Programming, Hierarchical Workforce

HİYERARŞİK İŞGÜCÜ ÇİZELGELEME PROBLEMİ İÇİN TAMSAYILI PROGRAMLAMA MODELİ

Öz

Bu çalışmada sunulan model hiyerarşik işgücü çizelgeleme problemi için geliştirilmiş Billionnet Modeli’ni esas almaktadır. Billionnet Modeli’nde işçi maliyetlerinde haftalık çalışma saatleri dikkate alınmazken, önerilen modelde işçilerin haftalık maliyetleri haftalık çalışma saatlerine orantılı olarak hesaplanmıştır. Önerilen model Billionnet’nin çalışmasındaki örnek problem üzerinde uygulanmıştır. Söz konusu modellerin aynı örnek problem için elde edilmiş çözümleri karşılaştırma yapılarak değerlendirilmiştir. Önerilen model ile toplam maliyette azalma sağlanmıştır.

Anahtar Kelimeler

• İşgücü Çizelgeleme, Tamsayılı Programlama, Hiyerarşik İşgücü

Kaynakça

1. Alfares, H. K. (2000), “Dual-Based Optimization of Cyclic three-day Workweek Scheduling” , Asia-Pacific Journal of Operational Research, 17, 137-148.
2. Alfares, H. K. (2003), “Flexible 4-Day Workweek Scheduling with Weekend Work Frequency Constraints”, Computer and Industrial Engineering, 44, 325-338.
3. Billionnet, A. (1999), “Integer Programming to Schedule A Hierarchical Workforce with Variable Demands”, European Journal of Operations Research, 114, 105-114.
4. Burns, R. N., R. Narasimhan ve L. D. Smith (1998), “A Set-Processing Algorithm for Scheduling Staff on 4-Day or 3- Day Work Weeks”, Naval Research Logistics, 45, 839-853.
5. Emmons, H ve R. N. Burns (1991), “Off-Day Scheduling with Hierarchical Worker Categories”, Operations Research,39, 484-495.
6. HUNG, Rudy (1991), “Single Shift Workforce Scheduling Under A Compressed Workweek”, Omega, 19, 494-497.
7. Hung, R. (1994a), “A Multiple-Shift Workforce Scheduling Under the 3-4 Workweek with Different Weekday and Weekend Labor Requirements”, Management Science, 40, 280-284.
8. Hung, R. (1994b), “A Multiple-Shift Workforce Scheduling Model Under the 4-Day Workweek with Weekday and Weekend Labour Demands”, Journal of Operational Research Society, 45 (9), 1088-1092.

9. Narasimhan, R. (1996), “An Algorithm for Single Shift Scheduling of Hierarchical Workforce”, European Journal of Operational Research,96, 113-121.
10. Narasimhan, R. (2000), “An Algorithm for Multiple Shift Scheduling of Hierarchical Workforce on Four-Day or Three-Day Workweeks”, INFOR, 38 (1), 14-32.
11. Ulusam Seçkiner S., H. Gökçen ve M. KURT (2007), “An Integer Programming Model for Hierarchical Workforce Scheduling Problem”, European Journal of Operational Research 183, 694-699.