• 산업공학
• /
• 제23권4호
• /
• pp.327-336
• /
• 2010

We consider a supply chain consisting of a make-to-order manufacturer and N component suppliers and study the impacts of the number of suppliers on component inventory management. The manufacturer has full information and continuously observes the state of both component inventory level and customer backorders. Based on this information, the manufacturer determines whether or not to place a component purchasing order to a supplier among N suppliers even though some orders are in process by other suppliers. The goal of this paper is to numerically identify the manufacturer's purchasing policy which minimizes the total supply chain cost and the best choice of N. Our model contributes to the current literature in that the problem of simultaneously considering multiple outstanding orders and incorporating order setup cost into the model has not been covered yet. From numerical experiment, we investigate how much the policy with N suppliers can contribute to reducing the supply cost compared to the policy with a single supplier.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• Ocean and Polar Research
• /
• 제37권3호
• /
• pp.179-188
• /
• 2015

This study was carried out to determine the optimal number of ARGO floats in the East Sea in order to maximize their applications. The dominant spatio-temporal scale, size of the domain, and the typical float lifetimes in the East Sea were taken into consideration. The mean spatial de-correlation scale of temperature on isobaric surfaces reaches about 60 km. The minimum necessary number of floats is about 82 on average in order to secure independent ARGO profiles with the de-correlation scale. Considering the float lifetimes, about 27 floats per year should be deployed to maintain the 82 ARGO float array every year. To obtain spatially uniform distribution of ARGO float data, mean residence time and dispersion rate (basin area/residence time) of ARGO floats were evaluated in each basin of the East Sea. A faster (slower) dispersion rate requires more (less) ARGO floats to maintain the spatially uniform number of floats. According to the analysis, it is likely that the optimal ratio of the number of floats for each basin is 1:2:4 corresponding to Ulleung Basin:Yamato Basin:Japan Basin. In order to maintain relatively uniform ARGO observing networks, it is necessary to establish a long-term plan for deployment strategy based on float pathways and the dispersion rate parameters estimated by using currently active ARGO float trajectory data as well as reanalysis data.

• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.172-180
• /
• 2013

We herein consider a stochastic multi-item inventory management problem in which a warehouse sells multiple items with stochastic demand and periodic replenishment from a supplier. Inventory management requires the timing and amounts of orders to be determined. For inventory replenishment, trucks of finite capacity are available. Most inventory management models consider either a single item or assume that multiple items are ordered independently, and whether there is sufficient space in trucks. The order cost is commonly calculated based on the number of carriers and the usage fees of carriers. In this situation, we can reduce future shipments by supplementing items to an order, even if the item is not scheduled to be ordered. On the other hand, we can reduce the average number of items in storage by reducing the order volume and at the risk of running out of stock. The primary variables of interest in the present research are the average number of items in storage, the stock-out volume, and the number of carriers used. We formulate this problem as a multi-objective optimization problem. In a numerical experiment based on actual shipment data, we consider the item shipping characteristics and simulate the warehouse replenishing items coordinately. The results of the simulation indicate that applying a conventional ordering policy individually will not provide effective inventory management.

• 대한수학회보
• /
• 제42권3호
• /
• pp.639-652
• /
• 2005

We find the class number of orders in a quaternion algebra over a dyadic local field.

• 한국전산유체공학회지
• /
• 제16권4호
• /
• pp.100-109
• /
• 2011

Large eddy simulation(LES) of fully developed turbulent pipe flow has been performed to investigate the effect of Reynolds number on the flow field at $Re_{\tau}$=180, 395, 590 based on friction velocity and pipe radius. A dynamic subgrid-scale model for the turbulent subgrid-scale stresses was employed to close the governing equations. The mean flow properties, mean velocity profiles and turbulent intensities obtained from the present LES are in good agreement with the previous numerical and experimental results currently available. The Reynolds number effects were observed in the higher-order statistics(Skewness and Flatness factor). Furthermore, the budgets of the Reynolds stresses and turbulent kinetic energy were computed and analyzed to elucidate the effect of Reynolds number on the turbulent structures.

• 대한수학회논문집
• /
• 제33권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.

• 생명과학회지
• /
• 제9권5호
• /
• pp.628-637
• /
• 1999

This study was conducted to elucidate the leaf characteristics, leaf number and fertilizing level in perilla, Perilla frutescens, which was cultivated using five types organic compost with three level. Number of the harvested leaves was effective in Heulgnara with 800 kg/10 and Poongjag with 1200 kg/10 at 70 days and organic compost were the highest in Sarang followed by Heulgnara and Poongjag in order. Number of leaf harvested during the fifth times was the highest Poongjag followed by Heulgnara and Sarang in order. Leaf length and leaf width were the highest in Poongjag with 1200 kg/10 a at 70 days. Simple method for calculation of fertilizer level was N 6.09 kg and slaked lime 36.56 kg in Heulgnara 100 kg per 10 a. Recommendation level of chemical fertilizer in Heulgnara due to fertilizer method was N 275.10 kg, P 4.3 kg and K 10 kg per 10 a.

• 전자공학회논문지A
• /
• 제33A권4호
• /
• pp.142-151
• /
• 1996

This paper presents a new symmetrical routing architecture for FPGA and an efficient routing algorithm for the architecture. The routing architecture adopts the segmented wires and the improved switch modules. Segmetned wires construct routing channels which pass through the chip in vertical and horizontal directions. To maximize the utility of a track, a track in each switch module can be separated in two part using a programmable switch to route two different net. The proposed routing algorithm finds all assignable tracks for a given net and selects the best track from assignable tracks to minimize the number of programmable switches and the unused portion of the wire segments. In order to stabilize the perfomrance of the algorithm, the routing order is defined by weighted sum of the number of wire segment, the length of wire segmetn, and the number of pin. Experimental results show that routability is improved dramatically and the number of crossing switches are reduced about 40% compared with the previous works.

• 한국음향학회지
• /
• 제19권1호
• /
• pp.54-60
• /
• 2000

고차모드를 고려하여 단순확장관을 해석한 많은 선행연구가 이루어 졌고, 이러한 연구는 모드적합법, 속도포텐셜법, 유한요소법으로 분류할 수 있다. 이들 중 모드적합법은 동심관형확장관을 해석하는 데 유용하다. 일반적으로 입·출구의 단면적이 중간확장관의 단면적보다 작으므로 입·출구에 고려하는 고차모드의 개수는 중간확장관에 고려하는 고차모드의 개수보다 작을 수 있다. 그러나 모드적합법은 입·출구와 중간확장관에 같은 개수의 고차모드를 사용하여야 한다. 그래서 입·출구에 불필요한 고차모드를 포함하게 되어 계산시간을 늘이는 결과를 초래한다. 본 논문에서는 입구, 중간확장관 그리고 출구에 각각 임의의 고차모드의 개수를 선택할 수 있는 새로운 방법을 제시하였다. 그리고 이 방법의 정확성을 검증하기 위하여 전통적인 모드적합법, 유한요소법과 비교하였고, 이 새로운 방법이 계산시간을 줄일 수 있다는 것을 보였다.