Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"zero buffer"”.

  1. Optimal Server Allocation in Zero-Buffer Tandem Queues

    … for tandem queues in the absence of intermediate buffer space. Servers are assumed to be homogeneous and non-collaborative. We provide policies to maximize the throughput. We break down our work into four stages. First, we assume that all servers are dedicated. We propose an allocation algorithm …

    mcmaster Repository record for Optimal Server Allocation in Zero-Buffer Tandem Queues (opens in a new tab)

  2. Identification of Moving Bottlenecks in Production Systems

    … production line with five workstations and zero buffer was simulated in ARENA® with data regarding blocked, producing and starvation time extracted. The extracted data was preprocessed using Python 3.7 to obtain a matrix of ones and zeros. The resultant matrix was fed into a complete linkage …

    wvu Repository record for Identification of Moving Bottlenecks in Production Systems (opens in a new tab)

  3. MECHANISM OF DECARBOXYLATION OF PARA AMINO SALICYLIC ACID

    … at 25° C (μ = 0.50) as a function of pH and buffer concentration. A pH-rate profile was generated using the rate constants extrapolated to zero buffer concentration. The profile was bell-shaped with the maximum rate of decarboxylation near the isoelectric pH. The rate constants obtained in …

    ku Repository record for MECHANISM OF DECARBOXYLATION OF PARA AMINO SALICYLIC ACID (opens in a new tab)

  4. Routers and networks with near-zero buffers

    Routers in the Internet today employ buffers to store packets during periods of congestion. With Internet traffic expected to grow phenomenally over the next five to ten years, and as core link speeds approach terabits-per-second, it is becoming increasingly difficult (due to energy/power …

    unsw Repository record for Routers and networks with near-zero buffers (opens in a new tab)

  5. Optimal and Approximate Algorithms for the Multiple-Lots-per-Carrier Scheduling and Integrated Automated Material Handling and Lot Scheduling Problems in 300mm Wafer Fabs

    … optimal solutions at the starting node (node zero) itself. Next, we consider a single-machine, multiple-lots-per-carrier with single-carrier-processing-technology scheduling problem for the objective of minimizing total completion time (MLCSP2). As for the case of MLCSP1, the optimal solution …

    vt Repository record for Optimal and Approximate Algorithms for the Multiple-Lots-per-Carrier Scheduling and Integrated Automated Material Handling and Lot Scheduling Problems in 300mm Wafer Fabs (opens in a new tab)