Durdu Hakan UTKU, Selin KASIMOĞLU, Gülce DEMİR, Berrak Pınar YAZ

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

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öz konusu firmaya uygulanmış ve problem Genel Cebirsel Modelleme Sistemi (GAMS) CPLEX 24,1 çözücü kullanılarak çözülmüştür. Optimal çözüm 10 saat 3 dakikada elde edilmektedir. Elde edilen çözümde 30 iş için toplam erken ve gecikmiş bitirme zamanı 4299 dakikadır.

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

Excessive buffer inventory may disrupt production and constitute one of the mainproblems. One of the ways of coping with the inventory problems in the massproduction lines is to achieve and implement a detailed production schedule. Inthis study, a company with a mass production line in the die house station of awhite goods sector is in consideration. A mixed-integer programming model withsequence-dependent setup times has been developed to solve the excessive work inprocess problems for the dye house station. The developed model has been appliedto the company to test the model by using real data and the problem has beensolved by using the General Algebraic Modeling System (GAMS) CPLEX 24,1solver. The optimal solution is obtained in 10 hours and 3 minutes. In the solution,the total earliness and tardiness time for 30 jobs is 4299 minutes.

PDF

___

[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] Demir Y., Işleyen SK. Evaluation of mathematical models for flexible job-shop scheduling problems. Applied Mathematical Modelling 2013; 37(3): 977-988.
[3] Baez S., Angel-Bello F., Alvarez A. Timedependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times, IFAC-PapersOnLine 2016; 49(12): 857-862.
[4] Fanjul-Peyro L., Perea F., Ruiz R. Models and metaheuristics 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.
[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.
[7] Soper AJ., Strusevich VA. Schedules with a single preemption on uniform parallel machines, Discrete Applied Mathematics 2018; 261: 332-343.
[8] Yepes-Borrero JC., Perea F., Ruiz R., Villa F. Bi-objective parallel machine scheduling with additional resources during setups, European Journal of Operational Research 2020 (In Press).
[9] Kramer A., Iori M., Lacomme P. Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, European Journal of Operational Research 2019; 289(3): 825-840.
[10] Chen L., Ye D., Zhang G. Parallel machine scheduling with speed-up resources, European Journal of Operational Research 2018; 268(1): 101-112.
[11] Özpeynirci S., Gökgür B., Hnich B. Parallel machine scheduling with tool loading, Applied Mathematical Modelling 2016, 40(9- 10): 5660-5671.
[12] Wan L., Ding Z., Li Y., Chen Q., Tan Z. Scheduling to minimize the maximum total completion time per machine, European Journal of Operational Research 2015, 242(1): 45-50.
[13] Jiang Y., Dong J., Ji M. Preemptive scheduling on two parallel machines with a single server, Computers & Industrial Engineering 2013; 66(2): 514-518.
[14] 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.
[15] Ö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.
[16] Ham A. Flexible job shop scheduling problem for parallel batch processing machine with compatible job families, Applied Mathematical Modelling 2017, 45: 551-562.
[17] Moradi E., Ghomi SF., Zandieh M. Biobjective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible jobshop problem, Expert Systems with Applications 2011, 38(6): 7169-7178.
[18] Özgüven C., Özbakır L., Yavuz Y. Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Applied Mathematical Modelling 2010; 34(6): 1539-1548.
[19] Fattahi P., Fallahi A. Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability, CIRP Journal of Manufacturing Science and Technology 2010, 2(2): 114-123.
[20] Fattahi P., Jolai F., Arkat J. Flexible job shop scheduling with overlapping in operations, Applied Mathematical Modelling 2009, 33(7): 3076-3087.
[21] Saidi-Mehrabad M., Fattahi P. Flexible job shop scheduling with tabu search algorithms, International Journal of Advanced Manufacturing Technology 2007; 32(5-6): 563-570.
[22] Low C., Yukling Y., Tai-His W. Modelling and heuristics of FMS scheduling with multiple objectives, Computers & Operations Research 2006, 33(3): 674-694.
[23] Gomes MC., Barbosa-Povoa AP., Novais AQ. Optimal scheduling for flexible job shop operation, International Journal of Production Research 2005; 43(11): 2323-2353.
[24] 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.