SELECTION OF OPTIMAL SEQUENCE OF MACHINING OPERATIONS IN CAPP

Authors

  • Dr.A.Gopala Krishna Department of Mechanical Engineering, J.N.T. U, College of Engineering, Kakinada – PIN 533 003, Andhra Pradesh, India
  • E.Venu Gopal Goud Department of Mechanical Engineering, G.P.R. Engineering College, Kurnool – PIN 518 003, Andhra Pradesh, India
  • C.Govinda Rajulu Associate Professor, Department of Mechanical Engineering, D.V.R. College of Engineering & Technology, Kashipur – PIN 502 285, Andhra Pradesh, India

Abstract

Computer aided process planning (CAPP) is an important interface between computer aided design (CAD) and computer aided manufacturing (CAM). CAPP in the past is typically a knowledge-based approach, which is only capable of generating a feasible plan for a given part. The present work involves the application of a global search technique called Differential evolution for a quick identification of optimal or near optimal operation sequences. Minimization of sum of the total number of set-up changeovers and tool changeovers is taken as the objective function. Initially, the given part is represented as an assembly of form features, with details of geometric specifications, tolerance and surface finish requirements. To produce each of the form features, the required machining operations are selected. Next, feasibility constraints are considered among various machining operations. The proposed method then finds the optimal sequences within the minimum possible time.

Downloads

Download data is not yet available.

References

Lin,C J., and Wang, H P., 1993, “Optimal operation planning and sequencing; minimization of tool changeovers”, Int J Prod Res 31(2): 311-324

Koulamas C., 1993, “Operation sequencing and machining economics”, Int J Prod Res 31(4): 957-975

Halevi, G., and Weill, R., 1988, “Development of flexible optimum process planning procedures”, CIRP 29(1): 313-317

Shunmugam, M, S., Mahesh Puneti., Bhaskar Reddy, S V., 2002, “A method of preliminary planning for rotational components with C -axis features using genetic algorithms”,48,199-217.

Gopala Krishna, A., 2007, “Optimisation of surface grinding operations using a differential evolution approach”, Jrl. of Materials Processing Technology, corrected proof available online.

Storn, R., Price, K., 1997,“Differential evolution– a simple evolution strategy for fast optimization”, Dr. Dobb’s J., 15 18-24.

Price K, and Storn R, Differential evolution home page (web site of Price and Storn) http://www.icsi.berkely.edu/~storn /code.html as at 2001.

Price, K., 1999. An introduction to differential evolution, In: Corne D, Dorigo M, Glover (Eds.), New Ideas in Optimization, McGraw Hill, International (UK), pp. 79–108.

Tasgetiren, M,F., Sevkli, M., Liang, Y-C., Gencyilmaz, G., “Particle swarm optimization algorithm for single-machine total weighted tardiness problem”, Congress on Evolutionary Computation”,CEC2004, Portland, Oregan, USA

Tasgetiren, M,F., Liang, Y-C., Sevkli, M., Gencyilmaz,G., “Particle swarm optimization algorithm for permutation flowshop sequencing problem”, Fourth International Workshop on Ant Algorithms and Swarm Intelligence, ANTS2004, Brussel, Belgium.

Narayana, K. L., Kannaiah, P., Venkata Reddy,K., Reprint, 2001, Production Drawing, New Age International Publishres, New Delhi.

Downloads

Published

2007-12-01

How to Cite

[1]
“SELECTION OF OPTIMAL SEQUENCE OF MACHINING OPERATIONS IN CAPP”, JME, vol. 2, no. 4, pp. 262–267, Dec. 2007, Accessed: Oct. 16, 2024. [Online]. Available: https://smenec.org/index.php/1/article/view/678