• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.47-57
• /
• 2000

In this paper we consider an n-job non-preemptive and identical parallel machine scheduling problem of minimizing the sum of earliness and tardiness with different release times and due dates. In the real world this problem is more realistic than the problems that release times equal to zero or due dates are common. The problem is proved to be NP-complete. Thus a heuristic is developed to solve this problem To illustrate its suitability a proposed heuristic is compared with a genetic algorithm for a large number of randomly generated test problems. Computational results show the effectiveness and efficiency of proposed heuristic. In summary the proposed heuristic provides good solutions than genetic algorithm when the problem size is large.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.325-336
• /
• 1996

This study is concerned with developing a heuristic for the vehicle routing problem(VRP) which determines each vehicle route in order to minimize the transportation costs, subject to meeting the demands of all delivery points. VRP is known 10 be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristic are more frequently developed than optimal algorithms. This study aims to develop a heuristic which can give a good solution in comparatively brief time. Finally, the computational tests were performed using the benchmark problems and the proposed heuristic is compared with the other existing algorithms. The result of computational tests shows that the proposed heuristic gives good solutions, in much shorter time, which are not 1% more expensive than the best known solutions, which are same as the best known solutions in the previous researches.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.156-165
• /
• 2005

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper, This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.142-152
• /
• 2009

We developed two heuristic methods to solve the problem considering a fleet of ships delivering chemical products from terminals to terminals. We need to decide how much of each product to carry, on which ship, subject to the conditions that all terminals must have sufficient products to meet demand, and the stock levels of the products cannot exceed the inventory capacity of that terminal. Mathematical formulation and the optimal objective value for the small size problems are compared with two greedy heuristic methods developed in terms of solution qualities and computing time. Numerical experiments on test problems indicate that the heuristics are effective at finding good solutions quickly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.275-284
• /
• 1996

It can be made a definition that scheduling is a imposition of machinery and equipment to perform a collection of tasks. Ultimately scheduling is an assessment of taking order for which would be perform. So it is called "sequencing" in other words. In a job shop scheduling, the main object is to making delivery in accordance with the due date and order form customer, not to producing lots of quantity with minimizing mean flow time in a given time. Actually, in a company, they concentrate more in the delivery than minimizing the mean flow time. Therefore this paper suggest a new priority dispatching rule under consideration as below in a n/m job shop scheduling problem with due date. 1. handling/transportation time, 2. the size of customer order With this algorithm, we can make a scheduling for minimizing the tardiness of delivery which satisfy a goal of production.roduction.

• Journal of Educational Research in Mathematics
• /
• v.25 no.1
• /
• pp.95-111
• /
• 2015

The purpose of this study is to analyze cases on teaching solutions exploration of Wythoff's game through using the analogy for the gifted elementary students, to suggest useful teaching methods. Students recognized structural similarity among problems on the basis of relevance of conditions of problems. The discovery of structural similarity improves the ability to solve problems. Although 2 groups-NIM game with surface similarity is not helpful in solving Wythoff's game, Queen's move game with structural similarity makes it easier for students to solve Wythoff's game. Useful teaching methods to find solutions of Wythoff's game through using the analogy are as follow. Encoding process helps students make sense of the game. It is significant to help students realize how many stones are remained and how the location of Queen can be expressed by the ordered pair. Inferring process helps students find a solution of 2 groups-NIM game and Queen's move game. It is necessary to find a winning strategy through reversely solving method. Mapping process helps students discover surface similarity and structural similarity through identifying commonalities between the two games. It is crucial to recognize the relationship among the two games based on the teaching in the Encoding process. Application process encourages students to find a solution of Wythoff's game. It is more important to find a solution by using the structural similarity of the Queen's move game rather than reversely solving method.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1992.06a
• /
• pp.66-70
• /
• 1992

고전적 동수압유체윤활이론은 유막 내의 점성을 일정하다고 가정한다. 유막의 전개방향이나 유막두께방향으로의 온도변화를 결정하는 데 이론적으로나 실험적으로 어려움이 있으므로 이 간소화는 베어링설계에 널리 사용되었다. 그러나 많은 실험적 관찰은 등점성 동수압유체윤활이론은 유막내의 온도상승이나 하중지지용량의 감소를 설명하지 못함을 입증하였다. Fogg는 평행한 추력베어링이 하중을 지지할 수 있음을 발견하였으며 이 fogg의 효과는 동수압 유체윤활이론의 예측과 반대되는 것이고 Thermal wedge라는 개념으로 설명되었다. Hunter와 Zienkiewicz는 유막내에서의 에너지 균형에 관한 이론적 연구를 소개하였고, 온도효과와 이로 인한 유막두께 방향의 점도 변화는 무시될 수 없다는 결론을 내렸다. 본 해석에서는 압력분포를 근사해법으로 구하여, 선지지되는 2차원 틸팅패드 트러스트베어링에서 패드의 탄성 변형을 고려한 열유체윤활해석과 고려하지 않은 얼유체윤활 해석의 결과를 서로 비교함으로서 패드의 변형이 유막의 압력장과 온도장에 미치는 영향과 패드두께의 변화가 유막의 온도장과 압력장에 미치는 영향을 고찰하고자 한다.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.313-320
• /
• 2004

시장 환경의 전반적인 변화로 인하여 시장 규제가 완화되고 그로 인한 경쟁사가 늘어나고 있고, 공급자 중심의 시장에서 구매자 중심의 시장으로 변화되어 가고 있다. 이에 기업들은 고객과의 관계를 강화하기 위해 CRM을 중요한 해법으로 생각하여 다양한 방법으로 고객만족을 높이는데 주력하고 있다. 또한 정보기술의 발달로 인해 웹 상에서의 eCRM이 출현되었고 웹 상에서 고객의 데이터를 분석하여 적시에 고객의 니즈에 맞는 서비스를 제공해주는 Recommendation system 을 개발하여 좀더 향상된 eCRM 으로 원투원 마켓팅을 통해 판매 강화 및 고객만족도 제고를 실현할 수 있도록 발전되어왔다. 이중 eCRM의 Recommendation Engine은 고객의 니즈를 발견해내어 그에 맞는 다양한 상품들을 추천하는 시스템으로 Rule 기반의 컨텐츠 매칭 기법과 Collaborative Filtering 기법을 사용하였다. 그러나 이 기법들은 미리 정해진 Rule에 의해 사전적인 대응을 하지 못한다는 문제점과 비정형적인 정보 및 환경정보에 복합적인 판단이 고객중심의 현재 상황에 따라 이루어지지 못한다는 문제점을 가지고 있다 이에 본고에서는 이 문제에 대한 해결안으로써 Ontology를 이용한 실시간 추천시스템을 모델로 제시하고자 한다.

• Proceedings of the CALSEC Conference
• /
• 1997.11a
• /
• pp.53-58
• /
• 1997

본 논문에서는 통합 Logistics Center라는 새로운 조직을 통해서, 생산, 영업 및 물류를 총괄하여, 전체 공장과 전체 DC/SB의 재고량을 줄이고. 결품현상 방지, 수송비용 절감을 도모할 수 있는 통합 물류 시스템을 구축하는데 필요한 각 Process 및 이를 수행할 수 있는 발견적 해법을 개발하는 것을 연구한다. 생산(공장)에는 가장 정확한 각 DC/SB의 수요 예측량을 토대로 수립된 발주량과, 이 발주량을 통해서 결정된 생산의뢰 계획을 제공한다. 이 생산 계획은 제품이 생산되어서 출고될 때, 근거리 지역에 있는 DC/SB에 출고될 수 있도록, 각 공장의 전용라인에 대해서는 최소 수송비용을 고려한다. 제품의 혼합생산 라인의 정보( 생산 Capa.)를 이용하여 나머지 발주량을 생산 의뢰 계획으로 바꾸게 된다. 공장에서는 이 계획을 바탕으로 생산 계획을 수립하여, 그 계획과 생산된 제품을 DC/SB로 출고시킨다. 공 장의 출하 가능량과 각 DC/SB의 2주전의 발주량은 실제 많은 차이가 발생하므로, 이를 재조정하여, 공장의 재고를 최소로 하는 방향으로 공장의 출하 가능량을 조절한다. 조절된 출하 가능량은 2일간의 근거리 수송 원칙에 의해서 입고될 DC/SB를 결정한다. 공장의 출고를 돕기 위해서 배차계획을 수립한다. 본 연구에서는 각각의 Process Engine들의 활동과 정보의 흐름이 서로 상이한 시간 간격으로 발생할 때 각 Process Engine 의 Input/output으로 사용되는 정보의 효율적인 Systematic 동기화 및 Database와 interface 및 Multi-Tasking Database Transaction을 고려할 것이다.

• Journal of Intelligence and Information Systems
• /
• v.12 no.4
• /
• pp.39-51
• /
• 2006

This study addresses how to plan purchasing and leasing of containers to satisfy the demand on containers. The problem can be further decomposed into the long-term planning and the short-term scheduling. The long-term plan specifies the composition of owned containers, long-term leasing containers, and short-term containers. The short-term plan considers the seasonality of demand and determines the time of leasing and the amount of the short-term and the long-term leasing containers. The length of the planning horizon is 10-20 years for the long-term planning, while it is one year for the short-term planning. The time unit is one year for the long-term planning, while it is one month for the short-term planning. This study discusses how to estimate the demand of containers and proposes deterministic models for scheduling purchasing and leasing of containers.