Optimizing Ideal Time in Stochastic Assembly Line Balancing through Chance-Constrained via K-means Algorithm

To tackle the assembly line balancing problem (ALBP), we present an integer mathematical formulation that integrates both the stochastic nature of task times and equipment selection by task. The proposed approach aims to optimize task allocation along the production line, considering variations in task durations and the specific equipment requirements for each task. Our main goal is to minimize the total ideal time while ensuring efficient equipment utilization and maintaining a balanced workload across workstations. We achieve this through the development of a mathematical model that assigns tasks to workstations, considering both stochastic task times and equipment needs. To address the complexity of the problem, we propose a clustering method based on K-means technique, allowing for efficient grouping of tasks based on their characteristics and equipment requirements. Through iterative improvement of task assignments, our objective is to attain a near-optimal solution that minimizes both the ideal assembly time and equipment requirements. Hence, enhancing overall production line efficiency. Initial experimentation and validation using datasets provide insights into the effectiveness of our approach, demonstrating significant improvements in efficiency and cost savings across production line operations.

Authors

Publication Details

Published
2024-10-01
DOI
https://doi.org/10.21872/2024iise_6284
Primary Topic
Assembly Line Balancing Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Ideal Time in Stochastic Assembly Line Balancing through Chance-Constrained via K-means Algorithm

Esam Alhomaidhi
1 links
Assembly Line Balancing Optimization
article

Optimizing Ideal Time in Stochastic Assembly Line Balancing through Chance-Constrained via K-means Algorithm

Esam Alhomaidhi
article en

Abstract

To tackle the assembly line balancing problem (ALBP), we present an integer mathematical formulation that integrates both the stochastic nature of task times and equipment selection by task. The proposed approach aims to optimize task allocation along the production line, considering variations in task durations and the specific equipment requirements for each task. Our main goal is to minimize the total ideal time while ensuring efficient equipment utilization and maintaining a balanced workload across workstations. We achieve this through the development of a mathematical model that assigns tasks to workstations, considering both stochastic task times and equipment needs. To address the complexity of the problem, we propose a clustering method based on K-means technique, allowing for efficient grouping of tasks based on their characteristics and equipment requirements. Through iterative improvement of task assignments, our objective is to attain a near-optimal solution that minimizes both the ideal assembly time and equipment requirements. Hence, enhancing overall production line efficiency. Initial experimentation and validation using datasets provide insights into the effectiveness of our approach, demonstrating significant improvements in efficiency and cost savings across production line operations.

Openalex Percentile: Top 55%
Assembly Line Balancing Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.