This study investigates the main factors of production, their interaction and influence on cycle time efficiency for shovel-truck systems on surface mines. The main factors are truck payload, cycle time and operator proficiency. It is now routine that shoveltruck cycles are analysed using simulation methods. The Elbrond, FPC, Talpac, Arena and Machine Repair simulation models are discussed to explain how their model characteristics contribute to the differences in their reported cycle efficiency as indicated by productivity results. The Machine Repair Model based on Markov chains is adapted for shovel-truck systems and examined for calculating shovel-truck cycle times. The various probability distributions that can be use to model particular cycle time variables and some methods in selecting the “best” fit are examined. Truck cycle time variable sensitivity is examined by using the Excel® add-on program @Risk (Palisade Corp.) in determining their respective weighting or contribution within the total cycle time variability. The analysis of cycle efficiency leads ultimately to sizing of a shovel-truck system. When determining a fleet size for a particular surface operation the planning engineers will tend to use one and to a lesser extent perhaps two separate simulation models. This study calculates the productivity (tonnes per hour) for a “virtual mine” with a variable number of trucks, variable cycle distances and variable truck loading times. The study also includes a separate analysis of cycle time variables and their probability distributions for the Orapa diamond mine in Botswana, to show possible distributions for various cycle variables. The study concludes with a calculation of the truck fleet size using the Elbrond, FPC, Talpac and Arena and Machine Repair models for the Optimum Colliery coal mine and then compares the results and their correlation. The main findings are that the calculation of waiting time is different for the various models, each model yields a unique fleet sizing solution and any solution in effect represents a range of results.

The Internet, traditionally FTP, e-mail and Web traffic, is increasingly supporting emerging applications such as IP telephony, video conferencing and online games. These new genres of applications have different requirements in terms of throughput and delay than traditional applications. For example, interactive multimedia applications, unlike traditional applications, have more stringent delay constraints and less stringent loss constraints. Unfortunately, the current Internet offers a monolithic best-effort service to all applications without considering their specific requirements. Adaptive RED (ARED) is an Active Queue Management (AQM) technique, which optimizes the router for throughput. Throughput optimization provides acceptable QoS for traditional throughput sensitive applications, but is unfair for these new delay sensitive applications. While previous work has used different classes of QoS at the router to accommodate applications with varying requirements, thus far all have provided just 2 or 3 classes of service for applications to choose from. We propose two AQM mechanisms to optimize router for better overall QoS. Our first mechanism, RED-Worcester, is a simple extension to ARED in order to tune ARED for better average QoS support. Our second mechanism, REDBoston, further extends RED-Worcester to improve the QoS for all flows. Unlike earlier approaches, we do not predefine classes of service, but instead provide a continuum from which applications can choose. We evaluate our approach using NS-2 and present results showing the amount of improvement in QoS achieved by our mechanisms over ARED.

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Civil Engineering. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaves 89-90. / M.S.

Thesis. 1976. M.S.--Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. / Microfiche copy available in Archives and Aero. / Bibliograpy: leaf 154. / by Peeter A. Kivestu. / M.S.

by Wai Ki Ching. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (p. 82-87). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaves 186-189. / by Richard Paul Wiley. / M.S.

This dissertation contributes to the study of a queueing system with a single pool of multiple homogeneous servers to which multiple classes of customers arrive in independent streams. The objective is to devise appropriate staffing and scheduling policies to achieve specified class-dependent service levels expressed in terms of tail probability of delays. Here staffing and scheduling are concerned with specifying a time-varying number of servers and assigning newly idle servers to a waiting customer from one of K classes, respectively. For this purpose, we propose new staffing-and-scheduling solutions under the critically-loaded and overloaded regimes. In both cases, the proposed solutions are both time dependent (coping with the time variability in the arrival pattern) and state dependent (capturing the stochastic variability in service and arrival times). We prove heavy-traffic limit theorems to substantiate the effectiveness of our proposed staffing and scheduling policies. We also conduct computer simulation experiments to provide engineering confirmation and practical insight.

by Ma Yiguang. / "April 2000." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (p. 117-[124]). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

John N. Tsitsiklis. / "February, 1982." "OSP No. 87049." / Bibliography: p. 39-41. / National Science Foundation Grant DAR78-17826