PARALLEL PRODUCTION LINES WITH SEQUENCE-DEPENDENT SETUP TIMES AND SIDE CONSTRAINTS

Yıl 2017, Cilt: 28 Sayı: 4, 7 - 22, 29.06.2018

Fatma Zeynep Sargut Meral Azizoğlu

Öz

We consider a scheduling problem observed in a soft-drink production facility with multiple production lines and sequence-dependent setup times. The primary objective is to obtain a weekly schedule that minimizes the total weighted unsatisfied demand. As a secondary objective we aim to minimize the total production and setup times. The number of molds and the number of shifts at any day are limited. We formulate the problem as a Mixed Integer Linear Program and propose several heuristic procedures for its solution. The results of our extensive runs have revealed the satisfactory performance of our heuristic procedures.

Anahtar Kelimeler

Scheduling, sequence-dependent setup times, heuristic

DİZİYE BAĞLI KURULUM SÜRELERİ VE YAN KISITLARI OLAN PARALEL ÜRETİM HATLARI

Öz

Çoklu üretim hatları ve diziye bağlı kurulum süreleri ile bir meşrubat üretim tesisinde gözlemlenen bir çizelgeleme problemini ele alıyoruz. Birincil hedefimiz, toplam ağırlıklı karşılanamayan talebi en aza indirecek haftalık bir program elde etmektir. İkinci bir hedef olarak, toplam üretim ve kurulum sürelerini en aza indirmeyi hedefliyoruz. Herhangi birgün de kalıp sayısı ve vardiya sayısı sınırlıdır. Problemi bir Karma Tamsayılı Doğrusal Program olarak formüle edip, çözüm için birkaç sezgisel prosedür önermekteyiz. Kapsamlı çalışmalarımızın sonucu, sezgisel prosedürlerimizin tatmin edici performansını ortaya koymuştur.

Anahtar Kelimeler

Çizelgeleme, dizi bağımlı kurulum zamanları, sezgisel

Kaynakça

• 1. Allahverdi, A. 2015. “The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs,” European Journal of Operational Research, vol. 246 (2), p. 345-378.
• 2. Araujo, S. A., Clark, A. 2013. “A priori Reformulations for Joint Rolling-Horizon Scheduling of Materials Processing and lot-Sizing Problem,” Computers Industrial Engineering, vol. 65 (4), p. 577-585.
• 3. Baldo, T. A., Santos, M. O., Almada-Lobo, B., Morabito, R. (2014). “An Optimization Approach for the Lot Sizing and Scheduling Problem in the Brewery Industry,” Computers Industrial Engineering, vol. 72, p. 58-71.
• 4. Boudhar, M., Haned, A. 2009. “Preemptive Scheduling in the Presence of Transportation Times,” Computers Operations Research, vol. 36 (8), p. 2387-2393.
• 5. Chen, J. F., Wu, T. H. 2006. Total Tardiness Minimization on Unrelated Parallel Machine Scheduling with Auxiliary Equipment Constraints,” Omega, vol. 34 (1), p. 81-89.
• 6. Clark, A., Mahdieh, M., Rangel, S. 2014. “Production Lot Sizing and Scheduling with Non-Triangular Sequence-Dependent Setup Times,” International Journal of Production Research, vol. 52 (8), p. 2490-2503.
• 7. Dhaenens-Flipo, C. 2001. “A Bicriterion Approach to deal with a Constrained Single Objective Problem,” International Journal of Production Economics, vol. 74 (1), p. 93-101.
• 8. Drexl, A., Kimms, A. 1997. “Lot Sizing and Scheduling Survey and Extensions,” European Journal of Operational Research, vol. 99 (2), p. 221-235.
• 9. Ferreira, D., Morabito, R., Rangel, S. 2009. “Solution Approaches for the Soft Drink Integrated Production Lot Sizing and Scheduling Problem,” European Journal of Operational Research, vol. 196 (2), p. 697-706.
• 10. Ferreira, D., Morabito, R., Rangel, S. 2010. “Relax and Fix Heuristics to Solve One-Stage One-Machine Lot-Scheduling Models for Small-Scale Soft Drink Plants,” Computers Operations Research, vol. 37 (4), p. 684-691.
• 11. Ferreira, D., Clark, A. R., Almada-Lobo, B., Morabito, R. 2012. “Single-Stage Formulations for Synchronized Two-Stage Lot Sizing and Scheduling in Soft Drink Production,” International Journal of Production Economics, vol. 136 (2), p. 255-265.
• 12. Freeman, N. K., Mittenthal, J., Melouk, S. H. 2014. “Parallel-Machine Scheduling to Minimize Overtime and Waste Costs,” IIE Transactions, vol. 46 (6), p. 601-618.
• 13. Gicquel, C., Minoux, M. (2015). “Multi-Product Valid Inequalities for the Discrete Lot Sizing and Scheduling Problem,” Computers Operations Research, vol. 54, p. 12-20.
• 14. Kaya, C., Sarac, T. 2013. “Plastik Enjeksiyon Makinelerinin Vardiya Bazında Çizelgelenmesi Problemi için Bir Hedef Programlama Modeli,” Endüstri Mühendisligi Dergisi, vol. 24, p. 12-26.
• 15. Maldonado, M., Rangel, S., Ferreira, D. 2014. “A Study of Different Subsequence Elimination Strategies for the Soft Drink Production Planning,” Journal of applied research and technology, vol. 12 (4), 631-641.
• 16. Meyr, H., Mann, M. 2013. “A Decomposition Approach for the General Lot Sizing and Scheduling Problem for Parallel Production Lines,” European Journal of Operational Research, vol. 229 (3), p. 718-731.
• 17. Shim, S. O., Kim, Y. D. 2008. “A Branch and Bound Algorithm for an Identical Parallel Machine Scheduling Problem with a Job Splitting Property,” Computers Operations Research, vol. 35 (3), p. 863-875.
• 18. Tahar, D. N., Yalaoui, F., Chu, C., Amodeo, L. 2006. “A Linear Programming Approach for Identical Parallel Machine Scheduling with Job Splitting and Sequence-Dependent Setup Times,” International Journal of Production Economics, vol. 99 (1), p. 63-73.
• 19. Toledo, C. F., Kimms, A., Frana, P. M., Morabito, R. 2015. “The Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem: Evaluating the Generalized Mathematical Model,” Mathematical Problems in Engineering, Article ID 182781, 18 pages.
• 20. Toledo, C. F. M., Frana, P. M., Morabito, R., Kimms, A. 2009. Multi-Population Genetic Algorithm to Solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem,” International Journal of Production Research, vol. 47 (11), p. 3097-3119.
• 21. Toledo, C. F. M., de Oliveira, L., de Freitas Pereira, R., Franca, P. M., Morabito, R. 2014. “A Genetic Algorithm/Mathematical Programming Approach to Solve a Two-Level Soft Drink Production Problem,” Computers Operations Research, vol. 48, p. 40-52.
• 22. Yalaoui, F., Chu, C. 2003. “An Efficient Heuristic Approach for Parallel Machine Scheduling with Job Splitting and Sequence-Dependent Setup Times,” IIE Transactions, vol. 35 (2), p. 183-190.