• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.327-330
• /
• 2007

This article discusses a capacity planning method in QoS-guaranteed IP networks such as BcN (Broadband convergence Network). Since IP based networks have been developed to transport best-effort data traffic, the introduction of multi-service component in BcN requires fundamental modifications in capacity planning and network dimensioning. In this article, we present the key issues of the capacity planning in multi-service IP networks. To provide a foundation for network dimensioning procedure, we describe a systematic approach for classification and modeling of BcN traffic based on the QoS requirements of BcN services. We propose a capacity planning framework considering data traffic and real-time streaming traffic separately. The multi-service Erlang model, an extension of the conventional Erlang B loss model, is introduced to determine required link capacity for the call based real-time streaming traffic. The application of multi-service Erlang model can provide significant improvement in network planning due to sharing of network bandwidth among the different services.

• IE interfaces
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2009

As the LCD fabrication factories (Fab) are highly capital-intensive and the markets are very competitive, it is an essential requirement of operational management to achieve full-capacity production while meeting customer demands on time. In a typical LCD Fab, medium-term schedules such as release plans and production plans are critical to achieve the goal of full-capacity production and on-time delivery. Presented in this paper is a framework for weekly planning system generating medium-term schedules using a finite-capacity planning method. Also this paper presents a release planning method applying capacityfiltering algorithm, especially backward capacity-filtering procedure, which is one of the finite-capacity planning methods. In addition, performance analyses using actual data of a TFT-LCD Fab show that the proposed method is superior to existing methods or commercial S/W products generating release plans.

• IE interfaces
• /
• v.10 no.1
• /
• pp.15-22
• /
• 1997

In semiconductor manufacturing, the probe process between fabrication and assembly process is constrained mostly by the equipment capacity because most products pass through the similar procedures. The probe process is usually performed in a batch mode with relatively short cycle times. The capability of the probe process can be determined by the optimal combination of the equipments and the products. A probe line usually has several types of equipment with different capacity. In this study, the probe line is modeled in terms of capacity to give the efficient planning and control procedure. For the practical usage, the hierarchical capacity planning procedure is used. First, a monthly capacity plan is made to meet the monthly production plan of each product. Secondly, the daily capacity planning is performed by considering the monthly capacity plan and the daily fabrication output. Simple heuristic algorithms for daily capacity planning are developed and some experimental results are shown.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.1
• /
• pp.71-79
• /
• 2010

This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.51-58
• /
• 1990

A deterministic capacity expansion planning model for a two-capacity type facility is analyzed to determine the sizes to be expanded in each period so as to supply the known demands for two distinct capacity type(product) on time and to minimize the total cost incurred over a finite planning horizon of T periods. The model assumes that capacity unit of the facility simultaneously serves a prespecified number of demand units of each capacity type, that capacity type 1 can be used to supply demands for capacity type 2, but that capacity type 2 can't be used to supply demands for capacity type 1. Capacity expansion and excess capacity holding cost functions considered are nondecreasing and concave. The structure of an optimal solution is characterized and then used in developing an efficient dynamic programming algorithm that finds optimal capacity planning policy.

• KIEAE Journal
• /
• v.12 no.2
• /
• pp.3-14
• /
• 2012

A sustainable evaluation and planning method shall have an integrative methodology for analysis of interrelationship among environmental resource uses and natural conditions during the planning process. However, there are few methods for understanding or achieving sustainable planning in residential development projects for most planner/architects. Therefore, the purpose of this research is to investigate theories of the concept of environmental carrying capacity based on the ecological view, to propose a sustainable planning method for evaluation and planning of environmental sustainability in residential development projects, to analyze interrelationship of selected environmental resources to represent an environmental carrying capacity for a residential development project based on the proposed sustainable planning method. Finally, through the case studies of a high-density housing project located near Seoul Metropolitan area, the existing case and a sustainable case were analysed by the proposed method.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.57-65
• /
• 2008

Available-to-promise (ATP) exhibiting availability of manufacturing resources can be used to support customer order promising. Recently, one advanced function called Capable-to-promise (CTP) is provided by several modern APS (advanced planning system) that checks available capacity for placing new production orders or increasing already scheduled production orders. At the customer enquiry stage while considering the order delivery date and quantity to quote, both ATP and CTP are allocated to support order promising. In particular, current trends of mass customization and multi-side production chain derive several new constraints that should be considered when ATP/CTP allocation planning for order promising - such as customer's preference plants or material vendors, material compatibility, etc. Moreover, ATP/CTP allocation planning would be executed over a rolling time horizon. To utilize capacity and material manufacturing resource flexibly and fulfill more customer orders, ATP/CTP rolling planning should possess resource reallocation mechanism under the constraints of order quantities and delivery dates for all previous order promising. Therefore, to enhance order promising with reliability and flexibility to reallocate manufacturing resource, the ATP/CTP reallocation planning mechanism is needed in order to reallocate material and capacity resource for fulfilling all previous promised and new customer orders beneficially with considering new derived material and capacity constraints.

• Journal of Korea Planning Association
• /
• v.53 no.7
• /
• pp.87-107
• /
• 2018

With more than 10 million inhabitants, in particular, Seoul, the capital of Korea, has already experienced a number of severe heat wave. To alleviate the potential impacts of heat wave and the vulnerability to heat wave, policy-makers have generally considered the option of heat wave strategies containing adaptation elements. From the perspective of sustainable planning for adaptation to heat wave, the objective of this study is to identify the elements of vulnerability and assess heat wave-vulnerability at the dong level. This study also performs an exploratory investigation of the spatial pattern of vulnerable areas in Seoul to heat wave by applying exploratory spatial data analysis. Then this study attempts to select areas with the relatively highest and lowest level of adaptive capacity to heat wave based on an framework of climate change vulnerability assessment. In our analysis, the adaptive capacity is the relatively highest for Seongsan-2-dong in Mapo and the relatively lowest for Changsin-3-dong in Jongno. This study sheds additional light on the spatial patterns of heat wave-vulnerability and the relationship between adaptive capacity and heat wave.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1461-1472
• /
• 2000

Recently, the mobile users seem to be rapidly increasing and then the capacity limit will be reached at close hand. In these situations, to provide them with good quality of service in the coming future, newly planned cell design is needed. In the next generation mobile communication systems, namely IMT-2000, good quality services will be possible only by designing the cell structure hierarchically with the help of appropriate cell planning. In the research process, the standardization reports on the future mobile cellular IMT-2000 system (3GPP) are investigated and the parameters, that are essential to cell planning, are also researched. Modeling of IMT-2000 radio link and the numerical analysis on that make it possible to calculate the forward/reverse link budget, system capacity call blocking probability Erlang capacity and cell coverage. In planning the cell of IMT-2000 system, various parameters are considered, such as hierarchical cell structure, number of users, data service forms and propagation area environments. From the results, efficient cell planning methods are proposed. Through this thesis efficient cell planning and maximum capacity will be achieved in the beginning of commercial IMT-2000 service.