Designing of an Assembly Line based on Reliability Approach
DOI:
https://doi.org/10.11121/ijocta.01.2011.0045Keywords:
Balancing loss, Reliability, Normal distribution, Optimum assembly line, Integer programmingAbstract
The problem of Assembly Line Balancing is to assign a set of tasks to an ordered sequence of workstations without violating the precedence constraints. The efficiency of the line will increase when tasks are more evenly distributed. In general, the efficiency measure(s) should be optimized subject to cycle time restriction and precedence constraints. Under the deterministic setup, efficiency of the system can be measured in various ways. Research works, reported so far, mainly deal with balancing loss as an inverse measure of efficiency. As a result, in earlier works balancing loss has been minimized subject to precedence constraints.
In case the work elements are best described in terms of stochastic time, the entire problem has to be addressed with a different measure of efficiency. Expected variance of the idle times of workstations can be viewed as an inverse measure of stability of the system. A more appropriate and direct measure could be the reliability of the system such that each workstation adheres to assigned cycle time with high chance.
The present work defines the reliability of the assembly line in terms of cycle time and distribution of the tasks times and offers an optimization formulation for the problem under precedence constraints. For demonstration purpose, one well known example in the literature has been addressed under stochastic setup.
Downloads
References
Becker, C and Scholl, A., A survey on problems and methods in generalized assembly line balancing, European Journal of Operational Research, 168, 694-715 (2006). CrossRef
Bowman, E. H., Assembly Line Balancing by Linear Programming, Operations Research, 385-389 (1960).
Hoffmann, T. R., Assembly line balancing with precedence matrix, Management Science, 9, 551-562 (1963). CrossRef
Mansoor, E. M. and Yadin, M., On the problem of assembly line balancing, Development in Operations Research, edited by B. Avi-ltzhak, Gordon and Breach, New York ( 1971).
Geoffrion, A. M., The purpose of mathematical programming is insight, not numbers, Interface, 7(1), 81-92 (1976). CrossRef
Baxey, G. M., Assembly line balancing with multiple stations, Management Science, 20, 1010-21, (1974). CrossRef
Graves, S. C. and Lamer B. W., An integer programming procedure for assembly system design problems, Operations Research, 31, 522-545 (1983). CrossRef
Sarin, S. C. and Erel, E., Development of cost model for the single-model stochastic assembly line balancing problem, International Journal of Production Research, 28(7), 1305-16 (1990). CrossRef
Berger, I., Branch-and-bound algorithms for the multi-product assembly line balancing problem, European Journal of Operations Research, 168, 694-715 (1992).
Suresh, G. and Sahu, S. Stochastic assembly line balancing using simulated annealing, International Journal of Production Research, 32 (8), 1801-1810 (1994). CrossRef
Pinnoi, A. and Wilhelm, W. E., Assembly system design: A branch and cut approach, Management Science, 44, 103-118 (1998). CrossRef
Nicosia G., Pacciarelli, D. and Pacifici, A., Optimally balancing assembly lines with different workstations, Discrete Applied Mathematics, 118, 99-113 (2002). CrossRef
Erel, E., Sabuncuoglu, I. and Sekerci, Stochastic assembly line balancing using beam search, International Journal of Production Research, 43(7), 1411-1426 (2005). CrossRef
Zhao, X., Yeung, J. H. Y. and Xie, J., Sequence-to-customer goal with stochastic demands for a mixed-model assembly line, International Journal of Production Research, 44 (24), 5279-5305 (2006). CrossRef
Bukchin, Y. and Rabinowitch, I., A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs, European Journal of Operational Research, 174, 492-508 (2006). CrossRef
Gu, L., Hennequin, S., Sava, A. and Xie, X., Assembly line balancing problem solved by estimation of distribution, Automation science and Engineering, IEEE International Conference (2007).
Agarwal, S. and Tiwari, M. K., A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem, International Journal of Production Research, 46(6), 1405-1429 (2008). CrossRef
Gamberini, R., Gebennini, E., Grassi, A. and Regattieri, A., A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem, International Journal of Production Research, 47(8), 2141-2164 (2009). CrossRef
Roy, D. and Khan, D., Integrated model for line balancing with workstation inventory management, International Journal of Industrial Engineering Computation, 1, 139-146, (2010). CrossRef
Roy, D. and Khan, D., Assembly Line Balancing to minimize Balancing Loss and System Loss, Journal of Industrial Engineering International, 6 (11), 1-5 (2010).
Wild, R., Operation Management, Thomson, London (2004).
Downloads
Published
How to Cite
Issue
Section
License
Articles published in IJOCTA are made freely available online immediately upon publication, without subscription barriers to access. All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (click here to read the full-text legal code). This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.
Under the Creative Commons Attribution 4.0 International License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited.
The readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material
- for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
under the following terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
This work is licensed under a Creative Commons Attribution 4.0 International License.
