Öğrenme Etkili Tam Zamanında Çizelgeleme Problemi Ve KOBĐ’de Uygulama

Year 2009, Volume: 1 Issue: 2, 29 - 33, 15.06.2009

Mesut Cemil İşler Bilal Toklu , Veli Çelik , Süleyman Ersöz

Abstract

Bir görev veya is sürekli yapıldığı takdirde belirli bir alıskanlık ve öğrenme olur ve ilerleyen zamanlarda bu isi tamamlamak için gerekli kaynaklara olan (isgücü, malzeme, vb.) ihtiyaç azalır. Bu olgu literatürde öğrenme etkisi olarak bilinmektedir. Öğrenme etkisi üretim çizelgelemede son yıllarda çalısmalarda dikkate alınan önemli bir olgudur. Tam Zamanında Üretim (TZÜ) konusuna artan ilgiyle beraber tam zamanında çizelgeleme olarak ta nitelendirebildiğimiz Erken/Geç tamamlanma (E/G) cezalarının minimizasyonu problemi önem kazanmaya baslamıstır. Bu çalısmada öğrenme etkili tam zamanında çizelgeleme problemi bir KOBĐ için ele alınmıs ve alternatif yöntemlerle çözüm sonuçları karsılastırılarak değerlendirilmistir.

Keywords

Çizelgeleme, Akıs Tipi, E/G tamamlanma, Öğrenme etkisi, Tamsayılı programlama

Öğrenme Etkili Tam Zamanında Çizelgeleme Problemi Ve KOBĐ’de Uygulama

Abstract

When a task or work is done continuously, there will be an experience so following times needs of required resources (manpower, materials, etc.) will be reduced. This phenomenon is known as the ‘‘learning effect’’ in literature. Learning effect, which has been taken in to consideration at the production scheduling, is an important phenomenon. Minimization problem of Earliness/Tardiness (E/T) penalties, which is also known as Just in Time (JIT) scheduling, has begun to gain importance with growing interest in JIT production topic. In this study, Just-in-Time scheduling problem with learning effect has been taken up for a KOBI and alternative methods were evaluated by comparing the results with the solution.

Keywords

Scheduling, Flow-shop, Earliness/Tardiness, Learning Effect, Integer Programming

References

• 1-Yağmahan B. ve Yenisey M.M., Akıs tipi çizelgeleme problemi için KKE parametre eniyileme, ĐTÜ Dergisi, 5 (2), 133-141, 2006. 2-Biskup D., A State-Of-The-Art Review on Scheduling with Learning Effects, European Journal Of Operational Research, 188, 315-329, 2008. 3-Yelle L.E., The Learning Curve: Historical Review and Comprehensive Survey, Decision Science, 10, 302-328, 1979. 4-Biskup D., Single-Machine Scheduling with Learning Considerations, European Journal Of Operational Research, 115, 173-178, 1999. 5-Eren T. ve Güner E., Öğrenme Etkili Akıs Tipi Çizelgelemede Ortalama Akıs Zamanının En Küçüklenmesi, Gazi Ünv. Müh. Mim. Fak. Der., 19, 119-124, 2004. 6-Baker K.R., Elements of sequencing and scheduling, Dartmounth College, Hanover, 1997. 7-Toksarı M.D. and Güner E. Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, Computers&Operations Research, 36 (8), 2394-2417, 2008. 8-Lauff V. and Werner F., Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey, Mathematical and Computer Modelling, 40 (5-6), 637-655, 2004. 9-Đsler M.C., Çelik V. ve Toklu B., Đki Makine Akıs Tipi Çizelgelemede Ortak Teslim Tarihinden Mutlak Sapmaların En Küçüklenmesi, Gazi Ünv. Müh. Mim. Fak. Der., Kabul Edilmis Makale, 2009. 10-Nadler G. and Smith W.D., Manufacturing progress functions for types of of processes, International Journal of Production Research, 2, 115-135, 1963. 11-Heizer J. and Render B., Operations Management, 6th edition, Prentice-Hall, 2001. 12-Mosheiov G, Scheduling problems with a learning effect. European Journal Of Operational Research, 132, 687–693, 2001. 13-Eren T and Guner E., Minimizing total tardiness in a scheduling problem with a learning effect, Applied Mathematical Model, 31(7), 1351-1361, 2007. 14-Sakuraba C.S., Ronconi D.P. and Sourd F., Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Computers&Operations Research, 36 (1), 60-72, 2009. 15-Hino C.M., Ronconi D.P. and Mendes A.B., Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, European Journal Of Operational Research, 160, 190–201, 2005. 16-Feldmann M. and Biskup D., Single-machine scheduling for minimizing earliness and tardiness penalties by metaheuristic approaches, Computers&Industrial Engineering, 44, 307-323, 2003. 17-Lin S.W., Chou S.Y. and Ying K.C., A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date, European Journal Of Operational Research, 177, 1294–1301, 2007.