• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.145-157
• /
• 2005

There are a lot of raw materials, work-in-processes and finished goods in manufacturing industry. Here, the less stock of materials and work-in-processes manufacturing industry has, the worse the rate of the production is. Inversely, the more manufacturing industry has, the more expensive the cost to support them is. Thus, it is important for us to balance them efficiently. In general, inventory problems are to decide appropriate times to produce goods and to determine appropriate quantities of goods. Therefore, inventory problems require as more useful information as possible. For example, there are demand, lead time, ordering point and so on. In this paper, we deal with an optimal ordering policy on both way substitutable two-commodity inventory control system. That is, there is a problem of how to allocate the produced two kinds of goods in a factory to m areas so as to minimize the total expected inventory cost. The demand of each area is probabilistic, and we adopt the exponential distribution as a probability density function of demand. Moreover, we provide numerical examples of the problem.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2158-2170
• /
• 1999

It has been required more reliable communication on processes and improvement of system performance as distributed systems using multicast protocol became widespread. In distributed environment maintaining data consistency through asynchronous execution of processes and coordinating the activities of them would occurs. This paper proposes a total ordering algorithm, TORMP, in order to resolve these problems. TORMP takes advantage of multicast protocol and uses an effective token passing method. It reduces a process delaying time before transmitting its message by multicasting a token simultaneously to every process that initiates the request of the message. Moreover, the processes receiving the token start multicasting the message at the same time, which causes to cut down the overall transmission dely. In case that one process sends a message, TORMP hardly uses the procedure of controlling for ordering. It gives fairly the right of sending messages to all processes in a group with utilizing vector clock. In TORMP, unlike other algorithms, the number of packets generated during ordering process does not depend on the number of processes.

• Journal of Korean Society for Quality Management
• /
• v.13 no.1
• /
• pp.56-64
• /
• 1985

This paper presents a general algorithm of multi-item continuous review models to obtain simultaneous solutions for ordering quantities and reorder points for each item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Two models are formulated'in each model the heuristic method is utilized, and the partial back-logging is considered. In the first model, the objective function is the minimization of total inventory variable cost. In the second model, the objective function is the minimization of total time-weighted shortages, and the ordering, holding, and stockout costs in this model are independent each other. A numerical example is also solved to present application of each model.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.9-14
• /
• 2015

We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.

• Journal of the Korean Dietetic Association
• /
• v.25 no.3
• /
• pp.165-177
• /
• 2019

This study examined the perception and behavior of fast food restaurant customers toward ordering kiosk nutrition information. Specifically, the influence of nutrition information transparency and information quality on behavioral intention and revisit intention were identified. In addition, the difference in the nutrition information transparency and information quality was analyzed according to the health consciousness of the customers. The study employed a self-administered survey that was distributed both online and offline from November 8~22, 2018. The sample of the study was customers who had experienced ordering from the kiosk in a fast food restaurant in the six months prior to taking the survey. A total of 250 (98.0%) respondents completed the survey, which was used for data analysis. As a result, there was a significant relation between transparency and nutrition information quality (P<0.001). The higher the visibility and inferability of the nutrition information, the better the nutrition information quality. Nutrition information quality has a significant impact on the levels of customer satisfaction and revisit intention (P<0.001). For the differences in the transparency and nutrition information quality by health consciousness of customers, the results indicated that groups with high health consciousness (3.74 or higher) perceived a higher transparency and nutritional information quality than those with a lower health consciousness. These findings can form the basis of a strategy in developing nutrition information of ordering kiosks in restaurants. In addition, it can be applied to academia and industry.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.35-46
• /
• 2007

This paper proposes a six-color separation method of reducing unnecessary usage of colorants based on the limitation of total colorant amount and dot visibility ordering. First, the CIELAB values of input RGB image are estimated through the color-mixing model and compared with pre-calculated CIELAB values corresponding to all combination of CMYKlclm colorants with a constraint of color difference, thereby selecting initial CMYKlclm candidates. Next, the limitation on total colorant amount Is imposed on initial CMYKlclm candidates to remove the excessive amounts of colorants, and then final CMYKlclm candidates are determined by minimizing the usage of light cyan and light magenta in the dark region based on the dot visibility ordering of C, M, Y, K, lc, and lm. Through the experiment, the proposed method is shown to reduce the excessive amount of colorants with preserving good image quality.

• Journal of the military operations research society of Korea
• /
• v.23 no.2
• /
• pp.72-84
• /
• 1997

In this paper, we consider an economic order quantity(EOQ) and an optimal discount pricing policy for the monopsony related to the weapon system acquisition. In the monopsony case, a buyer wishes to maximize the profit. However, a seller wants to minimize the total inventory related cost since a buyer can determine the purchase price for the product. We develop a generalized version of EOQ model for the monopsony, including one seller-one buyer model and two seller-one buyer model. A model of buyer reaction to any given pricing scheme is developed to show that there exits a unified pricing policy which motivates the buyer to increase its ordering quantity per order, thereby reducing the joint(buyer and seller) ordering and holding costs in the system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.95-115
• /
• 2013

In traditional inventory models, purchase prices of raw materials are assumed to be fixed and have no effect on the optimal choice of inventory policies. However, when purchase prices fluctuate continuously over time, inventory costs are heavily affected by purchasing prices. Risk-averse inventory model decides order quantity and ordering time by considering not just purchase prices but also the risk from the discrepancy between estimated prices and realized prices. In this paper, we propose a myopic inventory policy which incorporates price risk into deciding ordering time and quantities. While the existing risk-averse model has no mechanism to reallocate inventories already purchased for a specific future period, the revised one reallocates initial inventories of each period to other future periods so that it can avoid purchasing raw materials at high prices. Experimental results demonstrate that the revised model outperforms the existing one in respect of total cost and variability.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.2
• /
• pp.77-87
• /
• 1986

This paper presents a heuristic method for solving the discrete-time ordering problem with quantity discounts and deterministic, time-varying demand. This algorithm utilizes a variation of the incremental cost approach(ICA) to determine a near optimal solution. The ICA is the method which reduces the total cost with reduction of the number of orders by one. In order to reduce the number of orders, if the incremental cost for one of the periods is negative, the demand of the period should be purchased in its immediate preceding period. In order to test the performance of this algorithm, an experiment is conducted that involves a large number of test problems covering a wide variety of situations. The result of the experiment shows that the proposed algorithm has 80.5% better solutions than the adjusted part period algorithm(APPA), which is known to be the best heuristic method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1598-1605
• /
• 1989

This paper describes an efficient global cell (module) placement strategy called HALO (Hierarchical Alternating Linear Ordering)which generates global 2-D placement of circuit modules by hierarchical application of linear ordering in alternating direction. We tried, in principle, to explain why HALO should perform better than other typical, somehat successful, analytical approaches such as min-cut, force-directed relaxation(FDR)or its likes. We have implemented HALO as a program for standard cell placement. Experimental results on two benchmark circuits, primary and primary 2 consisting of 752 and 2907 cells, respectively have shown a decrease of half-perimeter routing length by 7% and 24%, respectively compared to the best available results obtained so far. Total CPU time including the following detailed placement was less than half of the earlier work.