DOI QR코드

DOI QR Code

A New Worker Policy for Self-Balancing Production Line with Stations

  • Received : 2011.02.25
  • Accepted : 2011.06.04
  • Published : 2011.09.01

Abstract

In traditional production lines, such as assembly lines, each worker is usually assigned to a particular fixed work, and decreasing the task to master the assigned work is valuated. However, when an imbalance exists between workers' speeds, if a worker delays the overall work in the production line, the production rate of the particular line will also decrease. To avoid this problem, the "Self-Balancing Production Line" was introduced. In this type of production line, each worker is assigned work dynamically, and when specific conditions are satisfied, production remains balanced. Characteristics of these lines that can be preempted at any place have already been analyzed by some researchers. A previous paper examined the situation in which only a single worker can process one machine and cannot preempt processing, and the improved policy of an ordinary selfbalancing production line, which specifies which stations workers can process and how workers can behave. This policy achieveda high production rate with only four stations and two workers (Buzacott, 2002). In that paper, worker processing stations and the behavior of a specific worker were limited, andthe paper focused only on specific stations and workers. Therefore, it is not applicable to any worker sequence. In this paper, we focus on other ways to decrease cycle time. In this kind of line, a worker processes at his or her speed. Therefore, if a worker is assigned stations according to his or her speed, the line can decrease cycle time. To do so, we relax the assumptions of this type of line and set a new condition. Under these conditions, we compare our results to the results of previous papers.

Keywords

References

  1. Armbruster, D. and Gel, E. S. (2006), Bucket brigades revisited: are they always effective?, Euro. J. Operational Research, 172, 213-229. https://doi.org/10.1016/j.ejor.2004.08.044
  2. Bartholdi, J. J. and Bunimovich L. A. (1999), Dynamics of two- and three-worker 'Bucket Brigade' production lines, Oper. Res., 47, 488-491. https://doi.org/10.1287/opre.47.3.488
  3. Bartholdi, J. J. and Eisenstein, D. D. (1996), A production line that balances itself, Oper. Res., 44, 21-34. https://doi.org/10.1287/opre.44.1.21
  4. Bartholdi, J. J., Eisenstein, D. D., and Foley, D. D. (2001), Performance of bucket brigades when work is stochastic, Oper. Res., 49, 488-491.
  5. Buzacott, J. A. (2002), The impact of worker difference on production system output, Int. J. Production Economics, 78, 37-44. https://doi.org/10.1016/S0925-5273(00)00086-4
  6. Hirotani, D., Morikawa, K., and Takahashi, K. (2009), Analysis of self-balancing production line with stations, non preemption and constant working speed, Proceeding of the 9th Asia-Pacific Industrial Engineering and Management System Conference, Kitakyushu, Japan, 1986-1996.
  7. Hirotani, D., Morikawa, K., and Takahashi, K. (2008), Analysis and design of self-balancing production line with large number of stations and workers, Proceeding of the 8th Asia-Pacific Industrial Engineering and Management System Conference, Bali, Indonesia, 936-943.
  8. Hirotani, D., Myreshka, Morikawa, K., Takahashi, K. (2006), Analysis and design of the self-balancing production line, Computers and Industrial Engineering, 50, 488-502. https://doi.org/10.1016/j.cie.2005.06.008
  9. McClain, J. O., Schultz K. L., and Thomas L. J. (2000), Management of worksharing systems, Manufacturing and service operations management, 2, 49-67. https://doi.org/10.1287/msom.2.1.49.23263
  10. Nakade, K., Ohno, K. (2003), Separate and carousel type allocations of workers in a U-shaped production line, Euro. J. Operational Research, 145, 403-424. https://doi.org/10.1016/S0377-2217(02)00157-1
  11. Scholl, A. (1995), Balancing and Sequencing of Assembly Lines, Physica-Verlag, Heidelberg, NY.

Cited by

  1. Design of an enhanced multi-aisle order-picking system considering storage assignments and routing heuristics vol.50, pp.None, 2011, https://doi.org/10.1016/j.rcim.2015.12.009