SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Fathi Amir) srt2:(2022)"

Sökning: WFRF:(Fathi Amir) > (2022)

  • Resultat 1-2 av 2
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Nourmohammadi, Amir, et al. (författare)
  • A genetic algorithm for heterogenous human-robot collaboration assembly line balancing problems
  • 2022
  • Ingår i: Procedia CIRP. - : Elsevier. - 2212-8271. ; 107, s. 1444-1448
  • Tidskriftsartikel (refereegranskat)abstract
    • Originated by a real-world case study from the automotive industry, this paper attempts to address the assembly lines balancing problem with human-robot collaboration and heterogeneous operators while optimizing the cycle time. A genetic algorithm (GA) with customized parameters and features is proposed while considering the characteristics of the problem. The computational results show that the developed GA can provide the decision-makers with efficient solutions with heterogeneous humans and robots. Furthermore, the results reveal that the cycle time is highly influenced by order of the operators’ skills, particularly when a fewer number of humans and robots exist at the stations.
  •  
2.
  • Nourmohammadi, Amir, et al. (författare)
  • Balancing and scheduling assembly lines with human-robot collaboration tasks
  • 2022
  • Ingår i: Computers & Operations Research. - : Elsevier. - 0305-0548 .- 1873-765X. ; 140, s. 1-18
  • Tidskriftsartikel (refereegranskat)abstract
    • In light of the Industry 5.0 trend towards human-centric and resilient industries, human-robot collaboration (HRC) assembly lines can be used to enhance productivity and workers’ well-being, provided that the optimal allocation of tasks and available resources can be determined. This study investigates the assembly line balancing problem (ALBP), considering HRC. This problem, abbreviated ALBP-HRC, arises in advanced manufacturing systems, where humans and collaborative robots share the same workplace and can simultaneously perform tasks in parallel or in collaboration. Driven by the need to solve the more complex assembly line-balancing problems found in the automotive industry, this study aims to address the ALBP-HRC with the cycle time and the number of operators (humans and robots) as the primary and secondary objective, respectively. In addition to the traditional ALBP constraints, the human and robot characteristics, in terms of task times, allowing multiple humans and robots at stations, and their joint/collaborative tasks are formulated into a new mixed-integer linear programming (MILP) model. A neighborhood-search simulated annealing (SA) is proposed with customized solution representation and neighborhood search operators designed to fit into the problem characteristics. Furthermore, the proposed SA features an adaptive neighborhood selection mechanism that enables the SA to utilize its exploration history to dynamically choose appropriate neighborhood operators as the search evolves. The proposed MILP and SA are implemented on real cases taken from the automotive industry where stations are designed for HRC. The computational results over different problems show that the adaptive SA produces promising solutions compared to the MILP and other swarm intelligence algorithms, namely genetic algorithm, particle swarm optimization, and artificial bee colony. The comparisons of human/robot versus HRC settings in the case study indicate significant improvement in the productivity of the assembly line when multiple humans and robots with collaborative tasks are permissible at stations.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-2 av 2
Typ av publikation
tidskriftsartikel (2)
Typ av innehåll
refereegranskat (2)
Författare/redaktör
Ng, Amos H. C., 1970 ... (2)
Nourmohammadi, Amir (2)
Fathi, Masood (2)
Mahmoodi, Ehsan (1)
Lärosäte
Högskolan i Skövde (2)
Uppsala universitet (1)
Språk
Engelska (2)
Forskningsämne (UKÄ/SCB)
Teknik (2)
År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy