• Title/Summary/Keyword: Capacity allocation

Search Result 426, Processing Time 0.026 seconds

Order Promising Rolling Planning with ATP/CTP Reallocation Mechanism

  • Chen, Juin-Han;Lin, James T.;Wu, Yi-Sheng
    • 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.

Multiuser Resource Allocation Scheme Considering Link Layer Effective Capacity in OFDMA Systems (직교 주파수 분할 다원 접속 시스템에서 실효 링크 계층 용량을 고려한 다중 사용자 자원 할당 기법)

  • Sung Si-Hwan;Yoo Myung-Sik;Shin Yo-An;Lee Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.508-516
    • /
    • 2006
  • The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.

Dynamic Resource Allocation Scheme for Multiple Antenna OFDM-based Wireless Multicast Systems (다중안테나 OFDM 멀티캐스트 시스템을 위한 동적 자원할당 알고리즘)

  • Xu, Jian;Lee, Sang-Jin;Kang, Woo-Seok;Seo, Jong-Soo
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.883-891
    • /
    • 2008
  • Multiple antenna orthogonal frequency division multiplexing (OFDM) is a promising technique for the high downlink-capacity in the next generation wireless systems, in which adaptive resource allocation is an important research issue that can significantly improve the performance with guaranteed QoS for users. However, most of the current resource allocation algorithms are limited to unicast system. In this paper, dynamic resource allocation is studied for multiple antenna OFDM based systems with multicast service. In the simulation, the performance of multicast system was compared with that of the unicast system. Numerical results also show that by using the proposed algorithms the system capacity is significantly improved compared with the conventional scheme.

Dynamic Channel Allocation Algorithm for Co-channel Interference Avoidance in Multi-cell OFDMA Systems (OFDMA 다중 셀 환경에서 동일 채널 간섭을 피하기 위한 동적 자원 할당 알고리즘)

  • Lee, Je-Min;Seo, Woo-Hyun;Wang, Hano;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.92-98
    • /
    • 2007
  • We propose the schemes for the dynamic channel allocation (DCA) in multi-cell OFDMA systems to avoid co-channel interference (CCI) without the additional complexity. The allocatable subcarriers areas, which is designed to avoid CCI among cells, are determined for each cell. Each cell allocates the subcarriers within the allocatable subcarriers area of the cell independently. We consider the trade off between the reduced frequency selection diversity and the amount of CCI on a subcarrier by the determination of allocatable subcarriers area. Hence, the equal allocation bound scheme for the high selectivity channel and the flexible allocation bound scheme for the low selectivity channel are proposed. Through the numerical results, it is confirmed that the proposed schemes have better performance in the aspects of the number of overlapping allocated subcarriers, the capacity and the outage probability compared to the case which does not determined the allocatable subcarriers area.

Optimal Time Slot and Channel Allocation for CDMA/TDD Systems with Unbalanced Multimedia Traffic (불균형 멀티미디어 트래픽을 갖는 CDMA/TDD 이동통신시스템을 위한 최적 타임슬롯/채널 운용체계)

  • 장근녕;김동우
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.4
    • /
    • pp.125-132
    • /
    • 2001
  • Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

  • PDF

Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems

  • Choi, Yonghoon
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.953-959
    • /
    • 2014
  • This paper studies the uplink resource allocation for multiple radio access (MRA) in reconfigurable radio systems, where multiple-input and multiple-output (MIMO) multicarrier-code division multiple access (MC-CDMA) and MIMO orthogonal frequency-division multiple access (OFDMA) networks coexist. By assuming multi-radio user equipment with network-guided operation, the optimal resource allocation for MRA is analyzed as a cross-layer optimization framework with and without fairness consideration to maximize the uplink sum-rate capacity. Numerical results reveal that parallel MRA, which uses MC-CDMA and OFDMA networks concurrently, outperforms the performance of each MC-CDMA and OFDMA network by exploiting the multiuser selection diversity.

A Dynamic Optimum Time Allocation Method in Partial Relay Systems (부분 중계기 협력 다중화 기술에서 동적 최적 시간 할당 기술)

  • Cho, Jung-Il;Kwon, Yang-Soo;Kim, Nam-Ri;Chung, Jae-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.746-751
    • /
    • 2009
  • We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

조선 도장 공장 운영 방안 수립에 관한 연구

  • 최동희;박주철
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.286-289
    • /
    • 2001
  • This paper deals with the procedures of effective mid-term Operation Planning establishment for painting shop in shipbuilding. and develop prototype system. In general, the block painting process consists of two stages such as blasting operation for surface preparation and painting operation for paint application for blocks. Weather condition is a potent Influence on those operations. The procedures consists of four steps, Load analysis, Generate alternative simulation plan. Implementation of Allocation automation module and Compare result of each simulation plan. Explain of each step. as follows, 1.step, Load analysis measure amount of assigned workload and manhour. 2.step, simulation scheme include alterable control variable such as overtime, weather. Auto allocating module carry out feasibility of simulation plan. 3.step, Allocation automation module are composed of three algorithms, as followings: - the block allocation algorithm that determines the number of blocks to be processed each day, - the team allocation algorithm that allocates blocks to worker groups. - the block arrangement algorithm that arrange blocks in blasting and painting cells. Since the block arrangement algorithm is conducted simultaneously with the team allocation algorithm, the total structure of the operating algorithms is considered to have two phases: first, daily load balancing with capacity limit and second, team allocation considering arrangement each day 4 step, Comparing result of each simulation plan. and select best simulation plan.

  • PDF

PSO-based Resource Allocation in Software-Defined Heterogeneous Cellular Networks

  • Gong, Wenrong;Pang, Lihua;Wang, Jing;Xia, Meng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2243-2257
    • /
    • 2019
  • A heterogeneous cellular network (HCN) is useful to increase the spectral and energy efficiency of wireless networks and to reduce the traffic load from the macro cell. The performance of the secondary user equipment (SUE) is affected by interference from the eNodeB (eNB) in a macro cell. To decrease the interference between the macro cell and the small cell, allocating resources properly is essential to an HCN. This study considers the scenario of a software-defined heterogeneous cellular network and performs the resource allocation process. First, we show the system model of HCN and formulate the optimization problem. The optimization problem is a complex process including power and frequency resource allocation, which imposes an extremely high complexity to the HCN. Therefore, a hierarchical resource allocation scheme is proposed, which including subchannel selection and a particle swarm optimization (PSO)-based power allocation algorithm. Simulation results show that the proposed hierarchical scheme is effective in improving the system capacity and energy efficiency.

A Survey on the Mobile Crowdsensing System life cycle: Task Allocation, Data Collection, and Data Aggregation

  • Xia Zhuoyue;Azween Abdullah;S.H. Kok
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.3
    • /
    • pp.31-48
    • /
    • 2023
  • The popularization of smart devices and subsequent optimization of their sensing capacity has resulted in a novel mobile crowdsensing (MCS) pattern, which employs smart devices as sensing nodes by recruiting users to develop a sensing network for multiple-task performance. This technique has garnered much scholarly interest in terms of sensing range, cost, and integration. The MCS is prevalent in various fields, including environmental monitoring, noise monitoring, and road monitoring. A complete MCS life cycle entails task allocation, data collection, and data aggregation. Regardless, specific drawbacks remain unresolved in this study despite extensive research on this life cycle. This article mainly summarizes single-task, multi-task allocation, and space-time multi-task allocation at the task allocation stage. Meanwhile, the quality, safety, and efficiency of data collection are discussed at the data collection stage. Edge computing, which provides a novel development idea to derive data from the MCS system, is also highlighted. Furthermore, data aggregation security and quality are summarized at the data aggregation stage. The novel development of multi-modal data aggregation is also outlined following the diversity of data obtained from MCS. Overall, this article summarizes the three aspects of the MCS life cycle, analyzes the issues underlying this study, and offers developmental directions for future scholars' reference.