EKİP ÇİZELGELEME PROBLEMİNİN KÜME BÖLME MODELİ İLE ÇÖZÜMÜ
Airline crew costs, becoming a major economical element, has been taking attention of both operation
researchers and mathematic community and bringing them together with companies to work in cooperation for
long years. The proposed mathematical models and computer programs have the aim of cost minimization of
crew members. Crew pairing and crew assignment problems, which constitute the two phases of airline crew
scheduling and are generally considered separate, are taken as a whole in this study. The airline crew pairing
problem expressed in a set partitioning model is first solved by integer programming with MATLAB. In the
second part of the application, the results of the crew pairing solutions are used as inputs for the crew
assignment, again it’s converted to the set partitioning model and solutions are searched with integer
programming. The solutions found by using Xpress-MP are compared with the crew assignment of the firm’s
planning expert, where the study is executed. The solutions of the study propose that cost advantage can be
obtained by using the assignment plan developed in this study.
Sier, D., “Staff Scheduling and Rostering: A Review
of Applications”, Methods and Models, 153: 3-27,
 Sarucan, A., “Bir Raylı Ulaşım Sisteminde
Personel Çizelgeleme Problemine Bütünleşik
Yaklaşım”, Selçuk Üniversitesi Fen Bilimleri
Enstitüsü, Yayınlanmamış Yüksek Lisans Tezi, 1999.
 Güngör, İ., “İşgücü Maliyetlerinin
Minimizasyonu, Vardiya Planlaması, Modeller,
Algoritmalar ve Uygulamalar”, Asil Yayın Dağıtım,
 İpekçi Çetin, E., Uçuş Ekibi Planlamada
Genetik Algoritmalar Yönteminin Kullanılması,
Akdeniz Üniversitesi Sosyal Bilimler Enstitüsü,
Yayınlanmamış Doktora Tezi, 2008.
 Ulucan, A. ve Eryiğit, M., “Hava Taşımacılığı
Planlamasında Yöneylem Araştırması Modellerinin
Kullanımı”, Ankara Üniversitesi SBF Dergisi, 59(4):
 Barnhart, C. and Shenoi, R.G., “An
Approximate Model and Solution Approach for The
Long-Haul Crew Pairing Problem”, Transportation
Science, 32(3): 221-231, 1998.
 Stojkovic, M., Soumis, F. and Desrosiers, J.
“The Operational Airline Crew Scheduling Problem”,
Transportation Science, 32(3): 232-245, 1998.
 Day, P.R. and Ryan, D.M., “Flight Attendant
Rostering for Short-Haul Airline Operations”,
Operations Research, 45(5): 649-661, 1997.
 Şenöz, Ç. “Sivil Havacılık Sektöründeki Küçük
İşletmeler İçin Filo Atama Ve Tayfa Eşleştirme
Modellerinin Birleştirilerek Uygulanması”, Hacettepe
Üniversitesi Sosyal Bilimler Enstitüsü,
Yayınlanmamış Yüksek Lisans Tezi, 2005.
 Kerati, S., Moudani, W.E., Coligny, M.D. and
Mora-Camino, F., “A Heuristic Genetic Algorithm
Approach For The Airline Crew Scheduling
Problem”, Workshop on Multiple Objective
Metaheuristics, Paris, 2002.
 Moudani, El. W., Cosenza, C.A.N. and Mora-
Camino, F., “An Intelligent Approach for Solving the
Airline Crew Rostering Problem”, Computer Systems
and Applications, ACS/IEEE International
 Gopalakrishnan, B. and Johnson, E.L., “Airline
Crew Scheduling: State of The Art”, Annals of
Operations Research, 140: 305-337, 2005.
 Lohatepanont, M. and Barnhart, C., “Airline
Schedule Planning: Integrated Models and Algorithms
for Schedule Design and Fleet Assignment”,
Transportation Science, 38(1): 19-32, 2004.
 Gopalan, R. and Talluri, K.T., “Mathematical
Models In Airline Schedule Planning: A Survey”,
Annals of Operations Research, 76: 155-185, 1998.
 Gamache, M., Soumis, F., Marquis, G. and
Desrosiers, J., “A Column Generation Approach For
Large-Scale Air Crew Rostering Problems”,
Operations Research, 47(2): 247-263, 1999.
 Chu, P.C. and Beasley, A., “A Genetic
Algorithm for The Set Partitioning Problem”,
Technical Report, Imperial College, The Management
School, London, England, 1995.
 Güngör, İ. ve Eroğlu A., “Küme Örtüleme
Problemi ve Bir Uygulama”, Süleyman Demirel
Üniversitesi İktisadi ve İdari Bilimler Fakültesi
Dergisi, 2: 377-386, 1997.
The manuscript with title and authors is being submitted for publication in Journal of Aeronautics and Space Technologies. This article or a major portion of it was not published, not accepted and not submitted for publication elsewhere. If accepted for publication, I hereby grant the unlimited and all copyright privileges to Journal of Aeronautics and Space Technologies.
I declare that I am the responsible writer on behalf of all authors.