메뉴 건너뛰기

ENG

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
(KAIST) (KAIST)
저널정보
대한산업공학회 대한산업공학회지 대한산업공학회지 제44권 제2호
발행연도
수록면
114 - 123 (10page)
DOI
10.7232/JKIIE.2018.44.2.114

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
이 논문의 연구방법이 궁금하신가요?
🏆
연구결과
이 논문의 연구결과가 궁금하신가요?
AI에게 요청하기
추천
검색
질문

초록· 키워드

In this paper, we propose a MIP model for optimal planning of Countermaneuver Support Mission (CSM) through parallel machine scheduling. CSM is carried out by battle platoons of Engineer company, and is a military operation to stop or delay the enemy’s maneuver by using rockfall or bridge-blowing up. The concept of cooperation by platoons is proposed to shorten the mission completion time. We propose experimental results that the mission completion time with consideration of cooperation is shorter than that without consideration of cooperation. Additionally, we confirm that cooperation is still effective in shortening the mission completion time even if the capability is not at its maximum and is reduced by a certain ratio. Finally, since the parallel machine scheduling problem belongs to the NP-hard problem, we propose a solution approach using genetic algorithm in order to obtain a near optimal solution of a larger scale problem within a fast computation time.
#Military Mission Planning #Parallel Machine Scheduling #Cooperation #Genetic Algorithm
상세정보 수정요청해당 페이지 내 제목·저자·목차·페이지
정보가 잘못된 경우 알려주세요!

목차

  1. 1. 서론
  2. 2. 배경
  3. 3. 협업의 특성 및 수리 모형
  4. 4. 유전 알고리즘
  5. 5. 실험 결과 및 분석
  6. 6. 결론
  7. 참고문헌

참고문헌

참고문헌 신청

최근 본 자료

전체보기
260319_딥리서치
260319_AI리더
260304_새학기에이전트
260122_AIagent
260304_아그논문롤
260127_아그논문
260127_AI뷰어
UCI(KEPA) : I410-ECN-0101-2018-530-001857478