A multi-objective resource allocation problem in PERT networks

European Journal of Operational Research

Volumn 172, Issue 3, 2006, Pages 838-854

  Azaron, Amir ^a   Katagiri, Hideki ^a   Sakawa, Masatoshi ^a   Kato, Kosuke ^a   Memariani, Azizollah ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b BU ALI SINA UNIVERSITY   (Iran)

Author keywords

Markov processes; Multiple objective programming; Optimal control; Project management and scheduling

Indexed keywords

MARKOV PROCESSES; MODELS; OPTIMAL CONTROL SYSTEMS; PROJECT MANAGEMENT; RESOURCE ALLOCATION;

MULTIPLE OBJECTIVE PROGRAMMING; PERT NETWORKS; PROJECT MANAGEMENT AND SCHEDULING;

PERT;

EID: 33645892898     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.11.018     Document Type: Article

References (30)

1. Azaron A., and Fatemi Ghomi S. Optimal control of service rates and arrivals in Jackson networks. European Journal of Operational Research 147 (2003) 17-31
2. Berman E. Resource allocation in a PERT network under continuous activity time-cost function. Management Science 10 (1964) 734-745
3. Burt J., and Garman M. Conditional Monte Carlo: A simulation technique for stochastic network analysis. Management Science 18 (1971) 207-217
4. Charnes A., Cooper W., and Thompson G. Critical path analysis via chance constrained and stochastic programming. Operations Research 12 (1964) 460-470
5. Clingen C. A modification of Fulkerson's algorithm for expected duration of a PERT project when activities have continuous d.f. Operations Research 12 (1964) 629-632
6. E. Demeulemeester, W. Herroelen, S. Elmaghraby, Optimal procedures for the discrete time-cost trade-off problem in project networks, Research Report, Department of Applied Economics, Katholieke Universiteit Leuven, Leuven, Belgium, 1993.
7. Elmaghraby S. On the expected duration of PERT type networks. Management Science 13 (1967) 299-306
8. Elmaghraby S. Resource allocation via dynamic programming in activity networks. European Journal of Operational Research 64 (1993) 199-245
9. Falk J., and Horowitz J. Critical path problem with concave cost curves. Management Science 19 (1972) 446-455
10. Fatemi Ghomi S., and Hashemin S. A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network. European Journal of Operational Research 114 (1999) 610-625
11. Fatemi Ghomi S., and Rabbani M. A new structural mechanism for reducibility of stochastic PERT networks. European Journal of Operational Research 145 (2003) 394-402
12. Fishman G. Estimating critical path and arc probabilities in stochastic activity networks. Naval Research Logistic Quarterly 32 (1985) 249-261
13. Fulkerson D. A network flow computation for project cost curves. Management Science 7 (1961) 167-178
14. Fulkerson D. Expected critical path lengths in PERT networks. Operations Research 10 (1962) 808-817
15. Garman M. More on conditioned sampling in the simulation of stochastic networks. Management Science 19 (1972) 90-95
16. Hwang C., and Masud A. Multiple Objective Decision Making, Methods and Applications (1979), Springer-Verlag, Berlin
17. Jordan S., and Ku C. Access control to two multiserver loss queue in series. IEEE Transactions on Automatic Control 42 (1997) 1017-1023
18. Kelly J. Critical path planning and scheduling: Mathematical basis. Operations Research 9 (1961) 296-320
19. Kulkarni V., and Adlakha V. Markov and Markov-regenerative PERT networks. Operations Research 34 (1986) 769-781
20. Lamberson L., and Hocking R. Optimum time compression in project scheduling. Management Science 16 (1970) 597-606
21. Martin J. Distribution of the time through a directed acyclic network. Operations Research 13 (1965) 46-66
22. Perry C., and Creig I. Estimating the mean and variance of subjective distributions in PERT and decision analysis. Management Science 21 (1975) 1477-1480
23. Robillard P. Expected completion time in PERT networks. Operations Research 24 (1976) 177-182
24. Robinson D. A dynamic programming solution to cost-time trade-off for CPM. Management Science 22 (1965) 158-166
25. Sethi S., and Thompson G. Optimal Control Theory (1981), Martinus Nijhoff Publishing, Boston
26. Sigal C., Pritsker A., and Solberg J. The use of cutsets in Monte-Carlo analysis of stochastic networks. Mathematical Simulation 21 (1979) 376-384
27. Shioyama T. Optimal control of a queueing network system with two types of customers. European Journal of Operational Research 52 (1991) 367-372
28. Tavares L. Optimal resource profiles for program scheduling. European Journal of Operational Research 29 (1987) 83-90
29. Tseng K., and Hsiao M. Optimal control of arrivals to token ring networks with exhaustive service discipline. Operations Research 43 (1995) 89-101
30. Weglarz J. Project scheduling with continuously divisible doubly constrained resources. Management Science 27 (1981) 1040-1053