Bir Uygulama: Bir Beyaz Eşya Üretim Firmasının Boyahane Bölümünde Paralel Makineler için Sıraya Bağlı Kurulum Sürelerini içeren bir Model

Öz

Gereğinden fazla miktarda ara stok, üretimi kesintiye uğratabilmekte ve temel sorunlardan birini oluşturmaktadır. Kütle üretim yapılan hatlarda envanter sorunları ile başa çıkmanın yollarından biri, ayrıntılı bir üretim programı yapmak ve uygulamaktır. Bu çalışmada beyaz eşya sektörü firmasındaki boyahane istasyonu için seri üretim hattı olan bir firma ele alınmıştır. Boyahane istasyonu için ara stok problemlerindeki aşırı iş yükünü çözmek için sıraya bağlı kurulum sürelerine sahip bir karma tamsayı programlama modeli geliştirilmiştir. Geliştirilen model, gerçek veriler kullanarak test etmek suretiyle sözkonusu firmaya uygulanmış ve problem Genel Cebirsel Modelleme Sistemi (GAMS) CPLEX 24.1 çözücü kullanılarak çözülmüştür.

Anahtar Kelimeler

• Makine Çizelgeleme
• Karışık Tamsayı Programlama
• Sıraya Bağlı Kurulum Süreleri

An Application: A Model with Sequence Dependent Setup Times for Parallel Machines for the Die House Station in a White Goods Manufacturing Company

Abstract

Excessive buffer inventory may disrupt production and constitute one of the main problems. One of the ways of coping with the inventory problems in the mass production lines is to achieve and implement a detailed production schedule. In this study, a company with a mass production line in the white goods sector is in consideration. A mixed-integer programming model with sequence-dependent setup times has been developed to solve the excessive work in process problems for the dye house station in a white goods sector company. The developed model has been applied to the company to test the model by using real data and the problem has been solved by using the General Algebraic Modeling System (GAMS) CPLEX 24.1 solver.

Keywords

• Machine Scheduling
• Mixed Integer Programming
• Sequence Dependent Setup Times

Kaynakça

1. [1] Ahmad F., Khan SA. Module-based architecture for a periodic job-shop scheduling problem, Computers & Mathematics with Applications 2012, 64(1): 1-10.
2. [2] Demir Y., Işleyen SK. Evaluation of mathematical models for flexible job-shop scheduling problems. Applied Mathematical Modelling 2013, 37(3): 977-988.
3. [3] Baez S., Angel-Bello F., Alvarez A. Time-dependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times, IFAC-PapersOnLine 2016, 49(12): 857-862.
4. [4] Fanjul-Peyro L., Perea F., Ruiz R. Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, European Journal of Operational Research 2017, 260(2): 482-493. [5] Mundim LR., Queiroz TAD. Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem, Electronic Notes in Discrete Mathematics 2018, 66: 127–134.
5. [6] Gedik R., Kalathia D., Egilmez G., Kirac E. A constraint programming approach for solving unrelated parallel machine scheduling problem, Computers & Industrial Engineering 2018, 121: 139-149.
6. [7] Soper AJ., Strusevich VA. Schedules with a single preemption on uniform parallel machines, Discrete Applied Mathematics 2018, 261: 332-343.
7. [8] Özgüven C., Yavuz Y., Özbakır L. Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times, Applied Mathematical Modelling 2012, 36(2): 846-858.
8. [9] Ham AM., Cakici, E. Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches, Computers & Industrial Engineering 2016, 102: 160-165.

9. [10] Ham A. Flexible job shop scheduling problem for parallel batch processing machine with compatible job families, Applied Mathematical Modelling 2017, 45: 551-562.
10. [11] Seyyedi MH, Saghih AMF., Pooya A. Azimi ZN. Designing a multi-objective mathematical model for flexible job shop scheduling problem with the earliness/tardiness penalty, The Journal of Social Sciences Research 2019, 5(10): 1375-1382.