Digital Commons Network^™

A Deep Reinforcement Learning Approach With Prioritized Experience Replay And Importance Factor For Makespan Minimization In Manufacturing, Jose Napoleon Martinez

LSU Doctoral Dissertations

In this research, we investigated the application of deep reinforcement learning (DRL) to a common manufacturing scheduling optimization problem, max makespan minimization. In this application, tasks are scheduled to undergo processing in identical processing units (for instance, identical machines, machining centers, or cells). The optimization goal is to assign the jobs to be scheduled to units to minimize the maximum processing time (i.e., makespan) on any unit.

Machine learning methods have the potential to "learn" structures in the distribution of job times that could lead to improved optimization performance and time over traditional optimization methods, as well as to adapt …

Appointment Scheduling System, Guzaloi Noori

Undergraduate Honors Theses

Appointment Scheduling System designed for universities so that students can schedule appointments with their university’s faculty and staff regarding academic, employment, immigration, or personal issues. The scheduling system has the ability of being embedded to the Computer Science Capstone project iAcademic, which I took part in as a front-end developer.

Leveraging Cloud-Based Nfv And Sdn Platform Towards Quality-Driven Next-Generation Mobile Networks, Hassan Hawilo

Electronic Thesis and Dissertation Repository

Network virtualization has become a key approach for Network Service Providers (NSPs) to mitigate the challenge of the continually increasing demands for network services. Tightly coupled with their software components, legacy network devices are difficult to upgrade or modify to meet the dynamically changing end-user needs. To virtualize their infrastructure and mitigate those challenges, NSPs have started to adopt Software Defined Networking (SDN) and Network Function Virtualization (NFV). To this end, this thesis addresses the challenges faced on the road of transforming the legacy networking infrastructure to a more dynamic and agile virtualized environment to meet the rapidly increasing demand …

Automatic Resource Management And Performance Optimization In Clusters, Yudi Wei

Wayne State University Dissertations

Virtual machine is a primary way to increase resource utilizations in data centers by encapsulating multi-resource demands for applications and providing performance isolation. Moreover, the resource configuration can change on the fly to satisfy performance target. Container is another popular way for fine-grained multi-resource allocation. In this disser- tation work, we aim to design and implement an automatic resource management system to improve application performance, optimize system efficiency and job completion times in virtual and physical clusters respectively.

For large-scale applications hosted in data center, automatic resource configuration is crucial to service availability and quality. The workload dynamics, cloud dynamics …

Practical Irrigation Scheduling Program, Dominic Sween

BioResource and Agricultural Engineering

This senior project discusses the design, construction, and evaluation of an irrigation scheduling program that aids users in alfalfa irrigation management, with the potential for application with other crops. The program uses a very accurate irrigation prediction model that forecasts what the estimated irrigation need of each week will be, as well as the number of irrigations needed to satisfy the requirement. The model was found to predict the sum of the actual required weekly irrigation amount within less than 1% of the true value. The program was based off the single crop coefficient approach that was outlined previously by …

Power-Efficient And Low-Latency Memory Access For Cmp Systems With Heterogeneous Scratchpad On-Chip Memory, Zhi Chen

Theses and Dissertations--Electrical and Computer Engineering

The gradually widening speed disparity of between CPU and memory has become an overwhelming bottleneck for the development of Chip Multiprocessor (CMP) systems. In addition, increasing penalties caused by frequent on-chip memory accesses have raised critical challenges in delivering high memory access performance with tight power and latency budgets. To overcome the daunting memory wall and energy wall issues, this thesis focuses on proposing a new heterogeneous scratchpad memory architecture which is configured from SRAM, MRAM, and Z-RAM. Based on this architecture, we propose two algorithms, a dynamic programming and a genetic algorithm, to perform data allocation to different memory …

Meta-Heuristics Analysis For Technologically Complex Programs: Understanding The Impact Of Total Constraints For Schedule, Quality And Cost, Henry Darrel Webb

Engineering Management & Systems Engineering Projects for D. Eng. Degree

Program management data associated with a technically complex radio frequency electronics base communication system has been collected and analyzed to identify heuristics which may be utilized in addition to existing processes and procedures to provide indicators that a program is trending to failure. Analysis of the collected data includes detailed schedule analysis, detailed earned value management analysis and defect analysis within the framework of a Firm Fixed Price (FFP) incentive fee contract.

This project develops heuristics and provides recommendations for analysis of complex project management efforts such as those discussed herein. The analysis of the effects of the constraints on …

A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Scheduling, placement, and routing are important steps in Very Large Scale Integration (VLSI) design. Researchers have developed numerous techniques to solve placement and routing problems. As the complexity of Application Specific Integrated Circuits (ASICs) increased over the past decades, so did the demand for improved place and route techniques. The primary objective of these place and route approaches has typically been wirelength minimization due to its impact on signal delay and design performance. With the advent of Field Programmable Gate Arrays (FPGAs), the same place and route techniques were applied to FPGA-based design. However, traditional place and route techniques may …

Filter Scheduling Function Model In Internet Server: Resource Configuration, Performance Evaluation And Optimal Scheduling, Minghua Xu

Wayne State University Dissertations

ABSTRACT

FILTER SCHEDULING FUNCTION MODEL IN INTERNET SERVER:

RESOURCE CONFIGURATION, PERFORMANCE EVALUATION AND

OPTIMAL SCHEDULING

by

MINGHUA XU

August 2010

Advisor: Dr. Cheng-Zhong Xu

Major: Computer Engineering

Degree: Doctor of Philosophy

Internet traffic often exhibits a structure with rich high-order statistical properties like selfsimilarity

and long-range dependency (LRD). This greatly complicates the problem of

server performance modeling and optimization. On the other hand, popularity of Internet

has created numerous client-server or peer-to-peer applications, with most of them,

such as online payment, purchasing, trading, searching, publishing and media streaming,

being timing sensitive and/or financially critical. The scheduling policy in Internet servers …

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu

Electrical & Computer Engineering Theses & Dissertations

Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …