Abstract

In most mass-production assembly lines, workers perform a set of tasks repetitively predefined by assembly line balancing techniques. The static task assignment often leads to low productivity when the assembly system faces disruptions or uncertainties such as machine breakdown and uneven worker capabilities. The idea of bucket brigades (BB) has been introduced to address the static assignment problems where cooperative behavior of ants is applied to flow line control. This paper examines possible efficiency losses associated with the existing BB-based assembly cell and presents an improved version for assembly cells under uncertain environments. The new system attempts to enhance productivity by assigning assembly tasks to workers dynamically and possibly adding buffers for decoupling consecutive workers. The proposed assembly system is evaluated through simulation experiments under various manufacturing environments. The experimental results show that the new system provides higher productivity than the naïve BB-based assembly cell as well as traditional assembly cells, especially for uncertain assembly environments.

Highlights

  • A common assembly system consists of m workers arranged along a production line

  • The results show that assigning a small number of operators to the bucket brigade (BB)-based cell is preferable

  • We examined losses caused by hand-offs and blockings in assembly the BB-based in the previous section

Read more

Summary

Introduction

A common assembly system consists of m workers (or workstations) arranged along a production line. M), a worker performs a set of assembly tasks, Sk , P repeatedly. It takes station time, t(Sk ) = j∈Sk t j to complete all the tasks assigned to workstation k where tj is the assembly time for task j The cycle time, c, of the assembly line is determined by a bottleneck station whose station time is the largest, i.e., c = maxk t(Sk ). The capacity of the assembly line is 1/c. When an assembly line is operated in a full capacity, station k with t(Sk ) < c has

Objectives
Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call