Iterative approach to operation selection and sequencing in process planning

This paper considers the problem of selecting and sequencing operations in process planning for the objective of minimizing the sum of operation processing costs and machine, set-up and tool change costs. The main constraint is the precedence relations among operations. To represent the precedence relations and alternative operations, a tree-structured precedence graph is suggested. Based on the graph, the entire problem is decomposed into two subproblems: operation selection and operation sequencing. Then, three iterative algorithms are suggested that solve the two subproblems iteratively until optimal and near-optimal solutions are obtained. The algorithms are illustrated using an example part, and to show the performances of the algorithms, computational experiments were done on randomly generated test problems. The results show that the algorithms suggested work well for the test problems.

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

[2]  C. Ou-Yang,et al.  Developing an integrated framework for feature-based early manufacturing cost estimation , 1997 .

[3]  John M. Usher,et al.  The application of genetic algorithms to operation sequencing for use in computer-aided process planning , 1996 .

[4]  Dimitris Kiritsis,et al.  A review of knowledge-based expert systems for process planning. Methods and problems , 1995 .

[5]  Cheng-Jung Lin,et al.  Optimal operation planning and sequencing: minimization of tool changeovers , 1993 .

[6]  Richard A. Wysk,et al.  A knowledge-based approach for automated process planning , 1988 .

[7]  Inyong Ham,et al.  Computer-Aided Process Planning: The Present and the Future , 1988 .

[8]  Hyunbo Cho,et al.  A Formal Approach to Integrating Computer-Aided Process Planning and Shop Floor Control , 1994 .

[9]  Dimitris Kiritsis,et al.  A generic Petri net model for dynamic process planning and sequence optimization , 1996 .

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

[11]  Christos Koulamas,et al.  Operation sequencing and machining economics , 1993 .

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

[13]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[14]  Stelios Kafandaris,et al.  Expert Process Planning for Manufacturing , 1990 .

[15]  Dimitris Kiritsis,et al.  Search heuristics for operation sequencing in process planning , 2001 .

[16]  Gideon Halevi,et al.  Development of Flexible Optimum Process Planning Procedures , 1980 .

[17]  Andrew Y. C. Nee,et al.  A simulated annealing-based optimization algorithm for process planning , 2000 .

[18]  Norhashimah Morad,et al.  Genetic algorithms in integrated process planning and scheduling , 1999, J. Intell. Manuf..

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

[20]  Dimitris Kiritsis,et al.  Branch and fathoming algorithms for operation sequencing in process planning , 2001 .

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

[22]  D. Kiritsis,et al.  A Petrinet Technique for Process Planning Cost Estimation , 1998 .

[23]  Dimitris Kiritsis,et al.  Petri net techniques for process planning cost estimation , 1999 .