A hybrid-graph approach for automated setup planning in CAPP
In this paper, a systematic approach for automated setup planning in CAPP is introduced. The concept of "hybrid graph", which can be transferred into directed graph by changing any two-way edge into one-way edge, is introduced. The specified graph theory is effectively used in setup planning. Tolerance relations are used as critical constraints for setup planning. Comprehensive principles are explored and summarized for setup planning. The hybrid-graph theory, accompanied by matrix theory, is used to aid computerizing these principles. An example is illustrated to demonstrate the algorithm. (C) 1999 Elsevier Science Ltd. All rights reserved.
setup planning capp graph theory tolerance hybrid graph theory