Using genetic algorithms in process planning for job shop machining

This paper presents a novel computer-aided process planning model for machined parts to be made in a job shop manufacturing environment. The approach deals with process planning problems in a concurrent manner in generating the entire solution space by considering the multiple decision-making activities, i.e., operation selection, machine selection, setup selection, cutting tool selection, and operations sequencing, simultaneously. Genetic algorithms (GAs) were selected due to their flexible representation scheme. The developed GA is able to achieve a near-optimal process plan through specially designed crossover and mutation operators. Flexible criteria are provided for plan evaluation. This technique was implemented and its performance is illustrated in a case study. A space search method is used for comparison.

[1]  Richard A. Wysk,et al.  An operations network generator for computer aided process planning , 1990 .

[2]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[3]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[4]  Derek Yip-Hoi,et al.  A genetic algorithm application for sequencing operations in process planning for parallel machining , 1996 .

[5]  Ralf Bruns,et al.  Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling , 1993, ICGA.

[6]  Shivakumar Raman,et al.  Feature-based operation sequence generation in CAPP , 1995 .

[7]  Nariman Sepehri,et al.  A computer-aided process planning model based on genetic algorithms , 1995, Comput. Oper. Res..

[8]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[9]  Mooyoung Jung,et al.  Flexible process sequencing using Petri net theory , 1995 .

[10]  Andrew Y. C. Nee,et al.  A hybrid approach for set-up planning , 1995 .

[11]  John E. Biegel,et al.  Genetic algorithms and job shop scheduling , 1990 .

[12]  Paul K. Wright,et al.  Automating process planning: Using feature interactions to guide search , 1989 .

[13]  Hong-Chao Zhang,et al.  Computer Aided Process Planning: the state-of-the-art survey , 1989 .

[14]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[15]  Dirk Van Gucht,et al.  Incorporating Heuristic Information into Genetic Search , 1987, International Conference on Genetic Algorithms.

[16]  Cihan H. Dagli,et al.  Genetic neuro-scheduler for job shop scheduling , 1993 .

[17]  József Váncza,et al.  Genetic algorithms in process planning , 1991 .

[18]  C. L. Philip Chen,et al.  Integration of design and manufacturing: solving setup generation and feature sequencing using an unsupervised-learning approach , 1994, Comput. Aided Des..

[19]  Rajit Gadh,et al.  Feature-based approach for set-up minimization of process design from product design , 1996, Comput. Aided Des..

[20]  Dana S. Nau,et al.  Systematic approach to analysing the manufacturability of machined parts , 1995, Comput. Aided Des..

[21]  Hoda A. ElMaraghy,et al.  Evolution and Future Perspectives of CAPP , 1993 .

[22]  Paul K. Wright,et al.  Algorithms for the minimization of setups and tool changes in “simply fixturable” components in milling , 1996 .