불확실한 환경 하에서 중간 평가가 있는 시간-비용 프로젝트 문제

다국어 초록 (Multilingual Abstract)

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time, Unless each milestone is completed on time, some penalty cost may be imposed, However, the penalty costs can be avoided by compressing the processing times of some jabs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time, We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

목차 (Table of Contents)

• Abstract
• 1. Introduction
• 2. Problem Definition
• 3. LP Problem with Special Constraints
• 4. Polynomiality of Problem P
• 5. Conclusion and Future Works
• References

참고문헌 (Reference)

1 Cohen, I., "The stochastic time-cost tradeoff problem : A robust optimization approach" 49 : 175-188, 2007

2 Bowman, R. A., "Stochastic gradient-based time-cost tradeoffs in pert networks using simulation" 53 : 533-551, 1994

3 Hazir, O., "Robust scheduling and robustness measures for the discrete time-cost trade-off problem" 207 : 633-643, 2010

4 Mokhtari, H., "Project time-cost trade-off scheduling : a hybid optimization approach" 50 : 811-822, 2010

5 Weglarz, J., "Project scheduling with finite or infinite number of activity processing modes -a survey" 208 : 177-205, 2011

6 Shtub, A., "Project Managemnet : Engineering, Technology and Implementation" Prince Hall 1994

7 Hillier, F.S., "Introduction to Operations Research" McGraw- Hill 2001

8 Sahlmann, W. A., "Insights from the ventures capital model of project governance" 29 : 35-41, 1994

9 Wollmer, R. D., "Critical path planning under uncertainty" 25 : 164-171, 1985

10 Kelley, J. E., "Critical path planning and scheduling : Mathematical basis" 9 : 296-320, 1961

11 Roemer, T., "Concurrent crashing and overlapping in product development" 52 : 606-622, 2004

12 Garey, M.R., "Computers and intractability : A guide to the theory of NP-completeness" W.H. Freeman 1979

13 Hagstrom, J. N., "Computational complexity of pert problems" 1 : 139-147, 1988

14 De, P., "Complexity of the discrete time-cost trade- off problem for project networks" 45 : 302-306, 1997

15 Bell, J., "Beauty is in the eye of the beholder : Establishing a fair and equitable value for embryonic high-tech enterprises" 40 : 33-34, 2000

16 Skutella, M., "Approximation algorithms for the discrete time-cost tradeoff problem" 501-508, 1997

17 Gutjahr, W. J., "A stochastic branch-and-bound approach to activity crashing in project management" 12 : 125-135, 2000

18 Ben-Tal, A., "A robust optimizatioin-Methodelogy and applications" 92 : 86-100, 2002

19 Fulkerson, D.R., "A network flow computation for project cost curves" 7 : 167-178, 1961

20 Leu, S. S., "A GA-based fuzzy optimal model for construction time-cost trade-off" 19 : 47-58, 2001