摘要
在任意M×N流程调优排序模型的产品加工顺序已确定之前提下,通过分析其加工时标流线图的结构特征,进而提出了基于表格数据的总工期求解递推算法,并基于标准C完成了该算法的仿真实现,自动绘制了时标流线图,还考虑了模型数据的随机生成和对现成模型数据的读取并求解等内容。该算法简洁、明快、可操作性极强,且不受模型规模之限制,时间复杂度为O(n2)。
In any M x N process optimization scheduling model of product processing sequence identified premise, through the analysis of the processing time scale chart structure characteristics, then based on the tabular data total time solving recursive algorithm, automatic drawing of timing chart Based on standard C completed the simulation algorithm, also consider the model data randomly generated and ready-made model data to read and solving etc.. The algorithm is concise, sprightly, extremely strong maneuverability, and not affected by scale models of the restrictions, the time complexity is O(N2)
出处
《电脑知识与技术》
2014年第6X期4280-4283,共4页
Computer Knowledge and Technology
关键词
网络规划
时间间隔
工期
时标流线图
算法
仿真实现
graph planning
time interval
construction period
timing chart
algorithm
simulation
