DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Yeong-Dae | - |
dc.contributor.advisor | 김영대 | - |
dc.contributor.author | Lee, Si-Young | - |
dc.contributor.author | 이시영 | - |
dc.date.accessioned | 2011-12-14T04:23:12Z | - |
dc.date.available | 2011-12-14T04:23:12Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=238290&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41733 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 2004.2, [ 41 p. ] | - |
dc.description.abstract | We suggest several algorithms for a military training timetabling problem (MTTP) that occurs in the Korea army. The MTTP is a generalized version of the professor-lecturer model that was considered for the first time in 1980. Professor-lecturer model is composed of several elements: classes, groups, professors that have only group-lectures and lecturers that have only individual-lectures. Unlike the typical professor-lecturer model, one needs to consider additional constraints to reflect restrictions in real situation, such as those for lunch time, duration of each lecture (2 hours and 4 hours), set-up time occurs between the lectures have different place for lecture (indoor and outdoor) and so on. Since this type of problem is known to be NP-hard, in this research, we propose heuristic algorithms to obtain a reasonably good solution in a reasonable amount of computation time. Since the MTTP is closely related with the edge-coloring problem of a bipartite graph, which is the problem of minimizing the number of colors to color all edges in such a way that adjacent edges receive different colors, we use results of previous research on the graph theory. We present three algorithms including four edge-ordering rules for finding a solution on a bipartite graph, and each edge-ordering rule has weight factors concerned about types of teachers and places for lectures. Results of a series of computational experiments show that the suggested algorithms give good schedules in a reasonably short time and that they can be applied to the real situation. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | MILITARY | - |
dc.subject | EDGE COLORING | - |
dc.subject | TIMETABLING | - |
dc.subject | PROFESSOR LECTURER MODEL | - |
dc.subject | 군 | - |
dc.subject | 신병 훈련 | - |
dc.subject | 시간표 | - |
dc.subject | HEURISTIC | - |
dc.title | Heuristic algorithms for a military training timetabling problem | - |
dc.title.alternative | 신병 훈련 계획 시간표 작성을 위한 알고리듬 개발 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 238290/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 020023443 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.localauthor | 김영대 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.