DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Yeong-Dae | - |
dc.contributor.advisor | 김영대 | - |
dc.contributor.author | Kim, Bong-Kyun | - |
dc.contributor.author | 김봉균 | - |
dc.date.accessioned | 2011-12-14T02:41:36Z | - |
dc.date.available | 2011-12-14T02:41:36Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=466350&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40671 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2011.2, [ vi, 68 p ] | - |
dc.description.abstract | This dissertation focuses on operations planning problems arising in the army aviation units of Korea. There are two types of aviation units in the army, assault units and mobility units. An assault unit performs missions of attacking enemy’s aircrafts, armors and combat forces and protecting friendly units including mobility aviation units, while a mobility aviation unit conducts transportation missions such as maneuvering infantry forces to decisive areas against enemy and/or moving ammunitions and equipments to a place where they are needed. In this study, we focus on scheduling problems in mobility aviation units. As can be seen from the recent wars, mobility aviation units have played important roles to support ground combat forces by supplying war materials. However, since there are a limited number of aviation units and aircrafts in each unit, it is required to develop methodologies to complete all given missions as early as possible within the limited resources. First, we consider a problem which is to assign the flight missions to the aircrafts and schedule these assigned missions on each aircraft with the objective of minimizing makespan, i.e., the time all missions have been completed. Sequence-dependent setup times are required between the missions, and multiple aircrafts may be needed for a mission if work required for the mission exceeds the capacity of an aircraft, but the aircrafts assigned to the same mission should start the mission simultaneously. We develop two methods to convert a sequence of (partial) missions to a (partial) schedule for the problem. Based on the converting methods, we develop several heuristic algorithms for the problem which are composed of two-step procedures: obtaining an initial sequence (solution) of missions in the first step and improving the solution in the second step. Secondly, we consider a situation in which the flight missions are already allocated to each pilot (aircraft) based on pilots’ flight skill, exp... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 분지한계법 | - |
dc.subject | 발견적기법 | - |
dc.subject | 할당 | - |
dc.subject | 군 | - |
dc.subject | branch and bound algorithm | - |
dc.subject | heuristics | - |
dc.subject | assignment | - |
dc.subject | military | - |
dc.subject | flight scheduling | - |
dc.subject | 비행임무 계획 | - |
dc.title | Algorithms for mission assignment and sequencing problems in a military aviation unit | - |
dc.title.alternative | 항공기 임무 할당 및 순서결정에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 466350/325007 | - |
dc.description.department | 한국과학기술원 : 산업및시스템공학과, | - |
dc.identifier.uid | 020075018 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.localauthor | 김영대 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.