Artillery fire power due to effectiveness which is hard to predict well-planned and surprising attack can give a fear and shock to the personnel and is a very core weapon system and takes a critical role in wartime. Therefore in order to maximize operational effectiveness, Army required protecting artillery and takes a quick attack action through rapid construction of artillery’s positions. The artillery use artillery’s position to prevent exposure by moving to other position frequently. They have to move and construct at new artillery’s positions quickly against exposing existed place by foe’s recognition. These positions should be built by not manpower but engineering construction equipment. Because artillery positions have to protect human and artillery equipment well and build quickly. Military engineering battalion have lots of construction equipment which include excavator, loader, dozer, combat multi-purposed excavator, armored combat earthmover dump truck and so on. So they have to decide to optimal number of Team combining these equipments and determine construction sequence of artillery’s position in operational plan. In this research, we propose to decide number of Team efficiently and allocate required construction’s positions for each Team under constraints of limited equipments and time. To do so, we develop efficient heuristic method which can give near optimal solution and be applied to various situation including commander’s intention, artillery position’s priority or grouping etc. This heuristic can support quick and flexible construction plan of artillery positions not only for using various composition’s equipment to organize Teams but also for changing quantity of positions.

To ensure that the production system of a factory is efficient, the factory layout design should consider the location and material flow plans of facilities, workshops, and storage areas. Highly productive factories need to have an optimized layout planning process, and a customized design methodology of the production system is a necessity for feasible layout planning. This paper presents a method for designing a layout module's size and shape and provides a heuristic location-allocation algorithm for the modules. The method is implemented and validated using a rich internet application-based platform. The layout design method is based on the leisure ship production process; this method can be used for designing the layout of a new factory or remodeling an existing factory and its production system. In contrast to existing layout methods, the inputs required for the proposed method, such as target products, production processes, and human-resource plans, are simple. This layout design method provides a useful solution for the initial stage of factory design.

선거구 구획문제는 선거구를 인구등분, 인접성, 공간적 조밀도 등의 일정한 기준에 따라서 나누는 작업을 말한다. 미국의 경우 의회 선거구는 필수불가결한 요소로 완벽한 인구 등분과 인접성을 헌법으로 요구하고 있다. 그러나 기존의 휴리스틱은 여러 가지 선거구 선정요인들을 동시에 만족시키는데 주력하고 있어 의회선거구에 맞는 완벽한 인구등분을 가진 선거구 플랜을 찾는데 한계를 보이고 있다. 그리하여, 이 논문에서는 의회선거구 구성 요건에 맞는 선거구 구획 연구를 하고자 최적화 연구방법 중 시뮬레이티드 어닐링(모의 담금질 기법) 휴리스틱 기법을 기본 바탕으로 선거구를 구획하였다. 또한 새로운 인접성 방법을 제시하여, 구획연구를 하는데 있어 하나의 접근법으로 제시하고자 한다. 연구 결과 이 논문에서 이용된 기법은 실제 이용 중인 선거구 플랜보다 훨씬 더 인구등분에 가까운 선거구 플랜을 찾아내며, 효과적으로 인접성 문제를 해결하고 있음을 알 수 있었다. 또한, 새로 개발한 휴리스틱은 다양한 선거구 플랜을 제시하고 있어, 의사결정자들로 하여금 선택의 용이성을 제공하고 있음을 알 수 있었다. 이러한 시도는 의회 선거구를 구성하는데 있어서 새로운 대안으로 제시될 수 있을 것이다. 또한, 이러한 선거구 선정 연구는 한국의 국회의원 선거구 선정문제에서 인접성과 인구등분의 선정기준을 이용할 시 적용 할 수 있다는데 그 의의가 있다.

Recently, the optimisation of end-of-life (EOL) product remanufacturing processes has been highlighted. In particular, computer remanufacturing becomes important as the amount of disposed of computers is rapidly increasing. At the computer remanufacturing, depending on the selections of used computer parts, the value of remanufactured computers will be different. Hence, it is important to select appropriate computer parts at the reassembly. To this end, this study deals with a decision making problem to select the best combination of computer parts for minimising the total remanufacturing computer cost. This problem is formulated with an integer nonlinear programming model and heuristic search algorithms are proposed to resolve it.

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

This paper presents a data-mining aided heuristic algorithm development. The developed algorithm includes three steps. The steps are a uniform selection, development of feature functions and clustering, and a decision tree making. The developed algorithm

Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

교육의 질을 향상시키는 것은 고등 교육 발전의 핵심 과제이며, 이를 실현하기 위해 교사는 교육 개혁을 지속적으로 추진하고 교육 방법을 계속 최적화해야 한다. 이 논문은 제2외국어인 한국어 수업 실천을 바탕으로 이론 연구를 통해 교과 과정의 이론적 기초를 확립하고 설문 조사 등 방법을 통해 현재 제2외국어인 한국어 수업의 문제점을 분석한 다음 이론과 실천을 결합하여 수업 과정에서 ‘사례식-계발식-상호작용식’ 수업 모델을 통합하는 구체적인 방법을 모색하여, 제2외국어인 한국어 수업의 ‘사례식-계발식-상호작용식’ 다차원 교수 모형을 형성하고자 한다. 다른 비슷한 수업의 교수법 개발에 참고를 제공할 수 있기를 바란다.