산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제34권3호
  • /
  • Pages.90-96
  • /
  • 2011
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

최대후회 최소화 임계 경로 탐색 알고리듬

A Heuristic Algorithm to Find the Critical Path Minimizing the Maximal Regret

  • 강준규 (성결대학교 산업경영공학부) ;
  • 윤협상 (대구가톨릭대학교 경영정보학과)
  • Kang, Jun-Gyu (Department of Industrial and Management Engineering, Sungkyul University) ;
  • Yoon, Hyoup-Sang (Department of Management Information Systems, Catholic University of Daegu)
  • 투고 : 2011.07.19
  • 심사 : 2011.09.10
  • 발행 : 2011.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

키워드

참고문헌

  1. Averbakh, I. and Lebedev, V.; "Interval data minmax regret network optimization problems," Discrete Applied Mathematics, 138 : 289-301, 2004. https://doi.org/10.1016/S0166-218X(03)00462-1
  2. Chanas, S. and Zieliski, P.; "The computational complexity of the criticality problems in a network with interval activity times," European Journal of Operational Research, 136(3) : 541-550, 2002. https://doi.org/10.1016/S0377-2217(01)00048-0
  3. Conde, E.; "A minmax regret approach to the critical path method with task interval times," European Journal of Operational Research, 197(1) : 235-242, 2009. https://doi.org/10.1016/j.ejor.2008.06.022
  4. Eppstein, D.; "Finding the k shortest paths," SIAM Journal on Computing, 28(2) : 652-673, 1998. https://doi.org/10.1137/S0097539795290477
  5. Inuiguchi, M. and Sakawa, M.; "Minimax Regret Solution To Linear-Programming Problems With An Interval Objective Function," European Journal of Operational Research, 86(3) : 526-536, 1995. https://doi.org/10.1016/0377-2217(94)00092-Q
  6. Kang, J.-G.; "A Heuristic Algorithm to Find the Minimax Regret Longest Path Problem with Interval Lengths," Journal of the Korea Management Engineers Society, 14(3) : 35-46, 2009.
  7. Kang, J.-G.; "Minmax Regret Approach to Disassembly Sequence Planning with Interval Data," Journal of Society of Korea Industrial and Systems Engineering, 32(4) : 192-202, 2009.
  8. Kang, J.-G. and Brissaud, D.; "A Product Lifecycle Costing System with Imprecise End-of-Life Data," in the 14th CIRP Conference on Life Cycle Engineering, Waseda University, Japan, 2007.
  9. Kang, J.-G., Lee, D.-H., and Xirouchakis, P.; "Disassembly Sequencing with Imprecise Data: a Case Study," International Journal of Industrial Engineering-Theory, Applications and Practice, 10(4) : 407-412, 2003.
  10. Karasan, O. E., Pinar, M., and Yaman, H.; "The Robust Shortest Path Problem with Interval Data[Online]," Available at : http://www.ie.bilkent.edu.tr/-mustafap/pubs/.
  11. Kasperski, A. and Zielinski, P.; "An approximation algorithm for interval data minmax regret combinatorial optimization problems," Information Processing Letters, 97(5) : 177-180, 2006. https://doi.org/10.1016/j.ipl.2005.11.001
  12. Kouvelis, P. and Yu, G.; Robust Discrete Optimization and Its Application. Boston. : Kluwer Academic Publishers, 1997.
  13. Montemanni, R. and Gambardella, L. M.; "An Exact Algorithm for the Robust Shortest Path Problem with Interval Data," Computers and Operations Research, 31(10) : 1667-1680, 2004. https://doi.org/10.1016/S0305-0548(03)00114-X
  14. Montemanni, R. and Gambardella, L. M.; "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, 161(3) : 771-779, 2005. https://doi.org/10.1016/j.ejor.2003.10.008
  15. Zieliski, P.; "The computational complexity of the relative robust shortest path problem with interval data," European Journal of Operational Research, 158(3) : 570-576, 2004. https://doi.org/10.1016/S0377-2217(03)00373-4