• Journal of Intelligence and Information Systems
• /
• v.11 no.3
• /
• pp.83-101
• /
• 2005

Customer retention is one of the major issues in life insurance industry, in which competition is increasingly fierce. There are many things for the life insurers to do many things to retain the customers. One of those things is to make sure to keep in touch with all customers. When an insurance-planner resigned, his/her customers must be taken care of by some planner-assistants. This article outlines the design of Contact Scheduling System (CSS) that supports planner-assistants for contacting the customers. Planner-assistants are unable to share the resigned insurance-planner's experience and knowledge regarding the customer relationship management. The CSS developed by employing both Classification And Regression Tree (CART) technique and Sequential Pattern Mining (SPM) technique has a two-stage process. In the first stage, it segments the customers into eight groups by CART model. Then it generates contact scheduling information consisting of contact-purpose, contact-interval and contact-channel, according to the segment's typical contact pattern. Contact-purpose is derived by schedule-driven, event-driven, or business-rule-driven. Schedule-driven contact is determined by SPM model. In the operation of CSS in a realistic situation, it shows a practicality in supporting planner-assistants to keep in touch with the customers efficiently and effectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.43-45
• /
• 2006

Ubiquitous 핵심에 위치한 RFID(Radio Frequency IDentification)는 관련 H/W 및 S/W 기술의 발전에 따라 RFID 데이터를 수집하고 분석하여 이를 필요로 하는 응용 서비스에게 제공하거나 연동할 수 있는 RFID 데이터 처리 시스템이 요구된다. 본 논문은 EPCglobal의 표준을 따른 EPC-IS(Electronic Product Code Information Service)를 위한 성능 향상 방안을 제안한다. 제안을 바탕으로 구현한 EPC-IS는 Rule 기반의 Connection Point를 지원함으로써 Legacy Enterprise 시스템과 원활히 연동할 수 있을 뿐만 아니라 Policy 기반의 Backup Scheduling을 제공하여 RFID 시스템의 저장소 관리를 효율적으로 할 수 있는 RFID 데이터처리 시스템이다.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2003

A recent trend In flexible manufacturing systems (FMS) Is to utilize the Identical versatile machines with fast tool delivery devices. Unlike a conventional FMS where parts are fed to the machines with the required tools, tools are acquired from other machines using a tool delivery system and parts can be finished on the same machine In these FMS. Therefore it Is more important problem 4o plan tool flow using tool delivery system In these FMS rather than part flow In conventional FMS. According to the existing study, In FMS 20∼30 percent of the total management cost Is the cost related with tools and It Is possible to reduce the tool Inventory by 40 percent using efficient tool allocation. In this study, In FMS under dynamic tool allocation strategy, a new method of part release considering tool flow at the stage of part release Is proposed. In order to prove the efficiency of the proposed part release It is compared with other part release through simulation experiments. Performance measures in these experiments are the throughput and the number of tardy parts.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.135-144
• /
• 1999

A major concern in Concurrent Engineering is the control and management of workload in a period of process. As a general rule, leveling the peak of workload in a certain period is difficult because concurrent processing is comprised of various processes, including overlapping, paralleling and looping. Therefore, workload management with resource constraints is so beneficial that effective methods to analyze design process This study presents a procedure to transform the IDEF3 process model into the precedence logic network model for more useful assessment of the process. This approach is expected to facilitate resolving resource constrained scheduling problems more systematically in Concurrent Engineering environment.

• Asia pacific journal of information systems
• /
• v.11 no.3
• /
• pp.149-164
• /
• 2001

In this paper, an adaptive workflow management system, called K-WFMS, is proposed. The K-WFMS integrates database system and knowledge-based system to automate business processes that are executed with complex and various business rules such as task scheduling, role resolution, and exception handling rules. The K-WFMS is adaptable in the sense that it allows its users to change workflow schema in the course of workflow execution as well as it provides rule-based modeling constructs to handle predictable exceptions during workflow modeling. The overall architecture and implementation of K-WFMS are explained, and the change propagation mechanism to maintain validity of workflow model is suggested.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.115-120
• /
• 2002

Today's environment of enterprise is changing. They have to face customer' demands with the right product, the right service and supply them at the right time. And also cut down logistics and inventory cost and bring up the profit as much as they can. This means the change of putting enterprise first in importance to putting customer first importance. therefore to correspond to customer's demand, shorting lead time is becoming a essential condition. The answer to this changes of environment is supply chain management. In this paper, It consolidates the necessity on a LTV(Life Time Value) and analyzes data which is concerned of Customer Value. Under the these environments, defines the LTV(Life Time Value) rule that can improve the customer value.

• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.41-52
• /
• 1997

It is essential to construct an efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System (AGVS) plays a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs become complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for dispatching AGV, named MEVTT (Minimum Empty Vehicle Travel Time) and demonstrate its performance and efficiency using simulation.

• Journal of Intelligence and Information Systems
• /
• v.4 no.2
• /
• pp.45-59
• /
• 1998

다양한 산업영역에서 수행되는 스케줄링 문제를 해결하기 위하여 AI분야에서는 지식을 기반으로한 방법이 적용되어 왔다. 그러나 최근 CSP(Constraints Satisfaction Problem) 개념이 소개되어 그 효율성이 입증되고 있으며 스케줄링 응용 문제들이 CSP로 정형화되면서부터 지식 기반 기법과 제약만족 기법의 적용이 공존하고 있다. 지식을 기반으로 한 방법은 도메인 전문가(domain expert)의 지식을 습득하여 시스템에 반영하는데 이러한 지식은 문제해결에 중심적 역할을 수행하게 된다. 제약조건을 기반으로 한 방법은 문제를 CSP로 정형화 한 후 제약조건에 따른 일관성 유지 및 휴리스틱 탐색 방법을 적용하여 문제의 해를 효율적으로 구하게 된다. 본 연구에서는 스케줄링 문제를 해결하기 위한 지식기반 기법과 제약만족 기법을 주기장 할당 문제에 적용하여 실제 항공사의 운항 데이터를 바탕으로 실험하고 분석 및 비교를 통해 제약 만족 기법이 시스템의 유지 및 보수 측면에서 효율적이며 근사해가 아닌 최적해를 통한 문제 해결이 가능함을 보였다.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.558-563
• /
• 2005

This paper presents a GA-based optimal algorithm for a resource leveling model that levels the resources of a set of non-critical activities experiencing conflicts simultaneously up to an assumed level of resource rates specified by the planner using a pair-wise comparison of the activities being considered. A parameter called the future float is adopted and applied as an indicator for assigning leveling priorities to the sets of activities experiencing conflicts. A construction project network example was worked out to demonstrate the performance of the proposed method. The histogram obtained using the algorithm proposed was shown to be the same as, or very close to that produced by the existing resource leveling method based on the least total float rule, which shifts non-critical activities individually.