A VARIATION OF THE ASSIGNMENT PROBLEM

被引：20
作者：
GEETHA, S
NAIR, KPK
机构：
[1] Faculty of Administration, University of New Brunswick, Fredericton
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 68卷 / 03期
基金：
加拿大自然科学与工程研究理事会;
关键词：
COST MINIMIZING ASSIGNMENT; BOTTLENECK ASSIGNMENT; BICRITERIA ASSIGNMENT; TRADE-OFF PAIRS; ALGORITHM;
D O I：
10.1016/0377-2217(93)90198-V
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, a meaningful variant of the cost minimizing assignment problem with the objective of minimizing the total cost of assignment plus an additional 'supervisory' cost, which depends on the total time of completion of the project is formulated. An efficient method of finding an optimal solution to such a problem is presented with a numerical example to illustrate the same.
引用
收藏
页码：422 / 426
页数：5
相关论文
共 9 条
[1]  
ANGEJA YP, 1979, MANAGE SCI, V25, P73
[2]  
BAKSHI HC, 1979, CAHIERS CTR DETUDES, V21, P367
[3]   ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS [J].
BARR, RS ;
GLOVER, F ;
KLINGMAN, D .
MATHEMATICAL PROGRAMMING, 1977, 13 (01) :1-13
[4]   THE CONSTRAINED BOTTLENECK PROBLEM IN NETWORKS [J].
BERMAN, O ;
EINAV, D ;
HANDLER, G .
OPERATIONS RESEARCH, 1990, 38 (01) :178-181
[5]  
Garfinkel R.S., 1971, OPER RES, V18, P1717
[6]   THE SOLID TRANSPORTATION PROBLEM [J].
HALEY, KB .
OPERATIONS RESEARCH, 1962, 10 (04) :448-463
[7]  
HUNG MS, 1980, OPER RES, V38, P969
[8]  
Kuhn H. W., 1955, NAV RES LOG, V2, P83, DOI 10.1002/nav.3800020109
[9]   BOTTLENECK ASSIGNMENT PROBLEM [J].
RAVINDRAN, A ;
RAMASWAMI, V .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1977, 21 (04) :451-458
1