工序与工序之间存在着一定的前后关系，每个工序有着自己的正常加工时间和通过赶工所能达到的最短加工时间以及每赶工一天的赶工费用。
There is a precedence relationship between tasks. Each task has its own normal working time and crashed working time. Each task has its own cost per day of working faster.
结果表明：在工件的权重和工件的平均加工时间不成比例的最一般的情况下，最短加工时间和最长加工时间优先规则的联合使用给出了使拖后工件数最少的优先策略，并对算法的最优性进行了证明。
The priority policy of joint use of the shortest expected processing time and the longest prcessing time is optimal when the expected processing time is non-proportional to the number of the jobs.
我们提供的共参数储存在CNC系统里，保证了进行重复定单加工时的最短更换时间。
We include the storage of the part program data in the CNC for the shortest change-over time and repeatable rolling process.
应用推荐