Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach

European Journal of Operational Research

Volumn 180, Issue 3, 2007, Pages 1186-1200

  Azaron, Amir ^a   Tavakkoli Moghaddam, Reza ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

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

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; MARKOV PROCESSES; OPTIMAL CONTROL SYSTEMS; PROJECT MANAGEMENT; QUEUEING NETWORKS; SCHEDULING;

ERLANG ACTIVITY DURATIONS; MULTIPLE OBJECTIVE PROGRAMMING; STOCHASTIC NETWORK;

PERT;

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

References (34)

1. Arisawa S., and Elmaghraby S. Optimal time-cost tradeoffs in GERT networks. Management Science 18 (1972) 589-599
2. Arsham H. Managing project activity-duration uncertainties. Omega 21 (1993) 111-122
3. Azaron A., Katagiri H., Sakawa M., Kato K., and Memariani A. A multi-objective resource allocation problem in PERT networks. European Journal of Operational Research 172 (2006) 838-854
4. Azaron A., Perkgoz C., and Sakawa M. A genetic algorithm approach for the time-cost trade-off in PERT networks. Applied Mathematics and Computation 168 (2005) 1317-1339
5. Azaron A., Katagiri H., Kato K., and Sakawa M. Longest path analysis in networks of queues: Dynamic scheduling problems. European Journal of Operational Research 174 (2006) 132-149
6. Azaron A., and Modarres M. Distribution function of the shortest path in networks of queues. OR Spectrum 27 (2005) 123-144
7. Berman E. Resource allocation in a PERT network under continuous activity time-cost function. Management Science 10 (1964) 734-745
8. Chau D., Chan W., and Govindan K. A time-cost trade-off model with resource consideration using genetic algorithm. Civil Engineering Systems 14 (1997) 291-311
9. Deckro R., and Hebert J. Resource constraint project crashing. Omega 17 (1989) 69-79
10. 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).
11. Elmaghraby S. Resource allocation via dynamic programming in activity networks. European Journal of Operational Research 64 (1993) 199-245
12. Falk J., and Horowitz J. Critical path problem with concave cost curves. Management Science 19 (1972) 446-455
13. Fulkerson D. A network flow computation for project cost curves. Management Science 7 (1961) 167-178
14. Golenko-Ginzburg D., and Gonik A. Stochastic network project scheduling with non-consumable limited resources. International Journal of Production Economics 48 (1997) 29-37
15. Golenko-Ginzburg D., Ljubkin S., Rezer V., and Sitniakovski S. Algorithms of optimal supply of resources to a group of projects (stochastic networks). Automation and Remote Control 62 (2001) 1366-1375
16. Golenko-Ginzburg D., and Gonik A. Hierarchical decision-making model for planning and controlling stochastic projects. International Journal of Production Economics 46-47 (1996) 39-54
17. Golenko-Ginzburg D. Controlled alternative activity networks in project management. European Journal of Operational Research 37 (1988) 336-346
18. Golenko-Ginzburg D., and Gonik A. On-line control model for cost-simulation network projects. Journal of the Operational Research Society 47 (1996) 266-283
19. Golenko-Ginzburg D., and Gonik A. On-line control model for network construction projects. Journal of the Operational Research Society 48 (1997) 175-183
20. Golenko-Ginzburg D., and Gonik A. High performance heuristic algorithm for controlling stochastic network projects. International Journal of Production Economics 54 (1998) 235-245
21. Golenko-Ginzburg D., Gonik A., and Papic L. Developing cost-optimization production control model via simulation. Mathematics and Computers in Simulation 49 (1999) 335-351
22. Golenko-Ginzburg D., and Gonik A. A heuristic for network project scheduling with random activity durations depending on the resource reallocation. International Journal of Production Economics 55 (1998) 149-162
23. Gross D., and Harris M. Fundamentals of Queueing Theory. second ed. (1985), John Wiley & Sons, New York
24. Hwang C., and Masud A. Multiple Objective Decision Making, Methods and Applications (1979), Springer-Verlag, Berlin
25. Kelly J. Critical path planning and scheduling: Mathematical basis. Operations Research 9 (1961) 296-320
26. Kulkarni V., and Adlakha V. Markov and Markov-regenerative PERT networks. Operations Research 34 (1986) 769-781
27. Lamberson L., and Hocking R. Optimum time compression in project scheduling. Management Science 16 (1970) 597-606
28. Laslo Z. Activity time-cost tradeoffs under time and cost chance constraints. Computers and Industrial Engineering 44 (2003) 365-384
29. Panagiotakopoulos D. A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15 (1977) 183-195
30. Robinson D. A dynamic programming solution to cost-time trade-off for CPM. Management Science 22 (1965) 158-166
31. Sethi S., and Thompson G. Optimal Control Theory (1981), Martinus Nijhoff Publishing, Boston
32. Shtub A., Bard J., and Globerson S. Project Management: Engineering, Technology and Implementation (1994), Prentice Hall International, Inc, New York
33. Tavares L. Optimal resource profiles for program scheduling. European Journal of Operational Research 29 (1987) 83-90
34. Weglarz J. Project scheduling with continuously divisible doubly constrained resources. Management Science 27 (1981) 1040-1053