• 제목/요약/키워드: Schedule delay

검색결과 220건 처리시간 0.035초

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

  • 차진아
    • Journal of Nutrition and Health
    • /
    • 제24권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)

  • 김성수
    • 한국정보처리학회논문지
    • /
    • 제5권6호
    • /
    • pp.1639-1651
    • /
    • 1998
  • 본 논문에서는 RESO(REcomputation with Shifted Operands)와 같은 시간 결함허용 기법을 이용한 단일칩 컴퓨터의 결함허용성을 평가하기 위한 분석 및 시뮬레이션 모델을 제안한다. 단일칩으로 들어오는 모든 작업은 이중화 처리된다고 가정하고 1차 작업과 2차 작업의 효율적인 처리를 위한 세가지 스케쥴링 방법들을 제안하고 분석한다. 고안된 스케쥴링 방법들은 결함과 결함허용으로 인한 응답시간 지연이 시스템의 비용에 미치는 영향을 단일칩의 부하와 결함발생율에 따라서 평가한다. 제안된 모델을 사용하면 비용, 단일칩의 부하 및 결함발생율과 같은 실험 파라미터에 기초한 최적 지연($\kappa$)를 가지는 결함허용 스케쥴을 구할 수 있다.

  • 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
    • /
    • 제4권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
    • /
    • 제17권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
    • /
    • 제27권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)

  • 박형준;신재영
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2018년도 춘계학술대회
    • /
    • pp.59-60
    • /
    • 2018
  • 부산신항의 환적화물 처리물량은 지속적으로 늘어나 전체 물동량의 50%를 넘기고 있지만 작업자의 경험에 의존한 작업의 순서 결정에 따라 효율적인 환적화물 운송이 이루어지고 있다고 보기 힘들다. 특히, 외부 트럭이 필요한 경우가 많은 타부두 환적은 작업 상황에 따라 차량 대기로 인한 과도한 혼잡으로 물류비 증가와 사회적 비용이 발생하게 된다. 이 문제를 해결하기 위한 방법 중 하나는 트럭의 단일 운송을 최소화하고 작업을 마친 트럭을 다른 작업에 투입하여 활용하는 듀얼 사이클 운송을 최대화하는 것이다. 이에 따라, 본 연구에서는 컨테이너 터미널간 환적화물의 듀얼 사이클 운송을 위한 방안에 대해 연구하고자 한다.

  • PDF

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

  • 유대선;이현수
    • 전기학회논문지
    • /
    • 제68권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)

  • 김경애;유승흠;김인숙;손태용;박은철
    • 한국병원경영학회지
    • /
    • 제7권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)

  • 권혁민
    • 한국인터넷방송통신학회논문지
    • /
    • 제12권1호
    • /
    • pp.17-27
    • /
    • 2012
  • 방송 기반의 데이터 전파는 모바일 컴퓨팅 환경에서 보편적으로 받아들여지는 통신 방식이다. 그러나 많은 데이터를 방송해야 할 경우에 방송 채널의 순차성으로 인하여 원하는 데이터를 수신하기까지의 예상 지연시간이 증가한다. 이 대기시간을 줄이기 위하여 본 논문은 다중 채널에 적절하게 데이터를 할당하기 위한 주제를 연구하여 NODA(near optimal data allocation)로 명명된 새로운 데이터 할당 기법을 제안한다. 제안된 기법은 우선 각 방송 채널이 방송해야 하는 데이터들을 결정하기 위하여 평균 예상지연시간의 이론적 하한 값에 기초하여 전체 데이터들을 K개의 그룹으로 분할한다. 그리고 나서 NODA는 동일 방송 채널에 할당된 데이터들을 다른 빈도로 방송하기 위하여, 각 그룹의 데이터들을 확장된 동적 프로그래밍 알고리즘을 사용하여 B개의 그룹으로 분할한다. 제안된 기법은 동일 채널에 할당된 데이터들을 그들의 인기도를 반영하여 방송할 수 있기 때문에 평균 예상지연시간을 최소화할 수 있다.

HIPERLAN/2에서 최소 RCH 수를 제한한 동적 랜덤채널 할당 기법 (Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2)

  • 강재은;이정규
    • 한국통신학회논문지
    • /
    • 제34권1A호
    • /
    • pp.58-64
    • /
    • 2009
  • 본 논문에서는 최적화된 $\beta$개로 최소 랜덤 채널 RCH(Random CHannels) 개수를 제한함으로써, 단말이 채널 경쟁 구간에서 채널을 획득할 확률을 높이고 지연시간을 줄이는 알고리즘을 제안한다. HIPERLAN/2의 MAC 프로토콜은 TDMA/TDD 기반으로 동작하며, 단말은 RCH 구간을 통해 채널 경쟁에서 성공함으로써 트래픽 전송기회를 획득한다. 그러므로 AP는 각 RCH에서의 단말들의 채널 요청 메시지의 충돌 여부에 따라, 다음 프레임에서 최적의 RCH 개수를 동적으로 할당할 수 있다. 따라서 본 논문에서는 최소 RCH 개수를 $\beta$개로 제한하는 동적 랜덤채널할당 기법을 통해 채널 경쟁에서의 최소 성공률을 보장함으로써 HIPERLAN/2의 시스템 성능을 향상시킨다. 또한 실제 인터넷 트래픽에 기반한 이더넷 분포와 배치 도착을 적용한 시뮬레이션을 통해 최적의 $\beta$ 값을 찾아내며, 제안하는 알고리즘이 기존 알고리즘과 비교하여 처리율이 향상되고 최대 19%의 지연시간이 감소됨을 보여준다.