A minmax regret approach to the critical path method with task interval times

European Journal of Operational Research

Volumn 197, Issue 1, 2009, Pages 235-242

  Conde, Eduardo ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Project management; Robust optimization

Indexed keywords

TURNAROUND TIME;

CRITICAL PATH METHODS; CRITICAL TASKS; DUE DATES; EXECUTION TIME; MIN-MAX REGRETS; OVERALL EXECUTIONS; PRECEDENCE CONSTRAINTS; PRECEDENCE RELATIONS; ROBUST OPTIMIZATION;

PROJECT MANAGEMENT;

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

References (11)

1. Chanas S., and Zielinski P. Critical path analysis in the network with fuzzy activity times. Fuzzy Sets and Systems 122 (2001) 195-204
2. Chanas S., and Zielinski P. The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research 136 (2002) 541-550
3. Changkong V., and Haimes Y.Y. Multiobjective Decision Making: Theory and Methodology (1983), North-Holland, Amsterdam
4. Chen S.P. Analysis of critical paths in a project network with fuzzy activity times. European Journal of Operational Research 183 (2007) 442-459
5. Cherkassky B.V., Goldberg A.V., and Radzik T. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73 2, Ser. A (1996) 129-174
6. Hillier F.S., and Lieberman G.J. Introduction to Operations Research. seventh ed. (2001), McGraw-Hill
7. Kelley J.E. Critical path planning and scheduling-mathematical basis. Operations Research 9 (1961) 296-320
8. Malcolm D.G., Roseboom J.H., Clark C.E., and Fazar W. Application of a technique for research and development project evaluation. Operations Research 7 5 (1959) 646-669
9. Karasan O.E., Pinar M.C., and Yaman H. The robust shortest path problem with interval data. Optimization Online (2001)
10. Shipley M.F., de Korvin A., and Omer K. Bifpet methodology versus PERT in project management: Fuzzy probability instead of the beta distribution. Journal of Engineering and Technology Management 14 (1997) 49-65
11. Zielinski P. The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research 158 3 (2004) 570-576