Science.gov

Sample records for agv scheduling tasks

  1. Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization.

    PubMed

    Mousavi, Maryam; Yap, Hwa Jen; Musa, Siti Nurmaya; Tahriri, Farzad; Md Dawal, Siti Zawiah

    2017-01-01

    Flexible manufacturing system (FMS) enhances the firm's flexibility and responsiveness to the ever-changing customer demand by providing a fast product diversification capability. Performance of an FMS is highly dependent upon the accuracy of scheduling policy for the components of the system, such as automated guided vehicles (AGVs). An AGV as a mobile robot provides remarkable industrial capabilities for material and goods transportation within a manufacturing facility or a warehouse. Allocating AGVs to tasks, while considering the cost and time of operations, defines the AGV scheduling process. Multi-objective scheduling of AGVs, unlike single objective practices, is a complex and combinatorial process. In the main draw of the research, a mathematical model was developed and integrated with evolutionary algorithms (genetic algorithm (GA), particle swarm optimization (PSO), and hybrid GA-PSO) to optimize the task scheduling of AGVs with the objectives of minimizing makespan and number of AGVs while considering the AGVs' battery charge. Assessment of the numerical examples' scheduling before and after the optimization proved the applicability of all the three algorithms in decreasing the makespan and AGV numbers. The hybrid GA-PSO produced the optimum result and outperformed the other two algorithms, in which the mean of AGVs operation efficiency was found to be 69.4, 74, and 79.8 percent in PSO, GA, and hybrid GA-PSO, respectively. Evaluation and validation of the model was performed by simulation via Flexsim software.

  2. Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization

    PubMed Central

    Yap, Hwa Jen; Musa, Siti Nurmaya; Tahriri, Farzad; Md Dawal, Siti Zawiah

    2017-01-01

    Flexible manufacturing system (FMS) enhances the firm’s flexibility and responsiveness to the ever-changing customer demand by providing a fast product diversification capability. Performance of an FMS is highly dependent upon the accuracy of scheduling policy for the components of the system, such as automated guided vehicles (AGVs). An AGV as a mobile robot provides remarkable industrial capabilities for material and goods transportation within a manufacturing facility or a warehouse. Allocating AGVs to tasks, while considering the cost and time of operations, defines the AGV scheduling process. Multi-objective scheduling of AGVs, unlike single objective practices, is a complex and combinatorial process. In the main draw of the research, a mathematical model was developed and integrated with evolutionary algorithms (genetic algorithm (GA), particle swarm optimization (PSO), and hybrid GA-PSO) to optimize the task scheduling of AGVs with the objectives of minimizing makespan and number of AGVs while considering the AGVs’ battery charge. Assessment of the numerical examples’ scheduling before and after the optimization proved the applicability of all the three algorithms in decreasing the makespan and AGV numbers. The hybrid GA-PSO produced the optimum result and outperformed the other two algorithms, in which the mean of AGVs operation efficiency was found to be 69.4, 74, and 79.8 percent in PSO, GA, and hybrid GA-PSO, respectively. Evaluation and validation of the model was performed by simulation via Flexsim software. PMID:28263994

  3. Dynamic Task Assignment of Autonomous Distributed AGV in an Intelligent FMS Environment

    NASA Astrophysics Data System (ADS)

    Fauadi, Muhammad Hafidz Fazli Bin Md; Lin, Hao Wen; Murata, Tomohiro

    The need of implementing distributed system is growing significantly as it is proven to be effective for organization to be flexible against a highly demanding market. Nevertheless, there are still large technical gaps need to be addressed to gain significant achievement. We propose a distributed architecture to control Automated Guided Vehicle (AGV) operation based on multi-agent architecture. System architectures and agents' functions have been designed to support distributed control of AGV. Furthermore, enhanced agent communication protocol has been configured to accommodate dynamic attributes of AGV task assignment procedure. Result proved that the technique successfully provides a better solution.

  4. Petri Net Decomposition Method for Simultaneous Optimization of Task Assignment and Routing for AGVs

    NASA Astrophysics Data System (ADS)

    Tanaka, Yuki; Nishi, Tatsushi; Inuiguchi, Masahiro

    We propose a simultaneous optimization method for task assignment and routing problems with multiple AGVs by the decomposition of Petri Nets. In the proposed method, Petri Net is decomposed into several subnets representing task subproblems and AGV subproblems. Each subproblem is solved by Dijkstra's algorithm. The subproblem on each subnet is repeatedly solved until a feasible solution for the original problem is derived. A solution method for subproblems with no final marking is newly developed. The effectiveness of the proposed method is demonstrated by comparing the performance with CPLEX as well as a nearest neighborhood heuristic method.

  5. Scheduling Tasks In Parallel Processing

    NASA Technical Reports Server (NTRS)

    Price, Camille C.; Salama, Moktar A.

    1989-01-01

    Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.

  6. Ada task scheduling: A focused Ada investigation

    NASA Technical Reports Server (NTRS)

    Legrand, Sue

    1988-01-01

    The types of control that are important for real time task scheduling are discussed. Some closely related real time issues are mentioned and major committee and research activities in this area are delineated. Although there are some problems with Ada and its real time task scheduling, Ada presents fewer than any known alternative. Ada was designed for the domain of real time embedded systems, but Ada compilers may not contain a level of task scheduling support that is adequate for all real time applications. The question addressed is which implementations of Ada's task scheduling are adequate for effective real time systems for NASA applications.

  7. Fault-tolerant dynamic task graph scheduling

    SciTech Connect

    Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan

    2014-11-16

    In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.

  8. Hybrid Scheduling Model for Independent Grid Tasks

    PubMed Central

    Shanthini, J.; Kalaikumaran, T.; Karthik, S.

    2015-01-01

    Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of makespan, which measures the machine utilization. In this paper, we propose a hybrid scheduling algorithm for scheduling independent grid tasks with the objective of reducing total weighted tardiness of grid tasks. Tardiness is to measure the due date performance, which has a direct impact on cost for executing the jobs. In this paper we propose BG_ATC algorithm which is a combination of best gap (BG) search and Apparent Tardiness Cost (ATC) indexing algorithm. Furthermore, we implemented these two algorithms in two different phases of the scheduling process. In addition to that, the comparison was made on results with various benchmark algorithms and the experimental results show that our algorithm outperforms the benchmark algorithms. PMID:26543897

  9. An Improved Ant Algorithm for Grid Task Scheduling Strategy

    NASA Astrophysics Data System (ADS)

    Wei, Laizhi; Zhang, Xiaobin; Li, Yun; Li, Yujie

    Task scheduling is an important factor that directly influences the performance and efficiency of the system. Grid resources are usually distributed in different geographic locations, belonging to different organizations and resources' properties are vastly different, in order to complete efficiently, intelligently task scheduling, the choice of scheduling strategy is essential. This paper proposes an improved ant algorithm for grid task scheduling strategy, by introducing a new type pheromone and a new node redistribution selection rule. On the one hand, the algorithm can track performances of resources and tag it. On the other hand, add algorithm to deal with task scheduling unsuccessful situations that improve the algorithm's robustness and the successful probability of task allocation and reduce unnecessary overhead of system, shortening the total time to complete tasks. The data obtained from simulation experiment shows that use this algorithm to resolve schedule problem better than traditional ant algorithm.

  10. Multi-agent tasks scheduling system in software defined networks

    NASA Astrophysics Data System (ADS)

    Skobelev, P. O.; Granichin, O. N.; Budaev, D. S.; Laryukhin, V. B.; Mayorov, I. V.

    2014-05-01

    In this paper a multi-agent tasks scheduling system in software defined networks is considered. This system is designed for distribution simulation and tasks implementation on computational resources including network dynamic characteristics and topology.

  11. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    NASA Astrophysics Data System (ADS)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

  12. Task scheduling for high performance low power embedded computing

    NASA Astrophysics Data System (ADS)

    Deniziak, Stanislaw; Dzitkowski, Albert

    2016-12-01

    In this paper we present a method of task scheduling for low-power real-time embedded systems. We assume that the system is specified as a task graph, then it is implemented using multi-core embedded processor with low-power processing capabilities. We propose a new scheduling method to create the optimal schedule. The goal of optimization is to minimize the power consumption while all time constraints will be satisfied. We present experimental results, obtained for some standard benchmarks, showing advantages of our method.

  13. Temporal knowledge representation for scheduling tasks in clinical trial protocols.

    PubMed Central

    Weng, Chunhua; Kahn, Michael; Gennari, John

    2002-01-01

    Clinical trial protocols include detailed temporal constraints on treatment and associated tasks. Unlike health-care guidelines, protocols are highly prescriptive. Therefore, informatics applications that enforce such temporal constraints are more directly useful with protocols than with guidelines. Although there are some temporal knowledge representation efforts for health-care guidelines, we find these to be insufficiently expressive for clinical trial protocols. In this paper, we focus on temporal knowledge representation for clinical trial protocols and the task of patient-specific scheduling in protocols. We define a temporal ontology, use it to encode clinical trial protocols, and describe a prototype tool to carry out patient-specific scheduling for the tasks in protocols. We predict that an expressive temporal knowledge representation can support a number of scheduling and management tasks for protocol-based care. PMID:12463951

  14. AGENDA: A task organizer and scheduler

    NASA Technical Reports Server (NTRS)

    Fratter, Isabelle

    1993-01-01

    AGENDA will be the main tool used in running the SPOT 4 Earth Observation Satellite's Operational Control Center. It will reduce the operator's work load and make the task easier. AGENDA sets up the work plan for a day of operations, automatically puts the day's tasks into sequence and monitors their progress in real time. Monitoring is centralized, and the tasks are run on different computers in the Center. Once informed of any problems, the operator can intervene at any time while an activity is taking place. To carry out the various functions, the operator has an advanced, efficient, ergonomic graphic interface based on X11 and OSF/MOTIF. Since AGENDA is the heart of the Center, it has to satisfy several constraints that have been taken into account during the various development phases. AGENDA is currently in its final development stages.

  15. In-Space Crew-Collaborative Task Scheduling

    NASA Technical Reports Server (NTRS)

    Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

    2006-01-01

    As humans venture farther from earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, there are many reasons why the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

  16. In-Space Crew-Collaborative Task Scheduling

    NASA Technical Reports Server (NTRS)

    Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

    2006-01-01

    As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

  17. Remote Collaboration on Task Scheduling for Humans at Mars

    NASA Technical Reports Server (NTRS)

    Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

    2006-01-01

    As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

  18. Cluster Scheduling for Explicitly-Speculative Tasks

    DTIC Science & Technology

    2004-12-01

    Colette Wilkins and the Dalcroze Eurhyth- mics faculty taught me and encouraged my musical aspirations. Closest to me are my late mom , my dad , sister...cost-based metrics for users. These aspects can lead to higher billed server utilization, encouraging batchactive adoption by resource providers...users eventually desire matter — leading me to introduce the ‘visible response time’ metric which accrues for each task in a batch of potentially

  19. Design issues in the semantics and scheduling of asynchronous tasks.

    SciTech Connect

    Olivier, Stephen L.

    2013-07-01

    The asynchronous task model serves as a useful vehicle for shared memory parallel programming, particularly on multicore and manycore processors. As adoption of model among programmers has increased, support has emerged for the integration of task parallel language constructs into mainstream programming languages, e.g., C and C++. This paper examines some of the design decisions in Cilk and OpenMP concerning semantics and scheduling of asynchronous tasks with the aim of informing the efforts of committees considering language integration, as well as developers of new task parallel languages and libraries.

  20. Considerations for Using an Incremental Scheduler for Human Exploration Task Scheduling

    NASA Technical Reports Server (NTRS)

    Jaap, John; Phillips, Shaun

    2005-01-01

    As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks.

  1. Joint scheduling and resource allocation for multiple video decoding tasks

    NASA Astrophysics Data System (ADS)

    Foo, Brian; van der Schaar, Mihaela

    2008-01-01

    In this paper we propose a joint resource allocation and scheduling algorithm for video decoding on a resource-constrained system. By decomposing a multimedia task into decoding jobs using quality-driven priority classes, we demonstrate using queuing theoretic analysis that significant power savings can be achieved under small video quality degradation without requiring the encoder to adapt its transmitted bitstream. Based on this scheduling algorithm, we propose an algorithm for maximizing the sum of video qualities in a multiple task environment, while minimizing system energy consumption, without requiring tasks to reveal information about their performances to the system or to other potentially exploitative applications. Importantly, we offer a method to optimize the performance of multiple video decoding tasks on an energy-constrained system, while protecting private information about the system and the applications.

  2. Sort-Mid tasks scheduling algorithm in grid computing.

    PubMed

    Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

    2015-11-01

    Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

  3. In-Space Crew-Collaborative Task Scheduling

    NASA Technical Reports Server (NTRS)

    Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

    2007-01-01

    For all past and current human space missions, the final scheduling of tasks to be done in space has been devoid of crew control, flexibility, and insight. Ground controllers, with minimal input from the crew, schedule the tasks and uplink the timeline to the crew or uplink the command sequences to the hardware. Prior to the International Space Station (ISS), the crew could make requests about tomorrow s timeline, they could omit a task, or they could request that something in the timeline be delayed. This lack of control over one's own schedule has had negative consequences. There is anecdotal consensus among astronauts that control over their own schedules will mitigate the stresses of long duration missions. On ISS, a modicum of crew control is provided by the job jar. Ground controllers prepare a task list (a.k.a. "job jar") of non-conflicting tasks from which jobs can be chosen by the in space crew. Because there is little free time and few interesting non-conflicting activities, the task-list approach provides little relief from the tedium of being micro-managed by the timeline. Scheduling for space missions is a complex and laborious undertaking which usually requires a large cadre of trained specialists and suites of complex software tools. It is a giant leap from today s ground prepared timeline (with a job jar) to full crew control of the timeline. However, technological advances, currently in-work or proposed, make it reasonable to consider scheduling a collaborative effort by the ground-based teams and the in-space crew. Collaboration would allow the crew to make minor adjustments, add tasks according to their preferences, understand the reasons for the placement of tasks on the timeline, and provide them a sense of control. In foreseeable but extraordinary situations, such as a quick response to anomalies and extended or unexpected loss of signal, the crew should have the autonomous ability to make appropriate modifications to the timeline, extend the

  4. Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems

    NASA Astrophysics Data System (ADS)

    Sun, Wei; Yu, Chen; Défago, Xavier; Inoguchi, Yasushi

    The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. The primary-backup (PB) approach is often used as a fault-tolerant technique to guarantee the deadlines of tasks despite the presence of faults. In this paper we propose a dynamic PB-based task scheduling approach, wherein an allocation parameter is used to search the available time slots for a newly arriving task, and the previously scheduled tasks can be re-scheduled when there is no available time slot for the newly arriving task. In order to improve the schedulability we also propose an overloading strategy for PB-overloading and Backup-backup (BB) overloading. Our proposed task scheduling algorithm is compared with some existing scheduling algorithms in the literature through simulation studies. The results have shown that the task rejection ratio of our real-time task scheduling algorithm is almost 50% lower than the compared algorithms.

  5. User-Assisted Store Recycling for Dynamic Task Graph Schedulers

    SciTech Connect

    Kurt, Mehmet Can; Krishnamoorthy, Sriram; Agrawal, Gagan; Ren, Bin

    2016-12-28

    The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

  6. Astronomical observation tasks short-term scheduling using PDDS algorithm

    NASA Astrophysics Data System (ADS)

    Kornilov, M. V.

    2016-07-01

    A concept of the ground-based optical astronomical observation efficiency is considered in this paper. We believe that a telescope efficiency can be increased by properly allocating observation tasks with respect to the current environment state and probability to obtain the data with required properties under the current conditions. An online observations scheduling is assumed to be an essential part for raising the efficiency. The short-term online scheduling is treated as the discrete optimisation problems which are stated using several abstraction levels. The optimisation problems are solved using the parallel depth-bounded discrepancy search (PDDS) algorithm by Moisan et al. (2014). Some aspects of the algorithm performance are discussed. The presented algorithm is a core of open-source chelyabinsk C++ library which is planned to be used at 2.5 m telescope of Sternberg Astronomical Institute of Lomonosov Moscow State University.

  7. The Effects of Practice Schedule on Learning a Complex Judgment Task

    ERIC Educational Resources Information Center

    Helsdingen, Anne S.; van Gog, Tamara; van Merrienboer, Jeroen J. G.

    2011-01-01

    The effects of practice schedule on learning a complex judgment task were investigated. In Experiment 1, participants' judgment accuracy on a retention test was higher after a random practice schedule than after a blocked schedule or operational schedule. Experiment 2 demonstrated that judgment on a transfer test was also better after a random…

  8. Reinforcement learning in scheduling

    NASA Technical Reports Server (NTRS)

    Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad

    1994-01-01

    The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.

  9. Machine Learning Based Online Performance Prediction for Runtime Parallelization and Task Scheduling

    SciTech Connect

    Li, J; Ma, X; Singh, K; Schulz, M; de Supinski, B R; McKee, S A

    2008-10-09

    With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as well as developing next-generation software requires assistance from hardware, compilers and runtime systems to exploit parallelism transparently within applications. These systems must decompose applications into tasks that can be executed in parallel and then schedule those tasks to minimize load imbalance. However, many systems lack a priori knowledge about the execution time of all tasks to perform effective load balancing with low scheduling overhead. In this paper, we approach this fundamental problem using machine learning techniques first to generate performance models for all tasks and then applying those models to perform automatic performance prediction across program executions. We also extend an existing scheduling algorithm to use generated task cost estimates for online task partitioning and scheduling. We implement the above techniques in the pR framework, which transparently parallelizes scripts in the popular R language, and evaluate their performance and overhead with both a real-world application and a large number of synthetic representative test scripts. Our experimental results show that our proposed approach significantly improves task partitioning and scheduling, with maximum improvements of 21.8%, 40.3% and 22.1% and average improvements of 15.9%, 16.9% and 4.2% for LMM (a real R application) and synthetic test cases with independent and dependent tasks, respectively.

  10. Investigation of automated task learning, decomposition and scheduling

    NASA Technical Reports Server (NTRS)

    Livingston, David L.; Serpen, Gursel; Masti, Chandrashekar L.

    1990-01-01

    The details and results of research conducted in the application of neural networks to task planning and decomposition are presented. Task planning and decomposition are operations that humans perform in a reasonably efficient manner. Without the use of good heuristics and usually much human interaction, automatic planners and decomposers generally do not perform well due to the intractable nature of the problems under consideration. The human-like performance of neural networks has shown promise for generating acceptable solutions to intractable problems such as planning and decomposition. This was the primary reasoning behind attempting the study. The basis for the work is the use of state machines to model tasks. State machine models provide a useful means for examining the structure of tasks since many formal techniques have been developed for their analysis and synthesis. It is the approach to integrate the strong algebraic foundations of state machines with the heretofore trial-and-error approach to neural network synthesis.

  11. 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

  12. Task analysis and application services for cross-organizational scheduling and citizen eBooking.

    PubMed

    Mykkänen, Juha; Tuomainen, Mika; Kortekangas, Pirkko; Niska, Anne

    2009-01-01

    In this paper, we present generalized results from the task analysis and definition of software services to support healthcare appointment and services scheduling, based on national coordination project for citizen e-services in Finland which involves several regional initiatives. The results are part of guidelines for regional-level and national-level scheduling solutions in Finland, and can be used in similar efforts. The specification of a functional reference model and software services for appointment scheduling promotes interoperability and systems adaptability for the transformation of health services and citizen empowerment.

  13. The Effects of Task Fluency and Concurrent Reinforcement Schedules on Student Choice Allocation between Math Tasks

    ERIC Educational Resources Information Center

    Zaman, Maliha

    2010-01-01

    Students may avoid working on difficult tasks because it takes them longer to complete those tasks, which results in a delay to reinforcement. Research studies show that reinforcer and response dimensions can be manipulated within a concurrent operants framework to bias choice allocation toward more difficult tasks. The current study extends…

  14. Hybrid Symbiotic Organisms Search Optimization Algorithm for Scheduling of Tasks on Cloud Computing Environment

    PubMed Central

    Abdullahi, Mohammed; Ngadi, Md Asri

    2016-01-01

    Cloud computing has attracted significant attention from research community because of rapid migration rate of Information Technology services to its domain. Advances in virtualization technology has made cloud computing very popular as a result of easier deployment of application services. Tasks are submitted to cloud datacenters to be processed on pay as you go fashion. Task scheduling is one the significant research challenges in cloud computing environment. The current formulation of task scheduling problems has been shown to be NP-complete, hence finding the exact solution especially for large problem sizes is intractable. The heterogeneous and dynamic feature of cloud resources makes optimum task scheduling non-trivial. Therefore, efficient task scheduling algorithms are required for optimum resource utilization. Symbiotic Organisms Search (SOS) has been shown to perform competitively with Particle Swarm Optimization (PSO). The aim of this study is to optimize task scheduling in cloud computing environment based on a proposed Simulated Annealing (SA) based SOS (SASOS) in order to improve the convergence rate and quality of solution of SOS. The SOS algorithm has a strong global exploration capability and uses fewer parameters. The systematic reasoning ability of SA is employed to find better solutions on local solution regions, hence, adding exploration ability to SOS. Also, a fitness function is proposed which takes into account the utilization level of virtual machines (VMs) which reduced makespan and degree of imbalance among VMs. CloudSim toolkit was used to evaluate the efficiency of the proposed method using both synthetic and standard workload. Results of simulation showed that hybrid SOS performs better than SOS in terms of convergence speed, response time, degree of imbalance, and makespan. PMID:27348127

  15. Hybrid Symbiotic Organisms Search Optimization Algorithm for Scheduling of Tasks on Cloud Computing Environment.

    PubMed

    Abdullahi, Mohammed; Ngadi, Md Asri

    2016-01-01

    Cloud computing has attracted significant attention from research community because of rapid migration rate of Information Technology services to its domain. Advances in virtualization technology has made cloud computing very popular as a result of easier deployment of application services. Tasks are submitted to cloud datacenters to be processed on pay as you go fashion. Task scheduling is one the significant research challenges in cloud computing environment. The current formulation of task scheduling problems has been shown to be NP-complete, hence finding the exact solution especially for large problem sizes is intractable. The heterogeneous and dynamic feature of cloud resources makes optimum task scheduling non-trivial. Therefore, efficient task scheduling algorithms are required for optimum resource utilization. Symbiotic Organisms Search (SOS) has been shown to perform competitively with Particle Swarm Optimization (PSO). The aim of this study is to optimize task scheduling in cloud computing environment based on a proposed Simulated Annealing (SA) based SOS (SASOS) in order to improve the convergence rate and quality of solution of SOS. The SOS algorithm has a strong global exploration capability and uses fewer parameters. The systematic reasoning ability of SA is employed to find better solutions on local solution regions, hence, adding exploration ability to SOS. Also, a fitness function is proposed which takes into account the utilization level of virtual machines (VMs) which reduced makespan and degree of imbalance among VMs. CloudSim toolkit was used to evaluate the efficiency of the proposed method using both synthetic and standard workload. Results of simulation showed that hybrid SOS performs better than SOS in terms of convergence speed, response time, degree of imbalance, and makespan.

  16. Increasing On-Task Behavior Using Teacher Attention Delivered on a Fixed-Time Schedule

    ERIC Educational Resources Information Center

    Riley, Jessica L.; McKevitt, Brian C.; Shriver, Mark D.; Allen, Keith D.

    2011-01-01

    The effectiveness of fixed-time delivery of attention to increase the on-task behavior of 2 students in general education was examined. The teacher in this study provided attention to students on a 5-min fixed-time schedule and responded to students in her typical manner between cued intervals. An ABAB withdrawal design was used to test the…

  17. Research on Scheduling Algorithm for Multi-satellite and Point Target Task on Swinging Mode

    NASA Astrophysics Data System (ADS)

    Wang, M.; Dai, G.; Peng, L.; Song, Z.; Chen, G.

    2012-12-01

    Nowadays, using satellite in space to observe ground is an important and major method to obtain ground information. With the development of the scientific technology in the field of space, many fields such as military and economic and other areas have more and more requirement of space technology because of the benefits of the satellite's widespread, timeliness and unlimited of area and country. And at the same time, because of the wide use of all kinds of satellites, sensors, repeater satellites and ground receiving stations, ground control system are now facing great challenge. Therefore, how to make the best value of satellite resources so as to make full use of them becomes an important problem of ground control system. Satellite scheduling is to distribute the resource to all tasks without conflict to obtain the scheduling result so as to complete as many tasks as possible to meet user's requirement under considering the condition of the requirement of satellites, sensors and ground receiving stations. Considering the size of the task, we can divide tasks into point task and area task. This paper only considers point targets. In this paper, a description of satellite scheduling problem and a chief introduction of the theory of satellite scheduling are firstly made. We also analyze the restriction of resource and task in scheduling satellites. The input and output flow of scheduling process are also chiefly described in the paper. On the basis of these analyses, we put forward a scheduling model named as multi-variable optimization model for multi-satellite and point target task on swinging mode. In the multi-variable optimization model, the scheduling problem is transformed the parametric optimization problem. The parameter we wish to optimize is the swinging angle of every time-window. In the view of the efficiency and accuracy, some important problems relating the satellite scheduling such as the angle relation between satellites and ground targets, positive

  18. Task path planning, scheduling and learning for free-ranging robot systems

    NASA Technical Reports Server (NTRS)

    Wakefield, G. Steve

    1987-01-01

    The development of robotics applications for space operations is often restricted by the limited movement available to guided robots. Free ranging robots can offer greater flexibility than physically guided robots in these applications. Presented here is an object oriented approach to path planning and task scheduling for free-ranging robots that allows the dynamic determination of paths based on the current environment. The system also provides task learning for repetitive jobs. This approach provides a basis for the design of free-ranging robot systems which are adaptable to various environments and tasks.

  19. TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds.

    PubMed

    Yuan, Haitao; Bi, Jing; Tan, Wei; Zhou, MengChu; Li, Bo Hu; Li, Jianqiang

    2016-07-09

    The economy of scale provided by cloud attracts a growing number of organizations and industrial companies to deploy their applications in cloud data centers (CDCs) and to provide services to users around the world. The uncertainty of arriving tasks makes it a big challenge for private CDC to cost-effectively schedule delay bounded tasks without exceeding their delay bounds. Unlike previous studies, this paper takes into account the cost minimization problem for private CDC in hybrid clouds, where the energy price of private CDC and execution price of public clouds both show the temporal diversity. Then, this paper proposes a temporal task scheduling algorithm (TTSA) to effectively dispatch all arriving tasks to private CDC and public clouds. In each iteration of TTSA, the cost minimization problem is modeled as a mixed integer linear program and solved by a hybrid simulated-annealing particle-swarm-optimization. The experimental results demonstrate that compared with the existing methods, the optimal or suboptimal scheduling strategy produced by TTSA can efficiently increase the throughput and reduce the cost of private CDC while meeting the delay bounds of all the tasks.

  20. Design and analysis of self-adapted task scheduling strategies in wireless sensor networks.

    PubMed

    Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong

    2011-01-01

    In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm's ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms.

  1. Using Activity Schedules to Increase On-Task Behavior in Children at Risk for Attention-Deficit/Hyperactivity Disorder

    ERIC Educational Resources Information Center

    Cirelli, Christe A.; Sidener, Tina M.; Reeve, Kenneth F.; Reeve, Sharon A.

    2016-01-01

    The effects of activity schedules on on-task and on-schedule behavior were assessed with two boys at risk for attention-deficit/hyperactivity disorder (ADHD) and referred by their public school teachers as having difficulty during independent work time. On-task behavior increased for both participants after two training sessions. Teachers, peers,…

  2. Multi-Satellite Scheduling Approach for Dynamic Areal Tasks Triggered by Emergent Disasters

    NASA Astrophysics Data System (ADS)

    Niu, X. N.; Zhai, X. J.; Tang, H.; Wu, L. X.

    2016-06-01

    The process of satellite mission scheduling, which plays a significant role in rapid response to emergent disasters, e.g. earthquake, is used to allocate the observation resources and execution time to a series of imaging tasks by maximizing one or more objectives while satisfying certain given constraints. In practice, the information obtained of disaster situation changes dynamically, which accordingly leads to the dynamic imaging requirement of users. We propose a satellite scheduling model to address dynamic imaging tasks triggered by emergent disasters. The goal of proposed model is to meet the emergency response requirements so as to make an imaging plan to acquire rapid and effective information of affected area. In the model, the reward of the schedule is maximized. To solve the model, we firstly present a dynamic segmenting algorithm to partition area targets. Then the dynamic heuristic algorithm embedding in a greedy criterion is designed to obtain the optimal solution. To evaluate the model, we conduct experimental simulations in the scene of Wenchuan Earthquake. The results show that the simulated imaging plan can schedule satellites to observe a wider scope of target area. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

  3. A distributed computing environment with support for constraint-based task scheduling and scientific experimentation

    SciTech Connect

    Ahrens, J.P.; Shapiro, L.G.; Tanimoto, S.L.

    1997-04-01

    This paper describes a computing environment which supports computer-based scientific research work. Key features include support for automatic distributed scheduling and execution and computer-based scientific experimentation. A new flexible and extensible scheduling technique that is responsive to a user`s scheduling constraints, such as the ordering of program results and the specification of task assignments and processor utilization levels, is presented. An easy-to-use constraint language for specifying scheduling constraints, based on the relational database query language SQL, is described along with a search-based algorithm for fulfilling these constraints. A set of performance studies show that the environment can schedule and execute program graphs on a network of workstations as the user requests. A method for automatically generating computer-based scientific experiments is described. Experiments provide a concise method of specifying a large collection of parameterized program executions. The environment achieved significant speedups when executing experiments; for a large collection of scientific experiments an average speedup of 3.4 on an average of 5.5 scheduled processors was obtained.

  4. Adaptation of human routines to support a robot's tasks planning and scheduling

    NASA Astrophysics Data System (ADS)

    Tikanmäki, Antti; Feliu, Sandra T.; Röning, Juha

    2013-12-01

    Service robots usually share their workspace with people. Typically, a robot's tasks require knowing when and where people are, to be able to schedule requested tasks. Therefore, there exists the need to take into account the presence of humans when planning their actions and it is indispensable to have knowledge of robots' environments. It means in practice knowing when (time and events duration) and where (in workspace) a robot's tasks can be performed. This research paper takes steps towards obtaining of the spatial information required to execute software to plan tasks to be performed by a robot. With this aim, a program capable to define meaningful areas or zones in the robot workspace by the use of a clustering is created tied with statistically reasoned time slots when to perform each task. The software is tested using real data obtained from different cameras located along the corridors of CSE Department of University of Oulu.

  5. Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

    DOE PAGES

    Sankaran, Ramanan; Angel, Jordan; Brown, W. Michael

    2015-04-08

    The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on themore » performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.« less

  6. Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

    SciTech Connect

    Sankaran, Ramanan; Angel, Jordan; Brown, W. Michael

    2015-04-08

    The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on the performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.

  7. Cooperative Scheduling of Imaging Observation Tasks for High-Altitude Airships Based on Propagation Algorithm

    PubMed Central

    Chuan, He; Dishan, Qiu; Jin, Liu

    2012-01-01

    The cooperative scheduling problem on high-altitude airships for imaging observation tasks is discussed. A constraint programming model is established by analyzing the main constraints, which takes the maximum task benefit and the minimum cruising distance as two optimization objectives. The cooperative scheduling problem of high-altitude airships is converted into a main problem and a subproblem by adopting hierarchy architecture. The solution to the main problem can construct the preliminary matching between tasks and observation resource in order to reduce the search space of the original problem. Furthermore, the solution to the sub-problem can detect the key nodes that each airship needs to fly through in sequence, so as to get the cruising path. Firstly, the task set is divided by using k-core neighborhood growth cluster algorithm (K-NGCA). Then, a novel swarm intelligence algorithm named propagation algorithm (PA) is combined with the key node search algorithm (KNSA) to optimize the cruising path of each airship and determine the execution time interval of each task. Meanwhile, this paper also provides the realization approach of the above algorithm and especially makes a detailed introduction on the encoding rules, search models, and propagation mechanism of the PA. Finally, the application results and comparison analysis show the proposed models and algorithms are effective and feasible. PMID:23365522

  8. Cooperative scheduling of imaging observation tasks for high-altitude airships based on propagation algorithm.

    PubMed

    Chuan, He; Dishan, Qiu; Jin, Liu

    2012-01-01

    The cooperative scheduling problem on high-altitude airships for imaging observation tasks is discussed. A constraint programming model is established by analyzing the main constraints, which takes the maximum task benefit and the minimum cruising distance as two optimization objectives. The cooperative scheduling problem of high-altitude airships is converted into a main problem and a subproblem by adopting hierarchy architecture. The solution to the main problem can construct the preliminary matching between tasks and observation resource in order to reduce the search space of the original problem. Furthermore, the solution to the sub-problem can detect the key nodes that each airship needs to fly through in sequence, so as to get the cruising path. Firstly, the task set is divided by using k-core neighborhood growth cluster algorithm (K-NGCA). Then, a novel swarm intelligence algorithm named propagation algorithm (PA) is combined with the key node search algorithm (KNSA) to optimize the cruising path of each airship and determine the execution time interval of each task. Meanwhile, this paper also provides the realization approach of the above algorithm and especially makes a detailed introduction on the encoding rules, search models, and propagation mechanism of the PA. Finally, the application results and comparison analysis show the proposed models and algorithms are effective and feasible.

  9. Neurons in monkey dorsal raphe nucleus code beginning and progress of step-by-step schedule, reward expectation, and amount of reward outcome in the reward schedule task.

    PubMed

    Inaba, Kiyonori; Mizuhiki, Takashi; Setogawa, Tsuyoshi; Toda, Koji; Richmond, Barry J; Shidara, Munetaka

    2013-02-20

    The dorsal raphe nucleus is the major source of serotonin in the brain. It is connected to brain regions related to reward processing, and the neurons show activity related to predicted reward outcome. Clinical observations also suggest that it is important in maintaining alertness and its apparent role in addiction seems to be related to reward processing. Here, we examined whether the neurons in dorsal raphe carry signals about reward outcome and task progress during multitrial schedules. We recorded from 98 single neurons in dorsal raphe of two monkeys. The monkeys perform one, two, or three visual discrimination trials (schedule), obtaining one, two, or three drops of liquid. In the valid cue condition, the length and brightness of a visual cue indicated schedule progress and reward amount, respectively. In the random cue condition, the visual cue was randomly presented with respect to schedule length and reward amount. We found information encoded about (1) schedule onset, (2) reward expectation, (3) reward outcome, and (4) reward amount in the mean firing rates. Information theoretic analysis showed that the temporal variation of the neuronal responses contained additional information related to the progress of the schedule toward the reward rather than only discriminating schedule onset or reward/no reward. When considered in light of all that is known about the raphe in anatomy, physiology, and behavior, the rich encoding about both task progress and predicted reward outcome makes the raphe a strong candidate for providing signals throughout the brain to coordinate persistent goal-seeking behavior.

  10. Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems

    PubMed Central

    Izakian, Hesam; Abraham, Ajith; Snášel, Václav

    2009-01-01

    Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO) algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem. PMID:22346701

  11. Metaheuristic based scheduling meta-tasks in distributed heterogeneous computing systems.

    PubMed

    Izakian, Hesam; Abraham, Ajith; Snášel, Václav

    2009-01-01

    Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO) algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem.

  12. Energy-Efficient Scheduling for Hybrid Tasks in Control Devices for the Internet of Things

    PubMed Central

    Gao, Zhigang; Wu, Yifan; Dai, Guojun; Xia, Haixia

    2012-01-01

    In control devices for the Internet of Things (IoT), energy is one of the critical restriction factors. Dynamic voltage scaling (DVS) has been proved to be an effective method for reducing the energy consumption of processors. This paper proposes an energy-efficient scheduling algorithm for IoT control devices with hard real-time control tasks (HRCTs) and soft real-time tasks (SRTs). The main contribution of this paper includes two parts. First, it builds the Hybrid tasks with multi-subtasks of different function Weight (HoW) task model for IoT control devices. HoW describes the structure of HRCTs and SRTs, and their properties, e.g., deadlines, execution time, preemption properties, and energy-saving goals, etc. Second, it presents the Hybrid Tasks' Dynamic Voltage Scaling (HTDVS) algorithm. HTDVS first sets the slowdown factors of subtasks while meeting the different real-time requirements of HRCTs and SRTs, and then dynamically reclaims, reserves, and reuses the slack time of the subtasks to meet their ideal energy-saving goals. Experimental results show HTDVS can reduce energy consumption about 10%–80% while meeting the real-time requirements of HRCTs, HRCTs help to reduce the deadline miss ratio (DMR) of systems, and HTDVS has comparable performance with the greedy algorithm and is more favorable to keep the subtasks' ideal speeds. PMID:23112659

  13. Energy-efficient scheduling for hybrid tasks in control devices for the Internet of Things.

    PubMed

    Gao, Zhigang; Wu, Yifan; Dai, Guojun; Xia, Haixia

    2012-01-01

    In control devices for the Internet of Things (IoT), energy is one of the critical restriction factors. Dynamic voltage scaling (DVS) has been proved to be an effective method for reducing the energy consumption of processors. This paper proposes an energy-efficient scheduling algorithm for IoT control devices with hard real-time control tasks (HRCTs) and soft real-time tasks (SRTs). The main contribution of this paper includes two parts. First, it builds the Hybrid tasks with multi-subtasks of different function Weight (HoW) task model for IoT control devices. HoW describes the structure of HRCTs and SRTs, and their properties, e.g., deadlines, execution time, preemption properties, and energy-saving goals, etc. Second, it presents the Hybrid Tasks' Dynamic Voltage Scaling (HTDVS) algorithm. HTDVS first sets the slowdown factors of subtasks while meeting the different real-time requirements of HRCTs and SRTs, and then dynamically reclaims, reserves, and reuses the slack time of the subtasks to meet their ideal energy-saving goals. Experimental results show HTDVS can reduce energy consumption about 10%-80% while meeting the real-time requirements of HRCTs, HRCTs help to reduce the deadline miss ratio (DMR) of systems, and HTDVS has comparable performance with the greedy algorithm and is more favorable to keep the subtasks' ideal speeds.

  14. Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks

    PubMed Central

    Abello, Manuel Blanco

    2014-01-01

    In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature. PMID:24883398

  15. Multiobjective resource-constrained project scheduling with a time-varying number of tasks.

    PubMed

    Abello, Manuel Blanco; Michalewicz, Zbigniew

    2014-01-01

    In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature.

  16. Imaging Tasks Scheduling for High-Altitude Airship in Emergency Condition Based on Energy-Aware Strategy

    PubMed Central

    Zhimeng, Li; Chuan, He; Dishan, Qiu; Jin, Liu; Manhao, Ma

    2013-01-01

    Aiming to the imaging tasks scheduling problem on high-altitude airship in emergency condition, the programming models are constructed by analyzing the main constraints, which take the maximum task benefit and the minimum energy consumption as two optimization objectives. Firstly, the hierarchy architecture is adopted to convert this scheduling problem into three subproblems, that is, the task ranking, value task detecting, and energy conservation optimization. Then, the algorithms are designed for the sub-problems, and the solving results are corresponding to feasible solution, efficient solution, and optimization solution of original problem, respectively. This paper makes detailed introduction to the energy-aware optimization strategy, which can rationally adjust airship's cruising speed based on the distribution of task's deadline, so as to decrease the total energy consumption caused by cruising activities. Finally, the application results and comparison analysis show that the proposed strategy and algorithm are effective and feasible. PMID:23864822

  17. Imaging tasks scheduling for high-altitude airship in emergency condition based on energy-aware strategy.

    PubMed

    Zhimeng, Li; Chuan, He; Dishan, Qiu; Jin, Liu; Manhao, Ma

    2013-01-01

    Aiming to the imaging tasks scheduling problem on high-altitude airship in emergency condition, the programming models are constructed by analyzing the main constraints, which take the maximum task benefit and the minimum energy consumption as two optimization objectives. Firstly, the hierarchy architecture is adopted to convert this scheduling problem into three subproblems, that is, the task ranking, value task detecting, and energy conservation optimization. Then, the algorithms are designed for the sub-problems, and the solving results are corresponding to feasible solution, efficient solution, and optimization solution of original problem, respectively. This paper makes detailed introduction to the energy-aware optimization strategy, which can rationally adjust airship's cruising speed based on the distribution of task's deadline, so as to decrease the total energy consumption caused by cruising activities. Finally, the application results and comparison analysis show that the proposed strategy and algorithm are effective and feasible.

  18. Control over the scheduling of simulated office work reduces the impact of workload on mental fatigue and task performance.

    PubMed

    Hockey, G Robert J; Earle, Fiona

    2006-03-01

    Two experiments tested the hypothesis that task-induced mental fatigue is moderated by control over work scheduling. Participants worked for 2 hr on simulated office work, with control manipulated by a yoking procedure. Matched participants were assigned to conditions of either high control (HC) or low control (LC). HC participants decided their own task scheduling, whereas LC participants had to follow these fixed schedules. For Experiment 1, fatigue was higher in LC participants who worked harder, so Experiment 2 compared control effects in high- and low-workload groups. As predicted, the impact of workload was reduced under HC conditions, for subjective fatigue, and most secondary tasks and aftereffects. The findings are interpreted within the framework of compensatory control theory.

  19. Agents endowed with uncertainty management behaviors to solve a multiskill healthcare task scheduling.

    PubMed

    Ben Othman, Sarah; Zgaya, Hayfa; Hammadi, Slim; Quilliot, Alain; Martinot, Alain; Renard, Jean-Marie

    2016-12-01

    Health organizations are complex to manage due to their dynamic processes and distributed hospital organization. It is therefore necessary for healthcare institutions to focus on this issue to deal with patients' requirements. We aim in this paper to develop and implement a management decision support system (DSS) that can help physicians to better manage their organization and anticipate the feature of overcrowding. Our objective is to optimize the Pediatric Emergency Department (PED) functioning characterized by stochastic arrivals of patients leading to its services overload. Human resources allocation presents additional complexity related to their different levels of skills and uncertain availability dates. So, we propose a new approach for multi-healthcare task scheduling based on a dynamic multi-agent system. Decisions about assignment and scheduling are the result of a cooperation and negotiation between agents with different behaviors. We therefore define the actors involved in the agents' coalition to manage uncertainties related to the scheduling problem and we detail their behaviors. Agents have the same goal, which is to enhance care quality and minimize long waiting times while respecting degrees of emergency. Different visits to the PED services and regular meetings with the medical staff allowed us to model the PED architecture and identify the characteristics and different roles of the healthcare providers and the diverse aspects of the PED activities. Our approach is integrated in a DSS for the management of the Regional University Hospital Center (RUHC) of Lille (France). Our survey is included in the French National Research Agency (ANR) project HOST (Hôpital: Optimisation, Simulation et évitement des Tensions (ANR-11-TecSan-010: http://host.ec-lille.fr/wp-content/themes/twentyeleven/docsANR/R0/HOST-WP0.pdf)).

  20. High-Performance Local Search for Task Scheduling with Human Resource Allocation

    NASA Astrophysics Data System (ADS)

    Estellon, Bertrand; Gardi, Frédéric; Nouioua, Karim

    In this paper, a real-life problem of task scheduling with human resource allocation is addressed. This problem was approached by the authors in the context of the ROADEF 2007 Challenge, which is an international competition organized by the French Operations Research Society. The subject of the contest, proposed by the telecommunications company France Télé com, consists in planning maintenance interventions and teams of technicians needed for their achievements. The addressed combinatorial optimization problem is very hard: it contains several NP-hard subproblems and its scale (hundreds of interventions and technicians) induces a huge combinatorics. An effective and efficient local-search heuristic is described to solve this problem. This algorithm was ranked 2nd of the competition (over the 35 teams who have submitted a solution). Moreover, a methodology is revealed to design and engineer high-performance local-search heuristics for solving practically discrete optimization problems.

  1. Control over the Scheduling of Simulated Office Work Reduces the Impact of Workload on Mental Fatigue and Task Performance

    ERIC Educational Resources Information Center

    Hockey, G. Robert J.; Earle, Fiona

    2006-01-01

    Two experiments tested the hypothesis that task-induced mental fatigue is moderated by control over work scheduling. Participants worked for 2 hr on simulated office work, with control manipulated by a yoking procedure. Matched participants were assigned to conditions of either high control (HC) or low control (LC). HC participants decided their…

  2. A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems.

    PubMed

    Li, Xuejun; Xu, Jia; Yang, Yun

    2015-01-01

    Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

  3. Practice schedule and acquisition, retention, and transfer of a throwing task in 6-yr.-old children.

    PubMed

    Granda Vera, Juan; Montilla, Mariano Medina

    2003-06-01

    Earlier studies have raised questions about the usefulness of variable and random practice in learning motor tasks so this study was designed to investigate the effects of contextual interference in young children, and specifically to evaluate the effectiveness of variable or random practice structure in 6-yr.-old boys and girls. Participants on a variable practice schedule showed better performances than those on a blocked schedule. The differences between the two groups were significant in the acquisition, retention, and transfer phases. These results support the hypothesis that contextual interference enhances skill learning. Because the study involved groups of young children in the setting of their normally scheduled physical education class, the practical applications of the results are evident.

  4. Nonpreemptive run-time scheduling issues on a multitasked, multiprogrammed multiprocessor with dependencies, bidimensional tasks, folding and dynamic graphs

    SciTech Connect

    Miller, Allan Ray

    1987-05-01

    Increases in high speed hardware have mandated studies in software techniques to exploit the parallel capabilities. This thesis examines the effects a run-time scheduler has on a multiprocessor. The model consists of directed, acyclic graphs, generated from serial FORTRAN benchmark programs by the parallel compiler Parafrase. A multitasked, multiprogrammed environment is created. Dependencies are generated by the compiler. Tasks are bidimensional, i.e., they may specify both time and processor requests. Processor requests may be folded into execution time by the scheduler. The graphs may arrive at arbitrary time intervals. The general case is NP-hard, thus, a variety of heuristics are examined by a simulator. Multiprogramming demonstrates a greater need for a run-time scheduler than does monoprogramming for a variety of reasons, e.g., greater stress on the processors, a larger number of independent control paths, more variety in the task parameters, etc. The dynamic critical path series of algorithms perform well. Dynamic critical volume did not add much. Unfortunately, dynamic critical path maximizes turnaround time as well as throughput. Two schedulers are presented which balance throughput and turnaround time. The first requires classification of jobs by type; the second requires selection of a ratio value which is dependent upon system parameters. 45 refs., 19 figs., 20 tabs.

  5. DSIF station schedules

    NASA Technical Reports Server (NTRS)

    Flarity, L. D.; Hanson, R. J.; Thom, E. H.

    1971-01-01

    System manages Deep Space Instrumentation Facilities /DSIF/ equipment construction and modification planning. Versatile program applies to such tasks as employee time and task schedules, pay schedules, operations schedules, and plant and equipment procurement, construction, modification or service.

  6. Development of Milestone Schedules for Selected Logistics Support Directorate Programs. Appendix A. Part 2. Task Summaries.

    DTIC Science & Technology

    1987-09-15

    0/ TIPO SCHEDULE: DV CONDUCT A PERFORMANCE DEMONSTRATION PRIOR TO TECHNICAL TEST CODE NUMBER: NONE (TT) I AND USER TEST (UT) I. RESPONSIBILITY...NONDEVELOPMENT ITEM EVALUATION PLAN CODE NUMBER: NONE (NEP) FOR MARKET SURVEY. RESPONSIBILITY: PA & T DURATION: 44.00 WORK DAYS .2 CFP COMP SCHEDULE: NDII THE...NONE BASED UPON THE MARKET SURVEY. THESE FINDINGS SERVE AS THE RESPONSIBILITY: ROY & ILS BASIS FOR THE IN-PROCESS REVIEW (IPR) DECISION TO PURSUE

  7. Assessing and Increasing Staff Preference for Job Tasks Using Concurrent-Chains Schedules and Probabilistic Outcomes

    ERIC Educational Resources Information Center

    Reed, Derek D.; DiGennaro Reed, Florence D.; Campisano, Natalie; Lacourse, Kristen; Azulay, Richard L.

    2012-01-01

    The assessment and improvement of staff members' subjective valuation of nonpreferred work tasks may be one way to increase the quality of staff members' work life. The Task Enjoyment Motivation Protocol (Green, Reid, Passante, & Canipe, 2008) provides a process for supervisors to identify the aversive qualities of nonpreferred job tasks.…

  8. Tactical traffic control for multiple AGV systems based on three dimensional space

    NASA Astrophysics Data System (ADS)

    Noh, Yuna; Yoon, Yoonjin

    2016-12-01

    In dynamic environment, it is required to frequently alter pre-defined path for individual AGV. A two-staged traffic control scheme for multiple AGVs is highly efficient in complex environment. The initial path table is generated from the first scheme by path following of `cost map'. The second scheme is tactical conflict resolution and the traffic controller identifies conflicts by performing the cell overlapping test. Three dimensional map, countable state space which is equally-spaced cells with discrete time domain, makes the algorithm apt for identifying conflicts. Finally, the efficiency of the proposed algorithm is examined and compared with Breadth-first search algorithm.

  9. Learning of a golf putting task with varying contextual interference levels induced by feedback schedule in novices and experts.

    PubMed

    Krause, Daniel; Brüne, Alexander; Fritz, Susanne; Kramer, Pascal; Meisterjahn, Peter; Schneider, Michael; Sperber, Alena

    2014-04-01

    Switching between tasks during practice can affect motor learning. This study tested whether switching feedback content has any effects on learning to perform golf putts without full visibility. 60 participants (44 men, 16 women; M age = 26.3 yr., SD = 6.6) practiced golf putts without seeing the ball movement. 30 of the participants were golfers with moderate expertise, and 30 were novices. They received feedback regarding their putts, either on the angle or on the distance in one of three feedback schedules: blocked, serial-blocked, or serial. Independent of the expertise level, learning was not affected by the feedback schedule. The strong linkage between the two components--direction and distance--may have prevented a sufficient level of contextual interference.

  10. Come to think of it: Contributions of reasoning abilities and training schedule to skill acquisition in a virtual throwing task.

    PubMed

    Frömer, Romy; Stürmer, Birgit; Sommer, Werner

    2016-10-01

    According to Schmidt's schema theory skill acquisition is based on schema formation where multiple learning incidents with varying task features are abstracted to a unifying pattern, the schema. Practice can be scheduled block-wise, with low contextual interference (CI) or randomly, with high CI. The greater effort during high CI training usually results in reduced training success but enhanced retention and transfer performance. In contrast to well-established CI effects for simple tasks, findings for complex tasks are heterogeneous, supposedly due to the detrimental accumulation of task demands. We assumed that in complex tasks, cognitive reasoning abilities might impose a limit upon schema formation and hence the effectiveness of CI. In a virtual overarm-throwing experiment participants practiced target positions at center, left, or right and were retested for retention - at the center position - and transfer with a larger target distance. Although there was no main effect of CI on performance, either in training, retention or transfer, under high CI, training performance was better for participants with higher reasoning ability, as measured with the Raven matrices. This advantage persisted across retention and transfer. Under low CI, reasoning was positively related to performance improvement only in the last third of training. We argue, that variability of practice is a necessary prerequisite for beneficial effects of reasoning abilities. Based on previous findings, we discuss feedback evaluation as a possible locus of the relationship between reasoning and performance in motor skill acquisition.

  11. Scheduling Supercomputers.

    DTIC Science & Technology

    1983-02-01

    no task is scheduled with overlap. Let numpi be the total number of preemptions and idle slots of size at most to that are introduced. We see that if...no usable block remains on Qm-*, then numpi < m-k. Otherwise, numpi ! m-k-1. If j>n when this procedure terminates, then all tasks have been scheduled

  12. Flying Schedule-Matching Descents to Explore Flight Crews' Perceptions of Their Load and Task Feasibility

    NASA Technical Reports Server (NTRS)

    Martin, Lynne Hazel; Sharma, Shivanjli; Lozito, Sharon; Kaneshige, John; Hayashi, Miwa; Dulchinos, Victoria

    2012-01-01

    Multiple studies have investigated the development and use of ground-based (controller) tools to manage and schedule traffic in future terminal airspace. No studies have investigated the impacts that such tools (and concepts) could have on the flight-deck. To begin to redress the balance, an exploratory study investigated the procedures and actions of ten Boeing-747-400 crews as they flew eight continuous descent approaches in the Los Angeles terminal airspace, with the descents being controlled using speed alone. Although the study was exploratory in nature, four variables were manipulated: speed changes, route constraints, clearance phraseology, and winds. Despite flying the same scenarios with the same events and timing, there was at least a 50 second difference in the time it took crews to fly the approaches. This variation is the product of a number of factors but highlights potential difficulties for scheduling tools that would have to accommodate this amount of natural variation in descent times. The primary focus of this paper is the potential impact of ground scheduling tools on the flight crews performance and procedures. Crews reported "moderate to low" workload, on average; however, short periods of intense and high workload were observed. The non-flying pilot often reported a higher level of workload than the flying-pilot, which may be due to their increased interaction with the Flight Management Computer, when using the aircraft automation to assist with managing the descent clearances. It is concluded that ground-side tools and automation may have a larger impact on the current-day flight-deck than was assumed and that studies investigating this impact should continue in parallel with controller support tool development.

  13. Scheduling Constrained-Deadline Parallel Tasks on Two-type Heterogeneous Multiprocessors

    DTIC Science & Technology

    2015-01-13

    there is a specification of its execution speed on a type-1 processor and on a type-2 processor, and (iv) intra- type migration , i.e., a job can migrate ...executes on a processor of type-1 and type-2 respectively. We now define terms that we use in the rest of the paper. Definition 1 ( Legal jobset). If, for...of a segment is respected, then we say that the resulting jobset is a legal jobset with respect to τ . Definition 2 (Intra-migrative schedule). A

  14. Modeling the Scheduling of Eye Movements and Manual Responses in Performing a Sequence of Discrete Tasks

    NASA Technical Reports Server (NTRS)

    Wu, Shu-Chieh; Remington, Roger W.; Lewis, Richard

    2006-01-01

    Common tasks in daily life are often accomplished by a sequence of actions that interleave information acquisition through the eyes and action execution by the hands. How are eye movements coordinated with the release of manual responses and how may their coordination be represented at the level of component mental operations? We have previously presented data from a typing-like task requiring separate choice responses to a series of five stimuli. We found a consistent pattern of results in both motor and ocular timing, and hypothesized possible relationships among underlying components. Here we report a model of that task, which demonstrates how the observed timing of eye movements to successive stimuli could be accounted for by assuming systems: an open-loop system generating saccades at a periodic rate, and a closed-loop system commanding a saccade based on stimulus processing. We relate this model to models of reading and discuss the motivation for dual control.

  15. The benefits of interleaved and blocked study: different tasks benefit from different schedules of study.

    PubMed

    Carvalho, Paulo F; Goldstone, Robert L

    2015-02-01

    Research on how information should be studied during inductive category learning has identified both interleaving of categories and blocking by category as beneficial for learning. Previous work suggests that this mixed evidence can be reconciled by taking into account within- and between-category similarity relations. In this article, we present a new moderating factor. Across two experiments, one group of participants studied categories actively (by studying the objects without correct category assignment and actively figuring out what the category was), either interleaved or blocked. Another group studied the same categories passively (objects and correct category assignment were simultaneously provided). Results from a subsequent generalization task show that whether interleaved or blocked study results in better learning depends on whether study is active or passive. One account of these results is that different presentation sequences and tasks promote different patterns of attention to stimulus components. Passive learning and blocking promote attending to commonalities within categories, while active learning and interleaving promote attending to differences between categories.

  16. Schedule Risk Assessment

    NASA Technical Reports Server (NTRS)

    Smith, Greg

    2003-01-01

    Schedule Risk Assessment needs to determine the probability of finishing on or before a given point in time. Task in a schedule should reflect the "most likely" duration for each task. IN reality, each task is different and has a varying degree of probability of finishing within or after the duration specified. Schedule risk assessment attempt to quantify these probabilities by assigning values to each task. Bridges the gap between CPM scheduling and the project's need to know the likelihood of "when".

  17. Effects of a Photo Activity Schedule Book on Independent Task Changes by Students with Intellectual Disabilities in Community and School Job Sites

    ERIC Educational Resources Information Center

    Carson, Keyla D; Gast, David L.; Ayres, Kevin M.

    2008-01-01

    The purpose of this study was to evaluate the effectiveness of using a photo activity schedule book to increase independent transitioning between vocational tasks inside a school cafeteria and at a community job site. Three students with mild to moderate intellectual disabilities, enrolled in a self-contained classroom in a public high school,…

  18. The Effects of a Picture Activity Schedule for Students with Intellectual Disability to Complete a Sequence of Tasks Following Verbal Directions

    ERIC Educational Resources Information Center

    Duttlinger, Cari; Ayres, Kevin M.; Bevill-Davis, Alicia; Douglas, Karen H.

    2013-01-01

    We investigated instruction of independent creation of picture activity schedules (PASs) and how four middle school students with intellectual disability used them to complete tasks independently. A withdrawal design (A-BC-B-A-B) was used to evaluate whether the intervention had an effect on the dependent variable and to test for generalization to…

  19. Influence of a scheduled-waiting task on EMG reactivity and oral habits among facial pain patients and no-pain controls.

    PubMed

    Nicholson, R A; Townsend, D R; Gramling, S E

    2000-12-01

    Recent research has strongly implicated the role of psychological stress in the development of temporomandibular disorders (TMD). It is widely reported that oral habits (e.g., teeth grinding) probably provide a behavioral link between stress and the development of TMD symptomatology. Extrapolation of research in the field of adjunctive behavior to the TMD disorders suggests that oral behaviors may develop conjointly with fixed-time (FT) stimulus presentation. The current experiment extended previous research examining this possibility by assessing the influence of experimental stress on masseter EMG and oral habits among persons who met broadband criteria for TMD and no-pain controls. Oral habit activity was assessed via self-report questionnaire whereas masseter muscle activity was measured continuously via electromyography across four phases (Adaptation, Free-Play, Scheduled-Play, Recovery). The Scheduled-Play phase was designed as a stress-reactivity task that included an FT schedule. Results indicated that, consistent with the stress-reactivity model, the Scheduled-Play phase resulted in a significant increase in masseter EMG levels relative to Free-Play and Adaptation, and that this effect was significantly larger for the TMD group relative to controls. The results suggest an adjunctive behavior effect although the effect was not specific to those with facial pain. Oral habit data showed a significant phase effect with oral habits that was significantly higher during the Scheduled-Play phase relative to Adaptation. The findings are the impetus for further study regarding the mechanisms whereby oral habits are developed and maintained despite their painful consequences.

  20. Schedule-Tracker Computer Program

    NASA Technical Reports Server (NTRS)

    Collazo, Fernando F.

    1990-01-01

    Schedule Tracker provides effective method for tracking tasks "past due" and/or "near term". Generates reports for each responsible staff member having one or more assigned tasks falling within two listed categories. Schedule Organizer (SO) (COSMIC program MSC-21525), Schedule Tracker (ST), and Schedule Report Generator (SRG) (COSMIC program MSC-21527) computer programs manipulating data-base files in ways advantageous in scheduling. Written in PL/1 and DEC Command Language (DCL).

  1. Average KR schedule in learning of timing: influence of length for summary knowledge of results and task complexity.

    PubMed

    Ishikura, Tadao

    2005-12-01

    This experiment investigated the influence of length for average Knowledge of Results (KR) and task complexity on learning of timing in a barrier knock-down task. Participants (30 men and 30 women) attempted to press a goal button in 1200 msec. after pressing a start button. The participant was assigned into one of six groups by two tasks (simple and complex) and three feedback groups (100% KR, Average 3, Average 5). The simple and complex tasks required a participant to knock down one or three barriers before pressing a goal button. After a pretest without KR, participants practiced 60 trials of physical practice with one of the three following groups as a practice phase: one given the result of movement time after every trial (100% KR), a second given the average movement time after every third trial (Average 3), a third given the average movement time after every fifth trial (Average 5). Participants then performed a posttest with no-KR and two retention tests, taken 10 min. and 24 hr. after the posttest without KR. Analysis gave several findings. (1) On the complex task, the absolute constant error (/CE/) and the variable error (VE) were less than those on the simple task. (2) The /CE/ and the VE of the 100% KR and the Average 3 groups were less than those of the Average 5 group in the practice phase, and the VE of the 100% KR and the Average 3 group were less than those of the Average 5 group on the retention tests. (3) In the practice phase, the /CE/ and the VE on Blocks 1 and 2 were higher than on Blocks 5 and 6. (4) On the retention tests, the /CE/ of the posttest was less than retention tests 1 and 2. And, the VE of the 100% KR and the Average 3 groups were less than that of the Average 5 group. These results suggest that the average feedback length of three trials and the given feedback information after every trial are advantageous to learning timing on this barrier knock-down task.

  2. Control and Diagnosis in Integrated Product Development - Observations during the Development of an AGV

    NASA Astrophysics Data System (ADS)

    Stetter, R.; Simundsson, A.

    2015-11-01

    This paper is concerned with the integration of control and diagnosis functionalities into the development of complete systems which include mechanical, electrical and electronic subsystems. For the development of such systems the strategies, methods and tools of integrated product development have attracted significant attention during the last decades. Today, it is generally observed that product development processes of complex systems can only be successful if the activities in the different domains are well connected and synchronised and if an ongoing communication is present - an ongoing communication spanning the technical domains and also including functions such as production planning, marketing/distribution, quality assurance, service and project planning. Obviously, numerous approaches to tackle this challenge are present in scientific literature and in industrial practice, as well. Today, the functionality and safety of most products is to a large degree dependent on control and diagnosis functionalities. Still, there is comparatively little research concentrating on the integration of the development of these functionalities into the overall product development processes. The main source of insight of the presented research is the product development process of an Automated Guided Vehicle (AGV) which is intended to be used on rough terrain. The paper starts with a background describing Integrated Product Development. The second section deals with the product development of the sample product. The third part summarizes some insights and formulates first hypotheses concerning control and diagnosis in Integrated Product Development.

  3. 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.

  4. 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.

  5. Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

    NASA Technical Reports Server (NTRS)

    Zoch, David R.

    1991-01-01

    Scheduling techniques in the ROSE are presented in the form of the viewgraphs. The following subject areas are covered: agenda; ROSE summary and history; NCC-ROSE task goals; accomplishments; ROSE timeline manager; scheduling concerns; current and ROSE approaches; initial scheduling; BFSSE overview and example; and summary.

  6. Surprise Benefits of Arena Scheduling

    ERIC Educational Resources Information Center

    Surloff, Andrew

    2008-01-01

    One of the most challenging tasks a principal must accomplish every year is the construction of the master schedule. Free from the magnetic scheduling boards and wall charts of yesteryear, principals now have technological tools--such as programs that offer schools solutions for their scheduling needs--that can save time and enable them to work…

  7. SO - SCHEDULE ORGANIZER COMPUTER PROGRAM

    NASA Technical Reports Server (NTRS)

    Collazo, F. F.

    1994-01-01

    The Schedule Organizer SO, Schedule Tracker, ST (COSMIC Program MSC-21526), and Report Generator, SRG (COSMIC Program MSC-21527), are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Tracker provides an effective method for tracking tasks that are 'past due' and/or 'near term'. ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are scheduled for recent completion (near term). Schedule Report Generator provides a simple method for generating periodic schedule reports. SO contains the following primary menu that is displayed at the beginning of the program. The menu provides options: to write input files to an output distribution file, to change a schedule title field and/or distribution list field, to browse through the schedule and input names file for requested schedule numbers, to create an input names file and a schedule titles file, and to delete input schedule titles and associated names. SO provides a choice of two input files. One file holds twenty-five groups of up to twenty-five names for each group. The other file holds twenty-five records, each of which may hold a task schedule title. SO creates three output files. One holds the formatted list of schedule titles for printout. Another file holds the formatted distribution list for printout; there is one for each input names file schedule group. The third output file holds the last schedule title deleted by

  8. 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.

  9. ST - SCHEDULE TRACKER COMPUTER PROGRAM

    NASA Technical Reports Server (NTRS)

    Collazo, F. F.

    1994-01-01

    The Schedule Organizer, SO (COSMIC Program MSC-21525), Schedule Tracker, ST, and Schedule Report Generator, SRG (COSMIC Program MSC-21527), are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Tracker provides an effective method for tracking tasks that are 'past due' and/or 'near term'. ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are scheduled for recent completion (near term). Schedule Report Generator provides a simple method for generating periodic schedule reports. ST and SRG use the same data base file as input. The common data base file has a maximum number of 400 entries. The time span of all three programs is nineteen months. Both of these maximum numbers can be modified by the user. ST requires the VMS Operating System on DEC VAX and was written in PL/1 and DEC Command Language (DCL). The program requires a memory of 233KB. ST can be purchased separately or in a package (COSMIC Program COS-10021) containing SO, ST, and SRG. ST was developed in 1985.

  10. NASA Schedule Management Handbook

    NASA Technical Reports Server (NTRS)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

  11. Astronaut Office Scheduling System Software

    NASA Technical Reports Server (NTRS)

    Brown, Estevancio

    2010-01-01

    AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

  12. Composite Scheduling

    ERIC Educational Resources Information Center

    Childers, Gary L.; Ireland, Rebecca Weeks

    2005-01-01

    In education, there is no one best way to do anything. There are compelling reasons why some courses should be taught in longer segments of time, which the block schedule provides. There are also compelling reasons why some classes should be taught in shorter segments. At Watauga High School in Boone, North Carolina, an alternative schedule that…

  13. Scheduling game

    SciTech Connect

    Kleck, W

    1982-04-01

    Structuring a schedule - whether by Critical Path Method (CPM) or Precedence Charting System (PCS) - involves estimating the duration of one or more activities and arranging them in the most logical sequence. Given the start date, the completion date is relatively simple to determine. What is then so complicated about the process. It is complicated by the people involved - the people who make the schedules and the people who attempt to follow them. Schedules are an essential part of project management and construction contract administration. Much of the material available pertains to the mechanics of schedules, the types of logic networks, the ways that data can be generated and presented. This paper sheds light on other facets of the subject - the statistical and philosophical fundamentals involved in scheduling.

  14. Feasibility study of an Integrated Program for Aerospace-vehicle Design (IPAD) system. Volume 6: Implementation schedule, development costs, operational costs, benefit assessment, impact on company organization, spin-off assessment, phase 1, tasks 3 to 8

    NASA Technical Reports Server (NTRS)

    Garrocq, C. A.; Hurley, M. J.; Dublin, M.

    1973-01-01

    A baseline implementation plan, including alternative implementation approaches for critical software elements and variants to the plan, was developed. The basic philosophy was aimed at: (1) a progressive release of capability for three major computing systems, (2) an end product that was a working tool, (3) giving participation to industry, government agencies, and universities, and (4) emphasizing the development of critical elements of the IPAD framework software. The results of these tasks indicate an IPAD first release capability 45 months after go-ahead, a five year total implementation schedule, and a total developmental cost of 2027 man-months and 1074 computer hours. Several areas of operational cost increases were identified mainly due to the impact of additional equipment needed and additional computer overhead. The benefits of an IPAD system were related mainly to potential savings in engineering man-hours, reduction of design-cycle calendar time, and indirect upgrading of product quality and performance.

  15. Optimal Schedules in Multitask Motor Learning.

    PubMed

    Lee, Jeong Yoon; Oh, Youngmin; Kim, Sung Shin; Scheidt, Robert A; Schweighofer, Nicolas

    2016-04-01

    Although scheduling multiple tasks in motor learning to maximize long-term retention of performance is of great practical importance in sports training and motor rehabilitation after brain injury, it is unclear how to do so. We propose here a novel theoretical approach that uses optimal control theory and computational models of motor adaptation to determine schedules that maximize long-term retention predictively. Using Pontryagin's maximum principle, we derived a control law that determines the trial-by-trial task choice that maximizes overall delayed retention for all tasks, as predicted by the state-space model. Simulations of a single session of adaptation with two tasks show that when task interference is high, there exists a threshold in relative task difficulty below which the alternating schedule is optimal. Only for large differences in task difficulties do optimal schedules assign more trials to the harder task. However, over the parameter range tested, alternating schedules yield long-term retention performance that is only slightly inferior to performance given by the true optimal schedules. Our results thus predict that in a large number of learning situations wherein tasks interfere, intermixing tasks with an equal number of trials is an effective strategy in enhancing long-term retention.

  16. 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.

  17. 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.

  18. 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.

  19. Mission scheduling

    NASA Technical Reports Server (NTRS)

    Gaspin, Christine

    1989-01-01

    How a neural network can work, compared to a hybrid system based on an operations research and artificial intelligence approach, is investigated through a mission scheduling problem. The characteristic features of each system are discussed.

  20. Scheduling algorithms

    NASA Astrophysics Data System (ADS)

    Wolfe, William J.; Wood, David; Sorensen, Stephen E.

    1996-12-01

    This paper discusses automated scheduling as it applies to complex domains such as factories, transportation, and communications systems. The window-constrained-packing problem is introduced as an ideal model of the scheduling trade offs. Specific algorithms are compared in terms of simplicity, speed, and accuracy. In particular, dispatch, look-ahead, and genetic algorithms are statistically compared on randomly generated job sets. The conclusion is that dispatch methods are fast and fairly accurate; while modern algorithms, such as genetic and simulate annealing, have excessive run times, and are too complex to be practical.

  1. Scheduling Spitzer: The SIRPASS Story

    NASA Technical Reports Server (NTRS)

    Mittman, David S.; Hawkins, Robert

    2013-01-01

    NASA's Spitzer Space Telescope was launched on August 25, 2003 from Florida's Cape Canaveral Air Force Base. Drifting in a unique Earth-trailing orbit around the Sun, Spitzer sees an optically invisible universe dominated by dust and stars. Since 1997, the Spitzer Integrated Resource Planning and Scheduling System (SIRPASS) has helped produce spacecraft activity plans for the Spitzer Space Telescope. SIRPASS is used by members of the Observatory Planning and Scheduling Team to plan, schedule and sequence the Telescope from data made available to them from the science and engineering community. Because of the volume of data that needs to be scheduled, SIRPASS offers a variety of automated assistants to aid in this task. This paper will describe the functional elements of the SIRPASS software system -- emphasizing the role that automation plays in the system -- and will highlight lessons learned for the software developer from a decade of Spitzer Space Telescope operations experience.

  2. ASTER Scheduling Prioritization Function

    NASA Technical Reports Server (NTRS)

    Cohen, Ron

    1996-01-01

    ASTER schedules are generated by an automated scheduling system. This scheduler will generate psuedo-optimal schedules based on a priority scheme. This priority scheme is controlled by the Science Team.

  3. 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.

  4. Maximally Expressive Task Modeling

    NASA Technical Reports Server (NTRS)

    Japp, John; Davis, Elizabeth; Maxwell, Theresa G. (Technical Monitor)

    2002-01-01

    Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiment activities for the Space Station. The equipment used in these experiments is some of the most complex hardware ever developed by mankind, the information sought by these experiments is at the cutting edge of scientific endeavor, and the procedures for executing the experiments are intricate and exacting. Scheduling is made more difficult by a scarcity of space station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling space station experiment operations calls for a "maximally expressive" modeling schema. Modeling even the simplest of activities cannot be automated; no sensor can be attached to a piece of equipment that can discern how to use that piece of equipment; no camera can quantify how to operate a piece of equipment. Modeling is a human enterprise-both an art and a science. The modeling schema should allow the models to flow from the keyboard of the user as easily as works of literature flowed from the pen of Shakespeare. The Ground Systems Department at the Marshall Space Flight Center has embarked on an effort to develop a new scheduling engine that is highlighted by a maximally expressive modeling schema. This schema, presented in this paper, is a synergy of technological advances and domain-specific innovations.

  5. Scheduling parallel programs in distributed systems

    SciTech Connect

    Rommel, C.G.

    1988-01-01

    Scheduling parallel programs under the processor-sharing discipline for uniprocessors, multiprocessors, and distributed systems was studied. Two classes of parallel programs are considered: those without any IPC (called Fork-Join jobs) and those with asynchronous and uniform IPC (called clusters). The study is divided into two parts: (1) develops analytical solutions for Fork-Join Jobs on uniprocessors and multiprocessors; and (2) develops and evaluates via simulation Fork-Join jobs and clusters on distributed systems. The types of site scheduling studied are TS-PS where tasks of a job are scheduled independently at processor-sharing servers, JS-PS in which tasks of a job are scheduled as a single entity at processor-sharing servers, and FCFS where tasks of a job are scheduled independently by order of arrival. For Poisson job arrivals and exponentially distributed task service times, analytical solutions and computationally efficient bounds were found for Fork-Join TS-PS and JS-PS job response times. An algorithm was developed to schedule parallel programs in distributed systems. Over a wide range of parameters the algorithms was found to be superior to both no-load balancing, NLB, and shortest-queue first scheduling, SQF.

  6. SO/ST/SRG - SCHEDULING PROGRAMS

    NASA Technical Reports Server (NTRS)

    Collazo, F. F.

    1994-01-01

    The Schedule Organizer, SO (COSMIC Program MSC-21525), Schedule Tracker, ST (COSMIC Program MSC-21526), and Report Generator, SRG (COSMIC Program MSC-21527), are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Organizer contains a primary menu that is displayed at the beginning of the program. The menu provides options as follows: to write input files to an output distribution file, to change a schedule title field and/or distribution list field, to browse through the schedule and input names file for requested schedule numbers, to create an input names file and a schedule titles file, and to delete input schedule titles and associated names. SO provides a choice of two input files. One file holds 25 groups of up to 25 names for each group. The other file holds 25 records. Each 60-character-long record holds a task schedule title or it is a blank entry. SO creates three output files. One holds the formatted list of schedule titles for printout. Another file holds the formatted distribution list for printout. There is one for each input names file schedule group. The third output file holds the schedule title of the last schedule title file deleted by the user. Schedule Tracker provides an effective method for tracking tasks that are "past due" and/or "near term". ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are scheduled for recent completion (near term

  7. Minimally disruptive schedule repair for MCM missions

    NASA Astrophysics Data System (ADS)

    Molineaux, Matthew; Auslander, Bryan; Moore, Philip G.; Gupta, Kalyan M.

    2015-05-01

    Mine countermeasures (MCM) missions entail planning and operations in very dynamic and uncertain operating environments, which pose considerable risk to personnel and equipment. Frequent schedule repairs are needed that consider the latest operating conditions to keep mission on target. Presently no decision support tools are available for the challenging task of MCM mission rescheduling. To address this capability gap, we have developed the CARPE system to assist operation planners. CARPE constantly monitors the operational environment for changes and recommends alternative repaired schedules in response. It includes a novel schedule repair algorithm called Case-Based Local Schedule Repair (CLOSR) that automatically repairs broken schedules while satisfying the requirement of minimal operational disruption. It uses a case-based approach to represent repair strategies and apply them to new situations. Evaluation of CLOSR on simulated MCM operations demonstrates the effectiveness of case-based strategy. Schedule repairs are generated rapidly, ensure the elimination of all mines, and achieve required levels of clearance.

  8. LANL'S DEVELOPMENT OF SCHEDULE CONTINGENCY BASED ON PROBABILISTIC RISK RESULTS

    SciTech Connect

    F. K. HOUGHTON; J. P. KINDINGER; ET AL

    2001-03-01

    The need for budget reserve in project planning is widely recognized, but the need for a corresponding schedule reserve is generally not as universally acknowledged. Los Alamos National Laboratory (LANL) performs probabilistic project risk analyses for all major projects; the question has become how to more fully use the results of the schedule analyses to establish a schedule reserve. Before the use of quantitative project risk analysis, milestones were based on the initial point estimate with float time as the only time reserved for delays. With this practice, the set of tasks that have duration reserve is limited. In particular, critical path tasks, which do not have associated float, do not have reserve schedule time to use for delays. For other tasks, float was used on a ''first-come, first-served'' basis without allocation to other tasks. Thus, it was not possible to systematically allocate schedule reserve to project tasks.

  9. SRG - SCHEDULE REPORT GENERATOR COMPUTER PROGRAM

    NASA Technical Reports Server (NTRS)

    Collazo, F. F.

    1994-01-01

    The Schedule Organizer, SO (COSMIC Program MSC-21525), Schedule Tracker, ST (COSMIC Program MSC-21526), and Schedule Report Generator, SRG, are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Tracker provides an effective method for tracking tasks that are 'past due' and/or 'near term'. ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are schedule for recent completion (near term). Schedule Reports Generator provides a simple method for generating periodic schedule reports. SRG enables an engineering manager to monitor tasks assigned to staff members on a weekly basis. SRG sorts three types of reports using one or more data fields as sort keys. One type is sorted using the calendar year as the primary key and the end date as the secondary key. Another type is sorted by flight number. A third type of report, Waterfall plots, is also generated by SRG using the end date as the sorting key. SRG requires as input a single file or two concatenated files with up to 400 single line entries. The user constructs the input file by using the LSE editor VAX utility prior to the execution of the program. The user is able to modify the current functional description text lines just displayed. ST and SRG use the same data base file as input. The common data base file has a maximum number of 400 entries. The time span of all three programs is nineteen months. Both of these maximum

  10. Incremental Scheduling Engines: Cost Savings through Automation

    NASA Technical Reports Server (NTRS)

    Jaap, John; Phillips, Shaun

    2005-01-01

    As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and ob.jectives are met and resources are not over-booked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper, presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

  11. Concurrent reinforcement schedules: behavior change and maintenance without extinction.

    PubMed Central

    Hoch, Hannah; McComas, Jennifer J; Thompson, Andrea L; Paone, Debra

    2002-01-01

    We evaluated the effects of concurrent schedules of reinforcement on negatively reinforced problem behavior and task completion with 3 children with autism. Results indicated that problem behavior occurred at high levels and relatively few tasks were completed when problem behavior produced a break (from tasks) and task completion produced either no consequence or a break. By contrast, problem behavior was eliminated and tasks were completed when problem behavior produced a break and task completion produced a break with access to preferred activities. Treatment gains were maintained without the use of extinction when the response requirement was increased and the schedule of reinforcement was thinned. PMID:12102135

  12. Concurrent reinforcement schedules: behavior change and maintenance without extinction.

    PubMed

    Hoch, Hannah; McComas, Jennifer J; Thompson, Andrea L; Paone, Debra

    2002-01-01

    We evaluated the effects of concurrent schedules of reinforcement on negatively reinforced problem behavior and task completion with 3 children with autism. Results indicated that problem behavior occurred at high levels and relatively few tasks were completed when problem behavior produced a break (from tasks) and task completion produced either no consequence or a break. By contrast, problem behavior was eliminated and tasks were completed when problem behavior produced a break and task completion produced a break with access to preferred activities. Treatment gains were maintained without the use of extinction when the response requirement was increased and the schedule of reinforcement was thinned.

  13. SDRAM bus schedule of HDTV video decoder

    NASA Astrophysics Data System (ADS)

    Wang, Hui; He, Yan L.; Yu, Lu

    2001-12-01

    In this paper, a time division multiplexed task scheduling (TDM) is designed for HDTV video decoder is proposed. There are three tasks: to fetch decoded data from SDRAM for displaying (DIS), read the reference data from SDRAM for motion compensating (REF) and write the motion compensated data back to SDRAM (WB) on the bus. The proposed schedule is based on the novel 4 banks interlaced SDRAM storage structure which results in less overhead on read/write time. Two SDRAM of 64M bits (4Bank×512K×32bit) are used. Compared with two banks, the four banks storage strategy read/write data with 45% less time. Therefore the process data rates for those three tasks are reduced. TDM is developed by round robin scheduling and fixed slot allocating. There are both MB slot and task slot. As a result the conflicts on bus are avoided, and the buffer size is reduced 48% compared with the priority bus scheduling. Moreover, there is a compacted bus schedule for the worst case of stuffing owning to the reduced executing time on tasks. The size of buffer is reduced and the control logic is simplified.

  14. Research on schedulers for astronomical observatories

    NASA Astrophysics Data System (ADS)

    Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian

    2012-09-01

    The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.

  15. Mixed-Integer Formulations for Constellation Scheduling

    NASA Astrophysics Data System (ADS)

    Valicka, C.; Hart, W.; Rintoul, M.

    Remote sensing systems have expanded the set of capabilities available for and critical to national security. Cooperating, high-fidelity sensing systems and growing mission applications have exponentially increased the set of potential schedules. A definitive lack of advanced tools places an increased burden on operators, as planning and scheduling remain largely manual tasks. This is particularly true in time-critical planning activities where operators aim to accomplish a large number of missions through optimal utilization of single or multiple sensor systems. Automated scheduling through identification and comparison of alternative schedules remains a challenging problem applicable across all remote sensing systems. Previous approaches focused on a subset of sensor missions and do not consider ad-hoc tasking. We have begun development of a robust framework that leverages the Pyomo optimization modeling language for the design of a tool to assist sensor operators planning under the constraints of multiple concurrent missions and uncertainty. Our scheduling models have been formulated to address the stochastic nature of ad-hoc tasks inserted under a variety of scenarios. Operator experience is being leveraged to select appropriate model objectives. Successful development of the framework will include iterative development of high-fidelity mission models that consider and expose various schedule performance metrics. Creating this tool will aid time-critical scheduling by increasing planning efficiency, clarifying the value of alternative modalities uniquely provided by multi-sensor systems, and by presenting both sets of organized information to operators. Such a tool will help operators more quickly and fully utilize sensing systems, a high interest objective within the current remote sensing operations community. Preliminary results for mixed-integer programming formulations of a sensor scheduling problem will be presented. Assumptions regarding sensor geometry

  16. Protocols for distributive scheduling

    NASA Technical Reports Server (NTRS)

    Richards, Stephen F.; Fox, Barry

    1993-01-01

    The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.

  17. Scheduling periodic jobs using imprecise results

    NASA Technical Reports Server (NTRS)

    Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay

    1987-01-01

    One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before the deadline can be used. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. Since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result, the amount of processor time assigned to any task in a valid schedule can be less than the amount of time required to complete the task. A meaningful formulation of the scheduling problem must take into account the overall quality of the results. Depending on the different types of undesirable effects caused by errors, jobs are classified as type N or type C. For type N jobs, the effects of errors in results produced in different periods are not cumulative. A reasonable performance measure is the average error over all jobs. Three heuristic algorithms that lead to feasible schedules with small average errors are described. For type C jobs, the undesirable effects of errors produced in different periods are cumulative. Schedulability criteria of type C jobs are discussed.

  18. 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.

  19. 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.

  20. 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

  1. Visually Exploring Transportation Schedules.

    PubMed

    Palomo, Cesar; Guo, Zhan; Silva, Cláudio T; Freire, Juliana

    2016-01-01

    Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at trip- and station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.

  2. Dedicated heterogeneous node scheduling including backfill scheduling

    DOEpatents

    Wood, Robert R.; Eckert, Philip D.; Hommes, Gregg

    2006-07-25

    A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

  3. Class Schedules Need Class.

    ERIC Educational Resources Information Center

    Monfette, Ronald J.

    1986-01-01

    Argues that college publications, including class schedules, must be accurate, timely, and easy to read and follow. Describes Schoolcraft College's unified format approach to publications marketing. Offers suggestions on the design, format, and distribution of class schedules. (DMM)

  4. Immunization Schedules for Adults

    MedlinePlus

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Adults in Easy-to-read Formats ... previous immunizations. View or Print a Schedule Recommended Immunizations for Adults (19 Years and Older) by Age ...

  5. Instant Childhood Immunization Schedule

    MedlinePlus

    ... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...

  6. School Construction Scheduling.

    ERIC Educational Resources Information Center

    Delaney, J. B.

    1983-01-01

    Explains that favorable market and working conditions influence the scheduling of school construction projects. Facility planners, architects, and contractors are advised to develop a realistic time schedule for the entire project. (MLF)

  7. Scheduling Nonconsumable Resources

    NASA Technical Reports Server (NTRS)

    Porta, Harry J.

    1990-01-01

    Users manual describes computer program SWITCH that schedules use of resources - by appliances switched on and off and use resources while they are on. Plans schedules according to predetermined goals; revises schedules when new goals imposed. Program works by depth-first searching with strict chronological back-tracking. Proceeds to evaluate alternatives as necessary, sometimes interacting with user.

  8. Web Publishing Schedule

    EPA Pesticide Factsheets

    Section 207(f)(2) of the E-Gov Act requires federal agencies to develop an inventory and establish a schedule of information to be published on their Web sites, make those schedules available for public comment. To post the schedules on the web site.

  9. Limited Matching on Concurrent-Schedule Reinforcement of Academic Behavior.

    ERIC Educational Resources Information Center

    Mace, F. Charles; And Others

    1994-01-01

    Three adolescent students with special educational needs were given reinforcers (nickels) according to three different concurrent variable-interval schedules. Time allocated to the assigned tasks was in linear relationship to the reinforcement rate. However, changes in reinforcement schedules were not followed by changes in allocation patterns…

  10. Intelligent perturbation algorithms for space scheduling optimization

    NASA Technical Reports Server (NTRS)

    Kurtzman, Clifford R.

    1990-01-01

    The optimization of space operations is examined in the light of optimization heuristics for computer algorithms and iterative search techniques. Specific attention is given to the search concepts known collectively as intelligent perturbation algorithms (IPAs) and their application to crew/resource allocation problems. IPAs iteratively examine successive schedules which become progressively more efficient, and the characteristics of good perturbation operators are listed. IPAs can be applied to aerospace systems to efficiently utilize crews, payloads, and resources in the context of systems such as Space-Station scheduling. A program is presented called the MFIVE Space Station Scheduling Worksheet which generates task assignments and resource usage structures. The IPAs can be used to develop flexible manifesting and scheduling for the Industrial Space Facility.

  11. Automatic generation of efficient orderings of events for scheduling applications

    NASA Technical Reports Server (NTRS)

    Morris, Robert A.

    1994-01-01

    In scheduling a set of tasks, it is often not known with certainty how long a given event will take. We call this duration uncertainty. Duration uncertainty is a primary obstacle to the successful completion of a schedule. If a duration of one task is longer than expected, the remaining tasks are delayed. The delay may result in the abandonment of the schedule itself, a phenomenon known as schedule breakage. One response to schedule breakage is on-line, dynamic rescheduling. A more recent alternative is called proactive rescheduling. This method uses statistical data about the durations of events in order to anticipate the locations in the schedule where breakage is likely prior to the execution of the schedule. It generates alternative schedules at such sensitive points, which can be then applied by the scheduler at execution time, without the delay incurred by dynamic rescheduling. This paper proposes a technique for making proactive error management more effective. The technique is based on applying a similarity-based method of clustering to the problem of identifying similar events in a set of events.

  12. Scheduling of an aircraft fleet

    NASA Technical Reports Server (NTRS)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

    Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

  13. 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.

  14. Schedule-Aware Workflow Management Systems

    NASA Astrophysics Data System (ADS)

    Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

    Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

  15. DSN Scheduling Engine

    NASA Technical Reports Server (NTRS)

    Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline

    2008-01-01

    The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.

  16. 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.

  17. NASA scheduling technologies

    NASA Technical Reports Server (NTRS)

    Adair, Jerry R.

    1994-01-01

    This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.

  18. A format for the interchange of scheduling models

    NASA Technical Reports Server (NTRS)

    Jaap, John P.; Davis, Elizabeth K.

    1994-01-01

    In recent years a variety of space-activity schedulers have been developed within the aerospace community. Space-activity schedulers are characterized by their need to handle large numbers of activities which are time-window constrained and make high demands on many scarce resources, but are minimally constrained by predecessor/successor requirements or critical paths. Two needs to exchange data between these schedulers have materialized. First, there is significant interest in comparing and evaluating the different scheduling engines to ensure that the best technology is applied to each scheduling endeavor. Second, there is a developing requirement to divide a single scheduling task among different sites, each using a different scheduler. In fact, the scheduling task for International Space Station Alpha (ISSA) will be distributed among NASA centers and among the international partners. The format used to interchange scheduling data for ISSA will likely use a growth version of the format discussed in this paper. The model interchange format (or MIF, pronounced as one syllable) discussed in this paper is a robust solution to the need to interchange scheduling requirements for space activities. It is highly extensible, human-readable, and can be generated or edited with common text editors. It also serves well the need to support a 'benchmark' data case which can be delivered on any computer platform.

  19. 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

  20. 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.

  1. Scheduling periodic jobs that allow imprecise results

    NASA Technical Reports Server (NTRS)

    Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay

    1990-01-01

    The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result. Applications are classified as type N and type C, according to undesirable effects of errors. The two workload models characterize the two types of applications. The optional parts of the tasks in an N job need not ever be completed. The resulting quality of each type-N job is measured in terms of the average error in the results over several consecutive periods. A class of preemptive, priority-driven algorithms that leads to feasible schedules with small average error is described and evaluated.

  2. 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.

  3. 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.

  4. Scheduling time-critical graphics on multiple processors

    NASA Technical Reports Server (NTRS)

    Meyer, Tom W.; Hughes, John F.

    1995-01-01

    This paper describes an algorithm for the scheduling of time-critical rendering and computation tasks on single- and multiple-processor architectures, with minimal pipelining. It was developed to manage scientific visualization scenes consisting of hundreds of objects, each of which can be computed and displayed at thousands of possible resolution levels. The algorithm generates the time-critical schedule using progressive-refinement techniques; it always returns a feasible schedule and, when allowed to run to completion, produces a near-optimal schedule which takes advantage of almost the entire multiple-processor system.

  5. Workshop Scheduling in the MRO Context

    NASA Astrophysics Data System (ADS)

    Rupp, Benjamin; Pauli, Dirk; Feller, Sebastian; Skyttä, Manu

    2010-09-01

    Scheduling is an important task in production planning, as it can significantly increase the productivity of a workshop. In this paper we concentrate on a job-shop problem which arises at workshops of typical MRO service providers. An MRO does not only need to minimize the production time (the makespan) and maximize the plant utilization, it also needs to maximize the service and protection level of its stock. Hence, it has several objective functions which usually contradict each other. In this paper we present the novel CTO algorithm which helps to find a schedule regarding the mentioned objective functions.

  6. Toward an Autonomous Telescope Network: the TBT Scheduler

    NASA Astrophysics Data System (ADS)

    Racero, E.; Ibarra, A.; Ocaña, F.; de Lis, S. B.; Ponz, J. D.; Castillo, M.; Sánchez-Portal, M.

    2015-09-01

    Within the ESA SSA program, it is foreseen to deploy several robotic telescopes to provide surveillance and tracking services for hazardous objects. The TBT project will procure a validation platform for an autonomous optical observing system in a realistic scenario, consisting of two telescopes located in Spain and Australia, to collect representative test data for precursor SSA services. In this context, the planning and scheduling of the night consists of two software modules, the TBT Scheduler, that will allow the manual and autonomous planning of the night, and the control of the real-time response of the system, done by the RTS2 internal scheduler. The TBT Scheduler allocates tasks for both telescopes without human intervention. Every night it takes all the inputs needed and prepares the schedule following some predefined rules. The main purpose of the scheduler is the distribution of the time for follow-up of recently discovered targets and surveys. The TBT Scheduler considers the overall performance of the system, and combine follow-up with a priori survey strategies for both kind of objects. The strategy is defined according to the expected combined performance for both systems the upcoming night (weather, sky brightness, object accessibility and priority). Therefore, TBT Scheduler defines the global approach for the network and relies on the RTS2 internal scheduler for the final detailed distribution of tasks at each sensor.

  7. Maximally Expressive Modeling of Operations Tasks

    NASA Technical Reports Server (NTRS)

    Jaap, John; Richardson, Lea; Davis, Elizabeth

    2002-01-01

    Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed, the information sought is at the cutting edge of scientific endeavor, and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a "maximally expressive" modeling schema.

  8. Artificial intelligence for the CTA Observatory scheduler

    NASA Astrophysics Data System (ADS)

    Colomé, Josep; Colomer, Pau; Campreciós, Jordi; Coiffard, Thierry; de Oña, Emma; Pedaletti, Giovanna; Torres, Diego F.; Garcia-Piquer, Alvaro

    2014-08-01

    The Cherenkov Telescope Array (CTA) project will be the next generation ground-based very high energy gamma-ray instrument. The success of the precursor projects (i.e., HESS, MAGIC, VERITAS) motivated the construction of this large infrastructure that is included in the roadmap of the ESFRI projects since 2008. CTA is planned to start the construction phase in 2015 and will consist of two arrays of Cherenkov telescopes operated as a proposal-driven open observatory. Two sites are foreseen at the southern and northern hemispheres. The CTA observatory will handle several observation modes and will have to operate tens of telescopes with a highly efficient and reliable control. Thus, the CTA planning tool is a key element in the control layer for the optimization of the observatory time. The main purpose of the scheduler for CTA is the allocation of multiple tasks to one single array or to multiple sub-arrays of telescopes, while maximizing the scientific return of the facility and minimizing the operational costs. The scheduler considers long- and short-term varying conditions to optimize the prioritization of tasks. A short-term scheduler provides the system with the capability to adapt, in almost real-time, the selected task to the varying execution constraints (i.e., Targets of Opportunity, health or status of the system components, environment conditions). The scheduling procedure ensures that long-term planning decisions are correctly transferred to the short-term prioritization process for a suitable selection of the next task to execute on the array. In this contribution we present the constraints to CTA task scheduling that helped classifying it as a Flexible Job-Shop Problem case and finding its optimal solution based on Artificial Intelligence techniques. We describe the scheduler prototype that uses a Guarded Discrete Stochastic Neural Network (GDSN), for an easy representation of the possible long- and short-term planning solutions, and Constraint

  9. Multiprocessor Scheduling for Hard Real-Time Software

    DTIC Science & Technology

    1990-06-01

    g : graph ; multischedule: out {sequence{task)); feasible : out boolean; bestschedule: out set{sequence(task))) is bestcost : integer := infinity...begin 83 branchandbound(g, multischedule, best_cost, best-schedule); feasible := (bestcost <= 0); end findmultischedule; branchandbound( g : graph ; ms

  10. Fixed-Time Schedule Effects in Combination with Response-Dependent Schedules

    ERIC Educational Resources Information Center

    Borrero, John C.; Bartels-Meints, Jamie A.; Sy, Jolene R.; Francisco, Monica T.

    2011-01-01

    We evaluated the effects of fixed-interval (FI), fixed-time (FT), and conjoint (combined) FI FT reinforcement schedules on the responding of 3 adults who had been diagnosed with schizophrenia. Responding on vocational tasks decreased for 2 of 3 participants under FT alone relative to FI alone. Responding under FI FT resulted in response…

  11. Time-critical multirate scheduling using contemporary real-time operating system services

    NASA Technical Reports Server (NTRS)

    Eckhardt, D. E., Jr.

    1983-01-01

    Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.

  12. An information theoretic view of the scheduling problem in whole-body CAD

    NASA Astrophysics Data System (ADS)

    Zhan, Yiqiang; Zhou, Xiang Sean; Krishnan, Arun

    2008-03-01

    Emerging whole-body imaging technologies push computer aided detection/diagnosis (CAD) to scale up to a whole-body level, which involves multiple organs or anatomical structure. To be exploited in this paper is the fact that the various tasks in whole-body CAD are often highly dependent (e.g., the localization of the femur heads strongly predicts the position of the iliac bifurcation of the aorta). One way to effectively employ task dependency is to schedule the tasks such that outputs of some tasks are used to guide the others. In this sense, optimal task scheduling is key to improve overall performance of a whole-body CAD system. In this paper, we propose a method for task scheduling that is optimal in an information-theoretic sense. The central idea is to schedule tasks in such an order that each operation achieves maximum expected information gain over all the tasks. The formulation embeds two intuitive principles: (1) a task with higher confidence tends to be scheduled earlier; (2) a task with higher predictive power for other tasks tends to be scheduled earlier. More specifically, task dependency is modeled by conditional probability; the outcome of each task is assumed to be probabilistic as well; and the objective function is based on the reduction of the summed conditional entropy over all tasks. The validation is carried out on a challenging CAD problem, multi-organ localization in whole-body CT. Compared to unscheduled and ad hoc scheduled organ detection/localization, our scheduled execution achieves higher accuracy with much less computation time.

  13. LiveGantt: Interactively Visualizing a Large Manufacturing Schedule.

    PubMed

    Jo, Jaemin; Huh, Jaeseok; Park, Jonghun; Kim, Bohyoung; Seo, Jinwook

    2014-12-01

    In this paper, we introduce LiveGantt as a novel interactive schedule visualization tool that helps users explore highly-concurrent large schedules from various perspectives. Although a Gantt chart is the most common approach to illustrate schedules, currently available Gantt chart visualization tools suffer from limited scalability and lack of interactions. LiveGantt is built with newly designed algorithms and interactions to improve conventional charts with better scalability, explorability, and reschedulability. It employs resource reordering and task aggregation to display the schedules in a scalable way. LiveGantt provides four coordinated views and filtering techniques to help users explore and interact with the schedules in more flexible ways. In addition, LiveGantt is equipped with an efficient rescheduler to allow users to instantaneously modify their schedules based on their scheduling experience in the fields. To assess the usefulness of the application of LiveGantt, we conducted a case study on manufacturing schedule data with four industrial engineering researchers. Participants not only grasped an overview of a schedule but also explored the schedule from multiple perspectives to make enhancements.

  14. Enhanced Software for Scheduling Space-Shuttle Processing

    NASA Technical Reports Server (NTRS)

    Barretta, Joseph A.; Johnson, Earl P.; Bierman, Rocky R.; Blanco, Juan; Boaz, Kathleen; Stotz, Lisa A.; Clark, Michael; Lebovitz, George; Lotti, Kenneth J.; Moody, James M.; Nguyen, Tony K.; Peterson, Kenneth A.; Sargent, Susan; Shaw, Karma; Stoner, Mack D.; Stowell, Deborah S.; Young, Daniel A.; Tulley, James H., Jr.

    2004-01-01

    The Ground Processing Scheduling System (GPSS) computer program is used to develop streamlined schedules for the inspection, repair, and refurbishment of space shuttles at Kennedy Space Center. A scheduling computer program is needed because space-shuttle processing is complex and it is frequently necessary to modify schedules to accommodate unanticipated events, unavailability of specialized personnel, unexpected delays, and the need to repair newly discovered defects. GPSS implements constraint-based scheduling algorithms and provides an interactive scheduling software environment. In response to inputs, GPSS can respond with schedules that are optimized in the sense that they contain minimal violations of constraints while supporting the most effective and efficient utilization of space-shuttle ground processing resources. The present version of GPSS is a product of re-engineering of a prototype version. While the prototype version proved to be valuable and versatile as a scheduling software tool during the first five years, it was characterized by design and algorithmic deficiencies that affected schedule revisions, query capability, task movement, report capability, and overall interface complexity. In addition, the lack of documentation gave rise to difficulties in maintenance and limited both enhanceability and portability. The goal of the GPSS re-engineering project was to upgrade the prototype into a flexible system that supports multiple- flow, multiple-site scheduling and that retains the strengths of the prototype while incorporating improvements in maintainability, enhanceability, and portability.

  15. Quarternary tectonics, Task 1

    SciTech Connect

    Bell, J.W.

    1993-09-30

    Activities conducted for the evaluation of the geology and seismotectonics stability of Yucca Mountain as a potential site for the underground disposal of high-level radioactive wastes continued. Tasks concerned with quaternary tectonics include: scheduling of photography of Little Skull Mountain area; the collection and dating of rock varnish samples from the 1932 Cedar Mountain earthquake area for carbon 14 AMS and cation-ratio analysis; collection of samples for thermoluminescence dating from the 1932 Cedar Mountain earthquake area; mapping of the northern area of Crater Flat; and surveying of the May 17, 1993 Eureka the Valley earthquake area.

  16. Computerizing the Reference Desk Schedule.

    ERIC Educational Resources Information Center

    deHaas, Pat

    1983-01-01

    Discussion of the scheduling procedures of librarians' hours at the reference desk at the Rutherford Humanities and Social Sciences Library, University of Alberta, highlights services provided, the preference table system, and manual scheduling versus computer scheduling. (EJS)

  17. Scheduling Operations for Massive Heterogeneous Clusters

    NASA Technical Reports Server (NTRS)

    Humphrey, John; Spagnoli, Kyle

    2013-01-01

    High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic

  18. Incremental Scheduling Engines for Human Exploration of the Cosmos

    NASA Technical Reports Server (NTRS)

    Jaap, John; Phillips, Shaun

    2005-01-01

    As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

  19. Real-time design with peer tasks

    NASA Technical Reports Server (NTRS)

    Goforth, Andre; Howes, Norman R.; Wood, Jonathan D.; Barnes, Michael J.

    1995-01-01

    We introduce a real-time design methodology for large scale, distributed, parallel architecture, real-time systems (LDPARTS), as an alternative to those methods using rate or dead-line monotonic analysis. In our method the fundamental units of prioritization, work items, are domain specific objects with timing requirements (deadlines) found in user's specification. A work item consists of a collection of tasks of equal priority. Current scheduling theories are applied with artifact deadlines introduced by the designer whereas our method schedules work items to meet user's specification deadlines (sometimes called end-to-end deadlines). Our method supports these scheduling properties. Work item scheduling is based on domain specific importance instead of task level urgency and still meets as many user specification deadlines as can be met by scheduling tasks with respect to urgency. Second, the minimum (closest) on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run time, is approximately the inverse of the throughput, measured in work items per second. Third, throughput is not degraded during overload and instead of resorting to task shedding during overload, the designer can specify which work items to shed. We prove these properties in a mathematical model.

  20. A software tool for dataflow graph scheduling

    NASA Technical Reports Server (NTRS)

    Jones, Robert L., III

    1994-01-01

    A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.

  1. Childhood Vaccine Schedule

    MedlinePlus

    ... Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... please turn Javascript on. When to Vaccinate What Vaccine Why Birth (or any age if not previously ...

  2. Distributed network scheduling

    NASA Technical Reports Server (NTRS)

    Clement, Bradley J.; Schaffer, Steven R.

    2004-01-01

    Distributed Network Scheduling is the scheduling of future communications of a network by nodes in the network. This report details software for doing this onboard spacecraft in a remote network. While prior work on distributed scheduling has been applied to remote spacecraft networks, the software reported here focuses on modeling communication activities in greater detail and including quality of service constraints. Our main results are based on a Mars network of spacecraft and include identifying a maximum opportunity of improving traverse exploration rate a factor of three; a simulation showing reduction in one-way delivery times from a rover to Earth from as much as 5 to 1.5 hours; simulated response to unexpected events averaging under an hour onboard; and ground schedule generation ranging from seconds to 50 minutes for 15 to 100 communication goals.

  3. Initial Hardware Development Schedule

    NASA Technical Reports Server (NTRS)

    Culpepper, William X.

    1991-01-01

    The hardware development schedule for the Common Lunar Lander's (CLLs) tracking system is presented. Among the topics covered are the following: historical perspective, solution options, industry contacts, and the rationale for selection.

  4. Fundamentals of Shiftwork Scheduling

    DTIC Science & Technology

    2006-04-01

    works non-standard shifts that include evenings, nights and/or weekends. Sleep hygiene . Healthful time management with respect to sleep quality. Work...This report is designed for use by managers , supervisors, shiftwork schedulers and employees. It defines the principles and components of a method of...contributions are gratefully acknowledged vLi SUMMARY This report is designed for use by managers , supervisors, shifiwork schedulers and employees. It

  5. Affirmative Action: The Scheduled Castes and the Scheduled Tribes.

    ERIC Educational Resources Information Center

    Sivaramayya, B.

    This paper considers Indian affirmative action policies that provide reservations (quotas) in favor of two disadvantaged groups, the scheduled castes and the scheduled tribes. First, definitions and background are presented. The scheduled castes ("untouchables") are said to suffer from social segregation, and the scheduled tribes from…

  6. Particle swarm optimization based space debris surveillance network scheduling

    NASA Astrophysics Data System (ADS)

    Jiang, Hai; Liu, Jing; Cheng, Hao-Wen; Zhang, Yao

    2017-02-01

    The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.

  7. 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.

  8. The Stanford School Scheduling System.

    ERIC Educational Resources Information Center

    Stanford Univ., CA. Dept. of Industrial Engineering.

    This booklet gives a general overview of the computerized Stanford School Scheduling System (SSSS) which is designed to make scheduling less difficult for individualized programs in secondary education. Topics covered include new flexible scheduling and variable course structure designs in secondary education, the school scheduling problem,…

  9. Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

    PubMed Central

    Framinan, Jose M.

    2014-01-01

    This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times. PMID:24895672

  10. The Ames-Lockheed orbiter processing scheduling system

    NASA Technical Reports Server (NTRS)

    Zweben, Monte; Gargan, Robert

    1991-01-01

    A general purpose scheduling system and its application to Space Shuttle Orbiter Processing at the Kennedy Space Center (KSC) are described. Orbiter processing entails all the inspection, testing, repair, and maintenance necessary to prepare the Shuttle for launch and takes place within the Orbiter Processing Facility (OPF) at KSC, the Vehicle Assembly Building (VAB), and on the launch pad. The problems are extremely combinatoric in that there are thousands of tasks, resources, and other temporal considerations that must be coordinated. Researchers are building a scheduling tool that they hope will be an integral part of automating the planning and scheduling process at KSC. The scheduling engine is domain independent and is also being applied to Space Shuttle cargo processing problems as well as wind tunnel scheduling problems.

  11. Task breakdown

    NASA Technical Reports Server (NTRS)

    Pavlich, Jane

    1990-01-01

    The topics concerning the Center for Space Construction (CSC) space construction breakdown structure are presented in viewgraph form. It is concluded that four components describe a task -- effecting, information gathering, analysis, and regulation; uncertainties effect the relative amount of information gathering and analysis that occurs; and that task timing requirements drive the 'location in time' of cognition.

  12. Task Analyses for Difficult-to-Assess Collective Tasks

    DTIC Science & Technology

    2014-02-01

    pronunciation and use of common phrases of the local dialect likely to be of utility during the KLE. Rehearse mission with KLE team. Coordinate...concurrently teaching individual crew, leader, and collective skills. Demonstrate to HN personnel the execution of each task using a step-by-step process...to include work schedules, mail, and other required support for mission. Coordinate for the translation of all necessary documents from English to

  13. A distributed scheduling algorithm for heterogeneous real-time systems

    NASA Technical Reports Server (NTRS)

    Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

    1991-01-01

    Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

  14. Some effects of reinforcement schedules in teaching picture names to retarded children.

    PubMed

    Stephens, C E; Pear, J J; Wray, L D; Jackson, G C

    1975-01-01

    The effects of several different schedules of primary reinforcement were compared in a picture-naming task with retarded children. In Experiment I, number of correct responses and learning rate were higher under fixed-ratio schedules than under continuous reinforcement. In Experiment II, number of correct responses and learning rate tended to be greater under in intermediate than under low or high fixed-ratio schedules. In Experiment III, number of correct responses was higher under interlocking schedules, in which the response requirement increased with time following the previous reinforcement, than under comparable fixed-ratio schedules. Learning rates were generally low and, perhaps because of this, not very different under the two types of schedules in this experiment. Accuracy (i.e., proportion of trials on which correct responses occurred) was typically high and insensitive to variations in schedule and schedule parameter throughout each experiment.

  15. 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.

  16. A Moldable Online Scheduling Algorithm and Its Application to Parallel Short Sequence Mapping

    NASA Astrophysics Data System (ADS)

    Saule, Erik; Bozdağ, Doruk; Catalyurek, Umit V.

    A crucial step in DNA sequence analysis is mapping short sequences generated by next-generation instruments to a reference genome. In this paper, we focus on efficient online scheduling of multi-user parallel short sequence mapping queries on a multiprocessor system. With the availability of parallel execution models, the problem at hand becomes a moldable task scheduling problem where the number of processors needed to execute a task is determined by the scheduler. We propose an online scheduling algorithm to minimize the stretch of the tasks in the system. This metric provides improved fairness to small tasks compared to flow time metric and suits well to the nature of the problem. Experimental evaluation on two workload scenarios indicate that the algorithm results in significantly smaller stretch compared to a recent algorithm and it is more fair to small sized tasks.

  17. 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.

  18. Intelligent retail logistics scheduling

    SciTech Connect

    Rowe, J.; Jewers, K.; Codd, A.; Alcock, A.

    1996-12-31

    The Supply Chain Integrated Ordering Network (SCION) Depot Bookings system automates the planning and scheduling of perishable and non-perishable commodities and the vehicles that carry them into J. Sainsbury depots. This is a strategic initiative, enabling the business to make the key move from weekly to daily ordering. The system is mission critical, managing the inwards flow of commodities from suppliers into J. Sainsbury`s depots. The system leverages Al techniques to provide a business solution that meets challenging functional and performance needs. The SCION Depot Bookings system is operational providing schedules for 22 depots across the UK.

  19. Doppler-free two-photon excitation spectroscopy and the Zeeman effects of the S1 1B1u(v21=1) <-- S0 1Ag(v=0) band of naphthalene-d8.

    PubMed

    Okubo, Mitsushi; Wang, Jinguo; Baba, Masaaki; Misono, Masatoshi; Kasahara, Shunji; Katô, Hajime

    2005-04-08

    Doppler-free two-photon excitation spectrum and the Zeeman effect of the S1 1B1u(v21=1) <-- S0 1Ag(v=0) transition of naphthalene-d8 have been measured. 908 lines of Q(Ka)Q(J)KaKc transition of J=0-41, Ka=0-20 were assigned, and the molecular constants of the S1 1B1u(v21=1) state were determined. Perturbations were observed, and those were identified as originating from Coriolis interaction. No perturbation originating from an interaction with triplet state was observed. The Zeeman splittings from lines of a given J were observed to increase with Kc, and those of the Kc=J levels increased linearly with J. The Zeeman effects are shown to be originating from the magnetic moment of the S1 1B1u state, which is along the c axis and is induced by mixing of the S2 1B3u state to the S1 1B1u state by J-L coupling. Rotationally resolved levels were found not to be mixed with a triplet state from the Zeeman spectra. Accordingly, it is concluded that nonradiative decay of an isolated naphthalene excited to low rovibronic levels in the S1 1B1u state does not occur through the intersystem mixing. This is at variance with generally accepted understanding of the pathways of the nonradiative decay.

  20. Emergency response nurse scheduling with medical support robot by multi-agent and fuzzy technique.

    PubMed

    Kono, Shinya; Kitamura, Akira

    2015-08-01

    In this paper, a new co-operative re-scheduling method corresponding the medical support tasks that the time of occurrence can not be predicted is described, assuming robot can co-operate medical activities with the nurse. Here, Multi-Agent-System (MAS) is used for the co-operative re-scheduling, in which Fuzzy-Contract-Net (FCN) is applied to the robots task assignment for the emergency tasks. As the simulation results, it is confirmed that the re-scheduling results by the proposed method can keep the patients satisfaction and decrease the work load of the nurse.

  1. Expert system for on-board satellite scheduling and control

    NASA Technical Reports Server (NTRS)

    Barry, John M.; Sary, Charisse

    1988-01-01

    An Expert System is described which Rockwell Satellite and Space Electronics Division (S&SED) is developing to dynamically schedule the allocation of on-board satellite resources and activities. This expert system is the Satellite Controller. The resources to be scheduled include power, propellant and recording tape. The activities controlled include scheduling satellite functions such as sensor checkout and operation. The scheduling of these resources and activities is presently a labor intensive and time consuming ground operations task. Developing a schedule requires extensive knowledge of the system and subsystems operations, operational constraints, and satellite design and configuration. This scheduling process requires highly trained experts anywhere from several hours to several weeks to accomplish. The process is done through brute force, that is examining cryptic mnemonic data off line to interpret the health and status of the satellite. Then schedules are formulated either as the result of practical operator experience or heuristics - that is rules of thumb. Orbital operations must become more productive in the future to reduce life cycle costs and decrease dependence on ground control. This reduction is required to increase autonomy and survivability of future systems. The design of future satellites require that the scheduling function be transferred from ground to on board systems.

  2. Heimdall System for MSSS Sensor Tasking

    NASA Astrophysics Data System (ADS)

    Herz, A.; Jones, B.; Herz, E.; George, D.; Axelrad, P.; Gehly, S.

    In Norse Mythology, Heimdall uses his foreknowledge and keen eyesight to keep watch for disaster from his home near the Rainbow Bridge. Orbit Logic and the Colorado Center for Astrodynamics Research (CCAR) at the University of Colorado (CU) have developed the Heimdall System to schedule observations of known and uncharacterized objects and search for new objects from the Maui Space Surveillance Site. Heimdall addresses the current need for automated and optimized SSA sensor tasking driven by factors associated with improved space object catalog maintenance. Orbit Logic and CU developed an initial baseline prototype SSA sensor tasking capability for select sensors at the Maui Space Surveillance Site (MSSS) using STK and STK Scheduler, and then added a new Track Prioritization Component for FiSST-inspired computations for predicted Information Gain and Probability of Detection, and a new SSA-specific Figure-of-Merit (FOM) for optimized SSA sensor tasking. While the baseline prototype addresses automation and some of the multi-sensor tasking optimization, the SSA-improved prototype addresses all of the key elements required for improved tasking leading to enhanced object catalog maintenance. The Heimdall proof-of-concept was demonstrated for MSSS SSA sensor tasking for a 24 hour period to attempt observations of all operational satellites in the unclassified NORAD catalog, observe a small set of high priority GEO targets every 30 minutes, make a sky survey of the GEO belt region accessible to MSSS sensors, and observe particular GEO regions that have a high probability of finding new objects with any excess sensor time. This Heimdall prototype software paves the way for further R&D that will integrate this technology into the MSSS systems for operational scheduling, improve the software's scalability, and further tune and enhance schedule optimization. The Heimdall software for SSA sensor tasking provides greatly improved performance over manual tasking, improved

  3. 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

  4. Optimizing Observation Scheduling Objectives

    NASA Technical Reports Server (NTRS)

    Bresina, John L.; Morris, Robert A.; Edgington, William R.

    1997-01-01

    In this paper, we present an approach that enables the automatic generation of high quality schedules, with respect to a given objective function. The approach involves the combination of two techniques: GenH, which automatically generates a search heuristic specialized to the given problem instance, and HBSS, which employs the generated heuristic as a bias within a stochastic sampling method.

  5. "Creative" Work Schedules.

    ERIC Educational Resources Information Center

    Blai, Boris

    Many creative or flexible work scheduling options are becoming available to the many working parents, students, handicapped persons, elderly individuals, and others who are either unable or unwilling to work a customary 40-hour work week. These options may be broadly categorized as either restructured or reduced work time options. The three main…

  6. CMS multicore scheduling strategy

    SciTech Connect

    Perez-Calero Yzquierdo, Antonio; Hernandez, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

  7. Round Robin Schedules.

    ERIC Educational Resources Information Center

    Iannone, Michael A.

    1983-01-01

    Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

  8. Schedule-Induced Stereotypy.

    ERIC Educational Resources Information Center

    Emerson, Eric; Howard, Denise

    1992-01-01

    The phenomena of the induction and entrainment of adjunctive behaviors was investigated in 8 people (ages 5-51) with severe or profound mental retardation who exhibited stereotypic behaviors. Seven of the eight demonstrated evidence of schedule-induced stereotypic behavior, whereas five also showed evidence of the entrainment of these behaviors by…

  9. Scheduling THE Computer.

    ERIC Educational Resources Information Center

    McKay, Martin D.

    1998-01-01

    Focuses on how to schedule the use of a single computer so that all students are represented and given equal access. Suggests that a computer management team be selected from within the class; discusses the teacher's role and student role definition and responsibility assignments. (AEF)

  10. Block Schedule and Traditional Schedule Achievement: A Comparison

    ERIC Educational Resources Information Center

    Arnold, Douglas E.

    2002-01-01

    Block scheduling constitutes one of the major types of restructuring considered by school administrators seeking to improve student performance. The relationship between two school schedules--the seven-period A/B block and the seven-period traditional schedule--and achievement of students in grade 11 was examined. Comparisons showed no significant…

  11. Software Schedules Missions, Aids Project Management

    NASA Technical Reports Server (NTRS)

    2008-01-01

    NASA missions require advanced planning, scheduling, and management, and the Space Agency has worked extensively to develop the programs and software suites necessary to facilitate these complex missions. These enormously intricate undertakings have hundreds of active components that need constant management and monitoring. It is no surprise, then, that the software developed for these tasks is often applicable in other high-stress, complex environments, like in government or industrial settings. NASA work over the past few years has resulted in a handful of new scheduling, knowledge-management, and research tools developed under contract with one of NASA s partners. These tools have the unique responsibility of supporting NASA missions, but they are also finding uses outside of the Space Program.

  12. Registration Review Docket Opening Schedule

    EPA Pesticide Factsheets

    Dockets are opened on a fiscal year schedule for reevaluation of all pesticides. They are subdivided into conventional pesticides, antimicrobials, biochemicals, and microbials. The schedules for 2014 to 2017 are attached.

  13. Explanation of Registration Review Schedule

    EPA Pesticide Factsheets

    Updated information on EPA's schedule for opening dockets to begin pesticide registration reviews during the next several years. The schedule is subdivided into conventional pesticides, antimicrobials, biochemicals, and microbials. \

  14. Effects of Picture Activity Schedules on Tasks Completed

    ERIC Educational Resources Information Center

    Morrisett, Michael Eric

    2015-01-01

    Self-determination is the freedom to make choices that impact an individual's life. Many people would agree that self-determination leads to an enhanced quality of life, and choice making is considered a central element in self-determination. Most learn choice making through a gradual release of responsibility by caregivers throughout their…

  15. Scheduling Constrained-Deadline Sporadic Parallel Tasks Considering Memory Contention

    DTIC Science & Technology

    2014-10-01

    arrived to the queue cause more interference than the ones that arrive later that cause reordering. Fig. 4 shows an upper bound. About 3) A memory access...Bounding Memory Interference Delay in COTS- based Multi-Core Systems. In Proc. of RTAS, 2014. [14] H. Kim, A. Kandhalu, and R. Rajkumar. A Coordinated...Thiele. Worst case delay analysis for memory interference in multicore systems. In DATE’10. [23] M. Qamhieh, F. Fauberteau, G. Laurent, and S. Midonnet

  16. Scheduling real-time, periodic jobs using imprecise results

    NASA Technical Reports Server (NTRS)

    Liu, Jane W. S.; Lin, Kwei-Jay; Natarajan, Swaminathan

    1987-01-01

    A process is called a monotone process if the accuracy of its intermediate results is non-decreasing as more time is spent to obtain the result. The result produced by a monotone process upon its normal termination is the desired result; the error in this result is zero. External events such as timeouts or crashes may cause the process to terminate prematurely. If the intermediate result produced by the process upon its premature termination is saved and made available, the application may still find the result unusable and, hence, acceptable; such a result is said to be an imprecise one. The error in an imprecise result is nonzero. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. This problem differs from the traditional scheduling problems since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result. Consequently, the amounts of processor time assigned to tasks in a valid schedule can be less than the amounts of time required to complete the tasks. A meaningful formulation of this problem taking into account the quality of the overall result is discussed. Three algorithms for scheduling jobs for which the effects of errors in results produced in different periods are not cumulative are described, and their relative merits are evaluated.

  17. Conflict-Aware Scheduling Algorithm

    NASA Technical Reports Server (NTRS)

    Wang, Yeou-Fang; Borden, Chester

    2006-01-01

    conflict-aware scheduling algorithm is being developed to help automate the allocation of NASA s Deep Space Network (DSN) antennas and equipment that are used to communicate with interplanetary scientific spacecraft. The current approach for scheduling DSN ground resources seeks to provide an equitable distribution of tracking services among the multiple scientific missions and is very labor intensive. Due to the large (and increasing) number of mission requests for DSN services, combined with technical and geometric constraints, the DSN is highly oversubscribed. To help automate the process, and reduce the DSN and spaceflight project labor effort required for initiating, maintaining, and negotiating schedules, a new scheduling algorithm is being developed. The scheduling algorithm generates a "conflict-aware" schedule, where all requests are scheduled based on a dynamic priority scheme. The conflict-aware scheduling algorithm allocates all requests for DSN tracking services while identifying and maintaining the conflicts to facilitate collaboration and negotiation between spaceflight missions. These contrast with traditional "conflict-free" scheduling algorithms that assign tracks that are not in conflict and mark the remainder as unscheduled. In the case where full schedule automation is desired (based on mission/event priorities, fairness, allocation rules, geometric constraints, and ground system capabilities/ constraints), a conflict-free schedule can easily be created from the conflict-aware schedule by removing lower priority items that are in conflict.

  18. Rural Inservice Using Alternate Scheduling.

    ERIC Educational Resources Information Center

    Kimmet, James L.

    Three small rural school districts in Montana and Wyoming used alternate school day scheduling to make time for staff and curriculum development inservice programs. The schedule of one short and four long days delivered the instructional time of 175 6-hour days each year. Benefits of alternate scheduling included time for regular inservice…

  19. FlexMod Scheduling Redux

    ERIC Educational Resources Information Center

    Murray, Shannon

    2008-01-01

    Flexible modular scheduling (flex mod)--a schedule philosophy and system that has been in place at Wausau West High School in Wausau, Wisconsin, for the last 35 years and aligns nicely with current research on student learning--is getting more and more attention from high school administrators across the country. Flexible modular scheduling was…

  20. 75 FR 42831 - Proposed Collection; Comment Request for Form 1065, Schedule C, Schedule D, Schedule K-1...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-22

    ... Items), Schedule L (Balance Sheets per Books), Schedule M-1 (Reconciliation of Income (Loss) per Books.... (Schedule K-1), Balance Sheets per Books (Schedule L), Reconciliation of Income (Loss) per Books With...

  1. Revisiting conjugate schedules.

    PubMed

    MacAleese, Kenneth R; Ghezzi, Patrick M; Rapp, John T

    2015-07-01

    The effects of conjugate reinforcement on the responding of 13 college students were examined in three experiments. Conjugate reinforcement was provided via key presses that changed the clarity of pictures displayed on a computer monitor in a manner proportional to the rate of responding. Experiment 1, which included seven parameters of clarity change per response, revealed that responding decreased as the percentage clarity per response increased for all five participants. These results indicate that each participant's responding was sensitive to intensity change, which is a parameter of conjugate reinforcement schedules. Experiment 2 showed that responding increased during conjugate reinforcement phases and decreased during extinction phases for all four participants. Experiment 3 also showed that responding increased during conjugate reinforcement and further showed that responding decreased during a conjugate negative punishment condition for another four participants. Directions for future research with conjugate schedules are briefly discussed.

  2. Observation Scheduling System

    NASA Technical Reports Server (NTRS)

    Chien, Steve A.; Tran, Daniel Q.; Rabideau, Gregg R.; Schaffer, Steven R.

    2011-01-01

    Software has been designed to schedule remote sensing with the Earth Observing One spacecraft. The software attempts to satisfy as many observation requests as possible considering each against spacecraft operation constraints such as data volume, thermal, pointing maneuvers, and others. More complex constraints such as temperature are approximated to enable efficient reasoning while keeping the spacecraft within safe limits. Other constraints are checked using an external software library. For example, an attitude control library is used to determine the feasibility of maneuvering between pairs of observations. This innovation can deal with a wide range of spacecraft constraints and solve large scale scheduling problems like hundreds of observations and thousands of combinations of observation sequences.

  3. SARDA Surface Schedulers

    NASA Technical Reports Server (NTRS)

    Malik, Waqar

    2016-01-01

    Provide an overview of algorithms used in SARDA (Spot and Runway Departure Advisor) HITL (Human-in-the-Loop) simulation for Dallas Fort-Worth International Airport and Charlotte Douglas International airport. Outline a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the single runway scheduling (SRS) problem, and discuss heuristics to restrict the search space for the DP based algorithm and provide improvements.

  4. A human factors approach to range scheduling for satellite control

    NASA Technical Reports Server (NTRS)

    Wright, Cameron H. G.; Aitken, Donald J.

    1991-01-01

    Range scheduling for satellite control presents a classical problem: supervisory control of a large-scale dynamic system, with unwieldy amounts of interrelated data used as inputs to the decision process. Increased automation of the task, with the appropriate human-computer interface, is highly desirable. The development and user evaluation of a semi-automated network range scheduling system is described. The system incorporates a synergistic human-computer interface consisting of a large screen color display, voice input/output, a 'sonic pen' pointing device, a touchscreen color CRT, and a standard keyboard. From a human factors standpoint, this development represents the first major improvement in almost 30 years to the satellite control network scheduling task.

  5. Automation Improves Schedule Quality and Increases Scheduling Efficiency for Residents

    PubMed Central

    Perelstein, Elizabeth; Rose, Ariella; Hong, Young-Chae; Cohn, Amy; Long, Micah T.

    2016-01-01

    Background Medical resident scheduling is difficult due to multiple rules, competing educational goals, and ever-evolving graduate medical education requirements. Despite this, schedules are typically created manually, consuming hours of work, producing schedules of varying quality, and yielding negative consequences for resident morale and learning. Objective To determine whether computerized decision support can improve the construction of residency schedules, saving time and improving schedule quality. Methods The Optimized Residency Scheduling Assistant was designed by a team from the University of Michigan Department of Industrial and Operations Engineering. It was implemented in the C.S. Mott Children's Hospital Pediatric Emergency Department in the 2012–2013 academic year. The 4 metrics of schedule quality that were compared between the 2010–2011 and 2012–2013 academic years were the incidence of challenging shift transitions, the incidence of shifts following continuity clinics, the total shift inequity, and the night shift inequity. Results All scheduling rules were successfully incorporated. Average schedule creation time fell from 22 to 28 hours to 4 to 6 hours per month, and 3 of 4 metrics of schedule quality significantly improved. For the implementation year, the incidence of challenging shift transitions decreased from 83 to 14 (P < .01); the incidence of postclinic shifts decreased from 72 to 32 (P < .01); and the SD of night shifts dropped by 55.6% (P < .01). Conclusions This automated shift scheduling system improves the current manual scheduling process, reducing time spent and improving schedule quality. Embracing such automated tools can benefit residency programs with shift-based scheduling needs. PMID:26913102

  6. Relationship between Contingency Awareness and Human Performance on Random Ratio and Random Interval Schedules

    ERIC Educational Resources Information Center

    Bradshaw, Ceri A.; Reed, Phil

    2012-01-01

    In three experiments, human participants pressed the space bar on a computer keyboard to earn points on random-ratio (RR) and random-interval (RI) schedules of reinforcement. Verbalized contingency awareness (CA) for each schedule was measured after the entire task (Experiments 1 and 2), or after each RR-RI trial (Experiment 3). In all three…

  7. 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.

  8. A Dynamic Scheduler for a Computer Aided Protyping System.

    DTIC Science & Technology

    1988-03-01

    and then "hand-packing’" all the important tasks into them. This is typically done in the context of a cyclical execu- tive (the cyclical executive...hroce ssrt eanil ni interrpt 3. Figure 6. CREATION AND EXECUTION OF THlE DYNAM1IC SCHEDULE 4. Non-time critical processes will be sequenced in the

  9. The Acceleration of Structural Microarchitectural Simulation via Scheduling

    DTIC Science & Technology

    2006-11-01

    118 4.4.4 Related Work: Resource Constraints . . . . . . . . . . . . . . . . . . . . 125 4.4.5 Related Work: Sequence ...multiprocessor task scheduling with precedence constraints, resource constraints, sequence dependence, and communication costs. Additional contributions of this...constraints. • Two clustering heuristics to improve cache locality and reduce the effects of sequence dependence. 1.4 Organization of the Dissertation

  10. A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy

    PubMed Central

    Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

    2013-01-01

    Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments. PMID:23690742

  11. A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.

    PubMed

    Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

    2013-01-01

    Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.

  12. Characterizing and Mitigating Work Time Inflation in Task Parallel Programs

    DOE PAGES

    Olivier, Stephen L.; de Supinski, Bronis R.; Schulz, Martin; ...

    2013-01-01

    Task parallelism raises the level of abstraction in shared memory parallel programming to simplify the development of complex applications. However, task parallel applications can exhibit poor performance due to thread idleness, scheduling overheads, and work time inflation – additional time spent by threads in a multithreaded computation beyond the time required to perform the same work in a sequential computation. We identify the contributions of each factor to lost efficiency in various task parallel OpenMP applications and diagnose the causes of work time inflation in those applications. Increased data access latency can cause significant work time inflation in NUMAmore » systems. Our locality framework for task parallel OpenMP programs mitigates this cause of work time inflation. Our extensions to the Qthreads library demonstrate that locality-aware scheduling can improve performance up to 3X compared to the Intel OpenMP task scheduler.« less

  13. Parallel job-scheduling algorithms

    SciTech Connect

    Rodger, S.H.

    1989-01-01

    In this thesis, we consider solving job scheduling problems on the CREW PRAM model. We show how to adapt Cole's pipeline merge technique to yield several efficient parallel algorithms for a number of job scheduling problems and one optimal parallel algorithm for the following job scheduling problem: Given a set of n jobs defined by release times, deadlines and processing times, find a schedule that minimizes the maximum lateness of the jobs and allows preemption when the jobs are scheduled to run on one machine. In addition, we present the first NC algorithm for the following job scheduling problem: Given a set of n jobs defined by release times, deadlines and unit processing times, determine if there is a schedule of jobs on one machine, and calculate the schedule if it exists. We identify the notion of a canonical schedule, which is the type of schedule our algorithm computes if there is a schedule. Our algorithm runs in O((log n){sup 2}) time and uses O(n{sup 2}k{sup 2}) processors, where k is the minimum number of distinct offsets of release times or deadlines.

  14. Talking Picture Schedules: Embedding Video Models into Visual Activity Schedules to Increase Independence for Students with ASD.

    PubMed

    Spriggs, Amy D; Knight, Victoria; Sherrow, Lauren

    2015-12-01

    Studies examining video modeling and visual activity schedules independent of one another have been shown to be effective in teaching skills for students with autism, but there is little research about the effectiveness of combining the two methods. Use of visual activity schedules with embedded video models via an iPad application was investigated to determine if high school students with autism could transition within and between novel activities (e.g., writing paragraphs, setting a table, data entry) using a multiple probe across participants design. Findings indicate youth with autism were able to independently transition within and between tasks. Students exhibited high rates of generalization to the static visual activity schedules and novel task exemplars after the embedded video model was removed.

  15. 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

  16. Voltage scheduling for low power/energy

    NASA Astrophysics Data System (ADS)

    Manzak, Ali

    2001-07-01

    Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned

  17. Individual differences in strategic flight management and scheduling

    NASA Technical Reports Server (NTRS)

    Wickens, Christopher D.; Raby, Mireille

    1991-01-01

    A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

  18. 2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.

    SciTech Connect

    United States. Bonneville Power Administration.

    2006-11-01

    This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.

  19. 1993 Wholesale Power and Transmission Rate Schedules.

    SciTech Connect

    US Bonneville Power Administration

    1993-10-01

    Bonneville Power Administration 1993 Wholesale Power Rate Schedules and General Rate Schedule Provisions and 1993 Transmission Rate Schedules and General Transmission Rate Schedule Provisions, contained herein, were approved on an interim basis effective October 1, 1993. These rate schedules and provisions were approved by the Federal Energy Commission, United States Department of Energy, in September, 1993. These rate schedules and provisions supersede the Administration`s Wholesale Power Rate Schedules and General Rate Schedule Provisions and Transmission Rate Schedules and General Transmission Rate Schedule Provisions effective October 1, 1991.

  20. Present and future hydropower scheduling in Statkraft

    NASA Astrophysics Data System (ADS)

    Bruland, O.

    2012-12-01

    Statkraft produces close to 40 TWH in an average year and is one of the largest hydropower producers in Europe. For hydropower producers the scheduling of electricity generation is the key to success and this depend on optimal use of the water resources. The hydrologist and his forecasts both on short and on long terms are crucial to this success. The hydrological forecasts in Statkraft and most hydropower companies in Scandinavia are based on lumped models and the HBV concept. But before the hydrological model there is a complex system for collecting, controlling and correcting data applied in the models and the production scheduling and, equally important, routines for surveillance of the processes and manual intervention. Prior to the forecasting the states in the hydrological models are updated based on observations. When snow is present in the catchments snow surveys are an important source for model updating. The meteorological forecast is another premise provider to the hydrological forecast and to get as precise meteorological forecast as possible Statkraft hires resources from the governmental forecasting center. Their task is to interpret the meteorological situation, describe the uncertainties and if necessary use their knowledge and experience to manually correct the forecast in the hydropower production regions. This is one of several forecast applied further in the scheduling process. Both to be able to compare and evaluate different forecast providers and to ensure that we get the best available forecast, forecasts from different sources are applied. Some of these forecasts have undergone statistical corrections to reduce biases. The uncertainties related to the meteorological forecast have for a long time been approached and described by ensemble forecasts. But also the observations used for updating the model have a related uncertainty. Both to the observations itself and to how well they represent the catchment. Though well known, these

  1. 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.

  2. A Multitasking General Executive for Compound Continuous Tasks

    ERIC Educational Resources Information Center

    Salvucci, Dario D.

    2005-01-01

    As cognitive architectures move to account for increasingly complex real-world tasks, one of the most pressing challenges involves understanding and modeling human multitasking. Although a number of existing models now perform multitasking in real-world scenarios, these models typically employ customized executives that schedule tasks for the…

  3. Effective Scheduling Using Sacred Time.

    PubMed

    Baum, Neil

    2016-01-01

    Doctors need to become more efficient in order to become more productive. One of the best ways to enhance efficiency is effective scheduling. Every practice has several urgencies or emergencies every day that have to be worked into the schedule, and these few additional patients can wreak havoc with the schedule. This article will discuss.how to use "sacred time" in order to enhance efficiency in the practice.

  4. Recent Improvements to HST Parallel Scheduling

    NASA Astrophysics Data System (ADS)

    Henry, Ronald; Butschky, Mike

    The Hubble Space Telescope (HST) has several scientific instruments (SIs) that may be used at any given time. Most primary visits submitted by HST observers only use one SI, leaving the other SIs free to be requested by ``pure parallel'' observing programs. In order to accomplish this, separate scheduling units (SUs) for each parallel SI must be created and then scheduled by the Science Planning and Scheduling System (SPSS), taking into account numerous orbital and scientific constraints. The Parallel Observation Matching System (POMS) has the task of matching parallel visits to primary observations and ``crafting'' appropriate parallel SUs at each opportunity, taking scientific criteria and orbital constraints into account. The process for planning and scheduling parallel observations is thus quite different from the process for primary science. In the past, custom crafting rules for each parallel program were necessary, requiring full-time support from a software developer. In addition, because POMS ran as a standalone system, its ability to model how long parallel SUs would take was limited, especially with the flexible buffer-management schemes used for the second-generation SIs. A new version of POMS was developed in 1997. This version uses a formal proposal syntax (the same used for primary observations) for parallels, so that different proposals can be handled uniformly and without the need for customized ``crafting rules.'' In addition, POMS is integrated with the Transformation (TRANS) planning system in order to give it full knowledge of overheads within an SU, eliminating the need for ad hoc modeling. The power and versatility of this approach has paid off in improved utilization of parallel opportunities, greatly reduced maintenance costs, and an ability to gracefully handle new parallel proposals and new SIs with minimal software effort. This paper discusses the requirements, design, and operational results of the new POMS.

  5. COMPASS: An Ada based scheduler

    NASA Technical Reports Server (NTRS)

    Mcmahon, Mary Beth; Culbert, Chris

    1992-01-01

    COMPASS is a generic scheduling system developed by McDonnell Douglas and funded by the Software Technology Branch of NASA Johnson Space Center. The motivation behind COMPASS is to illustrate scheduling technology and provide a basis from which custom scheduling systems can be built. COMPASS was written in Ada to promote readability and to conform to DOD standards. COMPASS has some unique characteristics that distinguishes it from commercial products. This paper discusses these characteristics and uses them to illustrate some differences between scheduling tools.

  6. General Aviation Task Force report

    NASA Technical Reports Server (NTRS)

    1993-01-01

    General aviation is officially defined as all aviation except scheduled airlines and the military. It is the only air transportation to many communities throughout the world. In order to reverse the recent decline in general aviation aircraft produced in the United States, the Task Force recommends that NASA provide the expertise and facilities such as wind tunnels and computer codes for aircraft design. General aviation manufacturers are receptive to NASA's innovations and technological leadership and are expected to be effective users of NASA-generated technologies.

  7. Freight train scheduling on a single line corridor

    NASA Astrophysics Data System (ADS)

    Rahman, Amirah; Froyland, Gary

    2014-09-01

    Most of the world's freight rail network consists of single track lines with sidings where interactions between trains occur (meet, pass). The goal is to generate a schedule where the trains spend as little time as possible traversing between loading and unloading stations while ensuring that the interactions happen safely. Currently, scheduling is a manual operation performed by train controllers or dispatchers. The complexity of the problem makes it a demanding and highly time consuming task. We present an integer program formulation and results obtained from numerical experiments.

  8. The TJO-OAdM Robotic Observatory: the scheduler

    NASA Astrophysics Data System (ADS)

    Colomé, Josep; Casteels, Kevin; Ribas, Ignasi; Francisco, Xavier

    2010-07-01

    The Joan Oró Telescope at the Montsec Astronomical Observatory (TJO - OAdM) is a small-class observatory working under completely unattended control, due to the isolation of the site. Robotic operation is mandatory for its routine use. The level of robotization of an observatory is given by its reliability in responding to environment changes and by the required human interaction due to possible alarms. These two points establish a level of human attendance to ensure low risk at any time. But there is another key point when deciding how the system performs as a robot: the capability to adapt the scheduled observation to actual conditions. The scheduler represents a fundamental element to fully achieve an intelligent response at any time. Its main task is the mid- and short-term time optimization and it has a direct effect on the scientific return achieved by the observatory. We present a description of the scheduler developed for the TJO - OAdM, which is separated in two parts. Firstly, a pre-scheduler that makes a temporary selection of objects from the available projects according to their possibility of observation. This process is carried out before the beginning of the night following different selection criteria. Secondly, a dynamic scheduler that is executed any time a target observation is complete and a new one must be scheduled. The latter enables the selection of the best target in real time according to actual environment conditions and the set of priorities.

  9. Job scheduling on a hypercube

    SciTech Connect

    Zhu, Yahui.

    1990-01-01

    The author studies the scheduling of independent jobs on hypercube multiprocessors. He assumes that the hypercube system supports space-sharing for multiprogramming, i.e., a hypercube is partitioned into subcubes and each job is assigned to a dedicated subcube and many jobs can be running simultaneously without interfering with each other. Then the problem of how to schedule a set of jobs so that they can be finished as early as possible becomes important. He investigates two kinds of scheduling algorithms for the problem. The first one is nonpreemptive scheduling, i.e., no job is allowed to be interrupted during its execution. In this case, the problem is NP-Complete. He proposes an approximation algorithm called LDF, which generates a schedule with a finish time less than twice that of an optimal schedule. Compared with the earlier proposed algorithm, his algorithm is simpler and has almost the same performance. More importantly, his LDF algorithm can achieve this performance without knowing the job processing times, which may be hard to obtain in practice. Also he proves a lower bound result which implies that it is unlikely to find simple heuristic algorithms that can perform much better than the existing algorithms including LDF. The second kind is preemptive scheduling, i.e., a job can be preempted during its execution and rescheduled later. He develops a feasibility algorithm that runs in O (n log n) time and generates a schedule with at most min{l brace}n-2, 2{sup m}-1{r brace} preemptions. It can generate a feasible schedule for the given job set if there exists one. This improvement is important because many scheduling algorithms depend on a feasibility algorithm as a building block. Furthermore, based on an advanced search technique, he presents an algorithm that can find the optimal schedule in O(n{sup 2} log {sup 2}n) time.

  10. Dynamics in scheduled networks

    NASA Astrophysics Data System (ADS)

    Zanin, Massimiliano; Lacasa, Lucas; Cea, Miguel

    2009-06-01

    When studying real or virtual systems through complex networks theories, usually time restrictions are neglected, and a static structure is defined to characterize which node is connected to which other. However, this approach is oversimplified, as real networks are indeed dynamically modified by external mechanisms. In order to bridge the gap, in this work we present a scheduled network formalism, which takes into account such dynamical modifications by including generic time restrictions in the structure of an extended adjacency matrix. We present some of its properties and apply this formalism to the specific case of the air transportation network in order to analyze its efficiency. Real data are used at this point. We finally discuss on the applicability of this formalism to other complex systems.

  11. Optimum connection management scheduling

    NASA Astrophysics Data System (ADS)

    Kadar, Ivan

    2000-08-01

    Connection Management plays a key role in both distributed 'local' network-centric and 'globally' connected info- centric systems. The role of Connection Management is to provide seamless demand-based sharing of the information products. For optimum distributed information fusion performance, these systems must minimize communications delays and maximize message throughput, and at the same time take into account relative-sensors-targets geometrical constraints and data pedigree. In order to achieve overall distributed 'network' effectiveness, these systems must be adaptive, and be able to distribute data s needed in real- time. A system concept will be described which provides optimum capacity-based information scheduling. A specific example, based on a satellite channel, is used to illustrate simulated performance results and their effects on fusion systems performance.

  12. Modeling the Cray memory scheduler

    SciTech Connect

    Wickham, K.L.; Litteer, G.L.

    1992-04-01

    This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.

  13. Constraint-Based Scheduling System

    NASA Technical Reports Server (NTRS)

    Zweben, Monte; Eskey, Megan; Stock, Todd; Taylor, Will; Kanefsky, Bob; Drascher, Ellen; Deale, Michael; Daun, Brian; Davis, Gene

    1995-01-01

    Report describes continuing development of software for constraint-based scheduling system implemented eventually on massively parallel computer. Based on machine learning as means of improving scheduling. Designed to learn when to change search strategy by analyzing search progress and learning general conditions under which resource bottleneck occurs.

  14. Block Schedule: Breaking the Barriers.

    ERIC Educational Resources Information Center

    West, Mike

    As of 1996, Chaparral High School in Las Vegas, Nevada, was in the fourth year of a radical restructuring effort. The school changed from a 6-period day, composed of 51-minute periods, to an alternating day schedule, composed of 3 102-minute periods per day. This report describes how the school developed and implemented the new schedule. Faculty…

  15. Scheduling Guide for Program Managers

    DTIC Science & Technology

    2001-10-01

    and val- leys are evened out without scheduling more work than nine people can do. In this ex- ample, this rearrangement can be accom- plished quickly...full advantage of event- driven scheduling. Additional information on the development of IMSs can be found in various sections of the Defense

  16. 21 CFR 1308.13 - Schedule III.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 21 Food and Drugs 9 2012-04-01 2012-04-01 false Schedule III. 1308.13 Section 1308.13 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.13 Schedule III. (a) Schedule III shall consist of the drugs and other substances,...

  17. 21 CFR 1308.15 - Schedule V.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 21 Food and Drugs 9 2012-04-01 2012-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.15 Schedule V. (a) Schedule V shall consist of the drugs and other substances, by...

  18. 21 CFR 1308.12 - Schedule II.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule II. 1308.12 Section 1308.12 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.12 Schedule II. (a) Schedule II shall consist of the drugs and other substances,...

  19. 21 CFR 1308.15 - Schedule V.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.15 Schedule V. (a) Schedule V shall consist of the drugs and other substances, by...

  20. 21 CFR 1308.13 - Schedule III.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.13 Schedule III. (a) Schedule III shall consist of the drugs and other substances,...

  1. 21 CFR 1308.14 - Schedule IV.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule IV. 1308.14 Section 1308.14 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.14 Schedule IV. (a) Schedule IV shall consist of the drugs and other substances,...

  2. 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.

  3. Immunization Schedules for Infants and Children

    MedlinePlus

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Infants and Children United States, 2017 ... any questions. View or Print a Schedule Recommended Immunizations for Children (Birth through 6 years) Schedule for ...

  4. Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

    NASA Astrophysics Data System (ADS)

    Stottler, D.

    There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

  5. Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm.

    PubMed

    Abdulhamid, Shafi'i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

    2016-01-01

    Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

  6. Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm

    PubMed Central

    Abdulhamid, Shafi’i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

    2016-01-01

    Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques. PMID:27384239

  7. Gang scheduling a parallel machine

    SciTech Connect

    Gorda, B.C.; Brooks, E.D. III.

    1991-03-01

    Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processors. User program and their gangs of processors are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantums are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory. 2 refs., 1 fig.

  8. Gang scheduling a parallel machine

    SciTech Connect

    Gorda, B.C.; Brooks, E.D. III.

    1991-12-01

    Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processes. User programs and their gangs of processes are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantum are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory.

  9. Uplink Scheduling of Navigation Constellation Based on Immune Genetic Algorithm

    PubMed Central

    Tang, Yinyin; Wang, Yueke; Chen, Jianyun; Li, Xianbin

    2016-01-01

    The uplink of navigation data as satellite ephemeris is a complex satellite range scheduling problem. Large–scale optimal problems cannot be tackled using traditional heuristic methods, and the efficiency of standard genetic algorithm is unsatisfactory. We propose a multi-objective immune genetic algorithm (IGA) for uplink scheduling of navigation constellation. The method focuses on balance traffic and maximum task objects based on satellite-ground index encoding method, individual diversity evaluation and memory library. Numerical results show that the multi–hierarchical encoding method can improve the computation efficiency, the fuzzy deviation toleration method can speed up convergence, and the method can achieve the balance target with a negligible loss in task number (approximately 2.98%). The proposed algorithm is a general method and thus can be used in similar problems. PMID:27736986

  10. Uplink Scheduling of Navigation Constellation Based on Immune Genetic Algorithm.

    PubMed

    Tang, Yinyin; Wang, Yueke; Chen, Jianyun; Li, Xianbin

    2016-01-01

    The uplink of navigation data as satellite ephemeris is a complex satellite range scheduling problem. Large-scale optimal problems cannot be tackled using traditional heuristic methods, and the efficiency of standard genetic algorithm is unsatisfactory. We propose a multi-objective immune genetic algorithm (IGA) for uplink scheduling of navigation constellation. The method focuses on balance traffic and maximum task objects based on satellite-ground index encoding method, individual diversity evaluation and memory library. Numerical results show that the multi-hierarchical encoding method can improve the computation efficiency, the fuzzy deviation toleration method can speed up convergence, and the method can achieve the balance target with a negligible loss in task number (approximately 2.98%). The proposed algorithm is a general method and thus can be used in similar problems.

  11. Development of an Integrated Master Schedule for Weapon System Acquisition

    DTIC Science & Technology

    1977-05-01

    SPOs usually involves a Memorandum of Agreement (MOA) or a personal contact. More will be said on this later. Defense Systems Acquisition Review...theoretical concepts, and policy positions do little to help the person in the program office who is charged with the task of developing an integrated...schedule, performance) has bee.1 de-emphasized. This was followed by the presentation of several "horror stories" which I have personally observed occur

  12. Tank Waste Remediation System (TWRS) Retrieval Authorization Basis Amendment Task Plan

    SciTech Connect

    HARRIS, J.P.

    1999-08-31

    This task plan is a documented agreement between Nuclear Safety and Licensing and Retrieval Engineering. The purpose of this task plan is to identify the scope of work, tasks and deliverables, responsibilities, manpower, and schedules associated with an authorization basis amendment as a result of the Waste Feed Delivery Program, Project W-211, Project W-521, and Project W-522.

  13. Tank Waste Remediation System (TWRS) Retrieval Authorization Basis Amendment Task Plan

    SciTech Connect

    HARRIS, J.P.

    2000-03-27

    This task plan is a documented agreement between Nuclear Safety and Licensing and Retrieval Engineering. The purpose of this task plan is to identify the scope of work, tasks and deliverables, responsibilities, manpower, and schedules associated with an authorization basis amendment as a result of the Waste Feed Delivery Program, Project W-211, Project W-521, and Project W-522.

  14. The Dynamic Kernel Scheduler-Part 1

    NASA Astrophysics Data System (ADS)

    Adelmann, Andreas; Locans, Uldis; Suter, Andreas

    2016-10-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software that uses these hardware accelerators introduces additional challenges for the developer. These challenges may include exposing increased parallelism, handling different hardware designs, and using multiple development frameworks in order to utilise devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between the host application and different hardware accelerators. DKS handles the communication between the host and the device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL, and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated into OPAL (Object-oriented Parallel Accelerator Library) in order to speed up a parallel FFT based Poisson solver and Monte Carlo simulations for particle-matter interaction used for proton therapy degrader modelling. DKS was also used together with Minuit2 for parameter fitting, where χ2 and max-log-likelihood functions were offloaded to the hardware accelerator. The concepts of the DKS, first results, and plans for the future will be shown in this paper.

  15. 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.

  16. CARMENES instrument control system and operational scheduler

    NASA Astrophysics Data System (ADS)

    Garcia-Piquer, Alvaro; Guàrdia, Josep; Colomé, Josep; Ribas, Ignasi; Gesa, Lluis; Morales, Juan Carlos; Pérez-Calpena, Ana; Seifert, Walter; Quirrenbach, Andreas; Amado, Pedro J.; Caballero, José A.; Reiners, Ansgar

    2014-07-01

    The main goal of the CARMENES instrument is to perform high-accuracy measurements of stellar radial velocities (1m/s) with long-term stability. CARMENES will be installed in 2015 at the 3.5 m telescope in the Calar Alto Observatory (Spain) and it will be equipped with two spectrographs covering from the visible to the near-infrared. It will make use of its near-IR capabilities to observe late-type stars, whose peak of the spectral energy distribution falls in the relevant wavelength interval. The technology needed to develop this instrument represents a challenge at all levels. We present two software packages that play a key role in the control layer for an efficient operation of the instrument: the Instrument Control System (ICS) and the Operational Scheduler. The coordination and management of CARMENES is handled by the ICS, which is responsible for carrying out the operations of the different subsystems providing a tool to operate the instrument in an integrated manner from low to high user interaction level. The ICS interacts with the following subsystems: the near-IR and visible channels, composed by the detectors and exposure meters; the calibration units; the environment sensors; the front-end electronics; the acquisition and guiding module; the interfaces with telescope and dome; and, finally, the software subsystems for operational scheduling of tasks, data processing, and data archiving. We describe the ICS software design, which implements the CARMENES operational design and is planned to be integrated in the instrument by the end of 2014. The CARMENES operational scheduler is the second key element in the control layer described in this contribution. It is the main actor in the translation of the survey strategy into a detailed schedule for the achievement of the optimization goals. The scheduler is based on Artificial Intelligence techniques and computes the survey planning by combining the static constraints that are known a priori (i.e., target

  17. Future aircraft networks and schedules

    NASA Astrophysics Data System (ADS)

    Shu, Yan

    2011-07-01

    Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

  18. Multicore job scheduling in the Worldwide LHC Computing Grid

    NASA Astrophysics Data System (ADS)

    Forti, A.; Pérez-Calero Yzquierdo, A.; Hartmann, T.; Alef, M.; Lahiff, A.; Templon, J.; Dal Pra, S.; Gila, M.; Skipsey, S.; Acosta-Silva, C.; Filipcic, A.; Walker, R.; Walker, C. J.; Traynor, D.; Gadrat, S.

    2015-12-01

    After the successful first run of the LHC, data taking is scheduled to restart in Summer 2015 with experimental conditions leading to increased data volumes and event complexity. In order to process the data generated in such scenario and exploit the multicore architectures of current CPUs, the LHC experiments have developed parallelized software for data reconstruction and simulation. However, a good fraction of their computing effort is still expected to be executed as single-core tasks. Therefore, jobs with diverse resources requirements will be distributed across the Worldwide LHC Computing Grid (WLCG), making workload scheduling a complex problem in itself. In response to this challenge, the WLCG Multicore Deployment Task Force has been created in order to coordinate the joint effort from experiments and WLCG sites. The main objective is to ensure the convergence of approaches from the different LHC Virtual Organizations (VOs) to make the best use of the shared resources in order to satisfy their new computing needs, minimizing any inefficiency originated from the scheduling mechanisms, and without imposing unnecessary complexities in the way sites manage their resources. This paper describes the activities and progress of the Task Force related to the aforementioned topics, including experiences from key sites on how to best use different batch system technologies, the evolution of workload submission tools by the experiments and the knowledge gained from scale tests of the different proposed job submission strategies.

  19. Planning and scheduling for success

    NASA Technical Reports Server (NTRS)

    Manzanera, Ignacio

    1994-01-01

    Planning and scheduling programs are excellent management tools when properly introduced to the project management team and regularly maintained. Communications, creativity, flexibility and accuracy are substantially improved by following a simple set of rules. A planning and scheduling program will work for you if you believe in it, make others in your project team realize its benefits, and make it an extension of your project cost control philosophy.

  20. 77 FR 64848 - Proposed Collection; Comment Request for Form 1120S, Schedule D, Schedule K-1, and Schedule M-3

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-10-23

    ... Internal Revenue Service Proposed Collection; Comment Request for Form 1120S, Schedule D, Schedule K-1, and... With Total Assets of $10 Million or More, and Schedule K-1 (Form 1120S), Shareholder's Share of Income... Losses and Built-in Gains, Schedule K-1 (Form 1120S), Shareholder's Share of Income, Credits,...

  1. An expert system for planning and scheduling in a telerobotic environment

    NASA Technical Reports Server (NTRS)

    Ntuen, Celestine A.; Park, Eui H.

    1991-01-01

    A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

  2. IOPS advisor: Research in progress on knowledge-intensive methods for irregular operations airline scheduling

    NASA Technical Reports Server (NTRS)

    Borse, John E.; Owens, Christopher C.

    1992-01-01

    Our research focuses on the problem of recovering from perturbations in large-scale schedules, specifically on the ability of a human-machine partnership to dynamically modify an airline schedule in response to unanticipated disruptions. This task is characterized by massive interdependencies and a large space of possible actions. Our approach is to apply the following: qualitative, knowledge-intensive techniques relying on a memory of stereotypical failures and appropriate recoveries; and quantitative techniques drawn from the Operations Research community's work on scheduling. Our main scientific challenge is to represent schedules, failures, and repairs so as to make both sets of techniques applicable to the same data. This paper outlines ongoing research in which we are cooperating with United Airlines to develop our understanding of the scientific issues underlying the practicalities of dynamic, real-time schedule repair.

  3. 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.

  4. 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.

  5. Computerized Schedule Effectiveness Technique /SET/ determines present and future schedule position

    NASA Technical Reports Server (NTRS)

    Ballard, D.; Birdsong, J.; Calva, R.

    1967-01-01

    Computerized scheduling system calculates an index of overall schedule-effectiveness. The schedule-effectiveness index is a measurement of actual overall performance against the existing schedule, and a series of schedule-effectiveness values indicates the trend of actual performance. This computer program is written in Fortran 4.

  6. A Generic Expert Scheduling System Architecture and Toolkit: GUESS (Generically Used Expert Scheduling System)

    NASA Technical Reports Server (NTRS)

    Liebowitz, Jay; Krishnamurthy, Vijaya; Rodens, Ira; Houston, Chapman; Liebowitz, Alisa; Baek, Seung; Radko, Joe; Zeide, Janet

    1996-01-01

    Scheduling has become an increasingly important element in today's society and workplace. Within the NASA environment, scheduling is one of the most frequently performed and challenging functions. Towards meeting NASA's scheduling needs, a research version of a generic expert scheduling system architecture and toolkit has been developed. This final report describes the development and testing of GUESS (Generically Used Expert Scheduling System).

  7. 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.

  8. A comparative critical analysis of modern task-parallel runtimes.

    SciTech Connect

    Wheeler, Kyle Bruce; Stark, Dylan; Murphy, Richard C.

    2012-12-01

    The rise in node-level parallelism has increased interest in task-based parallel runtimes for a wide array of application areas. Applications have a wide variety of task spawning patterns which frequently change during the course of application execution, based on the algorithm or solver kernel in use. Task scheduling and load balance regimes, however, are often highly optimized for specific patterns. This paper uses four basic task spawning patterns to quantify the impact of specific scheduling policy decisions on execution time. We compare the behavior of six publicly available tasking runtimes: Intel Cilk, Intel Threading Building Blocks (TBB), Intel OpenMP, GCC OpenMP, Qthreads, and High Performance ParalleX (HPX). With the exception of Qthreads, the runtimes prove to have schedulers that are highly sensitive to application structure. No runtime is able to provide the best performance in all cases, and those that do provide the best performance in some cases, unfortunately, provide extremely poor performance when application structure does not match the schedulers assumptions.

  9. Cost and Schedule Analytical Techniques Development

    NASA Technical Reports Server (NTRS)

    1998-01-01

    This Final Report summarizes the activities performed by Science Applications International Corporation (SAIC) under contract NAS 8-40431 "Cost and Schedule Analytical Techniques Development Contract" (CSATD) during Option Year 3 (December 1, 1997 through November 30, 1998). This Final Report is in compliance with Paragraph 5 of Section F of the contract. This CSATD contract provides technical products and deliverables in the form of parametric models, databases, methodologies, studies, and analyses to the NASA Marshall Space Flight Center's (MSFC) Engineering Cost Office (PP03) and the Program Plans and Requirements Office (PP02) and other user organizations. Detailed Monthly Reports were submitted to MSFC in accordance with the contract's Statement of Work, Section IV "Reporting and Documentation". These reports spelled out each month's specific work performed, deliverables submitted, major meetings conducted, and other pertinent information. Therefore, this Final Report will summarize these activities at a higher level. During this contract Option Year, SAIC expended 25,745 hours in the performance of tasks called out in the Statement of Work. This represents approximately 14 full-time EPs. Included are the Huntsville-based team, plus SAIC specialists in San Diego, Ames Research Center, Tampa, and Colorado Springs performing specific tasks for which they are uniquely qualified.

  10. Batch Scheduling a Fresh Approach

    NASA Technical Reports Server (NTRS)

    Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler

  11. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1991-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. The routine sampling plan for the SESP has been revised this year to reflect changing site operations and priorities. Some sampling previously performed at least annually has been reduced in frequency, and some new sampling to be performed at a less than annual frequency has been added. Therefore, the SESP schedule reflects sampling to be conducted in calendar year 1991 as well as future years. The ground-water sampling schedule is for 1991. This schedule is subject to modification during the year in response to changes in Site operation, program requirements, and the nature of the observed results. Operational limitations such as weather, mechanical failures, sample availability, etc., may also require schedule modifications. Changes will be documented in the respective project files, but this plan will not be reissued. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford evirons.

  12. The sleeping giant: Reinforcement schedules

    PubMed Central

    Zeiler, Michael D.

    1984-01-01

    Schedule research has been the core of operant conditioning, but it is no longer an active area, at least with respect to its traditional focus of describing and explaining moment-to-moment behavior. Yet schedules are central in psychology: Not only do they establish lawful behavior, but they also play a major role in determining the effects of other variables. The reason for the decline appears to be primarily theoretical, in that the work seems not to have led to meaningful integration. The search for controlling variables brought into play by schedule specification has proven unsuccessful, and a catalog of all possible schedule effects is of limited interest. The paper reviews the reasons for the contemporary state of affairs. One prediction about future developments is that instead of revealing component variables and their modes of interaction, schedule effects will be treated as basic empirical laws. Theory will take the form of abstract statements that integrate these separate laws by reference to higher-order principles rather than by reduction to supposedly simpler component variables. PMID:16812403

  13. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1997-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL)(a) for the US Department of Energy (DOE). This document contains the planned 1997 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. In addition, Section 3.0, Biota, also reflects a rotating collection schedule identifying the year a specific sample is scheduled for collection. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1, General Environmental Protection Program, and DOE Order 5400.5, Radiation Protection of the Public and the Environment. The sampling methods will be the same as those described in the Environmental Monitoring Plan, US Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 1, US Department of Energy, Richland, Washington.

  14. Optimal randomized scheduling by replacement

    SciTech Connect

    Saias, I.

    1996-05-01

    In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.

  15. Robust stochastic mine production scheduling

    NASA Astrophysics Data System (ADS)

    Kumral, Mustafa

    2010-06-01

    The production scheduling of open pit mines aims to determine the extraction sequence of blocks such that the net present value (NPV) of a mining project is maximized under capacity and access constraints. This sequencing has significant effect on the profitability of the mining venture. However, given that the values of coefficients in the optimization procedure are obtained in a medium of sparse data and unknown future events, implementations based on deterministic models may lead to destructive consequences to the company. In this article, a robust stochastic optimization (RSO) approach is used to deal with mine production scheduling in a manner such that the solution is insensitive to changes in input data. The approach seeks a trade off between optimality and feasibility. The model is demonstrated on a case study. The findings showed that the approach can be used in mine production scheduling problems efficiently.

  16. Feature-based telescope scheduler

    NASA Astrophysics Data System (ADS)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  17. ESTABLISHING DERIVED TEXTUAL CONTROL IN ACTIVITY SCHEDULES WITH CHILDREN WITH AUTISM

    PubMed Central

    Miguel, Caio F; Yang, Heejean G; Finn, Heather E; Ahearn, William H

    2009-01-01

    Activity schedules are often used to facilitate task engagement and transition for children with autism. This study evaluated whether conditional discrimination training would serve to transfer the control from activity-schedule pictures to printed words (i.e., derived textual control). Two preschoolers with autism were taught to select pictures and printed words given their dictated names. Following training, participants could respond to printed words by completing the depicted task, match printed words to pictures, and read printed words without explicit training (i.e., emergent relations). PMID:20190932

  18. Hubble Systems Optimize Hospital Schedules

    NASA Technical Reports Server (NTRS)

    2009-01-01

    Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

  19. A planning and scheduling lexicon

    NASA Technical Reports Server (NTRS)

    Cruz, Jennifer W.; Eggemeyer, William C.

    1989-01-01

    A lexicon related to mission planning and scheduling for spacecraft is presented. Planning and scheduling work is known as sequencing. Sequencing is a multistage process of merging requests from both the science and engineering arenas to accomplish the objectives defined in the requests. The multistage process begins with the creation of science and engineering goals, continues through their integration into the sequence, and eventually concludes with command execution onboard the spacecraft. The objective of this publication is to introduce some formalism into the field of spacecraft sequencing-system technology. This formalism will make it possible for researchers and potential customers to communicate about system requirements and capabilities in a common language.

  20. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    DTIC Science & Technology

    1994-01-01

    A major challenge for research in production management is to develop new finite-capacity scheduling techniques and tools that (1) can account more...precisely for actual production management constraints and objectives, (2) are better suited for handling production contingencies, and (3) allow the

  1. 1996 Wholesale Power and Transmission Rate Schedules.

    SciTech Connect

    United States. Bonneville Power Administration.

    1996-10-01

    Bonneville Power Administration`s (BPA) 1996 Wholesale Power Rate Schedules, 1996 Ancillary Products and Services Rate Schedule, 1996 Transmission Rate Schedules, and General Rate Schedule Provisions, contained herein, were approved on an interim basis effective October 1, 1996. These rate schedules and provisions were approved by the Federal Energy Regulatory Commission (FERC), United States Department of Energy, in September 1996 (Docket Nos EF96-2011-000 and EF96f-2021-000). These rate schedules and General Rate Schedule Provisions were approved on a final basis by the FERC July 30, 1997, in Dept. of Energy--Bonneville Power Administration, Docket Nos. EF96-2011-000 and EF96-2021-000. Except as noted elsewhere, these 1996 rate schedules and provisions supersede BPA`s Wholesale Power Rate Schedules and General Rate Schedule Provisions, and Transmission Rate Schedules and General Transmission Rate Schedule Provisions, effective October 1, 1995. These rate schedules and general rate schedule provisions include all errata.

  2. Using Grid Benchmarks for Dynamic Scheduling of Grid Applications

    NASA Technical Reports Server (NTRS)

    Frumkin, Michael; Hood, Robert

    2003-01-01

    Navigation or dynamic scheduling of applications on computational grids can be improved through the use of an application-specific characterization of grid resources. Current grid information systems provide a description of the resources, but do not contain any application-specific information. We define a GridScape as dynamic state of the grid resources. We measure the dynamic performance of these resources using the grid benchmarks. Then we use the GridScape for automatic assignment of the tasks of a grid application to grid resources. The scalability of the system is achieved by limiting the navigation overhead to a few percent of the application resource requirements. Our task submission and assignment protocol guarantees that the navigation system does not cause grid congestion. On a synthetic data mining application we demonstrate that Gridscape-based task assignment reduces the application tunaround time.

  3. Task Integration Facilitates Multitasking

    PubMed Central

    de Oliveira, Rita F.; Raab, Markus; Hegele, Mathias; Schorer, Jörg

    2017-01-01

    The aim of this study was to investigate multi-task integration in a continuous tracking task. We were particularly interested in how manipulating task structure in a dual-task situation affects learning of a constant segment embedded in a pursuit-tracking task. Importantly, we examined if dual-task effects could be attributed to task integration by varying the structural similarity and difficulty of the primary and secondary tasks. In Experiment 1 participants performed a pursuit tracking task while counting high-pitched tones and ignoring low-pitched tones. The tones were either presented randomly or structurally 250 ms before each tracking turn. Experiment 2 increased the motor load of the secondary tasks by asking participants to tap their feet to the tones. Experiment 3 further increased motor load of the primary task by increasing its speed and having participants tracking with their non-dominant hand. The results show that dual-task interference can be moderated by secondary task conditions that match the structure of the primary task. Therefore our results support proposals of task integration in continuous tracking paradigms. We conclude that multi-tasking is not always detrimental for motor learning but can be facilitated through task-integration. PMID:28360878

  4. Task Integration Facilitates Multitasking.

    PubMed

    de Oliveira, Rita F; Raab, Markus; Hegele, Mathias; Schorer, Jörg

    2017-01-01

    The aim of this study was to investigate multi-task integration in a continuous tracking task. We were particularly interested in how manipulating task structure in a dual-task situation affects learning of a constant segment embedded in a pursuit-tracking task. Importantly, we examined if dual-task effects could be attributed to task integration by varying the structural similarity and difficulty of the primary and secondary tasks. In Experiment 1 participants performed a pursuit tracking task while counting high-pitched tones and ignoring low-pitched tones. The tones were either presented randomly or structurally 250 ms before each tracking turn. Experiment 2 increased the motor load of the secondary tasks by asking participants to tap their feet to the tones. Experiment 3 further increased motor load of the primary task by increasing its speed and having participants tracking with their non-dominant hand. The results show that dual-task interference can be moderated by secondary task conditions that match the structure of the primary task. Therefore our results support proposals of task integration in continuous tracking paradigms. We conclude that multi-tasking is not always detrimental for motor learning but can be facilitated through task-integration.

  5. An iterative expanding and shrinking process for processor allocation in mixed-parallel workflow scheduling.

    PubMed

    Huang, Kuo-Chan; Wu, Wei-Ya; Wang, Feng-Jian; Liu, Hsiao-Ching; Hung, Chun-Hao

    2016-01-01

    Parallel computation has been widely applied in a variety of large-scale scientific and engineering applications. Many studies indicate that exploiting both task and data parallelisms, i.e. mixed-parallel workflows, to solve large computational problems can get better efficacy compared with either pure task parallelism or pure data parallelism. Scheduling traditional workflows of pure task parallelism on parallel systems has long been known to be an NP-complete problem. Mixed-parallel workflow scheduling has to deal with an additional challenging issue of processor allocation. In this paper, we explore the processor allocation issue in scheduling mixed-parallel workflows of moldable tasks, called M-task, and propose an Iterative Allocation Expanding and Shrinking (IAES) approach. Compared to previous approaches, our IAES has two distinguishing features. The first is allocating more processors to the tasks on allocated critical paths for effectively reducing the makespan of workflow execution. The second is allowing the processor allocation of an M-task to shrink during the iterative procedure, resulting in a more flexible and effective process for finding better allocation. The proposed IAES approach has been evaluated with a series of simulation experiments and compared to several well-known previous methods, including CPR, CPA, MCPA, and MCPA2. The experimental results indicate that our IAES approach outperforms those previous methods significantly in most situations, especially when nodes of the same layer in a workflow might have unequal workloads.

  6. Cyclical scheduling for welfare assistants using 0-1 goal programming

    NASA Astrophysics Data System (ADS)

    Rashid, Nur Rasyida Mohd; Ismail, Wan Rosmanira; Ismail, Norul Fadhilah; Kapi, Azyan Yusra

    2015-05-01

    Currently, the welfare assistants scheduling are handled manually by the head of the welfare assistants and every record is kept in paper. The head of the welfare assistants has to go through a very tedious process to complete the schedule every months in order to conform to the organizations policy as well as to satisfy the welfare assistants' preferences. However, the scheduling task is very time consuming and the staff preferences are not fully satisfied. This paper presents a 0-1 goal programming approach to build a cyclical scheduling for every 60 days and is adapted to welfare assistant schedule in an orphanage institution. This systematic model is built to improve the current manual method of scheduling. The model is implemented using LINGO software. The result shows that each staff has an equal percentage of 62%, 38% and 32% for total duty, night shift and day off respectively. Thus, the proposed model offered better result by providing a cyclical schedule that is better and give higher satisfaction and fairness to the staff than the current manually developed schedule.

  7. Electricity usage scheduling in smart building environments using smart devices.

    PubMed

    Lee, Eunji; Bahn, Hyokyung

    2013-01-01

    With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%.

  8. An Application of Wedelin's Method to Railway Crew Scheduling Problem

    NASA Astrophysics Data System (ADS)

    Miura, Rei; Imaizumi, Jun; Fukumura, Naoto; Morito, Susumu

    So many scheduling problems arise in railway industries. One of the typical scheduling problems is Crew Scheduling Problem. Much attention has been paid to this problem by a lot of researchers, but many studies have not been done to the problems in railway industries in Japan. In this paper, we consider a railway crew scheduling problem in Japan. The problem can be formulated into Set Covering Problem (SCP). In SCP, a row corresponds to a trip representing a minimal task and a column corresponds to a pairing representing a sequence of trips performed by a certain crew. Many algorithms have been developed and proposed for it. On the other hand, in practical use, it is important to investigate how these algorithms behave and work on a certain problem. Therefore, we focus on Wedelin's algorithm, which is based on Lagrange relaxation and is known as one of the high performance algorithms for SCP, and mainly examine the basic idea of this algorithm. Furthermore, we show effectiveness of this procedure through computational experiments on instances from Japanese railway.

  9. Electricity Usage Scheduling in Smart Building Environments Using Smart Devices

    PubMed Central

    Lee, Eunji; Bahn, Hyokyung

    2013-01-01

    With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%. PMID:24453860

  10. 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.

  11. Examining the generality of children's preference for contingent reinforcement via extension to different responses, reinforcers, and schedules.

    PubMed

    Luczynski, Kevin C; Hanley, Gregory P

    2010-01-01

    Studies that have assessed whether children prefer contingent reinforcement (CR) or noncontingent reinforcement (NCR) have shown that they prefer CR. Preference for CR has, however, been evaluated only under continuous reinforcement (CRF) schedules. The prevalence of intermittent reinforcement (INT) warrants an evaluation of whether preference for CR persists as the schedule of reinforcement is thinned. In the current study, we evaluated 2 children's preference for contingent versus noncontingent delivery of highly preferred edible items for academic task completion under CRF and INT schedules. Children (a) preferred CR to NCR under the CRF schedule, (b) continued to prefer CR as the schedule of reinforcement became intermittent, and (c) exhibited a shift in preference from CR to NCR as the schedule became increasingly thin. These findings extend the generality of and provide one set of limits to the preference for CR. Applied implications, variables controlling preferences, and future research are discussed.

  12. "Task" as Research Construct

    ERIC Educational Resources Information Center

    Seedhouse, Paul

    2005-01-01

    The article examines "task" as research construct as predominantly conceived in terms of task-as-workplan in the task-based learning/second language acquisition literature. It is suggested that "task" has weak construct validity and ontology in an overwhelmingly quantitative paradigm because the construct has a "split personality."…

  13. Middle School Organization and Scheduling.

    ERIC Educational Resources Information Center

    McGinley, Nancy J.

    The major purpose of this report is to present information about the organization of middle schools in the school district of Philadelphia. The report includes: (1) summary information on rostering/scheduling practices; and (2) comparisons of promotion/retention rates, average daily attendance, and suspension rates in middle schools with different…

  14. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1996-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the US Department of Energy (DOE). This document contains the planned 1996 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project.

  15. A scheduling model for astronomy

    NASA Astrophysics Data System (ADS)

    Solar, M.; Michelon, P.; Avarias, J.; Garces, M.

    2016-04-01

    Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.

  16. Residential Consumption Scheduling Based on Dynamic User Profiling

    NASA Astrophysics Data System (ADS)

    Mangiatordi, Federica; Pallotti, Emiliano; Del Vecchio, Paolo; Capodiferro, Licia

    Deployment of household appliances and of electric vehicles raises the electricity demand in the residential areas and the impact of the building's electrical power. The variations of electricity consumption across the day, may affect both the design of the electrical generation facilities and the electricity bill, mainly when a dynamic pricing is applied. This paper focuses on an energy management system able to control the day-ahead electricity demand in a residential area, taking into account both the variability of the energy production costs and the profiling of the users. The user's behavior is dynamically profiled on the basis of the tasks performed during the previous days and of the tasks foreseen for the current day. Depending on the size and on the flexibility in time of the user tasks, home inhabitants are grouped in, one over N, energy profiles, using a k-means algorithm. For a fixed energy generation cost, each energy profile is associated to a different hourly energy cost. The goal is to identify any bad user profile and to make it pay a highest bill. A bad profile example is when a user applies a lot of consumption tasks and low flexibility in task reallocation time. The proposed energy management system automatically schedules the tasks, solving a multi-objective optimization problem based on an MPSO strategy. The goals, when identifying bad users profiles, are to reduce the peak to average ratio in energy demand, and to minimize the energy costs, promoting virtuous behaviors.

  17. How should periods without social interaction be scheduled? Children's preference for practical schedules of positive reinforcement.

    PubMed

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

    Several studies have shown that children prefer contingent reinforcement (CR) rather than yoked noncontingent reinforcement (NCR) when continuous reinforcement is programmed in the CR schedule. Preference has not, however, been evaluated for practical schedules that involve CR. In Study 1, we assessed 5 children's preference for obtaining social interaction via a multiple schedule (periods of fixed-ratio 1 reinforcement alternating with periods of extinction), a briefly signaled delayed reinforcement schedule, and an NCR schedule. The multiple schedule promoted the most efficient level of responding. In general, children chose to experience the multiple schedule and avoided the delay and NCR schedules, indicating that they preferred multiple schedules as the means to arrange practical schedules of social interaction. In Study 2, we evaluated potential controlling variables that influenced 1 child's preference for the multiple schedule and found that the strong positive contingency was the primary variable.

  18. Fixed-time teacher attention to decrease off-task behaviors of typically developing third graders.

    PubMed

    Austin, Jennifer L; Soeda, Jennifer M

    2008-01-01

    Evidence to validate the use of fixed-time (FT) reinforcer delivery (i.e., noncontingent reinforcement) with typically developing populations has been relatively rare in the behavioral literature. In those studies that have provided validation, reinforcer delivery schedules appeared to be prohibitively dense for sustained implementation of procedures. This study demonstrated the efficacy of using FT reinforcer delivery to reduce off-task behavior of 2 typically developing third graders using a teacher-selected schedule (FT 4 min). Immediate reductions in off-task behavior were observed for both children. Challenges in identifying the operative mechanism of FT schedules in natural settings are discussed.

  19. VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds

    PubMed Central

    Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

    2016-01-01

    Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms. PMID:27501046

  20. VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

    PubMed

    Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

    2016-01-01

    Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

  1. Secure Autonomous Automated Scheduling (SAAS). Rev. 1.1

    NASA Technical Reports Server (NTRS)

    Walke, Jon G.; Dikeman, Larry; Sage, Stephen P.; Miller, Eric M.

    2010-01-01

    This report describes network-centric operations, where a virtual mission operations center autonomously receives sensor triggers, and schedules space and ground assets using Internet-based technologies and service-oriented architectures. For proof-of-concept purposes, sensor triggers are received from the United States Geological Survey (USGS) to determine targets for space-based sensors. The Surrey Satellite Technology Limited (SSTL) Disaster Monitoring Constellation satellite, the UK-DMC, is used as the space-based sensor. The UK-DMC's availability is determined via machine-to-machine communications using SSTL's mission planning system. Access to/from the UK-DMC for tasking and sensor data is via SSTL's and Universal Space Network's (USN) ground assets. The availability and scheduling of USN's assets can also be performed autonomously via machine-to-machine communications. All communication, both on the ground and between ground and space, uses open Internet standards

  2. Hypertext-based design of a user interface for scheduling

    NASA Technical Reports Server (NTRS)

    Woerner, Irene W.; Biefeld, Eric

    1993-01-01

    Operations Mission Planner (OMP) is an ongoing research project at JPL that utilizes AI techniques to create an intelligent, automated planning and scheduling system. The information space reflects the complexity and diversity of tasks necessary in most real-world scheduling problems. Thus the problem of the user interface is to present as much information as possible at a given moment and allow the user to quickly navigate through the various types of displays. This paper describes a design which applies the hypertext model to solve these user interface problems. The general paradigm is to provide maps and search queries to allow the user to quickly find an interesting conflict or problem, and then allow the user to navigate through the displays in a hypertext fashion.

  3. Software reuse in spacecraft planning and scheduling systems

    NASA Technical Reports Server (NTRS)

    Mclean, David; Tuchman, Alan; Broseghini, Todd; Yen, Wen; Page, Brenda; Johnson, Jay; Bogovich, Lynn; Burkhardt, Chris; Mcintyre, James; Klein, Scott

    1993-01-01

    The use of a software toolkit and development methodology that supports software reuse is described. The toolkit includes source-code-level library modules and stand-alone tools which support such tasks as data reformatting and report generation, simple relational database applications, user interfaces, tactical planning, strategic planning and documentation. The current toolkit is written in C and supports applications that run on IBM-PC's under DOS and UNlX-based workstations under OpenLook and Motif. The toolkit is fully integrated for building scheduling systems that reuse AI knowledge base technology. A typical scheduling scenario and three examples of applications that utilize the reuse toolkit will be briefly described. In addition to the tools themselves, a description of the software evolution and reuse methodology that was used is presented.

  4. Putting ROSE to Work: A Proposed Application of a Request-Oriented Scheduling Engine for Space Station Operations

    NASA Technical Reports Server (NTRS)

    Jaap, John; Muery, Kim

    2000-01-01

    Scheduling engines are found at the core of software systems that plan and schedule activities and resources. A Request-Oriented Scheduling Engine (ROSE) is one that processes a single request (adding a task to a timeline) and then waits for another request. For the International Space Station, a robust ROSE-based system would support multiple, simultaneous users, each formulating requests (defining scheduling requirements), submitting these requests via the internet to a single scheduling engine operating on a single timeline, and immediately viewing the resulting timeline. ROSE is significantly different from the engine currently used to schedule Space Station operations. The current engine supports essentially one person at a time, with a pre-defined set of requirements from many payloads, working in either a "batch" scheduling mode or an interactive/manual scheduling mode. A planning and scheduling process that takes advantage of the features of ROSE could produce greater customer satisfaction at reduced cost and reduced flow time. This paper describes a possible ROSE-based scheduling process and identifies the additional software component required to support it. Resulting changes to the management and control of the process are also discussed.

  5. 29 CFR 1956.61 - Developmental Schedule.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... GOVERNMENT EMPLOYEES IN STATES WITHOUT APPROVED PRIVATE EMPLOYEE PLANS New Jersey § 1956.61 Developmental Schedule. The New Jersey State plan is developmental. The following is a schedule of major...

  6. Integrating protocol schedules with patients' personal calendars.

    PubMed

    Civan, Andrea; Gennari, John H; Pratt, Wanda

    2006-01-01

    We propose a new approach for integrating protocol care schedules into patients' personal calendars. This approach could provide patients with greater control over their current and future scheduling demands as they seek and receive protocol-based care.

  7. Immunization Schedules for Preteens and Teens

    MedlinePlus

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Preteens and Teens United States, 2017 ... on track. View or Print a Schedule Recommended Immunizations for Preteens and Teens (7-18 years) Recommended ...

  8. 48 CFR 245.606 - Inventory schedules.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Inventory schedules. 245.606 Section 245.606 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM... Contractor Inventory 245.606 Inventory schedules....

  9. Recalling academic tasks

    NASA Astrophysics Data System (ADS)

    Draper, Franklin Gno

    This study was focused on what students remembered about five middle school science tasks when they were juniors and seniors in high school. Descriptions of the five tasks were reconstructed from available artifacts and teachers' records, notes and recollections. Three of the five tasks were "authentic" in the sense that students were asked to duplicate the decisions practitioners make in the adult world. The other two tasks were more typical school tasks involving note taking and preparation for a quiz. All five tasks, however, involved use of computers. Students were interviewed to examine what and how well they recalled the tasks and what forms or patterns of recall existed. Analysis of their responses indicated that different kinds of tasks produced different levels of recall. Authentically situated tasks were remembered much better than routine school tasks. Further, authentic tasks centered on design elements were recalled better than those for which design was not as pivotal. Patterns of recall indicated that participants most often recalled the decisions they made, the scenarios of the authentically situated tasks, the consequences of their tasks and the social contexts of the classroom. Task events, in other words, appeared to form a framework upon which students constructed stories of the tasks. The more salient the events, the richer the story, the deeper and more detailed the recall of the task. Thus, authentic tasks appeared to lend themselves to creating stories better than regular school tasks and therefore such tasks were recalled better. Implications of these patterns of recall are discussed with respect to issues of school learning and assessment.

  10. Adaptive Parallel Job Scheduling with Flexible CoScheduling

    SciTech Connect

    Frachtenberg, Eitan; Feitelson, Dror; Petrini, Fabrizio; Fernandez, Juan

    2005-11-01

    Abstract—Many scientific and high-performance computing applications consist of multiple processes running on different processors that communicate frequently. Because of their synchronization needs, these applications can suffer severe performance penalties if their processes are not all coscheduled to run together. Two common approaches to coscheduling jobs are batch scheduling, wherein nodes are dedicated for the duration of the run, and gang scheduling, wherein time slicing is coordinated across processors. Both work well when jobs are load-balanced and make use of the entire parallel machine. However, these conditions are rarely met and most realistic workloads consequently suffer from both internal and external fragmentation, in which resources and processors are left idle because jobs cannot be packed with perfect efficiency. This situation leads to reduced utilization and suboptimal performance. Flexible CoScheduling (FCS) addresses this problem by monitoring each job’s computation granularity and communication pattern and scheduling jobs based on their synchronization and load-balancing requirements. In particular, jobs that do not require stringent synchronization are identified, and are not coscheduled; instead, these processes are used to reduce fragmentation. FCS has been fully implemented on top of the STORM resource manager on a 256-processor Alpha cluster and compared to batch, gang, and implicit coscheduling algorithms. This paper describes in detail the implementation of FCS and its performance evaluation with a variety of workloads, including large-scale benchmarks, scientific applications, and dynamic workloads. The experimental results show that FCS saturates at higher loads than other algorithms (up to 54 percent higher in some cases), and displays lower response times and slowdown than the other algorithms in nearly all scenarios.

  11. Real-time scheduling using minimum search

    NASA Technical Reports Server (NTRS)

    Tadepalli, Prasad; Joshi, Varad

    1992-01-01

    In this paper we consider a simple model of real-time scheduling. We present a real-time scheduling system called RTS which is based on Korf's Minimin algorithm. Experimental results show that the schedule quality initially improves with the amount of look-ahead search and tapers off quickly. So it sppears that reasonably good schedules can be produced with a relatively shallow search.

  12. 48 CFR 2908.404 - Using schedules.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... SOURCES OF SUPPLIES AND SERVICES Federal Supply Schedules 2908.404 Using schedules. Small business... followed may be modified by the Office of Small Business Program as appropriate in order to comply with GSA Federal Supply Schedule procedures (e.g., first tier contracts may be required to report their...

  13. 7 CFR 283.29 - Scheduling conference.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 4 2010-01-01 2010-01-01 false Scheduling conference. 283.29 Section 283.29... Procedure for Appeals of QC Claims of Less Than $50,000 § 283.29 Scheduling conference. (a) Time and place. The ALJ shall direct the parties or their counsel to attend a scheduling conference following...

  14. 75 FR 39629 - FOIA Fee Schedule Update

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations....

  15. 77 FR 41258 - FOIA Fee Schedule Update

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's...

  16. 76 FR 43819 - FOIA Fee Schedule Update

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's...

  17. 40 CFR 52.524 - Compliance schedules.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 3 2010-07-01 2010-07-01 false Compliance schedules. 52.524 Section 52...) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Florida § 52.524 Compliance schedules. (a) The requirements of § 51.262(a) of this chapter are not met since compliance schedules with adequate increments...

  18. 40 CFR 52.927 - Compliance schedules.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 3 2010-07-01 2010-07-01 false Compliance schedules. 52.927 Section 52...) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Kentucky § 52.927 Compliance schedules. (a) The requirements of § 51.262(a) of this chapter are not met since compliance schedules with adequate increments...

  19. 40 CFR 52.134 - Compliance schedules.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 3 2010-07-01 2010-07-01 false Compliance schedules. 52.134 Section 52...) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Arizona § 52.134 Compliance schedules. (a) Federal compliance schedule. (1) Except as provided in paragraph (a)(2) of this section, the owner or operator of...

  20. 15 CFR 400.44 - Zone schedule.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... Executive Secretary (in both paper and electronic copies) a zone schedule which sets forth the elements required in this section. No element of a zone schedule (including any amendment to the zone schedule) may... table of contents; (3) Internal rules/regulations and policies for the zone; (4) All rates or...

  1. 75 FR 7411 - Schedule of Water Charges

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-02-19

    ... COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Notice... Regulations--Water Supply Charges to revise the schedule of water charges. DATES: The Commission will hold a... the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please contact...

  2. Response Strength in Extreme Multiple Schedules

    ERIC Educational Resources Information Center

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  3. 49 CFR Schedule C to Subpart B of... - Schedule C to Subpart B of Part 1139

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 8 2014-10-01 2014-10-01 false Schedule C to Subpart B of Part 1139 C Schedule C... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. C Schedule C to Subpart B of Part 1139 Attachment 1 Schedule C Part I—Condensed Income Statement () Greyhound Lines, Inc.()Trailways combined()...

  4. Nurse Scheduling by Cooperative GA with Effective Mutation Operator

    NASA Astrophysics Data System (ADS)

    Ohki, Makoto

    In this paper, we propose an effective mutation operators for Cooperative Genetic Algorithm (CGA) to be applied to a practical Nurse Scheduling Problem (NSP). The nurse scheduling is a very difficult task, because NSP is a complex combinatorial optimizing problem for which many requirements must be considered. In real hospitals, the schedule changes frequently. The changes of the shift schedule yields various problems, for example, a fall in the nursing level. We describe a technique of the reoptimization of the nurse schedule in response to a change. The conventional CGA is superior in ability for local search by means of its crossover operator, but often stagnates at the unfavorable situation because it is inferior to ability for global search. When the optimization stagnates for long generation cycle, a searching point, population in this case, would be caught in a wide local minimum area. To escape such local minimum area, small change in a population should be required. Based on such consideration, we propose a mutation operator activated depending on the optimization speed. When the optimization stagnates, in other words, when the optimization speed decreases, the mutation yields small changes in the population. Then the population is able to escape from a local minimum area by means of the mutation. However, this mutation operator requires two well-defined parameters. This means that user have to consider the value of these parameters carefully. To solve this problem, we propose a periodic mutation operator which has only one parameter to define itself. This simplified mutation operator is effective over a wide range of the parameter value.

  5. Intelligent Planning and Scheduling for Controlled Life Support Systems

    NASA Technical Reports Server (NTRS)

    Leon, V. Jorge

    1996-01-01

    Planning in Controlled Ecological Life Support Systems (CELSS) requires special look ahead capabilities due to the complex and long-term dynamic behavior of biological systems. This project characterizes the behavior of CELSS, identifies the requirements of intelligent planning systems for CELSS, proposes the decomposition of the planning task into short-term and long-term planning, and studies the crop scheduling problem as an initial approach to long-term planning. CELSS is studied in the realm of Chaos. The amount of biomass in the system is modeled using a bounded quadratic iterator. The results suggests that closed ecological systems can exhibit periodic behavior when imposed external or artificial control. The main characteristics of CELSS from the planning and scheduling perspective are discussed and requirements for planning systems are given. Crop scheduling problem is identified as an important component of the required long-term lookahead capabilities of a CELSS planner. The main characteristics of crop scheduling are described and a model is proposed to represent the problem. A surrogate measure of the probability of survival is developed. The measure reflects the absolute deviation of the vital reservoir levels from their nominal values. The solution space is generated using a probability distribution which captures both knowledge about the system and the current state of affairs at each decision epoch. This probability distribution is used in the context of an evolution paradigm. The concepts developed serve as the basis for the development of a simple crop scheduling tool which is used to demonstrate its usefulness in the design and operation of CELSS.

  6. The role of the production scheduling system in rescheduling

    NASA Astrophysics Data System (ADS)

    Kalinowski, K.; Grabowik, C.; Kempa, W.; Paprocka, I.

    2015-11-01

    The paper presents the rescheduling problem in the context of cooperation between production scheduling system (PSS) and other units in an integrated manufacturing environment - decision makers and software systems. The main aim is to discuss the PSS functionality for maximizing automation of the rescheduling process, reducing the response time and improving the quality of generated solutions. PSSs operate in the meeting of tactical and operational level of planning and control, and play an important role in the production preparation and control. On the basis of information about orders, technology and production system state (e.g. resources availability) they prepare and/or update a detailed plan of production flow - a schedule. All necessary data for scheduling and rescheduling are usually collected in other systems both from organizational and technical production preparation, e.g. ERP, PLM, MES, CAPP or others, as well as they are entered directly by the decision- makers/operators. Data acquired in this way are often incomplete and inconsistent. Therefore the existing rescheduling software works according to interactive method - rather support but does not replace the human decision maker in tasks planning. When rescheduling, due to the limited amount of time to make a decision this interaction is particularly important. An additional problem arises in data acquisition, in the process of data exchanging between systems or in the identification of new data sources and their processing. Different approaches to rescheduling were characterized, including those solutions, where all these operations are carried out by an autonomous system and those in which scheduling is performed only upon request from the outside, for the newly created scheduling data representing the current state of the production system.

  7. Models of ratio schedule performance.

    PubMed

    Bizo, L A; Killeen, P R

    1997-07-01

    Predictions of P. R. Killeen's (1994) mathematical principles of reinforcement were tested for responding on ratio reinforcement schedules. The type of response key, the number of sessions per condition, and first vs. second half of a session had negligible effects on responding. Longer reinforcer durations and larger grain types engendered more responding, affecting primarily the parameter alpha (specific activation). Key pecking was faster than treadle pressing, affecting primarily the parameter delta (response time). Longer intertrial intervals led to higher overall response rates and shorter postreinforcement pauses and higher running rates, and ruled out some competing explanations. The treadle data required a distinction between the energetic requirements and rate-limiting properties of extended responses. The theory was extended to predict pause durations and run rates on ratio schedules.

  8. LDRD Report: Scheduling Irregular Algorithms

    SciTech Connect

    Boman, Erik G.

    2014-10-01

    This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

  9. Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

    PubMed Central

    Carter, Christine E.; Grahn, Jessica A.

    2016-01-01

    Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

  10. Linear-parameter-varying gain-scheduled control of aerospace systems

    NASA Astrophysics Data System (ADS)

    Barker, Jeffrey Michael

    The dynamics of many aerospace systems vary significantly as a function of flight condition. Robust control provides methods of guaranteeing performance and stability goals across flight conditions. In mu-syntthesis, changes to the dynamical system are primarily treated as uncertainty. This method has been successfully applied to many control problems, and here is applied to flutter control. More recently, two techniques for generating robust gain-scheduled controller have been developed. Linear fractional transformation (LFT) gain-scheduled control is an extension of mu-synthesis in which the plant and controller are explicit functions of parameters measurable in real-time. This LFT gain-scheduled control technique is applied to the Benchmark Active Control Technology (BACT) wing, and compared with mu-synthesis control. Linear parameter-varying (LPV) gain-scheduled control is an extension of Hinfinity control to parameter varying systems. LPV gain-scheduled control directly incorporates bounds on the rate of change of the scheduling parameters, and often reduces conservatism inherent in LFT gain-scheduled control. Gain-scheduled LPV control of the BACT wing compares very favorably with the LFT controller. Gain-scheduled LPV controllers are generated for the lateral-directional and longitudinal axes of the Innovative Control Effectors (ICE) aircraft and implemented in nonlinear simulations and real-time piloted nonlinear simulations. Cooper-Harper and pilot-induced oscillation ratings were obtained for an initial design, a reference aircraft and a redesign. Piloted simulation results for the initial LPV gain-scheduled control of the ICE aircraft are compared with results for a conventional fighter aircraft in discrete pitch and roll angle tracking tasks. The results for the redesigned controller are significantly better than both the previous LPV controller and the conventional aircraft.

  11. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1993-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). Samples are routinely collected and analyzed to determine the quality of air, surface water, ground water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Drinking Water Project, and Ground-Water Surveillance Project.

  12. Scheduled Peripheral Component Interconnect Arbiter

    NASA Technical Reports Server (NTRS)

    Nixon, Scott Alan (Inventor)

    2015-01-01

    Systems and methods are described for arbitrating access of a communication bus. In one embodiment, a method includes performing steps on one or more processors. The steps include: receiving an access request from a device of the communication bus; evaluating a bus schedule to determine an importance of the device based on the access request; and selectively granting access of the communication bus to the device based on the importance of the device.

  13. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1995-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program.

  14. 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.

  15. Schedule-induced defecation by rats during ratio and interval schedules of food reinforcement.

    PubMed Central

    Wylie, A M; Layng, M P; Meyer, K A

    1993-01-01

    Lever pressing in rats was maintained by continuous and intermittent schedules of food while defecation was monitored. In Experiment 1, reinforcement densities were matched across variable-ratio and variable-interval schedules for three pairs of rats. Defecation occurred in all 3 rats on the variable-ratio schedule and in all 3 rats on the yoked variable-interval schedule. In Experiment 2, fixed-ratio and fixed-interval schedules with similar reinforcement densities maintained lever pressing. Defecation occurred in 3 of 4 rats on the fixed-ratio schedule and in 4 of 4 rats on the fixed-interval schedule. Almost no defecation occurred during continuous reinforcement in either experiment. These results demonstrate that defecation may occur during both ratio and interval schedules and that the inter-reinforcement interval is more important than the behavioral requirements of the schedule in generating schedule-induced defecation. PMID:8283152

  16. An Evaluation of the Value of Choice-Making Opportunities in Single-Operant Arrangements: Simple Fixed- and Progressive-Ratio Schedules

    ERIC Educational Resources Information Center

    Tiger, Jeffrey H.; Toussaint, Karen A.; Roath, Christopher T.

    2010-01-01

    The current study compared the effects of choice and no-choice reinforcement conditions on the task responding of 3 children with autism across 2 single-operant paradigm reinforcer assessments. The first assessment employed simple fixed-ratio (FR) schedules; the second used progressive-ratio (PR) schedules. The latter assessment identified the…

  17. Integrated scheduling of a container handling system with simultaneous loading and discharging operations

    NASA Astrophysics Data System (ADS)

    Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li

    2016-03-01

    The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.

  18. Increasing Crew Autonomy for Long Duration Exploration Missions: Self-Scheduling

    NASA Technical Reports Server (NTRS)

    Marquez, Jessica J.; Hillenius, Steven; Kanefsky, Bob; Zheng, Jimin; Deliz, Ivonne; Reagan, Marcum

    2017-01-01

    Over the last three years, we have been investigating the operational concept of crew self-scheduling as a method of increasing crew autonomy for future exploration missions. Through Playbook, a planning and scheduling software tool, we have incrementally increased the ability for Earth analog mission crews to modify their schedules. Playbook allows the crew to add new activities from scratch, add new activities or groups of activities through a Task List, and reschedule or reassign flexible activities. The crew is also able to identify if plan modifications create violations, i.e., plan constraints not being met. This paper summarizes our observations with qualitative evidence from four NASA Extreme Environment Mission Operations (NEEMO) analog missions that supported self-scheduling as a feasible operational concept.

  19. Personalized Education; Solving a Group Formation and Scheduling Problem for Educational Content

    ERIC Educational Resources Information Center

    Bahargam, Sanaz; Erdos, Dóra; Bestavros, Azer; Terzi, Evimaria

    2015-01-01

    Whether teaching in a classroom or a Massive Online Open Course it is crucial to present the material in a way that benefits the audience as a whole. We identify two important tasks to solve towards this objective; (1) group students so that they can maximally benefit from peer interaction and (2) find an optimal schedule of the educational…

  20. Block Scheduled versus Traditional Biology Teaching--An Educational Experiment Using the Water Lily

    ERIC Educational Resources Information Center

    Randler, Christoph; Kranich, Konstanze; Eisele, Monika

    2008-01-01

    In this study, we compared a traditional teaching sequence (four distinct lessons) with a block schedule dealing with the ecological adaptations of the water lily. The educational unit contained original plant material and both experimental groups received the same tasks and working sheets. Pupils worked together in groups of three to four pupils…

  1. Effectiveness of Time-Based Attention Schedules on Students in Inclusive Classrooms in Turkey

    ERIC Educational Resources Information Center

    Sazak Pinar, Elif

    2015-01-01

    This study examines the effectiveness of fixed-time (FT) and variable-time (VT) schedules and attention on the problem behaviors and on-task behaviors of students with and without intellectual disabilities in inclusive classrooms in Turkey. Three second-grade students with intellectual disabilities, three students without intellectual…

  2. Discrete Self-Organising Migrating Algorithm for Flow Shop Scheduling with no Wait Makespan

    NASA Astrophysics Data System (ADS)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman; Jasek, Roman

    2011-06-01

    This paper introduces a novel discrete Self Organising Migrating Algorithm for the task of flowshop scheduling with no-wait makespan. The new algorithm is tested with the small and medium Taillard benchmark problems and the obtained results are competitive with the best performing heuristics in literature.

  3. How to Build the Master Schedule in 10 Easy Steps: A Guide for Secondary School Administrators

    ERIC Educational Resources Information Center

    Kussin, Steven S.

    2007-01-01

    This book is an incredibly valuable resource to anyone involved in building a master schedule. The author provides a comprehensive description of the processes involved and makes the reader aware of what needs to be considered and done throughout the process. One of the most time-consuming tasks for school leaders is creating a master schedule…

  4. Autonomous planning and scheduling on the TechSat 21 mission

    NASA Technical Reports Server (NTRS)

    Sherwood, R.; Chien, S.; Castano, R.; Rabideau, G.

    2002-01-01

    The Autonomous Sciencecraft Experiment (ASE) will fly onboard the Air Force TechSat 21 constellation of three spacecraft scheduled for launch in 2006. ASE uses onboard continuous planning, robust task and goal-based execution, model-based mode identification and reconfiguration, and onboard machine learning and pattern recognition to radically increase science return by enabling intelligent downlink selection and autonomous retargeting.

  5. Optimal Scheme for Search State Space and Scheduling on Multiprocessor Systems

    NASA Astrophysics Data System (ADS)

    Youness, Hassan A.; Sakanushi, Keishi; Takeuchi, Yoshinori; Salem, Ashraf; Wahdan, Abdel-Moneim; Imai, Masaharu

    A scheduling algorithm aims to minimize the overall execution time of the program by properly allocating and arranging the execution order of the tasks on the core processors such that the precedence constraints among the tasks are preserved. In this paper, we present a new scheduling algorithm by using geometry analysis of the Task Precedence Graph (TPG) based on A* search technique and uses a computationally efficient cost function for guiding the search with reduced complexity and pruning techniques to produce an optimal solution for the allocation/scheduling problem of a parallel application to parallel and multiprocessor architecture. The main goal of this work is to significantly reduce the search space and achieve the optimality or near optimal solution. We implemented the algorithm on general task graph problems that are processed on most of related search work and obtain the optimal scheduling with a small number of states. The proposed algorithm reduced the exhaustive search by at least 50% of search space. The viability and potential of the proposed algorithm is demonstrated by an illustrative example.

  6. One for All: Maintaining a Single Schedule Database for Large Development Projects

    NASA Technical Reports Server (NTRS)

    Hilscher, R.; Howerton, G.

    1999-01-01

    Efficiently maintaining and controlling a single schedule database in an Integrated Product Team environment is a significant challenge. It's accomplished effectively with the right combination of tools, skills, strategy, creativity, and teamwork. We'll share our lessons learned maintaining a 20,000 plus task network on a 36 month project.

  7. Pitfall or scaffolding? Starting-point pull in configuration tasks.

    PubMed

    Halali, Eliran; Bereby-Meyer, Yoella; Leiser, David

    2013-03-01

    In configuration problems, such as the construction of a weekly study schedule, decision makers must assemble a combination of parts under a set of constraints. Interactions may be present between the parts, and more than a single objective function may exist, such as minimizing the number of days on campus and maximizing the interest level of the courses. Little is known about the decision-making processes involved in configuration tasks. Building on problem-solving and resource-allocation literature, the current study examines the effect of the starting points on performance in these tasks. We predicted that task constraints serve as starting points for the construction process that pull the entire configuration toward them. In 2 experiments, we asked participants to construct a weekly course schedule. We manipulated the course-offering sets so that starting the configuration with one of the task constraints (mandatory courses or a requirement to be on campus on specific days) and myopically building the configuration around it would either help or hinder the effort to reach a good schedule. By several convergent measures, participants succeeded more with the "Asset" course-offering sets than with the "Obstacle" sets. Think-aloud protocol analysis also supported this starting-point pull effect. The results of Experiment 3 show that for a starting point to pull the configuration, it has to be a constraint on the task. All 3 experiments show how building the configuration myopically around the starting points unduly affects the end result.

  8. 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.

  9. A planning language for activity scheduling

    NASA Technical Reports Server (NTRS)

    Zoch, David R.; Lavallee, David; Weinstein, Stuart; Tong, G. Michael

    1991-01-01

    Mission planning and scheduling of spacecraft operations are becoming more complex at NASA. Described here are a mission planning process; a robust, flexible planning language for spacecraft and payload operations; and a software scheduling system that generates schedules based on planning language inputs. The mission planning process often involves many people and organizations. Consequently, a planning language is needed to facilitate communication, to provide a standard interface, and to represent flexible requirements. The software scheduling system interprets the planning language and uses the resource, time duration, constraint, and alternative plan flexibilities to resolve scheduling conflicts.

  10. 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.

  11. Scheduling based on a dynamic resource connection

    NASA Astrophysics Data System (ADS)

    Nagiyev, A. E.; Botygin, I. A.; Shersntneva, A. I.; Konyaev, P. A.

    2017-02-01

    The practical using of distributed computing systems associated with many problems, including troubles with the organization of an effective interaction between the agents located at the nodes of the system, with the specific configuration of each node of the system to perform a certain task, with the effective distribution of the available information and computational resources of the system, with the control of multithreading which implements the logic of solving research problems and so on. The article describes the method of computing load balancing in distributed automatic systems, focused on the multi-agency and multi-threaded data processing. The scheme of the control of processing requests from the terminal devices, providing the effective dynamic scaling of computing power under peak load is offered. The results of the model experiments research of the developed load scheduling algorithm are set out. These results show the effectiveness of the algorithm even with a significant expansion in the number of connected nodes and zoom in the architecture distributed computing system.

  12. SLS-PLAN-IT: A knowledge-based blackboard scheduling system for Spacelab life sciences missions

    NASA Technical Reports Server (NTRS)

    Kao, Cheng-Yan; Lee, Seok-Hua

    1992-01-01

    The primary scheduling tool in use during the Spacelab Life Science (SLS-1) planning phase was the operations research (OR) based, tabular form Experiment Scheduling System (ESS) developed by NASA Marshall. PLAN-IT is an artificial intelligence based interactive graphic timeline editor for ESS developed by JPL. The PLAN-IT software was enhanced for use in the scheduling of Spacelab experiments to support the SLS missions. The enhanced software SLS-PLAN-IT System was used to support the real-time reactive scheduling task during the SLS-1 mission. SLS-PLAN-IT is a frame-based blackboard scheduling shell which, from scheduling input, creates resource-requiring event duration objects and resource-usage duration objects. The blackboard structure is to keep track of the effects of event duration objects on the resource usage objects. Various scheduling heuristics are coded in procedural form and can be invoked any time at the user's request. The system architecture is described along with what has been learned with the SLS-PLAN-IT project.

  13. Supporting Real-Time Operations and Execution through Timeline and Scheduling Aids

    NASA Technical Reports Server (NTRS)

    Marquez, Jessica J.; Pyrzak, Guy; Hashemi, Sam; Ahmed, Samia; McMillin, Kevin Edward; Medwid, Joseph Daniel; Chen, Diana; Hurtle, Esten

    2013-01-01

    Since 2003, the NASA Ames Research Center has been actively involved in researching and advancing the state-of-the-art of planning and scheduling tools for NASA mission operations. Our planning toolkit SPIFe (Scheduling and Planning Interface for Exploration) has supported a variety of missions and field tests, scheduling activities for Mars rovers as well as crew on-board International Space Station and NASA earth analogs. The scheduled plan is the integration of all the activities for the day/s. In turn, the agents (rovers, landers, spaceships, crew) execute from this schedule while the mission support team members (e.g., flight controllers) follow the schedule during execution. Over the last couple of years, our team has begun to research and validate methods that will better support users during realtime operations and execution of scheduled activities. Our team utilizes human-computer interaction principles to research user needs, identify workflow processes, prototype software aids, and user test these. This paper discusses three specific prototypes developed and user tested to support real-time operations: Score Mobile, Playbook, and Mobile Assistant for Task Execution (MATE).

  14. MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler

    NASA Astrophysics Data System (ADS)

    Huang, Ye; Brocco, Amos; Courant, Michele; Hirsbrunner, Beat; Kuonen, Pierre

    This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intelligent scheduling serving the grid community as a whole. Each MaGate scheduler instance is able to deal with dynamic scheduling conditions, with continuously arriving grid jobs. Received jobs are either allocated on local resources, or delegated to other MaGates for remote execution. The proposed MaGate simulator is based on GridSim toolkit and Alea simulator, and abstracts the features and behaviors of complex fundamental grid elements, such as grid jobs, grid resources, and grid users. Simulation of scheduling tasks is supported by a grid network overlay simulator executing distributed ant-based swarm intelligence algorithms to provide services such as group communication and resource discovery. For evaluation, a comparison of behaviors of different collaborative policies among a community of MaGates is provided. Results support the use of the proposed approach as a functional ready grid scheduler simulator.

  15. The Token Economy: Reducing the Disruptive and Off-Task Behavior

    ERIC Educational Resources Information Center

    Chevalier, Nicole Taylor

    2012-01-01

    This study investigates the effects of a token economy as an intervention to reduce disruptive and off-task behavior of third grade students in an open concept setting. The intervention combines the use of a token reinforcement with a raffle style drawing. The students receive tokens on an intermittent reinforcement schedule for being on-task,…

  16. Functional Task Test (FTT)

    NASA Technical Reports Server (NTRS)

    Bloomberg, Jacob J.; Mulavara, Ajitkumar; Peters, Brian T.; Rescheke, Millard F.; Wood, Scott; Lawrence, Emily; Koffman, Igor; Ploutz-Snyder, Lori; Spiering, Barry A.; Feeback, Daniel L.; Platts, Steven H.; Stenger, Michael B.; Lee, Stuart M.C.; Arzeno, Natalia; Feiveson, Alan H.; Ryder, Jeffrey; Garcia, Yamil; Guilliams, Mark E.

    2009-01-01

    This slide presentation reviews the Functional Task Test (FTT), an interdisciplinary testing regimen that has been developed to evaluate astronaut postflight functional performance and related physiological changes. The objectives of the project are: (1) to develop a set of functional tasks that represent critical mission tasks for the Constellation Program, (2) determine the ability to perform these tasks after space flight, (3) Identify the key physiological factors that contribute to functional decrements and (4) Use this information to develop targeted countermeasures.

  17. Reactive Scheduling in Multipurpose Batch Plants

    NASA Astrophysics Data System (ADS)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

    Scheduling is an important operation in process industries for improving resource utilization resulting in direct economic benefits. It has a two-fold objective of fulfilling customer orders within the specified time as well as maximizing the plant profit. Unexpected disturbances such as machine breakdown, arrival of rush orders and cancellation of orders affect the schedule of the plant. Reactive scheduling is generation of a new schedule which has minimum deviation from the original schedule in spite of the occurrence of unexpected events in the plant operation. Recently, Shaik & Floudas (2009) proposed a novel unified model for short-term scheduling of multipurpose batch plants using unit-specific event-based continuous time representation. In this paper, we extend the model of Shaik & Floudas (2009) to handle reactive scheduling.

  18. Mission and science activity scheduling language

    NASA Technical Reports Server (NTRS)

    Hull, Larry G.

    1993-01-01

    To support the distributed and complex operational scheduling required for future National Aeronautics and Space Administration (NASA) missions, a formal, textual language, the Scheduling Applications Interface Language (SAIL), has been developed. Increased geographic dispersion of investigators is leading to distributed mission and science activity planning, scheduling, and operations. SAIL is an innovation which supports the effective and efficient communication of scheduling information among physically dispersed applications in distributed scheduling environments. SAIL offers a clear, concise, unambiguous expression of scheduling information in a readable, hardware independent format. The language concept, syntax, and semantics incorporate language features found useful during five years of research and prototyping with scheduling languages in physically distributed environments. SAIL allows concise specification of mission and science activity plans in a format which promotes repetition and reuse.

  19. A System for Automatically Generating Scheduling Heuristics

    NASA Technical Reports Server (NTRS)

    Morris, Robert

    1996-01-01

    The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

  20. Task Time Tracker

    SciTech Connect

    Cleary, G.

    2013-07-24

    This client-side web app tracks the amount of time spent on arbitrary tasks. It allosw the creation of an unlimited number of arbitrarily named tasks ans via simple interactions, tracks the amount of time spent working on the drfined tasks.

  1. Behavioral Task Analysis

    DTIC Science & Technology

    2010-01-01

    depicting hierarchical behavioral task relationships as well. An extensive list of such tools is given in Wikipedia articles at http...Hierarchical task analysis . In D. Diaper & N. A. Stanton (Eds .), The handbook of task analysis for human-computer interaction (pp. 67-82). Mahwah, NJ

  2. Launching Complex Tasks

    ERIC Educational Resources Information Center

    Jackson, Kara J.; Shahan, Emily C.; Gibbons, Lynsey K.; Cobb, Paul A.

    2012-01-01

    Mathematics lessons can take a variety of formats. In this article, the authors discuss lessons organized around complex mathematical tasks. These lessons usually unfold in three phases. First, the task is introduced to students. Second, students work on solving the task. Third, the teacher "orchestrates" a concluding whole-class discussion in…

  3. Selecting Proportional Reasoning Tasks

    ERIC Educational Resources Information Center

    de la Cruz, Jessica A.

    2013-01-01

    With careful consideration given to task selection, students can construct their own solution strategies to solve complex proportional reasoning tasks while the teacher's instructional goals are still met. Several aspects of the tasks should be considered including their numerical structure, context, difficulty level, and the strategies they are…

  4. Planning and scheduling virtual training for U.S. military units in a resource-constrained environment

    NASA Astrophysics Data System (ADS)

    McGinnis, Michael L.; Phelan, Robert G., Jr.

    1997-06-01

    The United States Army is presently developing a new family of high technology, computer-based training facilities called the Combined Arms Tactical Trainer (CATT). The first of these will be the Close Combat Tactical Trainer (CCTT) where soldiers from armored and mechanized forces at battalion and below will conduct realistic training in manned modules using semi- automated forces (SAF) that operate on a digitized, virtual battlefield. The major scheduling tasks for planning a days' training include selecting training scenarios, scheduling the scenarios throughout the planning horizon, and scheduling training resources for conducting each training scenario. CCTT scheduling is complicated by several factors. Multiple scenarios may be scheduled simultaneously, training scenario duration varies by scenario, and resources for conducting each scenario vary by scenario type and may vary within a scenario type as well. This paper presets a heuristic approach to the CCTT scheduling problem. Scheduling results from the automated scheduling system demonstrate that the heuristic provides 'good' training schedules in a timely manner.

  5. Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store

    SciTech Connect

    Duro, Francisco Rodrigo; Garcia Blas, Javier; Isaila, Florin; Wozniak, Justin M.; Carretero, Jesus; Ross, Rob

    2016-01-01

    This paper explores novel techniques for improving the performance of many-task workflows based on the Swift scripting language. We propose novel programmer options for automated distributed data placement and task scheduling. These options trigger a data placement mechanism used for distributing intermediate workflow data over the servers of Hercules, a distributed key-value store that can be used to cache file system data. We demonstrate that these new mechanisms can significantly improve the aggregated throughput of many-task workflows with up to 86x, reduce the contention on the shared file system, exploit the data locality, and trade off locality and load balance.

  6. Schedule Estimating Relationships for the Engineering and Manufacturing Development of Bomber, Transport, Tanker and Surveillance Aircraft Systems

    DTIC Science & Technology

    1993-09-01

    Approved for public release; distribution unlimited. Preface While the parametric estimation of costs is thoroughly established in the development and...critical to successful management. In this thesis we attempt such an extension of parametric estimation to the area of the schedule of weapon systems in...handful of researchers has plied their regression tools to the task of parametric estimation of schedule durations. Much literature has bemoaned the

  7. Scheduling Coast Guard District Cutters

    DTIC Science & Technology

    1992-09-01

    2G, B-2NY, B-2SAR, C); t - week the cutter assumes the patrol status. COSTO - cost of scheduling cutter i to patrol k; ( 1 if ship i is available for...29262a tII 1 ’• l1 1i ,1111’Iii 1 l l H I ,,,,,,,•~II ,, I.,,,.,,_ I 111 ............ ll Unclassified SECURITY CLASSIFICATION OF THIS PAGE REPORT...Postgraduate School (If applicable) Naval Postgraduate School 1 55 6c. ADDRESS (City, State, and ZIP Code) 7b. ADDRESS (City, State, and ZIP Code) Monterey

  8. An intelligent value-driven scheduling system for Space Station Freedom with special emphasis on the electric power system

    NASA Technical Reports Server (NTRS)

    Krupp, Joseph C.

    1991-01-01

    The Electric Power Control System (EPCS) created by Decision-Science Applications, Inc. (DSA) for the Lewis Research Center is discussed. This system makes decisions on what to schedule and when to schedule it, including making choices among various options or ways of performing a task. The system is goal-directed and seeks to shape resource usage in an optimal manner using a value-driven approach. Discussed here are considerations governing what makes a good schedule, how to design a value function to find the best schedule, and how to design the algorithm that finds the schedule that maximizes this value function. Results are shown which demonstrate the usefulness of the techniques employed.

  9. Advanced Materials for Exploration Task Research Results

    NASA Technical Reports Server (NTRS)

    Cook, M. B. (Compiler); Murphy, K. L.; Schneider, T.

    2008-01-01

    The Advanced Materials for Exploration (AME) Activity in Marshall Space Flight Center s (MSFC s) Exploration Science and Technology Directorate coordinated activities from 2001 to 2006 to support in-space propulsion technologies for future missions. Working together, materials scientists and mission planners identified materials shortfalls that are limiting the performance of long-term missions. The goal of the AME project was to deliver improved materials in targeted areas to meet technology development milestones of NASA s exploration-dedicated activities. Materials research tasks were targeted in five areas: (1) Thermal management materials, (2) propulsion materials, (3) materials characterization, (4) vehicle health monitoring materials, and (5) structural materials. Selected tasks were scheduled for completion such that these new materials could be incorporated into customer development plans.

  10. Stork data scheduler: mitigating the data bottleneck in e-Science.

    PubMed

    Kosar, Tevfik; Balman, Mehmet; Yildirim, Esma; Kulasekaran, Sivakumar; Ross, Brandon

    2011-08-28

    In this paper, we present the Stork data scheduler as a solution for mitigating the data bottleneck in e-Science and data-intensive scientific discovery. Stork focuses on planning, scheduling, monitoring and management of data placement tasks and application-level end-to-end optimization of networked inputs/outputs for petascale distributed e-Science applications. Unlike existing approaches, Stork treats data resources and the tasks related to data access and movement as first-class entities just like computational resources and compute tasks, and not simply the side-effect of computation. Stork provides unique features such as aggregation of data transfer jobs considering their source and destination addresses, and an application-level throughput estimation and optimization service. We describe how these two features are implemented in Stork and their effects on end-to-end data transfer performance.

  11. Schedules of controlled substances: rescheduling of hydrocodone combination products from schedule III to schedule II. Final rule.

    PubMed

    2014-08-22

    With the issuance of this final rule, the Administrator of the Drug Enforcement Administration reschedules hydrocodone combination products from schedule III to schedule II of the Controlled Substances Act. This scheduling action is pursuant to the Controlled Substances Act which requires that such actions be made on the record after opportunity for a hearing through formal rulemaking. This action imposes the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule II controlled substances on persons who handle (manufacture, distribute, dispense, import, export, engage in research, conduct instructional activities with, conduct chemical analysis with, or possess) or propose to handle hydrocodone combination products.

  12. Effects of n-dominance and group composition on task efficiency in laboratory triads.

    NASA Technical Reports Server (NTRS)

    Lampkin, E. C.

    1972-01-01

    Task-oriented triads were formed into various homogeneous and heterogeneous combinations according to their scores on the n-dominance personality trait of the Edwards Personal Preference Schedule. Five group categories were used. The group task required a consensus decision on each trial. High cooperation and interdependence were reinforced by partially restricting the communication network. Results showed heterogeneous groups significantly better at organizing their group communication processes. They consequently performed the task more efficiently than homogeneous triads.

  13. Load Balancing in Cloud Computing Environment Using Improved Weighted Round Robin Algorithm for Nonpreemptive Dependent Tasks.

    PubMed

    Devi, D Chitra; Uthariaraj, V Rhymend

    2016-01-01

    Cloud computing uses the concepts of scheduling and load balancing to migrate tasks to underutilized VMs for effectively sharing the resources. The scheduling of the nonpreemptive tasks in the cloud computing environment is an irrecoverable restraint and hence it has to be assigned to the most appropriate VMs at the initial placement itself. Practically, the arrived jobs consist of multiple interdependent tasks and they may execute the independent tasks in multiple VMs or in the same VM's multiple cores. Also, the jobs arrive during the run time of the server in varying random intervals under various load conditions. The participating heterogeneous resources are managed by allocating the tasks to appropriate resources by static or dynamic scheduling to make the cloud computing more efficient and thus it improves the user satisfaction. Objective of this work is to introduce and evaluate the proposed scheduling and load balancing algorithm by considering the capabilities of each virtual machine (VM), the task length of each requested job, and the interdependency of multiple tasks. Performance of the proposed algorithm is studied by comparing with the existing methods.

  14. Load Balancing in Cloud Computing Environment Using Improved Weighted Round Robin Algorithm for Nonpreemptive Dependent Tasks

    PubMed Central

    Devi, D. Chitra; Uthariaraj, V. Rhymend

    2016-01-01

    Cloud computing uses the concepts of scheduling and load balancing to migrate tasks to underutilized VMs for effectively sharing the resources. The scheduling of the nonpreemptive tasks in the cloud computing environment is an irrecoverable restraint and hence it has to be assigned to the most appropriate VMs at the initial placement itself. Practically, the arrived jobs consist of multiple interdependent tasks and they may execute the independent tasks in multiple VMs or in the same VM's multiple cores. Also, the jobs arrive during the run time of the server in varying random intervals under various load conditions. The participating heterogeneous resources are managed by allocating the tasks to appropriate resources by static or dynamic scheduling to make the cloud computing more efficient and thus it improves the user satisfaction. Objective of this work is to introduce and evaluate the proposed scheduling and load balancing algorithm by considering the capabilities of each virtual machine (VM), the task length of each requested job, and the interdependency of multiple tasks. Performance of the proposed algorithm is studied by comparing with the existing methods. PMID:26955656

  15. Latency Minimizing Tasking for Information Processing Systems

    SciTech Connect

    Horey, James L; Lagesse, Brent J

    2011-01-01

    Real-time cyber-physical systems and information processing clusters require system designers to consider the total latency involved in collecting and aggregating data. For example, applications such as wild-fire monitoring require data to be presented to users in a timely manner. However, most models and algorithms for sensor networks have focused on alternative metrics such as energy efficiency. In this paper, we present a new model of sensor network aggregation that focuses on total latency. Our model is flexible and enables users to configure varying transmission and computation time on a node-by-node basis, and thus enables the simulation of complex computational phenomena. In addition, we present results from three tasking algorithms that trade-off local communication for overall latency performance. These algorithms are evaluated in simulated networks of up to 200 nodes. We've presented an aggregation-focused model of sensor networks that can be used to study the trade-offs between computational coverage and total latency. Our model explicitly takes into account transmission and computation times, and enables users to define different values for the basestation. In addition, we've presented three different tasking algorithms that operate over model to produce aggregation schedules of varying quality. In the future, we expect to continue exploring distributed tasking algorithms for information processing systems. We've shown that the gap between highly optimized schedules that use global information is quite large relative to our distributed algorithms. This gives us encouragement that future distributed tasking algorithms can still make large gains.

  16. Functional communication training and chained schedules of reinforcement to treat challenging behavior maintained by terminations of activity interruptions.

    PubMed

    Falcomata, Terry S; Roane, Henry S; Muething, Colin S; Stephenson, Kasey M; Ing, Anna D

    2012-09-01

    In this article, the authors evaluated functional communication training (FCT) and a chained schedule of reinforcement for the treatment of challenging behavior exhibited by two individuals diagnosed with Asperger syndrome and autism, respectively. Following a functional analysis with undifferentiated results, the authors demonstrated that challenging behavior was occasioned by interruptions of ongoing activities and maintained by terminations of interruptions. Next, they demonstrated the effectiveness of a treatment consisting of FCT with a chained schedule of reinforcement. Last, they modified the chained schedule procedure to increase ease of implementation and promote toleration of activity interruptions, and academic tasks were incorporated into the treatment.

  17. Scheduling algorithms for automatic control systems for technological processes

    NASA Astrophysics Data System (ADS)

    Chernigovskiy, A. S.; Tsarev, R. Yu; Kapulin, D. V.

    2017-01-01

    Wide use of automatic process control systems and the usage of high-performance systems containing a number of computers (processors) give opportunities for creation of high-quality and fast production that increases competitiveness of an enterprise. Exact and fast calculations, control computation, and processing of the big data arrays – all of this requires the high level of productivity and, at the same time, minimum time of data handling and result receiving. In order to reach the best time, it is necessary not only to use computing resources optimally, but also to design and develop the software so that time gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine/multiprocessor systems are applied. Some of basic task scheduling methods for the multi-machine process control systems are considered in this paper, their advantages and disadvantages come to light, and also some usage considerations, in case of the software for automatic process control systems developing, are made.

  18. Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers

    SciTech Connect

    Lifflander, Jonathan; Krishnamoorthy, Sriram; Kale, Laxmikant

    2013-06-16

    Work stealing is a popular approach to scheduling task-parallel programs. The flexibility inherent in work stealing when dealing with load imbalance results in seemingly irregular computation structures, complicating the study of its runtime behavior. In this paper, we present an approach to efficiently trace async-finish parallel programs scheduled using work stealing. We identify key properties that allow us to trace the execution of tasks with low time and space overheads. We also study the usefulness of the proposed schemes in supporting algorithms for data-race detection and retentive steal- ing presented in the literature. We demonstrate that the perturbation due to tracing is within the variation in the execution time with 99% confidence and the traces are concise, amounting to a few tens of kilobytes per thread in most cases. We also demonstrate that the traces enable significant reductions in the cost of detecting data races and result in low, stable space overheads in supporting retentive stealing for async-finish programs.

  19. Long-term staff scheduling with regular temporal distribution.

    PubMed

    Carrasco, Rafael C

    2010-11-01

    Although optimal staff scheduling often requires elaborate computational methods, those cases which are not highly constrained can be efficiently solved using simpler approaches. This paper describes how a simple procedure, combining random and greedy strategies with heuristics, has been successfully applied in a Spanish hospital to assign guard shifts to the physicians in a department. In this case, the employees prefer that their guard duties are regularly distributed in time. The workload distribution must also satisfy some constraints: in particular, the distribution of duties among the staff must be uniform when a number of tasks and shift types (including some unfrequent and aperiodic types, such as those scheduled during long weekends) are considered. Furthermore, the composition of teams should be varied, in the sense that no particular pairing should dominate the assignments. The procedure proposed is able to find suitable solutions when the number of employees available for every task is not small compared to the number required at every shift. The software is distributed under the terms of the GNU General Public License.

  20. On scheduling models for the frequency interval assignment problem with cumulative interferences

    NASA Astrophysics Data System (ADS)

    Kiatmanaroj, Kata; Artigues, Christian; Houssin, Laurent

    2016-05-01

    In this article, models and methods for solving a real-life frequency assignment problem based on scheduling theory are investigated. A realistic frequency assignment problem involving cumulative interference constraints in which the aim is to maximize the number of assigned users is considered. If interferences are assumed to be binary, a multiple carrier frequency assignment problem can be treated as a disjunctive scheduling problem since a user requesting a number of contiguous frequencies can be considered as a non-preemptive task with a processing time, and two interfering users can be modelled through a disjunctive constraint on the corresponding tasks. A binary interference version of the problem is constructed and a disjunctive scheduling model is derived. Based on the binary representation, two models are proposed. The first one relies on an interference matrix and the second one considers maximal cliques. A third, cumulative, model that yields a new class of scheduling problems is also proposed. Computational experiments show that the case-study frequency assignment problem can be solved efficiently with disjunctive scheduling techniques.

  1. Job Scheduling Under the Portable Batch System

    NASA Technical Reports Server (NTRS)

    Henderson, Robert L.; Woodrow, Thomas S. (Technical Monitor)

    1995-01-01

    The typical batch queuing system schedules jobs for execution by a set of queue controls. The controls determine from which queues jobs may be selected. Within the queue, jobs are ordered first-in, first-run. This limits the set of scheduling policies available to a site. The Portable Batch System removes this limitation by providing an external scheduling module. This separate program has full knowledge of the available queued jobs, running jobs, and system resource usage. Sites are able to implement any policy expressible in one of several procedural language. Policies may range from "bet fit" to "fair share" to purely political. Scheduling decisions can be made over the full set of jobs regardless of queue or order. The scheduling policy can be changed to fit a wide variety of computing environments and scheduling goals. This is demonstrated by the use of PBS on an IBM SP-2 system at NASA Ames.

  2. Steps Toward Optimal Competitive Scheduling

    NASA Technical Reports Server (NTRS)

    Frank, Jeremy; Crawford, James; Khatib, Lina; Brafman, Ronen

    2006-01-01

    This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a

  3. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L.E.

    1994-02-01

    This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site.

  4. Schedule optimization study implementation plan

    SciTech Connect

    Not Available

    1993-11-01

    This Implementation Plan is intended to provide a basis for improvements in the conduct of the Environmental Restoration (ER) Program at Hanford. The Plan is based on the findings of the Schedule Optimization Study (SOS) team which was convened for two weeks in September 1992 at the request of the U.S. Department of Energy (DOE) Richland Operations Office (RL). The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit (OU) Remedial Investigation/Feasibility Study (RI/FS) Work Plan. The SOS team was comprised of independent professionals from other federal agencies and the private sector experienced in environmental restoration within the federal system. The objective of the team was to examine reasons for the lengthy RI/FS process and recommend ways to expedite it. The SOS team issued their Final Report in December 1992. The report found the most serious impediments to cleanup relate to a series of management and policy issues which are within the control of the three parties managing and monitoring Hanford -- the DOE, U.S. Environmental Protection Agency (EPA), and the State of Washington Department of Ecology (Ecology). The SOS Report identified the following eight cross-cutting issues as the root of major impediments to the Hanford Site cleanup. Each of these eight issues is quoted from the SOS Report followed by a brief, general description of the proposed approach being developed.

  5. Computer-assisted warehouse personnel scheduling

    NASA Astrophysics Data System (ADS)

    Parker, Sandra C.; Malstrom, Eric J.; Usmani, Tariq

    1992-02-01

    A decision support system is developed for personnel scheduling in a multiple warehouse environment. The system incorporates current manpower level, historical data of workers used, empirical load distributions, and performance standards to generate manpower requirements for a specified planning horizon. The software has been developed to be easily adaptable to varying situational details, therefore is widely applicable in different warehouse settings. The system offers personnel managers a valuable tool for evaluating alternative schedules and making intelligent decisions regarding personnel scheduling in warehouses.

  6. Scheduling Options Utilized in Departments of Nursing.

    DTIC Science & Technology

    1983-09-01

    or system. Adequate data are not presented concerning design, base- line versus post evaluation , and long term follow-up even though some schedules...summarization and critique of various reported methodologies. Examples of non-traditional scheduling optio~s were described, evaluated for usefulness...services. However, with the present perceived nursing shortage and the dissatisfaction of nurses with con- ventional scheduling methods, a need to evaluate

  7. Spent nuclear fuel project integrated schedule plan

    SciTech Connect

    Squires, K.G.

    1995-03-06

    The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel.

  8. A hybrid job-shop scheduling system

    NASA Technical Reports Server (NTRS)

    Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas

    1992-01-01

    The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.

  9. Intelligent perturbation algorithms to space scheduling optimization

    NASA Technical Reports Server (NTRS)

    Kurtzman, Clifford R.

    1991-01-01

    The limited availability and high cost of crew time and scarce resources make optimization of space operations critical. Advances in computer technology coupled with new iterative search techniques permit the near optimization of complex scheduling problems that were previously considered computationally intractable. Described here is a class of search techniques called Intelligent Perturbation Algorithms. Several scheduling systems which use these algorithms to optimize the scheduling of space crew, payload, and resource operations are also discussed.

  10. Creating activity schedules using Microsoft Powerpoint.

    PubMed Central

    Rehfeldt, Ruth Anne; Kinney, Elisabeth M; Root, Shannon; Stromer, Robert

    2004-01-01

    We describe how PowerPoint presentation software can be used to create computer activity schedules to teach individuals with special needs. Presented are the steps involved in creating activity schedules with close-ended and open-ended activities, and for preparing schedules that include photos, sounds, text, and videos that can be used to occasion an individual's engagement in a variety of learning activities. PMID:15154226

  11. AVLIS production plant project schedule and milestones

    SciTech Connect

    Not Available

    1984-11-15

    An AVLIS Production Plant Deployment Schedule for the engineering, procurement, and construction for both the Initial Increment of Production and the fully Activated Plant, has been developed by the project team consisting of Lawrence Livermore National Laboratory, Martin Marietta Energy Systems, Inc. with architect-engineer support from Bechtel National, Inc., Stone and Webster Engineering Corporation, and Westinghouse Corporation. The initial deployment phase consists of six separators modules and the three laser power amplifier modules consistent with the FY84 reference design with a name plate capacity of 5 million separative work units/yr followed by a full plant activation to approximately 13 million separative work units/yr. The AVLIS Production Plant project team's strategy for deployment schedule analysis focused on three schedule options: engineering limited schedule; authorization limited schedule; and funding limited project schedule. The three deployment schedule options developed by AVLIS project team have been classified in ranges such as an optimistic, rapid/moderate, or moderate/pessimistic based on the probability of meeting the individual schedule option's major milestones or program objectives of enriching uranium by the AVLIS process in an effective cost and schedule manner. 47 figures, 7 tables.

  12. Tool for Merging Proposals Into DSN Schedules

    NASA Technical Reports Server (NTRS)

    Khanampornpan, Teerapat; Kwok, John; Call, Jared

    2008-01-01

    A Practical Extraction and Reporting Language (Perl) script called merge7da has been developed to facilitate determination, by a project scheduler in NASA's Deep Space Network, of whether a proposal for use of the DSN could create a conflict with the current DSN schedule. Prior to the development of merge7da, there was no way to quickly identify potential schedule conflicts: it was necessary to submit a proposal and wait a day or two for a response from a DSN scheduling facility. By using merge7da to detect and eliminate potential schedule conflicts before submitting a proposal, a project scheduler saves time and gains assurance that the proposal will probably be accepted. merge7da accepts two input files, one of which contains the current DSN schedule and is in a DSN-standard format called '7da'. The other input file contains the proposal and is in another DSN-standard format called 'C1/C2'. merge7da processes the two input files to produce a merged 7da-format output file that represents the DSN schedule as it would be if the proposal were to be adopted. This 7da output file can be loaded into various DSN scheduling software tools now in use.

  13. Empowering nurses through an innovative scheduling model.

    PubMed

    Maxson-Cooper, Pamela A

    2011-03-01

    In 1980, Froedtert Hospital opened its doors using an innovative registered nurse scheduling model. The hospital has grown to 500 beds, with over 1,600 registered nurses, and continues to use the 7/70 staffing pattern as a core scheduling model. Registered nurses work a straight seven, 10-hour days, and then have 1 week off, or 26 weeks off a year. For professional registered nurses in acute care, the schedule is predictable and consistent for years. This scheduling pattern has resulted in excellent registered nurse satisfaction, increased retention, and consistency in care delivery teams since 1980.

  14. 40 CFR 52.730 - Compliance schedules.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... supporting information he considers necessary for proper certification. (ii) Any compliance schedule adopted..., 1973. lake county Morton Manufacturing Co Libertyville 205(f) Aug. 27, 1973. la salle county...

  15. Payload crew training scheduler (PACTS) user's manual

    NASA Technical Reports Server (NTRS)

    Shipman, D. L.

    1980-01-01

    The operation of the payload specialist training scheduler (PACTS) is discussed in this user's manual which is used to schedule payload specialists for mission training on the Spacelab experiments. The PACTS program is a fully automated interactive, computerized scheduling program equipped with tutorial displays. The tutorial displays are sufficiently detailed for use by a program analyst having no computer experience. The PACTS program is designed to operate on the UNIVAC 1108 computer system, and has the capability to load output into a PDP 11/45 Interactive Graphics Display System for printing schedules. The program has the capacity to handle up to three overlapping Spacelab missions.

  16. SOFIA'S Challenge: Scheduling Airborne Astronomy Observations

    NASA Technical Reports Server (NTRS)

    Frank, Jeremy

    2005-01-01

    The Stratospheric Observatory for Infrared Astronomy (SOFIA) is NASA's next generation airborne astronomical observatory, and will commence operations in 2005. The facility consists of a 747-SP modified to accommodate a 2.5 meter telescope. SOFIA is expected to fly an average of 140 science flights per year over its 20 year lifetime. Depending on the nature of the instrument used during flight, 5-15 observations per flight are expected. The SOFIA telescope is mounted aft of the wings on the port side of the aircraft and is articulated through a range of 20deg to 60deg of elevation. The telescope has minimal lateral flexibility; thus, the aircraft must turn constantly to maintain the telescope's focus on an object during observations. A significant problem in future SOFIA operations is that of scheduling flights in support of observations. Investigators are expected to propose small numbers of observations, and many observations must be grouped together to make up single flights. Flight planning for the previous generation airborne observatory, the Kuiper Airborne Observatory (KAO), was done by hand; planners had to choose takeoff time, observations to perform, and decide on setup-actions (called "dead-legs") to position the aircraft prior to observing. This task frequently required between 6-8 hours to plan one flight The scope of the flight planning problem for supporting GI observations with the anticipated flight rate for SOFIA makes the manual approach for flight planning daunting. In response, we have designed an Automated Flight Planner (AFP) that accepts as input a set of requested observations, designated flight days, weather predictions and fuel limitations, and searches automatically for high-quality flight plans that satisfy all relevant aircraft and astronomer specified constraints. The AFP can generate one candidate flight plan in 5-10 minutes, of computation time, a feat beyond the capabilities of human flight planners. The rate at which the AFP can

  17. Pain Management Task Force

    DTIC Science & Technology

    2010-05-01

    conditions [e.g., peripheral neuropathies , lower extremity arthritis, non-specific LBP], cancer-related pain, post-surgical pain, and other acute pain...Integrative Pain Treatment Medicine .......................................................... 42 4.2.2 Osteopathic Manipulation...VHA and civilian hospitals. Visits outside of Army Medical Treatment Facilities (MTFs) were scheduled based on recommendations from Service

  18. Transport Task Force Leadership, Task 4

    SciTech Connect

    Callen, J.D.

    1991-07-01

    The Transport Task Force (TTF) was initiated as a broad-based US magnetic fusion community activity during the fall of 1988 to focus attention on and encourage development of an increased understanding of anomalous transport in tokamaks. The overall TTF goal is to make progress on Characterizing, Understanding and Identifying how to Reduce plasma transport in tokamaks -- to CUIR transport.

  19. Educational Management: Timetable Scheduling Algorithms

    ERIC Educational Resources Information Center

    Siyambalapitiya, Sarath B.

    2006-01-01

    There is no doubt that the most important activity In schools and universities is conducting classes and lectures to their students. Preparation of timetables is a major task confronted by the management every year. A lot of time is spent on this exercise, yet the end result would be far from satisfactory. In this paper, we draw attention to the…

  20. Workflow Scheduling in Grid Computing Environment using a Hybrid GAACO Approach

    NASA Astrophysics Data System (ADS)

    Sathish, Kuppani; RamaMohan Reddy, A.

    2016-06-01

    In recent trends, grid computing is one of the emerging areas in computing platform which supports parallel and distributed environments. The main problem for grid computing is scheduling of workflows in terms of user specifications is a stimulating task and it also impacts the performance. This paper proposes a hybrid GAACO approach, which is a combination of Genetic Algorithm and Ant Colony Optimization Algorithm. The GAACO approach proposes different types of scheduling heuristics for the grid environment. The main objective of this approach is to satisfy all the defined constraints and user parameters.

  1. Workflow Scheduling in Grid Computing Environment using a Hybrid GAACO Approach

    NASA Astrophysics Data System (ADS)

    Sathish, Kuppani; RamaMohan Reddy, A.

    2017-02-01

    In recent trends, grid computing is one of the emerging areas in computing platform which supports parallel and distributed environments. The main problem for grid computing is scheduling of workflows in terms of user specifications is a stimulating task and it also impacts the performance. This paper proposes a hybrid GAACO approach, which is a combination of Genetic Algorithm and Ant Colony Optimization Algorithm. The GAACO approach proposes different types of scheduling heuristics for the grid environment. The main objective of this approach is to satisfy all the defined constraints and user parameters.

  2. Rail mounted gantry crane scheduling optimization in railway container terminal based on hybrid handling mode.

    PubMed

    Wang, Li; Zhu, Xiaoning

    2014-01-01

    Rail mounted gantry crane (RMGC) scheduling is important in reducing makespan of handling operation and improving container handling efficiency. In this paper, we present an RMGC scheduling optimization model, whose objective is to determine an optimization handling sequence in order to minimize RMGC idle load time in handling tasks. An ant colony optimization is proposed to obtain near optimal solutions. Computational experiments on a specific railway container terminal are conducted to illustrate the proposed model and solution algorithm. The results show that the proposed method is effective in reducing the idle load time of RMGC.

  3. Rail Mounted Gantry Crane Scheduling Optimization in Railway Container Terminal Based on Hybrid Handling Mode

    PubMed Central

    Zhu, Xiaoning

    2014-01-01

    Rail mounted gantry crane (RMGC) scheduling is important in reducing makespan of handling operation and improving container handling efficiency. In this paper, we present an RMGC scheduling optimization model, whose objective is to determine an optimization handling sequence in order to minimize RMGC idle load time in handling tasks. An ant colony optimization is proposed to obtain near optimal solutions. Computational experiments on a specific railway container terminal are conducted to illustrate the proposed model and solution algorithm. The results show that the proposed method is effective in reducing the idle load time of RMGC. PMID:25538768

  4. The nurse scheduling problem: a goal programming and nonlinear optimization approaches

    NASA Astrophysics Data System (ADS)

    Hakim, L.; Bakhtiar, T.; Jaharuddin

    2017-01-01

    Nurses scheduling is an activity of allocating nurses to conduct a set of tasks at certain room at a hospital or health centre within a certain period. One of obstacles in the nurse scheduling is the lack of resources in order to fulfil the needs of the hospital. Nurse scheduling which is undertaken manually will be at risk of not fulfilling some nursing rules set by the hospital. Therefore, this study aimed to perform scheduling models that satisfy all the specific rules set by the management of Bogor State Hospital. We have developed three models to overcome the scheduling needs. Model 1 is designed to schedule nurses who are solely assigned to a certain inpatient unit and Model 2 is constructed to manage nurses who are assigned to an inpatient room as well as at Polyclinic room as conjunct nurses. As the assignment of nurses on each shift is uneven, then we propose Model 3 to minimize the variance of the workload in order to achieve equitable assignment on every shift. The first two models are formulated in goal programming framework, while the last model is in nonlinear optimization form.

  5. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 8 2013-10-01 2013-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... year 19__ (c) Calendar year 19__ (d) Base year actual (e) Part I.—Selected financial data...

  6. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 8 2014-10-01 2014-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... year 19__ (c) Calendar year 19__ (d) Base year actual (e) Part I.—Selected financial data...

  7. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 49 Transportation 8 2011-10-01 2011-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... year 19__ (c) Calendar year 19__ (d) Base year actual (e) Part I.—Selected financial data...

  8. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 49 Transportation 8 2012-10-01 2012-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... year 19__ (c) Calendar year 19__ (d) Base year actual (e) Part I.—Selected financial data...

  9. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 49 Transportation 8 2010-10-01 2010-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... year 19__ (c) Calendar year 19__ (d) Base year actual (e) Part I.—Selected financial data...

  10. Environmental surveillance master sampling schedule

    SciTech Connect

    Bisping, L E

    1992-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. Samples for radiological analyses include Air-Particulate Filter, gases and vapor; Water/Columbia River, Onsite Pond, Spring, Irrigation, and Drinking; Foodstuffs/Animal Products including Whole Milk, Poultry and Eggs, and Beef; Foodstuffs/Produce including Leafy Vegetables, Vegetables, and Fruit; Foodstuffs/Farm Products including Wine, Wheat and Alfalfa; Wildlife; Soil; Vegetation; and Sediment. Direct Radiation Measurements include Terrestrial Locations, Columbia River Shoreline Locations, and Onsite Roadway, Railway and Aerial, Radiation Surveys.

  11. CASSIUS: The Cassini Uplink Scheduler

    NASA Technical Reports Server (NTRS)

    Bellinger, Earl

    2012-01-01

    The Cassini Uplink Scheduler (CASSIUS) is cross-platform software used to generate a radiation sequence plan for commands being sent to the Cassini spacecraft. Because signals must travel through varying amounts of Earth's atmosphere, several different modes of constant telemetry rates have been devised. These modes guarantee that the spacecraft and the Deep Space Network agree with respect to the data transmission rate. However, the memory readout of a command will be lost if it occurs on a telemetry mode boundary. Given a list of spacecraft message files as well as the available telemetry modes, CASSIUS can find an uplink sequence that ensures safe transmission of each file. In addition, it can predict when the two on-board solid state recorders will swap. CASSIUS prevents data corruption by making sure that commands are not planned for memory readout during telemetry rate changes or a solid state recorder swap.

  12. A Data Scheduling and Management Infrastructure for the TEAM Network

    NASA Astrophysics Data System (ADS)

    Andelman, S.; Baru, C.; Chandra, S.; Fegraus, E.; Lin, K.; Unwin, R.

    2009-04-01

    currently partnering with the San Diego Super Computer Center to build the data management infrastructure. Data collected from the three core protocols as well as others are currently made available through the TEAM Network portal, which provides the content management framework, the data scheduling and management framework, an administrative framework to implement and manage TEAM sites, collaborative tools and a number of tools and applications utilizing Google Map and Google Earth products. A critical element of the TEAM Network data management infrastructure is to make the data publicly available in as close to real-time as possible (the TEAM Network Data Use Policy: http://www.teamnetwork.org/en/data/policy). This requires two essential tasks to be accomplished, 1) A data collection schedule has to be planned, proposed and approved for a given TEAM site. This is a challenging process since TEAM sites are geographically distributed across the tropics and hence have different seasons where they schedule field sampling for the different TEAM protocols. Capturing this information and ensuring that TEAM sites follow the outlined legal contract is key to the data collection process and 2) A stream-lined and efficient information management system to ensure data collected from the field meet the minimum data standards (i.e. are of the highest scientific quality) and are securely transferred, archived, processed and be rapidly made publicaly available, as a finished consumable product via the TEAM Network portal. The TEAM Network is achieving these goals by implementing an end-to-end framework consisting of the Sampling Scheduler application and the Data Management Framework. Sampling Scheduler The Sampling Scheduler is a project management, calendar based portal application that will allow scientists at a TEAM site to schedule field sampling for each of the TEAM protocols implemented at that site. The sampling scheduler addresses the specific requirements established in the

  13. NSI security task: Overview

    NASA Technical Reports Server (NTRS)

    Tencati, Ron

    1991-01-01

    An overview is presented of the NASA Science Internet (NSI) security task. The task includes the following: policies and security documentation; risk analysis and management; computer emergency response team; incident handling; toolkit development; user consulting; and working groups, conferences, and committees.

  14. The effects of fixed-time and contingent schedules of negative reinforcement on compliance and aberrant behavior.

    PubMed

    Reed, Gregory K; Ringdahl, Joel E; Wacker, David P; Barretto, Anjali; Andelman, Marc S

    2005-01-01

    Prior research has suggested that fixed-time (FT) schedules of reinforcement do not necessarily preclude the acquisition of appropriate behavior (e.g., mands) when combined with differential reinforcement (DRA). These studies also note that dense FT schedules are more likely to interfere with DRA packages than lean FT schedules. In the current investigation, we examined whether similar findings would occur with FT schedules of negative reinforcement. Schedule analyses were conducted with two participants following functional analyses that identified escape from task demands as the maintaining variable for problem behavior. Differential negative reinforcement of alternative behavior (DNRA) was implemented first to establish behavioral control (decreased problem behavior and increased compliance). Breaks (negative reinforcement) were then concurrently delivered on a FT basis under either dense (at a greater rate than that obtained during DNRA alone) or lean (at a lower rate than that obtained during DNRA) reinforcement schedules. In general, results showed that FT escape did not preclude compliance when the FT schedule was lean, but treatment gains were significantly disrupted when dense FT schedules were superimposed.

  15. Task Description Language

    NASA Technical Reports Server (NTRS)

    Simmons, Reid; Apfelbaum, David

    2005-01-01

    Task Description Language (TDL) is an extension of the C++ programming language that enables programmers to quickly and easily write complex, concurrent computer programs for controlling real-time autonomous systems, including robots and spacecraft. TDL is based on earlier work (circa 1984 through 1989) on the Task Control Architecture (TCA). TDL provides syntactic support for hierarchical task-level control functions, including task decomposition, synchronization, execution monitoring, and exception handling. A Java-language-based compiler transforms TDL programs into pure C++ code that includes calls to a platform-independent task-control-management (TCM) library. TDL has been used to control and coordinate multiple heterogeneous robots in projects sponsored by NASA and the Defense Advanced Research Projects Agency (DARPA). It has also been used in Brazil to control an autonomous airship and in Canada to control a robotic manipulator.

  16. Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

    NASA Technical Reports Server (NTRS)

    Short, Nick, Jr.; Bedet, Jean-Jacques; Bodden, Lee; Boddy, Mark; White, Jim; Beane, John

    1994-01-01

    The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications

  17. Patient Scheduling with a Personal Touch

    PubMed Central

    Durst, Stephen

    1989-01-01

    What once required extensive manual effort and coordination has been reduced to a single access point for patient data collection and scheduling. Over half of the one million patients seen yearly by a large multi-specialty physicians' group are handled with an automated scheduling system with patient sensitivity as the main priority.

  18. 33 CFR 242.6 - Fee schedule.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... based on a Corps-wide average of estimated current costs for providing that level of service. (f) Review... most current cost data available. If necessary, the Fee Schedule will be revised after public notice... MANAGEMENT SERVICES PROGRAM ESTABLISHMENT OF FEES FOR COST RECOVERY § 242.6 Fee schedule. (a) General....

  19. 7 CFR 1.18 - Fee schedule.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 1 2010-01-01 2010-01-01 false Fee schedule. 1.18 Section 1.18 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.18 Fee schedule. Pursuant to § 2.28 of this title, the Chief Financial Officer is delegated authority to promulgate...

  20. 7 CFR 1.18 - Fee schedule.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 1 2013-01-01 2013-01-01 false Fee schedule. 1.18 Section 1.18 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.18 Fee schedule. Pursuant to § 2.28 of this title, the Chief Financial Officer is delegated authority to promulgate...

  1. 33 CFR 242.6 - Fee schedule.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... MANAGEMENT SERVICES PROGRAM ESTABLISHMENT OF FEES FOR COST RECOVERY § 242.6 Fee schedule. (a) General. The... Services requiring more than ten minutes and up to one work day to provide. The Fee Schedule has been... total costs for services provided to Federal agencies and private persons. (b) Level of effort....

  2. 40 CFR 716.60 - Reporting schedule.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 40 Protection of Environment 31 2011-07-01 2011-07-01 false Reporting schedule. 716.60 Section 716.60 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) TOXIC SUBSTANCES CONTROL ACT HEALTH AND SAFETY DATA REPORTING General Provisions § 716.60 Reporting schedule. (a) General...

  3. 40 CFR 716.60 - Reporting schedule.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 40 Protection of Environment 31 2014-07-01 2014-07-01 false Reporting schedule. 716.60 Section 716.60 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) TOXIC SUBSTANCES CONTROL ACT HEALTH AND SAFETY DATA REPORTING General Provisions § 716.60 Reporting schedule. (a) General...

  4. 6 CFR 27.210 - Submissions schedule.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 6 Domestic Security 1 2010-01-01 2010-01-01 false Submissions schedule. 27.210 Section 27.210 Domestic Security DEPARTMENT OF HOMELAND SECURITY, OFFICE OF THE SECRETARY CHEMICAL FACILITY ANTI-TERRORISM STANDARDS Chemical Facility Security Program § 27.210 Submissions schedule. (a) Initial Submission....

  5. 10 CFR 51.15 - Time schedules.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 10 Energy 2 2012-01-01 2012-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... proposed action or a petitioner for rulemaking shall, establish a time schedule for all or any...

  6. 46 CFR 308.503 - Rate schedules.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... MARITIME ADMINISTRATION, DEPARTMENT OF TRANSPORTATION EMERGENCY OPERATIONS WAR RISK INSURANCE War Risk Cargo Insurance I-Introduction § 308.503 Rate schedules. Rate schedules published by the Maritime... Maritime Administrator at any time without notice. If no rate is published for a voyage on which war...

  7. Observing the Use of Tactile Schedules

    ERIC Educational Resources Information Center

    Aasen, Gro; Naerland, Terje

    2014-01-01

    This article explores the use of tactile schedules in a heterogeneous sample of children with congenital blindness and varying degrees of additional disabilities. Basic conditions for the use of tactile schedules are proposed and discussed. Child behaviour indicative of some particular functions that can be attained with the use of tactile…

  8. 11 CFR 9006.3 - Alphabetized schedules.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 11 Federal Elections 1 2010-01-01 2010-01-01 false Alphabetized schedules. 9006.3 Section 9006.3 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: GENERAL ELECTION FINANCING REPORTS AND RECORDKEEPING § 9006.3 Alphabetized schedules. If the authorized committee(s) of...

  9. 6 CFR 27.210 - Submissions schedule.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 6 Domestic Security 1 2012-01-01 2012-01-01 false Submissions schedule. 27.210 Section 27.210 Domestic Security DEPARTMENT OF HOMELAND SECURITY, OFFICE OF THE SECRETARY CHEMICAL FACILITY ANTI-TERRORISM STANDARDS Chemical Facility Security Program § 27.210 Submissions schedule. (a) Initial Submission....

  10. 45 CFR 96.137 - Payment schedule.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 45 Public Welfare 1 2014-10-01 2014-10-01 false Payment schedule. 96.137 Section 96.137 Public Welfare Department of Health and Human Services GENERAL ADMINISTRATION BLOCK GRANTS Substance Abuse Prevention and Treatment Block Grant § 96.137 Payment schedule. (a) The Block Grant money that may be...

  11. 45 CFR 96.137 - Payment schedule.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Payment schedule. 96.137 Section 96.137 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION BLOCK GRANTS Substance Abuse Prevention and Treatment Block Grant § 96.137 Payment schedule. (a) The Block Grant money that may be...

  12. 45 CFR 96.137 - Payment schedule.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 45 Public Welfare 1 2013-10-01 2013-10-01 false Payment schedule. 96.137 Section 96.137 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION BLOCK GRANTS Substance Abuse Prevention and Treatment Block Grant § 96.137 Payment schedule. (a) The Block Grant money that may be...

  13. 45 CFR 96.137 - Payment schedule.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 45 Public Welfare 1 2012-10-01 2012-10-01 false Payment schedule. 96.137 Section 96.137 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION BLOCK GRANTS Substance Abuse Prevention and Treatment Block Grant § 96.137 Payment schedule. (a) The Block Grant money that may be...

  14. 45 CFR 96.137 - Payment schedule.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 45 Public Welfare 1 2011-10-01 2011-10-01 false Payment schedule. 96.137 Section 96.137 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION BLOCK GRANTS Substance Abuse Prevention and Treatment Block Grant § 96.137 Payment schedule. (a) The Block Grant money that may be...

  15. 40 CFR 52.240 - Compliance schedules.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 40 Protection of Environment 3 2013-07-01 2013-07-01 false Compliance schedules. 52.240 Section 52.240 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS California § 52.240 Compliance schedules. (a)...

  16. State Teacher Salary Schedules. Policy Analysis

    ERIC Educational Resources Information Center

    Griffith, Michael

    2016-01-01

    In the United States most teacher compensation issues are decided at the school district level. However, a group of states have chosen to play a role in teacher pay decisions by instituting statewide teacher salary schedules. Education Commission of the States has found that 17 states currently make use of teacher salary schedules. This education…

  17. 10 CFR 51.15 - Time schedules.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 10 Energy 2 2014-01-01 2014-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... proposed action or a petitioner for rulemaking shall, establish a time schedule for all or any...

  18. 10 CFR 51.15 - Time schedules.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 10 Energy 2 2013-01-01 2013-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... proposed action or a petitioner for rulemaking shall, establish a time schedule for all or any...

  19. 10 CFR 51.15 - Time schedules.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 10 Energy 2 2010-01-01 2010-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... proposed action or a petitioner for rulemaking shall, establish a time schedule for all or any...

  20. 10 CFR 51.15 - Time schedules.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 10 Energy 2 2011-01-01 2011-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... proposed action or a petitioner for rulemaking shall, establish a time schedule for all or any...

  1. 49 CFR 665.21 - Scheduling.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a manufacturer shall contact the operator of FTA's bus testing program. Contact information and procedures are available on the operator's bus testing Web site, http://www.altoonabustest.com. (b) Upon contacting...

  2. 49 CFR 665.21 - Scheduling.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a manufacturer shall contact the operator of FTA's bus testing program. Contact information and procedures are available on the operator's bus testing Web site, http://www.altoonabustest.com. (b) Upon contacting...

  3. 49 CFR 665.21 - Scheduling.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a manufacturer shall contact the operator of FTA's bus testing program. Contact information and procedures are available on the operator's bus testing Web site, http://www.altoonabustest.com. (b) Upon contacting...

  4. 49 CFR 665.21 - Scheduling.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a manufacturer shall contact the operator of FTA's bus testing program. Contact information and procedures are available on the operator's bus testing Web site, http://www.altoonabustest.com. (b) Upon contacting...

  5. 49 CFR 665.21 - Scheduling.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a manufacturer shall contact the operator of FTA's bus testing program. Contact information and procedures are available on the operator's bus testing Web site, http://www.altoonabustest.com. (b) Upon contacting...

  6. Program For Editing Graphical Displays Of Schedules

    NASA Technical Reports Server (NTRS)

    Mulnix, Cassie L.; Miller, Kevin

    1995-01-01

    XOPPS is window-based software tool from graphics providing easy and fast "what you see is what you get" (WYSIWYG) on-screen editing capabilities. Provides area, analogous to canvas, displaying full image of schedule being edited. Canvas contains header area (for test) and schedule area (for plotting graphical representations of milestone objects in flexible time line). Written in C language.

  7. Construct Validity of the OASIS Interest Schedule.

    ERIC Educational Resources Information Center

    Parker, Randall M.; Green, Donald

    1987-01-01

    Scores of 135 community college students on the Occupational Aptitude Survey and Interest Schedule (OASIS) were compared with different academic majors. A series of 18 one-way analyses of variance provided evidence for the construct validity of the OASIS Interest Schedule. (Author/GDC)

  8. 16 CFR 1203.13 - Test schedule.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 16 Commercial Practices 2 2012-01-01 2012-01-01 false Test schedule. 1203.13 Section 1203.13... STANDARD FOR BICYCLE HELMETS The Standard § 1203.13 Test schedule. (a) Helmet sample 1 of the set of eight... environments, respectively) shall be tested in accordance with the dynamic retention system strength test...

  9. Scheduling for deficit irrigation, Crop Yield Predictor

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Irrigators in many countries with dwindling water supplies face the prospect that they will not be able to fully irrigate their crops. In these cases, they still need to schedule their water applications to make the best economic use of available water. Major scheduling questions for deficit irrigat...

  10. 44 CFR 72.3 - Fee schedule.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 44 Emergency Management and Assistance 1 2011-10-01 2011-10-01 false Fee schedule. 72.3 Section 72.3 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND... PROCESSING MAP CHANGES § 72.3 Fee schedule. (a) For requests for CLOMRs, LOMRs, and PMRs based on...

  11. 44 CFR 72.3 - Fee schedule.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Fee schedule. 72.3 Section 72.3 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND... PROCESSING MAP CHANGES § 72.3 Fee schedule. (a) For requests for CLOMRs, LOMRs, and PMRs based on...

  12. 29 CFR 1952.161 - Developmental schedule.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended and provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972....

  13. 29 CFR 1952.161 - Developmental schedule.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended and provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972....

  14. 29 CFR 1952.161 - Developmental schedule.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended and provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972....

  15. 29 CFR 1952.161 - Developmental schedule.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended and provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972....

  16. 29 CFR 1952.161 - Developmental schedule.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended and provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972....

  17. 40 CFR 58.12 - Operating schedules.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ...) AMBIENT AIR QUALITY SURVEILLANCE Monitoring Network § 58.12 Operating schedules. State and local... part. Area-specific PAMS operating schedules must be included as part of the PAMS network description... for their area and that are within plus or minus 10 percent of the NAAQS; and all required sites...

  18. 40 CFR 58.12 - Operating schedules.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ...) AMBIENT AIR QUALITY SURVEILLANCE Monitoring Network § 58.12 Operating schedules. State and local... part. Area-specific PAMS operating schedules must be included as part of the PAMS network description... regulatory data needs. Required SLAMS stations whose measurements determine the design value for their...

  19. 40 CFR 58.12 - Operating schedules.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ...) AMBIENT AIR QUALITY SURVEILLANCE Monitoring Network § 58.12 Operating schedules. State and local... part. Area-specific PAMS operating schedules must be included as part of the PAMS network description... regulatory data needs. Required SLAMS stations whose measurements determine the design value for their...

  20. Evolutionary Scheduler for the Deep Space Network

    NASA Technical Reports Server (NTRS)

    Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert

    2010-01-01

    A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

  1. 47 CFR 73.850 - Operating schedule.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Operating schedule. 73.850 Section 73.850 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Low Power FM Broadcast Stations (LPFM) § 73.850 Operating schedule. (a) All LPFM stations will...

  2. 47 CFR 73.850 - Operating schedule.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Operating schedule. 73.850 Section 73.850 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Low Power FM Broadcast Stations (LPFM) § 73.850 Operating schedule. (a) All LPFM stations will...

  3. 40 CFR 52.626 - Compliance schedules.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 40 Protection of Environment 3 2013-07-01 2013-07-01 false Compliance schedules. 52.626 Section 52.626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  4. 40 CFR 52.626 - Compliance schedules.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 40 Protection of Environment 3 2014-07-01 2014-07-01 false Compliance schedules. 52.626 Section 52.626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  5. 40 CFR 52.626 - Compliance schedules.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 40 Protection of Environment 3 2012-07-01 2012-07-01 false Compliance schedules. 52.626 Section 52.626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  6. 40 CFR 52.626 - Compliance schedules.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 3 2010-07-01 2010-07-01 false Compliance schedules. 52.626 Section 52.626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  7. 40 CFR 52.626 - Compliance schedules.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 40 Protection of Environment 3 2011-07-01 2011-07-01 false Compliance schedules. 52.626 Section 52.626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  8. Creating a Complex Schedule with "REFLEX."

    ERIC Educational Resources Information Center

    Kren, George M.; Christakes, George

    1991-01-01

    Discusses "REFLEX," a software package for scheduling. Explores the program's applications in preparing a departmental class schedule. Explains that "REFLEX" includes a filter function and some attributes of a spreadsheet but lacks the ability to interact with other databases. Concludes that the program can make scheduling…

  9. 46 CFR 525.2 - Terminal schedules.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule...

  10. 46 CFR 525.2 - Terminal schedules.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule...

  11. 46 CFR 525.2 - Terminal schedules.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule...

  12. 46 CFR 525.2 - Terminal schedules.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule...

  13. Optimization of Continuous Maintenance Availability Scheduling

    DTIC Science & Technology

    2014-09-01

    CONTINUOUS MAINTENANCE AVAILABILITY SCHEDULING by Cyrus K. Anderson September 2014 Thesis Advisor: Javier Salmeron Second Reader: Michael...DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE OPTIMIZATION OF CONTINUOUS MAINTENANCE AVAILABILITY SCHEDULING 5. FUNDING NUMBERS 6. AUTHOR(S...major maintenance that cannot be conducted at sea. These maintenance periods are called Continuous Maintenance Availability (CMAV) periods. All CMAV

  14. Improved MLWDF scheduler for LTE downlink transmission

    NASA Astrophysics Data System (ADS)

    Obinna Nnamani, Christantus; Anioke, Chidera Linda; Ikechukwu Ani, Cosmas

    2016-11-01

    In long-term evolution (LTE) downlink transmission, modified least weighted delay first (MLWDF) scheduler is a quality of service (QoS) aware scheduling scheme for real-time (RT) services. Nevertheless, MLWDF performs below optimal among the trade-off between strict delay and loss restraints of RT and non-RT traffic flows, respectively. This is further worsened with the implementation of hybrid automatic retransmission request (HARQ). As these restraints grow unabated with increasing number of user demands, the performance of MLWDF further reduces. In order to ameliorate this situation, there is a need to directly incorporate the variations in user demands and HARQ implementation as parameters to the MLWDF scheduler. In this work, an improvement to the MLWDF scheduler is proposed. The improvement entails adding two novel parameters that characterise user demand and HARQ implementation. The scheduler was tested using varying three classes of service in QoS class identifiers (QCIs) table standardised by Third Generation Partnership Project for LTE network to characterise different services. It was also tested on the basis of packet prioritisation. The proposed scheduler was simulated with LTE-SIM simulator and compared with the MLWDF and proportional fairness schedulers. In terms of delay, throughput and packet loss ratio; the proposed scheduler increased overall system performance.

  15. 29 CFR 1952.361 - Developmental schedule.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS New Mexico § 1952.361 Developmental schedule. The New Mexico State Plan is developmental. The following is the developmental schedule as... Mexico Occupational Health and Safety Review Commission by January 31, 1976. (d) Enforcement program...

  16. To Block-Schedule or Not?

    ERIC Educational Resources Information Center

    Mowen, Gregg G.; Mowen, Carol

    2004-01-01

    In this article, the authors discuss the advantages of block scheduling and how it can be an effective educational tool when faced with educational challenges. Block schedules can ease the transition from the homelike atmosphere of the elementary school to the departmentalized environment of the high school by reducing the need for constant class…

  17. 14 CFR 415.121 - Launch schedule.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Launch schedule. 415.121 Section 415.121... TRANSPORTATION LICENSING LAUNCH LICENSE Safety Review and Approval for Launch of an Expendable Launch Vehicle From a Non-Federal Launch Site § 415.121 Launch schedule. An applicant's safety review document...

  18. 14 CFR 415.121 - Launch schedule.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Launch schedule. 415.121 Section 415.121... TRANSPORTATION LICENSING LAUNCH LICENSE Safety Review and Approval for Launch of an Expendable Launch Vehicle From a Non-Federal Launch Site § 415.121 Launch schedule. An applicant's safety review document...

  19. "Contingency" or "Career" Schedules for Women.

    ERIC Educational Resources Information Center

    Bernard, Jessie

    1978-01-01

    The notion of contingency scheduling for women is presented in this discussion of how women schedule their futures--marriage, child-bearing, professional training, and career development--and how colleges and universities can be more responsive to their needs. (Author/AF)

  20. A Comprehensive University Scheduling System. CUSS.

    ERIC Educational Resources Information Center

    Abell, Victor A.; And Others

    These 2 papers describe the development of a computerized class scheduling system aimed at achieving uniform and efficient utilization of staff and physical facilities and a schedule that permits the maximum number of students to fulfill their curricular requirements. In "An Introduction to CUSS," Victor Abell describes the development…

  1. 40 CFR 52.1482 - Compliance schedules.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 4 2010-07-01 2010-07-01 false Compliance schedules. 52.1482 Section 52.1482 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Nevada § 52.1482 Compliance schedules....

  2. 40 CFR 52.1482 - Compliance schedules.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 40 Protection of Environment 4 2014-07-01 2014-07-01 false Compliance schedules. 52.1482 Section 52.1482 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Nevada § 52.1482 Compliance schedules....

  3. 40 CFR 52.1482 - Compliance schedules.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 40 Protection of Environment 4 2013-07-01 2013-07-01 false Compliance schedules. 52.1482 Section 52.1482 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Nevada § 52.1482 Compliance schedules....

  4. 40 CFR 52.1482 - Compliance schedules.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 40 Protection of Environment 4 2011-07-01 2011-07-01 false Compliance schedules. 52.1482 Section 52.1482 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Nevada § 52.1482 Compliance schedules....

  5. A Strategic Airlift Pilot Scheduling Technique Utilizing Statistical Analysis.

    DTIC Science & Technology

    1980-06-01

    33 Wild Card Schedule .................... 34 Summary .................................... 37 III. METHODOLOGY...Generation Cargo scheduling system was created. This sys- tem was centered on stabilizing the mission requirements. Second, the Wild Card Scheduling system...demonstrated improvement in crew return rates forced the early termination to this approach in stabil- izing the aircrew schedule. WILD CARD SCHEDULE

  6. NASA Instrument Cost/Schedule Model

    NASA Technical Reports Server (NTRS)

    Habib-Agahi, Hamid; Mrozinski, Joe; Fox, George

    2011-01-01

    NASA's Office of Independent Program and Cost Evaluation (IPCE) has established a number of initiatives to improve its cost and schedule estimating capabilities. 12One of these initiatives has resulted in the JPL developed NASA Instrument Cost Model. NICM is a cost and schedule estimator that contains: A system level cost estimation tool; a subsystem level cost estimation tool; a database of cost and technical parameters of over 140 previously flown remote sensing and in-situ instruments; a schedule estimator; a set of rules to estimate cost and schedule by life cycle phases (B/C/D); and a novel tool for developing joint probability distributions for cost and schedule risk (Joint Confidence Level (JCL)). This paper describes the development and use of NICM, including the data normalization processes, data mining methods (cluster analysis, principal components analysis, regression analysis and bootstrap cross validation), the estimating equations themselves and a demonstration of the NICM tool suite.

  7. Human choice under schedules of negative reinforcement.

    PubMed

    Alessandri, Jérôme; Cançado, Carlos R X

    2015-12-01

    The generalized matching equation provides a good description of response allocation in concurrent schedules of positive reinforcement in nonhumans as well as in humans. The present experiment was conducted to further investigate the allocation of responding under concurrent schedules of negative reinforcement (i.e., timeouts from pressing a force cell) in humans. Each of three participants was exposed to different reinforcement ratios (9:1, 1:1 and 1:9) in the terminal links of a concurrent-chains schedule of negative reinforcement. The allocation of responding under this schedule was well described by the generalized matching equation, for each participant. These results replicate previous findings obtained with nonhumans and humans under concurrent schedules of positive reinforcement. In addition, they extend the results reported by Alessandri and Rivière (2013) showing that human behavior maintained by timeouts from an effortful response is sensitive to changes in relative reinforcement ratios as well as relative delays of reinforcement.

  8. Routine Operational Environmental Monitoring schedule, CY 1994

    SciTech Connect

    Schmidt, J.W.

    1993-12-01

    This document provides Health Physics (HP) a schedule in accordance with the Environmental Compliance Manual, WHC-CM-7-5, of monitoring and sampling routines for the Operational Environmental Monitoring (OEM) Program during calendar year (CY) 1994. The survey frequencies for particular sites are determined by the technical judgment of EES and may depend on the site history, radiological status, use, and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive waste sites are scheduled to be surveyed annually at a minimum. Any newly discovered waste sites not documented by this schedule will be included in the revised schedule for CY 1995. This schedule does not discuss the manpower needs nor does it list the monitoring equipment to be used in completing specific routines.

  9. 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.

  10. Effects of reinforcer quality and step size on rats' performance under progressive ratio schedules.

    PubMed

    Covarrubias, Pablo; Aparicio, Carlos F

    2008-06-01

    The Mathematical Principles of Reinforcement (MPR) model accurately predicts performance in fixed ratio (FR) schedules of reinforcement. The aim of the present study was to assess the generality of MPR with rats responding under progressive ratio (PR) schedules of different step sizes (PR1 or PR3) that provided either food or saccharin pellets. The results showed that the rats responding for saccharin pellets produced higher breakpoints (i.e., completed higher ratios) than those responding for food pellets. In terms of theoretical parameters, one finding unanticipated on the basis of MPR was that the a parameter (specific activation) was higher for the PR3 schedules. This finding suggests that specific activation may be affected indirectly by motor parameters of the task.

  11. The Consolidated Planning and Scheduling System for Space Transportation and Space Station operations - Successful development experience

    NASA Technical Reports Server (NTRS)

    Hornstein, Rhoda S.; Willoughby, John K.; Gardner, Jo A.; Shinkle, Gerald L.

    1993-01-01

    In 1992, NASA made the decision to evolve a Consolidated Planning System (CPS) by adding the Space Transportation System (STS) requirements to the Space Station Freedom (SSF) planning software. This paper describes this evolutionary process, which began with a series of six-month design-build-test cycles, using a domain-independent architecture and a set of developmental tools known as the Advanced Scheduling Environment. It is shown that, during these tests, the CPS could be used at multiple organizational levels of planning and for integrating schedules from geographically distributed (including international) planning environments. The potential for using the CPS for other planning and scheduling tasks in the SSF program is being currently examined.

  12. Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

    SciTech Connect

    Flory, John Andrew; Padilla, Denise D.; Gauthier, John H.; Zwerneman, April Marie; Miller, Steven P

    2016-05-01

    Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

  13. Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks

    NASA Astrophysics Data System (ADS)

    Alam, Muhammad Mahbub; Hamid, Md. Abdul; Razzaque, Md. Abdur; Hong, Choong Seon

    Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.

  14. Data analysis tasks: BATSE

    NASA Technical Reports Server (NTRS)

    Paciesas, William S.

    1993-01-01

    Miscellaneous tasks related to the operation of, and analysis of data from, the Burst and Transient Experiment (BATSE) on the Compton Gamma Ray Observatory (CGRO) were performed. The results are summarized and relevant references are included.

  15. NRC comprehensive records disposition schedule. Revision 3

    SciTech Connect

    1998-02-01

    Title 44 US Code, ``Public Printing and Documents,`` regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ``Management and Use of Information and Records,`` and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ``Records Management,`` require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA`s General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ``NRC`s Comprehensive Records Disposition Schedule,`` and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA`s General Records Schedule (dated August 1995).

  16. Mission Operations Planning and Scheduling System (MOPSS)

    NASA Technical Reports Server (NTRS)

    Wood, Terri; Hempel, Paul

    2011-01-01

    MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

  17. Observing of chain-schedule stimuli.

    PubMed

    Slezak, Jonathan M; Anderson, Karen G

    2014-06-01

    A classical-conditioning account of the processes maintaining behavior under chained schedules entails a backward transmission of conditioned-reinforcement effects. Assessing this process in traditional chain schedules is limited because the response maintained by stimulus onset accompanied by each link in a chain schedule may also be maintained by the primary reinforcer. In the present experiment, an observing response was used to measure the conditioned-reinforcing effects of stimuli associated with a three-link chain variable-time (VT) food schedule, and resistance-to-change tests (extinction and prefeeding) were implemented to examine if a backward transmission of reinforcement effects occur. Four pigeons served as subjects. Observing was maintained by the production of stimuli correlated with links of a three-link chain VT schedule with the middle-link stimulus maintaining the highest rate of observing, followed by the initial-link stimulus and the terminal-link stimulus maintaining the lowest observing rate. Results from resistance-to-change tests of extinction and prefeeding were not supportive of a backward transmission of reinforcement effects and in general, the pattern of resistance-to-change was forward. Based on past and current research, it appears that a backward pattern of relative rate decreases in responses maintained by stimuli correlated with a chain schedule due to disruption (i.e., extinction and prefeeding) is not a ubiquitous process that is evident within different chain-schedule arrangements.

  18. Task and work performance on Skylab missions 2, 3, and 4: Time and motion study: Experiment M151

    NASA Technical Reports Server (NTRS)

    Kubis, J. F.; Mclaughlin, E. J.; Jackson, J. M.; Rusnak, R.; Mcbride, G. H.; Saxon, S. V.

    1977-01-01

    Human task performance was evaluated under weightlessness conditions during long duration space flight in order to study the characteristics of the adaptation function. Results show that despite pronounced variability in training schedules and in initial reaction to the Skylab environment, in-flight task performance was relatively equivalent among Skylab crews, and behavioral performance continued to improve from beginning to end of all missions.

  19. Data Systems Task Analysis.

    DTIC Science & Technology

    1979-08-01

    A08873 MARINE CORPS WASHINGTON DC F/B 5/9 DATA SYSTEMS TASK ANALYSIS. (U) "CLASSIFIEO. -%mm . LEVELIs DATA SYSTEMS O0 TASK ANALYSIS DCI) OO JF AUG 28...TECI-NICIAN jl. CCMPUTER SYSTEMS EVALLATOR ,13. LCMPUTER SYSTEMS MANAGER 314. LCMPUTER SYSTEMS MCNITOR A5o LCMPUTER TERMINAL OPERATOR j16. LCNFIGURATION...OPERATOR )27. DATA PROCESSING NCO )28. DATA PROCESSINIG TECHNICIAN 329e DATA SYSTEMS LIBRARIAN )35* DATA SYSTEMS OPERATICNS Cl-IEF 331. DATA SYSTEMS

  20. Response Surface Mapping of Neurobehavioral Performance: Testing the Feasibility of Split Sleep Schedules for Space Operations.

    PubMed

    Mollicone, Daniel J; Van Dongen, Hans P A; Rogers, Naomi L; Dinges, David F

    2008-01-01

    The demands of sustaining high levels of neurobehavioral performance during space operations necessitate precise scheduling of sleep opportunities in order to best preserve optimal performance. We report here the results of the first split-sleep, dose-response experiment involving a range of sleep/wake scenarios with chronically reduced nocturnal sleep, augmented with a diurnal nap. To characterize performance over all combinations of split sleep in the range studied, we used response surface mapping methodology. Waking neurobehavioral performance was studied in N=90 subjects each assigned to one of 18 sleep regimens consisting of a restricted nocturnal anchor sleep period and a diurnal nap. Psychomotor vigilance task performance and subjective assessments of sleepiness were found to be primarily a function of total time in bed per 24 h regardless of how sleep was divided among nocturnal anchor sleep and diurnal nap periods. Digit symbol substitution task performance was also found to be primarily a function of total time in bed per 24 h; however, accounting for nocturnal sleep duration and nap duration separately provided a small but significant enhancement in the variance explained. The results suggest that reductions in total daily sleep result in a near-linear accumulation of impairment regardless of whether sleep is scheduled as a consolidated nocturnal sleep period or split into a nocturnal anchor sleep period and a diurnal nap. Thus, split sleep schedules are feasible and can be used to enhance the flexibility of sleep/work schedules for space operations involving restricted nocturnal sleep due to mission-critical task scheduling. These results are generally applicable to any continuous industrial operation that involves sleep restriction, night operations, and shift work.