نتایج جستجو برای: assembly line balancing problem

تعداد نتایج: 1397801  

1998
PATRICK R. MCMULLEN

This paper presents a technique for comparing the results of different assembly line balancing strategies by using Data Envelopment Analysis (DEA). Initially, several heuristics— which can be thought of as assembly line balancing strategies—were used to solve seven line-balancing problems. The resulting line balance solutions provided two pieces of information that were of particular interest: ...

Journal: :J. Applied Mathematics 2013
Sükran Seker Mesut Özgürler Mehmet Tanyas

Mixed-model assembly line (MMAL) is a type of assembly line where several distinct models of a product are assembled. MMAL is applied in many industrial environments today because of its greater variety in demand. This paper considers the objective of minimizing the work overload (i.e., the line balancing problem) and station-to-station product flows. Generally, transportation time between stat...

2004
A. DOLGUI

The paper deals with a transfer line optimal desing. In contrast to the known assembly line balancing problem, for considered transfer lines, operations are grouped into blocks of parallel operations. Each block is executed by one spindle head. Spindle heads allocated to each station can be activated both sequentially and simultaneously, i.e. in a mixed order. The set of all available spindle h...

Journal: :Soft Computing 2021

Assembly lines appear with various differentiations in order to better include the disabled labor market and increase production efficiency. In this way, optimal workforce assignment problem that emerges heterogeneously is called assembly line worker balancing (ALWABP). This paper addresses ALWABP where simple version enriched by considering sequence-dependent setup times between tasks. A mixed...

Journal: :International Journal of Applied Metaheuristic Computing 2022

This paper discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The is formulated using chance-constrained programming and greedy randomized adaptive search procedure used to solve problem. In order prove efficiency proposed algorithm, 71 problems taken from well-known benchmarks are solved compared with theoretical lower bound 13 them were another appro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید