• Title/Summary/Keyword: Order Allocation

Search Result 868, Processing Time 0.027 seconds

The Research on Herb and Its Allocation Form in Landscape

  • Zhang, Li-Qin;Piao, Yong-Ji;Shen, Ning;Cho, Tae-Dong
    • Journal of Environmental Science International
    • /
    • v.22 no.2
    • /
    • pp.131-138
    • /
    • 2013
  • In order to provide a scientific foundation for herb application in landscape, the photographs were taken from the herb landscape in urban green space and sightseeing garden. The questionnaire-based survey was also applied to analyze the cognitive situation of herb. Most investigators love herb, but have a low level of herb; Interviewees' consideration of herb function lie in ornamental, healthcare and medical treatment; The bulk of the visitors think herb landscape is insufficient; Investigators' preferences for herb application forms are landscape edging and combining with stone. We also probe into the optimum allocation form combining herb with landscape elements. When we combine herb with landscape water or landscape architecture, artistic conception and reasonable plant allocation should be considered; When we combine herb with landscape path or garden ornament, reasonable plant disposition and appearance and practical collocation should be thought over; When we combine herb with flower-border, richly colored landscape and reasonable plant allocation should be deliberated on.

An Optimal Missile Allocation Problem for Maximizing Kill Probability (격추확률 최대화를 위한 미사일 최적배치 문제)

  • Jung, Chi-Young;Lee, Jae-Yeong;Lee, Sang-Heon
    • Korean Management Science Review
    • /
    • v.27 no.1
    • /
    • pp.75-90
    • /
    • 2010
  • In this paper, we proposed new solution procedure of the air defense missile allocation problem. In order to find the optimal location of missile, we formulated a simple mathematical model maximizing the kill probability of enemy air threat including aircraft and missile. To find the Kill probability, we developed a new procedure using actual experimental data in the mathematical model. Actual experimental data mean real characteristic factor, which was acquired when the missile had been developed through missile fire experiment. The result of this study can offer practical solution for missile allocation and the methodology in this study can be used to the decision making for the optimal military facility allocation.

A supply planning model based on inventory-allocation and vehicle routing problem with location-assignment (수송경로 문제를 고려한 물류최적화모델의 연구)

  • 황흥석;최철훈;박태원
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1997.10a
    • /
    • pp.201-204
    • /
    • 1997
  • This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

  • PDF

A Hardware Allocation and Binding Algorithm for ASIC Design (ASIC설계를 위한 하드웨어 할당 및 바인딩 알고리듬)

  • Choe, Ji-Yeong;In, Chi-Ho;Kim, Hui-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1255-1262
    • /
    • 2000
  • This paper proposes a hardware allocation and binding algorithm for ASIC Design. The proposed algorithm works on schedules input graph and simultaneously allocates and binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Especially, he register allocation is executes the allocation optimal using graph coloring. This paper shows the effectiveness of the algorithm by comparing experiments to determine number of functional unit and register in advance or to separate executing allocation and binding of existing system.

  • PDF

Analysis on the Decision of Transmission Cost Allocation Rate Using the Arbitration Game (중재게임을 이용한 송전비용배분비율 결정에 관한 분석)

  • Chung, Koohyung;Kang, Dongjoo;Han, Seokman;Kim, Balho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.10
    • /
    • pp.496-499
    • /
    • 2005
  • In many parts of the world, the electric power industry is undergoing unprecedented changes. Therefore, in order to reform the electric power industry efficiently and minimize the confusion of this restructuring, the systematic studies related to transmission pricing and transmission cost allocation issues are required essentially. However, even now, the basis of transmission cost allocation rate is not equipped so that the regulation body has determined the allocating rate under the common practice. In this paper, we demonstrate that the decision of transmission cost allocation rate is the regulation body's own right. For this analysis, we apply game theory to the procedure determining this rate and the competition to determine this rate between gencos and distcos is modeled as the arbitration game.

Intervenient Stackelberg Game based Bandwidth Allocation Scheme for Hierarchical Wireless Networks

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4293-4304
    • /
    • 2014
  • In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

Decision Making Model for Optimal Earthwork Allocation Planning (최적 토량배분 계획을 위한 의사결정 모델)

  • Gwak, Han-Seong;Seo, Byoung-Wook;Lee, Dong-Eun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2016.05a
    • /
    • pp.162-163
    • /
    • 2016
  • This paper presents a mathematical model for optimizing earthwork allocation plan that minimizes earthwork cost. The model takes into account operational constraints in the real-world earthwork such as material-type (i.e., quality level of material) and quantities excavated from cut-sections, required quality of material and quantities for each embankment layer, top-down cutting and bottom-up filling constraints, and allocation orders. These constraints are successfully handled by assuming the rock-earth material as the three dimensional (3D) blocks. The study is of value to project scheduler because the model identifies the optimal earth allocation plan (i.e., haul direction (cut and fill pairs), quantities of soil, type of material, and order of allocations) expeditiously and is developed as an automated system for usability. It is also relevant to estimator in that it computes more realistic earthworks costs estimation. The economic impact and validity of the mathematical model was confirmed by performing test cases.

  • PDF

A Two-Step Scheduling Algorithm to Support Dual Bandwidth Allocation Policies in an Ethernet Passive Optical Network

  • Lee, Ho-Sook;Yoo, Tae-Whan;Moon, Ji-Hyun;Lee, Hyeong-Ho
    • ETRI Journal
    • /
    • v.26 no.2
    • /
    • pp.185-188
    • /
    • 2004
  • In this paper, we design a two-step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on-demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start- time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.

  • PDF

Dynamic Sub-carrier Multiplexed channel allocation and efficient frame distribution scheme in optical access networks (광가입자망 SCM 채널 동적할당 및 효율적 프레임 분배 방안)

  • 김남욱;윤현호;김태연;유정주;김병휘;강민호
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.113-116
    • /
    • 2003
  • In this paper, we propose a dynamic parallel channel allocation mechanism that dynamically controls total number of allocation channels of each subscriber to effectively service user bandwidth demands while high utilization and fairness are guaranteed in WDM based optical access networks. The logical performance gain of statistical multiplexing by dynamic channel allocation is validated with analytic method as well as simulations. We also introduce the adaptive padding scheme in order to efficiently distribute forwarded frames to aggregated multi-link channels which are formed by parallel channel allocation mechanism. The proposed scheme shows the performance enhancement by minimizing unnecessary padding size and the processing time.

  • PDF

A Study of Buffer Allocation in FMS based on Deadlock & Workload (FMS의 Deadlock과 Workload를 고려한 최적 버퍼 할당에 관한 연구)

  • 이정표;김경섭
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.71-74
    • /
    • 2000
  • Due to the complexity of parts flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A grouping heuristic to solve the buffer allocation problem is proposed. Computer simulation using Arena will be experimented to show the validation of the proposed algotithm.

  • PDF