한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제38권2호
  • /
  • Pages.25-42
  • /
  • 2013
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

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

Project Time-Cost Tradeoff Problem with Milestones under an Uncertain Processing Time

  • Choi, Byung-Cheon (Department of Business Administration, Chungnam National University) ;
  • Chung, Jibok (Department of Business Administration, Daejeon University)
  • 투고 : 2012.10.05
  • 심사 : 2012.12.10
  • 발행 : 2013.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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 jobs, 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.

키워드

참고문헌

  1. Bell, J., "Beauty is in the eye of the beholder : Establishing a fair and equitable value for embryonic high-tech enterprises," Venture Capital Journal, Vol.40(2000), pp.33-34.
  2. Ben-Tal, A. and A. Nemirovski, "A robust optimizatioin-Methodelogy and applications," Mathematical Programming, Vol.92(2002), pp.86-100.
  3. Bowman, R.A., "Stochastic gradient-based time-cost tradeoffs in pert networks using simulation," Annals of Operations Research, Vol.53(1994), pp.533-551. https://doi.org/10.1007/BF02136842
  4. Cohen, I., B. Golany, and A. Shtub, "The stochastic time-cost tradeoff problem : A robust optimization approach," Networks, Vol.49(2007) pp.175-188. https://doi.org/10.1002/net.20153
  5. De, P., J. Dunne, J.B. Ghosh, and C.E. Wells, "Complexity of the discrete time-cost trade-off problem for project networks," Operations Research, Vol.45(1997), pp.302-306. https://doi.org/10.1287/opre.45.2.302
  6. Fulkerson, D.R. "A network flow computation for project cost curves," Management Science, Vol.7(1961), pp.167-178. https://doi.org/10.1287/mnsc.7.2.167
  7. Garey, M.R. and D.S. Johnson, Computers and intractability : A guide to the theory of NP-completeness W.H. Freeman, 1979.
  8. Gutjahr, W.J., C. Strauss, and E. Wagner, "A stochastic branch-and-bound approach to activity crashing in project management," Informs Journal on Computing, Vol.12(2000), pp.125-135. https://doi.org/10.1287/ijoc.12.2.125.11894
  9. Hagstrom, J.N., "Computational complexity of pert problems," Networks, Vol.1(1988), pp. 139-147.
  10. Hazir, O., M. Haouari, and E. Erel, "Robust scheduling and robustness measures for the discrete time-cost trade-off problem," European Journal of Operational Research, Vol. 207(2010), pp.633-643. https://doi.org/10.1016/j.ejor.2010.05.046
  11. Hillier, F.S. and G.J. Lieberman, Introduction to Operations Research, newblock McGraw-Hill, New York, NY, 2001.
  12. Kelley, J.E., "Critical path planning and scheduling : Mathematical basis," Operations Research, Vol.9(1961), pp.296-320. https://doi.org/10.1287/opre.9.3.296
  13. Leu, S.S., A.T. Chen, and C.H. Yang, "A GA-based fuzzy optimal model for construction time-cost trade-off," International Journal of Project Management, Vol.19(2001), pp. 47-58. https://doi.org/10.1016/S0263-7863(99)00035-6
  14. Mokhtari, H., A. Aghaie, J. Rahimi, and A. Mozdgir, "Project time-cost trade-off scheduling : a hybid optimization approach," International Journal of Advanced Manufacturing Technology, Vol.50(2010), pp.811-822. https://doi.org/10.1007/s00170-010-2543-4
  15. Roemer, T. and R. Ahmadi, "Concurrent crashing and overlapping in product development," Operations Research, Vol.52(2004), pp.606-622. https://doi.org/10.1287/opre.1040.0125
  16. Sahlmann, W.A., "Insights from the ventures capital model of project governance," Business Economics, Vol.29(1994), pp.35-41.
  17. Shtub, A., J.F. Bard, and S. Globerson, Project Managemnet : Engineering, Technology and Implementation, Prince Hall, Englewood Cliff, NJ. (1994).
  18. Skutella, M., "Approximation algorithms for the discrete time-cost tradeoff problem," Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, L.A. (1997), pp.501-508.
  19. Weglarz, J., J. Jozefowska, M. Mika, and G. Waligora, "Project scheduling with finite or infinite number of activity processing modes -a survey," European Journal of Operational Research, Vol.208(2011), pp.177-205. https://doi.org/10.1016/j.ejor.2010.03.037
  20. Wollmer, R.D., "Critical path planning under uncertainty," Mathematical Programming Study, Vol.25(1985), pp.164-171. https://doi.org/10.1007/BFb0121082