-
1
-
-
84989743918
-
A new heuristic solution method of resource constrained project scheduling problems
-
Bell, C. E., and Han, J. (1991). "A new heuristic solution method of resource constrained project scheduling problems." Naval Res. Logistics, 38, 315-331.
-
(1991)
Naval Res. Logistics
, vol.38
, pp. 315-331
-
-
Bell, C.E.1
Han, J.2
-
2
-
-
0027694317
-
Heuristic for scheduling projects with resource restrictions and several resource-duration modes
-
Boctor, F. F. (1993). "Heuristic for scheduling projects with resource restrictions and several resource-duration modes." Int. J. Production Res., 31, 2547-2558.
-
(1993)
Int. J. Production Res.
, vol.31
, pp. 2547-2558
-
-
Boctor, F.F.1
-
3
-
-
4544318435
-
The LP/IP hybrid method for construction time-cost trade-off analysis
-
Burns, S., Liu, L., and Feng, C. (1996). "The LP/IP hybrid method for construction time-cost trade-off analysis." Constr. Mgmt. and Economics, 14, 265-276.
-
(1996)
Constr. Mgmt. and Economics
, vol.14
, pp. 265-276
-
-
Burns, S.1
Liu, L.2
Feng, C.3
-
4
-
-
0029632618
-
The discrete lime-cost tradeoff problem revisited
-
De, P., Dunne, E. J., and Wells, C. E. (1995). "The discrete lime-cost tradeoff problem revisited." Eur. J. Operational Res., 81, 225-238.
-
(1995)
Eur. J. Operational Res.
, vol.81
, pp. 225-238
-
-
De, P.1
Dunne, E.J.2
Wells, C.E.3
-
5
-
-
0022099676
-
Bounding the project completion time distribution in PERT networks
-
Dobin, B. N. (1985). "Bounding the project completion time distribution in PERT networks." Operation Res. 33, 862-881.
-
(1985)
Operation Res.
, vol.33
, pp. 862-881
-
-
Dobin, B.N.1
-
6
-
-
0027302082
-
Resource allocation via dynamic programming in activity networks
-
Elmagraby, S. E. (1993). "Resource allocation via dynamic programming in activity networks." Eur. J. Operational Res., 64, 199-215.
-
(1993)
Eur. J. Operational Res.
, vol.64
, pp. 199-215
-
-
Elmagraby, S.E.1
-
7
-
-
0031185451
-
Using genetic algorithms to solve construction time-cost trade-off problems
-
ASCE
-
Feng, C.-W., Liu, L., and Burns, S. A. (1997). "Using genetic algorithms to solve construction time-cost trade-off problems." J. Comp. Civ. Engrg., ASCE, 11(3), 184-189.
-
(1997)
J. Comp. Civ. Engrg.
, vol.11
, Issue.3
, pp. 184-189
-
-
Feng, C.-W.1
Liu, L.2
Burns, S.A.3
-
8
-
-
0038909957
-
-
Tech. Rep. No. 9, Constr. Inst., Dept. of Civ. Engrg., Stanford University, Stanford, Calif.
-
Fondahl, J. W. (1961). "A non-computer approach to the critical path method for the construction industry." Tech. Rep. No. 9, Constr. Inst., Dept. of Civ. Engrg., Stanford University, Stanford, Calif.
-
(1961)
A Non-computer Approach to the Critical Path Method for the Construction Industry
-
-
Fondahl, J.W.1
-
13
-
-
0025849210
-
A new approach for project scheduling with limited resource
-
Kahattab, M., and Choobineh, F. (1991). "A new approach for project scheduling with limited resource." Int. J. Production Res., 29, 185-198.
-
(1991)
Int. J. Production Res.
, vol.29
, pp. 185-198
-
-
Kahattab, M.1
Choobineh, F.2
-
14
-
-
0039502581
-
Critical path planning and scheduling: Mathematical basis
-
Kelly, J. E., Jr. (1961). "Critical path planning and scheduling: Mathematical basis." Operations Res., 9(3), 167-179.
-
(1961)
Operations Res.
, vol.9
, Issue.3
, pp. 167-179
-
-
Kelly J.E., Jr.1
-
15
-
-
38149144832
-
A comparison between the VERT program and other method of project duration estimation
-
Kidd, J. B. (1987). "A comparison between the VERT program and other method of project duration estimation." Omega - Int. J. Mgmt. Sci., 15(2), 129-134.
-
(1987)
Omega - Int. J. Mgmt. Sci.
, vol.15
, Issue.2
, pp. 129-134
-
-
Kidd, J.B.1
-
16
-
-
0042416399
-
Extensions of the critical path method through the application of integer programming
-
University of Illinois, Urbana
-
Meyer, W. L., and Shaffer, L. R. (1963). "Extensions of the critical path method through the application of integer programming." Civ. Engrg. Constr. Res. Ser. 2, University of Illinois, Urbana.
-
(1963)
Civ. Engrg. Constr. Res. Ser. 2
-
-
Meyer, W.L.1
Shaffer, L.R.2
-
17
-
-
0027545671
-
Schedule compression using the direct stiffness method
-
Ottawa
-
Moselhi, O. (1993). "Schedule compression using the direct stiffness method." Can. J. Civ. Engrg., Ottawa, 20, 65-72.
-
(1993)
Can. J. Civ. Engrg.
, vol.20
, pp. 65-72
-
-
Moselhi, O.1
-
19
-
-
0016028677
-
A horizon-varying, zero-one approach to project scheduling
-
Patterson, J. H., and Huber, D. (1974). "A horizon-varying, zero-one approach to project scheduling." Mgmt. Sci., 20(6), 990-998.
-
(1974)
Mgmt. Sci.
, vol.20
, Issue.6
, pp. 990-998
-
-
Patterson, J.H.1
Huber, D.2
-
20
-
-
0342275420
-
A structural method of computing project cost polygons
-
Prager, W. (1963). "A structural method of computing project cost polygons." Mgmt. Sci., 9(3), 394-404.
-
(1963)
Mgmt. Sci.
, vol.9
, Issue.3
, pp. 394-404
-
-
Prager, W.1
-
21
-
-
0016566179
-
A dynamic programming solution to cost-time tradeoff for CPM
-
Robinson, D. R. (1975). "A dynamic programming solution to cost-time tradeoff for CPM." Mgmt. Sci., 22(2), 158-166.
-
(1975)
Mgmt. Sci.
, vol.22
, Issue.2
, pp. 158-166
-
-
Robinson, D.R.1
-
22
-
-
19244376018
-
A simple CPM time-cost tradeoff algorithm
-
Siemens, N. (1971). "A simple CPM time-cost tradeoff algorithm." Mgmt. Sci., 17(6), B-354-B-363.
-
(1971)
Mgmt. Sci.
, vol.17
, Issue.6
-
-
Siemens, N.1
-
23
-
-
0343580652
-
Resource allocation for a stochastic CPM-type network through perturbation analysis
-
Wan, Y. (1994). "Resource allocation for a stochastic CPM-type network through perturbation analysis." Eur. J. Operational Res., 79, 239-248.
-
(1994)
Eur. J. Operational Res.
, vol.79
, pp. 239-248
-
-
Wan, Y.1
-
24
-
-
0022745027
-
Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability
-
Weiss, G. (1986). "Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability." Operations Res., 34(4), 595-605.
-
(1986)
Operations Res.
, vol.34
, Issue.4
, pp. 595-605
-
-
Weiss, G.1
|