CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Expert System based on RPW Technique to Evaluating Multi Product Assembly Line Balancing Solution

by Ashish Manoria, Sandip Kumar Mishra, Sachin Maheshwar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 4
Year of Publication: 2012
Authors: Ashish Manoria, Sandip Kumar Mishra, Sachin Maheshwar
10.5120/5034-7185

Ashish Manoria, Sandip Kumar Mishra, Sachin Maheshwar . Expert System based on RPW Technique to Evaluating Multi Product Assembly Line Balancing Solution. International Journal of Computer Applications. 40, 4 ( February 2012), 27-32. DOI=10.5120/5034-7185

@article{ 10.5120/5034-7185,
author = { Ashish Manoria, Sandip Kumar Mishra, Sachin Maheshwar },
title = { Expert System based on RPW Technique to Evaluating Multi Product Assembly Line Balancing Solution },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 40 },
number = { 4 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 27-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number4/5034-7185/ },
doi = { 10.5120/5034-7185 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:27:12.405452+05:30
%A Ashish Manoria
%A Sandip Kumar Mishra
%A Sachin Maheshwar
%T Expert System based on RPW Technique to Evaluating Multi Product Assembly Line Balancing Solution
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 4
%P 27-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The traditional assembly line balancing problem considers the manufacturing process of a product where production is specified in terms of a sequence of tasks that need to be assigned to workstations. Each task takes a known number of time units to complete. Also, precedence constraints exist among tasks: each task can be assigned to a station only after all its predecessors have been assigned to stations. The assembly line balancing problem arises and has to be solved when an assembly line has to be configured or redesigned. It consists of distributing the total work load for manufacturing any unit of the product to be assembled among the workstations along the line. In this paper Rank positional weight method for Type I of the Simple Assembly Line Balancing Problem (SALB P) and multi product assembly line balancing problem (MALBP) for the hybrid system are described. Type I of SALBP (SALBP-1) and MALBP consist of assigning tasks to work stations such that the number of stations is minimized for a given production rate and cycle time. In this paper, the problem is motivated by a vehicle-sequencing problem at a North India Automobile truck assembly plant. The programmed is coded in C# (C sharp). In this problem, precedence constraints between the tasks have to be considered.

References
  1. Kusiak A (2000) Computational intelligence in design and manufacturing. Wiley, New York
  2. Daudin, M (2002). Lean assembly: The nuts and bolts of making assembly operations flow. Productivity, New York.
  3. Evans, J.R, (1983), Applied production and Operations Management, West Publishing, New York, 301-330 Jersey, 419-424.
  4. Boysen, N.Fliedner, M., 2006. A versatile algorithm for assembly line balancing. Working paper, University of Hamburg, German.
  5. Bukchin, J., Masin, m., 2004. Multi-objective design of team oriented assembly systems. European journal of Operational Research 156,326-352.
  6. Bukchin , Y., Meller, R.D., 2005. A space allocation algorithm for assembly line components. IIE Transactions 37,51-61.
  7. Amen M., “Cost-oriented assembly line balancing:Model formulations, solution difficulty, upper and lower bounds.” European journal of Operational Research 168, 2006, pp 747-770.
  8. Kilbridge Maurice D. and wester L. Operations research, vol. 10, No.5 (sep-oct., 1962), pp. 626-638.
  9. Moodie, C. L., and H.H Young. (1965). “A Heuristic Method of Assembly Line Balancing for Assumptions of Constant or Variable Work Element Times”. Industrial Engineering 16, 23-29.
  10. Aase G.R., Olson J.R., Schniederjans M.J.,”U-shaped assembly line layouts and their impact on labour productivity: An Experimental study.” European Journal of Operational Research, 156, 2004, pp 698-711.
  11. Baykasoglu, A ., Ozbakir, L., 2006. Stochastic U-line balancing using genetic algorithms. International journal of Advanced Manufacturing technology, doi: 10.1007/s0017-005-0322-4.
  12. Baybars, I. (1986): “A survey of exact algorithms for the simple assembly line balancing problem”. Management Science, Vol. 32, No. 8, pp. 909-932.
  13. Boctor, F.F. (1995): “A Multiple-rule Heuristic for Assembly Line Balancing”. Journal of the Operational Research Society, 46, pp. 62-69.
  14. Boctor, F.F. (1995): “A Multiple-rule Heuristic for Assembly Line Balancing”. Journal of the Operational Research Society, 46, pp. 62-69.
  15. Amen, M.”Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time”. Int. Journal of production economics, vol. 69,225-264, 2001.
  16. Scholl A, Christian B (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168(3):666–693 .
  17. Dar-El, E. M., “Solving Large Single-model Assembly Line Balancing Problem – A comparative Study”, AIIE Transactions, Vol. 7, No 3, (1975), pp. 302-306.
  18. Becker C,scholl A (2006) A survey on problems and methods in generalised assembly line balancing .Eur. J Oper Res 168:694-715.
  19. Baudin,M.(2002).Lean assembly :The nuts and bolts of making assembly operations flow.productivity,New York.
  20. Tonge, Fred M, “Summary of a Heuristic Line Balancing Procedure”, Management Science,, v 7, n 1 (1960),pp21-42.
  21. Jackson J.R., “A Computing Procedure for a Line Balancing Problem”, Management Sci., v 2, n 3, (1956), pp 261-272.
  22. St.T. Hackman, H.J. Magazine, T.S. Wee, Fast, effective algorithms for simple assembly line balancing problems, Operations Research 37 (1989) 916}924.
  23. N.R. Reeve, W.H. Thomas, Balancing stochastic assembly lines, AIIE [American Institute of Industrial Engineers] Transactions 5 (1973) 223}229.
Index Terms

Computer Science
Information Sciences

Keywords

Assembly line balancing RPW Heuristic Method Expert System

Powered by PhDFocusTM