Dinamik parti büyüklüğü belirleme ve çizelgeleme problemi için bir matsezgisel geliştirilmesi ve uygulaması

Yıl 2024, Cilt: 39 Sayı: 1, 401 - 416, 21.08.2023

Burcu Kubur Özbel Adil Baykasoğlu

https://doi.org/10.17341/gazimmfd.1130887

Öz

Geleneksel kısıtlandırılmış parti büyüklüğü belirleme problemi işletmelerde sıklıkla karşılaşılan problemlerden biridir. Ancak, bu problemlerin modellenme aşamasında gerçek hayatta geçerli olabilen pek çok faktör dikkate alınmamaktadır. Bu çalışmada, sipariş üzerine kağıt/karton çanta üretimi yapan bir işletmedeki bütünleşik parti büyüklüğü belirleme ve çizelgeleme problemi modellenerek çözümlenmiştir. Problem için karışık tam sayılı programlama modeli önerilmiştir. Önerilen modelde, ürünler arası geçişlerde ve üretim periyotlarındaki hazırlık süreleri ve maliyetleri göz önünde bulundurulmuştur. Geliştirilen model, üretim maliyeti, elde tutma maliyeti, karşılanamayan talep maliyeti, dışardan satın alma maliyeti ve sıra bağımlı ürün geçişlerinin hazırlık maliyeti toplamını en küçüklemeyi hedeflemektedir. Geliştirilen modelin uygulamasıyla, üretim kaynaklarının daha verimli kullanılıp daha efektif üretim planlarının ortaya konulabileceği görülmüştür.

Anahtar Kelimeler

Bütünleşik parti büyüklüğü ve çizelgeleme problemi; Sıra bağımlı hazırlık maliyeti; Üretim planlama; Karma tamsayılı matematiksel programlama; Matsezgisel, Bütünleşik parti büyüklüğü ve çizelgeleme problemi, Sıra bağımlı hazırlık maliyeti, Üretim planlama, Karma tamsayılı matematiksel programlama

Kaynakça

• 1. Tatar T., İşletmelerde Üretim Yönetimi ve Teknikleri, A.D.M.M.A Yayınları, Ankara, 1985.
• 2. Stadtler H., ve Kilger C., Supply Chain Management And Advanced Planning. Concepts, Models, Software and Case Studies, Springer, 2008.
• 3. Bitran, G.R., ve Yanasse H.H., Computational complexity of the capacitated lot size problem, Management Science, 28(10), 1174-1186, 1982.
• 4. Carravilla M. A., ve de Sousa J.P., Hierarchical production planning in a make-to-order company: A case study, European Journal of Operational Research, 86 (1), 43-56,1995.
• 5. Zhu X., ve Wilhelm W.E., Scheduling and lot sizing with sequence-dependent setup: A literature review, IIE Transactions, 38 (11), 987-1007, 2006.
• 6. Neureuther B.D., Polak G.G., ve Sanders N.R., A hierarchical production plan for a make-to-order steel fabrication plant, Production Planning & Control, 15(3), 324-335, 2004.
• 7. Clark A.R., Neto R.M., ve Toso E.A., Multi-period production setup-sequencing and lot-sizing through ATSP subtour elimination and patching, In Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group, 80-87, December, 2006.
• 8. Wolsey L.A., Lot-sizing with production and delivery time windows, Mathematical Programming, 107(3), 471-489, 2006.
• 9. Almada-Lobo B., Klabjan D., Antónia Carravilla M., ve Oliveira J.F., Single machine multi-product capacitated lot sizing with sequence-dependent setups, International Journal of Production Research, 45(20), 4873-4894, 2007.
• 10. Li Y., Tao Y., ve Wang F., An effective approach to multi-item capacitated dynamic lot-sizing problems, International Journal of Production Research, 50(19), 5348–5362, 2012.
• 11. Chen C.S., Mestry S., Damodaran P., ve Wang C., The capacity planning problem in make-to-order enterprises, Mathematical and Computer Modelling, 50(9), 1461-1473, 2009.
• 12. Ehrenberg C., ve Zimmermann J., Simulation-based optimization in make-to-order production: scheduling for a special-purpose glass manufacturer, In Simulation Conference (WSC) Proceedings of the 2012 Winter IEEE., 1-12, December, 2012.
• 13. Gansterer M., Almeder C., Hartl R., Simulation-based optimization methods for setting production planning parameter, International Journal of Production Economics, 151, 206–213, 2013.
• 14. Chien-Chung L., Optimisation of make-to-order production for multiple-line production, South African Journal of Industrial Engineering, 24(3), 139-149, 2013.
• 15. Bruno G., Genovese A., ve Piccolo C., The capacitated lot-sizing model: a poowerful tool for logistics decision making, International Journal of Production Economics, 155, 380-390, 2014.
• 16. Ramezanian R., Saidi-Mehrabad M., ve Teimoury E., A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments, International Journal of Advanced Manufacturing Technology, 66, 347-361, 2013.
• 17. Rangel S., ve Maldonado M., Three mathematical models for a ıntegrated lot sizing and scheduling problem, Proceeding Series of the Brazilian Society of Applied and Computational Mathematics, 2 (1), 1-6, 2014.
• 18. Gansterer M., Aggregate planning and forecasting ın make-to-order production systems, International Journal of Production Economics, 170, 521–528, 2015.
• 19. Li X., Guo S., Liu Y., Du B., ve Wang L., A production planning model for make-to-order foundry flow shop with capacity constraint, Mathematical Problems in Engineering, 2017.
• 20. Ji Q., Wang Y., ve Hu X., Optimal production planning for assembly systems with uncertain capacities and random demand, European Journal of Operational Research, 253(2), 383–391, 2016.
• 21. Mula, J., Díaz-Madroñero, M., Andres, B., Poler, R., ve Sanchis, R., A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding, Applied Mathematical Modelling, 100, 805-820, 2021.
• 22. Gupta D., ve Magnusson T., The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, 32(4), 727-747, 2005.
• 23. Boschetti M., Maniezzo V., Roffilli M., Röhler A.B., Matheuristics: optimization, Simulation and Control, Blesa M., Blum C., Raidl G., Roli A., Sampels M., Springer, Berlin, 171-177, 2010.
• 24. Croce F. D., Grosso A. ve Salassa F., Matheuristics: Embedding MILP solvers into heuristic algorithms for combinatorial optimization problems, Heuristics: Theory and applications, Editör: Siarry P., Nova Science Publishera, Inc., New York, 53-68, 2013.
• 25. Koch, C., Arbaoui, T., Ouazene, Y., Yalaoui, F., De Brunier, H., Jaunet, N., ve De Wulf, A., A Matheuristic Approach for Solving a Simultaneous Lot Sizing and Scheduling Problem with Client Prioritization in Tire Industry, Computers & Industrial Engineering, 107932. 2022.
• 26. Cunha, J. O., Kramer, H. H., ve Melo, R. A., Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing, Computers & Operations Research, 104, 149-158, 2019.
• 27. Carvalho, D. M., ve Nascimento, M. C., Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, European Journal of Operational Research, 296(1), 158-173, 2022.
• 28. Kirkpatrick, S., Gelatt, Jr.C.D. ve Vecchi, M.P., Optimization by Simulated Annealing, Science, Cilt 220, No 4598, 671-680, 1983.
• 29. Tsang, H. H., ve Wiese, K. C. A study of different annealing schedules in SARNA-predict: A permutation based SA algorithm for RNA folding. International Journal of Intelligent Computing and Cybernetics, 2015.
• 30. Xing, Y., ve Wang, Y. Minimizing assembly variation in selective assembly for auto-body parts based on IGAOT. International journal of intelligent computing and cybernetics, 2018.