基于标准C的M×N排序模型工期求解算法仿真与实现

The Simulation and Actualization of Time Limit for MxN Sort Model On-Line Based on C

本文以《M×N在线排序模型之工期求解算法分析》一文为基础,基于标准C实现且优化了T_(kw)递推求解算法,并自动绘制了对应的时标流线图。另外,还考虑了模型数据的随机生成和对现成模型数据的读取并求解等内容。

Based on 'The Calculate Arithmetic of Time Limit for a MxN Sort Model On-Line',the paper optimizes and actualizes the ordinal algorithm of Tkw found on the standard C language,and completes the Time flower graph.The paper also considers data model random building and reading of the existing model data.