PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS - A BRANCH AND BOUND APPROACH

被引：240

作者：

CHRISTOFIDES, N ^{[1
]}

ALVAREZVALDES, R ^{[1
]}

TAMARIT, JM ^{[1
]}

机构：

[1] UNIV VALENCIA,VALENCIA,SPAIN

来源：

关键词：

D O I：

10.1016/0377-2217(87)90240-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：262 / 273

页数：12

共 15 条

[1] MACHINE SEQUENCING VIA DISJUNCTIVE GRAPHS - AN IMPLICIT ENUMERATION ALGORITHM
BALAS, E
[J]. OPERATIONS RESEARCH, 1969, 17 (06) : 941 - &
[2] BALAS E, 1970, APPLICATIONS MATH PR
[3] IMPROVED FEASIBILITY TEST FOR GORENSTEINS ALGORITHM
BENNINGT.GE
MCGINNIS, LF
[J]. OPERATIONS RESEARCH, 1974, 22 (05) : 1117 - 1119
[4] DAVIS EW, 1971, MANAGE SCI B-APPL, V17, pB803
[5] COMPARISON OF HEURISTIC AND OPTIMUM SOLUTIONS IN RESOURCE-CONSTRAINED PROJECT SCHEDULING
DAVIS, EW
PATTERSON, JH
[J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (08): : 944 - 955
[6] ELMAGHRABY SE, S THEORY SCHEDULING, P294
[7] OPTIMAL SOLUTION OF SCHEDULING PROBLEMS USING LAGRANGE MULTIPLIERS .1.
FISHER, ML
[J]. OPERATIONS RESEARCH, 1973, 21 (05) : 1114 - 1127
[8] GORENSTEIN S, 1972, OPER RES, V20, P835, DOI 10.1287/opre.20.4.835
[9] GUTJHAR AL, 1964, MANAGEMENT SCI
[10] Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223