Stochastic network project scheduling with non-consumable limited resources

International Journal of Production Economics

Volumn 48, Issue 1, 1997, Pages 29-37

  Golenko Ginzburg, Dimitri ^a   Gonik, Aharon ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Luxembourg Industries   (Israel)

Author keywords

Activity on arc stochastic network project; Non consumable resources; Resource constraint project scheduling; Zero one integer programming

Indexed keywords

ALGORITHMS; DECISION MAKING; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PERT; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

NONCONSUMABLE RESOURCES; RESOURCE CONSTRAINED PROJECT SCHEDULING; STOCHASTIC NETWORK PROJECT;

PRODUCTION CONTROL;

EID: 0030735291     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(96)00019-9     Document Type: Article

References (30)

1. Luss, H., 1991. A non-linear minimax allocation problem with multiple knapsack constraints. Oper. Res. Lett., 10(4): 183-187.
2. Thesen, A., 1976. Heuristic scheduling of activities under resource and precedence restrictions. Mgmt. Sci., 23(4): 412-442.
3. Thesen, A., 1978. Computer Methods in Operations Research. Academic Press, New York.
4. Pritzker, A.A.B., Walters, L.J. and Wolfe, P.M., 1969. Multiproject scheduling with limited resources: a zero-one programming approach. Mgmt. Sci., 16(1): 93-108.
5. Lofts, N.R., 1974. Multiple allocation of resources in a network; an optimum scheduling algorithm. Can. J. Oper. Res. Inform. Process., 12: 25-38.
6. Davis, E.W. and Heidorn, G.E., 1971. An algorithm for optimal project scheduling under multiple resource constraints. Mgmt. Sci., 17(12): B803-B816.
7. Hastings, N.A.J. and Willis, R.J., 1976. Project scheduling with resource constraint using branch and bound. Oper. Res. Quart., 27(2): 341-345.
8. Willis, R.J., 1981. A note on the generation of project network diagrams. J. Oper. Res. Soc., 32(3): 235-238.
9. Willis, R.J., 1985. Critical path analysis and resource constrained project scheduling. Theory and practice. Eur. J. Oper. Res., 21: 149-155.
10. Bell, C.E. and Han, J., 1991. A new heuristic solution method in resource-constrained project scheduling. Nav. Res. Logist., 38(3): 315-331.
11. Davis, E.W., 1973. Project scheduling under resource constraints. Historical review and categorization of procedures. AIIE Trans., 5(4): 297-313.
12. Davis, E.W., 1974. Networks: Resource allocation. J. Ind. Eng., 6(4): 22-32.
13. Herroelen, W.S., 1972. Resource-constrained project scheduling. The state of art. Oper. Res. Quart., 2B: 261-275.
14. Wiest, J.D., 1967. A heuristic model for scheduling large projects with limited resources. Mgmt. Sci., 13(6): B359-B377.
15. Wiest, J.D. and Levy, F.K., 1977. A Management Guide to PERT/CPM, 2nd ed. Prentice-Hall, New Jersey.
16. Lorterapong, P., 1994. A fuzzy heuristic method for resource constrained project scheduling. Project Mgmt. J., 25(4): 12-18.
17. Minciardi, R., Paolucci, M. and Puliafito, P.P., 1994. Development of a heuristic project scheduler under resource constrains. Eur. J. Oper. Res., 79(2): 176-182.
18. Ulisoy, G. and Ozdamar, R., 1995. A heuristic scheduling algorithm for improving the duration and net present value of a project. Int. J. Oper. Prod. Mgmt., 15(1): 89-98.
19. Sampson, S.E. and Weiss, E.N., 1993. Local search techniques for the generalized resource constrained project scheduling problem. Navel. Res. Logist., 40(5): 665-675.
20. Zhan, J., 1994. Heuristics for scheduling resource-constrained projects in MPM networks. Eur. J. Oper. Res., 76(1): 192-205.
21. Toker, A., Kondacsi, S. and Erkip, N., 1991. Scheduling under a non-renewable resource constraint. J. Oper. Res. Soc., 42(9): 811-814.
22. Deckro, R.F. and Hebert, J.E., 1989. Resource constrained project crashing. Omega, 17(1): 69-79.
23. McBride, R., 1985. Solving embedded generalized network problems. Eur. J. Oper. Res., 21(1): 82-92.
24. Kidd, J., 1987. A comparison between the VERT program and other methods of project duration estimates. Omega, 15(2): 129-134.
25. Williams, T., 1992. Practical use of distributions in activity analysis. J. Oper. Res. Soc., 43(3): 265-270.
26. Schonberger, R.I., 1981. Why projects are always late: a rationale based on simulation of a PERT/CPM method. Interfaces, 11(5): 66-70.
27. Golenko-Ginzburg, D., 1993. A two-level decision-making for controlling stochastic projects. Int. J. Prod. Econom., 32: 117-127.
28. Golenko-Ginzburg, D. and Gonik, A., 1996. On-line model for COST-Simulation network projects. J. Oper. Res. Soc., 47: 266-283.
29. Taha, H.A., 1976. Operations Research. An Introduction. Collier Macmillan, New York.
30. Golenko-Ginzburg, D., 1988. On the distribution of activity time in PERT. J. Oper. Res. Soc., 39(8): 767-771.