GECİKEN İŞ SAYISI VE GECİKME ARALIĞI ÖLÇÜTLÜ ZAMANA-BAĞIMLI ÖĞRENME ETKİLİ ÇİZELGELEME PROBLEMİNİN ÇÖZÜMÜ

Yıl 2012, Cilt: 27 Sayı: 4, 0 - , 19.02.2013

Tamer Eren

Öz

Çizelgeleme literatürünün çoğunda işlerin işlem zamanları sabit kabul edilmiştir. Ancak işlerin işlemzamanlarında, başlama zamanına veya pozisyonuna bağlı olarak azalma görülebilmektedir. Bu olgu literatürdeöğrenme etkisi olarak bilinmektedir. Bu çalışmada zamana-bağımlı öğrenme etkili tek makineli çizelgelemeproblemi ele alınacaktır. Ele alınan problemin amaç fonksiyonu geciken iş sayısı kısıtı altında gecikme aralığınıminimize etmektir. NP-zor yapıda olan problemi çözmek için doğrusal-olmayan programlama modeligeliştirilmiştir. Geliştirilen model örnek üzerinde uygulanmıştır.

Anahtar Kelimeler

Tek makineli çizelgeleme, iki ölçüt, zamana-bağımlı öğrenme etkisi, geciken iş sayısı, gecikme aralığı

Kaynakça

• Biskup, D. “A state-of-the-art review on
• scheduling with learning effects”, European
• Journal of Operational Research, 188(2), 315-
• , 2008.
• Biskup, D. “Single-machine scheduling with
• learning considerations”, European Journal of
• Operational Research, 115, 173-178, 1999.
• Mosheiov, G. “Scheduling problems with a
• learning effect”, European Journal of
• Operational Research, 132, 687-693, 2001.
• Moore, J.M. “An n job, one machine sequencing
• algorithm for minimizing the number of tardy
• jobs”, Management Science, 15, 102–109, 1968.
• Mosheiov G., Sidney J.B. “Note on scheduling
• with general learning curves to minimize the
• number of tardy jobs”, Journal of the
• Operational Research Society, 56, 110–112,
• -
• Eren T., “Öğrenme etkili çizelgeleme problemi:
• Geciken iş sayısı minimizasyonu”, Teknoloji
• Dergisi, 10 (4), 235-238, 2007.
• Zhao, C.L., Zhang Q.L., Tang, H.Y. “Machine
• scheduling problems with learning effects”,
• Dynamics of Continuous, Discrete and
• Impulsive Systems, Series A: Mathematical
• Analysis, 11, 741-750, 2004.
• Wu, C.C., Lee, W.C., Chen, T. “Heuristic
• algorithms for solving the maximum lateness
• scheduling problem with learning
• considerations”, Computers & Industrial
• Engineering, 52, 124-132, 2007.
• Eren, T., Güner E., “Minimizing total tardiness in
• a scheduling problem with a learning effect”,
• Applied Mathematical Modelling, 31, 1351-
• , 2007.
• Eren, T. “Hazırlık ve taşıma zamanlarının
• öğrenme etkili olduğu tek makineli çizelgeleme
• problemi: Geciken iş sayısı minimizasyonu”,
• International Journal of Engineering Research
• and Development, 6(6), 34-36, 2011.
• Kuo, W.H., Yang, D.L. “Minimizing the total
• completion time in a single machine scheduling
• problem with a time-dependent learning effect”,
• European Journal of Operational Research,
• , 1184-1190, 2006.
• Kuo, W.H., Yang, D.L. “Minimizing the
• makespan in a single machine scheduling
• problem with a time-based learning effect”,
• Information Processing Letters, 97, 64–67,
• -
• Kuo, W.H., Yang, D.L. “Single-machine group
• scheduling with a time dependent learning effect”, Computers and Operations Research,
• , 2099-2112, 2006.
• Eren T., “Minimizing the maximum lateness in a
• scheduling problem with a time-dependent
• learning effect: A non-linear programming
• model”, Journal of the Faculty of Engineering
• and Architecture of Gazi University, 23(2),
• -465, 2008.
• Sen, T., Gupta, S.K. "A Branch-and-Bound
• Procedure to solve a Bicriterion Scheduling
• Problem", IIE Transactions, 15(1), 84-88, 1983.
• Gupta, S., Sen, T. “Minimizing the Range of
• Lateness on a Single Machine”, The Journal of
• the Operational Research Society, 35(9), 853-
• , 1984.
• Tegze M., Vlach, M. “Improved Bounds for
• Range of Lateness on a Single Processor”, The
• Journal of the Operational Research Society,
• (8), 675-680, 1988.
• Sen T., Raiszadeh F.M.E., Dileepan P., “A
• Branch-and-Bound Approach to the Bicriterion
• Scheduling Problem Involving Total Flowtime
• and Range of Lateness”, Management Science,
• (2), 254-260, 1988.
• Liao C.J., Huang, R.H., “An algorithm for
• minimizing the range of lateness on a single
• machine”, The Journal of the Operational
• Research Society, 42, 183–186, 1991.
• Liao C.J., Huang, R.H., “An Algorithm for
• Minimizing the Range of Lateness on a Single
• Processor”, The Journal of the Operational
• Research Society, 42(4), 274-277, 1991.
• Huang D.C., Jing, L. “A Job Scheduling Model
• and Heuristic Algorithm for Minimizing the
• Range of Lateness and Make-span on Parallel
• processors”, Journal of Systems Science &
• Systems Engineering, 7(1), 51-56, 1998.
• Tanaka K., Vlach M., “Minimizing maximum
• absolute lateness and range of lateness under
• generalized due dates on a single machine”,
• Annals of Operations Research, 86 507–526,
• -
• GAMS 22.5 Development Corporation GAMS –
• the solver manuals, GAMS user notes,
• Washington, DC 2007, USA.