Numerical Control Machining Grid-based Processing Schedule Optimization Using Forward Checking Algorithm

Abstract

In recent years, the development of grid technology provides the possibility to sharing machining resources over Internet. However, the current research on grid scheduling optimization are based on the certain machining routes regardless of the complex associated constraints, while which is one of the main features in NC (NC: Numerical Control) machining grid, including location constraints, parallel process constraints, and so on. To solve the NC machining grid optimization problem with complex associated constraints, from the viewpoint of "Constraint Satisfaction Problem (CSP)", this research established a CSP-based optimization model, and proposed the solving methods based on the forward checking algorithm based on derivation of a series of mathematical formulas. Comparative experiments demonstrated the feasibility and efficiency of the proposed model and methods.