Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisors: Gang Yu and Jonathan Bard. Vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1974. / Typescript. Vita. Includes bibliographical references (leaves 147-149).

University, Diss., 2002--Dortmund.

Thesis (Ph. D.)--Ohio State University, 2007. / Full text release at OhioLINK's ETD Center delayed at author's request

University, Diss., 2000--Saarbrücken.

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2007. / Dr. Faiz Al-Khayyal, Committee Co-Chair ; Dr. Paul M. Griffin, Committee Co-Chair ; Dr. Earl Barnes, Committee Member ; Dr. Jye-Chyi Lu, Committee Member ; Dr. John Elton, Committee Member.

Thesis (Ph. D.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains xi, 181 p. : ill. Includes abstract. Includes bibliographical references (p. 162-167).

The purpose of this research is to investigate the effects of different scheduling operating policies in real- time scheduling. The scheduling policies include due date assignment method, priority rules, process batch method and operator reassignment policy. A specific case of production scheduling-in a hypothetical assembled product manufacturing system was investigated in this research. The simulated production system encompasses fifteen work centres, each containing one to three identical machines and each machine requires one operator with all operations being perfectly efficient on all machine types. The production -system produces finished products as well as components and sub-assemblies. Orders from outside the system arrive for service generated according to the exponential distribution. The orders coming to the system were classified into 'priority' and 'standard' orders. Processing times at each work centre are statistically independent and uniformly distributed. A computer simulation technique was chosen as the approach method. A computer simulation written in DBASE III PLUS was used to generate the data for analysis. In order to analyse the behaviour of the simulated production system with respect to the different performance criteria, a number of performance measures were selected. These are, mean tardiness, percent tardy, mean work in progress, mean machine utilisation, and mean operator utilisation. The 2x6x2x2 complete factorial is analysed by the analysis of variance (ANOVA) procedure to statistically determine whether due date assignment method, priority rules, process batch method, and operator reassignment policy or their interaction significantly affect the performance criteria considered. Further analysis to identify where significant differences in performance occur is conducted via Duncan multiple comparison test. Based upon the statistical analysis it was found that the relative impact of due date assignment method, priority rule, process batch method, and operator reassignment policy or their interaction for scheduling policies in real time scheduling to be dependent upon the measure of performance considered. In respect of root mean square of tardiness, the scheduling policies involving the slack time remaining (STR) priority rule are the most important of scheduling policies in minimising the tardiness of customer orders produced by the company. In respect to minimising the work in progress, there is no dominant level of due date assignment method, or priority rule or process batch method or operator reassignment policy. However, the scheduling policies involving the variable process batch (VPB) method produce the best result. The scheduling policies involving the variable process batch (VPB) method are the best performers in maximising the utilisation of machine and operator.

abstract: Research literature was reviewed to find recommended tools and technologies for operating Unmanned Aerial Systems (UAS) fleets in an urban environment. However, restrictive legislation prohibits fully autonomous flight without an operator. Existing literature covers considerations for operating UAS fleets in a controlled environment, with an emphasis on the effect different networking approaches have on the topology of the UAS network. The primary network topology used to implement UAS communications is 802.11 protocols, which can transmit telemetry and a video stream using off the shelf hardware. Other implementations use low-frequency radios for long distance communication, or higher latency 4G LTE modems to access existing network infrastructure. However, a gap remains testing different network topologies outside of a controlled environment. With the correct permits in place, further research can explore how different UAS network topologies behave in an urban environment when implemented with off the shelf UAS hardware. In addition to testing different network topologies, this thesis covers the implementation of building a secure, scalable system using modern cloud computation tools and services capable of supporting a variable number of UAS. The system also supports the end-to-end simulation of the system considering factors such as battery life and realistic UAS kinematics. The implementation of the system leads to new findings needed to deploy UAS fleets in urban environments. / Dissertation/Thesis / Masters Thesis Computer Science 2018

Abstract Designing energy-efficient multiprocessing hardware for applications such as video decoding or MIMO-OFDM baseband processing is challenging because these applications require high throughput, as well as flexibility for efficient use of the processing resources. Application specific hardwired accelerator circuits are the most energy-efficient processing resources, but are inflexible by nature. Furthermore, designing an application specific circuit is expensive and time-consuming. A solution that maintains the energy-efficiency of accelerator circuits, but makes them flexible as well, is to make the accelerator circuits fine-grained. Fine-grained application specific processing elements can be designed to implement general purpose functions that can be used in several applications and their small size makes the design and verification times reasonable. This thesis proposes an efficient method for orchestrating the use of heterogeneous fine-grained processing elements in dynamic applications without introducing tremendous orchestration overheads. Furthermore, the thesis presents a processing element management unit which performs scheduling and independent dispatching, and works with such low overheads that the use of low latency processing elements becomes worthwhile and efficient. Dynamic orchestration of processing elements requires run-time scheduling that has to be done very fast and with as few resources as possible, for which this work proposes dividing the application into short static parts, whose schedules can be determined at system design time. This approach, often called quasi-static scheduling, captures the dynamic nature of the application, as well as minimizes the computations of run-time scheduling. Enabling low overhead quasi-static scheduling required studying simultaneously the computational complexity and performance of simple but efficient scheduling algorithms. The requirements lead to the use of flow-shop scheduling. This thesis is the first work that adapts the flow-shop scheduling algorithms to different multiprocessor memory architectures. An extension to the flow-shop model is also presented, which enables modeling a wider scope of applications than traditional flow-shop. The feasibility of the proposed approach is demonstrated with a real multiprocessor solution that is instantiated on a field-programmable gate array.