链表队列算法在生产线数据处理中的应用  

Application of Linked-List and Queue Algorithm in Product Line Data Processing

作　　者：胡源[1] 周丽娟[2] 

机构地区：[1]中国兵器工业第五八研究所信息中心,四川绵阳621000 [2]中国兵器工业第五八研究所工业自动化工程技术部,四川绵阳621000

出　　处：《兵工自动化》2006年第10期80-81,共2页Ordnance Industry Automation

摘　　要：介绍链表队列算法在生产线数据处理中的应用。先建立生产线模拟模型,其每个检测点采集的数据构成1个队列,将采集到的数据加入到相应队列尾,在废品剔除点C,判断产品是否合格,如果合格则将QueueA和QueueB的队列头的数据加入到QueueC的队列尾后将队列头的数据删除,如果不合格则直接删除2个队列的队列头数据,在下料点E处进行和C处相同的处理。在下料点E处,如果产品合格,则最后将数据保存到数据库或文件中。The application of linked-list and queue algorithm in product line data processing was introduced. At first, the product lin simulation model was established. The data acquired by the detection points were used to construct a queue. And the acquired data were added to the end of corresponding queue. When in waste elimination point C, the products were checked out. If the products were realiable, the dada in list heads of QueueA and QueueB were added to the list end of QueueC and deleted the data in list heads. If the products were unreliable, the dada in list heads of QueueA and QueueB were deleted directly, and the same thing was done in material suuply point E as in point C. In point E, if the products were relaibel, the data were stored in database and documentation.

关 键 词：链表 队列 检测点 实时数据 

分 类 号：TP274.2[自动化与计算机技术—检测技术与自动化装置]