Buradasınız

ÇAGRI ÜZERİNE İŞÇİ ÇALIŞTIRAN ORGANİZASYONLARIN TUR ÇİZELGELEME PROBLEMLERİ İÇİN KARMA TAMSAYILI PROGRAMLAMA MODELİ

Journal Name:

Publication Year:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In this paper we have studied classical tour scheduling problem by adding working with invitation dimension. We set up a mixed integer model based on the minimization of total work cost to solve this decision problem which needs the flexiblity in terms of starting hours and durations of the shifts. We have applied this model on a sample problem and commented on the solution obtained. We have formulated how many variables and restrictions take place in the model depending on the duration of the planning horizon and the size of the organization studied in practice.
Abstract (Original Language): 
Bu çalısmada, klasik tur çizelgeleme problemini çagrı üzerine çalısma boyutunu eklemek suretiyle ele aldık. Vardiya baslama saatlerinde ve uzunluklarında da esneklik gerektiren bu karar problemini çözmek için toplam isgücü maliyetinin minimize edilmesi esasına dayanan karma tamsayılı bir minimizasyon modeli kurduk. Bu modeli bir örnek problem üzerinde uyguladık ve elde ettigimiz çözümü yorumladık. Uygulamada ele alınan kurulusun büyüklügüne ve planlama ufkunun uzunluguna baglı olarak modelde ne kadar degisken ve kısıtlayıcı yer alacagını formüle bagladık.
191-215

REFERENCES

References: 

ALFARES, Hesham K.; (2004), “Survey, Categorization, and Comparison
ofRecent Tour Scheduling Literature”, Annals of Operations
Research, 127, ss.145-175.
AYKN, Turgut; (1996), “Optimal Shift Scheduling with Multiple Break
Windows”,Management Science , 42(4), ss.591-602.
BAKER, Keith.R.; (1976), “ Workforce Allocation in Cyclic Scheduling
Problems: A Survey”Operational Research Quarterly, 27, ss.155-167.
BRUSCO, Michael J. ve LarryW.JACOBS; (2000), “Optimal Models for Meal-
Break and Start-Time Flexibility in Continuous Tour Scheduling”,
Management Science, 46 (12), ss.1630-1641.
ÇEZK, Tolga; Oktay GÜNLÜK ve Hanan LUSS; (2001), “An Integer
Programming Model for the Weekly Tour Scheduling Problem”, Naval
Research Logistics, 48, ss.607-624.
DANTZIG, George B.; (1954), “ A Comment On Edie’s Traffic Delays At Tool
Booths” Operations Research, 2(3), ss.339-341.
JARRAH, AhmadI.Z.; Jonathan F. BARD ve Anura H. DESILVA; (1994)
“Solving Large-scale Tour Scheduling Problems”, Manegement
Science, 40(9), ss.1124-1144.
REKIK, Monia; Jean François CORDEAU ve François SOUMIS; (20004),
“Using Benders Decomposition to Implicittly Model Tour Scheduling”,
Annals of Operations Research, 128, ss.111-133.
MORRIS, James G. ve Michael J.SHOWALTER; (1983), “Sımple Approaches
to Shift, Days-Off and Tour Scheduling Problemsé, Management
Science, 29 (8), ss. 942-950.

Thank you for copying data from http://www.arastirmax.com