nach oben

Arabian Journal for Science and Engineering

Erschienen in:

04.01.2022 | Research Article-Computer Engineering and Computer Science

Optimization of Product Switching Processes in Assembly Lines

verfasst von: Arif Gürsoy

Erschienen in: Arabian Journal for Science and Engineering | Ausgabe 8/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In industrial production, minimizing the idle time during assembly line reorganization in product switching is very important for management organizations. To increase efficiency, instead of taking the products that are expected to be produced in different and numerous varieties into the assembly line in indiscriminate order, it is necessary to schedule them in the order that requires the minimum setup time and start production in this way. In this study, the problem of minimizing machine setup time in assembly line workstations in product switching is mathematically modeled, and the problem is proved to be from the NP-hard class. In addition, 3 modified heuristic algorithms and 2 hybrid genetic algorithms are presented for the problem of product switching processes, and their performance is compared by running on 20 test problems.

Vorheriger Artikel Efficient Trajectory Formulation for Drone Sink in Wireless Sensor Networks: An Asanoha-Based Approach

Nächster Artikel Necessary Conditions for Successful Application of Intra- and Inter-class Common Vector Classifiers

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Kara, Y.; Gökçen, H.; Atasagun, Y.: Balancing parallel assembly lines with precise and fuzzy goals. Int. J. Prod. Res. (2010). https://doi.org/10.1080/00207540802534715CrossRefMATH

Gursoy, A.: An integer model and a heuristic algorithm for the flexible line balancing problem. Tekstil ve Konfeksiyon 22(1), 58–63 (2012)

Gursoy, A.; Kircali Gursoy, N.: On the flexibility constrained line balancing problem in lean manufacturing. Tekstil Ve Konfeksiyon 25(4), 345–351 (2015)

Kucukkoc, I.; Yaman, R.: A new hybrid genetic algorithm to solve more realistic mixed-model assembly line balancing problem. Int. J. Logist. Syst. Manag (2013). https://doi.org/10.1504/IJLSM.2013.052745CrossRef

Ozbakir, L.; Tapkan, P.: Bee colony intelligence in zone constrained two-sided assembly line balancing problem. Expert Syst. Appl. (2011). https://doi.org/10.1016/j.eswa.2011.03.089CrossRef

Tanenbaum, M.; Holstein, W.K.: Mass production [online]. britannica academic edition. Science and Technology. www.britannica.com/EBchecked/topic/368270/mass-production. Accessed 2012 (2012)

Kucukkoc, I.; Karaoglan, A.D.; Yaman, R.: Using response surface design to determine the optimal parameters of genetic algorithm and a case study. Int. J. Prod. Res. (2013). https://doi.org/10.1080/00207543.2013.784411CrossRef

Moreira, M.C.O.; Miralles, C.; Costa, A.M.: Model and heuristics for the assembly line worker integration and balancing problem. Comput. Oper. Res. 54, 64–73 (2015)MathSciNetCrossRef

Li, Z.; Kucukkoc, I.; Nilakantan, J.M.: Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem. Comput. Oper. Res. 84, 146–161 (2017)MathSciNetCrossRef

10.

Pereira, J.; Álvarez-Miranda, E.: An exact approach for the robust assembly line balancing problem. Omega 78, 85–98 (2018)CrossRef

11.

Zhang, Z.; Tang, Q.; Ruiz, R.; Zhang, L.: Ergonomic risk and cycle time minimization for the u-shaped worker assignment assembly line balancing problem: A multi-objective approach. Comput. Oper. Rese. 118, 104905 (2020)MathSciNetCrossRef

12.

Ocal, F.; Cogun, C.: Imalat Hatlarini Analiz Eden Bir Yazilimin Gelistirilmesi ve Denenmesi I. J. Mach. Eng. 500, 31–38 (2001)

13.

Illeez, A.: Konfeksiyon sektöründe süreç planlamasında kullanılabilecek matematiksel yöntemler. Unpublished Master’s Thesis. Ege University Natural Science Institute, Izmir (2006)

14.

Illeez, A.A.; Guner, M.: Creating a mathematical model for scheduling the entrance sequence of products in sewing cells. TEKSTIL 57, 303–309 (2008)

15.

Shen, J.; Zhu, Y.: An uncertain programming model for single machine scheduling problem with batch delivery. J. Ind. Manag. Optim. 15(2), 577 (2019)MathSciNetCrossRef

16.

Zhang, X.; Liu, S.C.; Yin, Y.; Wu, C.C.: Single-machine scheduling problems with a learning effect matrix. Iran. J. Sci. Technol. Trans. A Sci. (2018). https://doi.org/10.1007/s40995-016-0080-1MathSciNetCrossRefMATH

17.

Mellichamp, J.M.; Love, R.M.: Production switching heuristics for the aggregate planning problem. Manag. Sci. (1978). https://doi.org/10.1287/mnsc.24.12.1242CrossRefMATH

18.

Oliff, M.D.; Leong, G.K.: A discrete production switching rule for aggregate planning. Decision Sci. (1987). https://doi.org/10.1111/j.1540-5915.1987.tb01548.xCrossRef

19.

Barman, S.; Burch, E.E.: The production switching heuristic: A practical revision. Int. J. Prod. Res. (1989). https://doi.org/10.1080/00207548908942660CrossRef

20.

Hwang, H.; Cha, C.N.: An improved version of the production switching heuristic for the aggregate production planning problem. Int. J. Prod. Res. (1995). https://doi.org/10.1080/00207549508904832CrossRefMATH

21.

Nodem, F.I.D.; Kenne, J.P.; Gharbi, A.: Production planning and repair/replacement switching policy for deteriorating manufacturing systems. Int. J. Adv. Manuf. Technol. (2011). https://doi.org/10.1007/s00170-011-3327-1CrossRefMATH

22.

Chartrand, G.; Lesniak, L.; Zhang, P.: Graphs & Digraphs (2010). https://doi.org/10.1201/b19731

23.

Rosen, K.H.; Krithivasan, K.: Discrete mathematics and its applications: with combinatorics and graph theory. Tata McGraw-Hill Education, New York (2012)

24.

Bang-Jensen, J.; Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer Science & Business Media, Berlin (2008)MATH

25.

Sedgewick, R.; Wayne, K.: Algorithms. Addison-Wesley Professional, New York (2015)

26.

Matai, R.; Singh, S.; Lal, M.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Traveling Salesman Problem, Theory and Applications, pp. 1–24. InTech (2010). https://doi.org/10.5772/12909

27.

Punnen, A.P.: The traveling salesman problem: Applications, formulations and variations. In: The Traveling Salesman Problem and Its Variations, pp. 1–28. Springer (2007). https://doi.org/10.1007/0-306-48213-4_1

28.

Miller, C.E.; Zemlin, R.A.; Tucker, A.W.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) (1960). https://doi.org/10.1145/321043.321046CrossRefMATH

29.

Mo, Y.B.: The advantage of intelligent algorithms for tsp. In: Traveling Salesman Problem, Theory and Applications, pp. 25–40. InTech (2010). https://doi.org/10.5772/12897

30.

Kara, Y.; Özgüven, C.; Yalçin, N.; Atasagun, Y.: Balancing straight and u-shaped assembly lines with resource dependent task times. Int. J. Prod. Res. (2011). https://doi.org/10.1080/00207543.2010.535039CrossRef

31.

REFA: Methodenlehre des arbeitsstudiums. Datenermittlung 2, 14–undefined (1978)

32.

Chen, M.S.; Lan, C.H.: Maximal profit flow model in designing multiple-production-line system with obtainable resource capacity. Int. J. Prod. Econ. (2001). https://doi.org/10.1016/S0925-5273(00)00058-XCrossRef

33.

Garey, M.R.; Johnson, D.S.: Computers and intractability: a guide to the theory of np-completeness (series of books in the mathematical sciences). Comput. Intractab. (1979)

34.

Ani, Z.A.; Gujarathi, A.M.; Vakili-Nezhaad, G.R.; Al-Muhtaseb, A.H.: Hybridization approach towards improving the performance of evolutionary algorithm. Arab. J. Sci. Eng. 45, 11065–11086 (2020). https://doi.org/10.1007/s13369-020-04964-yCrossRef

35.

Gawanmeh, A.; Parvin, S.; Alwadi, A.: A genetic algorithmic method for scheduling optimization in cloud computing services. Arab. J. Sci. Eng. 43, 6709–6718 (2018). https://doi.org/10.1007/s13369-017-2812-8CrossRef

36.

Johnson, D.S.; McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Combin. Optim. 1, 215–310 (1997)MATH

37.

Yan, X.; Wu, Q.; Li, H.: A fast evolutionary algorithm for traveling salesman problem. In: Traveling Salesman Problem, Theory and Applications, pp. 71–80. Intech (2010). https://doi.org/10.5772/12949

38.

Gen, M.; Cheng, R.: Evolutionary network design: hybrid genetic algorithms approach. Int. J. Comput. Intell. Appl. (2003). https://doi.org/10.1142/s1469026803001075CrossRef

39.

Gen, M.: Genetic algorithms and their applications. In: Springer Handbook of Engineering Statistics, pp. 749–773. Springer, Berlin (2006)

40.

Reinelt, G.: Tsplib-a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)CrossRef

41.

Bussieck, M.R.; Meeraus, A.: General algebraic modeling system (gams). In: Modeling languages in mathematical optimization, pp. 137–157. Springer (2004)

42.

Czyzyk J.; Mesnier, M.M.: The neos server. IEEE J. Comput. Sci. Eng. 5 (1998)

Titel: Optimization of Product Switching Processes in Assembly Lines
verfasst von: Arif Gürsoy
Publikationsdatum: 04.01.2022
Verlag: Springer Berlin Heidelberg
Erschienen in: Arabian Journal for Science and Engineering / Ausgabe 8/2022
Print ISSN: 2193-567X
Elektronische ISSN: 2191-4281
DOI: https://doi.org/10.1007/s13369-021-06430-9

Premium Partner

Marktübersichten

Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.

Zur Marktübersicht

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 8/2022

Fingerprint Denoising Using Iterative Rule-Based Filter

A Multi-level Correlation-Based Feature Selection for Intrusion Detection

TR-ICANet: A Fast Unsupervised Deep-Learning-Based Scheme for Unconstrained Ear Recognition

AI-Based Mobile Edge Computing for IoT: Applications, Challenges, and Future Scope

A Distributed Data Storage Strategy Based on LOPs

A Customized PSO Model for Large-Scale Many-Objective Software Package Restructuring Problem

Premium Partner

Marktübersichten