• Title/Summary/Keyword: Idle Time

Search Result 372, Processing Time 0.023 seconds

Reservation based Dispatching Rule for On-Time Delivery in System LSI Semiconductor FAB (시스템 LSI 반도체 FAB의 납기만족을 위한 예약 기반의 디스패칭 룰)

  • Seo, Jeongchul;Chung, Yongho;Park, Sangchul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.3
    • /
    • pp.236-244
    • /
    • 2014
  • Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

A Study on the Safety Stock (안전재고에 관한 연구)

  • 박병기;정종식
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.10 no.16
    • /
    • pp.143-147
    • /
    • 1987
  • Safety stocks constitute one of the major means of dealing with the uncertainties associated with variation in demand and lead time. Adeguate safety facilitate production activities and help to assure customers if good service on the other hand, carrying safety storks ties up working capital on goods that sit idle. The major problem of safety stocks management thus of consists of trying to achieve an optimal balance between the other carrying cost and the costs of stock shortage. Therefore, this study aims to find safety stock level of the fixed reorder quantity system and the fixed reorder cycle system of minimizing total cost when both demand and lead time are variable. (The distribution of demand and lead time is a mere assumption that follows the normal distribution) The results can be summarized as follows. i) Safety factor on the safety stock is determined by carrying cost and the costs of stock shortage: An optimal safety stick=the costs of stork shortage($C_s$) (the carrying cost($C_h$)+the costs of stock storage($C_s$). ii) The safety stock level of the fixed reorder quantity system is ($a{\;}_p\sqrt{L}{\sigma}$) under uncertainties. iii) The safety stock level of the fixed reorder cycle system is ($a{\;}_p\sqrt{R+L{\sigma}}$) under uncertain demand and constant lead time. ($a{\;}_p\sqrt{L{\sigma}_d{\;^2+{\mu}^2L{\sigma}^2}$) under demand and lead time uncertainties.

  • PDF

Mechanism for Fairness Service of Web Server

  • Rhee, Yoon-Jung;Park, Nam-Sup;Hyun, Eun-Sil;Kim, Jeong-Beom;Lee, Young-Ji;Yun, Ma-Ru;Hyeok Kang;Kim, Young-Jun;Kim, Tai-Yoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.355-357
    • /
    • 2001
  • HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server’s resource when server maintains connection with the idle-state client that requests no data for a certain time. This paper proposes the mechanism of a heuristic connection management supported by the client-side under persistent HTTP, in addition to HTTP/1.1’s fixed holding time model on server-side. The client exploits the tag information within transferred HTML page so that decides connection-closing time. As a result, the mechanism allows server to use server’s resource more efficiently without server’s efforts.

Workload Analysis of Discrete-Time BMAP/G/1 queue under D-policy (D-정책과 집단도착을 갖는 이산시간 MAP/G/1 대기행렬시스템의 일량 분석)

  • Lee, Se Won
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.6
    • /
    • pp.1-12
    • /
    • 2016
  • In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

A Hierarchical Time Division Multiple Access Medium Access Control Protocol for Clustered Underwater Acoustic Networks

  • Yun, Changho;Cho, A-Ra;Kim, Seung-Geun;Park, Jong-Won;Lim, Yong-Kon
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.3
    • /
    • pp.153-166
    • /
    • 2013
  • A hierarchical time division multiple access (HTDMA) medium access control (MAC) protocol is proposed for clustered mobile underwater acoustic networks. HTDMA consists of two TDMA scheduling protocols (i.e., TDMA1 and TDMA2) in order to accommodate mobile underwater nodes (UNs). TDMA1 is executed among surface stations (e.g., buoys) using terrestrial wireless communication in order to share mobility information obtained from UNs which move cluster to cluster. TDMA2 is executed among UNs, which send data to their surface station as a cluster head in one cluster. By sharing mobility information, a surface station can instantaneously determine the number of time slots in a TDMA2 frame up to as many as the number of UNs which is currently residing in its cluster. This can enhance delay and channel utilization performance by avoiding the occurrence of idle time slots. We analytically investigate the delay of HTDMA, and compare it with that of wellknown contention-free and contention-based MAC protocols, which are TDMA and Slotted-ALOHA, respectively. It is shown that HTDMA remarkably decreases delay, compared with TDMA and Slotted-ALOHA.

A Study on the Design of PLL for Improving of Characteristics of Locking Time and Jitter (Locking Time과 Jitter 특성의 개선을 위한 PLL 설계에 관한 연구)

  • Park, Jae-Boum;Park, Yun-Sik;Kim, Hwa-Young;Sung, Man-Young
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2003.07b
    • /
    • pp.1188-1191
    • /
    • 2003
  • In this paper, we focus our attention on the improvement of locking time and jitter parameter and propose the new structure of PLL which combined with the FVC, FOVI Matcher(FVC-Output and VCO-input Matching Circuit), Control Circuit and the conventional charge pump PLL. Using fast operation characteristics of the FVC, the circuit matching FVC-Output and VCO-input (FOVI Matcher) made to synchronize very fast. Fast locking time is usually required for application where the PLL has to settle rapidly if they switch from an idle mode to a normal mode and to track high-frequency data bit rate in data recovery systems. After a fast acqusition is achieved by the using the FVC, the conventional PLL operates for removing the phase error between the reference signal and the feedback signal. Therefore this structure can improve the trade-off between acquisition behavior and locked behavior.

  • PDF

A Study on the Efficient ATICC(Adaptive Time Interval Clustering Control) Algorithm for MANET (MANET에서 효율적인 ATICC(Adaptive Time Interval Clustering Control) 알고리즘에 대한 연구)

  • Kim, Young-sam;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.306-309
    • /
    • 2009
  • MANET(Mobile Ad-hoc Network)은 기간망에 의존하지 않는 이동 노드들로 구성된 자율망 또는 추론망 토폴로지에 의한 멀티홉 무선 네트워크이다. MANET을 구성하는 각 노드의 이동성, 속도 그리고 에너지와 같은 다양한 속성정보는 망의 특징과 운영을 결정하는 요인이다. 특히 망의 운영상, 전송 대역폭과 에너지 사용에 따른 제약을 가지며 이러한 특징을 고려한 라우팅 프로토콜의 설계 및 하드웨어 개발이 중요하게 요구된다. 본 논문에서는 계층적 클러스터 구조의 MANET 환경에서 노드의 에너지 속성과 네트워크의 트래픽 상태를 고려한 적응적 시간차 노드관리 기법인 ATICC(Adaptive Time Interval Clustering Control)을 제안한다. 제안된 ATICC은 시간차 노드 관리기법인 TICC(Time Interval Clustering Control)[1]에 기반하며 노드에 최적화된 Active/Sleep, Idle Listening 상태를 적응적으로 설정한 후 패킷을 전송함으로서 계층적 클러스터 내의 각 노드의 균형적인 에너지 소모를 이루는 에너지 효율적인 방식이다. 제안한 노드관리 방법은 기존의 LEACH, TICC과 비교 실험하고 그 성능을 검증하였다. 실험 결과, 제안한 노드관리 방법이 노드별 에너지 소모량을 줄였으며 전체 네트워크의 생존시간을 연장함으로서 기존의 방법 보다 우수함을 확인하였다.

  • PDF

Product-Mix Decision Using Lean Production and Activity-Based Costing: An Integrated Model

  • MOHSIN, Nidhal Mohammed Ridha;AL-BAYATI, Hossam Ahmed Mohamed;OLEIWI, Zahra Hasan
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.8 no.4
    • /
    • pp.517-527
    • /
    • 2021
  • While the two principles of lean manufacturing and time-driven activity-based costing (TDABC) have been established out of multiple incentives and do not follow the same particular targets, there is substantial commonality between them. In these conditions, the supply management of a multi-product system needs a rigorous production model to minimize costs. In this sense, this paper proposes an interactive model with the consideration of optimizing product-mix decisions using both lean development tools and TDABC. This paper proposes a qualitative approach using the case study of the Iraqi state company for battery production. The suggested model decreased manufacturing time and costs, along with some substantial reduction in idle production capacity by 26 percent in 2019, based on the findings of the case study. On the other hand, the proposed model gives two side advantages: an efficient division of costs on goods due to the use of time spent as a cost factor for products and cost savings due to the introduction of the lean manufacturing approach that reduces all additional costs and increases product-mix decisions. Furthermore, the analytical data gathered here suggests that the incorporation of lean management concepts and TDABC has a strong and important influence on product-mix decisions.

Surge Control of Turbofan Engine Compressor with the Variable Inlet Guide Vane (가변 안내익을 이용한 터보팬 엔진 압축기의 서지 제어)

  • Bae, Kyoungwook;Kim, Sangjo;Han, Dongin;Min, Chanoh;Lee, Daewoo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.41 no.7
    • /
    • pp.539-546
    • /
    • 2013
  • Surge phenomenon can be occurred in a compressor when compressor performance of turbofan engine for an aircraft is changed considerably in a short time on the cases like take-off phase and changing of RPM from idle to maximum, because performance of aircraft engine is changed suddenly. This study is aimed to avoid surge in a compressor. Dynamic simulation in a compressor is modeled by simulink in specific condition. Fuel flow is control input, rpm and air mass flow are expressed in terms of transfer function. Surge margin is obtained by using compressor performance map from NPSS. VIGV(Variable Inlet Guide Vane) is controlled by PD controller with difference between surge margin and reference. Finally this paper verifies IGV can prevent surge phenomenon in a compressor.

Performance Improvement of STAC Protocol by Early Release of Reply Round and Transmission Probability Control (응답 라운드 조기종료와 전송확률 제어를 통한 STAC 프로토콜의 성능 개선)

  • Lim, Intaek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2569-2574
    • /
    • 2013
  • In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, the reader uses the tag number estimation scheme to determine the number of slots for the next reply round. If errors occur in the estimated number of tags, the identification performances will be degraded due to a lot of collision or idle slots. Therefore, in this paper, we propose an ERPB algorithm that the reader cancels the reply round when it experiences a series of collision or idle slots during the current round. The transmission probability control for the tag is also applied to the proposed algorithm. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 39% lower than STAC protocol. Therefore, the proposed scheme can achieve faster tag identification time compared with STAC protocol due to the low collision rate.