Journals / Academic Platform Journal of Engineering and Smart Systems / 2021 / Cilt: 9 - Sayı: 2

Scheduling Optimization in Automotive Supplier Industry under Sequence Dependent Constraints

Pages
378–387
Publication Date
2021-05-28
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

It has been clarified that if the developed algorithm is applied to all machines in the department, productivity and product quality will be increased by saving waste materials.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In today's production conditions, it is very important for companies to produce products that meet the determined quality standards.
📊
Key Findings & Data:The algorithm was run using data from two machines out of 18, saving 134 kg of waste materials.
💡
Conclusion & Impact:It has been clarified that if the developed algorithm is applied to all machines in the department, productivity and product quality will be increased by saving waste materials.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:sequence dependent setup time · single machine scheduling · Tabu Search

Abstract

In today's production conditions, it is very important for companies to produce products that meet the determined quality standards. In addition to the production of semi-finished products produced in plastic injection lines with high quality and efficiency, it is aimed to reduce the lost time and waste materials in production. Since automobile headlights can be in many different colors, it is necessary to keep the product quality at a high level in the transition between colors in the production made by plastic injection and to reduce the number of defective products caused by color errors. In this study, the problem of a single row-dependent machine to reduce the amount of waste that occurs between color transitions in the plastic injection line of an automotive side-industry company producing headlights is discussed. Tabu Search method, which is one of the heuristic optimization algorithms was used to solve the problem. In the solution, production sequences that will reduce the amount of waste of the products in the production program were created by using the annual data kept by the production department of the factory. The algorithm was run using data from two machines out of 18, saving 134 kg of waste materials. It has been clarified that if the developed algorithm is applied to all machines in the department, productivity and product quality will be increased by saving waste materials.

🔖

Cite This Article

MOHAMEDSALİH, M., ŞİMŞİR, F. (2021). Scheduling Optimization in Automotive Supplier Industry under Sequence Dependent Constraints. Academic Platform Journal of Engineering and Smart Systems, Cilt: 9 - Sayı: 2, 378–387. https://ajindex.com/articles/730615

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (5)

  1. T. Saraç and S. Kaya, “Plasti̇k enjeksi̇yon maki̇neleri̇ni̇n vardi̇ya bazinda çi̇zelgelenmesi̇ problemi̇ i̇çi̇n bi̇r hedef programlama modeli̇,” Journal of Industrial Engineering, vol. 24, pp. 12–26. T. Eren and E. Güner, “Sıra-Bağımlı Hazırlık Zamanlı İki Ölçütlü Çizelgeleme Problemi: Toplam Tamamlanma Zamanı Ve Maksimum Erken Bitirme,” Erciyes University Journal of Science and Technology, vol. 23, no. 1-2, pp. 95–105, 2007. T. Eren, “Learning and Deteriorating Effects on the Single Machine Scheduling Problems,” International Journal of Engineering Research and Development, vol. 6, no. 1, pp. 15–20, Jan. 2014. "Digital Conversion on the Way to Industry 4.0", Springer Science and Business Media LLC, 2021
  2. Boasberg, James, The Department of Education, Tatarstan Academy, Russian Academy, Sciences Sibirsky Trakt, Geo Quinot, Sandra Liebenberg, et al. 2019. Duke Law Journal 1 (1): 1–13. https://doi.org/10.1017/CBO9781107415324.004. Y. Zhao and G. Wang, “A dynamic differential evolution algorithm for the dynamic single-machine scheduling problem with sequence-dependent setup times Yue,” Journal of the Operational Research Society, vol. 71, no. 2, pp. 225–236, 2020. M. Settar and T. Eren, “The Single Machine Scheduling Problem with Sequence-Dependent Setup Times and a Learning Effect on Processing Times.,” Applied Soft Computing Journal, vol. 71, pp. 291–306, 2018. P. Perez-Gonzalez and J. M. Framinan, “Single machine scheduling with periodic machine availability,” Computers & Industrial Engineering, vol. 123, pp. 180–188, 2018.
  3. R. M. Souza, S. Ricardo, and M. Felizardo, “Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties,” Computers and Operations Research, vol. 81, pp. 203–215, 2017.
  4. Z. Ceylan, E. Karan, Ç. Bakırcı, and S. Sabuncu “Single Machine Scheduling Problem with Sequence Dependent Setup Times: An Application in White Goods I,” International Journal of Multidisciplinary Studies and Innovative Technologies, vol. 3, no. 1, pp. 14–21, 2019. O. Herr and A. Goel, “Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints,” European Journal of Operational Research, vol. 248, no. 1, pp. 123–135, 2016. T. Prabhakar, “A Production Scheduling Problem with Sequencing,” Management Science, vol. 21, no. 1, pp. 34–42, 2014.
  5. Cheng, T. C.E., Wen Chiung Lee, and Chin Chia Wu.“Single-Machine Scheduling with Deteriorating Jobs and Past-Sequence-Dependent Setup T