• The Magazine of the Society of Air-Conditioning and Refrigerating Engineers of Korea
• /
• v.16 no.2
• /
• pp.140-153
• /
• 1987

Main objective of this study is to provide heating cost allocation method according to the amount of heating energy consumption in apartments. Heating energy consumptions are calculated by DOE-2.1A program. As a result, heat loss ratio in Ondol heating system, heating cost coefficients of apartments and its using method is presented. Maximum heating cost coefficient rate is 2.63.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.136-145
• /
• 2007

The selection of suppliers and the determination of order quantities to be placed with those suppliers are important decisions in a supply chain. In this research, a non-linear mixed integer programming model is presented to select suppliers and determine the order quantities. The model considers the purchasing cost which takes into account quantity discount, the cost of transportation, the fixed cost for establishing suppliers, the cost for holding inventory, and the cost of receiving poor quality parts. The capacity constraints for suppliers, quality and lead-time requirements for the parts are also taken into account in the model. Since the purchasing cost, which is a decreasing step function of order quantities, introduces discontinuities to the non-linear objective function, it is not easy to employ traditional optimization methods. Thus, a heuristic algorithm, called particle swarm optimization (PSO), is used to find the (near) optimal solution. However, PSO usually generates initial solutions randomly. To improve the PSO solution quality, a heuristic procedure is proposed to find an initial solution based on the average unit cost including transportation, purchasing, inventory, and poor quality part cost. The results show that PSO with the proposed initial solution heuristic provides better solutions than those with PSO algorithm only.

• Journal of the Korean Society for Railway
• /
• v.10 no.3 s.40
• /
• pp.319-326
• /
• 2007

During the design phase of a system, which requires high reliability and safety such as aircraft, high speed train and nuclear power plant, reliability engineer must set up the target system reliability. To meet a reliability goal for the system, reliability allocation should be done gradually from the system to its element. For this end, first of all, we need to construct functional block diagram based on the design output and PWBS(Project Work Breakdown System). Another important input data for reliability allocation is the relationship between the cost and the reliability. In this study we investigate various reliability allocation models, which can be applicable to aircraft, vehicle, and power plant, and etc. And we suggest a proper reliability allocation model which can be effectively applicable to KTX-II high speed train to achieve the target system reliability.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.599-609
• /
• 2007

Due to the restrictions of Flash memory such as overwrite limitation and write/erase operational unit differences, block cleaning is required in Flash memory based file systems and known as a key factor on the performance of file systems. In this paper, we identify three parameters, namely utilization, invalidity and uniformity, and analyze how the parameters affect the cost of block cleaning. The analysis show that as uniformity degrades, the cost of block cleaning increases drastically. To overcome this problem, we design a new modification-aware(MODA) page allocation scheme that strives to keep uniformity high by separating frequently-updating data from infrequently-updating data. Real implementation experiments conducted on an embedded system show that the MODA scheme can actually enhance uniformity of Flash memory, which consequently leads to reduce the cost of block cleaning with an average of 123%, compared to the traditional sequential allocation scheme that is used in YAFFS.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2003

A recent trend In flexible manufacturing systems (FMS) Is to utilize the Identical versatile machines with fast tool delivery devices. Unlike a conventional FMS where parts are fed to the machines with the required tools, tools are acquired from other machines using a tool delivery system and parts can be finished on the same machine In these FMS. Therefore it Is more important problem 4o plan tool flow using tool delivery system In these FMS rather than part flow In conventional FMS. According to the existing study, In FMS 20∼30 percent of the total management cost Is the cost related with tools and It Is possible to reduce the tool Inventory by 40 percent using efficient tool allocation. In this study, In FMS under dynamic tool allocation strategy, a new method of part release considering tool flow at the stage of part release Is proposed. In order to prove the efficiency of the proposed part release It is compared with other part release through simulation experiments. Performance measures in these experiments are the throughput and the number of tardy parts.

• Journal of the military operations research society of Korea
• /
• v.30 no.2
• /
• pp.133-140
• /
• 2004

In this paper, with the limited range of ammunition supply point(ASP) at ammunition battalion in specific corps and light automobile battalion(LAB) directly supports its vehicle for ammunition supply, we propose optimal model to minimize transportation time and logistics cost using integer programming(IP) for efficient ammunition resupply allocation during a given operation period of front combat unit. And then, we consider ammunition treatment and supply capacity of ammunition supply point(ASP), constraint elements of transportation ability considering time and cost, ammunition storage capacity of combat unit, combat situation and unit mission to propose this model. Finally, through numerical example, we examine the applicable feasibility of proposed model.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.460-462
• /
• 2003

One of many elements considered important is TR-Cost in restructed electrical power market. KEMA supposed the TR-Cost system which involved an allocation rate of groups of generator and load as 5 to 5 but it isn't based on electrical and economic theory. Also there is a defect that we cann't calculate each allocation to numerous members forming the group of generators and loads. Therefore, in this paper, we propose an allocation method by using "generator forcused TR MLF" & "load forcused TR MLF" in consideration of economic signal.

• Journal of the military operations research society of Korea
• /
• v.18 no.1
• /
• pp.47-60
• /
• 1992

A class of allocation problems can be modeled in a linear programming formulation. But in reality, the coefficient of both the cost and constraint equations can not be generally determined by crisp numbers due to the imprecision or fuzziness in the related parameters. To account for this. a fuzzy version is considered and solved by transforming to a conventional non-linear programming model. This gives a solution as well as the degree that the solution satisfies the objective and constraints simultaneously and hence will be very useful to a decision maker. An attacker assignment problem for multiple fired targets has been modeled by a linear programming formulation by Lemus and David. in which the objective is to minimize the cost that might occur on attacker's losses during the mission. A fuzzy version of the model is formulated and solved by transforming it to a conventional nonlinear programming formulation following the Tanaka's approach. It is also expected that the fuzzy approach will have wide applicability in general allocation problems

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.49-62
• /
• 1991

This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

• ETRI Journal
• /
• v.24 no.6
• /
• pp.465-468
• /
• 2002

Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi-point control protocol of Ethernet PONs.