Digital Commons Network^™

Innovations In The Field Of On-Board Scheduling Technologies, Temenuzhka Avramova, Alessandro Benetton, Christian Cardenio, Riccardo Maderna

Small Satellite Conference

Space missions are characterized by long distances, difficult or unavailable communication and high operating costs. Moreover, complexity has been constantly increasing in recent years. For this reason, improving the autonomy of space operators is an attractive goal to increase the mission reward with lower costs. This paper proposes an onboard scheduler, that integrates inside an onboard software framework for mission autonomy. Given a set of activities, it is responsible for determining the starting time of each activity according to their priority, order constraints, and resource consumption. The presented scheduler is based on linear integer programming and relies on the use …

Recource Limited Testing Center Scheduling For A Web-Based Testing Application, Adam J. Graham

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Testing centers are a useful tool to help instructors deliver computer-based tests, but computers resources are expensive and therefore limited. This paper describes a method by which testing center(s) may use iNetTest, a web-based computer aided testing system, to house and administer exams. The algorithm discussed in this paper makes it possible for instructors to schedule tests for a given time frame while ensuring that enough computer resources will be available to all of the students. The algorithm prevents the testing center from getting overwhelmed with students while attempting to maximize the usage of the valuable computer resources.

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 …

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 …

A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Increased levels of science objectives expected from spacecraft systems necessitate the ability to carry out fast on-board autonomous mission planning and scheduling. Heterogeneous radiation-hardened Field Programmable Gate Arrays (FPGAs) with embedded multiplier and memory modules are well suited to support the acceleration of scheduling algorithms. A methodology to design circuits specifically to accelerate Simulated Annealing Kernels (SAKs) in event scheduling algorithms is shown. The main contribution of this thesis is the low complexity scoring calculation used for the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different …

A Simulation Analysis Of The Impact Of Family Configuration On Virtual Cellular Manufacturing, Vijay R. Kannan

Management Faculty Publications

Past research has shown that it is possible to simultaneously achieve the setup efficiencies of traditional cellular manufacturing systems and the routeing flexibility of a job shop by viewing cells not as permanent, physical structures, but as temporary, 'virtual' entities. This research demonstrates that the advantages of virtual manufacturing cells can be obtained over a range of part family configurations. In particular, virtual cellular manufacturing is robust to changes in the number and size of families being processed. Further, the research shows that the benefits can be obtained under setup conditions impartial to a family-oriented part environment.

Using Dynamic Cellular Manufacturing To Simplify Scheduling In Cell Based Production Systems, Vijay R. Kannan, Soumen Ghosh

Management Faculty Publications

Previous research has shown that the formation of temporary, logical manufacturing cells in a job shop, overcomes problems of high setup frequency typically found in job shops. In addition, this form of cellular configuration is more flexible than tranditional, group technology based cellular configurations. This research demonstrates that an added benefit of a dynamic cellular configuration is that it simplifies production scheduling, eliminating the need for more complex dispatching rules. In particular, it eliminates the need for further setup reduction when scheduling parts from the same family. Improvements in performance when employing setup reduction are shown to occur only when …

Alfalfa Production As Related To Irrigation Scheduling: An Economic Perspective, Craig L. Israelsen

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This study analyzed the economics of irrigation scheduling for alfalfa hay in the Cache Valley, Utah area. Yield, evapotranspiration (ET) and irrigation drainage loss, along with the costs and returns per acre attributable to irrigation scheduling, were simulated through the use of a computerized plant growth model. The model created yearly "irrigation schedules" for alfalfa hay based on actual climatic, soil and plant characteristic data from the Utah State University Greenville Experiment Station. The model calculated the irrigation schedules based on a soil-water balance equation which never allowed the available soil water to go below the crop stress point.

The …

Estimated Potential Water Needs For The Eastern Grand Prairie Region By Irrigation Scheduling, Richard C. Peralta, Paul W. Dutram, Paul Killian

Civil and Environmental Engineering Faculty Publications

Prepare maps showing the annual, monthly and peak weekly volume of irrigation water required in each 3 mile by 3 mile cell of the study area for the selected cropping pattern. Maps are presented for "average" and "dry" climatological conditions.

A Description Of Scheduling Methods And Caseloads In The Utah Public Schools, Jocelyn A. Taylor

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

The purpose of this paper is to investigate the following:

1. What methods of scheduling, namely intermittent or block, are used most by clinicians working in Utah public schools.

2. What is the average size and composition of caseloads of Utah public school clinicians. Conclusions are drawn as to the implications of the data collected and based on these conclusions, recommendations are made.