论文部分内容阅读
在m台不同的机床上对n个零件进行加工排序是生产中经常遇到的问题。本文就一个有m台机床和n个被加工零件的制造系统进行研究,用一种新的方法使加工参数优化并解决排序问题。本文的出发点是为了使车间设备得到充分利用,在把各种零件分配给机床的同时,还必须给出每个零件在机床上所完成的加工内容。为了解决这个问题,建立了一个数学规划模型,该模型用直接探索求解程序求解,文中列举了这一数学模型的应用实例,并将此求解程序与分枝边界法进行了比较,这种计算工作是计算机辅助工艺设计中(CAPP)的重要组成部分。
The sorting of n parts on m different machine tools is a problem often encountered in production. In this paper, a manufacturing system with m machine tools and n parts to be machined is studied. A new method is used to optimize the machining parameters and solve the sorting problem. The starting point of this paper is to make full use of the workshop equipment. While allocating various parts to the machine tool, it is also necessary to give each part the finished machining content on the machine tool. In order to solve this problem, a mathematical programming model is established, which is solved by the direct exploration solver. The application example of this mathematical model is listed in this paper. The solver is compared with the branch boundary method. Is an important part of Computer Aided Process Design (CAPP).