논문 상세보기

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

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

  • 언어KOR
  • URLhttps://db.koreascholar.com/Article/Detail/22797
구독 기관 인증 시 무료 이용이 가능합니다. 4,000원
한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)
한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)
초록

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-

저자
  • 강준규 | Jun-Gyu Kang
  • 윤협상 | Hyoup-Sang Yoon