• Title/Summary/Keyword: CycleTime

Search Result 4,423, Processing Time 0.036 seconds

Growth Characteristics of Ultrahigh-density Microalgal Cultures

  • Richmond, Amos
    • Biotechnology and Bioprocess Engineering:BBE
    • /
    • v.8 no.6
    • /
    • pp.349-353
    • /
    • 2003
  • The physiological characteristics of cultures of very high cell mass (e.g. 10g cell mass/L), termed“ultrahigh cell density cultures”is reviewed. A close relationship was found between the length of the optical path (OP) in flat-plate reactors and the optimal cell density of the culture as well as its areal (g m$\^$-2/ day$\^$-1/) productivity. Cell-growth inhibition (GI) unfolds as culture density surpasses a certain threshold. If it is constantly relieved, a 1.0cm OP reactor could produce ca. 50% more than reactors with longer OP, e.g. 5 or 10cm. This unique effect, discovered by Hu et al. [3], is explained in terms of the relationships between the frequency of the light-dark cycle (L-D cycle), cells undergo in their travel between the light and dark volumes in the reactor, and the turnover time of the photosynthetic center (PC). In long OP reactors (5cm and above) the L-D cycle time may be orders of magnitude longer than the PC turnover time, resulting in a light regime in which the cells are exposed along the L-D cycle, to long, wasteful dark periods. In contrast, in reactors with an OP of ca. 1.0 cm, the L-D cycle frequency approaches the PC turnover time resulting in a significant reduction of the wasteful dark exposure time, thereby inducing a surge in photosynthetic efficiency. Presently, the major difficulty in mass cultivation of ultrahigh-density culture (UHDC) concerns cell growth inhibition in the culture, the exact nature of which is awaiting detailed investigation.

Inventory Models for Fresh Agriculture Products with Time-Varying Deterioration Rate

  • Ning, Yufu;Rong, Lixia;Liu, Jianjun
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.1
    • /
    • pp.23-29
    • /
    • 2013
  • This paper presents inventory models for fresh agriculture products with time-varying deterioration rate. Due to the particularity of fresh agriculture products, the demand rate is a function that depends on sale price and freshness. The deterioration rate increases with time and is assumed to be a time-varying function. In the models, the inventory cycle may be constant or variable. The optimal solutions of models are discussed for different freshness and the deterioration rate. The results of experiments show that the profit depends on the freshness and deterioration rate of products. With the increasing inventory cycle, the sale price and profit increase at first and then start decreasing. Furthermore, when the inventory cycle is variable, the total profit is a binary function of the sale price and inventory cycle. There exist unique sale price and inventory cycle such that the profit is optimal. The results also show that the optimal sale price and inventory cycle depend on the freshness and the deterioration rate of fresh agriculture products.

A Study on the Annealing of High Tensile Strength Steel for Automobile (자동차용 고장력 강판의 열처리에 관한 연구)

  • 박범식
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.530-535
    • /
    • 1999
  • In recently, annealing process of cold rolled sheet tend to change to continuous annealing process for improving quality, saving yield. In the meantime as demand for various kind and small lot of products has been increasing, batch annealing has been appreciated for its small restriction for the operation. So, we tested on the effect for the proper heating temperatures, heating time of cycle, cooling time and total cycle time in this annealing process of hi tensile strength steel for automobile. As a result of several investigation. we confirmed for the following characteristics; In this process, we knew that 68$0^{\circ}C$ is suitable for this heating temp. cycle heating time of 38 Hr, cooling time of 31 Hr and total cycle time of 70 Hr. Still more, we could know that it is proper for cold rolling before annealing to be managed by 7 pass because of the act on high pressure.

  • PDF

Polynomial Time Algorithms for Solving the Multicommodity Flow Problems on Two Types of Directed Cycles

  • Myung, Young-Soo
    • Management Science and Financial Engineering
    • /
    • v.15 no.1
    • /
    • pp.71-79
    • /
    • 2009
  • This paper considers the two kinds of integer multicommodity flow problems, a feasibility problem and a maximization problem, on two types of directed cycles, a unidirectional and a bidirectional cycle. Both multicommodity flow problems on an undirected cycle have been dealt with by many researchers and it is known that each problems can be solved by a polynomial time algorithm. However, we don't find any result on the directed cycles. Here we show that we can also solve both problems for a unidirectional and a bidirectional cycle in polynomial time.

Stochastic Timed Net and Its Minimum Cycle Time Analysis (확률적 시간 넷과 최소 순회 시간 분석)

  • Yim Jae-Geol;Shim Kyu-Bark
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.671-680
    • /
    • 2006
  • As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the world is a stochastic number in general. In the consequence, the result of minimum cycle time analysis is not realistic. Therefore, we propose ‘Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for ‘Stochastic Timed Net’ As an example of the application of ‘Stochastic Timed Net’, we introduce a ‘Stochastic Timed Net' model of a Location Based Service Providing Multimedia System and the result of minimum cycle time analysis of it. Whereas the typical form of the result of the existing minimum cycle time analysis is 'It takes at least 10 time units', the typical form of the result of minimum cycle time analysis of a ‘Stochastic Timed Net' is in the probability form such as "The probability of the events in which it finishes its job within 10 time units is 85%."

  • PDF

Influence of Aeration Cycle on Nitrogen and Phosphorus Removal in Two-Stage Intermittent Aeration System (2단 간헐폭기 시스템에서 aeration cycle이 질소 및 인 제거에 미치는 영향)

  • Jeong, Myoung-Sun;Lee, Jun-Ho;Seo, Kwang-Bum;Kim, Yeong-Kwan
    • Journal of Industrial Technology
    • /
    • v.23 no.A
    • /
    • pp.193-197
    • /
    • 2003
  • This bench-scale research investigated the aeration cycle(on/off) as the controlling factors for nitrogen and phosphorus removal in a 2-stage, intermittent aeration process. At this experiment, the aeration cycle time(air-on/air-off) was 30min/30min, 60min/60min, 90min/90min. Organic matter removal was observed more than 90% regardless of the aeration cycle and phosphorus removal was relatively high when the aeration cycle time was 60min/60min On the other hand. For all of the aeration cycle, TN removal was appeared less than 55%. This result was probably due to the limitation of the external substrate for heterotrophic nitrification and aerobic denitrification.

  • PDF

On the Exact Cycle Time of Failure Prone Multiserver Queueing Model Operating in Low Loading (낮은 교통밀도 하에서 서버 고장을 고려한 복수 서버 대기행렬 모형의 체제시간에 대한 분석)

  • Kim, Woo-Sung;Lim, Dae-Eun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.2
    • /
    • pp.1-10
    • /
    • 2016
  • In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

An Integrated Production and Inventory Model in a Single-Vendor Multi-Buyer Supply Chain (단일 공급자 다수 구매자 공급체인에서 통합 생산 및 재고 모형)

  • Chang, Suk Hwa
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.117-126
    • /
    • 2015
  • This paper is to analyze an integrated production and inventory model in a single-vendor multi-buyer supply chain. The vendor is defined as the manufacturer and the buyers as the retailers. The product that the manufacturer produces is supplied to the retailers with constant periodic time interval. The production rate of the manufacturer is constant for the time. The demand of the retailers is constant for the time. The cycle time of the vendor is defined as the elapsed time from the start of the production to the start of the next production, while the cycle times of the buyer as the elapsed time between the adjacent supply times from the vendor to the buyer. The cycle times of the vendor and the buyers that minimizes the total cost in a supply chain are analyzed. The cost factors are the production setup cost and the inventory holding cost of the manufacturer, the ordering cost and the inventory holding cost of the retailers. The cycle time of the vendor is investigated through the cycle time that satisfies economic production quantity with the production setup cost and the inventory holding cost of the manufacturer. An integrated production and inventory model is formulated, and an algorithm is developed. An numerical example is presented to explain the algorithm. The solution of the algorithm for the numerical examples is compared with that of genetic algorithm. Numerical example shows that the vendor and the buyers can save cost by integrated decision making.

A Method for the high speed selection of information in the magnetic memory core (기억자심에서의 정보선택의 고속화방법)

  • 이주근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.6 no.3
    • /
    • pp.1-7
    • /
    • 1969
  • The Series RC load is connected with the word line in an attempt to select with high speed the information from the coincident current magnetie memory core. By taking the small time constant of the RC load, the cycle time of the output pulse is shortened by about 2 microseconds to 3 micro seconds. For this purpose, the analytical study are accomplished and the optimum circuit parameters are determined. Furthermore, the thermal problems occuring from the high speed switching of the magnetic memory core have been clarified.

  • PDF

An Analysis on the Cycle Time of a Symmetric Poling System with Nonexhaustive Service (비고갈 서비스 하에서의 대칭적 폴링시스템의 순환시간에 대한 분석)

  • 이명용;강석호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.1
    • /
    • pp.77-84
    • /
    • 1992
  • Queueing models with service can be applied in the area of performance studies of polling systems in data communication and switching systems. We provide a new approach for analysis on the cycle time of the multiqueue system consisting of statistically identical stations where at most one message is served for any station in a polling cycle. We assume an independent Posson arrival at each station. The message service time and switchover time are assumed to be constant. Based on the dependence between the stations, cycle time distribution is derived. Then, this result is validated by a computer simulation.

  • PDF