• Title/Summary/Keyword: schedule delay

Search Result 223, Processing Time 0.022 seconds

Criteria for the Float Distribution (여유시간 분배기준에 관한 연구)

  • Lee Gul-Chan;Kim Kyung-Rai;Shin Dong-Woo
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.509-512
    • /
    • 2003
  • The Critical Path Method(CPM) is an effective tool used for planning and scheduling. One of strong point in the CPM is what can calculate float. Float is able to prolong without having an effect on overall schedule of project, however concept and scope about ownership is not definite, because it is a by-product of project. Thus participants have had many dispute in using float because of their interests. In recent years, a few theories have evolved in an attempt to solve this problem. But the prior research did not make a reasonable distribution of float because their criteria of distribution was based on ratio for total project time. Actually, an application of float is achieved by participant's delay risk. Therefore. this paper proposes criteria for float distribution using delay risks, and the framework for the assessment of the delay risks.

  • PDF

A Case Study on the Work Measurement of Hospital Foodservice by the Work Sampling Methodology (워크샘플링(Work Sampling)에 의한 병원급식의 작업측정 사례연구)

  • 차진아
    • Journal of Nutrition and Health
    • /
    • v.24 no.6
    • /
    • pp.547-559
    • /
    • 1991
  • The purposes of this study were to : a)determine the percentage of labor activities expen-ded in various work functionsof hospital foodservice b)estimate the labor time utilized in each work functions c)investigate the overall work patterns of hospital foodservice and d)provide the basic data for effective labor control This study was conducted in two hospitals with 1300 and 1200 ed capacities and every employees of the dietary department were included in 10days work measurement. Work sampling methodology developed by Donaldson and Ostenso was modified and used for observing overall activities of hospital dietary department. Consistency of data and observa-tion period were verified by 3$\delta$ control chart and control chart. Observed data were satisfied with confidence level of 95% and confidence interval of $\pm$0.05, The results of this study were as follows: 1) The direct work function indirect work function and delay were 74.8%, 9.2%, 16.0% respectively with A hospital and 82.2% 7.2%, 10.6% respectively with B hospital 2) The productivity indices of direct work indirect work and delay were 9.05 min/meal 1.12 min/meal 1.94 min/meal respectively and total 12.11 minutes were utilized per meal served in A hospital and 10.72 min/meal 0.94 min/meal 1.38 min/meal respectively and total 13.04 minutes were utilized per meal served in B hospital 3) Full time equivalent(FTE) utilized in daily work of irect work indirect work and delay were 62.24 men 7.69 men 13.35 men respectively in A hospital and 64.09 men 5.63 men 8.22 men respectively in B hospital. 4) The contents of work activities of each employee group showed that delay time of the service personnel group was more than any other employee groups in both A hospital and B hospital 5) Examination of daily work schedule by time intervals showed that transportation work function was carried out all day so it is necessary to improve this work.

  • PDF

Performance Analysis of Fault-Tolerant Scheduling in a Uniprocessor Computer (단일칩 컴퓨터의 결함허용 스케쥴링 성능 분석)

  • Kim, Sung-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1639-1651
    • /
    • 1998
  • In this paper, we present analytical and simulation models for evaluating the operation of a uniprocessor computer which utilizes a time redundant approach (such as recomputation by shilted operands) for lault-tolerant computing. In the proposed approach, all incoming jobs to the uniprocessor are duplicated, thus two versions 01 each job must be processed. Three methods for appropriately scheduling the primary and sL'Condary versions of the jobs are proposed and analyzed. The proposed scheduling methods take into account the load and the fault rate of the uniprocessor to evaluate two figures of merit for cost and profit with respect to a delay in response time due to faults and fault tolerance. Our model utilizes a fault-tolerant schedule according to which it is possible to find an optimal delay (given by $\kappa$) based on empiric parameters such as cost, the load and the fault rate of the uniprocessor.

  • PDF

Performance Analysis of an ATM MUX with a New Space Priority Mechanism under ON-OFF Arrival Processes

  • Bang, Jongho;Ansari, Nirwan;Tekinay, Sirin
    • Journal of Communications and Networks
    • /
    • v.4 no.2
    • /
    • pp.128-135
    • /
    • 2002
  • We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

Enhanced TDMA based MAC Protocol for Adaptive Data Control in Wireless Sensor Networks

  • Alvi, Ahmad Naseem;Bouk, Safdar Hussain;Ahmed, Syed Hassan;Yaqub, Muhammad Azfar;Javaid, Nadeem;Kim, Dongkyun
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.247-255
    • /
    • 2015
  • In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

Wireless Packet Scheduling Algorithm for OFDMA System Based on Time-Utility and Channel State

  • Ryu, Seung-Wan;Ryu, Byung-Han;Seo, Hyun-Hwa;Shin, Mu-Yong;Park, Sei-Kwon
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.777-787
    • /
    • 2005
  • In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

  • PDF

Transportation Scheduling of Transshipment Cargo between Terminals considering Dual Cycle (컨테이너 터미널간 환적화물의 듀얼 사이클 운송에 관한 연구)

  • Park, Hyoung-Jun;Shin, Jae-Young
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2018.05a
    • /
    • pp.59-60
    • /
    • 2018
  • Busan New Port has continued to expand its capacity to handle transshipment cargos exceeding 50 percent of its total volume, but it is considered inefficient because of the work scheduling based on the worker experience. In particular, depending on the transshipment task situation, which often requires an external truck, excessive congestion caused by the vehicle's delay can lead to increased logistics costs and social costs. One way to resolve this issue is to minimize the single transport of the truck and to maximize dual-cycle transport by putting the finished truck into another task. Therefore, we would like to study how to efficiently schedule transportation transshipment cargos between terminals considering dual-cycle.

  • PDF

Real Time Sudden Demand Negotiation Framework based Smart Grid System considering Characteristics of Electric device type and Customer' Delay Discomfort (전력기기 특성 및 가동 지연 불편도를 고려한 실시간 급작 수요 협상 프레임웍 기반 스마트 그리드 시스템)

  • Yoo, Daesun;Lee, Hyunsoo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.3
    • /
    • pp.405-415
    • /
    • 2019
  • The considerations of the electrical device' characteristics and the customers' satisfaction have been important criteria for efficient smart grid systems. In general, an electrical device is classified into a non-interruptible device or an interruptible device. The consideration of the type is an essential information for the efficient smart grid scheduling. In addition, customers' scheduling preferences or satisfactions have to be considered simultaneously. However, the existing research studies failed to consider both criteria. This paper proposes a new and efficient smart grid scheduling framework considering both criteria. The framework consists of two modules - 1) A day-head smart grid scheduling algorithm and 2) Real-time sudden demand negotiation framework. The first method generates the smart grid schedule efficiently using an embedded genetic algorithm with the consideration of the device's characteristics. Then, in case of sudden electrical demands, the second method generates the more efficient real-time smart grid schedules considering both criteria. In order to show the effectiveness of the proposed framework, comparisons with the existing relevant research studies are provided under various electricity demand scenarios.

Delayed use of Operating Rooms in a University Hospital (한 대학병원의 수술실 이용 지연요인과 개선방안에 관한 연구)

  • Kim, Kyung-Ae;Yu, Seung-Hum;Kim, In-Sook;Sohn, Tae-Yong;Park, Eun-Cheol
    • Korea Journal of Hospital Management
    • /
    • v.7 no.3
    • /
    • pp.44-62
    • /
    • 2002
  • Advanced surgical technology demands more precise, meticulous, and time-consuming procedures. In addition, the patient's preference of tertiary health providers makes over crowding of the University Hospitals. Therefore, it has been necessary to maximize utilization of the operating room of such hospitals to accommodate these requirements. This study, targeting 1,302 surgical cases performed in 22 operating rooms at a university hospital in Seoul from October 8 to November 1, 2001, analyzed reasons for delay, and factors that caused delayed use of operating rooms. This study also assessed that the rate of operating room use would increase if the sources for possible reform were improved. 1. Among total of 1,302 cases of surgery, the incidence of surgeries in which there were no time delays and no factors for delay were discovered is 71.4% or 930 cases: the incidence in which surgeries were delayed was 28.6% or 372 cases. 2. As results of logistic regression for delay, procedures involving women were delayed 1.4 times more frequently than those of men. Compared to Department A, Department B was 1.8 times more likely to be delayed, and Department H was 0.4 times less likely to be delayed. Regional anesthesia was 2.4 times more likely to be delayed than general anesthesia, and surgeries that PCA was applied were 0.6 times less likely to be delayed than those when it was not. Surgeries performed on the Thursday were 1.7 times more likely to be delayed than those performed on the Monday. Compared to surgeries performed between 07:00-07:59, those performed between 08:00-08:29 were 4.3 times higher. 3. The reasons for delay were related to surgeon, surgical department, patient, anesthesia, administrative system, sick ward, and support services. Among these, 5,755 minutes for 276 delayed cases could be resolved easily, and resolving delays of 3,320 minutes for 131 cases would be more difficult. Among the causes for delay that could be improved, delays due to patient's transfer and surgeon's factor were the most common, 21.6% and 17.4% respectively. 4. If resolvable delays are improved, pre-anesthesia room is administered, and regional anesthesia and PCA are done ahead of time, use of emergency operating rooms will increase, we can increase overall utilization by 4.09%, we will save 744 minutes a day, we can reduce the time the operation room is used after 4 PM by 35%, and we can resolve the operation cancellations due to insufficient operating rooms. For the increase in the use of operating rooms, we need to maximally decrease the delays that could be improved, by allocating block time based on used totals hours of elective cases, giving accurate information on surgery schedule, voluntary cooperation by staff participating in surgeries in reducing delay time, and the hospital management's will to improve delay.

  • PDF

A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments (다중 방송 채널 환경을 위한 유사 최적화 데이터 할당 기법)

  • Kwon, Hyeok-Min
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.17-27
    • /
    • 2012
  • Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.