• Fashion & Textile Research Journal
• /
• v.16 no.3
• /
• pp.347-353
• /
• 2014

The purpose of this research was to present the possibility of an alternative production base for clothing business of South Korea through the analysis about textile/clothing industry production activities in the Gaeseong industrial complex. It is necessary for the Gaeseong industrial complex to cope with the issue about FTA and country of origin, manpower supply and demand, paying wages and labor productivity, the exclusive industrial complex of clothing. The Country of Origin on imports and exports tells the country of manufacture or production, where the product comes from. Rules of Origin are the special regulations to determine the country of origin of a product and exist in the forms of international law, legislation, precedent and administrative decisions. But the economy in the North and the Gaeseong industrial complex is a comparative advantage combined with elements of North-South interdependence as a South-North economic cooperation business and can contribute significantly to the stabilization of the North-South relations. Among the models using criteria of the determination of origin, it has directly provided the models of general regulation for offshore products, of limited offshore products. These models are to help Korean exporters in understanding and utilizing the Rules of Origin for their manufacturing. In addition, the development of the Gaeseong industrial complex will contribute to establish peace on the Korean peninsula as well as in Northeast Asia. Also economic cooperation between South and North Koreas is essential for peace and prosperity of the Korean people.

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

Consider a capacitated facility location problem in which the demands of customers are all equal and so are the capacities of facilities. Under the restriction that each customer's uniform demand be met by exactly one facility, the objective is to select a set of facilities to open, and to assign customer's demand to them so as to minimize the total cost which includes fixed costs of opening facilities as well as variable assignment costs. The problem is modelled as a pure zero-one program which may be viewed as a variant of well-known capacitated facility location problems. The purpose of this study is to develop efficient computational procedures for solving the pure zero-one facility location problems. Due to the special structure of our zero-one location problem with uniform demand, it can be converted to a location problem with the unimodular property. A Lagrangean relaxation algorithm is developed to solve the location problem. The algorithm is made efficient by employing a device which exploits the special structure of a surrogate constraint. The efficiency of the algorithm is analyzed through computational experiments with some test problems.

• IE interfaces
• /
• v.17 no.1
• /
• pp.71-77
• /
• 2004

At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Annually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost. The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• 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.

• Journal of the Korean Applied Science and Technology
• /
• v.10 no.1
• /
• pp.49-55
• /
• 1993

Ground Calcium Carbonate, among paper coating pigments, will influence less dispersant demand, less binder demand, increase coating solids from 58% to 70%, which means high speed coating, less shrinkage during drying, less energy consumption, more uniform coverage of fibers. The quality point of view of Ground Calcium Carbonate, brightness, particle size, Particle size distribution, hardness, impurities content are important. More important factors of Ground Calcium Carbonate which influence the paper coating process are dispersion mechanisms and their effects. The study was made to investigate the effect of Ground Calcium Carbonate dispersion by sodium salt of polyacrylate dispersant composition and dispersion condition. Basic tests such as physical, optical and chemical were perfumed, and dispersion effects were investigated by different conditions. The results showed that the type of dispersant affected the dispersion effects, and the Ground Calcium Carbonate has critical dispersant demand.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.31
• /
• pp.1-10
• /
• 1994

The purpose of this study is to search for the most effective forecasting model for condenser with independent demand among the quantitative methods such as Brown's exponential smoothing method, Box-Jenkins method, and multiple regression analysis method. The criterion for the comparison of the above models is mean squared error(MSE). The fitting results of these three methods are as follows. 1) Brown's exponential smoothing method is the simplest one, which means the method is easy to understand compared to others. But the precision is inferior to other ones. 2) Box-Jenkins method requires much historic data and takes time to get to the final model, although the precision is superior to that of Brown's exponential smoothing method. 3) Regression method explains the correlation between parts with similiar demand pattern, and the precision is the best out of three methods. Therefore, it is suggested that the multiple regression method is fairly good in precision for forecasting our item and that the method is easily applicable to practice.

• Journal of Industrial Technology
• /
• v.19
• /
• pp.301-312
• /
• 1999

The purpose of this paper is to study the effects of container size with multi-stage and multi-item on average inventory and customer service level in Kanban systems. We use the different distributions of demand and interarrival time for each item to show that we had better to change the container size depending on different type of item for this simulation study. The small lot size can be used for container size of a single item if there is no setup time. The container size should be identical with average order size as setup time increases. The fill rate increases if the container size is large with multi-item. However, it is difficult to establish the effective container size because the effects of the container size on the order queue time are not clear. It is suitable to use the average order size as the container size for each item if the variance of demand and interarrival time of each item is relatively small. It is effective to sue the average container size if the variance of them is relatively large.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.176-187
• /
• 2004

Demand of industry site should be accepted for effective job education of college. This study was conducted to analyze the demand of industry and the need of education, and to reflect them in the customer demand education of Department of Cadastral Information, Shingu College. DACUM job analysis method was adapted to conduct this study, and pannelists who work in surveying and GIS industry had been invited to analyze systemically the job of related industrial site. As results, the job-task model and Knowlege Skill Tool matrix was derived by analysis of job and task of industrial site. This job analysis data can be used to develop the curriculum or the program of surveying and GIS education, or to revise existing curriculum.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.