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.