İş yükü dengelemeli ikinci tip basit montaj hattı dengeleme problemi için bir tabu arama algoritması

Arıkan, Murat

doi:10.17341/gazimmfd.369529

Cited by 3 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Akpınar (2017) tarafından yapılan çalışmada BMHDP-2 için büyük komşuluk arama algoritması geliştirilmiştir. Geliştirilen algoritmanın performansı literatürdeki problem setleri üzerinde test edilmiştir Arıkan (2017). tarafından gerçekleştirilen çalışmada, BMHDP-2'nin çözümü için bir tabu arama algoritması önerilmiştir.…”

unclassified

Montaj Hatlarinda Yeni̇den İşleme İstasyon Pozi̇syonunun Opti̇mi̇zasyonu İçi̇n Bi̇r Karişik-Tamsayili Programlama Modeli̇

Çavdur

Kaymaz

Sebatli

2018

Uludağ University Journal of the Faculty of Engineering

View full text Add to dashboard Cite

274 the proposed model is linearized using some variable transformations. The position of the rework station affects the number of potential tasks assigned to this station depending on the precedence relationships of the tasks. In this study, the position of the rework station is optimized using the proposed model. Another factor that affects the number of potential tasks assigned to the rework station is defect rate of the assembly line. The proposed model is tested for different defect rates using some sample problems from the literature. The problems are solved to optimality and the results are analyzed.

show abstract

unclassified

Montaj Hatlarinda Yeni̇den İşleme İstasyon Pozi̇syonunun Opti̇mi̇zasyonu İçi̇n Bi̇r Karişik-Tamsayili Programlama Modeli̇

Çavdur

Kaymaz

Sebatli

2018

Uludağ University Journal of the Faculty of Engineering

View full text Add to dashboard Cite

show abstract

Montaj hatlarında üretim oranını en büyüklemek için petri ağı tabanlı bir algoritma

Kılınçcı

2019

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

A Petri net-based algorithm is presented to solve SALBP-2.  Firing sequence obtained is used as a priority rule.  According to comparison results, the presented algorithm is efficient for solving SALBP-2. In this study, a new algorithm based on Petri net is presented for simple assembly line balancing problem type-2 (SALBP-2). The presented heuristic algorithm obtains a task order using the properties of Petri net, i.e. firing rule, token movement, and token condition. Tasks are assigned to the workstations using the backward procedure and the task order as a priority rule. The heuristic is a two-stage algorithm; a feasible solution is found in the first stage, and the feasible solution is improved using binary search procedure in the second stage. Figure A. Flow chart of the presented algorithm. Purpose: The purpose of the study is to develop a new Petri-net based algorithm for solving SALBP-2. Theory and Methods: The presented algorithm is based on Petri nets which are mathematical and graphical tools used for modeling, formal analysis, and design of discrete event systems. Precedence relations in assembly line balancing problem are represented as a Petri net model. A task order is obtained using enabling rule and firing rule. Tasks are assigned to the workstations using this order. Results: The presented algorithm is coded in MATLAB and tested on well-known benchmark data set with 302 instances. The comparison studies are given between the presented heuristic algorithm and well-known priority rules, other Petri net-based algorithms, differential evolution algorithms, and genetic algorithms in the literature. Conclusion: The presented heuristic has the superior performance, especially in large assembly lines. Results show that the developed Petri net-based algorithm is efficient for solving SALBP-2.

show abstract

Multi-Objective Genetic Algorithm for the Assembly Line Worker Assignment and Balancing Problem: A Case Study in the Automotive Supply Industry

Kurada,

Deliktaş

2024

Journal of Scientific Reports-A

View full text Add to dashboard Cite

The primary challenge in assembly line design is the need for more appropriately allocating tasks and workers to workstations. This study addresses the problem of line balancing and worker assignments, considering the performance disparities among workers during the line balancing process. In the relevant literature, this problem is known as the Assembly Line Worker Assignment and Balancing (ALWAB) problem. This research examines a multi-objective ALWAB Type-2 problem, simultaneously evaluating cycle time and squared load assignment objectives. The study is conducted based on a real-life scenario in a sub-industry automotive industry that manufactures cable equipment. To solve this problem, a multi-objective genetic algorithm approach is proposed. Recognising that the selection of parameter values will influence the algorithm’s performance, parameter calibration has been performed. A full factorial experimental design and the irace method have been utilised for this purpose. The results are compared with those using parameter values utilised for similar problems in the literature. Furthermore, a sensitivity analysis has been carried out to examine the impact of various relative weight values of the objectives on the result. The results indicate that the experimental design generally yields superior results compared to other methods.

show abstract

İş yükü dengelemeli ikinci tip basit montaj hattı dengeleme problemi için bir tabu arama algoritması

Cited by 3 publications

References 29 publications

Montaj Hatlarinda Yeni̇den İşleme İstasyon Pozi̇syonunun Opti̇mi̇zasyonu İçi̇n Bi̇r Karişik-Tamsayili Programlama Modeli̇

Montaj Hatlarinda Yeni̇den İşleme İstasyon Pozi̇syonunun Opti̇mi̇zasyonu İçi̇n Bi̇r Karişik-Tamsayili Programlama Modeli̇

Montaj hatlarında üretim oranını en büyüklemek için petri ağı tabanlı bir algoritma

Multi-Objective Genetic Algorithm for the Assembly Line Worker Assignment and Balancing Problem: A Case Study in the Automotive Supply Industry

Contact Info

Product

Resources

About