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 and the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

Abstract
 1. 서 론
 2. A Heuristic Algorithm and Improvement
 3. Computational Experiments
  3.1. 네트워크 모형 및 가중치 생성
  3.2. 실험 결과
 4. 결론 및 추후연구
 참고문헌

• 강준규(성결대학교)