• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.195-198
• /
• 1995

In Semi-Solid Forging, it is necessary to control the forming variables accurately in order to make near-net-shape products. Generally, the defects of products may occur due to liquid segregation which can be caused by the degree of deformation and condition of friction in Semi-Solid Forging, where the segregation is to be predicted by flow analysis. This paper presents the feasibility of theoretical analysis model using the new yield function which is proposed by Doraivelu et al. to the flow analysis of the semi-solid dendritic Sn-15%Pb alloys instead of adopting the yield criterion of Shima & Oyane which is used by Charreyron and usefulness of the adopted yield function. The distribution of the liquid fraction at various strains in radial direction and the influence of friction are estimated by Upper Bound Method.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1994.03a
• /
• pp.55-62
• /
• 1994

For theoretical estimate of closed-die forging pressure, upper-bound method is applied to the involute tooth profile. In the analysis, the deformation regions have been divided into several zones. A constant frictional stress has been assumed on the contacting surfaces. Utilizing the formulated velocity fields, numerical calculations have been carried out to investigate the effects of various parameters, such as module, number of teeth and friction factor, on the forging of spur gears. Very close agreement was found between the predicted values of forging load and those obtained from experimental results.

• Korean Management Science Review
• /
• v.23 no.3
• /
• pp.13-25
• /
• 2006

To reduce the signaling tost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems. The effectiveness of the 1)reposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.

• Korean Journal of Environmental Biology
• /
• v.20 no.2
• /
• pp.101-108
• /
• 2002

Benthic organisms dwell in sediment-water interface that contains significant amount of organic and inorganic contaminants. Their feeding behavior is highly related with sediment itself and pore water in the sediments, especially in ease of deposit feeder (i.e. polychaete, amphipod). The acid volatile sulfide (AVS) is one of the important binding phases of sediment-bound metals in addition to organic matter and Fe and Mn oxide fractions in sediments, particularly in anoxic sediments. The AVS model is a powerful tool to predict metal bioavailability and bioaccumulation in benthic organisms considering SEM/AVS mole ratios in surficial sediments. However, several biogeochemical factors must be considered to use AVS model in the sediment-bound metal bioavailability.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.61-70
• /
• 2005

In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.29-37
• /
• 2009

This paper proposes a curtailed-sequential probability ratio test (SPRT) control chart. For using the conventional SPRT control chart, the number of items inspected in a sampling point should have no restriction since items in a sampling point are inspected one by one until an SPRT Is terminated. The number of observations taken in a sampling point, however, has an upper bound since sampling and testing of an item is time-consuming or expensive. When the sample size reaches the upper bound without evidence of an in-control or out-of-control state of a process, the proposed chart makes a decision using the sample mean of all observations taken in a sampling point. The properties of the Proposed chart are obtained by a Markov chain approach and the performance of the chart is compared with fixed sample size (FSS) and variable sample size (VSS) control charts. A comparative study shows that the proposed chart performs better than VSS control charts as well as conventional FSS control charts.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.631-638
• /
• 2018

Chellai et al. [3] gave an upper bound on the [1, 2]-domination number of tree and posed an open question "how to classify trees satisfying the sharp bound?". Yang and Wu [5] gave a partial solution for tree of order n with ${\ell}$-leaves such that every non-leaf vertex has degree at least 4. In this paper, we give a new upper bound on the [1, 2]-domination number of tree which extends the result of Yang and Wu. In addition, we design a polynomial time algorithm for solving the open question. By using this algorithm, we give a characterization on the [1, 2]-domination number for trees of order n with ${\ell}$ leaves satisfying $n-{\ell}$. Thereby, the open question posed by Chellai et al. is solved.

• Journal of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.479-491
• /
• 2017

We investigate the zeros of Epstein zeta functions associated with positive definite quadratic forms with rational coefficients in the vertical strip ${\sigma}_1$ < ${\Re}s$ < ${\sigma}_2$, where 1/2 < ${\sigma}_1$ < ${\sigma}_2$ < 1. When the class number h of the quadratic form is bigger than 1, Voronin gave a lower bound and Lee gave an asymptotic formula for the number of zeros. Recently Gonek and Lee improved their results by providing a new upper bound for the error term when h > 3. In this paper, we consider the cases h = 2, 3 and provide an upper bound for the error term, smaller than the one for the case h > 3.