Algorithms for mission assignment and sequencing problems in a military aviation unit항공기 임무 할당 및 순서결정에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 629
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Yeong-Dae-
dc.contributor.advisor김영대-
dc.contributor.authorKim, Bong-Kyun-
dc.contributor.author김봉균-
dc.date.accessioned2011-12-14T02:41:36Z-
dc.date.available2011-12-14T02:41:36Z-
dc.date.issued2011-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=466350&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40671-
dc.description학위논문(박사) - 한국과학기술원 : 산업및시스템공학과, 2011.2, [ vi, 68 p ]-
dc.description.abstractThis 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.languageeng-
dc.publisher한국과학기술원-
dc.subject분지한계법-
dc.subject발견적기법-
dc.subject할당-
dc.subject-
dc.subjectbranch and bound algorithm-
dc.subjectheuristics-
dc.subjectassignment-
dc.subjectmilitary-
dc.subjectflight scheduling-
dc.subject비행임무 계획-
dc.titleAlgorithms for mission assignment and sequencing problems in a military aviation unit-
dc.title.alternative항공기 임무 할당 및 순서결정에 관한 연구-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN466350/325007 -
dc.description.department한국과학기술원 : 산업및시스템공학과, -
dc.identifier.uid020075018-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.localauthor김영대-
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0