任务分配问题的建模与求解

建立了极大极小任务分配问题的混合整数线性规划模型,提出一种矩阵作业解答,并与穷举解及混合整数线性规划解的计算复杂度进行了比较.理论分析和数值试验表明矩阵作业法对两类任务分配问题,极大极小和总体极小任务分配问题,有效地提供最优解.

In this paper,the mixed integer linear programming(MILP)of minimax assignment is formed,and a solution called Operations on Matrix is presented and compared with the solutions of exhaustion and MILP.Theoretical analyses and numerical tests show that the operations on matrix are efficient for both minimax and global-minimum assignment problems.