Mehmet Bülent DURMUŞOĞLU, Murat BASKAK, Emre ÇEVİKCAN

2510

Paralel makinalarda ürün tasarımı özellikleri ile iş çizelgelemenin bütünleştirilmesi

İç ve dış müşteriye hızlı tepki verilmesinde hazırlık süreleri önemli etkiye sahiptir. Ayrıca, hazırlık sürelerinin düşürülmesinde, hazırlık işlerinin yok edilmesi kadar sıraya bağımlı hazırlık sürelerine sahip işlerin etkin bir şekilde çizelgelenmesi gerekir. Paralel makinelerde sıraya bağımlı hazırlık sürelerine sahip işlerin çizelgelenmesini ele alan bu makalede, iş çizelgelemesinde ürün tasarım özelliklerini dikkate alan bir sistematik sunulmuştur. Geliştirilen sistematiğin yol haritası dâhilinde sıraya bağımlı hazırlık süreleri toplamını azaltmaya yönelik olarak ürün tasarım özelliklerine bağlı bir sıralama algoritması geliştirilmiş ve ayrıca literatürde yer alan sıralama algoritmaları incelenmiştir. Geliştirilen sıralama yönteminin performansını değerlendirmek üzere, gerçek bir kablo takımı üretim sisteminin kablo kesim-sıyırma-terminalleme sürecine odaklanılmıştır. Sıralama yöntemlerinin karşılaştırılması, toplam hazırlık süresinin alt sınırdan sapması ve üretim sisteminde uygulanmış iş sıraları esas alınarak değerlendirilmiştir.

İntegrating product design characteristics and scheduling on parallel machines

Setup times have an important effect on providing quick response to the internal as well as external customers. In addition to eliminating setup activities, jobs with sequence dependent setup times should be scheduled efficiently so as to reduce setup times. In this paper, a scheduling systematic which considers product design characteristics is considered. With respect to the roadmap of the systematic, a product design characteristics oriented sequencing algorithm with the aim of decreasing the total of sequence dependent setup times is proposed and sequencing algorithms are reviewed. When evaluating the performance of sequencing methods, the cable cutting-stripping-crimping process of a real wiring harness production system is focused. Performance comparison of the sequencing algorithms are based on deviation from lower bounds for total setup time and applied job sequences.
PDF

___

  • 1. Andres, C., Albarracin, J. M., Tormo, G., Vicens, E., Garcia-Sabater, J. P. 2005. “Group Technology in a Hybrid Flowshop Environment: A Case Study,” European Journal of Operational Research, 167(5), 272-281.
  • 2. Anghinolfi, D., Paolucci, M. 2007. “Parallel Machine Total Tardiness Scheduling with a New Hybrid Metaheuristic Approach,” Computers and Operations Research, 34(2), 3471-3490.
  • 3. Anglani, A., Grieco, A., Guerriero, E., Musmanno, R. 2005. “Roboust Scheduling of Parallel Machines with Sequence-Dependent Set-Up Costs,” Europan Journal of Operational Research, 161(8), 704-720.
  • 4. Armantano, V. A. A., Filho, M. F. F. 2007. “Minimizing Total Tardiness in Parallel Machine Scheduling with Setup Times: An Adaptive Memory-Based GRASP Approach,” European Journal of Operational Research, 183(6), 100-114.
  • 5. Ashby, J. R., Uzsoy, R. 1995. “Scheduling and Order Release in a Single-Stage Production System,” Journal of Manufacturing Systems, 14 (4), 290-306.
  • 6. Balakrishnan, N., Kanet, J. J., Sridharan, S. V. 1999. “Early/Tardy Scheduling with Sequence Dependent Setups on Uniform Parallel Machines,” Computers and Operations Research, 26(7), 127-141.
  • 7. Bilge, Ü., Kıraç, F., Kurtulan, M., Pekgün, P. 2004. “A Tabu Search Algorithm for Parallel Machine Total Tardiness Problem,” Computers and Operations Research, 31(11), 397-414.
  • 8. Charles-Owaba, O. E., Lambert, B. K. 1988. “Sequence Dependent Set-Up Times and Similarity of Parts: A Mathematical Model,” IIE Transactions, 20(1), 12-21.
  • 9. Chien, C.-F., Chen, C.-H. 2000. “Using Genetic Algorithm (GA) and a Coloured Timed Petri Net (CTPN) for Modelling The Optimization-Based Schedule Generator of a Generic Production Scheduling System,” International Journal of Production Research, 45(8), 1763-1789.
  • 10. Dastidar, S. G., Nagi, R. 2005. “Scheduling Injection Molding Operations With Multiple Resource Constraints and Sequence Dependent Setup Times and Costs,” Computers and Operations Research, 32(9), 2987–3005.
  • 11. Dhaenens-Flipo, C. 2001. “A Bicriterion Approach to Deal with a Constrained Single-Objective Problem,” International Journal of Production Economics, 74(6), 93-101.
  • 12. Durmuşoğlu, M. B. 1990. “Toplam Hazırlık Sürelerini Düşürme ve Yükleme Sorununun Çözümüne Yönelik Bir Yaklaşım,” Endüstri Mühendisliği, 9, 4-17.
  • 13. Ellis, K. P., Lu, Y., Bish, E. K. 2004. “Scheduling of Wafer Test Processes in Semiconductor Manufacturing,” International Journal of Production Research, 42(2), 215-242.
  • 14. Gravel, M., Price, W. L., Gagne, C. 2000. “Scheduling Jobs in an Alcan Aluminium Foundry Using a Genetic Algorithm,” International Journal of Production Research, 38(13), 3031-3041.
  • 15. Kurz, M. E., Askin, R. G. 2001. “Heuristic Scheduling of Paralel Machines with Sequence-Dependent Set-Up Times,” International Journal of Production Research, 39(16), 3747-3769.
  • 16. Lee, Y. H., Pinedo, M. 1997. “Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times,” European Joumal of Operational Research, 100(8), 464-474.
  • 17. Mendes, A. S., Müller, S. M., França P. M., Moscato, P. 2002. “Comparing Meta-Heuristic Approaches for Parallel Machine Scheduling Problems,” Production Planning and Control, 13 (2), 143-154.
  • 18. Nessah, R., Chu, C., Yalaoui, F. 2007. “An Exact Method for Pm/sds,ri $sum^ {n} _{i=1}$ Problem,” Computers and Operations Research, 34(3) , 2840-2848.
  • 19. Omar, M. K.,. Teo, S. C. 2006. “Minimizing the Sum of Earliness/Tardiness in Identical Parallel Machines Schedule with Incompatible Job Families: An improved MIP approach,” Applied Mathematics and Computation, 181(4), 1008-1017.
  • 20. Park, Y., Kim, S., Lee, Y. H. 2000. “Scheduling Jobs on Paralel Machines Applying Neural Network and Heuristic Rules,” Computers and Industrial Engineering, 38(8), 189-202.
  • 21. Pfund, M., Fowler, J. W., Gadkari, A., Chen, Y. 2008. “Scheduling Jobs on Parallel Machines with Setup Times and Ready Times,” Computers and Industrial Engineering, 54(6), 764-782.
  • 22. Radhakrishnan, S., Ventura, A. 2000. “Simulated Annealing for Parallel Machine Scheduling with Earliness-Tardiness Penalties and Sequence-Dependent Set-Up Times,” International Journal of Production Research, 38 (10), 2233-2252.
  • 23. Rocha, P. L., Ravetti., M. G., Mateus, G. R., Pardalos P. M. 2008. “Exact Algorithms for a Scheduling Problem with Unrelated Parallel Machines and Sequence and Machine-Dependent Setup Times,” Computers and Operations Research, 35(3), 1250-1264.
  • 24. Saraç, T., Sipahioğlu, A. 2008. “Plastik Enjeksiyon Makinelerinın Çizelgelenmesi Problemi,” Endüstri Mühendisliği, 20(2), 2-14.
  • 25. Sivrikaya-Şerifoğlu, F.,Ulusoy, G. 1999. “Parallel Machine Scheduling with Earliness and Tardiness Penalties,” Computers and Operations Research, 26(5), 773-787.
  • 26. Tahar, D. N., Yalaoui, F.,Chu, C., Amodeo, A. 2006. “A Linear Programming Approach For Identical Parallel Machine Scheduling with Job Splitting and Sequence Dependent Setup Times,” International Journal of Production Economics, 99(8), 63-73.
  • 27. Tang, L., Liu, J., Rong, A.,Yang, Z. 2000. “A Multiple Traveling Salesman Problem Model for Hot Rolling Scheduling in Shanghai Baoshan Iron and Steel Complex,” European Journal of Operational Research, 124(2), 267-282.
  • 28. Tucci, M., Rinaldi, R. 1999. “From Theory to Application: Tabu Search in Textile Production Scheduling,” Production Planning and Control, 10 (4), 365-374.
  • 29. Weng, M. X., Lu, J., Ren, H. 2001. “Unrelated Parallel Machine Scheduling with Setup Consideration and a Total Weighted Completion Time Objective,” International Journal of Production Economics, 70(7), 215-226.
  • 30. Yalaoui, F., Chu, C. 2003. “An Efficient Heuristic Approach for Parallel Machine Scheduling with Job Splitting and Sequence Dependent Set-Up Times,” IEE Transactions, 35(3), 183-19.
Endüstri Mühendisliği-Cover
  • ISSN: 1300-3410
  • Yayın Aralığı: Yılda 3 Sayı
  • Başlangıç: 1989
  • Yayıncı: TMMOB MAKİNA MÜHENDİSLERİ ODASI
Arşiv
Sayıdaki Diğer Makaleler

Paralel makinalarda ürün tasarımı özellikleri ile iş çizelgelemenin bütünleştirilmesi

Mehmet Bülent DURMUŞOĞLU, Murat BASKAK, Emre ÇEVİKCAN

İstanbul’da itfaiye istasyonu yerlerinin seçimi için yeni bir model

Özay ÖZAYDIN, Emel AKTAŞ, Füsun ÜLENGİN, Şule ÖNSEL, Berrin AĞARAN

Sıra bağımlı hazırlık süreli iki ölçütlü tek makine çizelgeleme problemi için sezgisel bir çözüm yöntemi

Feriştah ÖZÇELİK, Tuğba SARAÇ

Belediye hizmetlerinin maliyet etkinliklerinin değerlendirilmesi: Eskişehir Odunpazarı Belediyesinde bir uygulama

Nuray GİRGİNER, Zeliha KAYGISIZ