欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对如何将复杂产品工序有效地分配到具有相同设备资源的两车间加工的问题，提出了基于邻域渲染的二车间综合调度算法。该算法为了实现产品加工尽早结束，提出关键设备均衡策略，将关键设备上的所有加工工序预先按并行加工时间最长方案均衡的分配到二车间；为了减少两车间之间的迁移次数，提出邻域渲染策略和同设备工序车间选择策略，通过计算未分配加工车间工序的邻域加工工序的渲染因子和影响因子确定其所在的加工车间；为了提高调度效率，采用动态关键路径策略和短用时策略确定工序调度次序，按序确定工序的加工车间和开始加工时间。分析和实例表明，所提出的算法产品加工时间较短、工序迁移次数较少且不增加算法复杂度。
英文摘要：
Aiming at that the problem that how to allocate complex product procedures effectively to two workshops with the same equipment resources, integrated scheduling algorithm of two workshops based on neighborhood rendering is proposed. In order to let two workshops products completed as soon as possible, this algorithm proposes critical-equipment equilibrium strategy, prior allocated procedures of key-equipment balanced to two workshops in accordance with the longest parallel processing scheme. In order to reduce the number of procedures transfer between two workshops, the strategy is put forward based on neighborhood rendering and the strategy to select workshop for the same equipment procedure. By calculating the rendering factor and the influence factor of the neighborhood procedure, other unallocated processing workshops are determined. In order to improve the scheduling efficiency, the strategy of dynamic critical path and short-time strategy to determine the scheduling sequence are adopted, then makes sure the processing workshops and start time. Analysis and instance show that the implementation of algorithm achieve the product in the shorter processing time and the less procedures migration times and not increase the algorithm complexity.
同期刊论文项目
同项目期刊论文
期刊信息
位置：