论文部分内容阅读
机械制造企业在编制生产作业计划工作中,经常遇到n个工件经m台机床加工的排序问题。即当多个工件经多台机床加工时,如何合理安排工件的加工顺序,使工件在机床上加工时,时间上不发生冲突,同时尽可能缩短加工周期。n个工件经m台机床的加工排序问题,简称为m×n排序问题。m×n排序问题是一类广泛的组合最优化问题,它的应用是极其广泛的。本文讨论的是同顺序m×n排序问题,有如下几条假设:
In the preparation of production operation planning, mechanical manufacturing enterprises often encounter the problem of n workpieces being processed by m machine tools. That is, when multiple workpieces are processed by multiple machine tools, how to reasonably arrange the processing sequence of the workpieces so that when the workpieces are machined on the machine, there is no conflict in time and the processing cycle is shortened as much as possible. The work ordering of n workpieces by m machines is referred to as the m×n scheduling problem. The m×n scheduling problem is a wide variety of combinatorial optimization problems. Its application is extremely extensive. This article discusses the same order m×n ordering problem with the following assumptions: