战术固定兵力与伴随兵力优化部署模型

2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI:10.1109/NCIS.2011.175

Qu Changzheng, Ming Li, Zhang Bo, Zhang Liu

{"title":"战术固定兵力与伴随兵力优化部署模型","authors":"Qu Changzheng, Ming Li, Zhang Bo, Zhang Liu","doi":"10.1109/NCIS.2011.175","DOIUrl":null,"url":null,"abstract":"to study the optimization deployment of tactics maintenance force, a task allocation strategy is proposed based on system steady-state queue length to solve the dynamic task schedule, and a queuing network optimization model is constructed, which achieves the best collocation between fixed force and accompanying force and takes the minimum task time as target.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization Deployment Model of Tactics Fixed Force and Accompanying Force\",\"authors\":\"Qu Changzheng, Ming Li, Zhang Bo, Zhang Liu\",\"doi\":\"10.1109/NCIS.2011.175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"to study the optimization deployment of tactics maintenance force, a task allocation strategy is proposed based on system steady-state queue length to solve the dynamic task schedule, and a queuing network optimization model is constructed, which achieves the best collocation between fixed force and accompanying force and takes the minimum task time as target.\",\"PeriodicalId\":215517,\"journal\":{\"name\":\"2011 International Conference on Network Computing and Information Security\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Network Computing and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCIS.2011.175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Network Computing and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCIS.2011.175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

为研究战术维修部队的优化部署，提出了一种基于系统稳态队列长度的任务分配策略来解决动态任务调度问题，并构建了以任务时间最小为目标，实现固定兵力与伴随兵力最佳配置的排队网络优化模型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimization Deployment Model of Tactics Fixed Force and Accompanying Force

to study the optimization deployment of tactics maintenance force, a task allocation strategy is proposed based on system steady-state queue length to solve the dynamic task schedule, and a queuing network optimization model is constructed, which achieves the best collocation between fixed force and accompanying force and takes the minimum task time as target.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 International Conference on Network Computing and Information Security

自引率

0.00%

发文量