Browsing by Subject "Performance Evaluation"

Now showing 1 - 5 of 5

Open Access
Analyses of serial production lines and assembly systems for throughput and inyerdeparture time variability
(1998) Kök, Abdullah Gürhan
In this thesis, we study three different but closely related production system design problems. First, we investigate the effects of various design factors such as number of stations, buffer capacity, allocation of bulfers and location of a bottleneck on the interdeparture time variability of serial production lines. In the second part, we study the effects of number of component stations, processing time distributions, buffers and buffer allocation schemes on throughput and interdeparture time variability of assembly systems. As an alternative to work transfer, we introduce variability transfer and assess its effectiveness. We analyze the anomaly displayed by optimal throughput for some processing time distributions and uncover the underlying details of this behavior. In the third part, we analyze serial production lines and assembly systems under constant workload condition. In addition to investigating the problem of determining the optimal system size, we examine the effects of other design factors such as buffers and material handling time on throughput, interdeparture time variability and cost related measures. Each part reveals several important findings. We also discuss the managerial implications of these findings to present guidelines for the practitioners.
Open Access
Congestion control in interconnected computer networks
(1988) Ulusoy, Özgür
A computer network has a collection of resources shared by multiple users. The capacity of the resources is limited, and if the user demands exceed the capacity, the network becomes ’congested’. The congestion causes a degradation in system performance. In interconnected networks there are two classes of traffic within a network. One class is the local traffic that is generated and transmitted within the network. The other class is the internetwork traffic transmitted to or from other networks. In this thesis, the effect of internetwork traffic on the performance of a network is investigated. Computer simulation of an interconnected network model is provided in order to evaluate the effectiveness of a window-based congestion control mechanism on preventing congestion in gateways and in attached networks caused by the overload of internetwork traffic. Also two dynamic window congestion control algorithms are provided and studied. These algorithms provide further control to window mechanism by adjusting the window size in accordance with the availability of the network resources at the destination. Dynamic algorithms are evaluated comparing them with static window control.
Open Access
M/M/1 polling models with two finite queues
(1995) Daşçı, Abdullah
Polling models are special kinds of queueing models where multiple-customer type single-stage is considered. In this thesis, first an overview and a classification of polling models will be given. Then two-costomer one server M /M /l polling models will be analyzed and the performance of models will be developed for exhaustive, gated, and G-limited service policies. We give analytical methods for a special type of polling model where we solve the system to get mean queue lengths and thruput rates by three methods. The first one is based on solving the steady state distribution of the Markov Process. The second is a decompositon aiming to decrease the size of the problem. The third one is an approximation method that uses the earlier results and it is very accurate. The thesis will be concluded with possible future extensions.
Open Access
Modelling and analysis of pull production systems
(1995) Kırkavak, Nureddin
A variety of production systems appearing in the literature are reviewed in order to develop a classification scheme for production systems. A number of pull production systems appearing in the classification are found to be equivalent to a tandem queue so that accurate tandem queue decomposition methods can be used to find the performance of such systems. The primary concern of this dissertation is to model and analyze non-tandem queue equivalent periodic pull production systems. In this research, an exact performance evaluation model is developed for a singleitem periodic pull production system. The processing and demand interarrival times are assumed to be Markovian. For large systems, which are difficult to evaluate exactly because of large state spaces involved, an approximate decomposition method is proposed. A typical approximate decomposition procedure takes individual stages or pairs of stages in isolation to analyze the system and then it aggregates the results to obtain an approximate performance for the whole system. An experiment is designed in order to investigate the general behavior of the decomposition. The results are worth attention. A second aspect of this study is to investigate an allocation methodology to achieve the maximum throughput rate with providing two sets of allocation parameters regarding the number of kanbans and the workload at each stage of the system. Together with some structural properties, the experimental results provide some insight into the behavior of pull production systems and also provide a basis for the proposed allocation methodology. Finally, we conclude our findings together with some directions for future research.
Open Access
Transaction processing in distributed active real-time database systems
(Elsevier, 1998) Ulusoy, Özgür
An active real-time database system (ARTDBS) is designed to provide timely response to the critical situations that are defined on database states. Although a number of studies have already addressed various issues in ARTDBSs, little attention has been paid to scheduling transactions in a distributed ARTDBS environment. In this paper, 2 we describe a detailed performance model of a distributed ARTDBS and investigate various performance issues in time-cognizant transaction processing in ARTDBSs. The experiments conducted evaluate the performance under various types of active workload and different distributed transaction-processing architectures. The performance metric used in the evaluations is the fraction of transactions that violate their timing constraints. We also describe and evaluate a nested transaction execution scheme that improves the real-time performance under high levels of active workload. © 1998 Elsevier Science Inc. All rights reserved.