MINIMIZING COSTS OF RESOURCE REQUIREMENTS IN PROJECT NETWORKS SUBJECT TO A FIXED COMPLETION-TIME

被引:142
作者
MOHRING, RH
机构
关键词
D O I
10.1287/opre.32.1.89
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
30
引用
收藏
页码:89 / 120
页数:32
相关论文
共 30 条
[1]  
Baker K., 1974, INTRO SEQUENCING SCH
[2]  
Baker K.A., 1971, NETWORKS, V2, P11, DOI [10.1002/net.3230020103, DOI 10.1002/NET.3230020103]
[3]  
BALAS E, 1971, APPLICATIONS MATH PR
[4]   BOUND ON DIMENSION OF INTERVAL ORDERS [J].
BOGART, KP ;
RABINOVICH, I ;
TROTTER, WT .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 21 (03) :319-328
[5]   TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].
BOOTH, KS ;
LUEKER, GS .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :335-379
[6]  
Conway R, 1967, THEORY SCHEDULING
[7]   Partially ordered sets [J].
Dushnik, B ;
Miller, EW .
AMERICAN JOURNAL OF MATHEMATICS, 1941, 63 :600-610
[8]  
ELMAGHRABY SE, 1977, ACTIVITY NETWORKS PR
[9]   INTRANSITIVE INDIFFERENCE IN PREFERENCE THEORY - A SURVEY [J].
FISHBURN, PC .
OPERATIONS RESEARCH, 1970, 18 (02) :207-&
[10]  
FRANK A, 1976, 5TH P BRIT COMB C WI