Algorithms for routing vehicles and their application to the paratransit vehicle scheduling problem.

DOT National Transportation Integrated Search

2012-03-01

As the demand for paratransit services increases, there is a constant pressure to maintain the quality of : service provided to the customers while minimizing the cost of operation; this is especially important as : the availability of public funding...

Scheduling Software for Complex Scenarios

NASA Technical Reports Server (NTRS)

2006-01-01

Preparing a vehicle and its payload for a single launch is a complex process that involves thousands of operations. Because the equipment and facilities required to carry out these operations are extremely expensive and limited in number, optimal assignment and efficient use are critically important. Overlapping missions that compete for the same resources, ground rules, safety requirements, and the unique needs of processing vehicles and payloads destined for space impose numerous constraints that, when combined, require advanced scheduling. Traditional scheduling systems use simple algorithms and criteria when selecting activities and assigning resources and times to each activity. Schedules generated by these simple decision rules are, however, frequently far from optimal. To resolve mission-critical scheduling issues and predict possible problem areas, NASA historically relied upon expert human schedulers who used their judgment and experience to determine where things should happen, whether they will happen on time, and whether the requested resources are truly necessary.

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

NASA Astrophysics Data System (ADS)

Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

2018-03-01

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

PubMed Central

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds.

PubMed

Zhang, Dezhi; Wang, Xin; Li, Shuangyan; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.

Vehicle coordinated transportation dispatching model base on multiple crisis locations

NASA Astrophysics Data System (ADS)

Tian, Ran; Li, Shanwei; Yang, Guoying

2018-05-01

Many disastrous events are often caused after unconventional emergencies occur, and the requirements of disasters are often different. It is difficult for a single emergency resource center to satisfy such requirements at the same time. Therefore, how to coordinate the emergency resources stored by multiple emergency resource centers to various disaster sites requires the coordinated transportation of emergency vehicles. In this paper, according to the problem of emergency logistics coordination scheduling, based on the related constraints of emergency logistics transportation, an emergency resource scheduling model based on multiple disasters is established.

Optimal Decentralized Protocol for Electric Vehicle Charging

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gan, LW; Topcu, U; Low, SH

We propose a decentralized algorithm to optimally schedule electric vehicle (EV) charging. The algorithm exploits the elasticity of electric vehicle loads to fill the valleys in electric load profiles. We first formulate the EV charging scheduling problem as an optimal control problem, whose objective is to impose a generalized notion of valley-filling, and study properties of optimal charging profiles. We then give a decentralized algorithm to iteratively solve the optimal control problem. In each iteration, EVs update their charging profiles according to the control signal broadcast by the utility company, and the utility company alters the control signal to guidemore » their updates. The algorithm converges to optimal charging profiles (that are as "flat" as they can possibly be) irrespective of the specifications (e.g., maximum charging rate and deadline) of EVs, even if EVs do not necessarily update their charging profiles in every iteration, and use potentially outdated control signal when they update. Moreover, the algorithm only requires each EV solving its local problem, hence its implementation requires low computation capability. We also extend the algorithm to track a given load profile and to real-time implementation.« less

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

DTIC Science & Technology

2015-09-03

Traveling Salesman Problem (TSP) and Graph Coloring are elementary. Problems such as MAX-kSAT are a superposition of k elementary landscapes. This...search space. Problems such as the Traveling Salesman Problem (TSP), Graph Coloring, the Frequency Assignment Problem , as well as Min-Cut and Max-Cut...echoing our earlier esults on the Traveling Salesman Problem . Using two locally optimal solutions as “parent” solutions, we have developed a

Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint

PubMed Central

Gong, Hua; Chen, Daheng; Xu, Ke

2014-01-01

This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facility must be processed in the limited waiting time. The orders are processed in batches on a parallel-batch machine, where a batch contains several orders and the processing time of the batch is the largest processing time of the orders in it. The goal is to find a schedule to minimize the sum of the total flow time and the production cost. We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. Furthermore, a dynamic programming algorithm in pseudopolynomial time is provided to prove its ordinarily NP-hardness. An optimal algorithm in polynomial time is presented to solve a special case with equal processing times and equal transportation times for each order. PMID:24883385

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

PubMed

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Cooperative Surveillance and Pursuit Using Unmanned Aerial Vehicles and Unattended Ground Sensors

PubMed Central

Las Fargeas, Jonathan; Kabamba, Pierre; Girard, Anouck

2015-01-01

This paper considers the problem of path planning for a team of unmanned aerial vehicles performing surveillance near a friendly base. The unmanned aerial vehicles do not possess sensors with automated target recognition capability and, thus, rely on communicating with unattended ground sensors placed on roads to detect and image potential intruders. The problem is motivated by persistent intelligence, surveillance, reconnaissance and base defense missions. The problem is formulated and shown to be intractable. A heuristic algorithm to coordinate the unmanned aerial vehicles during surveillance and pursuit is presented. Revisit deadlines are used to schedule the vehicles' paths nominally. The algorithm uses detections from the sensors to predict intruders' locations and selects the vehicles' paths by minimizing a linear combination of missed deadlines and the probability of not intercepting intruders. An analysis of the algorithm's completeness and complexity is then provided. The effectiveness of the heuristic is illustrated through simulations in a variety of scenarios. PMID:25591168

Power-based Shift Schedule for Pure Electric Vehicle with a Two-speed Automatic Transmission

NASA Astrophysics Data System (ADS)

Wang, Jiaqi; Liu, Yanfang; Liu, Qiang; Xu, Xiangyang

2016-11-01

This paper introduces a comprehensive shift schedule for a two-speed automatic transmission of pure electric vehicle. Considering about driving ability and efficiency performance of electric vehicles, the power-based shift schedule is proposed with three principles. This comprehensive shift schedule regards the vehicle current speed and motor load power as input parameters to satisfy the vehicle driving power demand with lowest energy consumption. A simulation model has been established to verify the dynamic and economic performance of comprehensive shift schedule. Compared with traditional dynamic and economic shift schedules, simulation results indicate that the power-based shift schedule is superior to traditional shift schedules.

An ant colony optimization heuristic for an integrated production and distribution scheduling problem

NASA Astrophysics Data System (ADS)

Chang, Yung-Chia; Li, Vincent C.; Chiang, Chia-Ju

2014-04-01

Make-to-order or direct-order business models that require close interaction between production and distribution activities have been adopted by many enterprises in order to be competitive in demanding markets. This article considers an integrated production and distribution scheduling problem in which jobs are first processed by one of the unrelated parallel machines and then distributed to corresponding customers by capacitated vehicles without intermediate inventory. The objective is to find a joint production and distribution schedule so that the weighted sum of total weighted job delivery time and the total distribution cost is minimized. This article presents a mathematical model for describing the problem and designs an algorithm using ant colony optimization. Computational experiments illustrate that the algorithm developed is capable of generating near-optimal solutions. The computational results also demonstrate the value of integrating production and distribution in the model for the studied problem.

Assignment Scheduling Capability for Unmanned Aerial Vehicles - A Discrete Event Simulation with Optimization in the Loop Approach to Solving a Scheduling Problem

DTIC Science & Technology

2006-12-01

APPROACH As mentioned previously, ASCU does not use simulation in the traditional manner. Instead, it uses simulation to transition and capture the state...0 otherwise (by a heuristic discussed below). • Let cja = The reward for a UAV with sensor pack- age j being assigned to mission area a from the

Task and Participant Scheduling of Trading Platforms in Vehicular Participatory Sensing Networks

PubMed Central

Shi, Heyuan; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang

2016-01-01

The vehicular participatory sensing network (VPSN) is now becoming more and more prevalent, and additionally has shown its great potential in various applications. A general VPSN consists of many tasks from task, publishers, trading platforms and a crowd of participants. Some literature treats publishers and the trading platform as a whole, which is impractical since they are two independent economic entities with respective purposes. For a trading platform in markets, its purpose is to maximize the profit by selecting tasks and recruiting participants who satisfy the requirements of accepted tasks, rather than to improve the quality of each task. This scheduling problem for a trading platform consists of two parts: which tasks should be selected and which participants to be recruited? In this paper, we investigate the scheduling problem in vehicular participatory sensing with the predictable mobility of each vehicle. A genetic-based trading scheduling algorithm (GTSA) is proposed to solve the scheduling problem. Experiments with a realistic dataset of taxi trajectories demonstrate that GTSA algorithm is efficient for trading platforms to gain considerable profit in VPSN. PMID:27916807

Task and Participant Scheduling of Trading Platforms in Vehicular Participatory Sensing Networks.

PubMed

Shi, Heyuan; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang

2016-11-28

The vehicular participatory sensing network (VPSN) is now becoming more and more prevalent, and additionally has shown its great potential in various applications. A general VPSN consists of many tasks from task, publishers, trading platforms and a crowd of participants. Some literature treats publishers and the trading platform as a whole, which is impractical since they are two independent economic entities with respective purposes. For a trading platform in markets, its purpose is to maximize the profit by selecting tasks and recruiting participants who satisfy the requirements of accepted tasks, rather than to improve the quality of each task. This scheduling problem for a trading platform consists of two parts: which tasks should be selected and which participants to be recruited? In this paper, we investigate the scheduling problem in vehicular participatory sensing with the predictable mobility of each vehicle. A genetic-based trading scheduling algorithm (GTSA) is proposed to solve the scheduling problem. Experiments with a realistic dataset of taxi trajectories demonstrate that GTSA algorithm is efficient for trading platforms to gain considerable profit in VPSN.

Integrated Thermal Response Modeling System For Hypersonic Entry Vehicles

NASA Technical Reports Server (NTRS)

Chen, Y.-K.; Milos, F. S.; Partridge, Harry (Technical Monitor)

2000-01-01

We describe all extension of the Markov decision process model in which a continuous time dimension is included ill the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.

Efficiencies in freight & passenger routing & scheduling.

DOT National Transportation Integrated Search

2015-08-01

The problem we study concerns routing a fleet of capacitated vehicles in real time to collect : shipment orders placed by a known set of customers. On each day of operation, only a subset of : all customers request service. Some of these requests are...

10 CFR 490.302 - Vehicle acquisition mandate schedule.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 10 Energy 3 2012-01-01 2012-01-01 false Vehicle acquisition mandate schedule. 490.302 Section 490.302 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fuel Provider Vehicle Acquisition Mandate § 490.302 Vehicle acquisition mandate schedule. (a...

10 CFR 490.302 - Vehicle acquisition mandate schedule.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 10 Energy 3 2010-01-01 2010-01-01 false Vehicle acquisition mandate schedule. 490.302 Section 490.302 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fuel Provider Vehicle Acquisition Mandate § 490.302 Vehicle acquisition mandate schedule. (a...

10 CFR 490.302 - Vehicle acquisition mandate schedule.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 10 Energy 3 2011-01-01 2011-01-01 false Vehicle acquisition mandate schedule. 490.302 Section 490.302 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fuel Provider Vehicle Acquisition Mandate § 490.302 Vehicle acquisition mandate schedule. (a...

10 CFR 490.302 - Vehicle acquisition mandate schedule.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 10 Energy 3 2013-01-01 2013-01-01 false Vehicle acquisition mandate schedule. 490.302 Section 490.302 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fuel Provider Vehicle Acquisition Mandate § 490.302 Vehicle acquisition mandate schedule. (a...

10 CFR 490.302 - Vehicle acquisition mandate schedule.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 10 Energy 3 2014-01-01 2014-01-01 false Vehicle acquisition mandate schedule. 490.302 Section 490.302 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fuel Provider Vehicle Acquisition Mandate § 490.302 Vehicle acquisition mandate schedule. (a...

X-38 TPS Seal Status

NASA Technical Reports Server (NTRS)

Curry, Donald M.

2000-01-01

This presentation discuss the x-38 crew return vehicle. As an element of the International Space Station (ISS), there are potential problems that are discussed. These include ISS catastrophe, emergency medical evacuation, and period of Space Shuttle unavailability. The x-38 program purpose was also discussed. The Reduction of the costs and schedule for the development of Crew Return Vehicles (CRV's) and Crew Transfer Vehicles (CTV's) through the use of the rapid development methodology associated with an X-project were also presented. With specific attention to ground testing, atmospheric testing, and space flight testing.

10 CFR Appendix D to Part 73 - Physical Protection of Irradiated Reactor Fuel in Transit, Training Program Subject Schedule

Code of Federal Regulations, 2013 CFR

2013-01-01

... radioactive cargo —Function and characteristics of the shipping casks —Radiation hazards —Federal, State and... Contingencies —Accidents —Severe weather conditions —Vehicle breakdown —Communications problems —Radioactive...

10 CFR Appendix D to Part 73 - Physical Protection of Irradiated Reactor Fuel in Transit, Training Program Subject Schedule

Code of Federal Regulations, 2014 CFR

2014-01-01

... radioactive cargo —Function and characteristics of the shipping casks —Radiation hazards —Federal, State and... Contingencies —Accidents —Severe weather conditions —Vehicle breakdown —Communications problems —Radioactive...

10 CFR Appendix D to Part 73 - Physical Protection of Irradiated Reactor Fuel in Transit, Training Program Subject Schedule

Code of Federal Regulations, 2012 CFR

2012-01-01

... radioactive cargo —Function and characteristics of the shipping casks —Radiation hazards —Federal, State and... Contingencies —Accidents —Severe weather conditions —Vehicle breakdown —Communications problems —Radioactive...

Research on logistics scheduling based on PSO

NASA Astrophysics Data System (ADS)

Bao, Huifang; Zhou, Linli; Liu, Lei

2017-08-01

With the rapid development of e-commerce based on the network, the logistics distribution support of e-commerce is becoming more and more obvious. The optimization of vehicle distribution routing can improve the economic benefit and realize the scientific of logistics [1]. Therefore, the study of logistics distribution vehicle routing optimization problem is not only of great theoretical significance, but also of considerable value of value. Particle swarm optimization algorithm is a kind of evolutionary algorithm, which is based on the random solution and the optimal solution by iteration, and the quality of the solution is evaluated through fitness. In order to obtain a more ideal logistics scheduling scheme, this paper proposes a logistics model based on particle swarm optimization algorithm.

Predictive Scheduling for Electric Vehicles Considering Uncertainty of Load and User Behaviors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Bin; Huang, Rui; Wang, Yubo

2016-05-02

Un-coordinated Electric Vehicle (EV) charging can create unexpected load in local distribution grid, which may degrade the power quality and system reliability. The uncertainty of EV load, user behaviors and other baseload in distribution grid, is one of challenges that impedes optimal control for EV charging problem. Previous researches did not fully solve this problem due to lack of real-world EV charging data and proper stochastic model to describe these behaviors. In this paper, we propose a new predictive EV scheduling algorithm (PESA) inspired by Model Predictive Control (MPC), which includes a dynamic load estimation module and a predictive optimizationmore » module. The user-related EV load and base load are dynamically estimated based on the historical data. At each time interval, the predictive optimization program will be computed for optimal schedules given the estimated parameters. Only the first element from the algorithm outputs will be implemented according to MPC paradigm. Current-multiplexing function in each Electric Vehicle Supply Equipment (EVSE) is considered and accordingly a virtual load is modeled to handle the uncertainties of future EV energy demands. This system is validated by the real-world EV charging data collected on UCLA campus and the experimental results indicate that our proposed model not only reduces load variation up to 40% but also maintains a high level of robustness. Finally, IEC 61850 standard is utilized to standardize the data models involved, which brings significance to more reliable and large-scale implementation.« less

The Heavy Vehicle Study: a case-control study investigating risk factors for crash in long distance heavy vehicle drivers in Australia

PubMed Central

2010-01-01

Background Heavy vehicle transportation continues to grow internationally; yet crash rates are high, and the risk of injury and death extends to all road users. The work environment for the heavy vehicle driver poses many challenges; conditions such as scheduling and payment are proposed risk factors for crash, yet the precise measure of these needs quantifying. Other risk factors such as sleep disorders including obstructive sleep apnoea have been shown to increase crash risk in motor vehicle drivers however the risk of heavy vehicle crash from this and related health conditions needs detailed investigation. Methods and Design The proposed case control study will recruit 1034 long distance heavy vehicle drivers: 517 who have crashed and 517 who have not. All participants will be interviewed at length, regarding their driving and crash history, typical workloads, scheduling and payment, trip history over several days, sleep patterns, health, and substance use. All participants will have administered a nasal flow monitor for the detection of obstructive sleep apnoea. Discussion Significant attention has been paid to the enforcement of legislation aiming to deter problems such as excess loading, speeding and substance use; however, there is inconclusive evidence as to the direction and strength of associations of many other postulated risk factors for heavy vehicle crashes. The influence of factors such as remuneration and scheduling on crash risk is unclear; so too the association between sleep apnoea and the risk of heavy vehicle driver crash. Contributory factors such as sleep quality and quantity, body mass and health status will be investigated. Quantifying the measure of effect of these factors on the heavy vehicle driver will inform policy development that aims toward safer driving practices and reduction in heavy vehicle crash; protecting the lives of many on the road network. PMID:20338064

Fair Energy Scheduling for Vehicle-to-Grid Networks Using Adaptive Dynamic Programming.

PubMed

Xie, Shengli; Zhong, Weifeng; Xie, Kan; Yu, Rong; Zhang, Yan

2016-08-01

Research on the smart grid is being given enormous supports worldwide due to its great significance in solving environmental and energy crises. Electric vehicles (EVs), which are powered by clean energy, are adopted increasingly year by year. It is predictable that the huge charge load caused by high EV penetration will have a considerable impact on the reliability of the smart grid. Therefore, fair energy scheduling for EV charge and discharge is proposed in this paper. By using the vehicle-to-grid technology, the scheduler controls the electricity loads of EVs considering fairness in the residential distribution network. We propose contribution-based fairness, in which EVs with high contributions have high priorities to obtain charge energy. The contribution value is defined by both the charge/discharge energy and the timing of the action. EVs can achieve higher contribution values when discharging during the load peak hours. However, charging during this time will decrease the contribution values seriously. We formulate the fair energy scheduling problem as an infinite-horizon Markov decision process. The methodology of adaptive dynamic programming is employed to maximize the long-term fairness by processing online network training. The numerical results illustrate that the proposed EV energy scheduling is able to mitigate and flatten the peak load in the distribution network. Furthermore, contribution-based fairness achieves a fast recovery of EV batteries that have deeply discharged and guarantee fairness in the full charge time of all EVs.

Path planning and energy management of solar-powered unmanned ground vehicles

NASA Astrophysics Data System (ADS)

Kaplan, Adam

Many of the applications pertinent to unmanned vehicles, such as environmental research and analysis, communications, and information-surveillance and reconnaissance, benefit from prolonged vehicle operation time. Conventional efforts to increase the operational time of electric-powered unmanned vehicles have traditionally focused on the design of energy-efficient components and the identification of energy efficient search patterns, while little attention has been paid to the vehicle's mission-level path plan and power management. This thesis explores the formulation and generation of integrated motion-plans and power-schedules for solar-panel equipped mobile robots operating under strict energy constraints, which cannot be effectively addressed through conventional motion planning algorithms. Transit problems are considered to design time-optimal paths using both Balkcom-Mason and Pseudo-Dubins curves. Additionally, a more complicated problem to generate mission plans for vehicles which must persistently travel between certain locations, similar to the traveling salesperson problem (TSP), is presented. A comparison between one of the common motion-planning algorithms and experimental results of the prescribed algorithms, made possible by use of a test environment and mobile robot designed and developed specifically for this research, are presented and discussed.

40 CFR 86.1215-85 - EPA heavy-duty vehicle (HDV) urban dynamometer driving schedule.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 19 2010-07-01 2010-07-01 false EPA heavy-duty vehicle (HDV) urban..., Liquefied Petroleum Gas-Fueled and Methanol-Fueled Heavy-Duty Vehicles § 86.1215-85 EPA heavy-duty vehicle (HDV) urban dynamometer driving schedule. (a)(1) The EPA dynamometer driving schedule for heavy-duty...

Cash transportation vehicle routing and scheduling under stochastic travel times

NASA Astrophysics Data System (ADS)

Yan, Shangyao; Wang, Sin-Siang; Chang, Yu-Hsuan

2014-03-01

Stochastic disturbances occurring in real-world operations could have a significant influence on the planned routing and scheduling results of cash transportation vehicles. In this study, a time-space network flow technique is utilized to construct a cash transportation vehicle routing and scheduling model incorporating stochastic travel times. In addition, to help security carriers to formulate more flexible routes and schedules, a concept of the similarity of time and space for vehicle routing and scheduling is incorporated into the model. The test results show that the model could be useful for security carriers in actual practice.

Building a model-based decision support system for solving vehicle routing and driver scheduling problems under hours of service regulations.

DOT National Transportation Integrated Search

2011-08-27

"In principle, hours-of-service (HOS) regulations are intended to help truck drivers ensure get adequate rest and perform safe operations. The new HOS regulations, however, may lead to substantial cost increases for regional common carriers which hav...

Solving the AI Planning Plus Scheduling Problem Using Model Checking via Automatic Translation from the Abstract Plan Preparation Language (APPL) to the Symbolic Analysis Laboratory (SAL)

NASA Technical Reports Server (NTRS)

Butler, Ricky W.; Munoz, Cesar A.; Siminiceanu, Radu I.

2007-01-01

This paper describes a translator from a new planning language named the Abstract Plan Preparation Language (APPL) to the Symbolic Analysis Laboratory (SAL) model checker. This translator has been developed in support of the Spacecraft Autonomy for Vehicles and Habitats (SAVH) project sponsored by the Exploration Technology Development Program, which is seeking to mature autonomy technology for the vehicles and operations centers of Project Constellation.

Optimal Electric Vehicle Scheduling: A Co-Optimized System and Customer Perspective

NASA Astrophysics Data System (ADS)

Maigha

Electric vehicles provide a two pronged solution to the problems faced by the electricity and transportation sectors. They provide a green, highly efficient alternative to the internal combustion engine vehicles, thus reducing our dependence on fossil fuels. Secondly, they bear the potential of supporting the grid as energy storage devices while incentivising the customers through their participation in energy markets. Despite these advantages, widespread adoption of electric vehicles faces socio-technical and economic bottleneck. This dissertation seeks to provide solutions that balance system and customer objectives under present technological capabilities. The research uses electric vehicles as controllable loads and resources. The idea is to provide the customers with required tools to make an informed decision while considering the system conditions. First, a genetic algorithm based optimal charging strategy to reduce the impact of aggregated electric vehicle load has been presented. A Monte Carlo based solution strategy studies change in the solution under different objective functions. This day-ahead scheduling is then extended to real-time coordination using a moving-horizon approach. Further, battery degradation costs have been explored with vehicle-to-grid implementations, thus accounting for customer net-revenue and vehicle utility for grid support. A Pareto front, thus obtained, provides the nexus between customer and system desired operating points. Finally, we propose a transactive business model for a smart airport parking facility. This model identifies various revenue streams and satisfaction indices that benefit the parking lot owner and the customer, thus adding value to the electric vehicle.

Electric/Hybrid Vehicle Simulation

NASA Technical Reports Server (NTRS)

Slusser, R. A.; Chapman, C. P.; Brennand, J. P.

1985-01-01

ELVEC computer program provides vehicle designer with simulation tool for detailed studies of electric and hybrid vehicle performance and cost. ELVEC simulates performance of user-specified electric or hybrid vehicle under user specified driving schedule profile or operating schedule. ELVEC performs vehicle design and life cycle cost analysis.

A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

NASA Astrophysics Data System (ADS)

Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

Vehicle yaw stability control via H∞ gain scheduling

NASA Astrophysics Data System (ADS)

Zhang, Jinhua; Sun, Weichao; Feng, Zhiguang

2018-06-01

Yaw stability control (YSC) is rather significant in a vehicle lateral motion, since it can considerably reduce casualties caused by vehicle instability. Nevertheless with the vehicle running, the parameters, such as vehicle mass and moment of inertial, can be perturbed because of variation of capacity, loadage and consumption of fuel, hence some of nominal controllers cannot always work satisfactorily. To overcome the aforementioned deficiency, a gain scheduled H∞ YSC controller is developed in this paper, taking the vehicle mass and moment of inertial as the scheduled variables, now that the gain scheduled H∞ controller can guarantee both the robustness against parameter perturbation and the adjustability of tracking accuracy. Then the constructed controller is verified via numerical simulation and MATLAB-CarSim coalition simulation. The simulation results indicate that the designed controller can indeed improve the vehicle handing performance under circumstance of lateral stability.

Cascaded Optimization for a Persistent Data Ferrying Unmanned Aircraft

NASA Astrophysics Data System (ADS)

Carfang, Anthony

This dissertation develops and assesses a cascaded method for designing optimal periodic trajectories and link schedules for an unmanned aircraft to ferry data between stationary ground nodes. This results in a fast solution method without the need to artificially constrain system dynamics. Focusing on a fundamental ferrying problem that involves one source and one destination, but includes complex vehicle and Radio-Frequency (RF) dynamics, a cascaded structure to the system dynamics is uncovered. This structure is exploited by reformulating the nonlinear optimization problem into one that reduces the independent control to the vehicle's motion, while the link scheduling control is folded into the objective function and implemented as an optimal policy that depends on candidate motion control. This formulation is proven to maintain optimality while reducing computation time in comparison to traditional ferry optimization methods. The discrete link scheduling problem takes the form of a combinatorial optimization problem that is known to be NP-Hard. A derived necessary condition for optimality guides the development of several heuristic algorithms, specifically the Most-Data-First Algorithm and the Knapsack Adaptation. These heuristics are extended to larger ferrying scenarios, and assessed analytically and through Monte Carlo simulation, showing better throughput performance in the same order of magnitude of computation time in comparison to other common link scheduling policies. The cascaded optimization method is implemented with a novel embedded software system on a small, unmanned aircraft to validate the simulation results with field experiments. To address the sensitivity of results on trajectory tracking performance, a system that combines motion and link control with waypoint-based navigation is developed and assessed through field experiments. The data ferrying algorithms are further extended by incorporating a Gaussian process to opportunistically learn the RF environment. By continuously improving RF models, the cascaded planner can continually improve the ferrying system's overall performance.

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 40 Protection of Environment 19 2013-07-01 2013-07-01 false Maintenance, scheduled; test vehicles... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... vehicles. (a) Periodic maintenance on the engine, emission control system, and fuel system of test vehicles...

An Integer Programming-Based Generalized Vehicle Routing Approach for Printed Circuit Board Assembly Optimization

ERIC Educational Resources Information Center

Seth, Anupam

2009-01-01

Production planning and scheduling for printed circuit, board assembly has so far defied standard operations research approaches due to the size and complexity of the underlying problems, resulting in unexploited automation flexibility. In this thesis, the increasingly popular collect-and-place machine configuration is studied and the assembly…

The Airlift Planning Problem

DTIC Science & Technology

2017-01-02

to model various aspects of the problem, such as continuous travel times , constraints on weight and rest/active time constraints, using the language of... travel time ; if no feasible insertion point exists, then a new vehicle is added to the solution. This procedure 3 resembles our initialization heuristic...and only if aircraft a is used in the schedule. Each event e must occur at a specific location or “port”. We let τe,e′,a denote the travel time of

Vehicle Scheduling Schemes for Commercial and Emergency Logistics Integration

PubMed Central

Li, Xiaohui; Tan, Qingmei

2013-01-01

In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models. PMID:24391724

Vehicle scheduling schemes for commercial and emergency logistics integration.

PubMed

Li, Xiaohui; Tan, Qingmei

2013-01-01

In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

Split delivery vehicle routing problem with time windows: a case study

NASA Astrophysics Data System (ADS)

Latiffianti, E.; Siswanto, N.; Firmandani, R. A.

2018-04-01

This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

A System for Planning Ahead

NASA Technical Reports Server (NTRS)

2002-01-01

A software system that uses artificial intelligence techniques to help with complex Space Shuttle scheduling at Kennedy Space Center is commercially available. Stottler Henke Associates, Inc.(SHAI), is marketing its automatic scheduling system, the Automated Manifest Planner (AMP), to industries that must plan and project changes many different times before the tasks are executed. The system creates optimal schedules while reducing manpower costs. Using information entered into the system by expert planners, the system automatically makes scheduling decisions based upon resource limitations and other constraints. It provides a constraint authoring system for adding other constraints to the scheduling process as needed. AMP is adaptable to assist with a variety of complex scheduling problems in manufacturing, transportation, business, architecture, and construction. AMP can benefit vehicle assembly plants, batch processing plants, semiconductor manufacturing, printing and textiles, surface and underground mining operations, and maintenance shops. For most of SHAI's commercial sales, the company obtains a service contract to customize AMP to a specific domain and then issues the customer a user license.

Know the Risks: Transporting Students in Private Vehicles

ERIC Educational Resources Information Center

Mahoney, Dan

2011-01-01

Scheduling off-campus extracurricular activities is not the issue, but how to get students there can present a problem. The transportation of students by staff in their private cars for extracurricular activities is common and occurs chiefly as a matter of convenience or cost saving. But it is not without risks. In general, the best solution for…

10 CFR 490.201 - Alternative fueled vehicle acquisition mandate schedule.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 10 Energy 3 2012-01-01 2012-01-01 false Alternative fueled vehicle acquisition mandate schedule. 490.201 Section 490.201 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Mandatory State Fleet Program § 490.201 Alternative fueled vehicle acquisition mandate...

10 CFR 490.201 - Alternative fueled vehicle acquisition mandate schedule.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 10 Energy 3 2010-01-01 2010-01-01 false Alternative fueled vehicle acquisition mandate schedule. 490.201 Section 490.201 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Mandatory State Fleet Program § 490.201 Alternative fueled vehicle acquisition mandate...

10 CFR 490.201 - Alternative fueled vehicle acquisition mandate schedule.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 10 Energy 3 2011-01-01 2011-01-01 false Alternative fueled vehicle acquisition mandate schedule. 490.201 Section 490.201 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Mandatory State Fleet Program § 490.201 Alternative fueled vehicle acquisition mandate...

10 CFR 490.201 - Alternative fueled vehicle acquisition mandate schedule.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 10 Energy 3 2013-01-01 2013-01-01 false Alternative fueled vehicle acquisition mandate schedule. 490.201 Section 490.201 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Mandatory State Fleet Program § 490.201 Alternative fueled vehicle acquisition mandate...

10 CFR 490.201 - Alternative fueled vehicle acquisition mandate schedule.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 10 Energy 3 2014-01-01 2014-01-01 false Alternative fueled vehicle acquisition mandate schedule. 490.201 Section 490.201 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Mandatory State Fleet Program § 490.201 Alternative fueled vehicle acquisition mandate...

Form 2290, heavy highway vehicle use tax, schedule 1 guidance for state motor vehicle licensing offices.

DOT National Transportation Integrated Search

2010-01-01

The purpose of this memorandum is to provide guidance to the state Motor : Vehicle Licensing Offices on acceptable proof of payment regarding Form 2290, : Schedule 1. Please review this material and share it with your employees.

An Alternative Optimization Model and Robust Experimental Design for the Assignment Scheduling Capability for Unmanned Aerial Vehicles (ASC-U) Simulation

DTIC Science & Technology

2007-06-01

introduces ASC-U’s approach for solving the dynamic UAV allocation problem. 26 Christopher J...18 Figure 6. Assignments Dynamics Example (after) .........................................................20 Figure 7. ASC-U Dynamic Cueing...decisions in order to respond to the dynamic environment they face. Thus, to succeed, the Army’s transformation cannot rely

Assessing Potential Energy Savings in Household Travel: Methodological and Empirical Considerations of Vehicle Capability Constraints and Multi-day Activity Patterns

NASA Astrophysics Data System (ADS)

Bolon, Kevin M.

The lack of multi-day data for household travel and vehicle capability requirements is an impediment to evaluations of energy savings strategies, since (1) travel requirements vary from day-to-day, and (2) energy-saving transportation options often have reduced capability. This work demonstrates a survey methodology and modeling system for evaluating the energy-savings potential of household travel, considering multi-day travel requirements and capability constraints imposed by the available transportation resources. A stochastic scheduling model is introduced---the multi-day Household Activity Schedule Estimator (mPHASE)---which generates synthetic daily schedules based on "fuzzy" descriptions of activity characteristics using a finite-element representation of activity flexibility, coordination among household members, and scheduling conflict resolution. Results of a thirty-household pilot study are presented in which responses to an interactive computer assisted personal interview were used as inputs to the mPHASE model in order to illustrate the feasibility of generating complex, realistic multi-day household schedules. Study vehicles were equipped with digital cameras and GPS data acquisition equipment to validate the model results. The synthetically generated schedules captured an average of 60 percent of household travel distance, and exhibited many of the characteristics of complex household travel, including day-to-day travel variation, and schedule coordination among household members. Future advances in the methodology may improve the model results, such as encouraging more detailed and accurate responses by providing a selection of generated schedules during the interview. Finally, the Constraints-based Transportation Resource Assignment Model (CTRAM) is introduced. Using an enumerative optimization approach, CTRAM determines the energy-minimizing vehicle-to-trip assignment decisions, considering trip schedules, occupancy, and vehicle capability. Designed to accept either actual or synthetic schedules, results of an application of the optimization model to the 2001 and 2009 National Household Travel Survey data show that U.S. households can reduce energy use by 10 percent, on average, by modifying the assignment of existing vehicles to trips. Households in 2009 show a higher tendency to assign vehicles optimally than in 2001, and multi-vehicle households with diverse fleets have greater savings potential, indicating that fleet modification strategies may be effective, particularly under higher energy price conditions.

Scheduling with genetic algorithms

NASA Technical Reports Server (NTRS)

Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

1994-01-01

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

40 CFR Appendix Xv to Part 86 - Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test Schedule for...

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 19 2010-07-01 2010-07-01 false Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test Schedule for Diesel Cycle Vehicles Equipped With... Schedule for Diesel Cycle Vehicles Equipped With Periodically Regenerating Trap Oxidizer Systems Certifying...

49 CFR 392.6 - Schedules to conform with speed limits.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 49 Transportation 5 2010-10-01 2010-10-01 false Schedules to conform with speed limits. 392.6... DRIVING OF COMMERCIAL MOTOR VEHICLES General § 392.6 Schedules to conform with speed limits. No motor... points in such period of time as would necessitate the commercial motor vehicle being operated at speeds...

49 CFR 392.6 - Schedules to conform with speed limits.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 49 Transportation 5 2011-10-01 2011-10-01 false Schedules to conform with speed limits. 392.6... DRIVING OF COMMERCIAL MOTOR VEHICLES General § 392.6 Schedules to conform with speed limits. No motor... points in such period of time as would necessitate the commercial motor vehicle being operated at speeds...

Space Handbook

DTIC Science & Technology

1970-07-01

communications problem is confined to transfer between the vehicle and the surface and to recording the data in a form suitable for processing and analysis at a...information available for later analysis would be of greater significance. Thus, computers used to receive and record data may be used to perform preliminary...basic design of boosters and payloads to the reduction and analysis of the data after mission completion. Computers function to schedule experiments

49 CFR 214.531 - Schedule of repairs; general.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Hi-Rail Vehicles § 214.531 Schedule of repairs; general. Except as provided in §§ 214.527(c)(5), 214.529, and 214.533, an on-track roadway maintenance machine or hi-rail vehicle that does not meet all... or hi-rail vehicle shall be placed out of on-track service. ...

40 CFR Appendix Xiv to Part 86 - Determination of Acceptable Durability Test Schedule for Light-Duty Vehicles and Light Light-Duty...

Code of Federal Regulations, 2011 CFR

2011-07-01

... schedule in step 1 of this appendix. This schedule will be designated as the standard (std) test schedule...)2/Ns))std Where: Xs = Individual mileages at which the vehicle will be tested. Ns = Total number of.... Refer to table I and determine tp at (Np − 2)prop degrees of freedom and ts at (Ns − 2)std. 6. If (Aprop...

40 CFR Appendix Xiv to Part 86 - Determination of Acceptable Durability Test Schedule for Light-Duty Vehicles and Light Light-Duty...

Code of Federal Regulations, 2012 CFR

2012-07-01

... schedule in step 1 of this appendix. This schedule will be designated as the standard (std) test schedule...)2/Ns))std Where: Xs = Individual mileages at which the vehicle will be tested. Ns = Total number of.... Refer to table I and determine tp at (Np − 2)prop degrees of freedom and ts at (Ns − 2)std. 6. If (Aprop...

40 CFR Appendix Xiv to Part 86 - Determination of Acceptable Durability Test Schedule for Light-Duty Vehicles and Light Light-Duty...

Code of Federal Regulations, 2010 CFR

2010-07-01

... schedule in step 1 of this appendix. This schedule will be designated as the standard (std) test schedule...)2/Ns))std Where: Xs = Individual mileages at which the vehicle will be tested. Ns = Total number of.... Refer to table I and determine tp at (Np − 2)prop degrees of freedom and ts at (Ns − 2)std. 6. If (Aprop...

40 CFR Appendix Xiv to Part 86 - Determination of Acceptable Durability Test Schedule for Light-Duty Vehicles and Light Light-Duty...

Code of Federal Regulations, 2013 CFR

2013-07-01

... schedule in step 1 of this appendix. This schedule will be designated as the standard (std) test schedule...)2/Ns))std Where: Xs = Individual mileages at which the vehicle will be tested. Ns = Total number of.... Refer to table I and determine tp at (Np − 2)prop degrees of freedom and ts at (Ns − 2)std. 6. If (Aprop...

49 CFR 214.533 - Schedule of repairs subject to availability of parts.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Maintenance Machines and Hi-Rail Vehicles § 214.533 Schedule of repairs subject to availability of parts. (a... 49 Transportation 4 2011-10-01 2011-10-01 false Schedule of repairs subject to availability of... maintenance machine or a hi-rail vehicle by the end of the next business day following the report of the...

Distribution of a Generic Mission Planning and Scheduling Toolkit for Astronomical Spacecraft

NASA Technical Reports Server (NTRS)

Kleiner, Steven C.

1998-01-01

This 2-year report describes the progress made to date on the project to package and distribute the planning and scheduling toolkit for the SWAS astronomical spacecraft. SWAS was scheduled to be launched on a Pegasus XL vehicle in fall 1995. Three separate failures in the launch vehicle have delayed the SWAS launch. The researchers have used this time to continue developing scheduling algorithms and GUI design. SWAS is expected to be launched this year.

49 CFR 214.533 - Schedule of repairs subject to availability of parts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Maintenance Machines and Hi-Rail Vehicles § 214.533 Schedule of repairs subject to availability of parts. (a... maintenance machine or a hi-rail vehicle by the end of the next business day following the report of the... maintenance machine or hi-rail vehicle within seven calendar days after receiving the necessary part. The...

Using Information Processing Techniques to Forecast, Schedule, and Deliver Sustainable Energy to Electric Vehicles

NASA Astrophysics Data System (ADS)

Pulusani, Praneeth R.

As the number of electric vehicles on the road increases, current power grid infrastructure will not be able to handle the additional load. Some approaches in the area of Smart Grid research attempt to mitigate this, but those approaches alone will not be sufficient. Those approaches and traditional solution of increased power production can result in an insufficient and imbalanced power grid. It can lead to transformer blowouts, blackouts and blown fuses, etc. The proposed solution will supplement the ``Smart Grid'' to create a more sustainable power grid. To solve or mitigate the magnitude of the problem, measures can be taken that depend on weather forecast models. For instance, wind and solar forecasts can be used to create first order Markov chain models that will help predict the availability of additional power at certain times. These models will be used in conjunction with the information processing layer and bidirectional signal processing components of electric vehicle charging systems, to schedule the amount of energy transferred per time interval at various times. The research was divided into three distinct components: (1) Renewable Energy Supply Forecast Model, (2) Energy Demand Forecast from PEVs, and (3) Renewable Energy Resource Estimation. For the first component, power data from a local wind turbine, and weather forecast data from NOAA were used to develop a wind energy forecast model, using a first order Markov chain model as the foundation. In the second component, additional macro energy demand from PEVs in the Greater Rochester Area was forecasted by simulating concurrent driving routes. In the third component, historical data from renewable energy sources was analyzed to estimate the renewable resources needed to offset the energy demand from PEVs. The results from these models and components can be used in the smart grid applications for scheduling and delivering energy. Several solutions are discussed to mitigate the problem of overloading transformers, lack of energy supply, and higher utility costs.

Correction of contaminated yaw rate signal and estimation of sensor bias for an electric vehicle under normal driving conditions

NASA Astrophysics Data System (ADS)

Zhang, Guoguang; Yu, Zitian; Wang, Junmin

2017-03-01

Yaw rate is a crucial signal for the motion control systems of ground vehicles. Yet it may be contaminated by sensor bias. In order to correct the contaminated yaw rate signal and estimate the sensor bias, a robust gain-scheduling observer is proposed in this paper. First of all, a two-degree-of-freedom (2DOF) vehicle lateral and yaw dynamic model is presented, and then a Luenberger-like observer is proposed. To make the observer more applicable to real vehicle driving operations, a 2DOF vehicle model with uncertainties on the coefficients of tire cornering stiffness is employed. Further, a gain-scheduling approach and a robustness enhancement are introduced, leading to a robust gain-scheduling observer. Sensor bias detection mechanism is also designed. Case studies are conducted using an electric ground vehicle to assess the performance of signal correction and sensor bias estimation under difference scenarios.

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation

PubMed Central

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K. L.

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood’s temperature model during transportation, the UAVs’ scheduling and routes’ planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood’s temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance. PMID:27163361

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation.

PubMed

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K L

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood's temperature model during transportation, the UAVs' scheduling and routes' planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood's temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance.

Fuel economy and life-cycle cost analysis of a fuel cell hybrid vehicle

NASA Astrophysics Data System (ADS)

Jeong, Kwi Seong; Oh, Byeong Soo

The most promising vehicle engine that can overcome the problem of present internal combustion is the hydrogen fuel cell. Fuel cells are devices that change chemical energy directly into electrical energy without combustion. Pure fuel cell vehicles and fuel cell hybrid vehicles (i.e. a combination of fuel cell and battery) as energy sources are studied. Considerations of efficiency, fuel economy, and the characteristics of power output in hybridization of fuel cell vehicle are necessary. In the case of Federal Urban Driving Schedule (FUDS) cycle simulation, hybridization is more efficient than a pure fuel cell vehicle. The reason is that it is possible to capture regenerative braking energy and to operate the fuel cell system within a more efficient range by using battery. Life-cycle cost is largely affected by the fuel cell size, fuel cell cost, and hydrogen cost. When the cost of fuel cell is high, hybridization is profitable, but when the cost of fuel cell is less than 400 US$/kW, a pure fuel cell vehicle is more profitable.

Automated mixed traffic vehicle control and scheduling study

NASA Technical Reports Server (NTRS)

Peng, T. K. C.; Chon, K.

1976-01-01

The operation and the expected performance of a proposed automatic guideway transit system which uses low speed automated mixed traffic vehicles (AMTVs) were analyzed. Vehicle scheduling and headway control policies were evaluated with a transit system simulation model. The effect of mixed traffic interference on the average vehicle speed was examined with a vehicle pedestrian interface model. Control parameters regulating vehicle speed were evaluated for safe stopping and passenger comfort. Some preliminary data on the cost and operation of an experimental AMTV system are included. These data were the result of a separate task conducted at JPL, and were included as background information.

Emission rates of regulated pollutants from on-road heavy-duty diesel vehicles

NASA Astrophysics Data System (ADS)

Shah, Sandip D.; Johnson, Kent C.; Wayne Miller, J.; Cocker, David R.

Emissions from heavy-duty diesel (HDD) vehicles are affected by many factors. Changes in engine technology, operating mode, fuel properties, vehicle speed and ambient conditions can have significant effects on emission rates of regulated species. This paper presents the results of on-road emissions testing of 11 HDD vehicles (model years 1996-2000) over the ARB Four Phase driving schedule and the urban dynamometer driving schedule (UDDS). Emission rates were found to be highly dependent on vehicle operating mode. Per mile NO x emission rates for vehicle operation at low speeds, in simulated congested traffic, were three times higher per mile emissions then while cruising on the freeway. Comparisons of NO x emission factors to EMFAC baseline emission factors were within 5-40% for vehicles of various model years tested over the UDDS. A comparison of NO x emission factors for a weighted average of the ARB four phase driving schedule yielded values within 17-57% of EMFAC values. Generally, particulate matter (PM) emission rates were lower than EMFAC values.

High Penetration of Electrical Vehicles in Microgrids: Threats and Opportunities

NASA Astrophysics Data System (ADS)

Khederzadeh, Mojtaba; Khalili, Mohammad

2014-10-01

Given that the microgrid concept is the building block of future electric distribution systems and electrical vehicles (EVs) are the future of transportation market, in this paper, the impact of EVs on the performance of microgrids is investigated. Demand-side participation is used to cope with increasing demand for EV charging. The problem of coordination of EV charging and discharging (with vehicle-to-grid (V2G) functionality) and demand response is formulated as a market-clearing mechanism that accepts bids from the demand and supply sides and takes into account the constraints put forward by different parts. Therefore, a day-ahead market with detailed bids and offers within the microgrid is designed whose objective is to maximize the social welfare which is the difference between the value that consumers attach to the electrical energy they buy plus the benefit of the EV owners participating in the V2G functionality and the cost of producing/purchasing this energy. As the optimization problem is a mixed integer nonlinear programming one, it is decomposed into one master problem for energy scheduling and one subproblem for power flow computation. The two problems are solved iteratively by interfacing MATLAB with GAMS. Simulation results on a sample microgrid with different residential, commercial and industrial consumers with associated demand-side biddings and different penetration level of EVs support the proposed formulation of the problem and the applied methods.

A cycle timer for testing electric vehicles

NASA Technical Reports Server (NTRS)

Soltis, R. F.

1978-01-01

A cycle timer was developed to assist the driver of an electric vehicle in more accurately following and repeating SAE driving schedules. These schedules require operating an electric vehicle in a selected stop-and-go driving cycle and repeating this cycle pattern until the vehicle ceases to meet the requirements of the cycle. The heart of the system is a programmable read-only memory (PROM) that has the required test profiles permanently recorded on plug-in cards, one card for each different driving schedule. The PROM generates a direct current analog signal that drives a speedometer displayed on one scale of a dual movement meter. The second scale of the dual movement meter displays the actual speed of the vehicle as recorded by the fifth wheel. The vehicle operator controls vehicle speed to match the desired profile speed. The PROM controls the recycle start time as well as the buzzer activation. The cycle programmer is powered by the test vehicle's 12-volt accessory battery, through a 5-volt regulator and a 12-volt dc-to-dc converter.

Yes, there was a moon race

NASA Technical Reports Server (NTRS)

Oberg, James E.

1990-01-01

Examination of newly disclosed evidence confirms that the Soviets were indeed striving to reach the moon before the U.S. in 1969. It is noted that a Soviet unmanned lunar probe crashed on the moon's surface only hours before the U.S. Apollo landing. Now confirmed openly are moon-exploration schedules that were competitive with Apollo plans, the names and histories of Soviet lunar boosters and landers, identities of the lunar cosmonauts; and even photos of manned lunar craft are available. Additional details on the troubled moon-probe program are presented: technical problems, continuous changes in goals, schedules, and planning, vehicle and personnel disasters, transfer of authority between ministries, and political power struggles in the scientific community.

Advanced paratransit system : an application of digital map, automated vehicle scheduling and vehicle location systems

DOT National Transportation Integrated Search

1997-05-01

This report documents and evaluates an advanced Paratransit system demonstration project. The Santa Clara Valley Transportation Agency (SCVTA), via OUTREACH, implemented such a system, comprised of an automated trip scheduling system (ATSS) and autom...

Dynamic force profile in hydraulic hybrid vehicles: a numerical investigation

NASA Astrophysics Data System (ADS)

Mohaghegh-Motlagh, Amin; Elahinia, Mohammad H.

2010-04-01

A hybrid hydraulic vehicle (HHV) combines a hydraulic sub-system with the conventional drivetrain in order to improve fuel economy for heavy vehicles. The added hydraulic module manages the storage and release of fluid power necessary to assist the motion of the vehicle. The power collected by a pump/motor (P/M) from the regenerative braking phase is stored in a high-pressure accumulator and then released by the P/M to the driveshaft during the acceleration phase. This technology is effective in significantly improving fuel-economy for heavy-class vehicles with frequent stop-and-go drive schedules. Despite improved fuel economy and higher vehicle acceleration, noise and vibrations are one of the main problems of these vehicles. The dual function P/Ms are the main source of noise and vibration in a HHV. This study investigates the dynamics of a P/M and particularly the profile and frequency-dependence of the dynamic forces generated by a bent-axis P/M unit. To this end, the fluid dynamics side of the problem has been simplified for investigating the system from a dynamics perspective. A mathematical model of a bent axis P/M has been developed to investigate the cause of vibration and noise in HHVs. The forces are calculated in time and frequency domains. The results of this work can be used to study the vibration response of the chassis and to design effective vibration isolation systems for HHVs.

Effects of sleep schedules on commercial motor vehicle driver performance

DOT National Transportation Integrated Search

2000-05-01

The project entitled "Effects of Sleep Schedules on Commercial Motor Vehicle Driver Performance" was comprised of two studies; a field study and a laboratory study. In the field study, wrist actigraphy was used to determine amounts of sleep in long-v...

Joint Mobile Data Collection and Wireless Energy Transfer in Wireless Rechargeable Sensor Networks.

PubMed

Zhong, Ping; Li, Ya-Ting; Liu, Wei-Rong; Duan, Gui-Hua; Chen, Ying-Wen; Xiong, Neal

2017-08-16

In wireless rechargeable sensor networks (WRSNs), there is a way to use mobile vehicles to charge node and collect data. It is a rational pattern to use two types of vehicles, one is for energy charging, and the other is for data collecting. These two types of vehicles, data collection vehicles (DCVs) and wireless charging vehicles (WCVs), are employed to achieve high efficiency in both data gathering and energy consumption. To handle the complex scheduling problem of multiple vehicles in large-scale networks, a twice-partition algorithm based on center points is proposed to divide the network into several parts. In addition, an anchor selection algorithm based on the tradeoff between neighbor amount and residual energy, named AS-NAE, is proposed to collect the zonal data. It can reduce the data transmission delay and the energy consumption for DCVs' movement in the zonal. Besides, we design an optimization function to achieve maximum data throughput by adjusting data rate and link rate of each node. Finally, the effectiveness of proposed algorithm is validated by numerical simulation results in WRSNs.

Joint Mobile Data Collection and Wireless Energy Transfer in Wireless Rechargeable Sensor Networks

PubMed Central

Li, Ya-Ting; Liu, Wei-Rong; Duan, Gui-Hua; Chen, Ying-Wen

2017-01-01

In wireless rechargeable sensor networks (WRSNs), there is a way to use mobile vehicles to charge node and collect data. It is a rational pattern to use two types of vehicles, one is for energy charging, and the other is for data collecting. These two types of vehicles, data collection vehicles (DCVs) and wireless charging vehicles (WCVs), are employed to achieve high efficiency in both data gathering and energy consumption. To handle the complex scheduling problem of multiple vehicles in large-scale networks, a twice-partition algorithm based on center points is proposed to divide the network into several parts. In addition, an anchor selection algorithm based on the tradeoff between neighbor amount and residual energy, named AS-NAE, is proposed to collect the zonal data. It can reduce the data transmission delay and the energy consumption for DCVs’ movement in the zonal. Besides, we design an optimization function to achieve maximum data throughput by adjusting data rate and link rate of each node. Finally, the effectiveness of proposed algorithm is validated by numerical simulation results in WRSNs. PMID:28813029

46 CFR 525.2 - Terminal schedules.

Code of Federal Regulations, 2011 CFR

2011-10-01

... scrap, new assembled motor vehicles, waste paper and paper waste in terminal schedules. (2) Marine... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR SCHEDULES § 525.2 Terminal schedules. (a) Marine terminal operator schedules. A marine terminal operator, at...

46 CFR 525.2 - Terminal schedules.

Code of Federal Regulations, 2010 CFR

2010-10-01

... scrap, new assembled motor vehicles, waste paper and paper waste in terminal schedules. (2) Marine... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR SCHEDULES § 525.2 Terminal schedules. (a) Marine terminal operator schedules. A marine terminal operator, at...

A two-stage stochastic rule-based model to determine pre-assembly buffer content

NASA Astrophysics Data System (ADS)

Gunay, Elif Elcin; Kula, Ufuk

2018-01-01

This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decides the spare vehicle quantities, where the second stage model recovers the scrambled sequence respect to pre-defined rules. The problem is solved by sample average approximation (SAA) algorithm. We conduct a numerical study to compare the solutions of heuristic model with optimal ones and provide following insights: (i) as the mismatch between paint entrance and scheduled sequence decreases, the rule-based heuristic model recovers the scrambled sequence as good as the optimal resequencing model, (ii) the rule-based model is more sensitive to the mismatch between the paint entrance and scheduled sequences for recovering the scrambled sequence, (iii) as the defect rate increases, the difference in recovery effectiveness between rule-based heuristic and optimal solutions increases, (iv) as buffer capacity increases, the recovery effectiveness of the optimization model outperforms heuristic model, (v) as expected the rule-based model holds more inventory than the optimization model.

Steering a new course

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gordon, D.

1991-01-01

This book offers for the first time a comprehensive survey and analysis of America's transportation system - how it contributes to our environmental problems, and how we could make it safer, more efficient, and less costly. The book includes a history of modern American transportation, an overview of the U.S. transportation sector, and an in-depth discussion of the strategies that hold the most promise for the future. The book provides a wealth of information about innovative transportation options such as: alternative fuels, advances in mass transit, ultra- fuel-efficient vehicles, high-occupancy vehicle facilities, and telecommuting and alternative work schedules. Deborah Gordonmore » is a transportation and energy analyst for the Union of Concerned Scientists.« less

KSC-97PC1540

NASA Image and Video Library

1997-10-12

At Launch Complex 40 on Cape Canaveral Air Station, the Mobile Service Tower has been retracted away from the Titan IVB/Centaur carrying the Cassini spacecraft, marking a major milestone in the launch countdown sequence. Retraction of the structure began about an hour later than scheduled due to minor problems with ground support equipment. The launch vehicle, Cassini spacecraft and attached Centaur stage encased in a payload fairing, altogether stand about 183 feet tall; mounted at the base of the launch vehicle are two upgraded solid rocket motors. Liftoff of Cassini on the journey to Saturn and its moon Titan is slated to occur during a window opening at 4:55 a.m. EDT, Oct. 13, and extending through 7:15 a.m

Flight Test of the Engine Fuel Schedules of the X-43A Hyper-X Research Vehicles

NASA Technical Reports Server (NTRS)

Jones, Thomas

2006-01-01

The Hyper-X program flew two X-43A Hyper-X Research Vehicles (HXRVs) in 2004, referred to as Ship 2 and Ship 3. The scramjet engine of the X-43A research vehicle was autonomously controlled in flight to track a predetermined fueling schedule. Ship 2 flew at approximately Mach 7 and Ship 3 flew at approximately Mach 10.

Coordinated platooning with multiple speeds

DOE PAGES

Luo, Fengqiao; Larson, Jeffrey; Munson, Todd

2018-03-22

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on themore » time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.« less

Coordinated platooning with multiple speeds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luo, Fengqiao; Larson, Jeffrey; Munson, Todd

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on themore » time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.« less

Characterization, performance, and prediction of a lead-acid battery under simulated electric vehicle driving requirements

NASA Technical Reports Server (NTRS)

Ewashinka, J. G.; Bozek, J. M.

1981-01-01

A state-of-the-art 6-V battery module in current use by the electric vehicle industry was tested at the NASA Lewis Research Center to determine its performance characteristics under the SAE J227a driving schedules B, C, and D. The primary objective of the tests was to determine the effects of periods of recuperation and long and short periods of electrical regeneration in improving the performance of the battery module and hence extendng the vehicle range. A secondary objective was to formulate a computer program that would predict the performance of this battery module for the above driving schedules. The results show excellent correlation between the laboratory tests and predicted results. The predicted performance compared with laboratory tests was within +2.4 to -3.7 percent for the D schedule, +0.5 to -7.1 percent for the C schedule, and better than -11.4 percent for the B schedule.

Characterization, performance, and prediction of a lead-acid battery under simulated electric vehicle driving requirements

NASA Astrophysics Data System (ADS)

Ewashinka, J. G.; Bozek, J. M.

1981-05-01

A state-of-the-art 6-V battery module in current use by the electric vehicle industry was tested at the NASA Lewis Research Center to determine its performance characteristics under the SAE J227a driving schedules B, C, and D. The primary objective of the tests was to determine the effects of periods of recuperation and long and short periods of electrical regeneration in improving the performance of the battery module and hence extendng the vehicle range. A secondary objective was to formulate a computer program that would predict the performance of this battery module for the above driving schedules. The results show excellent correlation between the laboratory tests and predicted results. The predicted performance compared with laboratory tests was within +2.4 to -3.7 percent for the D schedule, +0.5 to -7.1 percent for the C schedule, and better than -11.4 percent for the B schedule.

Pitch Guidance Optimization for the Orion Abort Flight Tests

NASA Technical Reports Server (NTRS)

Stillwater, Ryan Allanque

2010-01-01

The National Aeronautics and Space Administration created the Constellation program to develop the next generation of manned space vehicles and launch vehicles. The Orion abort system is initiated in the event of an unsafe condition during launch. The system has a controller gains schedule that can be tuned to reduce the attitude errors between the simulated Orion abort trajectories and the guidance trajectory. A program was created that uses the method of steepest descent to tune the pitch gains schedule by an automated procedure. The gains schedule optimization was applied to three potential abort scenarios; each scenario tested using the optimized gains schedule resulted in reduced attitude errors when compared to the Orion production gains schedule.

DORCA computer program. Volume 1: User's guide

NASA Technical Reports Server (NTRS)

Wray, S. T., Jr.

1971-01-01

The Dynamic Operational Requirements and Cost Analysis Program (DORCA) was written to provide a top level analysis tool for NASA. DORCA relies on a man-machine interaction to optimize results based on external criteria. DORCA relies heavily on outside sources to provide cost information and vehicle performance parameters as the program does not determine these quantities but rather uses them. Given data describing missions, vehicles, payloads, containers, space facilities, schedules, cost values and costing procedures, the program computes flight schedules, cargo manifests, vehicle fleet requirements, acquisition schedules and cost summaries. The program is designed to consider the Earth Orbit, Lunar, Interplanetary and Automated Satellite Programs. A general outline of the capabilities of the program are provided.

Gain Scheduling for the Orion Launch Abort Vehicle Controller

NASA Technical Reports Server (NTRS)

McNamara, Sara J.; Restrepo, Carolina I.; Madsen, Jennifer M.; Medina, Edgar A.; Proud, Ryan W.; Whitley, Ryan J.

2011-01-01

One of NASAs challenges for the Orion vehicle is the control system design for the Launch Abort Vehicle (LAV), which is required to abort safely at any time during the atmospheric ascent portion of ight. The focus of this paper is the gain design and scheduling process for a controller that covers the wide range of vehicle configurations and flight conditions experienced during the full envelope of potential abort trajectories from the pad to exo-atmospheric flight. Several factors are taken into account in the automation process for tuning the gains including the abort effectors, the environmental changes and the autopilot modes. Gain scheduling is accomplished using a linear quadratic regulator (LQR) approach for the decoupled, simplified linear model throughout the operational envelope in time, altitude and Mach number. The derived gains are then implemented into the full linear model for controller requirement validation. Finally, the gains are tested and evaluated in a non-linear simulation using the vehicles ight software to ensure performance requirements are met. An overview of the LAV controller design and a description of the linear plant models are presented. Examples of the most significant challenges with the automation of the gain tuning process are then discussed. In conclusion, the paper will consider the lessons learned through out the process, especially in regards to automation, and examine the usefulness of the gain scheduling tool and process developed as applicable to non-Orion vehicles.

41 CFR 109-6.400 - Scope and applicability.

Code of Federal Regulations, 2010 CFR

2010-07-01

... scheduled to depart before the beginning of regular working hours, or if there will be a significant savings in time, a Government motor vehicle may be issued at the close of the preceding working day. Similarly, when scheduled to return after the close of working hours, the motor vehicle may be returned the...

40 CFR 86.115-00 - EPA dynamometer driving schedules.

Code of Federal Regulations, 2010 CFR

2010-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1977 and Later Model Year New Light-Duty Vehicles and New Light-Duty Trucks and New Otto-Cycle... for the EPA Urban Dynamometer Driving Schedule, US06, SC03, and the EPA New York City Cycles are...

40 CFR 86.115-00 - EPA dynamometer driving schedules.

Code of Federal Regulations, 2013 CFR

2013-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1977 and Later Model Year New Light-Duty Vehicles and New Light-Duty Trucks and New Otto-Cycle... for the EPA Urban Dynamometer Driving Schedule, US06, SC03, and the EPA New York City Cycles are...

40 CFR 86.115-00 - EPA dynamometer driving schedules.

Code of Federal Regulations, 2011 CFR

2011-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1977 and Later Model Year New Light-Duty Vehicles and New Light-Duty Trucks and New Otto-Cycle... for the EPA Urban Dynamometer Driving Schedule, US06, SC03, and the EPA New York City Cycles are...

40 CFR 86.115-00 - EPA dynamometer driving schedules.

Code of Federal Regulations, 2012 CFR

2012-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1977 and Later Model Year New Light-Duty Vehicles and New Light-Duty Trucks and New Otto-Cycle... for the EPA Urban Dynamometer Driving Schedule, US06, SC03, and the EPA New York City Cycles are...

Application of IUS equipment and experience to orbit transfer vehicles of the 90's

NASA Astrophysics Data System (ADS)

Bangsund, E.; Keeney, J.; Cowgill, E.

1985-10-01

This paper relates experiences with the IUS program and the application of that experience to Future Orbit Transfer Vehicles. More specifically it includes the implementation of the U.S. Air Force Space Division high reliability parts standard (SMASO STD 73-2C) and the component/system test standard (MIL-STD-1540A). Test results from the parts and component level testing and the resulting system level test program for fourteen IUS flight vehicles are discussed. The IUS program has had the highest compliance with these standards and thus offers a benchmark of experience for future programs demanding extreme reliability. In summary, application of the stringent parts standard has resulted in fewer failures during testing and the stringent test standard has eliminated design problems in the hardware. Both have been expensive in costs and schedules, and should be applied with flexibility.

A flight research program to develop airborne systems for improved terminal area operations

NASA Technical Reports Server (NTRS)

Reeder, J. P.

1974-01-01

The research program considered is concerned with the solution of operational problems for the approximate time period from 1980 to 2000. The problems are related to safety, weather effects, congestion, energy conservation, noise, atmospheric pollution, and the loss in productivity caused by delays, diversions, and schedule stretchouts. The terminal configured vehicle (TCV) program is to develop advanced flight-control capability. The various aspects of the TCV program are discussed, giving attention to avionics equipment, the piloted simulator, terminal-area environment simulation, the Wallops research facility, flight procedures, displays and human factors, flight activities, and questions of vortex-wake reduction and tracking.

A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply chain environment.

PubMed

Li, Yanhui; Guo, Hao; Wang, Lin; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment.

Complex multidisciplinary systems decomposition for aerospace vehicle conceptual design and technology acquisition

NASA Astrophysics Data System (ADS)

Omoragbon, Amen

Although, the Aerospace and Defense (A&D) industry is a significant contributor to the United States' economy, national prestige and national security, it experiences significant cost and schedule overruns. This problem is related to the differences between technology acquisition assessments and aerospace vehicle conceptual design. Acquisition assessments evaluate broad sets of alternatives with mostly qualitative techniques, while conceptual design tools evaluate narrow set of alternatives with multidisciplinary tools. In order for these two fields to communicate effectively, a common platform for both concerns is desired. This research is an original contribution to a three-part solution to this problem. It discusses the decomposition step of an innovation technology and sizing tool generation framework. It identifies complex multidisciplinary system definitions as a bridge between acquisition and conceptual design. It establishes complex multidisciplinary building blocks that can be used to build synthesis systems as well as technology portfolios. It also describes a Graphical User Interface Designed to aid in decomposition process. Finally, it demonstrates an application of the methodology to a relevant acquisition and conceptual design problem posed by the US Air Force.

National Space Transportation Systems Program mission report

NASA Technical Reports Server (NTRS)

Collins, M. A., Jr.; Aldrich, A. D.; Lunney, G. S.

1984-01-01

The 515-41B National Space Transportation Systems Program Mission Report contains a summary of the major activities and accomplishments of the sixth operational Shuttle flight and fourth flight of the OV-099 vehicle, Challenger. Since this flight was the first to land at Kennedy Space Center, the vehicle was towed directly to the OPF (Orbiter Processing Facility) where preparations for flight STS-41C, scheduled for early April 1984, began immediately. The significant problems that occurred during STS-41B are summarized and a problem tracking list that is a complete list of all problems that occurred during the flight is given. None of the problems will affect the STS 41C flight. The major objectives of flight STS-41B were to successfully deploy the Westar satellite and the Indonesian Communications Satellite-B2 (PALAPA-B2); to evaluate the MMU (Manned Maneuvering Unit) support for EVA (Extravehicular Activities); to exercise the MFR (Manipulator Foot Restraint); to demonstrate a closed loop rendezvous; and to operate the M.R (Monodisperse Latex Reactor), the ACES (Acoustic Containerless Experiment System) and the IEF (Isoelectric Focusing) in cabin experiments; and to obtain photographs with the Cinema 360 Cameras.

Decision-Theoretic Control of Planetary Rovers

NASA Technical Reports Server (NTRS)

Zilberstein, Shlomo; Washington, Richard; Bernstein, Daniel S.; Mouaddib, Abdel-Illah; Morris, Robert (Technical Monitor)

2003-01-01

Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We describe two decision-theoretic approaches to maximize the productivity of planetary rovers: one based on adaptive planning and the other on hierarchical reinforcement learning. Both approaches map the problem into a Markov decision problem and attempt to solve a large part of the problem off-line, exploiting the structure of the plan and independence between plan components. We examine the advantages and limitations of these techniques and their scalability.

Colorado SIP: 5 CCR 1001-13, Reg 11, Motor Vehicle Emissions Inspection Program—Part A, General Provisions, Area of Applicability, Schedules for Obtaining Certification of Emissions Control, Definitions, Exemptions, and Clean Screening/Remote Sensing

EPA Pesticide Factsheets

Colorado SIP: 5 CCR 1001-13, Reg 11, Motor Vehicle Emissions Inspection Program—Part A, General Provisions, Area of Applicability, Schedules for Obtaining Certification of Emissions Control, Definitions, Exemptions, and Clean Screening/Remote Sensing

A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment

PubMed Central

Guo, Hao; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment. PMID:24489489

Self-Directed Cooperative Planetary Rovers

NASA Technical Reports Server (NTRS)

Zilberstein, Shlomo; Morris, Robert (Technical Monitor)

2003-01-01

The project is concerned with the development of decision-theoretic techniques to optimize the scientific return of planetary rovers. Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We have developed a comprehensive solution to this problem that involves high-level tools to describe a mission; a compiler that maps a mission description and additional probabilistic models of the components of the rover into a Markov decision problem; and algorithms for solving the rover control problem that are sensitive to the limited computational resources and high-level of uncertainty in this domain.

Titan 4B/Centaur/Cassini prelaunch at LC 40

NASA Technical Reports Server (NTRS)

1997-01-01

KENNEDY SPACE CENTER, FLA. -- At Launch Complex 40 on Cape Canaveral Air Station, the Mobile Service Tower has been retracted away from the Titan IVB/Centaur carrying the Cassini spacecraft, marking a major milestone in the launch countdown sequence. Retraction of the structure began about an hour later than scheduled due to minor problems with ground support equipment. The launch vehicle, Cassini spacecraft and attached Centaur stage encased in a payload fairing, altogether stand about 183 feet tall; mounted at the base of the launch vehicle are two upgraded solid rocket motors. Liftoff of Cassini on the journey to Saturn and its moon Titan is slated to occur during a window opening at 4:55 a.m. EDT, Oct. 13, and extending through 7:15 a.m.

System cost/performance analysis (study 2.3). Volume 1: Executive summary

NASA Technical Reports Server (NTRS)

Kazangey, T.

1973-01-01

The relationships between performance, safety, cost, and schedule parameters were identified and quantified in support of an overall effort to generate program models and methodology that provide insight into a total space vehicle program. A specific space vehicle system, the attitude control system (ACS), was used, and a modeling methodology was selected that develops a consistent set of quantitative relationships among performance, safety, cost, and schedule, based on the characteristics of the components utilized in candidate mechanisms. These descriptive equations were developed for a three-axis, earth-pointing, mass expulsion ACS. A data base describing typical candidate ACS components was implemented, along with a computer program to perform sample calculations. This approach, implemented on a computer, is capable of determining the effect of a change in functional requirements to the ACS mechanization and the resulting cost and schedule. By a simple extension of this modeling methodology to the other systems in a space vehicle, a complete space vehicle model can be developed. Study results and recommendations are presented.

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

Reusable Launch Vehicle Control In Multiple Time Scale Sliding Modes

NASA Technical Reports Server (NTRS)

Shtessel, Yuri; Hall, Charles; Jackson, Mark

2000-01-01

A reusable launch vehicle control problem during ascent is addressed via multiple-time scaled continuous sliding mode control. The proposed sliding mode controller utilizes a two-loop structure and provides robust, de-coupled tracking of both orientation angle command profiles and angular rate command profiles in the presence of bounded external disturbances and plant uncertainties. Sliding mode control causes the angular rate and orientation angle tracking error dynamics to be constrained to linear, de-coupled, homogeneous, and vector valued differential equations with desired eigenvalues placement. Overall stability of a two-loop control system is addressed. An optimal control allocation algorithm is designed that allocates torque commands into end-effector deflection commands, which are executed by the actuators. The dual-time scale sliding mode controller was designed for the X-33 technology demonstration sub-orbital launch vehicle in the launch mode. Simulation results show that the designed controller provides robust, accurate, de-coupled tracking of the orientation angle command profiles in presence of external disturbances and vehicle inertia uncertainties. This is a significant advancement in performance over that achieved with linear, gain scheduled control systems currently being used for launch vehicles.

26 CFR 41.6001-2 - Proof of payment for State registration purposes.

Code of Federal Regulations, 2010 CFR

2010-04-01

... section, the vehicle identification number of the vehicle being registered must appear on the Schedule 1... of the vehicles (or their vehicle identification numbers) is not required as part of such proof of... not include a list of vehicle identification numbers is submitted as proof of payment for the...

26 CFR 41.6001-2 - Proof of payment for State registration purposes.

Code of Federal Regulations, 2011 CFR

2011-04-01

... section, the vehicle identification number of the vehicle being registered must appear on the Schedule 1... of the vehicles (or their vehicle identification numbers) is not required as part of such proof of... not include a list of vehicle identification numbers is submitted as proof of payment for the...

Vehicle dynamics control of four in-wheel motor drive electric vehicle using gain scheduling based on tyre cornering stiffness estimation

NASA Astrophysics Data System (ADS)

Xiong, Lu; Yu, Zhuoping; Wang, Yang; Yang, Chen; Meng, Yufeng

2012-06-01

This paper focuses on the vehicle dynamic control system for a four in-wheel motor drive electric vehicle, aiming at improving vehicle stability under critical driving conditions. The vehicle dynamics controller is composed of three modules, i.e. motion following control, control allocation and vehicle state estimation. Considering the strong nonlinearity of the tyres under critical driving conditions, the yaw motion of the vehicle is regulated by gain scheduling control based on the linear quadratic regulator theory. The feed-forward and feedback gains of the controller are updated in real-time by online estimation of the tyre cornering stiffness, so as to ensure the control robustness against environmental disturbances as well as parameter uncertainty. The control allocation module allocates the calculated generalised force requirements to each in-wheel motor based on quadratic programming theory while taking the tyre longitudinal/lateral force coupling characteristic into consideration. Simulations under a variety of driving conditions are carried out to verify the control algorithm. Simulation results indicate that the proposed vehicle stability controller can effectively stabilise the vehicle motion under critical driving conditions.

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. III

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. II

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Computer Program (VEHSIM) For Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. IV: Enhancements

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Industrial Processes to Reduce Generation of Hazardous Waste at DoD Facilities. Phase III Report. Appendix C. Workshop Manual Centralized Vehicle Wash Racks and Scheduled Maintenance Facilities, Fort Lewis, Washington.

DTIC Science & Technology

1985-12-01

Lobster Shop - 759-2165. 4013 Ruston Way. Known for excellent seafood. Nautical The Bay Co. - 752-6661. 3327 Ruston Way. Various entrees. CI Shenanigans ...se- RCRA permit is inappropriate." Ac- forms of financial responsibility for rious potential health problem in New cording to Rogers and Darrah, under...admini- strative, monitoring, and financial standards for them. EPA will use these independently enforceable standards to issue permits to owners

On the preventive management of sediment-related sewer blockages: a combined maintenance and routing optimization approach.

PubMed

Fontecha, John E; Akhavan-Tabatabaei, Raha; Duque, Daniel; Medaglia, Andrés L; Torres, María N; Rodríguez, Juan Pablo

In this work we tackle the problem of planning and scheduling preventive maintenance (PM) of sediment-related sewer blockages in a set of geographically distributed sites that are subject to non-deterministic failures. To solve the problem, we extend a combined maintenance and routing (CMR) optimization approach which is a procedure based on two components: (a) first a maintenance model is used to determine the optimal time to perform PM operations for each site and second (b) a mixed integer program-based split procedure is proposed to route a set of crews (e.g., sewer cleaners, vehicles equipped with winches or rods and dump trucks) in order to perform PM operations at a near-optimal minimum expected cost. We applied the proposed CMR optimization approach to two (out of five) operative zones in the city of Bogotá (Colombia), where more than 100 maintenance operations per zone must be scheduled on a weekly basis. Comparing the CMR against the current maintenance plan, we obtained more than 50% of cost savings in 90% of the sites.

Computer Program (HEVSIM) for Heavy Duty Vehicle Fuel Economy and Performance Simulation. Volume I: Description and Analysis

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation : Volume II: Users' Manual

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 3. Glossary and listings

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 2. Users guide

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 1. Description and analysis

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation : Volume 1: Description and Analysis

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. I: Description and Analysis

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Light-Duty Motor Vehicle Exhaust Particulate Matter Measurement in the Denver, Colorado, Area.

PubMed

Cadle, Steven H; Mulawa, Patricia; Hunsanger, Eric C; Nelson, Ken; Ragazzi, Ronald A; Barrett, Richard; Gallagher, Gerald L; Lawson, Douglas R; Knapp, Kenneth T; Snow, Richard

1999-09-01

A study of particulate matter (PM) emissions from in-use, light-duty vehicles was conducted during the summer of 1996 and the winter of 1997 in the Denver, CO, region. Vehicles were tested as received on chassis dynamometers on the Federal Test Procedure Urban Dynamometer Driving Schedule (UDDS) and the IM240 driving schedule. Both PM10 and regulated emissions were measured for each phase of the UDDS. For the summer portion of the study, 92 gasoline vehicles, 10 diesel vehicles, and 9 gasoline vehicles with visible smoke emissions were tested once. For the winter, 56 gasoline vehicles, 12 diesel vehicles, and 15 gasoline vehicles with visible smoke were tested twice, once indoors at 60 °F and once outdoors at the prevailing temperature. Vehicle model year ranged from 1966 to 1996. Impactor particle size distributions were obtained on a subset of vehicles. Continuous estimates of the particle number emissions were obtained with an electrical aerosol analyzer. This data set is being provided to the Northern Front Range Air Quality Study program and to the State of Colorado and the U.S. Environmental Protection Agency for use in updating emissions inventories.

A Sarsa(λ)-based control model for real-time traffic light coordination.

PubMed

Zhou, Xiaoke; Zhu, Fei; Liu, Quan; Fu, Yuchen; Huang, Wei

2014-01-01

Traffic problems often occur due to the traffic demands by the outnumbered vehicles on road. Maximizing traffic flow and minimizing the average waiting time are the goals of intelligent traffic control. Each junction wants to get larger traffic flow. During the course, junctions form a policy of coordination as well as constraints for adjacent junctions to maximize their own interests. A good traffic signal timing policy is helpful to solve the problem. However, as there are so many factors that can affect the traffic control model, it is difficult to find the optimal solution. The disability of traffic light controllers to learn from past experiences caused them to be unable to adaptively fit dynamic changes of traffic flow. Considering dynamic characteristics of the actual traffic environment, reinforcement learning algorithm based traffic control approach can be applied to get optimal scheduling policy. The proposed Sarsa(λ)-based real-time traffic control optimization model can maintain the traffic signal timing policy more effectively. The Sarsa(λ)-based model gains traffic cost of the vehicle, which considers delay time, the number of waiting vehicles, and the integrated saturation from its experiences to learn and determine the optimal actions. The experiment results show an inspiring improvement in traffic control, indicating the proposed model is capable of facilitating real-time dynamic traffic control.

Improving collection efficiency through remote monitoring of charity assets.

PubMed

McLeod, Fraser; Erdogan, Gunes; Cherrett, Tom; Bektas, Tolga; Davies, Nigel; Shingleton, Duncan; Speed, Chris; Dickinson, Janet; Norgate, Sarah

2014-02-01

Collection costs associated with servicing a major UK charity's donation banks and collecting unsold goods from their retail shops can account for up to 20% of the overall income gained. Bank and shop collections are commingled and are typically made on fixed days of the week irrespective of the amounts of materials waiting to be collected. Using collection records from a major UK charity, this paper considers what vehicle routing and scheduling benefits could accrue if bank and shop servicing requirements were monitored, the former using remote sensing technology to allow more proactive collection scheduling. A vehicle routing and scheduling algorithm employing tabu search methods was developed, and suggested time and distance savings of up to 30% over the current fixed schedules when a minimum bank and shop fill level of between 50% and 60% was used as a collection trigger. For the case study investigated, this led to a potential revenue gain of 5% for the charity and estimated CO2 savings of around 0.5 tonnes per week across the fleet of six heterogeneous vehicles. Copyright © 2013 Elsevier Ltd. All rights reserved.

Optimal charging scheduler for electric vehicles on the Florida turnpike : final research project report.

DOT National Transportation Integrated Search

2017-06-01

This project developed a methodology to simulate and analyze roadway traffic patterns : and expected penetration and timing of electric vehicles (EVs) with application directed : toward the requirements for electric vehicle supply equipment (EVSE) si...

Computer program (POWREQ) for power requirements of mass transit vehicles

DOT National Transportation Integrated Search

1977-08-01

This project was performed to develop a computer program suitable for use in systematic analyses requiring estimates of the energy requirements of mass transit vehicles as a function of driving schedules and vehicle size, shape, and gross weight. The...

Constraint-based integration of planning and scheduling for space-based observatory management

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Steven F.

1994-01-01

Progress toward the development of effective, practical solutions to space-based observatory scheduling problems within the HSTS scheduling framework is reported. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) short-term observation scheduling problem. The work was motivated by the limitations of the current solution and, more generally, by the insufficiency of classical planning and scheduling approaches in this problem context. HSTS has subsequently been used to develop improved heuristic solution techniques in related scheduling domains and is currently being applied to develop a scheduling tool for the upcoming Submillimeter Wave Astronomy Satellite (SWAS) mission. The salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research are summarized. Then, some key problem decomposition techniques underlying the integrated planning and scheduling approach to the HST problem are described; research results indicate that these techniques provide leverage in solving space-based observatory scheduling problems. Finally, more recently developed constraint-posting scheduling procedures and the current SWAS application focus are summarized.

A meta-heuristic method for solving scheduling problem: crow search algorithm

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

Advanced Vehicle and Power Initiative

DTIC Science & Technology

2010-07-29

optimize vehicle operation, and capture vehicle kinetic energy during braking ( regenerative energy). As much as two-thirds of this imported oil comes... categories . Figure 4 provides a visual representation of many of the HEV and BEV options available on the 2010 GSA Schedule. Figure 4 - GSA...gallon • Renewable energy generated 24 • Vehicle miles driven by vehicle category • Implementation costs – Infrastructure modifications required

26 CFR 41.6001-2 - Proof of payment for State registration purposes.

Code of Federal Regulations, 2013 CFR

2013-04-01

... suspended. Except as provided in paragraph (c)(1)(ii) of this section, the vehicle identification number of... beginning before July 1, 2000, if a Schedule 1 which does not include a list of vehicle identification... written statement shall contain the vehicle identification numbers of the vehicles sought to be registered...

26 CFR 41.6001-2 - Proof of payment for State registration purposes.

Code of Federal Regulations, 2012 CFR

2012-04-01

... suspended. Except as provided in paragraph (c)(1)(ii) of this section, the vehicle identification number of... beginning before July 1, 2000, if a Schedule 1 which does not include a list of vehicle identification... written statement shall contain the vehicle identification numbers of the vehicles sought to be registered...

APOLLO 4 SATURN V LAUNCH VEHICLE MATING INSIDE VEHICLE ASSEMBLY BUILDING [VAB

NASA Technical Reports Server (NTRS)

1967-01-01

The S II stage of the Apollo/Saturn 501 launch vehicle is being mated to the first stage at the Vehicle Assembly Building [VAB] in preparation for the National Aeronautics and Space Administration's first Saturn V mission. The mission will be unmanned and is scheduled early this year.

Development and Testing of an Automatic Transmission Shift Schedule Algorithm for Vehicle Simulation (SAE Paper 2015-01-1142)

EPA Science Inventory

The Advanced Light-Duty Powertrain and Hybrid Analysis (ALPHA) modeling tool was created by EPA to estimate greenhouse gas (GHG) emissions of light-duty vehicles. ALPHA is a physics-based, forward-looking, full vehicle computer simulation capable of analyzing various vehicle type...

Controls, health assessment, and conditional monitoring for large, reusable, liquid rocket engines

NASA Technical Reports Server (NTRS)

Cikanek, H. A., III

1986-01-01

Past and future progress in the performance of control systems for large, liquid rocket engines typified such as current state-of-the-art, the Shuttle Main Engine (SSME), is discussed. Details of the first decade of efforts, which culminates in the F-1 and J-2 Saturn engines control systems, are traced, noting problem modes and improvements which were implemented to realize the SSME. Future control system designs, to accommodate the requirements of operation of engines for a heavy lift launch vehicle, an orbital transfer vehicle and the aerospace plane, are summarized. Generic design upgrades needed include an expanded range of fault detection, maintenance as-needed instead of as-scheduled, reduced human involvement in engine operations, and increased control of internal engine states. Current NASA technology development programs aimed at meeting the future control system requirements are described.

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

NASA Technical Reports Server (NTRS)

Smith, Stephen F.; Pathak, Dhiraj K.

1991-01-01

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

76 FR 40306 - Harmonizing Schedule I Drug Requirements

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-08

... [Docket No. FMCSA-2011-0073] RIN 2126-AB35 Harmonizing Schedule I Drug Requirements AGENCY: Federal Motor... instructions for the medical examination report to clarify that drivers may not use Schedule I drugs and be.... Abbreviations CAA Clean Air Act. CFR Code of Federal Regulations. CMV Commercial Motor Vehicle. DEA Drug...

Scheduling work zones in multi-modal networks phase 1: scheduling work zones in transportation service networks.

DOT National Transportation Integrated Search

2016-06-01

The purpose of this project is to study the optimal scheduling of work zones so that they have minimum negative impact (e.g., travel delay, gas consumption, accidents, etc.) on transport service vehicle flows. In this project, a mixed integer linear ...

A two-stage stochastic optimization model for scheduling electric vehicle charging loads to relieve distribution-system constraints

DOE PAGES

Wu, Fei; Sioshansi, Ramteen

2017-05-25

Electric vehicles (EVs) hold promise to improve the energy efficiency and environmental impacts of transportation. However, widespread EV use can impose significant stress on electricity-distribution systems due to their added charging loads. This paper proposes a centralized EV charging-control model, which schedules the charging of EVs that have flexibility. This flexibility stems from EVs that are parked at the charging station for a longer duration of time than is needed to fully recharge the battery. The model is formulated as a two-stage stochastic optimization problem. The model captures the use of distributed energy resources and uncertainties around EV arrival timesmore » and charging demands upon arrival, non-EV loads on the distribution system, energy prices, and availability of energy from the distributed energy resources. We use a Monte Carlo-based sample-average approximation technique and an L-shaped method to solve the resulting optimization problem efficiently. We also apply a sequential sampling technique to dynamically determine the optimal size of the randomly sampled scenario tree to give a solution with a desired quality at minimal computational cost. Here, we demonstrate the use of our model on a Central-Ohio-based case study. We show the benefits of the model in reducing charging costs, negative impacts on the distribution system, and unserved EV-charging demand compared to simpler heuristics. Lastly, we also conduct sensitivity analyses, to show how the model performs and the resulting costs and load profiles when the design of the station or EV-usage parameters are changed.« less

Vehicle Test Procedure Driving Schedules

DOT National Transportation Integrated Search

1977-03-01

This report discusses the salient characteristics of driving schedules which are currently being used to determine automotive fuel economy, exhaust emissions, and component characteristics. The analyses discussed and the results reported highlight th...

Advanced Space Transportation Program (ASTP)

NASA Image and Video Library

2003-07-01

NASA's X-37 Approach and Landing Test Vehicle is installed is a structural facility at Boeing's Huntington Beach, California plant. Tests, completed in July, were conducted to verify the structural integrity of the vehicle in preparation for atmospheric flight tests. Atmospheric flight tests of the Approach and Landing Test Vehicle are scheduled for 2004 and flight tests of the Orbital Vehicle are scheduled for 2006. The X-37 experimental launch vehicle is roughly 27.5 feet (8.3 meters) long and 15 feet (4.5 meters) in wingspan. It's experiment bay is 7 feet (2.1 meters) long and 4 feet (1.2 meters) in diameter. Designed to operate in both the orbital and reentry phases of flight, the X-37 will increase both safety and reliability, while reducing launch costs from $10,000 per pound to $1,000.00 per pound. The X-37 program is managed by the Marshall Space Flight Center and built by the Boeing Company.

Decomposability and scalability in space-based observatory scheduling

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Stephen F.

1992-01-01

In this paper, we discuss issues of problem and model decomposition within the HSTS scheduling framework. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) scheduling problem, motivated by the limitations of the current solution and, more generally, the insufficiency of classical planning and scheduling approaches in this problem context. We first summarize the salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research. Then, we describe some key problem decomposition techniques supported by HSTS and underlying our integrated planning and scheduling approach, and we discuss the leverage they provide in solving space-based observatory scheduling problems.

Proposed Rule and Related Materials for Heavy-Duty Highway Program: Revisions for Emergency Vehicles and SCR Maintenance

EPA Pesticide Factsheets

May 23, 2012, Notice of Proposed Rulemaking with revisions related to emissions controls on diesel-powered emergency vehicles and revisions related to scheduled maintenance intervals for diesel engines and vehicles using Selective Catalytic Reduction (SCR)

41 CFR 101-39.303 - Maintenance.

Code of Federal Regulations, 2011 CFR

2011-07-01

... MANAGEMENT SYSTEMS 39.3-Use and Care of GSA Interagency Fleet Management System Vehicles § 101-39.303...) vehicles, safety and preventive maintenance inspections will be performed at regularly scheduled intervals as directed by GSA. Users of GSA IFMS vehicles shall comply with the safety and preventive...

AI techniques for a space application scheduling problem

NASA Technical Reports Server (NTRS)

Thalman, N.; Sparn, T.; Jaffres, L.; Gablehouse, D.; Judd, D.; Russell, C.

1991-01-01

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

Electric Vehicles Charging Scheduling Strategy Considering the Uncertainty of Photovoltaic Output

NASA Astrophysics Data System (ADS)

Wei, Xiangxiang; Su, Su; Yue, Yunli; Wang, Wei; He, Luobin; Li, Hao; Ota, Yutaka

2017-05-01

The rapid development of electric vehicles and distributed generation bring new challenges to security and economic operation of the power system, so the collaborative research of the EVs and the distributed generation have important significance in distribution network. Under this background, an EVs charging scheduling strategy considering the uncertainty of photovoltaic(PV) output is proposed. The characteristics of EVs charging are analysed first. A PV output prediction method is proposed with a PV database then. On this basis, an EVs charging scheduling strategy is proposed with the goal to satisfy EVs users’ charging willingness and decrease the power loss in distribution network. The case study proves that the proposed PV output prediction method can predict the PV output accurately and the EVs charging scheduling strategy can reduce the power loss and stabilize the fluctuation of the load in distributed network.

Emergency automatic signalling system using time scheduling

NASA Astrophysics Data System (ADS)

Rayavel, P.; Surenderanath, S.; Rathnavel, P.; Prakash, G.

2018-04-01

It is difficult to handle traffic congestion and maintain roads during traffic mainly in India. As the people migrate from rural to urban and sub-urban areas, it becomes still more critical. Presently Roadways is a standout amongst the most vital transportation. At the point when a car crash happens, crisis vehicles, for example, ambulances and fire trucks must rush to the mischance scene. There emerges a situation where a portion of the crisis vehicles may cause another car crash. Therefore it becomes still more difficult for emergency vehicle to reach the destination within a predicted time. To avoid that kind of problem we have come out with an effective idea which can reduce the potential in the traffic system. The traffic system is been modified using a wireless technology and high speed micro controller to provide smooth and clear flow of traffic for ambulance to reach the destination on time. This is achieved by using RFID Tag at the ambulance and RFID Reader at the traffic system i.e., traffic signal. This mainly deals with identifying the emergency vehicle and providing a green signal to traffic signal at time of traffic jam. — By assigning priorities to various traffic movements, we can control the traffic jam. In some moments like ambulance emergency, high delegates arrive people facing lot of trouble. To overcome this problem in this paper we propose a time priority based traffic system achieved by using RFID transmitter at the emergency vehicle and RFID receiver at the traffic system i.e., traffic signal. The signal from the emergency vehicle is sent to traffic system which after detecting it sends it to microcontroller which controls the traffic signal. If any emergency vehicle is detected the system goes to emergency system mode where signal switch to green and if it is not detected normal system mode.

40 CFR 86.1848-01 - Certification.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Provisions for Control of Air Pollution From New and In-Use Light-Duty Vehicles, Light-Duty Trucks, and... the implementation schedule shall not be covered by the certificate. (4) For incomplete light-duty... new light-duty vehicles, light-duty trucks, and complete heavy-duty vehicles must obtain a certificate...

Software for Planning Scientific Activities on Mars

NASA Technical Reports Server (NTRS)

Ai-Chang, Mitchell; Bresina, John; Jonsson, Ari; Hsu, Jennifer; Kanefsky, Bob; Morris, Paul; Rajan, Kanna; Yglesias, Jeffrey; Charest, Len; Maldague, Pierre

2003-01-01

Mixed-Initiative Activity Plan Generator (MAPGEN) is a ground-based computer program for planning and scheduling the scientific activities of instrumented exploratory robotic vehicles, within the limitations of available resources onboard the vehicle. MAPGEN is a combination of two prior software systems: (1) an activity-planning program, APGEN, developed at NASA s Jet Propulsion Laboratory and (2) the Europa planner/scheduler from NASA Ames Research Center. MAPGEN performs all of the following functions: Automatic generation of plans and schedules for scientific and engineering activities; Testing of hypotheses (or what-if analyses of various scenarios); Editing of plans; Computation and analysis of resources; and Enforcement and maintenance of constraints, including resolution of temporal and resource conflicts among planned activities. MAPGEN can be used in either of two modes: one in which the planner/scheduler is turned off and only the basic APGEN functionality is utilized, or one in which both component programs are used to obtain the full planning, scheduling, and constraint-maintenance functionality.

Application of IPAD to missile design

NASA Technical Reports Server (NTRS)

Santa, J. E.; Whiting, T. R.

1974-01-01

The application of an integrated program for aerospace-vehicle design (IPAD) to the design of a tactical missile is examined. The feasibility of modifying a proposed IPAD system for aircraft design work for use in missile design is evaluated. The tasks, cost, and schedule for the modification are presented. The basic engineering design process is described, explaining how missile design is achieved through iteration of six logical problem solving functions throughout the system studies, preliminary design, and detailed design phases of a new product. Existing computer codes used in various engineering disciplines are evaluated for their applicability to IPAD in missile design.

Noncontingent reinforcement without extinction plus differential reinforcement of alternative behavior during treatment of problem behavior.

PubMed

Fritz, Jennifer N; Jackson, Lynsey M; Stiefler, Nicole A; Wimberly, Barbara S; Richardson, Amy R

2017-07-01

The effects of noncontingent reinforcement (NCR) without extinction during treatment of problem behavior maintained by social positive reinforcement were evaluated for five individuals diagnosed with autism spectrum disorder. A continuous NCR schedule was gradually thinned to a fixed-time 5-min schedule. If problem behavior increased during NCR schedule thinning, a continuous NCR schedule was reinstated and NCR schedule thinning was repeated with differential reinforcement of alternative behavior (DRA) included. Results showed an immediate decrease in all participants' problem behavior during continuous NCR, and problem behavior maintained at low levels during NCR schedule thinning for three participants. Problem behavior increased and maintained at higher rates during NCR schedule thinning for two other participants; however, the addition of DRA to the intervention resulted in decreased problem behavior and increased mands. © 2017 Society for the Experimental Analysis of Behavior.

KENNEDY SPACE CENTER, FLA. - In the Orbiter Processing Facility, KSC employee Gene Peavler works in the wheel area on the orbiter Discovery. The vehicle has undergone Orbiter Major Modifications in the past year. Discovery is scheduled to fly on mission STS-121 to the International Space Station.

NASA Image and Video Library

2003-12-09

KENNEDY SPACE CENTER, FLA. - In the Orbiter Processing Facility, KSC employee Gene Peavler works in the wheel area on the orbiter Discovery. The vehicle has undergone Orbiter Major Modifications in the past year. Discovery is scheduled to fly on mission STS-121 to the International Space Station.

Orion GN and C Mitigation Efforts for Van Allen Radiation

NASA Technical Reports Server (NTRS)

King, Ellis T.; Jackson, Mark

2013-01-01

The Orion Crew Module (CM) is NASA's next generation manned space vehicle, scheduled to return humans to lunar orbit in the coming decade. The Orion avionics and GN&C architectures have progressed through a number of project phases and are nearing completion of a major milestone. The first unmanned test mission, dubbed "Exploration Flight Test One" (EFT-1) is scheduled to launch from NASA Kennedy Space Center late next year and provides the first integrated test of all the vehicle systems, avionics and software.

Radiology scheduling: preferences of users of radiologic services and impact on referral base and extension.

PubMed

Mozumdar, Biswita C; Hornsby, Douglas Neal; Gogate, Adheet S; Intriere, Lisa A; Hanson, Richard; McGreal, Karen; Kelly, Pauline; Ros, Pablo

2003-08-01

To study end-user attitudes and preferences with respect to radiology scheduling systems and to assess implications for retention and extension of the referral base. A study of the institution's historical data indicated reduced satisfaction with the process of patient scheduling in recent years. Sixty physicians who referred patients to a single, large academic radiology department received the survey. The survey was designed to identify (A) the preferred vehicle for patient scheduling (on-line versus telephone scheduling) and (B) whether ease of scheduling was a factor in physicians referring patients to other providers. Referring physicians were asked to forward the survey to any appropriate office staff member in case the latter scheduled appointments for patients. Users were asked to provide comments and suggestions for improvement. The statistical method used was the analysis of proportions. Thirty-three responses were received, corresponding to a return rate of 55%. Twenty-six of the 33 respondents (78.8%, P < .01) stated they were willing to try an online scheduling system; 16 of which tried the system. Twelve of the 16 (75%, P < .05) preferred the on-line application to the telephone system, stating logistical simplification as the primary reason for preference. Three (18.75%) did not consider online scheduling to be more convenient than traditional telephone scheduling. One respondent did not indicate any preference. Eleven of 33 users (33.33%, P < .001) stated that they would change radiology service providers if expectations of scheduling ease are not met. On-line scheduling applications are becoming the preferred scheduling vehicle. Augmenting their capabilities and availability can simplify the scheduling process, improve referring physician satisfaction, and provide a competitive advantage. Referrers are willing to change providers if scheduling expectations are not met.

40 CFR 86.215-94 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2010 CFR

2010-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1994 and Later Model Year Gasoline-Fueled New Light-Duty Vehicles, New Light-Duty Trucks and New Medium-Duty Passenger Vehicles; Cold Temperature Test Procedures § 86.215-94 EPA urban dynamometer...

41 CFR 102-34.280 - What State inspections must we have for Government motor vehicles?

Code of Federal Regulations, 2010 CFR

2010-07-01

... Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 34-MOTOR VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.280 What State... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What State inspections...

Performance of an Automated-Mixed-Traffic-Vehicle /AMTV/ System. [urban people mover

NASA Technical Reports Server (NTRS)

Peng, T. K. C.; Chon, K.

1978-01-01

This study analyzes the operation and evaluates the expected performance of a proposed automatic guideway transit system which uses low-speed Automated Mixed Traffic Vehicles (AMTV's). Vehicle scheduling and headway control policies are evaluated with a transit system simulation model. The effect of mixed-traffic interference on the average vehicle speed is examined with a vehicle-pedestrian interface model. Control parameters regulating vehicle speed are evaluated for safe stopping and passenger comfort.

Master-slave control scheme in electric vehicle smart charging infrastructure.

PubMed

Chung, Ching-Yen; Chynoweth, Joshua; Chu, Chi-Cheng; Gadh, Rajit

2014-01-01

WINSmartEV is a software based plug-in electric vehicle (PEV) monitoring, control, and management system. It not only incorporates intelligence at every level so that charge scheduling can avoid grid bottlenecks, but it also multiplies the number of PEVs that can be plugged into a single circuit. This paper proposes, designs, and executes many upgrades to WINSmartEV. These upgrades include new hardware that makes the level 1 and level 2 chargers faster, more robust, and more scalable. It includes algorithms that provide a more optimal charge scheduling for the level 2 (EVSE) and an enhanced vehicle monitoring/identification module (VMM) system that can automatically identify PEVs and authorize charging.

Master-Slave Control Scheme in Electric Vehicle Smart Charging Infrastructure

PubMed Central

Chung, Ching-Yen; Chynoweth, Joshua; Chu, Chi-Cheng; Gadh, Rajit

2014-01-01

WINSmartEV is a software based plug-in electric vehicle (PEV) monitoring, control, and management system. It not only incorporates intelligence at every level so that charge scheduling can avoid grid bottlenecks, but it also multiplies the number of PEVs that can be plugged into a single circuit. This paper proposes, designs, and executes many upgrades to WINSmartEV. These upgrades include new hardware that makes the level 1 and level 2 chargers faster, more robust, and more scalable. It includes algorithms that provide a more optimal charge scheduling for the level 2 (EVSE) and an enhanced vehicle monitoring/identification module (VMM) system that can automatically identify PEVs and authorize charging. PMID:24982956

Job shop scheduling problem with late work criterion

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

A Generalized Formulation of Demand Response under Market Environments

NASA Astrophysics Data System (ADS)

Nguyen, Minh Y.; Nguyen, Duc M.

2015-06-01

This paper presents a generalized formulation of Demand Response (DR) under deregulated electricity markets. The problem is scheduling and controls the consumption of electrical loads according to the market price to minimize the energy cost over a day. Taking into account the modeling of customers' comfort (i.e., preference), the formulation can be applied to various types of loads including what was traditionally classified as critical loads (e.g., air conditioning, lights). The proposed DR scheme is based on Dynamic Programming (DP) framework and solved by DP backward algorithm in which the stochastic optimization is used to treat the uncertainty, if any occurred in the problem. The proposed formulation is examined with the DR problem of different loads, including Heat Ventilation and Air Conditioning (HVAC), Electric Vehicles (EVs) and a newly DR on the water supply systems of commercial buildings. The result of simulation shows significant saving can be achieved in comparison with their traditional (On/Off) scheme.

An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

NASA Technical Reports Server (NTRS)

Moore, J. E.

1975-01-01

An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

U18 : Traffic signal safety (phase B).

DOT National Transportation Integrated Search

2009-08-01

Efficiently scheduling traffic, particularly heavy vehicles, remains a key challenge in transportation engineering. This project has focused on the development of a novel trafficsignal-control methodology to improve the safety of heavy vehicles on...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2011 CFR

2011-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2012 CFR

2012-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2010 CFR

2010-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2014 CFR

2014-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

Research on Production Scheduling System with Bottleneck Based on Multi-agent

NASA Astrophysics Data System (ADS)

Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke

Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.

Assured crew return capability Crew Emergency Return Vehicle (CERV) avionics

NASA Technical Reports Server (NTRS)

Myers, Harvey Dean

1990-01-01

The Crew Emergency Return Vehicle (CERV) is being defined to provide Assured Crew Return Capability (ACRC) for Space Station Freedom. The CERV, in providing the standby lifeboat capability, would remain in a dormat mode over long periods of time as would a lifeboat on a ship at sea. The vehicle must be simple, reliable, and constantly available to assure the crew's safety. The CERV must also provide this capability in a cost effective and affordable manner. The CERV Project philosophy of a simple vehicle is to maximize its useability by a physically deconditioned crew. The vehicle reliability goes unquestioned since, when needed, it is the vehicle of last resort. Therefore, its systems and subsystems must be simple, proven, state-of-the-art technology with sufficient redundancy to make it available for use as required for the life of the program. The CERV Project Phase 1'/2 Request for Proposal (RFP) is currently scheduled for release on October 2, 1989. The Phase 1'/2 effort will affirm the existing project requirements or amend and modify them based on a thorough evaluation of the contractor(s) recommendations. The system definition phase, Phase 2, will serve to define CERV systems and subsystems. The current CERV Project schedule has Phase 2 scheduled to begin October 1990. Since a firm CERV avionics design is not in place at this time, the treatment of the CERV avionics complement for the reference configuration is not intended to express a preference with regard to a system or subsystem.

Advanced rocket propulsion

NASA Technical Reports Server (NTRS)

Obrien, Charles J.

1993-01-01

Existing NASA research contracts are supporting development of advanced reinforced polymer and metal matrix composites for use in liquid rocket engines of the future. Advanced rocket propulsion concepts, such as modular platelet engines, dual-fuel dual-expander engines, and variable mixture ratio engines, require advanced materials and structures to reduce overall vehicle weight as well as address specific propulsion system problems related to elevated operating temperatures, new engine components, and unique operating processes. High performance propulsion systems with improved manufacturability and maintainability are needed for single stage to orbit vehicles and other high performance mission applications. One way to satisfy these needs is to develop a small engine which can be clustered in modules to provide required levels of total thrust. This approach should reduce development schedule and cost requirements by lowering hardware lead times and permitting the use of existing test facilities. Modular engines should also reduce operational costs associated with maintenance and parts inventories.

Cassini Orbiter and Huygens Probe aboard the Titan IV

NASA Technical Reports Server (NTRS)

1997-01-01

At Launch Complex 40 on Cape Canaveral Air Station, the Mobile Service Tower has been retracted away from the Titan IVB/Centaur carrying the Cassini spacecraft, marking a major milestone in the launch countdown sequence. Retraction of the structure began about an hour later than scheduled due to minor problems with ground support equipment. The launch vehicle, Cassini spacecraft and attached Centaur stage encased in a payload fairing, altogether stand about 183 feet tall; mounted at the base of the launch vehicle are two upgraded solid rocket motors. Liftoff of Cassini on the journey to Saturn and its moon Titan is slated to occur during a window opening at 4:55 a.m. EDT, Oct. 13, and extending through 7:15 a.m.

The Jet Propulsion Laboratory manages the U.S. contribution to the Cassini mission for NASA's Office of Space Science.

Preliminary power train design for a state-of-the-art electric vehicle

NASA Technical Reports Server (NTRS)

Ross, J. A.; Wooldridge, G. A.

1978-01-01

The state-of-the-art (SOTA) of electric vehicles built since 1965 was reviewed to establish a base for the preliminary design of a power train for a SOTA electric vehicle. The performance of existing electric vehicles were evaluated to establish preliminary specifications for a power train design using state-of-the-art technology and commercially available components. Power train components were evaluated and selected using a computer simulation of the SAE J227a Schedule D driving cycle. Predicted range was determined for a number of motor and controller combinations in conjunction with the mechanical elements of power trains and a battery pack of sixteen lead-acid batteries - 471.7 kg at 0.093 MJ/Kg (1040 lbs. at 11.7 Whr/lb). On the basis of maximum range and overall system efficiency using the Schedule D cycle, an induction motor and 3 phase inverter/controller was selected as the optimum combination when used with a two-speed transaxle and steel belted radial tires. The predicted Schedule D range is 90.4 km (56.2 mi). Four near term improvements to the SOTA were identified, evaluated, and predicted to increase range approximately 7%.

40 CFR Appendix Xv to Part 86 - Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test Schedule for...

Code of Federal Regulations, 2011 CFR

2011-07-01

... Acceptable Exhaust Regeneration Durability-Data Test Schedule for Diesel Cycle Vehicles Equipped With... Appendix XV to Part 86—Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test... = Total number of regeneration emission tests. (Subscript “s” refers to standard test schedule) 5. Refer...

40 CFR Appendix Xv to Part 86 - Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test Schedule for...

Code of Federal Regulations, 2012 CFR

2012-07-01

... Acceptable Exhaust Regeneration Durability-Data Test Schedule for Diesel Cycle Vehicles Equipped With... Appendix XV to Part 86—Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test... = Total number of regeneration emission tests. (Subscript “s” refers to standard test schedule) 5. Refer...

40 CFR Appendix Xv to Part 86 - Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test Schedule for...

Code of Federal Regulations, 2013 CFR

2013-07-01

... Acceptable Exhaust Regeneration Durability-Data Test Schedule for Diesel Cycle Vehicles Equipped With... Appendix XV to Part 86—Procedure for Determining an Acceptable Exhaust Regeneration Durability-Data Test... = Total number of regeneration emission tests. (Subscript “s” refers to standard test schedule) 5. Refer...

An Efficient Scheduling Scheme on Charging Stations for Smart Transportation

NASA Astrophysics Data System (ADS)

Kim, Hye-Jin; Lee, Junghoon; Park, Gyung-Leen; Kang, Min-Jae; Kang, Mikyung

This paper proposes a reservation-based scheduling scheme for the charging station to decide the service order of multiple requests, aiming at improving the satisfiability of electric vehicles. The proposed scheme makes it possible for a customer to reduce the charge cost and waiting time, while a station can extend the number of clients it can serve. A linear rank function is defined based on estimated arrival time, waiting time bound, and the amount of needed power, reducing the scheduling complexity. Receiving the requests from the clients, the power station decides the charge order by the rank function and then replies to the requesters with the waiting time and cost it can guarantee. Each requester can decide whether to charge at that station or try another station. This scheduler can evolve to integrate a new pricing policy and services, enriching the electric vehicle transport system.

Automated control of hierarchical systems using value-driven methods

NASA Technical Reports Server (NTRS)

Pugh, George E.; Burke, Thomas E.

1990-01-01

An introduction is given to the Value-driven methodology, which has been successfully applied to solve a variety of difficult decision, control, and optimization problems. Many real-world decision processes (e.g., those encountered in scheduling, allocation, and command and control) involve a hierarchy of complex planning considerations. For such problems it is virtually impossible to define a fixed set of rules that will operate satisfactorily over the full range of probable contingencies. Decision Science Applications' value-driven methodology offers a systematic way of automating the intuitive, common-sense approach used by human planners. The inherent responsiveness of value-driven systems to user-controlled priorities makes them particularly suitable for semi-automated applications in which the user must remain in command of the systems operation. Three examples of the practical application of the approach in the automation of hierarchical decision processes are discussed: the TAC Brawler air-to-air combat simulation is a four-level computerized hierarchy; the autonomous underwater vehicle mission planning system is a three-level control system; and the Space Station Freedom electrical power control and scheduling system is designed as a two-level hierarchy. The methodology is compared with rule-based systems and with other more widely-known optimization techniques.

A Sarsa(λ)-Based Control Model for Real-Time Traffic Light Coordination

PubMed Central

Zhu, Fei; Liu, Quan; Fu, Yuchen; Huang, Wei

2014-01-01

Traffic problems often occur due to the traffic demands by the outnumbered vehicles on road. Maximizing traffic flow and minimizing the average waiting time are the goals of intelligent traffic control. Each junction wants to get larger traffic flow. During the course, junctions form a policy of coordination as well as constraints for adjacent junctions to maximize their own interests. A good traffic signal timing policy is helpful to solve the problem. However, as there are so many factors that can affect the traffic control model, it is difficult to find the optimal solution. The disability of traffic light controllers to learn from past experiences caused them to be unable to adaptively fit dynamic changes of traffic flow. Considering dynamic characteristics of the actual traffic environment, reinforcement learning algorithm based traffic control approach can be applied to get optimal scheduling policy. The proposed Sarsa(λ)-based real-time traffic control optimization model can maintain the traffic signal timing policy more effectively. The Sarsa(λ)-based model gains traffic cost of the vehicle, which considers delay time, the number of waiting vehicles, and the integrated saturation from its experiences to learn and determine the optimal actions. The experiment results show an inspiring improvement in traffic control, indicating the proposed model is capable of facilitating real-time dynamic traffic control. PMID:24592183

Completable scheduling: An integrated approach to planning and scheduling

NASA Technical Reports Server (NTRS)

Gervasio, Melinda T.; Dejong, Gerald F.

1992-01-01

The planning problem has traditionally been treated separately from the scheduling problem. However, as more realistic domains are tackled, it becomes evident that the problem of deciding on an ordered set of tasks to achieve a set of goals cannot be treated independently of the problem of actually allocating resources to the tasks. Doing so would result in losing the robustness and flexibility needed to deal with imperfectly modeled domains. Completable scheduling is an approach which integrates the two problems by allowing an a priori planning module to defer particular planning decisions, and consequently the associated scheduling decisions, until execution time. This allows a completable scheduling system to maximize plan flexibility by allowing runtime information to be taken into consideration when making planning and scheduling decision. Furthermore, through the criteria of achievability placed on deferred decision, a completable scheduling system is able to retain much of the goal-directedness and guarantees of achievement afforded by a priori planning. The completable scheduling approach is further enhanced by the use of contingent explanation-based learning, which enables a completable scheduling system to learn general completable plans from example and improve its performance through experience. Initial experimental results show that completable scheduling outperforms classical scheduling as well as pure reactive scheduling in a simple scheduling domain.

STV fueling options

NASA Technical Reports Server (NTRS)

Flemming, Ken

1991-01-01

Lunar vehicles that will be space based and reusable will require resupply of propellants in orbit. Approximately 75 pct. of the total mass delivered to low earth orbit will be propellants. Consequently, the propellant management techniques selected for Space Exploration Initiative (SEI) orbital operations will have a major influence on the overall SEI architecture. Five proposed propellant management facility (PMF) concepts were analyzed and compared in order to determine the best method of resupplying reusable, space based Lunar Transfer Vehicles (LTVs). The processing time needed at the Space Station to prepare LTV for its next lunar mission was estimated for each of the PMF concepts. The estimated times required to assemble and maintain the different PMF concepts were also compared. The results of the maintenance analysis were similar, with co-orbiting depots needing 100 to 350 pct. more annual maintenance. The first few external tanks mating operations at KSC encountered many problems that could cause serious lunar mission schedule delays. The use of drop tanks on lunar vehicles increases by a factor of four the number of critical propellant interface disturbances.

Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

NASA Astrophysics Data System (ADS)

Buchner, Johannes

2011-12-01

Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the literature: The inability of a GA to properly improve schedules and the generation of schedules with frequent interruptions. Finally, we demonstrate the scheduling framework for several operating telescopes: (1) Dynamic re-scheduling with the AUT Warkworth 12m telescope, (2) Scheduling for the Australian Mopra 22m telescope and scheduling for the Allen Telescope Array. Furthermore, we discuss the applicability of the presented scheduling framework to the Atacama Large Millimeter/submillimeter Array (ALMA, in construction) and the SKA. In particular, during the development phase of the SKA, this dynamic, scalable scheduling framework can accommodate changing conditions.

Advanced Space Transportation Program (ASTP)

NASA Image and Video Library

2003-07-01

NASA's X-37 Approach and Landing Test Vehicle is installed is a structural facility at Boeing's Huntington Beach, California plant, where technicians make adjustments to composite panels. Tests, completed in July, were conducted to verify the structural integrity of the vehicle in preparation for atmospheric flight tests. Atmospheric flight tests of the Approach and Landing Test Vehicle are scheduled for 2004 and flight tests of the Orbital Vehicle are scheduled for 2006. The X-37 experimental launch vehicle is roughly 27.5 feet (8.3 meters) long and 15 feet (4.5 meters) in wingspan. It's experiment bay is 7 feet (2.1 meters) long and 4 feet (1.2 meters) in diameter. Designed to operate in both the orbital and reentry phases of flight, the X-37 will increase both safety and reliability, while reducing launch costs from $10,000 per pound to $1,000.00 per pound. The X-37 program is managed by the Marshall Space Flight Center and built by the Boeing Company.

Intelligent Transportation Systems/Commercial Vehicle Operations Project Plan For Commercial Vehicle Information Systems And Networks Electronic Data Interchange Standards Development And Deployment

DOT National Transportation Integrated Search

1996-12-02

THE PURPOSE OF THIS DOCUMENT IS TO PROVIDE INFORMATION ON THE PLANNING FOR THE DEVELOPMENT AND DEPLOYMENT OF EDI STANDARDS FOR COMMERCIAL VEHICLE INFORMATION SYSTEMS AND NETWORKS (CVISN). THE STATUS, PRIORITIES, AND SCHEDULES FOR THIS EFFORT ARE CONT...

Information Requirements Analyses for Transatmospheric Vehicles

DTIC Science & Technology

1992-06-01

include takeoff inclination, Mach number/fuel burn schedule , planned headings, planned altitudes, threat types/locations, communications satel- lite...network availability schedules , and P/L/target-specific mission events. The mission materials are transferred to the TAV by means of magnetic media...constraints. It also monitors actual fuel consumption, compares it against the mission fuel schedule , predicts rest-of-mission fuel consumption, and

Assessment of the Denver Regional Transportation District's automatic vehicle location system

DOT National Transportation Integrated Search

2000-08-01

The purpose of this evaluation was to determine how well the Denver Regional Transportation District's (RTD) automatic vehicle location (AVL) system achieved its major objectives of improving scheduling efficiency, improving the ability of dispatcher...

Hybrid powertrain controller

DOEpatents

Jankovic, Miroslava; Powell, Barry Kay

2000-12-26

A hybrid powertrain for a vehicle comprising a diesel engine and an electric motor in a parallel arrangement with a multiple ratio transmission located on the torque output side of the diesel engine, final drive gearing connecting drivably the output shaft of transmission to traction wheels of the vehicle, and an electric motor drivably coupled to the final drive gearing. A powertrain controller schedules fuel delivered to the diesel engine and effects a split of the total power available, a portion of the power being delivered by the diesel and the balance of the power being delivered by the motor. A shifting schedule for the multiple ratio transmission makes it possible for establishing a proportional relationship between accelerator pedal movement and torque desired at the wheels. The control strategy for the powertrain maintains drivability of the vehicle that resembles drivability of a conventional spark ignition vehicle engine powertrain while achieving improved fuel efficiency and low exhaust gas emissions.

Experiences in Delta mission planning

NASA Technical Reports Server (NTRS)

Kork, J.

1981-01-01

The Delta launch vehicle has experienced 153 successful launches since 1960 and 40 more are scheduled. Relying on up-to-date technology and proven flight hardware, the Delta vehicle has been used for low to high circular and geosynchronous transfer orbits, high elliptic probes, and lunar and planetary missions. A history of Delta launches and configuration modifications is presented, noting a 92-95% success rate and its cost effective role in reimbursable missions. Elements of mission planning such as feasibility studies (1-3 yrs), spacecraft restraints manuals, reference trajectories, preliminary mission analysis, detailed test objectives, range/safety studies, guided nominal trajectory, and mission specific studies are discussed. Trajectory shaping determines vehicle and spacecraft restraints, optimizes the trajectory, and maximizes the payload capabilities. Improvements in the Delta vehicle have boosted payloads from 100 to 2890 lbs., improving the price per pound ratio, as costs have risen, only by a factor of three. Current launch schedules extend well into 1985.

Lessons Learned from Ares I Upper Stage Structures and Thermal Design

NASA Technical Reports Server (NTRS)

Ahmed, Rafiq

2012-01-01

The Ares 1 Upper Stage was part of the vehicle intended to succeed the Space Shuttle as the United States manned spaceflight vehicle. Although the Upper Stage project was cancelled, there were many lessons learned that are applicable to future vehicle design. Lessons learned that are briefly detailed in this Technical Memorandum are for specific technical areas such as tank design, common bulkhead design, thrust oscillation, control of flight and slosh loads, purge and hazardous gas system. In addition, lessons learned from a systems engineering and vehicle integration perspective are also included, such as computer aided design and engineering, scheduling, and data management. The need for detailed systems engineering in the early stages of a project is emphasized throughout this report. The intent is that future projects will be able to apply these lessons learned to keep costs down, schedules brief, and deliver products that perform to the expectations of their customers.

An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint

NASA Technical Reports Server (NTRS)

Garcia, Christopher; Rabadi, Ghaith

2010-01-01

Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.

An Implicit Enumeration Algorithm with Binary-Valued Constraints.

DTIC Science & Technology

1986-03-01

problems is the National Basketball Association ( NBA -) schedul- ing problems developed by Bean (1980), as discussed in detail in the Appendix. These...fY! X F L- %n~ P ’ % -C-10 K7 K: K7 -L- -7".i - W. , W V APPENDIX The NBA Scheduling Problem §A.1 Formulation The National Basketball Association...16 2.2 4.9 40.2 15.14 §6.2.3 NBA Scheduling Problem The last set of testing problems involves the NBA scheduling problem. A detailed description of

Performance comparison of some evolutionary algorithms on job shop scheduling problems

NASA Astrophysics Data System (ADS)

Mishra, S. K.; Rao, C. S. P.

2016-09-01

Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

North Cascades Stehekin Valley Vehicle Decision Document.

DOT National Transportation Integrated Search

2007-08-31

This document serves as technical substantiation in support of a procurement for a fleet of vehicles to be used to operate a scheduled shuttle operation with multiple stops at North Cascades National Park Service Complex (NOCA), in the Stehekin Valle...

49 CFR Appendix B to Part 213 - Schedule of Civil Penalties

Code of Federal Regulations, 2010 CFR

2010-10-01

...,500 213.333 Automated vehicle inspection systems 5,000 7,500 213.335 Crossties (a) Material used 1,000....343 Continuous welded rail (a) through (h) 5,000 7,500 213.345 Vehicle qualification testing (a...

Fundamental research in artificial intelligence at NASA

NASA Technical Reports Server (NTRS)

Friedland, Peter

1990-01-01

This paper describes basic research at NASA in the field of artificial intelligence. The work is conducted at the Ames Research Center and the Jet Propulsion Laboratory, primarily under the auspices of the NASA-wide Artificial Intelligence Program in the Office of Aeronautics, Exploration and Technology. The research is aimed at solving long-term NASA problems in missions operations, spacecraft autonomy, preservation of corporate knowledge about NASA missions and vehicles, and management/analysis of scientific and engineering data. From a scientific point of view, the research is broken into the categories of: planning and scheduling; machine learning; and design of and reasoning about large-scale physical systems.

Compiling Planning into Scheduling: A Sketch

NASA Technical Reports Server (NTRS)

Bedrax-Weiss, Tania; Crawford, James M.; Smith, David E.

2004-01-01

Although there are many approaches for compiling a planning problem into a static CSP or a scheduling problem, current approaches essentially preserve the structure of the planning problem in the encoding. In this pape: we present a fundamentally different encoding that more accurately resembles a scheduling problem. We sketch the approach and argue, based on an example, that it is possible to automate the generation of such an encoding for problems with certain properties and thus produce a compiler of planning into scheduling problems. Furthermore we argue that many NASA problems exhibit these properties and that such a compiler would provide benefits to both theory and practice.

Effects of sleep schedules on commercial motor vehicle driver performance : part 1

DOT National Transportation Integrated Search

2000-09-01

The Federal Motor Carrier Safety Administration sponsored a study to gather and analyze data on commercial motor vehicle (CMV) driver rest and recovery cycles, effects of partial sleep deprivation, and prediction of subsequent performance. The study ...

Effects of sleep schedules on commercial motor vehicle driver performance : part 2

DOT National Transportation Integrated Search

2000-09-01

The Federal Motor Carrier Safety Administration sponsored a study to gather and analyze data on commercial motor vehicle driver rest and recovery cycles, effects of partial sleep deprivation, and prediction of subsequent performance. The study began ...

A Clonal Selection Algorithm for Minimizing Distance Travel and Back Tracking of Automatic Guided Vehicles in Flexible Manufacturing System

NASA Astrophysics Data System (ADS)

Chawla, Viveak Kumar; Chanda, Arindam Kumar; Angra, Surjit

2018-03-01

The flexible manufacturing system (FMS) constitute of several programmable production work centers, material handling systems (MHSs), assembly stations and automatic storage and retrieval systems. In FMS, the automatic guided vehicles (AGVs) play a vital role in material handling operations and enhance the performance of the FMS in its overall operations. To achieve low makespan and high throughput yield in the FMS operations, it is highly imperative to integrate the production work centers schedules with the AGVs schedules. The Production schedule for work centers is generated by application of the Giffler and Thompson algorithm under four kind of priority hybrid dispatching rules. Then the clonal selection algorithm (CSA) is applied for the simultaneous scheduling to reduce backtracking as well as distance travel of AGVs within the FMS facility. The proposed procedure is computationally tested on the benchmark FMS configuration from the literature and findings from the investigations clearly indicates that the CSA yields best results in comparison of other applied methods from the literature.

KENNEDY SPACE CENTER, FLA. - In the Vehicle Assembly Building, after being removed from the solid rocket booster (SRB), the forward assembly is lowered toward a transporter below in the transfer aisle. The destacking is part of time and cycle activities. The SRB was part of the stack on Atlantis originally scheduled for a March 1, 2003, launch on mission STS-114. The SRBs and external tank were demated in February 2003. The mission is now scheduled to occur no earlier than Sept. 12, 2004, on Atlantis.

NASA Image and Video Library

2003-12-09

KENNEDY SPACE CENTER, FLA. - In the Vehicle Assembly Building, after being removed from the solid rocket booster (SRB), the forward assembly is lowered toward a transporter below in the transfer aisle. The destacking is part of time and cycle activities. The SRB was part of the stack on Atlantis originally scheduled for a March 1, 2003, launch on mission STS-114. The SRBs and external tank were demated in February 2003. The mission is now scheduled to occur no earlier than Sept. 12, 2004, on Atlantis.

KENNEDY SPACE CENTER, FLA. - In the Vehicle Assembly Building, after being removed from the solid rocket booster (SRB), the forward assembly is lowered from high above the transfer aisle. The destacking is part of time and cycle activities. The SRB was part of the stack on Atlantis originally scheduled for a March 1, 2003, launch on mission STS-114. The SRBs and external tank were demated in February 2003. The mission is now scheduled to occur no earlier than Sept. 12, 2004, on Atlantis.

NASA Image and Video Library

2003-12-09

KENNEDY SPACE CENTER, FLA. - In the Vehicle Assembly Building, after being removed from the solid rocket booster (SRB), the forward assembly is lowered from high above the transfer aisle. The destacking is part of time and cycle activities. The SRB was part of the stack on Atlantis originally scheduled for a March 1, 2003, launch on mission STS-114. The SRBs and external tank were demated in February 2003. The mission is now scheduled to occur no earlier than Sept. 12, 2004, on Atlantis.

Multi-time scale control of demand flexibility in smart distribution networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhattarai, Bishnu; Myers, Kurt; Bak-Jensen, Birgitte

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distributionmore » network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.« less

Multi-time scale control of demand flexibility in smart distribution networks

DOE PAGES

Bhattarai, Bishnu; Myers, Kurt; Bak-Jensen, Birgitte; ...

2017-01-01

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distributionmore » network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.« less

Bridging the Gap Between Planning and Scheduling

NASA Technical Reports Server (NTRS)

Smith, David E.; Frank, Jeremy; Jonsson, Ari K.; Norvig, Peter (Technical Monitor)

2000-01-01

Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

Interactive computer aided shift scheduling.

PubMed

Gaertner, J

2001-12-01

This paper starts with a discussion of computer aided shift scheduling. After a brief review of earlier approaches, two conceptualizations of this field are introduced: First, shift scheduling as a field that ranges from extremely stable rosters at one pole to rather market-like approaches on the other pole. Unfortunately, already small alterations of a scheduling problem (e.g., the number of groups, the number of shifts) may call for rather different approaches and tools. Second, their environment shapes scheduling problems and scheduling has to be done within idiosyncratic organizational settings. This calls for the amalgamation of scheduling with other tasks (e.g., accounting) and for reflections whether better solutions might become possible by changes in the problem definition (e.g., other service levels, organizational changes). Therefore shift scheduling should be understood as a highly connected problem. Building upon these two conceptualizations, a few examples of software that ease scheduling in some areas of this field are given and future research questions are outlined.

An Enabling Technology for New Planning and Scheduling Paradigms

NASA Technical Reports Server (NTRS)

Jaap, John; Davis, Elizabeth

2004-01-01

The Night Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called ?ask models," from the scientists and technologists for the tasks that are to be scheduled. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next, a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, the models are modified to be compatible with the scheduling engine. Then the models are submitted to the scheduling engine for automatic scheduling or, when requirements are expressed in notes, the timeline is built manually. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components: (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphical methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the intervention of a scheduling expert. The algorithm is tuned for the constraint hierarchies and the complex temporal relationships provided by the modeling schema. It has an extensive search algorithm that can exploit timing flexibilities and constraint and relationship options. (3) An innovative architecture allows multiple remote users to simultaneously model science and technology requirements and other users to model vehicle and hardware characteristics. The architecture allows the remote users to submit scheduling requests directly to the scheduling engine and immediately see the results. These three components are integrated so that science and technology experts with no knowledge of the vehicle or hardware subsystems and no knowledge of the internal workings of the scheduling engine have the ability to build and submit scheduling requests and see the results. The immediate feedback will hone the users' modeling skills and ultimately enable them to produce the desired timeline. This paper summarizes the three components of the enabling technology and describes how this technology would make a new paradigm possible.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

Integrated scheduling and resource management. [for Space Station Information System

NASA Technical Reports Server (NTRS)

Ward, M. T.

1987-01-01

This paper examines the problem of integrated scheduling during the Space Station era. Scheduling for Space Station entails coordinating the support of many distributed users who are sharing common resources and pursuing individual and sometimes conflicting objectives. This paper compares the scheduling integration problems of current missions with those anticipated for the Space Station era. It examines the facilities and the proposed operations environment for Space Station. It concludes that the pattern of interdependecies among the users and facilities, which are the source of the integration problem is well structured, allowing a dividing of the larger problem into smaller problems. It proposes an architecture to support integrated scheduling by scheduling efficiently at local facilities as a function of dependencies with other facilities of the program. A prototype is described that is being developed to demonstrate this integration concept.

Crew Integration & Automation Testbed and Robotic Follower Programs

DTIC Science & Technology

2001-05-30

Evolving Technologies for Reduced Crew Operation” Vehicle Tech Demo #1 (VTT) Vehicle Tech Demo #2 ( CAT ATD) Two Man Transition Future Combat...Simulation Advanced Electronic Architecture Concept Vehicle Shown with Onboard Safety Driver Advanced Interfaces CAT ATD Exit Criteria...Provide 1000 Hz control loop for critical real-time tasks CAT Workload IPT Process and Product Schedule Crew Task List Task Timelines Workload Analysis

Applications of dynamic scheduling technique to space related problems: Some case studies

NASA Astrophysics Data System (ADS)

Nakasuka, Shinichi; Ninomiya, Tetsujiro

1994-10-01

The paper discusses the applications of 'Dynamic Scheduling' technique, which has been invented for the scheduling of Flexible Manufacturing System, to two space related scheduling problems: operation scheduling of a future space transportation system, and resource allocation in a space system with limited resources such as space station or space shuttle.

Space Technology Mission Directorate: Game Changing Development

NASA Technical Reports Server (NTRS)

Gaddis, Stephen W.

2015-01-01

NASA and the aerospace community have deep roots in manufacturing technology and innovation. Through it's Game Changing Development Program and the Advanced Manufacturing Technology Project NASA develops and matures innovative, low-cost manufacturing processes and products. Launch vehicle propulsion systems are a particular area of interest since they typically comprise a large percentage of the total vehicle cost and development schedule. NASA is currently working to develop and utilize emerging technologies such as additive manufacturing (i.e. 3D printing) and computational materials and processing tools that could dramatically improve affordability, capability, and reduce schedule for rocket propulsion hardware.

Gain-Scheduled Complementary Filter Design for a MEMS Based Attitude and Heading Reference System

PubMed Central

Yoo, Tae Suk; Hong, Sung Kyung; Yoon, Hyok Min; Park, Sungsu

2011-01-01

This paper describes a robust and simple algorithm for an attitude and heading reference system (AHRS) based on low-cost MEMS inertial and magnetic sensors. The proposed approach relies on a gain-scheduled complementary filter, augmented by an acceleration-based switching architecture to yield robust performance, even when the vehicle is subject to strong accelerations. Experimental results are provided for a road captive test during which the vehicle dynamics are in high-acceleration mode and the performance of the proposed filter is evaluated against the output from a conventional linear complementary filter. PMID:22163824

Solving a real-world problem using an evolving heuristically driven schedule builder.

PubMed

Hart, E; Ross, P; Nelson, J

1998-01-01

This work addresses the real-life scheduling problem of a Scottish company that must produce daily schedules for the catching and transportation of large numbers of live chickens. The problem is complex and highly constrained. We show that it can be successfully solved by division into two subproblems and solving each using a separate genetic algorithm (GA). We address the problem of whether this produces locally optimal solutions and how to overcome this. We extend the traditional approach of evolving a "permutation + schedule builder" by concentrating on evolving the schedule builder itself. This results in a unique schedule builder being built for each daily scheduling problem, each individually tailored to deal with the particular features of that problem. This results in a robust, fast, and flexible system that can cope with most of the circumstances imaginable at the factory. We also compare the performance of a GA approach to several other evolutionary methods and show that population-based methods are superior to both hill-climbing and simulated annealing in the quality of solutions produced. Population-based methods also have the distinct advantage of producing multiple, equally fit solutions, which is of particular importance when considering the practical aspects of the problem.

18. Photocopy of drawing (1961 architectural drawing by Kaiser Engineers) ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

18. Photocopy of drawing (1961 architectural drawing by Kaiser Engineers) FLOOR PLAN, ELEVATIONS, AND SCHEDULE FOR VEHICLE SUPPORT BUILDING, SHEET A-1 - Vandenberg Air Force Base, Space Launch Complex 3, Vehicle Support Building, Napa & Alden Roads, Lompoc, Santa Barbara County, CA

Testing Task Schedulers on Linux System

NASA Astrophysics Data System (ADS)

Jelenković, Leonardo; Groš, Stjepan; Jakobović, Domagoj

Testing task schedulers on Linux operating system proves to be a challenging task. There are two main problems. The first one is to identify which properties of the scheduler to test. The second problem is how to perform it, e.g., which API to use that is sufficiently precise and in the same time supported on most platforms. This paper discusses the problems in realizing test framework for testing task schedulers and presents one potential solution. Observed behavior of the scheduler is the one used for “normal” task scheduling (SCHED_OTHER), unlike one used for real-time tasks (SCHED_FIFO, SCHED_RR).

Blockade of α2-adrenergic receptors in prelimbic cortex: impact on cocaine self-administration in adult spontaneously hypertensive rats following adolescent atomoxetine treatment.

PubMed

Baskin, Britahny M; Nic Dhonnchadha, Bríd Á; Dwoskin, Linda P; Kantak, Kathleen M

2017-10-01

Research with the spontaneously hypertensive rat (SHR) model of attention deficit/hyperactivity disorder demonstrated that chronic methylphenidate treatment during adolescence increased cocaine self-administration established during adulthood under a progressive ratio (PR) schedule. Compared to vehicle, chronic atomoxetine treatment during adolescence failed to increase cocaine self-administration under a PR schedule in adult SHR. We determined if enhanced noradrenergic transmission at α2-adrenergic receptors within prefrontal cortex contributes to this neutral effect of adolescent atomoxetine treatment in adult SHR. Following treatment from postnatal days 28-55 with atomoxetine (0.3 mg/kg) or vehicle, adult male SHR and control rats from Wistar-Kyoto (WKY) and Wistar (WIS) strains were trained to self-administer 0.3 mg/kg cocaine. Self-administration performance was evaluated under a PR schedule of cocaine delivery following infusion of the α2-adrenergic receptor antagonist idazoxan (0 and 10-56 μg/side) directly into prelimbic cortex. Adult SHR attained higher PR break points and had greater numbers of active lever responses and infusions than WKY and WIS. Idazoxan dose-dependently increased PR break points and active lever responses in SHR following adolescent atomoxetine vs. vehicle treatment. Behavioral changes were negligible after idazoxan pretreatment in SHR following adolescent vehicle or in WKY and WIS following adolescent atomoxetine or vehicle. α2-Adrenergic receptor blockade in prelimbic cortex of SHR masked the expected neutral effect of adolescent atomoxetine on adult cocaine self-administration behavior. Moreover, greater efficacy of acute idazoxan challenge in adult SHR after adolescent atomoxetine relative to vehicle is consistent with the idea that chronic atomoxetine may downregulate presynaptic α2A-adrenergic autoreceptors in SHR.

Cellular-V2X Communications for Platooning: Design and Evaluation.

PubMed

Nardini, Giovanni; Virdis, Antonio; Campolo, Claudia; Molinaro, Antonella; Stea, Giovanni

2018-05-11

Platooning is a cooperative driving application where autonomous/semi-autonomous vehicles move on the same lane in a train-like manner, keeping a small constant inter-vehicle distance, in order to reduce fuel consumption and gas emissions and to achieve safe and efficient transport. To this aim, they may exploit multiple on-board sensors (e.g., radars, LiDARs, positioning systems) and direct vehicle-to-vehicle communications to synchronize their manoeuvres. The main objective of this paper is to discuss the design choices and factors that determine the performance of a platooning application, when exploiting the emerging cellular vehicle-to-everything (C-V2X) communication technology and considering the scheduled mode, specified by 3GPP for communications over the sidelink assisted by the eNodeB. Since no resource management algorithm is currently mandated by 3GPP for this new challenging context, we focus on analyzing the feasibility and performance of the dynamic scheduling approach, with platoon members asking for radio resources on a per-packet basis. We consider two ways of implementing dynamic scheduling, currently unspecified by 3GPP: the sequential mode, that is somehow reminiscent of time division multiple access solutions based on IEEE 802.11p-till now the only investigated access technology for platooning-and the simultaneous mode with spatial frequency reuse enabled by the eNodeB. The evaluation conducted through system-level simulations provides helpful insights about the proposed configurations and C-V2X parameter settings that mainly affect the reliability and latency performance of data exchange in platoons, under different load settings. Achieved results show that the proposed simultaneous mode succeeds in reducing the latency in the update cycle in each vehicle's controller, thus enabling future high-density platooning scenarios.

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

GEOTAIL Spacecraft historical data report

NASA Technical Reports Server (NTRS)

Boersig, George R.; Kruse, Lawrence F.

1993-01-01

The purpose of this GEOTAIL Historical Report is to document ground processing operations information gathered on the GEOTAIL mission during processing activities at the Cape Canaveral Air Force Station (CCAFS). It is hoped that this report may aid management analysis, improve integration processing and forecasting of processing trends, and reduce real-time schedule changes. The GEOTAIL payload is the third Delta 2 Expendable Launch Vehicle (ELV) mission to document historical data. Comparisons of planned versus as-run schedule information are displayed. Information will generally fall into the following categories: (1) payload stay times (payload processing facility/hazardous processing facility/launch complex-17A); (2) payload processing times (planned, actual); (3) schedule delays; (4) integrated test times (experiments/launch vehicle); (5) unique customer support requirements; (6) modifications performed at facilities; (7) other appropriate information (Appendices A & B); and (8) lessons learned (reference Appendix C).

Efficacy of osmoprotectants on prevention and treatment of murine dry eye.

PubMed

Chen, Wei; Zhang, Xin; Li, Jinyang; Wang, Yu; Chen, Qi; Hou, Chao; Garrett, Qian

2013-09-19

To evaluate the efficacy of osmoprotectants on prevention and treatment of dry eye in a murine model. Dry eye was induced in mice by using an intelligently controlled environmental system (ICES). Osmoprotectants betaine, L-carnitine, erythritol, or vehicle (PBS) were topically administered to eyes four times daily following two schedules: schedule 1 (modeling prevention): dosing started at the beginning of housing in ICES and lasted for 21 or 35 days; schedule 2 (modeling treatment): dosing started after ICES-housed mice developed dry eye (day 21), continuing until day 35. Treatment efficacy was evaluated for corneal fluorescein staining; corneal epithelial apoptosis by TUNEL and caspase-3 assays; goblet cell numbers by PAS staining; and expression of inflammatory mediators, TNF-α, IL-17, IL-6, or IL-1β by using RT-PCR on days 0, 14, 21, and/or 35. Compared with vehicle, prophylactic administration of betaine, L-carnitine, or erythritol significantly decreased corneal staining and expression of TNF-α and IL-17 on day 21 (schedule 1). Treatment of mouse dry eye with osmoprotectants significantly reduced corneal staining on day 35 compared with day 21 (schedule 2). Relative to vehicle, L-carnitine treatment of mouse dry eye for 14 days (days 21 to 35) resulted in a significant reduction in corneal staining, number of TUNEL-positive cells, and expression of TNF-α, IL-17, IL-6, or IL-1β, as well as significantly increased the number of goblet cells. Topical application of betaine, L-carnitine, or erythritol systematically limited progression of environmentally induced dry eye. L-carnitine can also reduce the severity of such dry-eye conditions.

National Space Transportation System (NSTS) technology needs

NASA Technical Reports Server (NTRS)

Winterhalter, David L.; Ulrich, Kimberly K.

1990-01-01

The National Space Transportation System (NSTS) is one of the Nation's most valuable resources, providing manned transportation to and from space in support of payloads and scientific research. The NSTS program is currently faced with the problem of hardware obsolescence, which could result in unacceptable schedule and cost impacts to the flight program. Obsolescence problems occur because certain components are no longer being manufactured or repair turnaround time is excessive. In order to achieve a long-term, reliable transportation system that can support manned access to space through 2010 and beyond, NASA must develop a strategic plan for a phased implementation of enhancements which will satisfy this long-term goal. The NSTS program has initiated the Assured Shuttle Availability (ASA) project with the following objectives: eliminate hardware obsolescence in critical areas, increase reliability and safety of the vehicle, decrease operational costs and turnaround time, and improve operational capability. The strategy for ASA will be to first meet the mandatory needs - keep the Shuttle flying. Non-mandatory changes that will improve operational capability and enhance performance will then be considered if funding is adequate. Upgrade packages should be developed to install within designated inspection periods, grouped in a systematic approach to reduce cost and schedule impacts, and allow the capability to provide a Block 2 Shuttle (Phase 3).

Two-machine flow shop scheduling integrated with preventive maintenance planning

NASA Astrophysics Data System (ADS)

Wang, Shijin; Liu, Ming

2016-02-01

This paper investigates an integrated optimisation problem of production scheduling and preventive maintenance (PM) in a two-machine flow shop with time to failure of each machine subject to a Weibull probability distribution. The objective is to find the optimal job sequence and the optimal PM decisions before each job such that the expected makespan is minimised. To investigate the value of integrated scheduling solution, computational experiments on small-scale problems with different configurations are conducted with total enumeration method, and the results are compared with those of scheduling without maintenance but with machine degradation, and individual job scheduling combined with independent PM planning. Then, for large-scale problems, four genetic algorithm (GA) based heuristics are proposed. The numerical results with several large problem sizes and different configurations indicate the potential benefits of integrated scheduling solution and the results also show that proposed GA-based heuristics are efficient for the integrated problem.

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

NASA Technical Reports Server (NTRS)

Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna

2003-01-01

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Oral drug self-administration: an overview of laboratory animal studies.

PubMed

Meisch, R A

2001-06-01

Many abused drugs can be established as orally delivered reinforcers for rhesus monkeys and other animals. Benzodiazepines, barbiturates, opioids, psychomotor stimulants, dissociative anesthetics, and ethanol can come to serve as reinforcers when taken by mouth. The principal problems in establishing drugs as reinforcers by the oral route of administration are (1) aversive taste, (2) delay in onset of central nervous system effects, and (3) consumption of low volumes of drug solution. Strategies have been devised to successfully overcome these problems, and orally delivered drugs can be established as effective reinforcers. Reinforcing actions are demonstrated by consumption of greater volumes of drug solution than volumes of the water vehicle, and supporting evidence for reinforcing effects consists of the maintenance of behavior under intermittent schedules of reinforcement and the generation of orderly dose-response functions. This article presents an overview of studies of behavior reinforced by oral drug reinforcement. Factors that control oral drug intake include dose, schedule of reinforcement, food restriction, and alternative reinforcers. Many drugs, administered by the experimenter, can alter oral drug reinforcement. Relative reinforcing effects can be assessed by choice procedures and by persistence of behavior across increases in schedule size. In general, reinforcing effects increase directly with dose. Rhesus monkeys prefer combinations of reinforcing drugs to the component drugs. The taste of drug solutions may act as a conditioned reinforcer and a discriminative stimulus. Consequences of drug intake include tolerance and physiological dependence. Findings with orally self-administered drugs are similar to many findings with other positive reinforcers, including intravenously self-administered drugs.

40 CFR 86.215-94 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 40 Protection of Environment 18 2011-07-01 2011-07-01 false EPA urban dynamometer driving schedule. 86.215-94 Section 86.215-94 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR... New Medium-Duty Passenger Vehicles; Cold Temperature Test Procedures § 86.215-94 EPA urban dynamometer...

40 CFR Appendix I to Part 600 - Highway Fuel Economy Driving Schedule

Code of Federal Regulations, 2013 CFR

2013-07-01

... 40 Protection of Environment 31 2013-07-01 2013-07-01 false Highway Fuel Economy Driving Schedule I Appendix I to Part 600 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) ENERGY POLICY FUEL ECONOMY AND GREENHOUSE GAS EXHAUST EMISSIONS OF MOTOR VEHICLES Pt. 600, App. I...

40 CFR Appendix I to Part 600 - Highway Fuel Economy Driving Schedule

Code of Federal Regulations, 2012 CFR

2012-07-01

... 40 Protection of Environment 31 2012-07-01 2012-07-01 false Highway Fuel Economy Driving Schedule I Appendix I to Part 600 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) ENERGY POLICY FUEL ECONOMY AND GREENHOUSE GAS EXHAUST EMISSIONS OF MOTOR VEHICLES Pt. 600, App. I...

40 CFR Appendix I to Part 600 - Highway Fuel Economy Driving Schedule

Code of Federal Regulations, 2014 CFR

2014-07-01

... 40 Protection of Environment 30 2014-07-01 2014-07-01 false Highway Fuel Economy Driving Schedule I Appendix I to Part 600 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) ENERGY POLICY FUEL ECONOMY AND GREENHOUSE GAS EXHAUST EMISSIONS OF MOTOR VEHICLES Pt. 600, App. I...

Design, synthesis, manufacturing, and testing of a competitive FHSAE vehicle.

DOT National Transportation Integrated Search

2012-06-01

The goal of this multi-year project is to create a fully functional University of Idaho entry in the hybrid FSAE competition scheduled for : 2012. Vehicle integration has been completed as part of a variety of 2010-2011 senior design projects and 201...

Batteries for Electric Vehicles

NASA Technical Reports Server (NTRS)

Conover, R. A.

1985-01-01

Report summarizes results of test on "near-term" electrochemical batteries - (batteries approaching commercial production). Nickel/iron, nickel/zinc, and advanced lead/acid batteries included in tests and compared with conventional lead/acid batteries. Batteries operated in electric vehicles at constant speed and repetitive schedule of accerlerating, coasting, and braking.

0-6629 : Texas specific drive cycles and idle emissions rates for using with EPA's MOVES model, [project summary].

DOT National Transportation Integrated Search

2013-08-01

The U.S. Environmental Protection Agencys : newest emissions model, Motor Vehicle Emission : Simulator (MOVES), enables users to use local : drive schedules(representative vehicle speed : profiles) in order to perform an accurate analysis : of emi...

19 CFR 115.16 - Notification of Certifying Authority by manufacturer.

Code of Federal Regulations, 2013 CFR

2013-04-01

... SECURITY; DEPARTMENT OF THE TREASURY CARGO CONTAINER AND ROAD VEHICLE CERTIFICATION PURSUANT TO.... In order that the Certifying Authority can schedule an appropriate inspection, a manufacturer shall give notification to that Authority before each production run of road vehicles or containers to be...

19 CFR 115.16 - Notification of Certifying Authority by manufacturer.

Code of Federal Regulations, 2010 CFR

2010-04-01

... SECURITY; DEPARTMENT OF THE TREASURY CARGO CONTAINER AND ROAD VEHICLE CERTIFICATION PURSUANT TO.... In order that the Certifying Authority can schedule an appropriate inspection, a manufacturer shall give notification to that Authority before each production run of road vehicles or containers to be...

19 CFR 115.16 - Notification of Certifying Authority by manufacturer.

Code of Federal Regulations, 2012 CFR

2012-04-01

... SECURITY; DEPARTMENT OF THE TREASURY CARGO CONTAINER AND ROAD VEHICLE CERTIFICATION PURSUANT TO.... In order that the Certifying Authority can schedule an appropriate inspection, a manufacturer shall give notification to that Authority before each production run of road vehicles or containers to be...

19 CFR 115.16 - Notification of Certifying Authority by manufacturer.

Code of Federal Regulations, 2014 CFR

2014-04-01

... SECURITY; DEPARTMENT OF THE TREASURY CARGO CONTAINER AND ROAD VEHICLE CERTIFICATION PURSUANT TO.... In order that the Certifying Authority can schedule an appropriate inspection, a manufacturer shall give notification to that Authority before each production run of road vehicles or containers to be...

19 CFR 115.16 - Notification of Certifying Authority by manufacturer.

Code of Federal Regulations, 2011 CFR

2011-04-01

... SECURITY; DEPARTMENT OF THE TREASURY CARGO CONTAINER AND ROAD VEHICLE CERTIFICATION PURSUANT TO.... In order that the Certifying Authority can schedule an appropriate inspection, a manufacturer shall give notification to that Authority before each production run of road vehicles or containers to be...

Mars Pathfinder flight system integration and test.

NASA Astrophysics Data System (ADS)

Muirhead, B. K.

This paper describes the system integration and test experiences, problems and lessons learned during the assembly, test and launch operations (ATLO) phase of the Mars Pathfinder flight system scheduled to land on the surface of Mars on July 4, 1997. The Mars Pathfinder spacecraft consists of three spacecraft systems: cruise stage, entry vehicle and lander. The cruise stage carries the entry and lander vehicles to Mars and is jettisoned prior to entry. The entry vehicle, including aeroshell, parachute and deceleration rockets, protects the lander during the direct entry and reduces its velocity from 7.6 to 0 km/s in stages during the 5 min entry sequence. The lander's touchdown is softened by airbags which are retracted once stopped on the surface. The lander then uprights itself, opens up fully and begins surface operations including deploying its camera and rover. This paper overviews the system design and the results of the system integration and test activities, including the entry, descent and landing subsystem elements. System test experiences including science instruments, the microrover, Sojourner, and software are discussed. The final qualification of the entry, descent and landing subsystems during this period is also discussed.

Aspects of job scheduling

NASA Technical Reports Server (NTRS)

Phillips, K.

1976-01-01

A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.

Enabling a New Planning and Scheduling Paradigm

NASA Technical Reports Server (NTRS)

Jaap, John; Davis, Elizabeth

2004-01-01

The Flight Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called "tasks models," from the scientists and technologists for the tasks that they want to be done. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, another cadre further modifies the models to be compatible with the scheduling engine. This last cadre also submits the models to the scheduling engine or builds the timeline manually to accommodate requirements that are expressed in notes. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components. (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphics methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the intervention of a scheduling expert. The algorithm is tuned for the constraint hierarchies and the complex temporal relationships provided by the modeling schema. It has an extensive search algorithm which can exploit timing flexibilities and constraint and relationship options. (3) A web-based architecture allows multiple remote users to simultaneously model science and technology requirements and other users to model vehicle and hardware characteristics. The architecture allows the users to submit scheduling requests directly to the scheduling engine and immediately see the results. These three components are integrated so that science and technology experts with no knowledge of the vehicle or hardware subsystems and no knowledge of the internal workings of the scheduling engine have the ability to build and submit scheduling requests and see the results. The immediate feedback will hone the users' modeling skills and ultimately enable them to produce the desired timeline. This paper summarizes the three components of the enabling technology and describes how this technology would make a new paradigm possible.

User requirements for a patient scheduling system

NASA Technical Reports Server (NTRS)

Zimmerman, W.

1979-01-01

A rehabilitation institute's needs and wants from a scheduling system were established by (1) studying the existing scheduling system and the variables that affect patient scheduling, (2) conducting a human-factors study to establish the human interfaces that affect patients' meeting prescribed therapy schedules, and (3) developing and administering a questionnaire to the staff which pertains to the various interface problems in order to identify staff requirements to minimize scheduling problems and other factors that may limit the effectiveness of any new scheduling system.

View of Apollo 15 space vehicle leaving VAB to Pad A, Launch Complex 39

NASA Image and Video Library

1971-05-11

S71-33786 (11 May 1971) --- The 363-feet tall Apollo (Spacecraft 112/Lunar Module 10/Saturn 510) space vehicle which leaves the Vehicle Assembly Building (VAB) to Pad A, Launch Complex 39, Kennedy Space Center (KSC). The Saturn V stack and its mobile launch tower are atop a huge crawler-transporter. Apollo 15 is scheduled as the fourth manned lunar landing mission by the National Aeronautics and Space Administration (NASA) and is scheduled to lift off on July 26, 1971. The crew men will be astronauts David R. Scott, commander; Alfred M. Worden, command module pilot; and James B. Irwin, lunar module pilot. While astronaut Scott and Irwin will descend in the Lunar Module (LM) to explore the moon, astronaut Worden will remain with the Command and Service Modules (CSM) in lunar orbit.

Evaluation of scheduling techniques for payload activity planning

NASA Technical Reports Server (NTRS)

Bullington, Stanley F.

1991-01-01

Two tasks related to payload activity planning and scheduling were performed. The first task involved making a comparison of space mission activity scheduling problems with production scheduling problems. The second task consisted of a statistical analysis of the output of runs of the Experiment Scheduling Program (ESP). Details of the work which was performed on these two tasks are presented.

Artificial intelligence approaches to astronomical observation scheduling

NASA Technical Reports Server (NTRS)

Johnston, Mark D.; Miller, Glenn

1988-01-01

Automated scheduling will play an increasing role in future ground- and space-based observatory operations. Due to the complexity of the problem, artificial intelligence technology currently offers the greatest potential for the development of scheduling tools with sufficient power and flexibility to handle realistic scheduling situations. Summarized here are the main features of the observatory scheduling problem, how artificial intelligence (AI) techniques can be applied, and recent progress in AI scheduling for Hubble Space Telescope.

The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

NASA Astrophysics Data System (ADS)

Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

2016-08-01

In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

Planning and Scheduling for Fleets of Earth Observing Satellites

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Jonsson, Ari; Morris, Robert; Smith, David E.; Norvig, Peter (Technical Monitor)

2001-01-01

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

Job expansion : an additional benefit of a computer aided dispatch/automatic vehicle locator (CAD/AVL) system

DOT National Transportation Integrated Search

2000-03-01

The Denver Regional Transportation District (RTD) acquired a CAD/AVL system that became fully operational in 1996. The CAD/AVL system added radio channels and covert alarms in buses, located vehicles in real time, and monitored schedule adherence. Th...

Baseline tests of the battronic Minivan electric delivery van

NASA Technical Reports Server (NTRS)

Dustin, M. O.; Soltis, R. F.; Bozek, J. M.; Maslowski, E. A.

1977-01-01

An electric passenger vehicle was tested to develop data characterizing the state of the art of electric and hybrid vehicles. The test measured vehicle maximum speed, range at constant speed, range over stop-and-go driving schedules, maximum acceleration, gradeability and limit, road energy consumption, road power, indicated energy consumption, braking capability and battery charge efficiency. The data obtained are to serve as a baseline to compare improvements in electric and hybrid vehicle technologies and to assist in establishing performance standards.

Deep Space Network Scheduling Using Evolutionary Computational Methods

NASA Technical Reports Server (NTRS)

Guillaume, Alexandre; Lee, Seugnwon; Wang, Yeou-Fang; Terrile, Richard J.

2007-01-01

The paper presents the specific approach taken to formulate the problem in terms of gene encoding, fitness function, and genetic operations. The genome is encoded such that a subset of the scheduling constraints is automatically satisfied. Several fitness functions are formulated to emphasize different aspects of the scheduling problem. The optimal solutions of the different fitness functions demonstrate the trade-off of the scheduling problem and provide insight into a conflict resolution process.

Enhanced Specification and Verification for Timed Planning

DTIC Science & Technology

2009-02-28

Scheduling Problem The job-shop scheduling problem ( JSSP ) is a generic resource allocation problem in which common resources (“machines”) are required...interleaving of all processes Pi with the non-delay and mutual exclusion constraints: JSSP =̂ |||0<i6n Pi Where mutual-exclusion( JSSP ) For every complete...execution of JSSP (which terminates), its associated sched- ule S is a feasible schedule. An optimal schedule is a trace of JSSP with the minimum ending

Improving Resource Selection and Scheduling Using Predictions. Chapter 1

NASA Technical Reports Server (NTRS)

Smith, Warren

2003-01-01

The introduction of computational grids has resulted in several new problems in the area of scheduling that can be addressed using predictions. The first problem is selecting where to run an application on the many resources available in a grid. Our approach to help address this problem is to provide predictions of when an application would start to execute if submitted to specific scheduled computer systems. The second problem is gaining simultaneous access to multiple computer systems so that distributed applications can be executed. We help address this problem by investigating how to support advance reservations in local scheduling systems. Our approaches to both of these problems are based on predictions for the execution time of applications on space- shared parallel computers. As a side effect of this work, we also discuss how predictions of application run times can be used to improve scheduling performance.

Ground Vibration Testing Options for Space Launch Vehicles

NASA Technical Reports Server (NTRS)

Patterson, Alan; Smith, Robert K.; Goggin, David; Newsom, Jerry

2011-01-01

New NASA launch vehicles will require development of robust systems in a fiscally-constrained environment. NASA, Department of Defense (DoD), and commercial space companies routinely conduct ground vibration tests as an essential part of math model validation and launch vehicle certification. Although ground vibration testing must be a part of the integrated test planning process, more affordable approaches must also be considered. A study evaluated several ground vibration test options for the NASA Constellation Program flight test vehicles, Orion-1 and Orion-2, which concluded that more affordable ground vibration test options are available. The motivation for ground vibration testing is supported by historical examples from NASA and DoD. The approach used in the present study employed surveys of ground vibration test subject-matter experts that provided data to qualitatively rank six test options. Twenty-five experts from NASA, DoD, and industry provided scoring and comments for this study. The current study determined that both element-level modal tests and integrated vehicle modal tests have technical merits. Both have been successful in validating structural dynamic math models of launch vehicles. However, element-level testing has less overall cost and schedule risk as compared to integrated vehicle testing. Future NASA launch vehicle development programs should anticipate that some structural dynamics testing will be necessary. Analysis alone will be inadequate to certify a crew-capable launch vehicle. At a minimum, component and element structural dynamic tests are recommended for new vehicle elements. Three viable structural dynamic test options were identified. Modal testing of the new vehicle elements and an integrated vehicle test on the mobile launcher provided the optimal trade between technical, cost, and schedule.

Experiments with a decision-theoretic scheduler

NASA Technical Reports Server (NTRS)

Hansson, Othar; Holt, Gerhard; Mayer, Andrew

1992-01-01

This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

NASA Technical Reports Server (NTRS)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Commercial ELV services and the National Aeronautics and Space Administration - Concord or discord?

NASA Technical Reports Server (NTRS)

Frankle, Edward A.

1988-01-01

In implementation of the U.S. policy to foster and encourage the commercial expendable launch vehicle (ELV) industry, tensions have developed between the industry and U.S. Government agencies in two distinct areas: industry use of government facilities and government purchase of commercial ELV services. The reasons for the tensions and discrete legal problems for each area are identified and discussed. Specifically, in the use of government facilities area, issues of insurance and indemnification for third-party liability and government property, concerns over priority and scheduling, and dispute-resolution procedures are discussed. In the area of government purchase of ELV launch services, a comparison is made between a launch service purchase and prior procurement practice. In all areas, the conclusion is reached that while problems still exist, they generally are understood and great progress has been made toward their resolution.

Connectivity-enhanced route selection and adaptive control for the Chevrolet Volt

DOE PAGES

Gonder, Jeffrey; Wood, Eric; Rajagopalan, Sai

2016-01-01

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3%, respectively. Furthermore, these represent substantial opportunities considering that they only require software adjustments to implement.

Ensuring Safe Exploration: Ares Launch Vehicle Integrated Vehicle Ground Vibration Testing

NASA Technical Reports Server (NTRS)

Tuma, M. L.; Chenevert, D. J.

2009-01-01

Ground vibration testing has been an integral tool for developing new launch vehicles throughout the space age. Several launch vehicles have been lost due to problems that would have been detected by early vibration testing, including Ariane 5, Delta III, and Falcon 1. NASA will leverage experience and testing hardware developed during the Saturn and Shuttle programs to perform ground vibration testing (GVT) on the Ares I crew launch vehicle and Ares V cargo launch vehicle stacks. NASA performed dynamic vehicle testing (DVT) for Saturn and mated vehicle ground vibration testing (MVGVT) for Shuttle at the Dynamic Test Stand (Test Stand 4550) at Marshall Space Flight Center (MSFC) in Huntsville, Alabama, and is now modifying that facility to support Ares I integrated vehicle ground vibration testing (IVGVT) beginning in 2012. The Ares IVGVT schedule shows most of its work being completed between 2010 and 2014. Integrated 2nd Stage Ares IVGVT will begin in 2012 and IVGVT of the entire Ares launch stack will begin in 2013. The IVGVT data is needed for the human-rated Orion launch vehicle's Design Certification Review (DCR) in early 2015. During the Apollo program, GVT detected several serious design concerns, which NASA was able to address before Saturn V flew, eliminating costly failures and potential losses of mission or crew. During the late 1970s, Test Stand 4550 was modified to support the four-body structure of the Space Shuttle. Vibration testing confirmed that the vehicle's mode shapes and frequencies were better than analytical models suggested, however, the testing also identified challenges with the rate gyro assemblies, which could have created flight instability and possibly resulted in loss of the vehicle. Today, NASA has begun modifying Test Stand 4550 to accommodate Ares I, including removing platforms needed for Shuttle testing and upgrading the dynamic test facilities to characterize the mode shapes and resonant frequencies of the vehicle. The IVGVT team expects to collect important information about the new launch vehicles, greatly increasing astronaut safety as NASA prepares to explore the Moon and beyond.

10 CFR 474.4 - Test procedures.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 10 Energy 3 2011-01-01 2011-01-01 false Test procedures. 474.4 Section 474.4 Energy DEPARTMENT OF...; PETROLEUM-EQUIVALENT FUEL ECONOMY CALCULATION § 474.4 Test procedures. (a) The electric vehicle energy... Schedule and Urban Dynamometer Driving Schedule test cycles at 40 CFR parts 86 and 600. (b) The “Special...

A New Lagrangian Relaxation Method Considering Previous Hour Scheduling for Unit Commitment Problem

NASA Astrophysics Data System (ADS)

Khorasani, H.; Rashidinejad, M.; Purakbari-Kasmaie, M.; Abdollahi, A.

2009-08-01

Generation scheduling is a crucial challenge in power systems especially under new environment of liberalization of electricity industry. A new Lagrangian relaxation method for unit commitment (UC) has been presented for solving generation scheduling problem. This paper focuses on the economical aspect of UC problem, while the previous hour scheduling as a very important issue is studied. In this paper generation scheduling of present hour has been conducted by considering the previous hour scheduling. The impacts of hot/cold start-up cost have been taken in to account in this paper. Case studies and numerical analysis presents significant outcomes while it demonstrates the effectiveness of the proposed method.

Production scheduling with ant colony optimization

NASA Astrophysics Data System (ADS)

Chernigovskiy, A. S.; Kapulin, D. V.; Noskova, E. E.; Yamskikh, T. N.; Tsarev, R. Yu

2017-10-01

The optimum solution of the production scheduling problem for manufacturing processes at an enterprise is crucial as it allows one to obtain the required amount of production within a specified time frame. Optimum production schedule can be found using a variety of optimization algorithms or scheduling algorithms. Ant colony optimization is one of well-known techniques to solve the global multi-objective optimization problem. In the article, the authors present a solution of the production scheduling problem by means of an ant colony optimization algorithm. A case study of the algorithm efficiency estimated against some others production scheduling algorithms is presented. Advantages of the ant colony optimization algorithm and its beneficial effect on the manufacturing process are provided.

40 CFR 798.2250 - Dermal toxicity.

Code of Federal Regulations, 2011 CFR

2011-07-01

... animals scheduled to be sacrificed before completion of the study. (2) Control groups. A concurrent control group is required. This group shall be an untreated or sham-treated control group or, if a vehicle is used in administering the test substance, a vehicle control group. If the toxic properties of the...

40 CFR 798.2250 - Dermal toxicity.

Code of Federal Regulations, 2012 CFR

2012-07-01

... animals scheduled to be sacrificed before completion of the study. (2) Control groups. A concurrent control group is required. This group shall be an untreated or sham-treated control group or, if a vehicle is used in administering the test substance, a vehicle control group. If the toxic properties of the...

40 CFR 798.2250 - Dermal toxicity.

Code of Federal Regulations, 2014 CFR

2014-07-01

... animals scheduled to be sacrificed before completion of the study. (2) Control groups. A concurrent control group is required. This group shall be an untreated or sham-treated control group or, if a vehicle is used in administering the test substance, a vehicle control group. If the toxic properties of the...

40 CFR 798.2250 - Dermal toxicity.

Code of Federal Regulations, 2013 CFR

2013-07-01

... animals scheduled to be sacrificed before completion of the study. (2) Control groups. A concurrent control group is required. This group shall be an untreated or sham-treated control group or, if a vehicle is used in administering the test substance, a vehicle control group. If the toxic properties of the...

40 CFR 798.2250 - Dermal toxicity.

Code of Federal Regulations, 2010 CFR

2010-07-01

... animals scheduled to be sacrificed before completion of the study. (2) Control groups. A concurrent control group is required. This group shall be an untreated or sham-treated control group or, if a vehicle is used in administering the test substance, a vehicle control group. If the toxic properties of the...

23 CFR 630.1108 - Work zone safety management measures and strategies.

Code of Federal Regulations, 2010 CFR

2010-04-01

... uniformed law enforcement officer and marked law enforcement vehicle in view of motorized traffic on a... and other contingencies. (e) Work Vehicles and Equipment. In addition to addressing risks to workers... contractor's choice of work scheduling and methodology; (6) For Lump Sum items, a contingency provision...

AGT 1500 Powerpack Improvement Project (M1 TMEPS). Volume 1

DTIC Science & Technology

1991-03-01

culminated in a one week evalUation of the ATR. This was due to funding and schedule constraints. Testing was concentrated on vehicle mobility performance...June 1990 with a one week vehicle demonstration at Milford Proving Grounds. The vehicle performed well but the mobility characteristics, most...all of the nonrecurring, recurring, engineering, data, system test and evaluation, and initial spares costs aplicable to each alternative. TMEPS as a

Ground Processing Affordability for Space Vehicles

NASA Technical Reports Server (NTRS)

Ingalls, John; Scott, Russell

2011-01-01

Launch vehicles and most of their payloads spend the majority of their time on the ground. The cost of ground operations is very high. So, why so often is so little attention given to ground processing during development? The current global space industry and economic environment are driving more need for efficiencies to save time and money. Affordability and sustainability are more important now than ever. We can not continue to treat space vehicles as mere science projects. More RLV's (Reusable Launch Vehicles) are being developed for the gains of reusability which are not available for ELV's (Expendable Launch Vehicles). More human-rated vehicles are being developed, with the retirement of the Space Shuttles, and for a new global space race, yet these cost more than the many unmanned vehicles of today. We can learn many lessons on affordability from RLV's. DFO (Design for Operations) considers ground operations during design, development, and manufacturing-before the first flight. This is often minimized for space vehicles, but is very important. Vehicles are designed for launch and mission operations. You will not be able to do it again if it is too slow or costly to get there. Many times, technology changes faster than space products such that what is launched includes outdated features, thus reducing competitiveness. Ground operations must be considered for the full product Lifecycle, from concept to retirement. Once manufactured, launch vehicles along with their payloads and launch systems require a long path of processing before launch. Initial assembly and testing always discover problems to address. A solid integration program is essential to minimize these impacts, as was seen in the Constellation Ares I-X test rocket. For RLV's, landing/recovery and post-flight turnaround activities are performed. Multi-use vehicles require reconfiguration. MRO (Maintenance, Repair, and Overhaul) must be well-planned--- even for the unplanned problems. Defect limits and standard repairs need to be in-place as well as easily added. Many routine inspections and maintenance can be like an aircraft overhaul. Modifications and technology upgrades should be expected. Another factor affecting ground operations efficiency is trending. It is essential for RLV's, and also useful for ELV's which fly the same or similar models again. Good data analysis of technical and processing performance will determine fixes and improvements needed for safety, design, and future processing. Collecting such data on new or low-frequency vehicles is a challenge. Lessons can be learned from the Space Shuttle, or even the Concorde aircraft. For all of the above topics, efficient business systems must be established for comprehensive program management and good throughput. Drawings, specifications, and manuals for an entire launch vehicle are often in different formats from multiple vendors, plus they have proprietary constraints. Nonetheless, the integration team must ensure that all data needed is compatible and visible to each appropriate team member. Ground processing systems for scheduling, tracking, problem resolution, etc. must be well laid-out. The balance between COTS (commercial off the shelf) and custom software is difficult. Multiple customers, vendors, launch sites, and landing sites add to the complexity of efficient IT (Information Technology) tools.

Sensibility study in a flexible job shop scheduling problem

NASA Astrophysics Data System (ADS)

Curralo, Ana; Pereira, Ana I.; Barbosa, José; Leitão, Paulo

2013-10-01

This paper proposes the impact assessment of the jobs order in the optimal time of operations in a Flexible Job Shop Scheduling Problem. In this work a real assembly cell was studied: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France, which is considered as a Flexible Job Shop problem. The problem consists in finding the machines operations schedule, taking into account the precedence constraints. The main objective is to minimize the batch makespan, i.e. the finish time of the last operation completed in the schedule. Shortly, the present study consists in evaluating if the jobs order affects the optimal time of the operations schedule. The genetic algorithm was used to solve the optimization problem. As a conclusion, it's assessed that the jobs order influence the optimal time.

Torque blending and wheel slip control in EVs with in-wheel motors

NASA Astrophysics Data System (ADS)

de Castro, Ricardo; Araújo, Rui E.; Tanelli, Mara; Savaresi, Sergio M.; Freitas, Diamantino

2012-01-01

Among the many opportunities offered by electric vehicles (EVs), the design of power trains based on in-wheel electric motors represents, from the vehicle dynamics point of view, a very attractive prospect, mainly due to the torque-vectoring capabilities. However, this distributed propulsion also poses some practical challenges, owing to the constraints arising from motor installation in a confined space, to the increased unsprung mass weight and to the integration of the electric motor with the friction brakes. This last issue is the main theme of this work, which, in particular, focuses on the design of the anti-lock braking system (ABS). The proposed structure for the ABS is composed of a tyre slip controller, a wheel torque allocator and a braking supervisor. To address the slip regulation problem, an adaptive controller is devised, offering robustness to uncertainties in the tyre-road friction and featuring a gain-scheduling mechanism based on the vehicle velocity. Further, an optimisation framework is employed in the torque allocator to determine the optimal split between electric and friction brake torque based on energy performance metrics, actuator constraints and different actuators bandwidth. Finally, based on the EV working condition, the priorities of this allocation scheme are adapted by the braking supervisor unit. Simulation results obtained with the CarSim vehicle model, demonstrate the effectiveness of the overall approach.

Coordinating space telescope operations in an integrated planning and scheduling architecture

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela

1992-01-01

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

Preliminary Evaluation of BIM-based Approaches for Schedule Delay Analysis

NASA Astrophysics Data System (ADS)

Chou, Hui-Yu; Yang, Jyh-Bin

2017-10-01

The problem of schedule delay commonly occurs in construction projects. The quality of delay analysis depends on the availability of schedule-related information and delay evidence. More information used in delay analysis usually produces more accurate and fair analytical results. How to use innovative techniques to improve the quality of schedule delay analysis results have received much attention recently. As Building Information Modeling (BIM) technique has been quickly developed, using BIM and 4D simulation techniques have been proposed and implemented. Obvious benefits have been achieved especially in identifying and solving construction consequence problems in advance of construction. This study preforms an intensive literature review to discuss the problems encountered in schedule delay analysis and the possibility of using BIM as a tool in developing a BIM-based approach for schedule delay analysis. This study believes that most of the identified problems can be dealt with by BIM technique. Research results could be a fundamental of developing new approaches for resolving schedule delay disputes.

Further Evaluation of the Use of Multiple Schedules for Behavior Maintained by Negative Reinforcement.

PubMed

Campos, Claudia; Leon, Yanerys; Sleiman, Andressa; Urcuyo, Beatriz

2017-03-01

One potential limitation of functional communication training (FCT) is that after the functional communication response (FCR) is taught, the response may be emitted at high rates or inappropriate times. Thus, schedule thinning is often necessary. Previous research has demonstrated that multiple schedules can facilitate schedule thinning by establishing discriminative control of the communication response while maintaining low rates of problem behavior. To date, most applied research evaluating the clinical utility of multiple schedules has done so in the context of behavior maintained by positive reinforcement (e.g., attention or tangible items). This study examined the use of a multiple schedule with alternating Fixed Ratio (FR 1)/extinction (EXT) components for two individuals with developmental disabilities who emitted escape-maintained problem behavior. Although problem behavior remained low during all FCT and multiple schedule phases, the use of the multiple schedule alone did not result in discriminated manding.

Vehicle management and mission planning systems with shuttle applications

NASA Technical Reports Server (NTRS)

1972-01-01

A preliminary definition of a concept for an automated system is presented that will support the effective management and planning of space shuttle operations. It is called the Vehicle Management and Mission Planning System (VMMPS). In addition to defining the system and its functions, some of the software requirements of the system are identified and a phased and evolutionary method is recommended for software design, development, and implementation. The concept is composed of eight software subsystems supervised by an executive system. These subsystems are mission design and analysis, flight scheduler, launch operations, vehicle operations, payload support operations, crew support, information management, and flight operations support. In addition to presenting the proposed system, a discussion of the evolutionary software development philosophy that the Mission Planning and Analysis Division (MPAD) would propose to use in developing the required supporting software is included. A preliminary software development schedule is also included.

Optimal Routing and Control of Multiple Agents Moving in a Transportation Network and Subject to an Arrival Schedule and Separation Constraints

NASA Technical Reports Server (NTRS)

Sadovsky, A. V.; Davis, D.; Isaacson, D. R.

2012-01-01

We address the problem of navigating a set of moving agents, e.g. automated guided vehicles, through a transportation network so as to bring each agent to its destination at a specified time. Each pair of agents is required to be separated by a minimal distance, generally agent-dependent, at all times. The speed range, initial position, required destination, and required time of arrival at destination for each agent are assumed provided. The movement of each agent is governed by a controlled differential equation (state equation). The problem consists in choosing for each agent a path and a control strategy so as to meet the constraints and reach the destination at the required time. This problem arises in various fields of transportation, including Air Traffic Management and train coordination, and in robotics. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver.

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

An investigation of the use of temporal decomposition in space mission scheduling

NASA Technical Reports Server (NTRS)

Bullington, Stanley E.; Narayanan, Venkat

1994-01-01

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

NASA Technical Reports Server (NTRS)

Richards, Stephen F.

1991-01-01

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Automated telescope scheduling

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1988-01-01

With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art artificial intelligence software technology. What is especially interesting is that this effort has already yielded software that is well suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.

Application of decentralized cooperative problem solving in dynamic flexible scheduling

NASA Astrophysics Data System (ADS)

Guan, Zai-Lin; Lei, Ming; Wu, Bo; Wu, Ya; Yang, Shuzi

1995-08-01

The object of this study is to discuss an intelligent solution to the problem of task-allocation in shop floor scheduling. For this purpose, the technique of distributed artificial intelligence (DAI) is applied. Intelligent agents (IAs) are used to realize decentralized cooperation, and negotiation is realized by using message passing based on the contract net model. Multiple agents, such as manager agents, workcell agents, and workstation agents, make game-like decisions based on multiple criteria evaluations. This procedure of decentralized cooperative problem solving makes local scheduling possible. And by integrating such multiple local schedules, dynamic flexible scheduling for the whole shop floor production can be realized.

Cellular-V2X Communications for Platooning: Design and Evaluation

PubMed Central

2018-01-01

Platooning is a cooperative driving application where autonomous/semi-autonomous vehicles move on the same lane in a train-like manner, keeping a small constant inter-vehicle distance, in order to reduce fuel consumption and gas emissions and to achieve safe and efficient transport. To this aim, they may exploit multiple on-board sensors (e.g., radars, LiDARs, positioning systems) and direct vehicle-to-vehicle communications to synchronize their manoeuvres. The main objective of this paper is to discuss the design choices and factors that determine the performance of a platooning application, when exploiting the emerging cellular vehicle-to-everything (C-V2X) communication technology and considering the scheduled mode, specified by 3GPP for communications over the sidelink assisted by the eNodeB. Since no resource management algorithm is currently mandated by 3GPP for this new challenging context, we focus on analyzing the feasibility and performance of the dynamic scheduling approach, with platoon members asking for radio resources on a per-packet basis. We consider two ways of implementing dynamic scheduling, currently unspecified by 3GPP: the sequential mode, that is somehow reminiscent of time division multiple access solutions based on IEEE 802.11p—till now the only investigated access technology for platooning—and the simultaneous mode with spatial frequency reuse enabled by the eNodeB. The evaluation conducted through system-level simulations provides helpful insights about the proposed configurations and C-V2X parameter settings that mainly affect the reliability and latency performance of data exchange in platoons, under different load settings. Achieved results show that the proposed simultaneous mode succeeds in reducing the latency in the update cycle in each vehicle’s controller, thus enabling future high-density platooning scenarios. PMID:29751690

Apollo spacecraft Command/Service Module and Lunar Module 3 arrive at VAB

NASA Image and Video Library

1968-12-03

Apollo Spacecraft 104 Command/Service Module and Lunar Module 3 arrive at the Vehicle Assembly Building (VAB) for mating atop the Saturn 504 launch vehicle. The Saturn 504 stack is out of view. The Saturn V first (S-IC) stage in left background is scheduled for a later flight.

Chemical Sciences and Engineering - US China Electric Vehicle and Battery

Science.gov Websites

Technology Workshop Argonne National Laboratory Chemical Sciences & Engineering DOE Logo Photo Gallery Hotels Maps Bus Schedule Contact Us TCS Building and Conference Center, Argonne National Lab TCS Building and Conference Center United States Flag China flag 2011 U.S.-China Electric Vehicle

DIVISION OF MOTOR VEHICLES

Science.gov Websites

Appointment at Palmer Appointment at Fairbanks Schedule My Road Test Road Test Wait List DRIVERS Get My Card Track My ID or License Practice Knowledge Test Register to Vote VEHICLES Renew My Registration Road Test Road Test Wait List Locations & Hours Office Hours Check Wait Times Dealer and Fleet

23 CFR 669.21 - Procedure for evaluating state compliance.

Code of Federal Regulations, 2010 CFR

2010-04-01

... automated file as evidence that proof of payment has been received before vehicles subject to the Federal... TRAFFIC OPERATIONS ENFORCEMENT OF HEAVY VEHICLE USE TAX § 669.21 Procedure for evaluating state compliance.... In lieu of retention of Schedule 1, states may make an appropriate entry in an automated file or on...

Upper Atmospheric Monitoring for Ares I-X Ascent Loads and Trajectory Evaluation on the Day-of-Launch

NASA Technical Reports Server (NTRS)

Roberts, Barry C.; McGrath, Kevin; Starr, Brett; Brandon, Jay

2009-01-01

During the launch countdown of the Ares I-X test vehicle, engineers from Langley Research Center will use profiles of atmospheric density and winds in evaluating vehicle ascent loads and controllability. A schedule for the release of balloons to measure atmospheric density and winds has been developed by the Natural Environments Branch at Marshall Space Flight Center to help ensure timely evaluation of the vehicle ascent loads and controllability parameters and support a successful launch of the Ares I-X vehicle.

Optimization and Control of Cyber-Physical Vehicle Systems

PubMed Central

Bradley, Justin M.; Atkins, Ella M.

2015-01-01

A cyber-physical system (CPS) is composed of tightly-integrated computation, communication and physical elements. Medical devices, buildings, mobile devices, robots, transportation and energy systems can benefit from CPS co-design and optimization techniques. Cyber-physical vehicle systems (CPVSs) are rapidly advancing due to progress in real-time computing, control and artificial intelligence. Multidisciplinary or multi-objective design optimization maximizes CPS efficiency, capability and safety, while online regulation enables the vehicle to be responsive to disturbances, modeling errors and uncertainties. CPVS optimization occurs at design-time and at run-time. This paper surveys the run-time cooperative optimization or co-optimization of cyber and physical systems, which have historically been considered separately. A run-time CPVS is also cooperatively regulated or co-regulated when cyber and physical resources are utilized in a manner that is responsive to both cyber and physical system requirements. This paper surveys research that considers both cyber and physical resources in co-optimization and co-regulation schemes with applications to mobile robotic and vehicle systems. Time-varying sampling patterns, sensor scheduling, anytime control, feedback scheduling, task and motion planning and resource sharing are examined. PMID:26378541

Optimization and Control of Cyber-Physical Vehicle Systems.

PubMed

Bradley, Justin M; Atkins, Ella M

2015-09-11

A cyber-physical system (CPS) is composed of tightly-integrated computation, communication and physical elements. Medical devices, buildings, mobile devices, robots, transportation and energy systems can benefit from CPS co-design and optimization techniques. Cyber-physical vehicle systems (CPVSs) are rapidly advancing due to progress in real-time computing, control and artificial intelligence. Multidisciplinary or multi-objective design optimization maximizes CPS efficiency, capability and safety, while online regulation enables the vehicle to be responsive to disturbances, modeling errors and uncertainties. CPVS optimization occurs at design-time and at run-time. This paper surveys the run-time cooperative optimization or co-optimization of cyber and physical systems, which have historically been considered separately. A run-time CPVS is also cooperatively regulated or co-regulated when cyber and physical resources are utilized in a manner that is responsive to both cyber and physical system requirements. This paper surveys research that considers both cyber and physical resources in co-optimization and co-regulation schemes with applications to mobile robotic and vehicle systems. Time-varying sampling patterns, sensor scheduling, anytime control, feedback scheduling, task and motion planning and resource sharing are examined.

Genetic algorithm to solve the problems of lectures and practicums scheduling

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.

Decision-theoretic control of EUVE telescope scheduling

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1993-01-01

This paper describes a decision theoretic scheduler (DTS) designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems and using probabilistic inference to aggregate this information in light of the features of a given problem. The Bayesian Problem-Solver (BPS) introduced a similar approach to solving single agent and adversarial graph search patterns yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Design for an 8 Meter Monolithic UV/OIR Space Telescope

NASA Technical Reports Server (NTRS)

Stahl, H. Philip; Postman, Marc; Hornsby, Linda; Hopkins, Randall; Mosier, Gary E.; Pasquale, Bert A.; Arnold, William R.

2009-01-01

ATLAST-8 is an 8-meter monolithic UV/optical/NIR space observatory to be placed in orbit at Sun-Earth L2 by NASA's planned Ares V cargo launch vehicle. The ATLAST-8 will yield fundamental astronomical breakthroughs. The mission concept utilizes two enabling technologies: planned Ares-V launch vehicle (scheduled for 2019) and autonomous rendezvous and docking (AR&D). The unprecedented Ares-V payload and mass capacity enables the use of a massive, monolithic, thin-meniscus primary mirror - similar to a VLT or Subaru. Furthermore, it enables simple robust design rules to mitigate cost, schedule and performance risk. AR&D enables on-orbit servicing, extending mission life and enhancing science return.

KENNEDY SPACE CENTER, FLA. - In a brief ceremony in the Space Station Processing Facility, Chuck Hardison (left), Boeing senior truss manager, turns over the “key” for the starboard truss segment S3/S4 to Scott Gahring, ISS Vehicle Office manager (acting), Johnson Space Center. The trusses are scheduled to be delivered to the International Space Station on mission STS-117.

NASA Image and Video Library

2004-02-12

KENNEDY SPACE CENTER, FLA. - In a brief ceremony in the Space Station Processing Facility, Chuck Hardison (left), Boeing senior truss manager, turns over the “key” for the starboard truss segment S3/S4 to Scott Gahring, ISS Vehicle Office manager (acting), Johnson Space Center. The trusses are scheduled to be delivered to the International Space Station on mission STS-117.

Assessing sleepiness and sleep disorders in Australian long-distance commercial vehicle drivers: self-report versus an "at home" monitoring device.

PubMed

Sharwood, Lisa N; Elkington, Jane; Stevenson, Mark; Grunstein, Ronald R; Meuleners, Lynn; Ivers, Rebecca Q; Haworth, Narelle; Norton, Robyn; Wong, Keith K

2012-04-01

As obstructive sleep apnea (OSA) is associated with a higher risk of motor vehicle crashes, there is increasing regulatory interest in the identification of commercial motor vehicle (CMV) drivers with this condition. This study aimed to determine the relationship between subjective versus objective assessment of OSA in CMV drivers. Cross-sectional survey. Heavy vehicle truck stops located across the road network of 2 large Australian states. A random sample of long distance commercial vehicle drivers (n = 517). None. Drivers were interviewed regarding their driving experience, personal health, shift schedules, payments, and various questions on sleep and tiredness in order to describe their sleep health across a range of variables. In addition, home recordings using a flow monitor were used during one night of sleep. Only 4.4% of drivers reported a previous diagnosis of sleep apnea, while our at home diagnostic test found a further 41% of long-distance heavy vehicle drivers likely to have sleep apnea. The multivariable apnea prediction index, based on self-report measures, showed poor agreement with the home-monitor detected sleep apnea (AUC 0.58, 95%CI = 0.49-0.62), and only 12% of drivers reported daytime sleepiness (Epworth Sleepiness Scale score > 10). Thirty-six percent of drivers were overweight and a further 50% obese; 49% of drivers were cigarette smokers. Sleep apnea remains a significant and unrecognized problem in CMV drivers, who we found to have multiple health risks. Objective testing for this sleep disorder needs to be considered, as symptom reports and self-identification appear insufficient to accurately identify those at risk.

Designing a fuzzy scheduler for hard real-time systems

NASA Technical Reports Server (NTRS)

Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami

1992-01-01

In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.

DTS: Building custom, intelligent schedulers

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1994-01-01

DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

Improving Hospital-wide Patient Scheduling Decisions by Clinical Pathway Mining.

PubMed

Gartner, Daniel; Arnolds, Ines V; Nickel, Stefan

2015-01-01

Recent research has highlighted the need for solving hospital-wide patient scheduling problems. Inpatient scheduling, patient activities have to be scheduled on scarce hospital resources such that temporal relations between activities (e.g. for recovery times) are ensured. Common objectives are, among others, the minimization of the length of stay (LOS). In this paper, we consider a hospital-wide patient scheduling problem with LOS minimization based on uncertain clinical pathways. We approach the problem in three stages: First, we learn most likely clinical pathways using a sequential pattern mining approach. Second, we provide a mathematical model for patient scheduling and finally, we combine the two approaches. In an experimental study carried out using real-world data, we show that our approach outperforms baseline approaches on two metrics.

A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.

PubMed

Wang, Zhaocai; Ji, Zuwen; Wang, Xiaoming; Wu, Tunhua; Huang, Wei

2017-12-01

As a promising approach to solve the computationally intractable problem, the method based on DNA computing is an emerging research area including mathematics, computer science and molecular biology. The task scheduling problem, as a well-known NP-complete problem, arranges n jobs to m individuals and finds the minimum execution time of last finished individual. In this paper, we use a biologically inspired computational model and describe a new parallel algorithm to solve the task scheduling problem by basic DNA molecular operations. In turn, we skillfully design flexible length DNA strands to represent elements of the allocation matrix, take appropriate biological experiment operations and get solutions of the task scheduling problem in proper length range with less than O(n 2 ) time complexity. Copyright © 2017. Published by Elsevier B.V.

Transport spatial model for the definition of green routes for city logistics centers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pamučar, Dragan, E-mail: dpamucar@gmail.com; Gigović, Ljubomir, E-mail: gigoviclj@gmail.com; Ćirović, Goran, E-mail: cirovic@sezampro.rs

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas.more » The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.« less

A hybrid online scheduling mechanism with revision and progressive techniques for autonomous Earth observation satellite

NASA Astrophysics Data System (ADS)

Li, Guoliang; Xing, Lining; Chen, Yingwu

2017-11-01

The autonomicity of self-scheduling on Earth observation satellite and the increasing scale of satellite network attract much attention from researchers in the last decades. In reality, the limited onboard computational resource presents challenge for the online scheduling algorithm. This study considered online scheduling problem for a single autonomous Earth observation satellite within satellite network environment. It especially addressed that the urgent tasks arrive stochastically during the scheduling horizon. We described the problem and proposed a hybrid online scheduling mechanism with revision and progressive techniques to solve this problem. The mechanism includes two decision policies, a when-to-schedule policy combining periodic scheduling and critical cumulative number-based event-driven rescheduling, and a how-to-schedule policy combining progressive and revision approaches to accommodate two categories of task: normal tasks and urgent tasks. Thus, we developed two heuristic (re)scheduling algorithms and compared them with other generally used techniques. Computational experiments indicated that the into-scheduling percentage of urgent tasks in the proposed mechanism is much higher than that in periodic scheduling mechanism, and the specific performance is highly dependent on some mechanism-relevant and task-relevant factors. For the online scheduling, the modified weighted shortest imaging time first and dynamic profit system benefit heuristics outperformed the others on total profit and the percentage of successfully scheduled urgent tasks.

Achieving Passive Localization with Traffic Light Schedules in Urban Road Sensor Networks

PubMed Central

Niu, Qiang; Yang, Xu; Gao, Shouwan; Chen, Pengpeng; Chan, Shibing

2016-01-01

Localization is crucial for the monitoring applications of cities, such as road monitoring, environment surveillance, vehicle tracking, etc. In urban road sensor networks, sensors are often sparely deployed due to the hardware cost. Under this sparse deployment, sensors cannot communicate with each other via ranging hardware or one-hop connectivity, rendering the existing localization solutions ineffective. To address this issue, this paper proposes a novel Traffic Lights Schedule-based localization algorithm (TLS), which is built on the fact that vehicles move through the intersection with a known traffic light schedule. We can first obtain the law by binary vehicle detection time stamps and describe the law as a matrix, called a detection matrix. At the same time, we can also use the known traffic light information to construct the matrices, which can be formed as a collection called a known matrix collection. The detection matrix is then matched in the known matrix collection for identifying where sensors are located on urban roads. We evaluate our algorithm by extensive simulation. The results show that the localization accuracy of intersection sensors can reach more than 90%. In addition, we compare it with a state-of-the-art algorithm and prove that it has a wider operational region. PMID:27735871

40 CFR 86.164-08 - Supplemental Federal Test Procedure calculations.

Code of Federal Regulations, 2010 CFR

2010-07-01

... for the test schedules of FTP, US06, and SC03. (b) The provisions of § 86.144-94(a) are applicable to... the FTP test schedule (Ywm). (c)(1) When the test vehicle is equipped with air conditioning, the final... = Mass emissions per mile for a particular pollutant weighted in terms of the contributions from the FTP...

75 FR 48608 - Schedule of Fees Authorized by 49 U.S.C. 30141

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-11

... [Docket No. NHTSA 2010-0035; Notice 2] RIN 2127-AK70 Schedule of Fees Authorized by 49 U.S.C. 30141 AGENCY....C. 30141, relating to the registration of importers and the importation of motor vehicles not... to initiate rulemaking pursuant to 49 U.S.C. Chapter 301. The petition must contain a brief statement...

Study of solid rocket motors for a space shuttle booster. Volume 3: Program acquisition planning

NASA Technical Reports Server (NTRS)

Vonderesch, A. H.

1972-01-01

Plans for conducting Phase C/D for a solid rocket motor booster vehicle are presented. Methods for conducting this program with details of scheduling, testing, and program management and control are included. The requirements of the space shuttle program to deliver a minimum cost/maximum reliability booster vehicle are examined.

41 CFR 102-34.275 - What kind of maintenance programs must we have?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What kind of maintenance programs must we have? 102-34.275 Section 102-34.275 Public Contracts and Property Management Federal... VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.275 What kind of maintenance programs...

Intelsat communications satellite scheduled for launch

NASA Technical Reports Server (NTRS)

1983-01-01

To be placed into a highly elliptical transfer orbit by the Atlas Centaur (AC-61) launch vehicle, the INTELSAT V-F satellite has 12,000 voice circuits and 2 color television channels and incorporates a maritime communication system for ship to shore communications. The stages of the launch vehicle and the launch operations are described. A table shows the launch sequence.

Center for Ground Vehicle Development and Integration

DTIC Science & Technology

2011-04-22

UNCLASSIFIED OPSEC# 21798 CGVDI Organizational Chart CGVDI Director Project and Operations Management Project Management Operations Management Engineered...Metals Welding Assembly / Paint UNCLASSIFIED UNCLASSIFIED OPSEC# 21798 Project and Operations Management CGVDI serves as a single entry point to RDECOM...for ground vehicle system integration projects, as well as for managing cost, schedule, performance and risk. Project Management Operations

5 CFR Appendix A to Subpart I of... - Schedule of Pay Differentials Authorized for Hazardous Duty Under Subpart I

Code of Federal Regulations, 2010 CFR

2010-01-01

... ice, e.g., installing scientific instruments and making observations for research purposes 25 First... subject. (a) Participating as a subject in diving research tests which seek to establish limits for safe... research vehicle. Duty aboard a submarine or deep research vehicle when it submerges 25 Do. (2) Diving...

5 CFR Appendix A to Subpart I of... - Schedule of Pay Differentials Authorized for Hazardous Duty Under Subpart I

Code of Federal Regulations, 2011 CFR

2011-01-01

... ice, e.g., installing scientific instruments and making observations for research purposes 25 First... subject. (a) Participating as a subject in diving research tests which seek to establish limits for safe... research vehicle. Duty aboard a submarine or deep research vehicle when it submerges 25 Do. (2) Diving...

5 CFR Appendix A to Subpart I of... - Schedule of Pay Differentials Authorized for Hazardous Duty Under Subpart I

Code of Federal Regulations, 2012 CFR

2012-01-01

... ice, e.g., installing scientific instruments and making observations for research purposes 25 First... subject. (a) Participating as a subject in diving research tests which seek to establish limits for safe... research vehicle. Duty aboard a submarine or deep research vehicle when it submerges 25 Do. (2) Diving...

Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

NASA Astrophysics Data System (ADS)

Gao, Kaizhou; Wang, Ling; Luo, Jianping; Jiang, Hua; Sadollah, Ali; Pan, Quanke

2018-06-01

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

NASA Space Flight Vehicle Fault Isolation Challenges

NASA Technical Reports Server (NTRS)

Bramon, Christopher; Inman, Sharon K.; Neeley, James R.; Jones, James V.; Tuttle, Loraine

2016-01-01

The Space Launch System (SLS) is the new NASA heavy lift launch vehicle and is scheduled for its first mission in 2017. The goal of the first mission, which will be uncrewed, is to demonstrate the integrated system performance of the SLS rocket and spacecraft before a crewed flight in 2021. SLS has many of the same logistics challenges as any other large scale program. Common logistics concerns for SLS include integration of discrete programs geographically separated, multiple prime contractors with distinct and different goals, schedule pressures and funding constraints. However, SLS also faces unique challenges. The new program is a confluence of new hardware and heritage, with heritage hardware constituting seventy-five percent of the program. This unique approach to design makes logistics concerns such as testability of the integrated flight vehicle especially problematic. The cost of fully automated diagnostics can be completely justified for a large fleet, but not so for a single flight vehicle. Fault detection is mandatory to assure the vehicle is capable of a safe launch, but fault isolation is another issue. SLS has considered various methods for fault isolation which can provide a reasonable balance between adequacy, timeliness and cost. This paper will address the analyses and decisions the NASA Logistics engineers are making to mitigate risk while providing a reasonable testability solution for fault isolation.

Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Steven S.

1996-01-01

This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.

Spike: Artificial intelligence scheduling for Hubble space telescope

NASA Technical Reports Server (NTRS)

Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert

1990-01-01

Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.

Scheduler Design Criteria: Requirements and Considerations

NASA Technical Reports Server (NTRS)

Lee, Hanbong

2016-01-01

This presentation covers fundamental requirements and considerations for developing schedulers in airport operations. We first introduce performance and functional requirements for airport surface schedulers. Among various optimization problems in airport operations, we focus on airport surface scheduling problem, including runway and taxiway operations. We then describe a basic methodology for airport surface scheduling such as node-link network model and scheduling algorithms previously developed. Next, we explain how to design a mathematical formulation in more details, which consists of objectives, decision variables, and constraints. Lastly, we review other considerations, including optimization tools, computational performance, and performance metrics for evaluation.

AIM being prepared for integrated testing and flight simulation

NASA Image and Video Library

2007-03-24

Flight simulation No. 3 is on the schedule for the Pegasus XL launch vehicle, seen here in Building 1555 on North Vandenberg Air Force Base in California. AIM, which stands for Aeronomy of Ice in the Mesosphere, is being prepared for integrated testing and a flight simulation. The AIM spacecraft will fly three instruments designed to study polar mesospheric clouds located at the edge of space, 50 miles above the Earth's surface in the coldest part of the planet's atmosphere. The mission's primary goal is to explain why these clouds form and what has caused them to become brighter and more numerous and appear at lower latitudes in recent years. AIM's results will provide the basis for the study of long-term variability in the mesospheric climate and its relationship to global climate change. AIM is scheduled to be mated to its launch vehicle, Orbital Sciences' Pegasus XL, during the second week of April, after which final inspections will be conducted. Launch is scheduled for April 25.

What work schedule characteristics constitute a problem to the individual? A representative study of Swedish shift workers.

PubMed

Åkerstedt, Torbjörn; Kecklund, Göran

2017-03-01

The purpose was to investigate which detailed characteristics of shift schedules that are seen as problems to those exposed. A representative national sample of non-day workers (N = 2031) in Sweden was asked whether they had each of a number of particular work schedule characteristics and, if yes, to what extent this constituted a "big problem in life". It was also inquired whether the individual's work schedules had negative consequences for fatigue, sleep and social life. The characteristic with the highest percentage reporting a big problem was "short notice (<1 month) of a new work schedule" (30.5%), <11 h off between shifts (27.8%), and split duty (>1.5 h break at mid-shift, 27.2%). Overtime (>10 h/week), night work, morning work, day/night shifts showed lower prevalences of being a "big problem". Women indicated more problems in general. Short notice was mainly related to negative social effects, while <11 h off between shifts was related to disturbed sleep, fatigue and social difficulties. It was concluded that schedules involving unpredictable working hours (short notice), short daily rest between shifts, and split duty shifts constitute big problems. The results challenge current views of what aspects of shift work need improvement, and negative social consequences seem more important than those related to health. Copyright © 2016 Elsevier Ltd. All rights reserved.

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

A bicriteria heuristic for an elective surgery scheduling problem.

PubMed

Marques, Inês; Captivo, M Eugénia; Vaz Pato, Margarida

2015-09-01

Resource rationalization and reduction of waiting lists for surgery are two main guidelines for hospital units outlined in the Portuguese National Health Plan. This work is dedicated to an elective surgery scheduling problem arising in a Lisbon public hospital. In order to increase the surgical suite's efficiency and to reduce the waiting lists for surgery, two objectives are considered: maximize surgical suite occupation and maximize the number of surgeries scheduled. This elective surgery scheduling problem consists of assigning an intervention date, an operating room and a starting time for elective surgeries selected from the hospital waiting list. Accordingly, a bicriteria surgery scheduling problem arising in the hospital under study is presented. To search for efficient solutions of the bicriteria optimization problem, the minimization of a weighted Chebyshev distance to a reference point is used. A constructive and improvement heuristic procedure specially designed to address the objectives of the problem is developed and results of computational experiments obtained with empirical data from the hospital are presented. This study shows that by using the bicriteria approach presented here it is possible to build surgical plans with very good performance levels. This method can be used within an interactive approach with the decision maker. It can also be easily adapted to other hospitals with similar scheduling conditions.

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

Automatic Generation of Heuristics for Scheduling

NASA Technical Reports Server (NTRS)

Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

1997-01-01

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

Optimizing an F-16 Squadron Weekly Pilot Schedule for the Turkish Air Force

DTIC Science & Technology

2010-03-01

disrupted schedules are rescheduled , minimizing the total number of changes with respect to the previous schedule’s objective function. Output...producing rosters for a nursing staff in a large general hospital (Dowsland, 1998) and afterwards Aickelin and Dowsland use an Indirect Genetic...algorithm to improve the solutions of the nurse scheduling problem which is similar to the fighter squadron pilot scheduling problem (Aickelin and

Scheduling language and algorithm development study. Volume 1, phase 2: Design considerations for a scheduling and resource allocation system

NASA Technical Reports Server (NTRS)

Morrell, R. A.; Odoherty, R. J.; Ramsey, H. R.; Reynolds, C. C.; Willoughby, J. K.; Working, R. D.

1975-01-01

Data and analyses related to a variety of algorithms for solving typical large-scale scheduling and resource allocation problems are presented. The capabilities and deficiencies of various alternative problem solving strategies are discussed from the viewpoint of computer system design.

A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan

NASA Astrophysics Data System (ADS)

Bhongade, A. S.; Khodke, P. M.

2014-04-01

Manufacturing systems, in which, several parts are processed through machining workstations and later assembled to form final products, is common. Though scheduling of such problems are solved using heuristics, available solution approaches can provide solution for only moderate sized problems due to large computation time required. In this work, scheduling approach is developed for such flow-shop manufacturing system having machining workstations followed by assembly workstations. The initial schedule is generated using Disjunctive method and genetic algorithm (GA) is applied further for generating schedule for large sized problems. GA is found to give near optimal solution based on the deviation of makespan from lower bound. The lower bound of makespan of such problem is estimated and percent deviation of makespan from lower bounds is used as a performance measure to evaluate the schedules. Computational experiments are conducted on problems developed using fractional factorial orthogonal array, varying the number of parts per product, number of products, and number of workstations (ranging upto 1,520 number of operations). A statistical analysis indicated the significance of all the three factors considered. It is concluded that GA method can obtain optimal makespan.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

Analysis of Rawinsonde Spatial Separation for Space Launch Vehicle Applications at the Eastern Range

NASA Technical Reports Server (NTRS)

Decker, Ryan K.

2017-01-01

Spatial separation of HR rawinsonde data is directly correlated with climatological tropospheric wind environment over ER. Stronger winds in the winter result in further downrange drift. Lighter winds in the summer result in the less horizontal drift during ascent. Maximum downrange distance can exceed 200 km during winter months. Data could misrepresent the environment the vehicle will experience during ascent. PRESTO uses all available data sources to produce the best representative, vertically complete atmosphere for launch vehicle DOL operations. Capability planned for use by NASA Space Launch System vehicle's first flight scheduled for Fall 2018.

Baseline tests of the EPC Hummingbird electric passenger vehicle

NASA Technical Reports Server (NTRS)

Slavik, R. J.; Maslowski, E. A.; Sargent, N. B.; Birchenough, A. G.

1977-01-01

The rear-mounted internal combustion engine in a four-passenger Volkswagen Thing was replaced with an electric motor made by modifying an aircraft generator and powered by 12 heavy-duty, lead-acid battery modules. Vehicle performance tests were conducted to measure vehicle maximum speed, range at constant speed, range over stop-and-go driving schedules, maximum acceleration, gradeability limit, road energy consumption, road power, indicated energy consumption, braking capability, battery charger efficiency, and battery characteristics. Test results are presented in tables and charts.

Progressively Communicating Rich Telemetry from Autonomous Underwater Vehicles via Relays

DTIC Science & Technology

2012-06-01

wireless sensor networks using an autonomous underwater vehicle. In Robotics and...communication over multiple kilometers. In addition to wireless com- munication methods , the recently developed Nereus[12] vehicle at WHOI spools out...A P T U R E M e ss a g e s P ro ce ss / T h re a d M a n a g e m e n t C o n fi g u ra ti o n P a rs in g Network Manager Frame Scheduling

Characterization of the near-term electric vehicle (ETV-1) breadboard propulsion system over the SAE J227a driving schedule D

NASA Technical Reports Server (NTRS)

Sargent, N. B.; Dustin, M. O.

1981-01-01

The electric test vehicle one (ETV-1) was built from the ground up with present state of the art technology. Two vehicles were built and are presently being evaluated by NASA's Jet Propulsion Laboratory (JPL). A duplicate set of propulsion system components was built, mounted on a breadboard, and delivered to NASA's Lewis Research Center for testing on the road load simulator (RLS). Driving cycle tests completed on the system are described.

Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.

PubMed

Yue, Lei; Guan, Zailin; Saif, Ullah; Zhang, Fei; Wang, Hao

2016-01-01

Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling problem with an aim to minimize the makespan in addition to minimize the total weighted tardiness simultaneously. In most of the production scheduling problems, the processing time of jobs is assumed as fixed. However, the actual processing time of jobs may be reduced due to "learning effect". The integration of sequence dependent group scheduling problem with learning effects has been rarely considered in literature. Therefore, current research considers a single machine group scheduling problem with sequence dependent setup times and learning effects simultaneously. A novel hybrid Pareto artificial bee colony algorithm (HPABC) with some steps of genetic algorithm is proposed for current problem to get Pareto solutions. Furthermore, five different sizes of test problems (small, small medium, medium, large medium, large) are tested using proposed HPABC. Taguchi method is used to tune the effective parameters of the proposed HPABC for each problem category. The performance of HPABC is compared with three famous multi objective optimization algorithms, improved strength Pareto evolutionary algorithm (SPEA2), non-dominated sorting genetic algorithm II (NSGAII) and particle swarm optimization algorithm (PSO). Results indicate that HPABC outperforms SPEA2, NSGAII and PSO and gives better Pareto optimal solutions in terms of diversity and quality for almost all the instances of the different sizes of problems.

Integrated resource scheduling in a distributed scheduling environment

NASA Technical Reports Server (NTRS)

Zoch, David; Hall, Gardiner

1988-01-01

The Space Station era presents a highly-complex multi-mission planning and scheduling environment exercised over a highly distributed system. In order to automate the scheduling process, customers require a mechanism for communicating their scheduling requirements to NASA. A request language that a remotely-located customer can use to specify his scheduling requirements to a NASA scheduler, thus automating the customer-scheduler interface, is described. This notation, Flexible Envelope-Request Notation (FERN), allows the user to completely specify his scheduling requirements such as resource usage, temporal constraints, and scheduling preferences and options. The FERN also contains mechanisms for representing schedule and resource availability information, which are used in the inter-scheduler inconsistency resolution process. Additionally, a scheduler is described that can accept these requests, process them, generate schedules, and return schedule and resource availability information to the requester. The Request-Oriented Scheduling Engine (ROSE) was designed to function either as an independent scheduler or as a scheduling element in a network of schedulers. When used in a network of schedulers, each ROSE communicates schedule and resource usage information to other schedulers via the FERN notation, enabling inconsistencies to be resolved between schedulers. Individual ROSE schedules are created by viewing the problem as a constraint satisfaction problem with a heuristically guided search strategy.

ADP SYSTEMS ANALYSIS - COMMITTED VS. AVAILABLE MILITARY TRANSPORTATION (LMI T1).

DTIC Science & Technology

LOGISTICS , * MANAGEMENT ENGINEERING), (*DATA PROCESSING, LOGISTICS), INFORMATION RETRIEVAL, SYSTEMS ENGINEERING, MILITARY TRANSPORTATION, CARGO VEHICLES, SCHEDULING, COMPUTER PROGRAMMING, MANAGEMENT PLANNING AND CONTROL

The third stage of Lunar Prospector's Athena is placed atop the second stage at LC 46 at CCAS

NASA Technical Reports Server (NTRS)

1997-01-01

The third stage of the Lockheed Martin Athena launch vehicle is placed atop the vehicle's second stage at Launch Complex 46 at Cape Canaveral Air Station. Athena is scheduled to carry the Lunar Prospector spacecraft for an 18-month mission that will orbit the Earth's moon to collect data from the lunar surface. Scientific experiments to be conducted by the Prospector include locating water ice that may exist near the lunar poles, gathering data to understand the evolution of the lunar highland crust and the lunar magnetic field, finding radon outgassing events, and describing the lunar gravity field by means of Doppler tracking. The launch is now scheduled for early-January 1998.

The role of fracture mechanics in the design of fuel tanks in space vehicles

NASA Technical Reports Server (NTRS)

Denton, S. J.; Liu, C. K.

1976-01-01

With special reference to design of fuel tanks in space vehicles, the principles of fracture mechanics are reviewed. An approximate but extremely simple relationship is derived among the operating stress level, the length of crack, and the number of cycles of failure. Any one of the variables can be computed approximately from the knowledge of the other two, if the loading schedule (mission of the tank) is not greatly altered. Two sample examples illustrating the procedures of determining the allowable safe operating stress corresponding to a set of assumed loading schedule are included. The selection of sample examples is limited by the relatively meager available data on the candidate material for various stress ratios in the cycling.

Decomposition of timed automata for solving scheduling problems

NASA Astrophysics Data System (ADS)

Nishi, Tatsushi; Wakatake, Masato

2014-03-01

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

PubMed

Hajri, S; Liouane, N; Hammadi, S; Borne, P

2000-01-01

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP- complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

NASA Technical Reports Server (NTRS)

Globus, Al; Crawford, James; Lohn, Jason; Morris, Robert; Clancy, Daniel (Technical Monitor)

2002-01-01

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Contingency rescheduling of spacecraft operations

NASA Technical Reports Server (NTRS)

Britt, Daniel L.; Geoffroy, Amy L.; Gohring, John R.

1988-01-01

Spacecraft activity scheduling was a focus of attention in artificial intelligence recently. Several scheduling systems were devised which more-or-less successfully address various aspects of the activity scheduling problem, though most of these are not yet mature, with the notable expection of NASA's ESP. Few current scheduling systems, however, make any attempt to deal fully with the problem of modifying a schedule in near-real-time in the event of contingencies which may arise during schedule execution. These contingencies can include resources becoming unavailable unpredictably, a change in spacecraft conditions or environment, or the need to perform an activity not scheduled. In these cases it becomes necessary to repair an existing schedule, disrupting ongoing operations as little as possible. Normal scheduling is just a part of that which must be accomplished during contingency rescheduling. A prototype system named MAESTRO was developed for spacecraft activity scheduling. MAESTRO is briefly described with a focus on recent work in the area of real-time contingency handling. Included is a discussion of some of the complexities of the scheduling problem and how they affect contingency rescheduling, such as temporal constraints between activities, activities which may be interrupted and continued in any of several ways, and different ways to choose a resource complement which will allow continuation of an activity. Various heuristics used in MAESTRO for contingency rescheduling is discussed, as are operational concerns such as interaction of the scheduler with spacecraft subsystems controllers.

Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

NASA Astrophysics Data System (ADS)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita

2016-11-01

Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

40 CFR Appendix I to Part 600 - Highway Fuel Economy Driving Schedule (Applicable to 1978 and Later Model Year Automobiles)

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 29 2010-07-01 2010-07-01 false Highway Fuel Economy Driving Schedule (Applicable to 1978 and Later Model Year Automobiles) I Appendix I to Part 600 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) ENERGY POLICY FUEL ECONOMY AND CARBON-RELATED EXHAUST EMISSIONS OF MOTOR VEHICLES Pt. 600, App. I...

KSC-87PC-0266

NASA Image and Video Library

1987-03-16

CAPE CANAVERAL, Fla. -- At Cape Canaveral Air Force Station in Florida, the paylaod fairing of the Delta 182 launch vehicle is carefully moved into place as encapsulation procedures continue on the Palapa B2-P communications satellite at Launch Complex 17, Pad B. Palapa is scheduled for launch from Cape Canaveral for the government of Indonesia. Liftoff of Delta 182 and Palapa is scheduled for March 20. Photo Credit: NASA

Using Multiple Schedules During Functional Communication Training to Promote Rapid Transfer of Treatment Effects

PubMed Central

Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.

2016-01-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects from one setting to the next and from one therapist to the next. With two children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. PMID:26384141

A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals

NASA Technical Reports Server (NTRS)

Golias, Mihalis M.

2011-01-01

Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

PubMed

Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Capability of the Maximax&Maximin selection operator in the evolutionary algorithm for a nurse scheduling problem

NASA Astrophysics Data System (ADS)

Ramli, Razamin; Tein, Lim Huai

2016-08-01

A good work schedule can improve hospital operations by providing better coverage with appropriate staffing levels in managing nurse personnel. Hence, constructing the best nurse work schedule is the appropriate effort. In doing so, an improved selection operator in the Evolutionary Algorithm (EA) strategy for a nurse scheduling problem (NSP) is proposed. The smart and efficient scheduling procedures were considered. Computation of the performance of each potential solution or schedule was done through fitness evaluation. The best so far solution was obtained via special Maximax&Maximin (MM) parent selection operator embedded in the EA, which fulfilled all constraints considered in the NSP.

78 FR 67999 - Drawbridge Operation Regulation; Gulf Intracoastal Waterway, Treasure Island, FL

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-13

... a.m. and 7 p.m. will reduce vehicle traffic issues caused by the bridge openings. Between 7 p.m. and... average less than twice an hour on signal. Scheduled openings at regular intervals between 7 a.m. and 7 p.m. would reduce the vehicle traffic back-ups caused by the opening of the bridge. Motorists will be...

Manned Orbital Transfer Vehicle (MOTV). Volume 6: Five year program plan

NASA Technical Reports Server (NTRS)

Boyland, R. E.; Sherman, S. W.; Morfin, H. W.

1979-01-01

The five year program plan for the manned orbit transfer vehicle (MOTV) is presented. The planning, schedules, cost estimates, and supporting data (objectives, constraints, assumptions, etc.) associated with the development of the MOTV are discussed. The plan, in addition to the above material, identifies the supporting research and technology required to resolve issues critical to MOTV development.

40 CFR 86.099-8 - Emission standards for 1999 and later model year light-duty vehicles.

Code of Federal Regulations, 2013 CFR

2013-07-01

....099-8 Emission standards for 1999 and later model year light-duty vehicles. (a)(1)(i)-(ii) [Reserved... schedule of table A99-08 of this section for model year 1999. For small volume manufacturers, the standards... 40 Protection of Environment 19 2013-07-01 2013-07-01 false Emission standards for 1999 and later...

40 CFR 86.099-8 - Emission standards for 1999 and later model year light-duty vehicles.

Code of Federal Regulations, 2011 CFR

2011-07-01

....099-8 Emission standards for 1999 and later model year light-duty vehicles. (a)(1)(i)-(ii) [Reserved... schedule of table A99-08 of this section for model year 1999. For small volume manufacturers, the standards... 40 Protection of Environment 18 2011-07-01 2011-07-01 false Emission standards for 1999 and later...

40 CFR 86.099-8 - Emission standards for 1999 and later model year light-duty vehicles.

Code of Federal Regulations, 2012 CFR

2012-07-01

....099-8 Emission standards for 1999 and later model year light-duty vehicles. (a)(1)(i)-(ii) [Reserved... schedule of table A99-08 of this section for model year 1999. For small volume manufacturers, the standards... 40 Protection of Environment 19 2012-07-01 2012-07-01 false Emission standards for 1999 and later...

40 CFR 86.099-8 - Emission standards for 1999 and later model year light-duty vehicles.

Code of Federal Regulations, 2010 CFR

2010-07-01

....099-8 Emission standards for 1999 and later model year light-duty vehicles. (a)(1)(i)-(ii) [Reserved... schedule of table A99-08 of this section for model year 1999. For small volume manufacturers, the standards... 40 Protection of Environment 18 2010-07-01 2010-07-01 false Emission standards for 1999 and later...

41 CFR 102-34.285 - Where can we obtain help in setting up a maintenance program?

Code of Federal Regulations, 2010 CFR

2010-07-01

... PROPERTY 34-MOTOR VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.285 Where can we... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Where can we obtain help in setting up a maintenance program? 102-34.285 Section 102-34.285 Public Contracts and Property...

49 CFR Appendix B to Part 213 - Schedule of Civil Penalties

Code of Federal Regulations, 2014 CFR

2014-10-01

... Automated vehicle-based inspection systems 5,000 7,500 213.335 Crossties (a) Material used 1,000 2,000 (b... 213.234 Automated inspection of track constructed with concrete crossties 5,000 7,500 213.235 Switches... (a) through (h) 5,000 7,500 213.345 Vehicle/track system qualification: (a) through (d) 5,000 7,500...

A Near-Term, High-Confidence Heavy Lift Launch Vehicle

NASA Technical Reports Server (NTRS)

Rothschild, William J.; Talay, Theodore A.

2009-01-01

The use of well understood, legacy elements of the Space Shuttle system could yield a near-term, high-confidence Heavy Lift Launch Vehicle that offers significant performance, reliability, schedule, risk, cost, and work force transition benefits. A side-mount Shuttle-Derived Vehicle (SDV) concept has been defined that has major improvements over previous Shuttle-C concepts. This SDV is shown to carry crew plus large logistics payloads to the ISS, support an operationally efficient and cost effective program of lunar exploration, and offer the potential to support commercial launch operations. This paper provides the latest data and estimates on the configurations, performance, concept of operations, reliability and safety, development schedule, risks, costs, and work force transition opportunities for this optimized side-mount SDV concept. The results presented in this paper have been based on established models and fully validated analysis tools used by the Space Shuttle Program, and are consistent with similar analysis tools commonly used throughout the aerospace industry. While these results serve as a factual basis for comparisons with other launch system architectures, no such comparisons are presented in this paper. The authors welcome comparisons between this optimized SDV and other Heavy Lift Launch Vehicle concepts.

Scheduling multirobot operations in manufacturing by truncated Petri nets

NASA Astrophysics Data System (ADS)

Chen, Qin; Luh, J. Y.

1995-08-01

Scheduling of operational sequences in manufacturing processes is one of the important problems in automation. Methods of applying Petri nets to model and analyze the problem with constraints on precedence relations, multiple resources allocation, etc. have been available in literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The process usually produces a large Petri net which is practically not manageable. This disadvantage, however, can be handled by a truncation technique which divides the original large Petri net into several smaller size subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, when the locally optimum schedules of the resulting subnets are combined together, it may not yield an overall optimum schedule for the original Petri net. To circumvent this problem, algorithms are developed based on the concepts of Petri net execution and modified branch-and-bound process. The developed technique is applied to a multi-robot task scheduling problem of the manufacturing work cell.

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

NASA Astrophysics Data System (ADS)

Onut, S.; Kamber, M. R.; Altay, G.

2014-03-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Koga, Dennis (Technical Monitor); Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

Empirical results on scheduling and dynamic backtracking

NASA Technical Reports Server (NTRS)

Boddy, Mark S.; Goldman, Robert P.

1994-01-01

At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.

Sensitivity and bias under conditions of equal and unequal academic task difficulty.

PubMed

Reed, Derek D; Martens, Brian K

2008-01-01

We conducted an experimental analysis of children's relative problem-completion rates across two workstations under conditions of equal (Experiment 1) and unequal (Experiment 2) problem difficulty. Results were described using the generalized matching equation and were evaluated for degree of schedule versus stimulus control. Experiment 1 involved a symmetrical choice arrangement in which the children could earn points exchangeable for rewards contingent on correct math problem completion. Points were delivered according to signaled variable-interval schedules at each workstation. For 2 children, relative rates of problem completion appeared to have been controlled by the schedule requirements in effect and matched relative rates of reinforcement, with sensitivity values near 1 and bias values near 0. Experiment 2 involved increasing the difficulty of math problems at one of the workstations. Sensitivity values for all 3 participants were near 1, but a substantial increase in bias toward the easier math problems was observed. This bias was possibly associated with responding at the more difficult workstation coming under stimulus control rather than schedule control.

Analysis of Feeder Bus Network Design and Scheduling Problems

PubMed Central

Almasi, Mohammad Hadi; Karim, Mohamed Rehan

2014-01-01

A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews. PMID:24526890

A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.

PubMed

Lee, I; Sikora, R; Shaw, M J

1997-01-01

Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-concurrently using GAs. The essence of our approach lies in the concept of using a unified representation for the information about both the lot sizes and the sequence and enabling GAs to evolve the chromosome by replacing primitive genes with good building blocks. In addition, a simulated annealing procedure is incorporated to further improve the performance. We evaluate the performance of applying the above approach to flexible flow line scheduling with variable lot sizes for an actual manufacturing facility, comparing it to such alternative approaches as pair wise exchange improvement, tabu search, and simulated annealing procedures. The results show the efficacy of this approach for flexible flow line scheduling.

Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

NASA Astrophysics Data System (ADS)

Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu

2015-12-01

For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

Adjacent Vehicle Number-Triggered Adaptive Transmission for V2V Communications.

PubMed

Wei, Yiqiao; Chen, Jingjun; Hwang, Seung-Hoon

2018-03-02

For vehicle-to-vehicle (V2V) communication, such issues as continuity and reliability still have to be solved. Specifically, it is necessary to consider a more scalable physical layer due to the high-speed mobility of vehicles and the complex channel environment. Adaptive transmission has been adapted in channel-dependent scheduling. However, it has been neglected with regards to the physical topology changes in the vehicle network. In this paper, we propose a physical topology-triggered adaptive transmission scheme which adjusts the data rate between vehicles according to the number of connectable vehicles nearby. Also, we investigate the performance of the proposed method using computer simulations and compare it with the conventional methods. The numerical results show that the proposed method can provide more continuous and reliable data transmission for V2V communications.

Adjacent Vehicle Number-Triggered Adaptive Transmission for V2V Communications

PubMed Central

Wei, Yiqiao; Chen, Jingjun

2018-01-01

For vehicle-to-vehicle (V2V) communication, such issues as continuity and reliability still have to be solved. Specifically, it is necessary to consider a more scalable physical layer due to the high-speed mobility of vehicles and the complex channel environment. Adaptive transmission has been adapted in channel-dependent scheduling. However, it has been neglected with regards to the physical topology changes in the vehicle network. In this paper, we propose a physical topology-triggered adaptive transmission scheme which adjusts the data rate between vehicles according to the number of connectable vehicles nearby. Also, we investigate the performance of the proposed method using computer simulations and compare it with the conventional methods. The numerical results show that the proposed method can provide more continuous and reliable data transmission for V2V communications. PMID:29498646

Sliding mode-based lateral vehicle dynamics control using tyre force measurements

NASA Astrophysics Data System (ADS)

Kunnappillil Madhusudhanan, Anil; Corno, Matteo; Holweg, Edward

2015-11-01

In this work, a lateral vehicle dynamics control based on tyre force measurements is proposed. Most of the lateral vehicle dynamics control schemes are based on yaw rate whereas tyre forces are the most important variables in vehicle dynamics as tyres are the only contact points between the vehicle and road. In the proposed method, active front steering is employed to uniformly distribute the required lateral force among the front left and right tyres. The force distribution is quantified through the tyre utilisation coefficients. In order to address the nonlinearities and uncertainties of the vehicle model, a gain scheduling sliding-mode control technique is used. In addition to stabilising the lateral dynamics, the proposed controller is able to maintain maximum lateral acceleration. The proposed method is tested and validated on a multi-body vehicle simulator.

An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-robin Tournaments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

Previous approaches for scheduling a league with round-robin and divisional tournaments involved decomposing the problem into easier subproblems. This approach, used to schedule the top Swedish handball league Elitserien, reduces the problem complexity but can result in suboptimal schedules. This paper presents an integrated constraint programming model that allows to perform the scheduling in a single step. Particular attention is given to identifying implied and symmetry-breaking constraints that reduce the computational complexity significantly. The experimental evaluation of the integrated approach takes considerably less computational effort than the previous approach.

Performance of Extended Local Clustering Organization (LCO) for Large Scale Job-Shop Scheduling Problem (JSP)

NASA Astrophysics Data System (ADS)

Konno, Yohko; Suzuki, Keiji

This paper describes an approach to development of a solution algorithm of a general-purpose for large scale problems using “Local Clustering Organization (LCO)” as a new solution for Job-shop scheduling problem (JSP). Using a performance effective large scale scheduling in the study of usual LCO, a solving JSP keep stability induced better solution is examined. In this study for an improvement of a performance of a solution for JSP, processes to a optimization by LCO is examined, and a scheduling solution-structure is extended to a new solution-structure based on machine-division. A solving method introduced into effective local clustering for the solution-structure is proposed as an extended LCO. An extended LCO has an algorithm which improves scheduling evaluation efficiently by clustering of parallel search which extends over plural machines. A result verified by an application of extended LCO on various scale of problems proved to conduce to minimizing make-span and improving on the stable performance.

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon C.; Zhu, Zhifan; Jeong, Myeongsook; Kim, Hyounkong; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon Chul; Zhu, Zhifan; Jeong, Myeong-Sook; Kim, Hyoun Kyoung; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

Cost, Schedule, And Performance Elements For Comparison of Hydrodynamic Models of Near-Surface Unmanned Underwater Vehicle Operations

DTIC Science & Technology

2017-12-01

2-89) Prescribed by ANSI Std. 239-18 ii THIS PAGE INTENTIONALLY LEFT BLANK iii Approved for public release. Distribution is unlimited. COST ...from the scope of this demonstration due to time constraints. Further study of this software would benefit similar cost , schedule, and performance...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA SYSTEMS ENGINEERING CAPSTONE PROJECT REPORT Approved for public release. Distribution

Assessment of vehicle safety problems for special driving populations

DOT National Transportation Integrated Search

1979-02-16

The report describes vehicle safety problems reported in interviews with 460 physically limited drivers and 41 physically limited non-drivers. The problems reported involved operation of primary and secondary controls, operating other vehicle mechani...

Multi-Objective Scheduling for the Cluster II Constellation

NASA Technical Reports Server (NTRS)

Johnston, Mark D.; Giuliano, Mark

2011-01-01

This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.

Saturn 1B space vehicle for ASTP moves from VAB to launch complex

NASA Image and Video Library

1975-03-24

S75-24007 (24 March 1975) --- The Saturn 1B space vehicle for the Apollo-Soyuz Test Project mission, with its launch umbilical tower, rides atop a huge crawler-transporter as it moves slowly away from the Vehicle Assembly Building on its 4.24-mile journey to Pad B, Launch Complex 39, at NASA's Kennedy Space Center. The ASTP vehicle is composed of a Saturn 1B (first) stage, a Saturn IVB (second) stage, and a payload consisting of a Command/Service Module and a Docking Module. The joint U.S.-USSR ASTP docking mission in Earth orbit is scheduled for July 1975.

Ares Launch Vehicles Lean Practices Case Study

NASA Technical Reports Server (NTRS)

Doreswamy, Rajiv, N.; Self, Timothy A.

2008-01-01

This viewgraph presentation describes test strategies and lean philisophies and practices that are applied to Ares Launch Vehicles. The topics include: 1) Testing strategy; 2) Lean Practices in Ares I-X; 3) Lean Practices Applied to Ares I-X Schedule; 4) Lean Event Results; 5) Lean, Six Sigma, and Kaizen Practices in the Ares Projects Office; 6) Lean and Kaizen Success Stories; and 7) Ares Six Sigma Practices.

Operator Objective Function Guidance for a Real-Time Unmanned Vehicle Scheduling Algorithm

DTIC Science & Technology

2012-12-01

Consensus - Based Decentralized Auctions for Robust Task Allocation ,” IEEE Transactions on Robotics and Automation, Vol. 25, No. 4, No. 4, 2009, pp. 912...planning for the fleet. The decentralized task planner used in OPS-USERS is the consensus - based bundle algorithm (CBBA), a decentralized , polynomial...and surveillance (OPS-USERS), which leverages decentralized algorithms for vehicle routing and task allocation . This

NASA Space Flight Vehicle Fault Isolation Challenges

NASA Technical Reports Server (NTRS)

Neeley, James R.; Jones, James V.; Bramon, Christopher J.; Inman, Sharon K.; Tuttle, Loraine

2016-01-01

The Space Launch System (SLS) is the new NASA heavy lift launch vehicle in development and is scheduled for its first mission in 2018.SLS has many of the same logistics challenges as any other large scale program. However, SLS also faces unique challenges related to testability. This presentation will address the SLS challenges for diagnostics and fault isolation, along with the analyses and decisions to mitigate risk..

Large Crawler Crane for new lightning protection system

NASA Image and Video Library

2007-10-25

A large crawler crane moves past the Vehicle Assembly Building on its way to Launch Pad 39B. The crane with its 70-foot boom will be used to construct a new lightning protection system for the Constellation Program and Ares/Orion launches. Pad B will be the site of the first Ares vehicle launch, including Ares I-X which is scheduled for April 2009.

Decisions, endings, and new beginnings.

PubMed

Dorr, Robert F

2005-08-01

The Washington Watch column examines NASA shuttle developments, airline pilot age issues, development of a personnel recovery vehicle, and includes an obituary for retired Air Force General Bernard Schriever, remembered as an air and space pioneer. The discussion of NASA shuttle developments reports on the space shuttle flight schedule and NASA's ability to deliver hardware to the International Space Station, funding levels and equipment development schedules related to President Bush's mandate to visit Mars, a report on the space program by the American Academy of Arts and Sciences, and top-level management changes at NASA. The discussion of airline pilot age issues examines efforts to change mandatory retirement requirements. The discussion of personnel recovery vehicles reports on development of an aircraft designed to rescue survivors during combat search and rescue missions.

PIONEER VENUS 2 MULTI-PROBE PARACHUTE TESTS IN THE VEHICLE ASSEMBLY BUILDING

NASA Technical Reports Server (NTRS)

1975-01-01

A parachute system, designed to carry an instrument-laden probe down through the dense atmosphere of torrid, cloud-shrouded Venus, was tested in KSC's Vehicle Assembly Building. The tests are in preparation for a Pioneer multi-probe mission to Venus scheduled for launch from KSC in 1978. Full-scale (12-foot diameter) parachutes with simulated pressure vessels weighing up to 45 pounds were dropped from heights of up to 450 feet tot he floor of the VAB where the impact was cushioned by a honeycomb cardboard impact arrestor. The VAB offers an ideal, wind-free testing facility at no additional construction cost and was used for similar tests of the parachute system for the twin Viking spacecraft scheduled for launch toward Mars in August.

SEASAT study documentation

NASA Technical Reports Server (NTRS)

1974-01-01

The proposed spacecraft consists of a bus module, containing all subsystems required for support of the sensors, and a payload module containing all of the sensor equipment. The two modules are bolted together to form the spacecraft, and electrical interfaces are accomplished via mated connectors at the interface plane. This approach permits independent parallel assembly and test operations on each module up until mating for final spacecraft integration and test operations. Proposed program schedules recognize the need to refine sensor/spacecraft interfaces prior to proceeding with procurement, reflect the lead times estimated by suppliers for delivery of equipment, reflect a comprehensive test program, and provide flexibility for unanticipated problems. The spacecraft systems are described in detail along with aerospace ground equipment, ground handling equipment, the launch vehicle, imaging radar incorporation, and systems tests.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

PubMed

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods.

Resource Management in Constrained Dynamic Situations

NASA Astrophysics Data System (ADS)

Seok, Jinwoo

Resource management is considered in this dissertation for systems with limited resources, possibly combined with other system constraints, in unpredictably dynamic environments. Resources may represent fuel, power, capabilities, energy, and so on. Resource management is important for many practical systems; usually, resources are limited, and their use must be optimized. Furthermore, systems are often constrained, and constraints must be satisfied for safe operation. Simplistic resource management can result in poor use of resources and failure of the system. Furthermore, many real-world situations involve dynamic environments. Many traditional problems are formulated based on the assumptions of given probabilities or perfect knowledge of future events. However, in many cases, the future is completely unknown, and information on or probabilities about future events are not available. In other words, we operate in unpredictably dynamic situations. Thus, a method is needed to handle dynamic situations without knowledge of the future, but few formal methods have been developed to address them. Thus, the goal is to design resource management methods for constrained systems, with limited resources, in unpredictably dynamic environments. To this end, resource management is organized hierarchically into two levels: 1) planning, and 2) control. In the planning level, the set of tasks to be performed is scheduled based on limited resources to maximize resource usage in unpredictably dynamic environments. In the control level, the system controller is designed to follow the schedule by considering all the system constraints for safe and efficient operation. Consequently, this dissertation is mainly divided into two parts: 1) planning level design, based on finite state machines, and 2) control level methods, based on model predictive control. We define a recomposable restricted finite state machine to handle limited resource situations and unpredictably dynamic environments for the planning level. To obtain a policy, dynamic programing is applied, and to obtain a solution, limited breadth-first search is applied to the recomposable restricted finite state machine. A multi-function phased array radar resource management problem and an unmanned aerial vehicle patrolling problem are treated using recomposable restricted finite state machines. Then, we use model predictive control for the control level, because it allows constraint handling and setpoint tracking for the schedule. An aircraft power system management problem is treated that aims to develop an integrated control system for an aircraft gas turbine engine and electrical power system using rate-based model predictive control. Our results indicate that at the planning level, limited breadth-first search for recomposable restricted finite state machines generates good scheduling solutions in limited resource situations and unpredictably dynamic environments. The importance of cooperation in the planning level is also verified. At the control level, a rate-based model predictive controller allows good schedule tracking and safe operations. The importance of considering the system constraints and interactions between the subsystems is indicated. For the best resource management in constrained dynamic situations, the planning level and the control level need to be considered together.

Comparing the performance of expert user heuristics and an integer linear program in aircraft carrier deck operations.

PubMed

Ryan, Jason C; Banerjee, Ashis Gopal; Cummings, Mary L; Roy, Nicholas

2014-06-01

Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience-based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human-automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative.

ISS Progress 24 Rollout

NASA Image and Video Library

2007-01-16

JSC2007-E-03082 (16 Jan. 2007) --- Roll-out of the Progress 24 vehicle occurred on schedule at 7:00 a.m., Jan. 16, 2007 at the Baikonur Cosmodrome, Kazakhstan. The vehicle was in the vertical and hard-down at the pad by 9:30 a.m. The gantry towers were placed around the vehicle shortly thereafter. Progress is targeted for launch on Jan. 18, 2007 for a two-day trip to the International Space Station carrying 2 1/2 tons of food, fuel and supplies for the Expedition 14 crew. Photo Credit: NASA

The effects of the novel DA D3 receptor antagonist SR 21502 on cocaine reward, cocaine seeking and cocaine-induced locomotor activity in rats.

PubMed

Galaj, E; Ananthan, S; Saliba, M; Ranaldi, Robert

2014-02-01

There is a focus on developing D3 receptor antagonists as cocaine addiction treatments. We investigated the effects of a novel selective D3 receptor antagonist, SR 21502, on cocaine reward, cocaine-seeking, food reward, spontaneous locomotor activity and cocaine-induced locomotor activity in rats. In Experiment 1, rats were trained to self-administer cocaine under a progressive ratio (PR) schedule of reinforcement and tested with vehicle or one of three doses of SR 21502. In Experiment 2, animals were trained to self-administer cocaine under a fixed ratio schedule of reinforcement followed by extinction of the response. Then, animals were tested with vehicle or one of the SR 21502 doses on cue-induced reinstatement of responding. In Experiment 3, animals were trained to lever press for food under a PR schedule and tested with vehicle or one dose of the compound. In Experiments 4 and 5, in separate groups of animals, the vehicle and three doses of SR 21502 were tested on spontaneous or cocaine (10 mg/kg, IP)-induced locomotor activity, respectively. SR 21502 produced significant, dose-related (3.75, 7.5 and 15 mg/kg) reductions in breakpoint for cocaine self-administration, cue-induced reinstatement (3.75, 7.5 and 15 mg/kg) and cocaine-induced locomotor activity (3.75, 7.5 and 15 mg/kg) but failed to reduce food self-administration and spontaneous locomotor activity. SR 21502 decreases cocaine reward, cocaine-seeking and locomotor activity at doses that have no effect on food reward or spontaneous locomotor activity. These data suggest SR 21502 may selectively inhibit cocaine's rewarding, incentive motivational and stimulant effects.

The application of artificial intelligence to astronomical scheduling problems

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1992-01-01

Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike to other problem domains, and plans for the future evolution of the system.

Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wayne F. Boyer; Gurdeep S. Hura

2005-09-01

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less

Tests of an alternating current propulsion subsystem for electric vehicles on a road load simulator

NASA Astrophysics Data System (ADS)

Stenger, F. J.

1982-12-01

The test results of a breadboard version of an ac electric-vehicle propulsion subsystem are presented. The breadboard was installed in the NASA Lewis Research Center Road Load Simulator facility and tested under steady-state and transient conditions. Steady-state tests were run to characterize the system and component efficiencies over the complete speed-torque range within the capability of the propulsion subsystem in the motoring mode of operation. Transient tests were performed to determine the energy consumption of the breadboard over the acceleration and cruise portions of SAE J227 and driving schedules B, C, and D. Tests in the regenerative mode were limited to the low-gear-speed range of the two speed transaxle used in the subsystem. The maximum steady-state subsystem efficiency observed for the breadboard was 81.5 percent in the high-gear-speed range in the motoring mode, and 76 percent in the regenerative braking mode (low gear). The subsystem energy efficiency during the transient tests ranged from 49.2 percent for schedule B to 68.4 percent for Schedule D.

Tests of an alternating current propulsion subsystem for electric vehicles on a road load simulator

NASA Technical Reports Server (NTRS)

Stenger, F. J.

1982-01-01

The test results of a breadboard version of an ac electric-vehicle propulsion subsystem are presented. The breadboard was installed in the NASA Lewis Research Center Road Load Simulator facility and tested under steady-state and transient conditions. Steady-state tests were run to characterize the system and component efficiencies over the complete speed-torque range within the capability of the propulsion subsystem in the motoring mode of operation. Transient tests were performed to determine the energy consumption of the breadboard over the acceleration and cruise portions of SAE J227 and driving schedules B, C, and D. Tests in the regenerative mode were limited to the low-gear-speed range of the two speed transaxle used in the subsystem. The maximum steady-state subsystem efficiency observed for the breadboard was 81.5 percent in the high-gear-speed range in the motoring mode, and 76 percent in the regenerative braking mode (low gear). The subsystem energy efficiency during the transient tests ranged from 49.2 percent for schedule B to 68.4 percent for Schedule D.

Conditions sufficient for the production of oral cocaine or lidocaine self-administration in preference to water.

PubMed

Falk, J L; Siris, A; Lau, C E

1996-03-01

Groups of rats were given a chronic history of drinking cocaine solutions of different concentrations in daily, 3-h schedule induced polydipsia sessions. Animals failed to develop a preference for cocaine solution to concurrently presented water. Schedule-induction conditions were maintained, and the animals were divided into separate groups, drinking either cocaine or lidocaine placed in a highly acceptable vehicle (glucose-saccharin solution). Animals preferred their respective drug solutions to concurrently presented water, and these preferences remained stable after the glucose-saccharin vehicle was gradually faded to water, leaving only cocaine or lidocaine, respectively, in the solution. Thus a stable preference for drug solution to water could be instituted in rats for either cocaine or lidocaine solution (putative reinforcing and nonreinforcing agents, respectively) given an appropriate associative history, with high intakes maintained by schedule-induction. Conditions sufficient for the initiation of an oral preference and high intake for a putatively reinforcing drug cannot be assumed to occur owing to the drug's reinforcing property in the absence of demonstrating the ineffectiveness of an appropriate negative control substance.

Scheduling Future Water Supply Investments Under Uncertainty

NASA Astrophysics Data System (ADS)

Huskova, I.; Matrosov, E. S.; Harou, J. J.; Kasprzyk, J. R.; Reed, P. M.

2014-12-01

Uncertain hydrological impacts of climate change, population growth and institutional changes pose a major challenge to planning of water supply systems. Planners seek optimal portfolios of supply and demand management schemes but also when to activate assets whilst considering many system goals and plausible futures. Incorporation of scheduling into the planning under uncertainty problem strongly increases its complexity. We investigate some approaches to scheduling with many-objective heuristic search. We apply a multi-scenario many-objective scheduling approach to the Thames River basin water supply system planning problem in the UK. Decisions include which new supply and demand schemes to implement, at what capacity and when. The impact of different system uncertainties on scheme implementation schedules are explored, i.e. how the choice of future scenarios affects the search process and its outcomes. The activation of schemes is influenced by the occurrence of extreme hydrological events in the ensemble of plausible scenarios and other factors. The approach and results are compared with a previous study where only the portfolio problem is addressed (without scheduling).

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1991-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1991-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocations for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its applications to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1993-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Blood Glucose Levels and Problem Behavior

ERIC Educational Resources Information Center

Valdovinos, Maria G.; Weyand, David

2006-01-01

The relationship between varying blood glucose levels and problem behavior during daily scheduled activities was examined. The effects that varying blood glucose levels had on problem behavior during daily scheduled activities were examined. Prior research has shown that differing blood glucose levels can affect behavior and mood. Results of this…

Optimal steering for kinematic vehicles with applications to spatially distributed agents

NASA Astrophysics Data System (ADS)

Brown, Scott; Praeger, Cheryl E.; Giudici, Michael

While there is no universal method to address control problems involving networks of autonomous vehicles, there exist a few promising schemes that apply to different specific classes of problems, which have attracted the attention of many researchers from different fields. In particular, one way to extend techniques that address problems involving a single autonomous vehicle to those involving teams of autonomous vehicles is to use the concept of Voronoi diagram. The Voronoi diagram provides a spatial partition of the environment the team of vehicles operate in, where each element of this partition is associated with a unique vehicle from the team. The partition induces a graph abstraction of the operating space that is in an one-to-one correspondence with the network abstraction of the team of autonomous vehicles; a fact that can provide both conceptual and analytical advantages during mission planning and execution. In this dissertation, we propose the use of a new class of Voronoi-like partitioning schemes with respect to state-dependent proximity (pseudo-) metrics rather than the Euclidean distance or other generalized distance functions, which are typically used in the literature. An important nuance here is that, in contrast to the Euclidean distance, state-dependent metrics can succinctly capture system theoretic features of each vehicle from the team (e.g., vehicle kinematics), as well as the environment-vehicle interactions, which are induced, for example, by local winds/currents. We subsequently illustrate how the proposed concept of state-dependent Voronoi-like partition can induce local control schemes for problems involving networks of spatially distributed autonomous vehicles by examining a sequential pursuit problem of a maneuvering target by a group of pursuers distributed in the plane. The construction of generalized Voronoi diagrams with respect to state-dependent metrics poses some significant challenges. First, the generalized distance metric may be a function of the direction of motion of the vehicle (anisotropic pseudo-distance function) and/or may not be expressible in closed form. Second, such problems fall under the general class of partitioning problems for which the vehicles' dynamics must be taken into account. The topology of the vehicle's configuration space may be non-Euclidean, for example, it may be a manifold embedded in a Euclidean space. In other words, these problems may not be reducible to generalized Voronoi diagram problems for which efficient construction schemes, analytical and/or computational, exist in the literature. This research effort pursues three main objectives. First, we present the complete solution of different steering problems involving a single vehicle in the presence of motion constraints imposed by the maneuverability envelope of the vehicle and/or the presence of a drift field induced by winds/currents in its vicinity. The analysis of each steering problem involving a single vehicle provides us with a state-dependent generalized metric, such as the minimum time-to-go/come. We subsequently use these state-dependent generalized distance functions as the proximity metrics in the formulation of generalized Voronoi-like partitioning problems. The characterization of the solutions of these state-dependent Voronoi-like partitioning problems using either analytical or computational techniques constitutes the second main objective of this dissertation. The third objective of this research effort is to illustrate the use of the proposed concept of state-dependent Voronoi-like partition as a means for passing from control techniques that apply to problems involving a single vehicle to problems involving networks of spatially distributed autonomous vehicles. To this aim, we formulate the problem of sequential/relay pursuit of a maneuvering target by a group of spatially distributed pursuers and subsequently propose a distributed group pursuit strategy that directly derives from the solution of a state-dependent Voronoi-like partitioning problem. (Abstract shortened by UMI.)

Planning as a Precursor to Scheduling for Space Station Payload Operations

NASA Technical Reports Server (NTRS)

Howell, Eric; Maxwell, Theresa

1995-01-01

Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.

Spike: AI scheduling for Hubble Space Telescope after 18 months of orbital operations

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1992-01-01

This paper is a progress report on the Spike scheduling system, developed by the Space Telescope Science Institute for long-term scheduling of Hubble Space Telescope (HST) observations. Spike is an activity-based scheduler which exploits artificial intelligence (AI) techniques for constraint representation and for scheduling search. The system has been in operational use since shortly after HST launch in April 1990. Spike was adopted for several other satellite scheduling problems; of particular interest was the demonstration that the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. We describe the recent progress made in scheduling search techniques, the lessons learned from early HST operations, and the application of Spike to other problem domains. We also describe plans for the future evolution of the system.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Integrated Vehicle Ground Vibration Testing of Manned Spacecraft: Historical Precedent

NASA Technical Reports Server (NTRS)

Lemke, Paul R.; Tuma, Margaret L.; Askins, Bruce R.

2008-01-01

For the first time in nearly 30 years, NASA is developing a new manned space flight launch system. The Ares I will carry crew and cargo to not only the International Space Station, but onward for the future exploration of the Moon and Mars. The Ares I control system and structural designs use complex computer models for their development. An Integrated Vehicle Ground Vibration Test (IVGVT) will validate the efficacy of these computer models. The IVGVT will reduce the technical risk of unexpected conditions that could place the vehicle or crew in jeopardy. The Ares Project Office's Flight and Integrated Test Office commissioned a study to determine how historical programs, such as Saturn and Space Shuttle, validated the structural dynamics of an integrated flight vehicle. The study methodology was to examine the historical record and seek out members of the engineering community who recall the development of historic manned launch vehicles. These records and interviews provided insight into the best practices and lessons learned from these historic development programs. The information that was gathered allowed the creation of timelines of the historic development programs. The timelines trace the programs from the development of test articles through test preparation, test operations, and test data reduction efforts. These timelines also demonstrate how the historical tests fit within their overall vehicle development programs. Finally, the study was able to quantify approximate staffing levels during historic development programs. Using this study, the Flight and Integrated Test Office was able to evaluate the Ares I Integrated Vehicle Ground Vibration Test schedule and workforce budgets in light of the historical precedents to determine if the test had schedule or cost risks associated with it.

Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution

NASA Astrophysics Data System (ADS)

Kurnia, Hari; Gustri Wahyuni, Elyza; Cergas Pembrani, Elang; Gardini, Syifa Tri; Kurnia Aditya, Silfa

2018-03-01

The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Salesman Problem). These problems can be modeled using the Vehicle Routing Problem (VRP) algorithm with rating ranking, a cross order based crossing, and also order based mutation mutations on selected chromosomes. This study uses limitations using only 20 market points, 2 point warehouse (multi compartment) and 5 vehicles. It is determined that for one distribution, one vehicle can only distribute to 4 market points only from 1 particular warehouse, and also one such vehicle can only accommodate 100 kg capacity.

Effect of truck operating weight on heavy-duty diesel emissions.

PubMed

Gajendran, Prakash; Clark, Nigel N

2003-09-15

Heavy-duty diesel vehicles are substantial contributors of oxides of nitrogen (NO(x)) and particulate matter (PM) while carbon monoxide and hydrocarbon (HC) emissions from diesel vehicles receive less attention. Truck emissions inventories have traditionally employed average fuel economy and engine efficiency factors to translate certification into distance-specific (g/mi) data, so that inventories do not take into account the real effects of truck operating weight on emissions. The objective of this research was to examine weight corrections for class 7 and 8 vehicles (over 26 000 lb (11 793 kg) gross vehicle weight) from a theoretical point of view and to present a collection of original data on the topic. It was found by combining an empirical equation with theoretical truck loads that the NO(x) emissions increased by approximately 54% for a doubling of test weight. Emissions data were gathered from specific tests performed using different test weights and using various test schedules, which can consist of cycles or routes. It was found experimentally that NO(x) emissions have a nearly linear correlation with vehicle weight and did not vary much from vehicle to vehicle. NO(x) emissions were also found to be insensitive to transient operation in the test schedule. The observed trends correlate well with the theory presented, and hence, the NO(x) emissions can be predicted reasonably accurately using the theory. If NO(x) data were considered in fuel-specific (g/gal) units, they did not vary with the test weight. HC emissions were found to be insensitive to the vehicle weight. CO and PM emissions were found to be a strong function of weight during transient operation. Under transient operation, the CO emissions value increased by 36% for an increase in test weight from 42 000 (19 051 kg) to 56 000 lb (25 401 kg). However, CO and PM were found to be insensitive to the vehicle weight during nearly steady-state operation.

Strategic Gang Scheduling for Railroad Maintenance

DOT National Transportation Integrated Search

2012-08-14

We address the railway track maintenance scheduling problem. The problem stems from the : significant percentage of the annual budget invested by the railway industry for maintaining its railway : tracks. The process requires consideration of human r...

Intelsat satellite scheduled for launch

NASA Technical Reports Server (NTRS)

1981-01-01

The launch schedule for Intelsat 5-B, the prime Intelsat satellite to provide communications services between the Americas, Europe, the Middle East, and Africa, is presented. The planned placement of the satellite into an elliptical transfer orbit, and circularization of the orbit at geosynchronous altitude over the equator are described. Characteristics of the Atlas Centaur launch vehicle, AC-56, are given. The launch operation is summarized and the launch sequence presented. The Intelsat team and contractors are listed.

Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

NASA Astrophysics Data System (ADS)

Lazarev, A. A.

2009-02-01

An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

NASA Technical Reports Server (NTRS)

Drummond, Mark; Fox, Mark; Tate, Austin; Zweben, Monte

1992-01-01

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques.

Job Scheduling in a Heterogeneous Grid Environment

NASA Technical Reports Server (NTRS)

Shan, Hong-Zhang; Smith, Warren; Oliker, Leonid; Biswas, Rupak

2004-01-01

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

Uncertainty management by relaxation of conflicting constraints in production process scheduling

NASA Technical Reports Server (NTRS)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Simulated annealing with probabilistic analysis for solving traveling salesman problems

NASA Astrophysics Data System (ADS)

Hong, Pei-Yee; Lim, Yai-Fung; Ramli, Razamin; Khalid, Ruzelan

2013-09-01

Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals. Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP). Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test. SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions. Computational results show that the proposed annealing schedule provides a good quality of solution.

Guidance and Control Software,

DTIC Science & Technology

1980-05-01

commitments of function, cost, and schedule . The phrase "software engineering" was intended to contrast with the phrase "computer science" the latter aims...the software problems of cost, delivery schedule , and quality were gradually being recognized at the highest management levels. Thus, in a project... schedule dates. Although the analysis of software problems indicated that the entire software development process (figure 1) needed new methods, only

High performance techniques for space mission scheduling

NASA Technical Reports Server (NTRS)

Smith, Stephen F.

1994-01-01

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling Problems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

STS-33 Discovery, OV-103, in KSC Vehicle Assembly Bldg after ET/SRB mating

NASA Image and Video Library

1989-10-25

S89-49412 (25 Oct 1989) --- Preparations are underway to rollout the Space Shuttle orbiter Discovery from the Vehicle Assembly Building (VAB) to Pad 39B, as KSC employees work toward the mid-November launch of STS-33, a Department of Defense Devoted mission. Poor weather has thus far hampered attempts to roll out the Discovery and the next attempt is scheduled for midnight tomorrow.

Shuttle derived vehicle analysis solid booster unmanned launch vehicle concept definition study, volume 2

NASA Technical Reports Server (NTRS)

1983-01-01

The technical effort associated with the selection and definition of the recommended SRB-X concept is documented. Included are discussions concerning the trades leading to the selected concept, the analysis that established the concept's basic subsystem characteristics, selected configuration description and performance capabilities, launch site operations and facility needs, development schedule, cost characteristics, risk assessment, and a cursory comparison with other launch systems.

40 CFR 86.1811-10 - Emission standards for light-duty vehicles, light-duty trucks and medium-duty passenger vehicles.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 25 2013 50 2014 75 2015 and subsequent 100 (4) Alternate phase-in schedules for cold temperature NMHC... 2012 2013 2009 2010 2011 2012 2013 2014 2010 2011 2012 2013 2014 2011 2012 2013 Table S10-5—In-Use Standards for Applicable Phase-In HLDT/MDPVs Model Year of Introduction 2010 2011 2012 2013 2014 2015 Models...

Nighttime view of Apollo 9 space vehicle at Pad A, Launch Complex 39

NASA Image and Video Library

1969-02-23

S69-25879 (23 Feb. 1969) --- Nighttime view of the 363-feet-high Apollo 9 space vehicle at Pad A, Launch Complex 39, Kennedy Space Center, during preparations for the scheduled 10-day Earth-orbital space mission. The crew of the Apollo 9 (Spacecraft 104/Lunar Module 3/Saturn 504) space flight will be astronauts James A. McDivitt, David R. Scott, and Russell L. Schweickart.

40 CFR 86.115-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2013 CFR

2013-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission.... time relationships. They each consist of a distinct nonrepetitive series of idle, acceleration, cruise...

40 CFR 86.115-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2011 CFR

2011-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission.... time relationships. They each consist of a distinct nonrepetitive series of idle, acceleration, cruise...

40 CFR 86.115-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2012 CFR

2012-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission.... time relationships. They each consist of a distinct nonrepetitive series of idle, acceleration, cruise...

Transit transparency.

DOT National Transportation Integrated Search

2012-07-01

Public transit agencies have employed intelligent systems for determining : schedules and routes and for monitoring the real-time location and status of their : vehicle fleets for nearly two decades. But until recently, the data generated by : daily ...

A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

NASA Astrophysics Data System (ADS)

Pu, Xun; Lu, XianLiang

2011-10-01

Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

The role of artificial intelligence techniques in scheduling systems

NASA Technical Reports Server (NTRS)

Geoffroy, Amy L.; Britt, Daniel L.; Gohring, John R.

1990-01-01

Artificial Intelligence (AI) techniques provide good solutions for many of the problems which are characteristic of scheduling applications. However, scheduling is a large, complex heterogeneous problem. Different applications will require different solutions. Any individual application will require the use of a variety of techniques, including both AI and conventional software methods. The operational context of the scheduling system will also play a large role in design considerations. The key is to identify those places where a specific AI technique is in fact the preferable solution, and to integrate that technique into the overall architecture.

Controle d'attitude d'un lanceur en phase atmospherique approche par applications gardiennes

NASA Astrophysics Data System (ADS)

Dubanchet, Vincent

In a first phase, the modelling process underlines the presence of highly time varying parameters during the ascent, due to a fast mass variation along with propellant consumption. Linearizing the dynamical equations at six main flight instants yields linear time invariant models to be considered during control design. Each of them is to be stabilized by one control law, while respecting given specifications. The synthesis becomes even more complex when the bending modes are taken into account. Moreover, scheduling appears necessary to deal with the time variations. Indeed it is shown that no single gain setting is able to respect all the specifications along the trajectory. Furthermore, increasing complexity when modelling a whole launch vehicle pushes one to consider the model's errors and uncertainties. They represent a major issue in this study since it is asked to ensure the nominal performances in a robust fashion. Owing to their properties, guardian maps appear to be the most suitable tool to deal with such a problem of scheduling with robust performances. In light of this, the development of synthesis methods based on guardian maps is the main contribution of the project. It appears that actual state of the art in this field is focused on theoretical issues, whereas practical ones could be improved. Two approches are presented in the memoire. The first one is based on a graphical approach consisting in drawing the vanishing locus of guardian maps. A program using image analysis techniques is devised to check automatically which gain settings satisfy the constraints. The second one is based on an optimisation procedure involving guardian maps. Starting with the open loop system, the iterative process proposed ends up with a satisfactory gain setting for the closed-loop. These methods are tried and tested for the launch vehicle, with specifications from ASTRIUM-ST. Their practical application is motivated by the system complexity, the different kinds of constraints and the essential need for robustness. Many restrictions that finally bring about the interest and the efficiency of guardian maps for such a problem.

A new distributed systems scheduling algorithm: a swarm intelligence approach

NASA Astrophysics Data System (ADS)

Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

2011-12-01

The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

Solution and reasoning reuse in space planning and scheduling applications

NASA Technical Reports Server (NTRS)

Verfaillie, Gerard; Schiex, Thomas

1994-01-01

In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.

Toward interactive scheduling systems for managing medical resources.

PubMed

Oddi, A; Cesta, A

2000-10-01

Managers of medico-hospital facilities are facing two general problems when allocating resources to activities: (1) to find an agreement between several and contrasting requirements; (2) to manage dynamic and uncertain situations when constraints suddenly change over time due to medical needs. This paper describes the results of a research aimed at applying constraint-based scheduling techniques to the management of medical resources. A mixed-initiative problem solving approach is adopted in which a user and a decision support system interact to incrementally achieve a satisfactory solution to the problem. A running prototype is described called Interactive Scheduler which offers a set of functionalities for a mixed-initiative interaction to cope with the medical resource management. Interactive Scheduler is endowed with a representation schema used for describing the medical environment, a set of algorithms that address the specific problems of the domain, and an innovative interaction module that offers functionalities for the dialogue between the support system and its user. A particular contribution of this work is the explicit representation of constraint violations, and the definition of scheduling algorithms that aim at minimizing the amount of constraint violations in a solution.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.

PubMed

Wu, Zuobao; Weng, Michael X

2005-04-01

Flexible job-shop scheduling problems are an important extension of the classical job-shop scheduling problems and present additional complexity. Such problems are mainly due to the existence of a considerable amount of overlapping capacities with modern machines. Classical scheduling methods are generally incapable of addressing such capacity overlapping. We propose a multiagent scheduling method with job earliness and tardiness objectives in a flexible job-shop environment. The earliness and tardiness objectives are consistent with the just-in-time production philosophy which has attracted significant attention in both industry and academic community. A new job-routing and sequencing mechanism is proposed. In this mechanism, two kinds of jobs are defined to distinguish jobs with one operation left from jobs with more than one operation left. Different criteria are proposed to route these two kinds of jobs. Job sequencing enables to hold a job that may be completed too early. Two heuristic algorithms for job sequencing are developed to deal with these two kinds of jobs. The computational experiments show that the proposed multiagent scheduling method significantly outperforms the existing scheduling methods in the literature. In addition, the proposed method is quite fast. In fact, the simulation time to find a complete schedule with over 2000 jobs on ten machines is less than 1.5 min.

A space exploration strategy that promotes international and commercial participation

NASA Astrophysics Data System (ADS)

Arney, Dale C.; Wilhite, Alan W.; Chai, Patrick R.; Jones, Christopher A.

2014-01-01

NASA has created a plan to implement the Flexible Path strategy, which utilizes a heavy lift launch vehicle to deliver crew and cargo to orbit. In this plan, NASA would develop much of the transportation architecture (launch vehicle, crew capsule, and in-space propulsion), leaving the other in-space elements open to commercial and international partnerships. This paper presents a space exploration strategy that reverses that philosophy, where commercial and international launch vehicles provide launch services. Utilizing a propellant depot to aggregate propellant on orbit, smaller launch vehicles are capable of delivering all of the mass necessary for space exploration. This strategy has benefits to the architecture in terms of cost, schedule, and reliability.

Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem

NASA Astrophysics Data System (ADS)

Azis, Zainal; Mawengkang, Herman

2017-09-01

The heterogeneous vehicle routing problem (HVRP) is a variant of vehicle routing problem (VRP) which describes various types of vehicles with different capacity to serve a set of customers with known geographical locations. This paper considers the optimal service deliveries of meals of a catering company located in Medan City, Indonesia. Due to the road condition as well as traffic, it is necessary for the company to use different type of vehicle to fulfill customers demand in time. The HVRP incorporates time dependency of travel times on the particular time of the day. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. The problem can be modeled as a linear mixed integer program and we address a feasible neighbourhood search approach to solve the problem.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James

2014-01-01

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

40 CFR 86.515-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2014 CFR

2014-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... nonrepetitive series of idle, acceleration, cruise, and deceleration modes of various time sequences and rates...

40 CFR 86.515-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2012 CFR

2012-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... nonrepetitive series of idle, acceleration, cruise, and deceleration modes of various time sequences and rates...

40 CFR 86.515-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2011 CFR

2011-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... nonrepetitive series of idle, acceleration, cruise, and deceleration modes of various time sequences and rates...

40 CFR 86.115-78 - EPA dynamometer driving schedules.

Code of Federal Regulations, 2014 CFR

2014-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission..., acceleration, cruise, and deceleration modes of various time sequences and rates. (b) The driver should attempt...

40 CFR 86.515-78 - EPA urban dynamometer driving schedule.

Code of Federal Regulations, 2013 CFR

2013-07-01

... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... nonrepetitive series of idle, acceleration, cruise, and deceleration modes of various time sequences and rates...

Better service, greater efficiency : transit management for demand response systems

DOT National Transportation Integrated Search

1999-01-01

This brochure briefly describes different technologies which can enhance demand response transit systems. It covers automated scheduling and dispatching, mobile data terminals, electronic identification cards, automatic vehicle location, and geograph...

KENNEDY SPACE CENTER, FLA. -- Endeavour backs out of the Orbiter Processing Facility for temporary transfer to the Vehicle Assembly Building. The move allows work to be performed in the OPF that can only be accomplished while the bay is empty. Work scheduled in the OPF includes annual validation of the bay’s cranes, work platforms, lifting mechanisms and jack stands. Endeavour will remain in the VAB for approximately 12 days, then return to the OPF.

NASA Image and Video Library

2004-01-09

KENNEDY SPACE CENTER, FLA. -- Endeavour backs out of the Orbiter Processing Facility for temporary transfer to the Vehicle Assembly Building. The move allows work to be performed in the OPF that can only be accomplished while the bay is empty. Work scheduled in the OPF includes annual validation of the bay’s cranes, work platforms, lifting mechanisms and jack stands. Endeavour will remain in the VAB for approximately 12 days, then return to the OPF.

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem

PubMed Central

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764

Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems

DOE PAGES

Sundar, Kaarthik; Rathinam, Sivakumar

2016-12-26

Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–targetmore » constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.« less

A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

NASA Technical Reports Server (NTRS)

Wang, Lui; Valenzuela-Rendon, Manuel

1993-01-01

The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.

Learning Search Control Knowledge for Deep Space Network Scheduling

NASA Technical Reports Server (NTRS)

Gratch, Jonathan; Chien, Steve; DeJong, Gerald

1993-01-01

While the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, for specific distributions of problems and constraints, domain-specific solutions have been shown to perform in much better than exponential time.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Predit: A temporal predictive framework for scheduling systems

NASA Technical Reports Server (NTRS)

Paolucci, E.; Patriarca, E.; Sem, M.; Gini, G.

1992-01-01

Scheduling can be formalized as a Constraint Satisfaction Problem (CSP). Within this framework activities belonging to a plan are interconnected via temporal constraints that account for slack among them. Temporal representation must include methods for constraints propagation and provide a logic for symbolic and numerical deductions. In this paper we describe a support framework for opportunistic reasoning in constraint directed scheduling. In order to focus the attention of an incremental scheduler on critical problem aspects, some discrete temporal indexes are presented. They are also useful for the prediction of the degree of resources contention. The predictive method expressed through our indexes can be seen as a Knowledge Source for an opportunistic scheduler with a blackboard architecture.

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

NASA Astrophysics Data System (ADS)

Schumacher, André; Haanpää, Harri

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chvátal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

A Solution Method of Scheduling Problem with Worker Allocation by a Genetic Algorithm

NASA Astrophysics Data System (ADS)

Osawa, Akira; Ida, Kenichi

In a scheduling problem with worker allocation (SPWA) proposed by Iima et al, the worker's skill level to each machine is all the same. However, each worker has a different skill level for each machine in the real world. For that reason, we propose a new model of SPWA in which a worker has the different skill level to each machine. To solve the problem, we propose a new GA for SPWA consisting of the following new three procedures, shortening of idle time, modifying infeasible solution to feasible solution, and a new selection method for GA. The effectiveness of the proposed algorithm is clarified by numerical experiments using benchmark problems for job-shop scheduling.

Status of the irradiation test vehicle for testing fusion materials in the Advanced Test Reactor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsai, H.; Gomes, I.C.; Smith, D.L.

1998-09-01

The design of the irradiation test vehicle (ITV) for the Advanced Test Reactor (ATR) has been completed. The main application for the ITV is irradiation testing of candidate fusion structural materials, including vanadium-base alloys, silicon carbide composites, and low-activation steels. Construction of the vehicle is underway at the Lockheed Martin Idaho Technology Company (LMITCO). Dummy test trains are being built for system checkout and fine-tuning. Reactor insertion of the ITV with the dummy test trains is scheduled for fall 1998. Barring unexpected difficulties, the ITV will be available for experiments in early 1999.

Planning and Execution for an Autonomous Aerobot

NASA Technical Reports Server (NTRS)

Gaines, Daniel M.; Estlin, Tara A.; Schaffer, Steven R.; Chouinard, Caroline M.

2010-01-01

The Aerial Onboard Autonomous Science Investigation System (AerOASIS) system provides autonomous planning and execution capabilities for aerial vehicles (see figure). The system is capable of generating high-quality operations plans that integrate observation requests from ground planning teams, as well as opportunistic science events detected onboard the vehicle while respecting mission and resource constraints. AerOASIS allows an airborne planetary exploration vehicle to summarize and prioritize the most scientifically relevant data; identify and select high-value science sites for additional investigation; and dynamically plan, schedule, and monitor the various science activities being performed, even during extended communications blackout periods with Earth.

Psychometric Properties of the Disability Assessment Schedule (DAS) for Behavior Problems: An Independent Investigation

ERIC Educational Resources Information Center

Tsakanikos, Elias; Underwood, Lisa; Sturmey, Peter; Bouras, Nick; McCarthy, Jane

2011-01-01

The present study employed the Disability Assessment Schedule (DAS) to assess problem behaviors in a large sample of adults with ID (N = 568) and evaluate the psychometric properties of this instrument. Although the DAS problem behaviors were found to be internally consistent (Cronbach's [alpha] = 0.87), item analysis revealed one weak item…

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James L.

2010-01-01

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Scheduling: A guide for program managers

NASA Technical Reports Server (NTRS)

1994-01-01

The following topics are discussed concerning scheduling: (1) milestone scheduling; (2) network scheduling; (3) program evaluation and review technique; (4) critical path method; (5) developing a network; (6) converting an ugly duckling to a swan; (7) network scheduling problem; (8) (9) network scheduling when resources are limited; (10) multi-program considerations; (11) influence on program performance; (12) line-of-balance technique; (13) time management; (14) recapitulization; and (15) analysis.

Automated Scheduling Via Artificial Intelligence

NASA Technical Reports Server (NTRS)

Biefeld, Eric W.; Cooper, Lynne P.

1991-01-01

Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

NASA Astrophysics Data System (ADS)

Susilawati, Enny; Mawengkang, Herman; Efendi, Syahril

2018-01-01

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.

Scheduling for energy and reliability management on multiprocessor real-time systems

NASA Astrophysics Data System (ADS)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

Testing of the Eagle-Picher nickel-iron, the Globe ISOA lead-acid, and the Westinghouse nickel-iron battery subsystems in an electric-vehicle environment

NASA Technical Reports Server (NTRS)

Hewitt, R.; Bryant, J.

1982-01-01

Three full size developmental batteries were tested with electric vehicles; two nickel-iron batteries and a lead-acid battery. Constant speed and driving schedule tests were done on a chassis dynamometer. Several aspects of battery performance were evaluated for capacity, recharge efficiency, voltage response, and self discharge. Each of these three batteries exhibited some strengths and some weaknesses.

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Constellation Training Facility Support

NASA Technical Reports Server (NTRS)

Flores, Jose M.

2008-01-01

The National Aeronautics and Space Administration is developing the next set of vehicles that will take men back to the moon under the Constellation Program. The Constellation Training Facility (CxTF) is a project in development that will be used to train astronauts, instructors, and flight controllers on the operation of Constellation Program vehicles. It will also be used for procedure verification and validation of flight software and console tools. The CxTF will have simulations for the Crew Exploration Vehicle (CEV), Crew Module (CM), CEV Service Module (SM), Launch Abort System (LAS), Spacecraft Adapter (SA), Crew Launch Vehicle (CLV), Pressurized Cargo Variant CM, Pressurized Cargo Variant SM, Cargo Launch Vehicle, Earth Departure Stage (EDS), and the Lunar Surface Access Module (LSAM). The Facility will consist of part-task and full-task trainers, each with a specific set of mission training capabilities. Part task trainers will be used for focused training on a single vehicle system or set of related systems. Full task trainers will be used for training on complete vehicles and all of its subsystems. Support was provided in both software development and project planning areas of the CxTF project. Simulation software was developed for the hydraulic system of the Thrust Vector Control (TVC) of the ARES I launch vehicle. The TVC system is in charge of the actuation of the nozzle gimbals for navigation control of the upper stage of the ARES I rocket. Also, software was developed using C standards to send and receive data to and from hand controllers to be used in CxTF cockpit simulations. The hand controllers provided movement in all six rotational and translational axes. Under Project Planning & Control, support was provided to the development and maintenance of integrated schedules for both the Constellation Training Facility and Missions Operations Facilities Division. These schedules maintain communication between projects in different levels. The CxTF support provided is one that requires continuous maintenance since the project is still on initial development phases.

Surveillance and Delay Advisory System

DOT National Transportation Integrated Search

1999-08-01

The Federal Highway Administration's Office of Motor Carrier and Highway Safety began a 4-year research project in September 1997 to evaluate the role of motor carrier scheduling practices in interstate commercial motor vehicle (CMV) driver fatigue. ...

KSC-05PD-1633

NASA Technical Reports Server (NTRS)

2005-01-01

KENNEDY SPACE CENTER, FLA. Center Director Jim Kennedy (right) greets STS-114 Mission Specialist Soichi Noguchi after his landing at NASA Kennedy Space Center. The Return to Flight STS- 114 crew has returned to KSC to get ready for a second launch attempt aboard Space Shuttle Discovery. Behind Noguchi and Kennedy is astronaut Jerry Ross, who serves as chief of the Vehicle Integration Test Office at Johnson Space Center in Houston. Mission Commander Eileen Collins later told the media who waited nearby that since the scrub on July 13, the crew has focused on the on-orbit part of the mission and training for night landings using the Shuttle Training Aircraft. She praised the engineers and technicians who have been troubleshooting the elusive sensor problem and thanked them. STS-114 is scheduled to launch July 26 at 10:39 a.m. EDT from Launch Pad 39B.

Solving cyclical nurse scheduling problem using preemptive goal programming

NASA Astrophysics Data System (ADS)

Sundari, V. E.; Mardiyati, S.

2017-07-01

Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

NASA Astrophysics Data System (ADS)

Cruz-Chávez, Marco Antonio

2015-11-01

This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.

Plug-in hybrid electric vehicles in smart grid

NASA Astrophysics Data System (ADS)

Yao, Yin

In this thesis, in order to investigate the impact of charging load from plug-in hybrid electric vehicles (PHEVs), a stochastic model is developed in Matlab. In this model, two main types of PHEVs are defined: public transportation vehicles and private vehicles. Different charging time schedule, charging speed and battery capacity are considered for each type of vehicles. The simulation results reveal that there will be two load peaks (at noon and in evening) when the penetration level of PHEVs increases continuously to 30% in 2030. Therefore, optimization tool is utilized to shift load peaks. This optimization process is based on real time pricing and wind power output data. With the help of smart grid, power allocated to each vehicle could be controlled. As a result, this optimization could fulfill the goal of shifting load peaks to valley areas where real time price is low or wind output is high.

Surface Hold Advisor Using Critical Sections

NASA Technical Reports Server (NTRS)

Law, Caleb Hoi Kei (Inventor); Hsiao, Thomas Kun-Lung (Inventor); Mittler, Nathan C. (Inventor); Couluris, George J. (Inventor)

2013-01-01

The Surface Hold Advisor Using Critical Sections is a system and method for providing hold advisories to surface controllers to prevent gridlock and resolve crossing and merging conflicts among vehicles traversing a vertex-edge graph representing a surface traffic network on an airport surface. The Advisor performs pair-wise comparisons of current position and projected path of each vehicle with other surface vehicles to detect conflicts, determine critical sections, and provide hold advisories to traffic controllers recommending vehicles stop at entry points to protected zones around identified critical sections. A critical section defines a segment of the vertex-edge graph where vehicles are in crossing or merging or opposite direction gridlock contention. The Advisor detects critical sections without reference to scheduled, projected or required times along assigned vehicle paths, and generates hold advisories to prevent conflicts without requiring network path direction-of-movement rules and without requiring rerouting, rescheduling or other network optimization solutions.

Genetic algorithms for the vehicle routing problem

NASA Astrophysics Data System (ADS)

Volna, Eva

2016-06-01

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

Block Scheduling in High Schools.

ERIC Educational Resources Information Center

Irmsher, Karen

1996-01-01

Block Scheduling has been considered a cure for a lengthy list of educational problems. This report reviews the literature on block schedules and describes some Oregon high schools that have integrated block scheduling. Major disadvantages included resistance to change and requirements that teachers change their teaching strategies. There is…