• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.81-85
• /
• 2004

This study analyzes strategy and main contents between each business market by mobile phone Number Portability. And, grasps what each mobile company customer satisfaction factors is effected on mobile phone Number Portability and estimates relative importance about the factors and understand counter strategies by these factors. Concretely, this paper searched the important quality factor by frequency analysis, factor analysis, regression analysis and path analysis etc. And The sample data is subscriber using mobile communication service of the existing mobile communication company (SKT, KTF, LGT)

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.740-745
• /
• 2005

Selective assembly is a method to find out appropriate matching pairs to be assembled to enhance the quality of the product. This study proposes an algorithm to select and match the components with two performance characteristics: at first, the number of matchable mates are calculated for each components. A matchable mate is defined to be the one of which the values of each performance characteristics lie in a rectangular mesh originated from the component under consideration. And the highest priority is given to the item with smallest number of matchable mates. The item of highest priority is matched to the one with smallest number of matchable mates among them. To find out the mates for the unmatched items, the mesh size is enlarged at the next iteration. Beginning with a small mesh, the procedure is repeated until the mesh covers the tolerance intervals of each performance characteristics. A VCR head case is analyzed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.15-27
• /
• 1998

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.234-241
• /
• 1996

Trip-based material handling systems such as AGV systems, lift trucks, etc. are often designed with a given flow matrix (or FROM-TO chart) which is usually treated as the number of loaded trips that the devices must perform per unit time between the stations. In reality, the number of trips that would result from parts flow in a facility is dictated by the transfer batch size, i.e., the number of parts that are transferred from one station to the next in one trip. In this paper, we present analytical and simulation results aimed at determining optimal or near-optimal transfer batch sizes in manufacturing systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.167-172
• /
• 1997

We present a procedure which finds the probability distribution of number of customers accumulated when the server ends a vacation in the Geo/G/1 gated queueing system, where the service for a customer and the vacation, respectively, takes one slot time. The pp. g. f. for the number of customers accumulated at the gate closing epoch is obtained as a recursive form. The full probabilities, then, are derived using an iterative procedure. This system finds an application in a packet transmitting telecommunications system where the server transmits(serves) packets(customers) accumulated at a gate closing epoch, and takes one slot time vacation thereafter.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.2
• /
• pp.19-34
• /
• 2017

In this study, we develop an optimal sourcing strategy considering compensation orders to mitigate the supply chain disruption risks. We considered two-echelon supply chain consisting of a single buyer and multiple suppliers who have fixed transaction cost and probabilistic disruption risks. Under this setting, we provide the joint optimization method to determine the number of suppliers and the order quantities. Through numerical examples, we provide managerial implications on the sourcing strategy by investigating changes in the order quantities and the number of suppliers due to the degree of supply chain disruption risks.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.63-68
• /
• 1983

The ideal way of eliminating errors in a large scale software system is to test the software with all possible inputs, providing sufficiently large amount of execution time. However, in practice, the test must be performed within given budget and time limits. Therefore, to perform the test under given constraints, we have to properly select inputs and determine the execution time for each selected inputs. This paper studies the distribution of number of errors at a given time as well as the distribution of time required to reduce the number of errors to a certain level. We assumed that error occurrence times are distributed exponentially (not necessarily identical) and the number of errors at the initial stage is known or estimable.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.530-533
• /
• 1996

This paper deals with finding an initial solution and modifying search direction by the centrering force in the predictor-corrector method which is a variant of the primal-dual barrier method. These methods were tested with NETLIB problems. Initial solutions which are located close to the center of the feasible set lower the number of iterations, as they enlarge the step length. Three heuristic methods to find such initial solution are suggested. The new methods reduce the average number of iterations by 52% to at most, compared with the old method assigning 1 to initial valurs. Solutions can move closer to the central path fast by enlarging the centering force in early steps. It enlarge the step length, so reduces the number of iterations. The more effective this method is the closer the initial solution is to the boundary of the feasible set.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.55-65
• /
• 1992

There are takes performed on only one side (right side or left side) of the assembly line, and task groups in which the tasks are more related to one another like a subassembly. In the Assembly Line Balancing (ALB) of the large-sized product such as bus and truck, the side on which tasks are performed and the related task groups should be considered to improve work methods and to appropriately lay out parts and facilities in the line. In this paper, presented are the 0-1 programming formulations for the ALB with the constraints of assigning the same side tasks to the station. The objective of minimizing the number of stations is combined with the objective that the total number of the related task groups handled by all the stations is minimized. Also, proposed are the methods of reducing the number of variables and constraints, and of determining the station to which subassembly tasks are assigned.