Digital Commons Network^™

Coordinating Job Release Dates With Workdays: A Job Shop Application To Utilities Field Service Scheduling, Ryan Lawrence Pelkey

Dissertations and Theses

A local utility company processes a variety of jobs each day including meter reading, service shut-offs, emergency response, and customer service work. For the Company, a specific workflow begins with automated meter-reading (AMR) and ends with collections/service shut-offs (CSOs) for accounts with excessively late payments (AMR-CSO workflow). There are considerable and systemic sources of variability in both the workload and resource demands of the AMR-CSO workflow including order arrival, order release schedules, order batch-sizing and maintenance scheduling.

This project draws on theory from the job-shop problem to explore possible means to mitigate this variability. We hypothesized that controlling various forms …

Updating The Kentucky Contract Time Determination System, Timothy R. B. Taylor, Paul M. Goodrum, Michael Brockman, Barry Bishop, Yongwei Shan, Roy E. Sturgill, Kevin Hout

Kentucky Transportation Center Research Report

The Federal Highway Administration requires State Transportation Agencies to have a formal method to estimate contract time for highway construction projects. To meet this requirement many states use an integrated scheduling system to estimate project durations based on assumed productivity rates and generic job logic. The current work investigated the accuracy of two of these systems found that both systems accuracy in predicting the duration of Kentucky Transportation Cabinet projects was greater than +200%. In response to this poor accuracy, a parametric project duration estimating tool was developed based on a multivariate regression analysis of bid item quantities and engineering …

Algorithmic And Mathematical Programming Approaches To Scheduling Problems With Energy-Based Objectives, Kan Fang

Open Access Dissertations

This dissertation studies scheduling as a means to address the increasing concerns related to energy consumption and electricity cost in manufacturing enterprises. Two classes of problems are considered in this dissertation: (i) minimizing the makespan in a permutation flow shop with peak power consumption constraints (the PFSPP problem for short) and (ii) minimizing the total electricity cost on a single machine under time-of-use tariffs (the SMSEC problem for short). We incorporate the technology of dynamic speed scaling and the variable pricing of electricity into these scheduling problems to improve energy efficiency in manufacturing.The challenge in the PFSPP problem is to …

Resource Allocation In Uplink Long Term Evolution, Aidin Reyhanimasoleh

Electronic Thesis and Dissertation Repository

One of the most crucial goals of future cellular systems is to minimize transmission power while increasing system performance. This master thesis work presents two channel-queue-aware scheduling schemes to allocate channels among active users in uplink LTE. Transmission power, packet delays and data rates are three of the most important criteria critically affecting the resource allocation designs. Therefore, each of these two scheduling algorithms proposes a practical method that assigns resources in such a way so as to optimally maximize data rate and minimize transmission power and packet delays while ensuring the QoS requirements. After converting the resource allocation problem …

Optimization Of Inpatient Hemodialysis Scheduling Considering Efficiency And Treatment Delays To Minimize Length Of Stay, Manuel Tolentino Peña

Theses

Inpatient dialysis units face an uncertain daily demand of hemodialysis procedures for end-stage renal disease (ESRD) patients hospitalized for health conditions that may or may not be directly related to their renal disease. While hospitalized, these patients must receive hemodialysis in addition to any medical services needed for their primary diagnosis. As a result, when demand for inpatient dialysis is high, treatments and procedures required by these inpatients may be delayed increasing their length of stays (LOS). This research presents an optimization approach for daily scheduling of inpatient hemodialysis to maximize the efficiency of the dialysis unit while minimizing delays …

Using A Mobile Device To Deliver Visual Schedules To Young Children With Autism, Leslie Nelson

UNLV Theses, Dissertations, Professional Papers, and Capstones

Young children with autism spectrum disorder (ASD) frequently display an inability to self-regulate (use materials appropriately and refrain from self-stimulatory behavior) and self-monitor (complete each step in a task before continuing to the next step) their behavior and therefore experience a great deal of failure within their respective school and home environments and frequently end up receiving instruction in restrictive, self-contained classrooms. Visual schedules have been used to help students with ASD self-regulate their behaviors in academic and community settings (NPDC, 2010; NSR, 2009). The purpose of this study was to determine whether high-tech visual schedules increase the self-regulation and …

Improved Photolithography Scheduling In Semiconductor Manufacturing, Sreenath Chalil Madathil

All Theses

Photolithography is typically the bottleneck process in semiconductor manufacturing. In this thesis, we present a model for optimizing photolithography job scheduling in the presence of both individual and cluster tools. The combination of individual and cluster tools that process various layers or stages of the semiconductor manufacturing process flow is a special type of flexible flowshop. We seek separately to minimize total weighted completion time and maximize on-time delivery performance. Experimental results suggest that our mathematical- and heuristic-based solution approaches show promise for real world implementation as they can help to improve resource utilization, reduce job completion times, and decrease …

Towards Viable Large Scale Heterogeneous Wireless Networks, Rahul Amin

All Dissertations

We explore radio resource allocation and management issues related to a large-scale heterogeneous (hetnet) wireless system made up of several Radio Access Technologies (RATs) that collectively provide a unified wireless network to a diverse set of users through co-ordination managed by a centralized Global Resource Controller (GRC). We incorporate 3G cellular technologies HSPA and EVDO, 4G cellular technologies WiMAX and LTE, and WLAN technology Wi-Fi as the RATs in our hetnet wireless system. We assume that the user devices are either multi-modal or have one or more reconfigurable radios which makes it possible for each device to use any available …

An Optimization Model For Class Scheduling At A Dance Studio, Chirag Ojha

All Theses

Scheduling has been a large area of research for decades. A substantial amount of work has been done to express, classify, and solve scheduling problems. Most of these problems are computationally difficult to solve and require complex algorithms. In this thesis, we develop a mixed-integer linear program for a real world optimization problem at a dance studio. Similar to a university, the students in this studio request a particular class and instructors teach the classes under constrained resources such as a limited number of classrooms. The priorities of instructors as well as dancers are included to further mimic reality. Experimental …

Energy Awareness And Scheduling In Mobile Devices And High End Computing, Sachin S. Pawaskaw

Student Work

In the context of the big picture as energy demands rise due to growing economies and growing populations, there will be greater emphasis on sustainable supply, conservation, and efficient usage of this vital resource. Even at a smaller level, the need for minimizing energy consumption continues to be compelling in embedded, mobile, and server systems such as handheld devices, robots, spaceships, laptops, cluster servers, sensors, etc. This is due to the direct impact of constrained energy sources such as battery size and weight, as well as cooling expenses in cluster-based systems to reduce heat dissipation. Energy management therefore plays a …

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 …

Scheduling With Uncertain Resources: Representation Of Common Knowledge, Eugene Fink, P. Matthew Jennings, Konstantin Salomatin, Jaime G. Carbonell

Jaime G. Carbonell

We describe a system for scheduling a conference based on incomplete information about available resources and scheduling constraints. We explain the representation of uncertain knowledge and related common-sense rules, which allow reasoning based on uncertain and partially missing data.

Rationalizing Creativity—Rationalizing Public Service: Is Scheduling Management Fit For The Digital Era?, Ann-Marie Murray

Articles

In public broadcast organizations across Europe, scheduling has been transformed from a marginal, administrative activity to a highly strategic management tool (Hellman, 1999; Hujanen, 2002; Meier, 2003;Ytreberg, 2000) Ellis (2000)described it as “the locus of power in television,” organizing production and managing budgets (p. 26). The role of scheduling in public broadcast organizations today reflects the demands of increasing competition and political pressure for efficiency and accountability. However, new challenges have emerged in the transition from public service broadcasting to public service media (PSM). PSM providers must redefine their mission for the digital era and find …

Heuristic Algorithms To Minimize Total Weighted Tardiness On The Single Machine And Identical Parallel Machines With Sequence Dependent Setup And Future Ready Time, Yue Xi

Theses and Dissertations

This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated …

East Tennessee Children's Hospital Lean, Eddie D. Eatherly, Catherine Julson, Kelsey Tjader, Jack Smodic, Lanier Loftin

Chancellor’s Honors Program Projects

No abstract provided.

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …

Simulated Annealing Approach To Flow Shop Scheduling, Sadhana Yellanki

UNLV Theses, Dissertations, Professional Papers, and Capstones

Flow Shop Scheduling refers to the process of allotting various jobs to the machines given, such that every job starts to process on a machine n only after it has finished processing on machine n-1, with each job having n operations to be performed one per machine. To find a schedule that leads to the optimal utilization of resources, expects the schedule to finish in a minimum span of time, and also satisfy the optimality criterion set for the related scheduling problem is NP-Hard, if n > 2. In this thesis, we have developed an algorithm adopting a heuristic called Simulated …

Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala

UNLV Theses, Dissertations, Professional Papers, and Capstones

The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q₂||C_max. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q₂||C_max using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T²) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is …

An Exact And Meta-Heuristic Approach For Two-Agent Single-Machine Scheduling Problem, Wen-Hung Wu

Journal of Marine Science and Technology

In many real-life applications, it can be often found that multiple agents compete on the usage of a common processing resource in different application environments and different methodological fields, such as artificial intelligence, decision theory, operations research, etc. Moreover, scheduling with multiple agents is relatively unexplored. Based on this observation, this paper attempts to study a single-machine scheduling problem where the objective is to minimize the total tardiness of the first agent with the constraint that no tardy job is allowed for the second agent. In this study, we provide a branch-and-bound algorithm and a genetic algorithm for the optimal …

Economic Modeling Of Compressed Air Energy Storage, Yang Gu, James D. Mccalley, Ming Ni, Rui Bo

Electrical and Computer Engineering Faculty Research & Creative Works

Due to the variable nature of wind resources, the increasing penetration level of wind power will have a significant impact on the operation and planning of the electric power system. Energy storage systems are considered an effective way to compensate for the variability of wind generation. This paper presents a detailed production cost simulation model to evaluate the economic value of compressed air energy storage (CAES) in systems with large-scale wind power generation. The co-optimization of energy and ancillary services markets is implemented in order to analyze the impacts of CAES, not only on energy supply, but also on system …

Leakage Temperature Dependency Aware Real-Time Scheduling For Power And Thermal Optimization, Vivek Chaturvedi

FIU Electronic Theses and Dissertations

Catering to society’s demand for high performance computing, billions of transistors are now integrated on IC chips to deliver unprecedented performances. With increasing transistor density, the power consumption/density is growing exponentially. The increasing power consumption directly translates to the high chip temperature, which not only raises the packaging/cooling costs, but also degrades the performance/reliability and life span of the computing systems. Moreover, high chip temperature also greatly increases the leakage power consumption, which is becoming more and more significant with the continuous scaling of the transistor size. As the semiconductor industry continues to evolve, power and thermal challenges have become …

Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp

Theses and Dissertations

The algorithm proposed here is used for heuristic solutions for the Multimodal Multiple Vehicle Routing Problem with Unloading Capacity, Pickup and Dropoff, and Time Windows, solved so as to minimize the number of vehicles used, subject to varying objective function values for each vehicle. The MVRP is simplified and split into a routing problem and a scheduling problem. The routing problem is addressed by Dijkstra's Algorithm. This generates a new network for the second stage of the algorithm. It is assumed that the shortest path is the correct path to use, and shipments each travel unimodally. The scheduling problem is …

Green Scheduling For Radiant Systems In Buildings, Truong X. Nghiem, Madhur Behl, George J. Pappas, Rahul Mangharam

Truong X Nghiem

In this report we look at the problem of peak power reduction for buildings with electric radiant floor heating systems. Uncoordinated operation of a multi-zone radiant floor heating system can result in temporally correlated electricity demand surges or peaks in the building’s electricity consumption. As peak power prices are 200-400 times that of the nominal rate, this uncoordinated activity can result in high electricity costs and expensive system operation. We have previously presented green scheduling as an approach for reducing the aggregate peak power consumption in buildings while ensuring that indoor thermal comfort is always maintained. This report extends the …

A Real-Time Crane Service Scheduling Decision Support System (Css-Dss) For Construction Tower Cranes, Amir Tork

Electronic Theses and Dissertations

The success of construction projects depends on proper use of construction equipment and machinery to a great extent. Thus, appropriate planning and control of the activities that rely on construction equipment could have significant effects on improving the efficiency of project operations. Cranes are the largest and most conspicuous construction equipment, widely used in typical construction sites. They play a major role in relocation of materials in horizontal and vertical directions on construction sites. Given the nature of activities relying on construction cranes in various stages of a project, cranes normally have control over the critical path of the project …

Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani

Faculty of Engineering and Information Sciences - Papers: Part A

An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made …

Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar

Faculty of Engineering and Information Sciences - Papers: Part A

This paper presents the application of a mixedinteger programming (MIP) approach for solving stochastic security-constrained daily hydrothermal generation scheduling (SCDHGS). Power system uncertainties including generating units and branch contingencies and load uncertainty are explicitly considered in the stochastic programming of SCDHGS. The roulette wheel mechanism and lattice Monte Carlo simulation (LMCS) are first employed for random scenario generation wherein the stochastic SCDHGS procedure is converted into its respective deterministic equivalents (scenarios). Then, the generating units are scheduled through MIP over the set of deterministic scenarios for the purpose of minimizing the cost of supplying energy and ancillary services over the …

Minimum Latency Broadcast Algorithms For Wireless Sensor Networks, Dianbo Zhao

University of Wollongong Thesis Collection 1954-2016

Broadcast is a fundamental operation in Wireless Sensor Networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in an interference-free manner whilst incurring minimum latency. This problem, called Minimum Latency Broadcast Scheduling (MLBS), has been studied extensively in wireless ad-hoc networks, whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will …

Cada: Channel And Delay Aware Scheduler For Real-Time Applications In Wimax Networks, Melek Oktay, Haci Ali̇ Mantar

Turkish Journal of Electrical Engineering and Computer Sciences

Scheduling is the core of the worldwide interoperability for microwave access (WiMAX) technology that directly affects the performance of the network. In this study, we focus on scheduling and present a novel algorithm called the channel and delay aware scheduler (CADA) for real-time applications, such as voice over Internet protocol, video-on-demand, and video streaming. CADA has 2 important modules: wireless and network delay monitoring tools. The wireless module, including the compensation and channel state monitoring modules, increases the network throughput and provides fairness among all of the flows in the network. The network delay monitoring tool calculates the estimated network …

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 …

Exploiting Heterogeneity In Chip-Multiprocessor Design, Ying Zhang

LSU Doctoral Dissertations

In the past decade, semiconductor manufacturers are persistent in building faster and smaller transistors in order to boost the processor performance as projected by Moore’s Law. Recently, as we enter the deep submicron regime, continuing the same processor development pace becomes an increasingly difficult issue due to constraints on power, temperature, and the scalability of transistors. To overcome these challenges, researchers propose several innovations at both architecture and device levels that are able to partially solve the problems. These diversities in processor architecture and manufacturing materials provide solutions to continuing Moore’s Law by effectively exploiting the heterogeneity, however, they also …