Digital Commons Network^™

Alternative Scheduling Models And Their Effect On Science Achievement At The High School Level, Jay Roland Dostal

Student Work

This study will evaluate alternative scheduling methods implemented in secondary level schools. Students were selected based on parent selection of programs. Traditional scheduling involves numerous academic subjects with small increments of time in each class and block scheduling focuses on fewer academic subjects and more instructional time. This study will compare office referral numbers, absence frequency, and Essential Learner Outcome (ELO) science strand scores in the 8th-grade (pretest) to the same students office referrals, absence frequency, and ELO science strand scores in the 11th-grade (posttest) between Seven Period Traditional Scheduling (SPTS) and Four Period Block Scheduling (FPBS) in the hopes …

A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso

Computer Science Faculty Publications

This paper proposes a genetic algorithm for multiobjective scheduling optimization based in the object oriented design with constrains on delivery times, process precedence and resource availability. Initially, the programming algorithm (PA) was designed and implemented, taking into account all constraints mentioned. This algorithm’s main objective is, given a sequence of production orders, products and processes, calculate its total programming cost and time.
Once the programming algorithm was defined, the genetic algorithm (GA) was developed for minimizing two objectives: delivery times and total programming cost. The stages defined for this algorithm were: selection, crossover and mutation. During the first stage, the …

A Ptas For The Uncertain Capacity Knapsack Problem, Matthew Dabney

All Theses

The standard NP-hard knapsack problem can be interpreted as a scheduling problem with n jobs with weights w₁ . . .w_n and processing times p₁ . . . p_n, where our goal is to order the jobs on a single machine so as to maximize the weight of all jobs completing prior to a known common deadline d. In this paper, we study the uncertain capacity knapsack problem (UCKP), a generalization of this problem in which the deadline d is not known with certainty, but rather is provided as a probability distribution, and our goal …

Civil Practice And Procedure, John R. Walk, Andrew P. Sherrod

University of Richmond Law Review

This article surveys recent significant developments in Virginia civil practice and procedure. Specifically, the article discusses opinions of the Supreme Court of Virginia from June 2009 through April 2010 addressing civil procedure; significant amendments to the Rules of the Supreme Court of Virginia made during the same period; and legislation enacted by the Virginia GeneralAssembly during its 2010 session relating to civil practice.

Minimizing Makespan For Hybrid Flowshops With Batch, Discrete Processing Machines And Arbitrary Job Sizes, Yanming Zheng

FIU Electronic Theses and Dissertations

This research aims at a study of the hybrid flow shop problem which has parallel batch-processing machines in one stage and discrete-processing machines in other stages to process jobs of arbitrary sizes. The objective is to minimize the makespan for a set of jobs. The problem is denoted as: FF|batch₁, s_j|Cmax.

The problem is formulated as a mixed-integer linear program. The commercial solver, AMPL/CPLEX, is used to solve problem instances to their optimality. Experimental results show that AMPL/CPLEX requires considerable time to find the optimal solution for even a small size problem, i.e., a 6-job instance …

Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.

A Dynamic Energy-Aware Model For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

High Performance Computing (HPC) resources are housed in large datacenters, which consume huge amounts of energy and are quickly demanding attention from businesses as they result in high operating costs. On the other hand HPC environments have been very useful to researchers in many emerging areas in life sciences such as Bioinformatics and Medical Informatics. In this paper, we provide a dynamic model for energy aware scheduling (EAS) in a HPC environment; we use a widely used bioinformatics tool named BLAT (BLAST-like alignment tool) running in a HPC environment as our case study. Our proposed EAS model incorporates 2-Phases: an …

Case Study Of Finite Resource Optimization In Fpga Using Genetic Algorithm, Jingxia Wang, Sin Ming Loo

Electrical and Computer Engineering Faculty Publications and Presentations

Modem Field-Programmable Gate Arrays (FPGAs) are becoming very popular in embedded systems and high performance applications. FPGA has benefited from the shrinking of transistor feature size, which allows more on-chip reconfigurable (e.g., memories and look-up tables) and routing resources available. Unfortunately, the amount of reconfigurable resources in a FPGA is fixed and limited. This paper investigates the mapping scheme of the applications in a FPGA by utilizing sequential processing (e.g., Altera Nios II or Xilinx Microblaze, using C programming language) and task specific hardware (using hardware description language). Genetic Algorithm is used in this study. We found that placing sequential …

Optimizing Reconfigurable Hardware Resource Usage In System-On-A-Programmable-Chip With Location-Aware Genetic Algorithm, Sin Ming Loo, Jingxia Wang

Electrical and Computer Engineering Faculty Publications and Presentations

This paper presents static task scheduling using location-aware genetic algorithm techniques to schedule task systems to finite amounts of reconfigurable hardware. This research optimizes the use of limited reconfigurable resources. This scheduling algorithm is built upon our previous work [12- 14]. In this paper, the genetic algorithm has been expanded to include a feature to assign selected tasks to specific functional units. In this reconfigurable hardware environment, multiple sequential processing elements (soft core processors such as Xilinx MicroBlaze [22] or Altera Nios-II [1]), task-specific core (application specific hardware), and communication network within the reconfigurable hardware can be used (such a …

Mechanisms For Quality-Of-Service Provisioning In Networks With Extended Services, Zhen Qin

Dissertations

The emerging network traffic with various Quality-of-Service (QoS) requirements creates a demand for QoS service provisioning beyond the best effort service that Internet currently provides. QoS provisioning requires a framework that satisfies users' QoS and cost demand while maximizes benefits for network service providers. It is considered that QoS provisioning involves three issues: a) estimations of the network QoS performance, which can be achieved by performing network measurement; b) dissemination of the measured QoS states throughout the network with states exchanged among different network routers; and c) QoS routing. In this dissertation, these three issues are addressed.

In QoS networks, …

Optimizing Restaurant Reservation Scheduling, Jacob Feldman

HMC Senior Theses

We consider a yield-management approach to determine whether a restaurant should accept or reject a pending reservation request. This approach was examined by Bossert (2009), where the decision for each request is evaluated by an approximate dynamic program (ADP) that bases its decision on a realization of future demand. This model only considers assigning requests to their desired time slot. We expand Bossert's ADP model to incorporate an element of flexibility that allows requests to be assigned to a time slot that differs from the customer's initially requested time. To estimate the future seat utilization given a particular decision, a …

A New Paradigm To Reduce Nursing Rate Impact On Healthservice Organizations (Hsos) Through Hedging, Deisell Martinez

Open Access Dissertations

Nursing costs account for over 50% of Health Service Organizations budgetary expenses. In a financially contracting Healthcare market that is amidst the focus of current National and International economic concerns and political agenda, here a counter-intuitive method to minimize exposure to rising nursing costs. Healthcare’s conundrum is marked by rising nursing costs, growing patient population, rising uninsured rates and decreasing insurance reimbursements. Participants traditionally focus on nurse staffing to minimize costs, but in its inextricable link to scheduling, budgets are often inaccurately projected as compared to actual staffing quantities and costs; this is largely due to front-line staffing policies and …

Creating A Schedule That Increases Instructional Time, Heather Macey

All Graduate Projects

This project was designed to help elementary schools create a master schedule that increases direct instructional time by forming large blocks of uninterrupted time for all classroom teachers. Many teachers struggle with how to structure their daily schedule. Often times there are things other than good quality instruction driving the decision of the structure of school schedules that create very choppy and ineffective schedules that do not support the best learning environment for the children. This project will combine several different approaches in scheduling taken by others that were researched and found to be effective in increasing instructional time and …

Preventive Maintenance And Replacement Scheduling : Models And Algorithms., Kamran S. Moghaddam

Electronic Theses and Dissertations

Preventive maintenance is a broad term that encompasses a set of activities aimed at improving the overall reliability and availability of a system. Preventive maintenance involves a basic trade-off between the costs of conducting maintenance/replacement activities and the cost savings achieved by reducing the overall rate of occurrence of system failures. Designers of preventive maintenance schedules must weigh these individual costs in an attempt to minimize the overall cost of system operation. They may also be interested in maximizing the system reliability, subject to some sort of budget constraint. In this dissertation, we present a complete discussion about the problem …

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 …

The Steiner Linear Ordering Problem: Application To Resource-Constrained Scheduling Problems, Mariah Magagnotti

All Theses

When examined through polyhedral study, the resource-constrained scheduling problems have always dealt with processes which have the same priority. With the Steiner Linear Ordering problem, we can address systems where the elements involved have different levels of priority, either high or low. This allows us greater flexibility in modeling different resource-constrained scheduling problems. In this paper, we address both the linear ordering problem and its application to scheduling problems, and provide a polyhedral study of the associated polytopes.

A Hybrid Genetic Algorithm For The Student-Aware University Course Timetabling Problem, Ernesto Ferrer Queiros Nunez

Mathematics, Statistics, and Computer Science Honors Projects

Traditionally, academic institutions schedule courses using constraints that ensure that instructors and courses do not overlap in available rooms and time periods; students' planning needs are rarely taken into account. This problem becomes particularly acute for students in liberal arts institutions, because they have multiple graduation requirements in addition to their chosen academic program. My research builds on the University Course Timetabling Problem (UCTP) to include students' scheduling needs. This approach to the UCTP problem uses a combination of a genetic algorithm and case-based reasoning.

To improve the performance of the genetic algorithm, I use a group-based genetic algorithm to …

A Study Of Doubling Class Time For Low Achieving High School English And Math Students And The Impact On State Tests Required Under Nclb, Richard J. Ney

Doctoral Dissertations and Projects

The re-authorization of the Elementary and Secondary Education Act in 2002, commonly known as the No Child Left Behind Act (NCLB), increased the accountability of public schools throughout the United States, holding them individually responsible for the education levels attained by their students as measured by high stakes tests developed and administered at the state level. Administrators responded by developing programs targeted at increasing students' test scores. One program considered by administrators is the doubling of class time in math and English for students that are at risk of not succeeding. This study analyzes the viability of such a program …

Occupation And Industry Sex Segregation, Gender, And Workplace Support: The Use Of Flexible Scheduling Policies, K. L. Minnotte, Alison Cook, M. Minnotte

Alison Cook

This study examines how industry and occupation sex segregation are related to the utilization of flexible scheduling policies and perceptions of the career repercussions of using such policies. The analysis is performed on data from the 2002 National Study of the Changing Workforce (N = 2810). Findings suggest that the percentage of women per industry and occupation increase the likelihood of using flexible scheduling, however, the effect is not cumulative. The results show that organization family support interacts with gender and the sex composition of the industry in predicting use of flexible scheduling. Further, the findings indicate that the relationship …

Support-Based Distributed Optimisation: An Approach To Radiotherapy Patient Scheduling, Graham Billiau, Chee-Fon Chang, Andrew Alexis Miller, Aditya K. Ghose

Faculty of Informatics - Papers (Archive)

In the health system inefficiency leads to poor use of scarce expensive resources. Lengthy patient treatment waiting time can result from inefficiency in scheduling. The use of state-of-the art multi-agent and distributed computing technologies can provide a solution to address this problem. However, distributed optimisation in such a multi-agent setting poses an important challenge that requires protocols to enable agents to optimise shared objectives without necessarily revealing all of their private constraints. In this study we show that if the problem is expressed as a Dynamic Distributed Constraint Optimisation Problem a powerful algorithm such as SBDO can be deployed to …

Human Influence On The Adoption Of Lean Strategy In The Process Industries: A Case Study Of An Australian Steel-Manufacturer, I. Alony

University of Wollongong Thesis Collection 1954-2016

Lean strategy has become widely recognised since it was first popularised by the Japanese automobile manufacturer Toyota. However, despite its promised benefits and widespread proliferation, Lean strategy has not been extensively adopted in process industries (e.g., steel-making). This study examines an unsuccessful attempt to implement Lean strategy in a large Australian steel-manufacturing organisation, and pays particular attention to factors influencing scheduling decisions. This attention to scheduling decisions is both unique to the literature and crucial to a deeper understanding of Lean strategy enactment.

Multiple facets are involved in the complex implementation of Lean strategy, and thus this study draws on …

Timing Is Affected By Demands In Memory Search But Not By Task Switching., Claudette Fortin, Richard Schweickert, Remi Gaudreault, Charles Viau-Quesnel

Department of Psychological Sciences Faculty Publications

Recent studies suggest that timing and tasks involving executive control processes might require the same attentional resources. This should lead to interference when timing and executive tasks are executed concurrently. This study examines the interference between timing and task switching, an executive function. In four experiments, memory search and digit classification were performed successively in four conditions: search-search (search followed by search), search-digit, digit-search and digit-digit. In a control reaction-time condition, participants provided RT responses in each of the two tasks. In a time-production condition, an RT response was provided to the first stimulus, but the response to the second …

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 …

Behaviors Of Real-Time Schedulers Under Resource Modification And A Steady Scheme With Bounded Utilization, Refi̇k Samet, Orhan Fi̇kret Duman

Turkish Journal of Electrical Engineering and Computer Sciences

In this article we present an analysis for task models having random resource needs and different arrival patterns. In hard real-time environments like avionic systems or nuclear reactors, the inputs to the system are obtained from real world by using sensors. And it is highly possible for a task to have different resource needs for each period according to these changing conditions of real world. We made an analysis of schedulers for task models having random resources in each period. Since feasibility tests for usual task models are just limited to some specific schedulers and arrival patterns, we made our …

Modeling Aerial Refueling Operations, Allen Mccoy

All Theses and Dissertations (ETDs)

Aerial Refueling: AR) is the act of offloading fuel from one aircraft: the tanker) to another aircraft: the receiver) in mid flight. Meetings between tanker and receiver aircraft are referred to as AR events and are scheduled to: escort one or more receivers across a large body of water; refuel one or more receivers; or train receiver pilots, tanker pilots, and boom operators. In order to efficiently execute the Aerial Refueling Mission, the Air Mobility Command: AMC) of the United States Air Force: USAF) depends on computer models to help it make tanker basing decisions, plan tanker sorties, schedule aircraft, …