Bir Metal Fabrikası İçin İş Çizelgeleme Yazılımı Hazırlanması

Year 2020, , 421 - 443, 28.06.2020

Mehmet Onur Olgun , Tuğçe Kaçar

https://doi.org/10.35193/bseufbd.589585

Abstract

In order to maintain continuity in today's
competitive environment, companies provide products and services that are
produced with higher quality and cheaper. Continuous production techniques and
production systems technology production plant has become more complex and
control of simple production activities has become more difficult. The
production planning option is capable of planning and planning the production
of the production, available, identified and required equipment, wherever and
wherever we want.

The
production scheduling problem is to determine the order in which a certain
number of jobs must be loaded on a certain number of machines. Different
scheduling options to solve production scheduling problems. The common goal of
all methods is to use all existing orders. The solution of these methods is done
with Gantt diagrams.

On
this page a work scheduling package program has been implemented in a factory
produces software, metal production. The program is C# language software and
the program is Access.

The aim of the program is to facilitate the scheduling process so that firms
can examine the charts according to different methods, make the comparison, use
the most accurate method.

Keywords

Üretim planlama, üretim çizelgeleme, Gantt şeması, Programlama

References

• Aydemir, E., 2009. Atölye Tipi Çizelgeleme Problemlerinin Öncelik Kuralı Tabanlı Genetik Algoritma Yaklaşımıyla Simülasyon Destekli Optimizasyonu. Süleyman Demirel Üniversitesi, Yüksek Lisans Tezi, Isparta.
• Sarıkaya, B., 2005. Otomotiv Yan Sanayinde Bir Üretim Çizelgeleme Probleminin İncelenmesi. Çukurova Üniversitesi, Yüksek Lisans Tezi, Adana.
• Candan, G., 2010. Esnek Üretim Çizelgeleme Probleminin Genetik Algoritma ve Bulanık Mantık Yöntemleri İle Çözülmesi. Sakarya Üniversitesi, Yüksek Lisans Tezi, Sakarya.
• Altındaş, M., 2011, Üretim Çizelgeleme ve Bir Uygulama. Bozok Üniversitesi, Yüksek Lisans Tezi, Yozgat.
• Doğan, N., 2013. Sıralamaya Bağımlı Hazırlı Sürelerinin Olduğu Permütasyonlu Akış Tipi Üretim Çizelgeleme Problemi İçin Bir NSGA-II Algoritması. Eskişehir Osmangazi Üniversitesi, Yüksek Lisans Tezi, Eskişehir.
• Eren, T., Güner, E., Tek ve Paralel Makinalı Problemlerde Çok Ölçütlü Çizelgeleme Problemleri İçin Bir Literatür Taraması
• Brucker, P. and Schile, R. (1990). Job-shop scheduling with multi-purpose machines. Journal on Computing, 45(4), 369-375.
• Paulli, J. 1995. A hierarchical approach for the FMS scheduling problem. European Journal of Operational Research, 86(1), 32-42.
• Brandimarte, P. 1993. Routing and scheduling in flexible job shops by tabu search, Annals. Operations Research, 41, 157-183.
• Mastrolilli, M. and Gambardella, LM. 1996. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling, 3, 3-20
• Bagheri, A., Zandieh, M., Mahdavi, I. and Yazdani, M. (2010). An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Computer Systems, 26, 533-541.
• Kacem, I., Hammadi, S. and Borne, P. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems Man, and Cybernetics, 2002(a), Part C, 32, 1-13.
• Pinedo, M.L. 2008. Scheduling Theory Algorithms and Systems, USA: Springer.
• Büyüksünetçi, A., 2006. Tepkin Çizelgeleme Yaklaşımının Akış Tipi Atölye Ortamında Etkinliğinin Analizi. Yüksek Lisans Tezi, Osmangazi Üniversitesi, Eskişehir.
• Tekbaş, H., 2011. Esnek sipariş tipi Üretim Sistemlerinde Müşteri Siparişlerinin Çizelgelenmesi. Doktora Tezi, İstanbul Teknik Üniversitesi, İstanbul.