WEIGHTED MATCHING WITH VERTEX WEIGHTS - AN APPLICATION TO SCHEDULING TRAINING SESSIONS IN NASA SPACE-SHUTTLE COCKPIT SIMULATORS

被引：10

作者：

BELL, CE

机构：

[1] Department of Management Sciences, University of Iowa, Iowa City

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 73卷 / 03期

关键词：

SCHEDULING; GRAPHS; SPACE; HEURISTICS; MATCHING;

D O I：

10.1016/0377-2217(94)90237-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Necessary and sufficient conditions are provided for optimality of a matching in a weighted matching problem for which the weight of edge (i, j) is the sum of non-negative values, w(i) and w(j). The impact of adding one or more dummy vertices i with w(i) = 0 is investigated. Results are exploited in the design of a heuristic approach for weekly scheduling of NASA space shuttle training sessions in each of two cockpit simulators.

引用

页码：443 / 449

页数：7