• Title/Summary/Keyword: Time allocation

Search Result 1,487, Processing Time 0.03 seconds

Analysis of Productivity Differences in Steel Bridge Manufacturing Plants According to Resource Allocation Methods for the Bottleneck (병목공정 자원할당 방식에 따른 강교 제작공장 생산성 차이 분석)

  • Lee, Jaeil;Jeong, Eunji;Jeong, Keunchae
    • Korean Journal of Construction Engineering and Management
    • /
    • v.24 no.2
    • /
    • pp.37-49
    • /
    • 2023
  • In this study, we proposed resource allocation methodologies to improve the productivity of steel bridge manufacturing plants based on the constraint theory which is very popular in the area of manufacturing industries. To this end, after defining the painting process as a bottleneck, three resource allocation methodologies were developed: Operation Specific Resource Allocation (OSRA), Product Specific Resource Allocation (PSRA), and General Resource Allocation (GRA). As a result of experiments for performance evaluation using a simulation model of the steel bridge supply chain, GRA showed the best performance in terms of the Number of Work-In-Process (NWIP) and Waiting Time (WT), in particular, as workload itself and its variability were increased, the performance gap with the specific resource allocation became further deepened. On average, GRA reduced NWIP by 36.2% and WT by 34.6% compared to OSRA, and reduced NWIP by 71.0% and WT by 70.4% compared to PSRA. The reduction of NWIP and WT means alleviating the bottleneck of the painting process, which eventually means that the productivity of the steel bridge manufacturing plant has improved.

Downlink Performance Improvement of TDD CDMA Cellular Networks with Time Slot and Fixed Hopping Station Allocations

  • Zhou, Rui;Nguyen, Hoang Nam;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.247-253
    • /
    • 2007
  • In this paper, downlink capacity of time duplex division (TDD) based cellular wireless networks utilizing fixed hopping stations is investigated. In the network, a number of fixed subscriber stations act as hopping transmission stations between base stations and far away subscribers, forming a cellular and ad hoc mobile network model. At the radio layer, TDD code division multiple access (CDMA) is selected as the radio interface due to high efficiency of frequency usage. In order to improve the system performance in terms of downlink capacity, we propose different time slot allocation schemes with the usage of fixed hopping stations, which can be selected by either random or distanced dependent schemes. Performance results obtained by computer simulation demonstrate the effectiveness of the proposed network to improve downlink system capacity.

The Relationship between Quitting Time and Subsequent Time Allocation of Full-time Workers in Korea (전일제 임금근로자의 퇴근시간과 일과 후 생활시간의 관계)

  • Lee, Seungho;Park, Mijin
    • 한국사회정책
    • /
    • v.24 no.1
    • /
    • pp.117-151
    • /
    • 2017
  • This study explored the relationship between quitting time and subsequent time allocation of full-time workers with young children. First, as a result of sub-group difference analysis of subsequent time allocation by quitting time, the group who finished their work early used their additional time mostly for housework and care work. And if the workers finish their work late, they decreased their housework and active leisure time first, and then supplementally reduced their care work and passive leisure time. In addition, SUR analysis showed that as the workers finish their work earlier, the proportion of housework, care work and active leisure among five activities was getting higher. Last but not least, it was verified that the relationship between the quitting time and the subsequent time allocation was moderated by gender in housework, care work, and regenerative activity. This research can contribute to the development of debate on work-life balance of workers' by providing the concrete and detailed results.

The Effects of Increase in Childcare Subsidy on Time Allocation of Women -Focusing on Low-income and Moderate-income Women with Pre-school Children- (보육료 지원 확대가 여성의 생활시간 배분에 미치는 영향 -미취학자녀가 있는 중하위소득 가구의 여성을 중심으로-)

  • Byun, Geumsun;Heo, Yongchang
    • Korean Journal of Social Welfare
    • /
    • v.66 no.2
    • /
    • pp.101-125
    • /
    • 2014
  • This paper aims to examine the effects of increase in childcare subsidy on time allocation of women, particularly low- and moderate-income women with pre-school children. For the purpose, the study adopts seemingly unrelated tobit and analyses data from the 2004 and 2009 Time Use Survey Data of the National Statistical Office. First of all, the results reveal that the policy changes in childcare subsidy affect time allocation of low- and moderate-income women with pre-school children, which increases paid-work whereas decreases caregiving and housework in a daily life. The results show that the changes take place in accordance with the goals of childcare subsidy promoting women's employment and reducing women's burden of caregiving. Yet the study has a couple of limitations- the only marginally significant impact in several variables, little effect on time allocation of all women- for the generalization of the findings. Nevertheless, the results indicate that employment policies for women, particularly for mothers, and the provision of childcare services should be improved to maximize the positive effects of increase in childcare subsidy.

  • PDF

Efficient Multiple Joins using the Synchronization of Page Execution Time in Limited Processors Environments (한정된 프로세서 환경에서 체이지 실행시간 동기화를 이용한 효율적인 다중 결합)

  • Lee, Kyu-Ock;Weon, Young-Sun;Hong, Man-Pyo
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.732-741
    • /
    • 2001
  • In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

  • PDF

An Asynchronous Burst Time Plan Generation Method for Broadband Satellite Multimedia System

  • Feng, Shaodong;Wang, Fan;Lin, Yuan;Gou, Liang;Li, Guangxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.386-404
    • /
    • 2013
  • In broadband satellite multimedia (BSM) system, burst time plan (BTP) is always periodically generated. We find that this method can have a great effect on the system response ability to bandwidth requests. A general analysis model of BTP generation method is given. An optimized BTP generation (O-BTPG) method is presented by deducing the optimal bandwidth allocation period (BAP) and bandwidth allocation latency (BAL) without considering the signaling overhead caused by BTP. Then a novel asynchronous BTP generation (A-BTPG) method in which the BTP is generated asynchronously according to the traffic load from users' bandwidth requests is proposed. Simulation results show that A-BTPG can flexibly realize a trade-off between the system response ability and BTP signaling overhead. What's more, it can be widely used in various regenerative onboard switching BSM systems.

Particle Swarm Optimization for Redundancy Allocation of Multi-level System considering Alternative Units (대안 부품을 고려한 다계층 시스템의 중복 할당을 위한 입자 군집 최적화)

  • Chung, Il Han
    • Journal of Korean Society for Quality Management
    • /
    • v.47 no.4
    • /
    • pp.701-711
    • /
    • 2019
  • Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

Concurrent Channel Time Allocation for Resource Management in WPANs

  • Park, Hyunhee;Piamrat, Kandaraj;Singh, Kamal Deep
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.2
    • /
    • pp.109-115
    • /
    • 2014
  • This paper presents a concurrent channel time allocation scheme used in the reservation period for concurrent transmissions in 60-GHz wireless personal area networks (WPANs). To this end, the proposed resource allocation scheme includes an efficient method for creating a concurrent transmission group by using a table that indicates whether individual streams experience interference from other streams or not. The coordinator device calculates the number of streams that can be concurrently transmitted with each stream and groups them together on the basis of the calculation result. Then, the coordinator device allocates resources to each group such that the streams belonging to the same group can transmit data concurrently. Therefore, when the piconet coordinator (PNC) allocates the channel time to the individual groups, it should allow for maximizing the overall capacity. The performance evaluation result demonstrates that the proposed scheme outperforms the random grouping scheme in terms of the overall capacity when the beamwidth is $30^{\circ}C$ and the radiation efficiency is 0.9.

Dynamic Bandwidth Allocation of CAN-based Network using increments of signal applied to Marine Engine Monitoring System (신호 증감 량을 이용한 CAN 기반 선박 엔진 모니터링 시스템의 동적인 대역폭 할당)

  • Lee, Hyun;Lee, Jun-Seok;Lim, Hyun-Seop;Lee, Jang-Myung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.6
    • /
    • pp.838-844
    • /
    • 2012
  • This paper proposes the effective monitoring method for marine engine system, which is implemented based upon Controller Area Network (CAN). As the marine engine monitoring system requires various kind of information, a lot of sensor nodes are distributed to several places. The CAN supports huge numbers of message IDs for the sensor nodes and provides a stable communication channel in a wide area such as a 12,000 TEU container ship. Since the CAN is priority-based communication system, some of hard real-time messages like alarm messages which are time-critical to the operation of the vessel cannot be communicated within the dead-time. Therefore it is desirable to distinguish the bandwidth of the CAN for static state messages and transition-state messages not to be harmful to the engine operations. Using the features of message arbitration ability of the CAN, it is proposed in this paper that the bandwidth allocation is dynamically adjusted to cope with the increment of input signal to improve the performance of monitoring system. Effectiveness and validity of the proposed scheme have been demonstrated through real experiments.

A Priority-based Time Slot Allocation Protocol for Hybrid MAC in WSNs (WSN에서 하이브리드 MAC을 위한 우선순위기반 타임 슬롯 할당 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1435-1440
    • /
    • 2014
  • Nodes in WSNs must operate under limited energy resource. Controlling access to the channel in WSNs plays a key role in determining channel utilization and energy consumption. This paper introduces a priority-based time slot allocation protocol for hybrid TDMA/CSMA MAC in WSNs. This protocol combines both TDMA and CSMA techniques while introducing prioritization by (m,k)-firm constraint. The performance of this protocol is obtained through simulations for various number of nodes and show significant improvements in delay and packet delivery ratio compared to S-MAC.