• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.101-108
• /
• 2014

The parallel machine scheduling is to schedule each job to exactly one parallel machine so that the total completion time is minimized. It is used in various manufacturing system areas such as steel industries, semiconductor manufacturing and plastic industries. Each job has a setup phase and a processing phase. A removal phase is needed in some application areas. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. Most of previous researches used a single server and considered only a setup phase and a processing phase. If a single server is used for scheduling, the bottleneck in the server increases the total completion time. Even though the number of parallel machines is increased, the total completion time is not reduced significantly. In this paper, we have proposed an efficient algorithm for the parallel machine scheduling using multiple servers and considering setup, processing and removal phases. We also have investigated experimentally how the number of servers and the number of parallel machines affect the total completion time.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.421-422
• /
• 2018

작업 순서 결정 문제의 목표는 다양한 작업들에 대한 최적의 처리 순서를 결정하여 총 처리시간이나 납기 지연과 관련된 지표들을 최소화하는 것이다. 나아가, 실제 생산 현장에서는 작업 처리 순서를 결정할 때, 긴급도나 고객과의 관계 등과 같은 요인을 고려하여 일부 작업들을 특정 시간 내에 완료해야 할 수 있으며, 이 같은 제약 조건을 완료 시간 제약이라 한다. 본 논문에서는 완료 시간 제약을 갖는 작업 순서 결정 문제의 개념과 특성에 대해 살펴보고, 이러한 문제를 풀이하기 위한 알고리즘 개발에 후보 순위 접근법을 적용할 것을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.107-117
• /
• 2004

The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

• Food Science and Preservation
• /
• v.12 no.5
• /
• pp.417-423
• /
• 2005

To replace the traditional drying method with improving the qualities of dried squid, warm air drying method was investigated comparing with natural drying method. In respect of drying rate, about 12 hrs were taken to obtain 25% moisture content -which was considered as proper moisture content to control microbial and quality degradation- by warm air drying at 35$^{\circ}C$. However, 120 hrs were taken to obtain such moisture content by natural drying. The squid dried by warm air showed little color difference and was seemed to be raw squid meat color. TBA values were more rapidly increased but final values were lower, inversely. Free amino acid contents were higher, and cholesterol content was lower in warm air drying.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.13-23
• /
• 2011

Grid computing is a new generation computing technology which organizes virtual high-performance computing system by connecting and sharing geographically distributed heterogeneous resources, and performing large-scaled computing operations. In order to maximize the performance of grid computing, job scheduling is essential which allocates jobs to resources effectively. Many studies have been performed which minimize total completion times, etc. However, resource costs are also important, and through the minimization of resource costs, the overall performance of grid computing and economic efficiency will be improved. So in this paper, we propose a multi-objective job scheduling model considering both time and cost. This model derives from the optimal scheduling solution using NSGA-II, which is a multi objective genetic algorithm, and guarantees the effectiveness of the proposed model by executing experiments with those of existing scheduling models such as Min-Min and Max-Min models. Through experiments, we prove that the proposed scheduling model minimizes time and cost more efficiently than existing scheduling models.

• Proceedings of the Korean Society for Food Science of Animal Resources Conference
• /
• 2004.05a
• /
• pp.254-257
• /
• 2004

닭 도계가 완료된 도체에 $52^{\circ}C$, 1% lactic acid를 이용하여 분무세척하면 육질에 영향을 미치지 않으면서 총호기성균 뿐만 아니라 대장균, E. coli 및 L. monocytogenes의 감소에 효과적일 것으로 사료된다. 하지만 S. typhimurium를 효과적으로 감소시키기 위해서는 온도를 높이거나 처리시간을 연장시키는 것이 좋을 것으로 판단된다.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 1998.04a
• /
• pp.21-21
• /
• 1998

추력방향 제어시스템 설계에 있어서 가장 기본적으로 요구되는 Requirement는 Rocket Motor의 추력, 요구되는 최대 Side Force, Rocket Motor의 외경, System의 총 구동시간, 구동후의 분리여부 등이다. 이러한 Requirement를 만족하기 위해서는 Nozzle 출구의 분출가스 물성치로부터 초음속 유동해석을 통하여 Vane 주위의 속도, 온도, 압력 분포를 구하고, Vane의 받음각 변화에 대한 Aerodynamic Force와 Moment를 계산하고, Side Force를 만족하는 최대 받음각의 결정, Torque를 만족하는 감속기와 Motor의 선정 및 Housing 기본 형상을 설계하였다. 금번 개발에서는 지상 시험용으로서 안전 계수를 Flight Model보다 약간 높게 설계하였으며, 작동 완료 후 System이 Nozzle로부터 떨어져나가는 분리시스템은 포함하지 않았다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.171-171
• /
• 2012

최근 기후변화에 따른 집중호우로 서울을 비롯한 도시의 대규모 침수사태가 빈번히 발생하고 있다. 이러한 재난의 원인으로는 기록적인 집중호우의 영향도 컸지만 도시개발로 인한 불투수성 면적의 증가로 인하여 초기 우수배재가 이루어지지 않은 부분이 대형피해의 원인이 되었다. 본 연구에서는 침투측구의 치수효과분석을 위하여 선행강우 조건 및 50, 100, 150mm/hr의 3가지 강우사상에 대하여 총 23회에 걸쳐 침투측구에 대한 수리실험을 완료하였고, 침투기능이 없는 일반 측구에 대한 실험도 침투측구 수리실험 조건과 동일하게 수행하여 치수효과를 비교 분석하였다. 침투 측구의 치수효과는 총강우량에 대한 총침투량, 총유출량, 유출시작시간, 종기침투능 및 종기침투능에 도달하는 시간 등을 산정하고 선행강우 조건별로 비교 분석하였다. 수리실험결과 가장 작은 강우강도인 50mm/hr 사상에서 측면에 설치된 침투측구의 치수효과가 가장 크게 나타나는 것으로 분석되어. 침투측구의 경우 유출은 선행강우 조건이 없을 경우 일반 측구의 유출발생시간보다 약 53분 후에 발생하였으며, 선행강우 조건이 있을 경우 약 40분후에 발생하였다. 분석된 결과를 토대로 투수성 침투측구에 대한 투수계수별 CN값을 산정하여 침투측구의 실무 적용방안을 논의하였으며, 본 연구의 결과를 이용하여 풍수해저감을 위한 저감대책을 수립하고, 집중호우에 의해 발생되는 초기우수의 저류에 대한 정량적인 효과분석을 기대할 수 있을 것으로 판단된다.

• Aerospace Engineering and Technology
• /
• v.11 no.1
• /
• pp.42-48
• /
• 2012

The telemetry data received from satellite in real-time are used to monitor LEO satellite during the AIT (Assembly, Integration & Test) phase and the mission operation phase after launch. However, it is impossible to check all the incoming telemetry data from satellite in real time in order to detect abnormality of satellite quickly. Especially, the contact time of LEO satellite is limited because of its orbital characteristics. So the anomaly state of the LEO satellite should be detected and resolved during the contact time. Therefore, all incoming spacecraft telemetry data must be selected and manipulated in MIMIC. It is used in order to display summarized information about spacecraft in a visualized way that is quickly and easily understood. That is, it provides essential function to monitor a satellite both in orbit and during testing. In this paper, the design and development of MIMIC currently used in KOMPSAT, a LEO Earth observation satellite is described in detail. In future work, we plan to enhance MIMIC in order to improve user-friendliness and efficiency.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.77-87
• /
• 1995

In this paper we develop an efficient heuristic algorithm for the problem of scheduling n sequence-dependent jobs on a basic processor to minimize makespan. Efficient solution methods are already known for the sequence- independent case. But for the sequence-dependent case, this problem belongs to a set of strong NP-complete problems. We present a heuristic which is similar to shortest setup time heuristic but opportunity cost of setup time rather than shortest setup time is used for choosing next job. This heuristic algorithm has same computational complexity and worst case ratio as the shortest setup time heuristic. We used Wilcoxon signed rank test to show that our heuristic is superior to nearest setup time heuristic in term of average behavior.