• 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.

• Journal of Information Technology Services
• /
• v.10 no.3
• /
• pp.49-59
• /
• 2011

A ship scheduling model is presented for the raw material transportation problem with yard storage constraints in a steel mill. The problem is formulated as 0, 1 mixed integer programming considering such constraints as loading port conditions, ship size and hold capacity, unloading conditions, and yard storage space. In addition, inventory related constraints including safety stock are taken into consideration to support the continuous operations of steel making process. The proposed model has been implemented and applied successfully to a real world problem, and its results show the improvement of performance compared to the traditional method. For example, the arrival dates of ships are determined satisfying the constraints. The total inventory level is minimized at the stock yard as a result. Also, the safety inventory level is always kept at the planning stage, and the standard deviation of total inventory level is reduced significantly. Further research is expected to develop efficient heuristics to have a better response time for even larger scale problems.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• Journal of the Society of Naval Architects of Korea
• /
• v.43 no.3 s.147
• /
• pp.362-374
• /
• 2006

Currently, all design information of a hull structure is being first defined on 2D drawings not 3D CAD model at the initial ship design stage and then transferred to following design stages through the 2D drawings. This is caused by the past design practice, limitation on time, and lack of hull structural CAD systems supporting the initial design stage. As a result, the following design tasks such as the process planning and scheduling are being manually performed using the 2D drawings. For solving this problem, a data structure supporting the initial design stage is proposed and a prototype system is developed based on the data structure. The applicability of the system is demonstrated by applying it to various examples. The results show that the system can be effectively used for generating the 3D CAD model of the hull structure at the initial design stage.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• IE interfaces
• /
• v.17 no.2
• /
• pp.242-248
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.38 no.1
• /
• pp.98-106
• /
• 1996

An irrigation scheduling model, IRIS developed to evaluate irrigation demand and irrigation time for upland crops. For IRlS modeling the soil moisture simulation model, SWATRER was adopted and modified. The developed model, IRIS operated under 5 different soil moisture level that is 20%, 40%, 60%, 80% of available soil moisture and optimum soil moisture level, OSML, which is different about the growing stage and no rainfall condition during growing period. As a result for IRIS simulation, irrigation demand for 5 different soil moisture level was 332.3, 409.8, 569.3, 732.2, 539.3mm, irrigation number was 5, 8, 18, 54, 16 times and irrigation interval during peak time of consumptive use was 20, 13, 6, 2, 6 days respectively. It is appeared that the higher soil moisture level the more irrigation demand and irrigation number and the higher soil moisture level the less irrigation interval.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.204-213
• /
• 2008

Companies that produce capital goods need to schedule the production of products that have complex product structures with components that require many operations on different machines. A feasible schedule must satisfy operation and assembly precedence constraints. It is also important to avoid deadlock situations. In this paper a Genetic Algorithm (GA) has been developed that includes a new repair process that rectifies infeasible schedules that are produced during the evolution process. The algorithm was designed to minimise the combination of earliness and tardiness penalties and took into account finite capacity constraints. Three different sized problems were obtained from a collaborating capital goods company. A design of experimental approach was used to systematically identify that the best genetic operators and GA parameters for each size of problem.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.269-270
• /
• 2008

TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources, and includes a new feature called HSDPA (high-speed downlink packet access) in the R5 stage. The TD-HSDPA supports high-speed traffic with a shared channel, but the adopted mechanism causes feedback problem for scheduling. In this paper, we propose an improved mechanism that transmits channel quality indicator (CQI) more frequently, so that the TD-HSDPA scheduler can utilize all possible information about the downlink channel status.