摘要
本文将针对肉制品厂产品的加工流程进行相关工件车间调度问题研究。根据实例建立工件之间的加工工序,得出基于图论的车间调度析取图模型,然后结合拓扑算法的进行逐步求解,最后求出整个产品在加工过程中的线序关系析取图。该研究结果表明拓扑算法在求解该问题上是具有高效性以及可行性的。
The article will discuss the job shop scheduling problem with correlative operations of the working process in the meat product plant by analyzing the job shop scheduling problem. According to the working procedure between the work-piece according to the example, a workshop scheduling analysis model based on graph theory is obtained, and then we can solve it by using the topology algorithm. Finally, we find out the sequence relation of the whole product in the process of processing. The research result indicates that the topology algorithm is of high efficiency and feasibility when solving this problem.
出处
《数码设计》
2018年第1期37-39,共3页
Peak Data Science
基金
校级孵化项目(201512L02)
省级教改项目(FBJG20170154)资助
关键词
析取图
拓扑算法
相关工件
车间调度
Disjunction graph
topology algorithm
correlative operations
job shop scheduling problem