The Absent Assignment Problem with the Most Win-battles and the Shortest Operation Time and the Least Cost
This paper presents a new kind of assignment problem which is named as the absent assignment problem with the most win-battles and the shortest operation time and the least cost for the first time. It means exactly the absent assignment problem with least cost which is subject to the shortest operation time which is subject to the most wining battles. The mathematical model for it is built. The win matrix, opretion time matrix and surviving matrix are defined. Applying the thought of exclusion un-win battles, the new kind of absent assignment problem is transformed to the absent assignment problem with minimum cost which is subject to the shortest limit time of fights. The transform method is given, and the transform theorem is proved.The solving theory and method are set up for the new kind of absent assignment problem.In the end, a real example for the new kind of assignment problem is studied,and the solution for it is obtained.
assignment matrix construction the most win-battles the shorteat operation time the least cost absent assignment problem solving method of exclusion battles
ZHOU Liangze LI Xueyin
Systems Engineering Institute,Jingchu University of Technology,Hubei,P.R.China 448000
国际会议
2008 International Conference of Management Science and Engineering(2008管理科学与工程国际学术会议)
河南焦作
英文
1261-1268
2008-11-01（万方平台首次上网日期，不代表论文的发表时间）