摘要
针对指派问题中考虑多目标且具有序区间排序信息的情形,定义了指派的最理想排序位置(理想点),通过计算序区间排序信息与理想点的距离,得到各目标下某人完成某任务的"机会成本",采用简单加权法则将各目标下的成本矩阵综合为总成本矩阵,基于总成本矩阵构建指派问题的数学模型,并采用匈牙利法对该模型进行求解。实例分析表明,本文给出的方法具有简单、易操作等特点,对于具有序区间指派信息的多目标指派问题提供了一种有效的解决途径。
With regard to the situations that the multi-objectives and ordinal interval ranking information are both considered in an assignment problem, the most ideal ranking position （ideal point） for assignment is defined. Through computing the distance between ordinal interval ranking information with the ideal point, the ＂opportunity cost＂ that a task is accomplished by a person under each objective is obtained. Then, the cost matrix under each objective is integrated into an overall cost matrix by the simple weighting method. Based on that, the mathematical model for the assignment problem is built, and the Hungary algorithm is used to solve the model. The analysis of a practical example illustrates that the approach proposed in this paper is simple and easy manipulated, and it provides an effective means for us to solve multi-objective assignment problems with ordinal interval ranking information.
出处
《工业工程与管理》
2008年第3期42-45,51,共5页
Industrial Engineering and Management
基金
国家创新研究群体科学基金资助项目(70721001)
国家杰出青年科学基金资助项目(70525002)
东北大学流程工业综合自动化教育部重点实验室资助项目(JCLL-01-05)
关键词
指派问题
序区间排序信息
理想点
成本矩阵
assignment problem
ordinal interval ranking information
idea point
cost matrix
