• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.452-460
• /
• 2001

Most of researches of tolerance optimization have used a simple sum of tolerance-cost functions with several constraint equations as an optimization model. However, if there is a machining sequence with more than one processes to complete a part, and machining failure, i.e., out-of-tolerance occurs at one of the intermediate processes, the tolerance-cost of this process should be added by the machining cost of all the previous processes already completed on the part. In this study, an accumulated scrap cost model(ASCM) is proposed considering the scrapped machining cost, and applied to a simple assembly example. The result of tolerance optimization using ASCM is compared with that of using a traditional optimization model to confirm its effectiveness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.144-157
• /
• 1999

In this paper, we consider a new preventive replacement policy for the system which deteriorates while it is in operation with an increasing failure rate. The system is subject to two types of failure. A type 1 failure is repairable while a type 2 failure is not repairable. In the new policy, a system is replaced at the age of $t_p$ or at the instant the$\textsc{k}^{th}$ type 1 failure occurs, whichever comes first. However, if a type 2 failure occurs before a preventive replacement is performed, a failure replacement should be made. We assume that a type 1 failure can be rectified with a minimal repair. We also assume that a replacement takes a non-negligible amount of time while a minimal repair takes a negligible amount of time. Under a cost structure which includes a preventive replacement cost, a failure replacement cost and a minimal repair cost, we develop a model to find the optimal ($\textsc{k},t_p$) policy which minimizes the expected cost per unit time in the long run while satisfying a system availability constraint.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.211-218
• /
• 2012

We analyzed the effect of inventory pooling on the system where multiple depot was used to replenish retailers and where inventories are kept only on the depots. Inventory pooling consists of inventory integration and inventory exchange. We used simulation for checking the cost saving effect of reducing the number of depot (Inventory Integration) for the case when inventories kept on every depots are commonly used for all retailers when certain depot have stock out for their retailer assigned to them (Inventory Exchange) with the constraint of service level. Simulation on wide range of parameter settings results show that cost saving effect from inventory integration diminishes when transportation cost between depot and retailers or stock out cost, or retailer number increases. The effect becomes stronger when the demands on retailers have bigger variance or average. Also the results show that the cost saving effect from inventory exchange becomes stronger on the same situation when inventory integration effect becomes stronger.

• The Journal of Fisheries Business Administration
• /
• v.45 no.2
• /
• pp.85-95
• /
• 2014

Fish stocking is important element of land-based aquaculture management. To maintain constant stocking rate considering biological and economic condition is a convenient strategy in intensive aquaculture. This study is aimed to analyze the effect of over-stocking(more than aquaculture capacity) for certain periods of time. This study make the mathematical decision making model that finds the value of decision variable to minimize cost that sums up the water pool usage cost and sorting cost under critical standing corp constraint. The proposed mathematical decision making model was applied to 12 sample combination of sorting cost and the number of fish on the Oliver flounder culture farms. If a immature fish can be sold for high price than farming cost, restricted over-stocking resulted in a improvement of economic performance. When extensive comparable biological and market data become available, analysis model can be widely applied to yield more accurate results.

• IE interfaces
• /
• v.16 no.4
• /
• pp.450-462
• /
• 2003

In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.407-410
• /
• 1998

Configuration is a set of building block processes, a series of selection and combining parts or components which composes a whole thing. A whole thing could be such a configurable object as manufacturing product, network system, financial portfolio, system development plan, project team, etc. Configuration problem could happen during any phase of product life cycle: design, production, sales, installation, and maintenance. Configuration has long been one of cost and time consuming work, because only high salaried technical experts on product and components can do configuration. Rework for error adjustments of configurations at later process causes far much cost and time, so accurate configuration is required. Under the on-line electronic commerce environment, configuration problem solving becomes more important, because component-based sales should be done automatically on the merchant web site. Automated product search, order placement, order fulfillment and payment make that manual configuration is no longer feasible. Automated configuration means that all the constraints among components should be checked and confirmed by configuration engine automatically. In addition, technical constraints and customer preferences like price range and a specific function required should be considered. This paper gives an brief overview of configuration problems: characteristics, representation paradigms, and solving algorithms and introduce CRSP(Constraint and Rule Satisfaction Problem) method. CRSP method adopts both constraint and rule for configuration domain knowledge representation. A survey and analysis on web sites adopting configuration functions are provided. Future directions of configuration for EC is discussed in the three aspects: methodology itself, companies adopting configuration function, and electronic commerce industry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4144-4165
• /
• 2018

Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.1
• /
• pp.105-114
• /
• 2002

Nowadays, most companies seek after the greatest profit by means of offering the goods which consumers want timely and efficiently and minimizing the cost of inventory and distribution channel which amounts to the great portion of total cost. And according as EC(Electronic Commerce) market has increased rapidly, SCM(Supply Chain Management) for EC become one of the most important facts for companies, therefore this paper suggest SCM scheme which EC, especially B to C, is added to the existing commerce system. This paper uses internet for information integration of distribution channel which is away from one another and applies TOC(Theory of Constraint)'s DBR(Drum-Buffer-Rope) Scheduling for synchronization through the whole supply chain. It is possible to synchronize the whole supply chain by means of making the speed of manufacturing and distribution to be controlled by consumer's order which is received in distribution center, and inventory and loss of sales opportunities are minimized by constant. Buffer Management. If inventories in distribution center is short, then it needs to search CCR(Capacity Constraint Resource) in supply chain and to control the speed of manufacturing and distribution according to the ability of CCR. This paper applies PT(Partial Transshipment) strategy for Delivery from distribution center to store or cyber consumer. the strategy this paper suggests chooses neighbour area from area which each distribution center takes charge, and then makes product ordered by cyber consumer which lives in the chosen area to be delivered according to inventory of distribution center.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4329-4348
• /
• 2019

Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.