Skip to main content
Erschienen in: Memetic Computing 4/2019

18.03.2019 | Regular Research Paper

Mathematical modeling and a discrete artificial bee colony algorithm for the welding shop scheduling problem

verfasst von: Xinyu Li, Shengqiang Xiao, Cuiyu Wang, Jin Yi

Erschienen in: Memetic Computing | Ausgabe 4/2019

Einloggen

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

search-config
loading …

Abstract

The welding process which is one of the most important assembly processes is widespread in the modern manufacturing industry, including aerospace, automotive and engineering machinery. The welding shop scheduling greatly impacts the efficiency of whole production system. However, few studies on the welding shop scheduling problem (WSSP) were reported. In this paper, a mathematical model and an improved discrete artificial bee colony algorithm (DABC) are proposed for the WSSP. Firstly, it is defined where multi-machine can process one job at the same time in the WSSP. Secondly, the mathematical models of WSSP have been constructed. Thirdly, an effective DABC is proposed to solve the WSSP, considering job permutation and machine allocation simultaneously. To improve the performance of proposed DABC algorithm, the effective operators have been designed. Three instances with different scales are used to evaluate the effectiveness of proposed algorithm. The comparisons with other two algorithms including genetic algorithm and grey wolf optimizer are also provided. Experimental results show that the proposed model and algorithm achieve good performance. Finally, the proposed model and DABC algorithm are applied in a real-world girder welding shop from a crane company in China. The results show that proposed model and algorithm reduces 55.17% production time comparing with the traditional algorithm and the scheduled machine allocation provides more reasonable arrangements for workers and machine loads.

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!

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!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Velazquez K, Estrada E, Gonzalez A (2014) Statistical analysis for quality welding process: an aerospace industry case study. J Appl Sci 14(19):2285–2291CrossRef Velazquez K, Estrada E, Gonzalez A (2014) Statistical analysis for quality welding process: an aerospace industry case study. J Appl Sci 14(19):2285–2291CrossRef
2.
Zurück zum Zitat Li X, Lu C, Gao L, Xiao S, Wen L (2018) An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop. IEEE T Ind Inform 14(12):5400–5409CrossRef Li X, Lu C, Gao L, Xiao S, Wen L (2018) An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop. IEEE T Ind Inform 14(12):5400–5409CrossRef
3.
Zurück zum Zitat Mohammad R, Kobti Z (2012) A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memetic Comp 4:231–245CrossRef Mohammad R, Kobti Z (2012) A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memetic Comp 4:231–245CrossRef
4.
Zurück zum Zitat Lu C, Gao L, Li X, Xiao S (2017) A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry. Eng Appl Artif Intell 57:61–79CrossRef Lu C, Gao L, Li X, Xiao S (2017) A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry. Eng Appl Artif Intell 57:61–79CrossRef
5.
Zurück zum Zitat Lin Q, Gao L, Li X, Zhang C (2015) A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput Ind Eng 85:437–446CrossRef Lin Q, Gao L, Li X, Zhang C (2015) A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput Ind Eng 85:437–446CrossRef
6.
Zurück zum Zitat Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53:1143–1167CrossRef Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53:1143–1167CrossRef
7.
Zurück zum Zitat Pan Q, Ruiz R (2013) A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput Oper Res 40:117–128MathSciNetCrossRef Pan Q, Ruiz R (2013) A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput Oper Res 40:117–128MathSciNetCrossRef
8.
Zurück zum Zitat Li X, Ma S (2017) Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times. IEEE T Eng Manag 64(2):149–165CrossRef Li X, Ma S (2017) Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times. IEEE T Eng Manag 64(2):149–165CrossRef
9.
Zurück zum Zitat Barkaoui M (2018) A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows. Memetic Comp 10:307–319CrossRef Barkaoui M (2018) A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows. Memetic Comp 10:307–319CrossRef
10.
Zurück zum Zitat Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech Rep, Comput Eng Dept, Erciyes Univ, Kayseri, Turkey, TR06 Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech Rep, Comput Eng Dept, Erciyes Univ, Kayseri, Turkey, TR06
11.
Zurück zum Zitat Li J, Sang H, Han Y, Wang C, Gao K (2018) Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. J Clean Prod 181:584–598CrossRef Li J, Sang H, Han Y, Wang C, Gao K (2018) Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. J Clean Prod 181:584–598CrossRef
13.
Zurück zum Zitat Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 24(1):108–132MathSciNetMATH Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 24(1):108–132MathSciNetMATH
14.
Zurück zum Zitat Tasgetiren M, Pan Q, Suganthan P, Chen A (2010) A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. In: Proc IEEE congress on evolutionary computation, pp 1–8 Tasgetiren M, Pan Q, Suganthan P, Chen A (2010) A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. In: Proc IEEE congress on evolutionary computation, pp 1–8
15.
Zurück zum Zitat Bai J, Liu H (2016) Multi-objective artificial bee algorithm based on decomposition by PBI method. Appl Intell 45(4):976–991CrossRef Bai J, Liu H (2016) Multi-objective artificial bee algorithm based on decomposition by PBI method. Appl Intell 45(4):976–991CrossRef
17.
Zurück zum Zitat Gao K, Suganthan P, Pan Q, Tasgetiren M, Sadollah A (2016) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl-Based Syst 109:1–16CrossRef Gao K, Suganthan P, Pan Q, Tasgetiren M, Sadollah A (2016) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl-Based Syst 109:1–16CrossRef
18.
Zurück zum Zitat Gao K, Suganthan P, Pan Q, Chua T, Chong C, Cai T (2016) An improved artificial bee colony algorithm for multi-objective flexible job shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67CrossRef Gao K, Suganthan P, Pan Q, Chua T, Chong C, Cai T (2016) An improved artificial bee colony algorithm for multi-objective flexible job shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67CrossRef
19.
Zurück zum Zitat Gong D, Han Y, Sun J (2018) A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems. Knowl Base Syst 148:115–130CrossRef Gong D, Han Y, Sun J (2018) A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems. Knowl Base Syst 148:115–130CrossRef
20.
Zurück zum Zitat Peng K, Pan Q, Gao L, Zhang B, Pang X (2018) An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining-continuous casting process. Comput Ind Eng 122:235–250CrossRef Peng K, Pan Q, Gao L, Zhang B, Pang X (2018) An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining-continuous casting process. Comput Ind Eng 122:235–250CrossRef
21.
Zurück zum Zitat Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42:1–37CrossRef Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42:1–37CrossRef
22.
Zurück zum Zitat Mirjalili S, Mirjalili S, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61CrossRef Mirjalili S, Mirjalili S, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61CrossRef
23.
Zurück zum Zitat Brucker P (2007) Multiprocessor tasks scheduling algorithms, 5th edn. Springer-Verlag, BerlinMATH Brucker P (2007) Multiprocessor tasks scheduling algorithms, 5th edn. Springer-Verlag, BerlinMATH
24.
Zurück zum Zitat Lopes M, Carvalho J (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176:1508–1527MathSciNetCrossRef Lopes M, Carvalho J (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176:1508–1527MathSciNetCrossRef
25.
Zurück zum Zitat Kalczynski J (2007) On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA-Int J Manage S 35(1):53–60CrossRef Kalczynski J (2007) On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA-Int J Manage S 35(1):53–60CrossRef
26.
Zurück zum Zitat Tasgetiren M, Pan Q, Suganthan P, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37:6758–6779MathSciNetCrossRef Tasgetiren M, Pan Q, Suganthan P, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37:6758–6779MathSciNetCrossRef
27.
Zurück zum Zitat Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049CrossRef Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049CrossRef
28.
Zurück zum Zitat Wang R, Purshouse R, Fleming P (2013) Preference-inspired co-evolutionary algorithms for many-objective optimization. IEEE T Evolut Comput 17:474–494CrossRef Wang R, Purshouse R, Fleming P (2013) Preference-inspired co-evolutionary algorithms for many-objective optimization. IEEE T Evolut Comput 17:474–494CrossRef
29.
Zurück zum Zitat Wang R, Ishibuchi H, Zhou Z, Liao T, Zhang T (2018) Localized weighted sum method for many-objective optimization. IEEE T Evolut Comput 22:3–18CrossRef Wang R, Ishibuchi H, Zhou Z, Liao T, Zhang T (2018) Localized weighted sum method for many-objective optimization. IEEE T Evolut Comput 22:3–18CrossRef
30.
Zurück zum Zitat Li K, Wang R, Zhang T, Ishibuchi H (2018) Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access 6:26194–26214CrossRef Li K, Wang R, Zhang T, Ishibuchi H (2018) Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access 6:26194–26214CrossRef
Metadaten
Titel
Mathematical modeling and a discrete artificial bee colony algorithm for the welding shop scheduling problem
verfasst von
Xinyu Li
Shengqiang Xiao
Cuiyu Wang
Jin Yi
Publikationsdatum
18.03.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 4/2019
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-019-00283-4

Weitere Artikel der Ausgabe 4/2019

Memetic Computing 4/2019 Zur Ausgabe