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.
1993 Wholesale Power and Transmission Rate Schedules.
DOE Office of Scientific and Technical Information (OSTI.GOV)
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.
Wave scheduling - Decentralized scheduling of task forces in multicomputers
NASA Technical Reports Server (NTRS)
Van Tilborg, A. M.; Wittie, L. D.
1984-01-01
Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave scheduling is highly resistant to processing element failures because it uses many distributed schedulers that dynamically assign scheduling responsibilities among themselves. The scheduling technique is trivially extensible as more processing elements join the host multicomputer. A simple model of scheduling cost is used by every scheduler node to distribute scheduling activity and minimize wasted processing capacity by using perceived workload to vary decentralized scheduling rules. At low to moderate levels of network activity, wave scheduling is only slightly less efficient than a central scheduler in its ability to direct processing elements to accomplish useful work.
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-23
... 1120S, Schedule D, Schedule K-1, and Schedule M-3 AGENCY: Internal Revenue Service (IRS), Treasury... (Loss) Reconciliation for S Corporations With Total Assets of $10 Million or More, and Schedule K-1... Corporation, Schedule D (Form 1120S), Capital Gains and Losses and Built-in Gains, Schedule K-1 (Form 1120S...
Interference Cognizant Network Scheduling
NASA Technical Reports Server (NTRS)
Hall, Brendan (Inventor); Bonk, Ted (Inventor); DeLay, Benjamin F. (Inventor); Varadarajan, Srivatsan (Inventor); Smithgall, William Todd (Inventor)
2017-01-01
Systems and methods for interference cognizant network scheduling are provided. In certain embodiments, a method of scheduling communications in a network comprises identifying a bin of a global timeline for scheduling an unscheduled virtual link, wherein a bin is a segment of the timeline; identifying a pre-scheduled virtual link in the bin; and determining if the pre-scheduled and unscheduled virtual links share a port. In certain embodiments, if the unscheduled and pre-scheduled virtual links don't share a port, scheduling transmission of the unscheduled virtual link to overlap with the scheduled transmission of the pre-scheduled virtual link; and if the unscheduled and pre-scheduled virtual links share a port: determining a start time delay for the unscheduled virtual link based on the port; and scheduling transmission of the unscheduled virtual link in the bin based on the start time delay to overlap part of the scheduled transmission of the pre-scheduled virtual link.
Federal Register 2010, 2011, 2012, 2013, 2014
2010-07-22
... Income, Credits, Deductions and Other Items), Schedule L (Balance Sheets per Books), Schedule M-1..., Deductions, etc. (Schedule K-1), Balance Sheets per Books (Schedule L), Reconciliation of Income (Loss) per...
Foster, T A; Hackenberg, T D; Vaidya, M
2001-09-01
Pigeons' key pecks produced food under second-order schedules of token reinforcement, with light-emitting diodes serving as token reinforcers. In Experiment 1, tokens were earned according to a fixed-ratio 50 schedule and were exchanged for food according to either fixed-ratio or variable-ratio exchange schedules, with schedule type varied across conditions. In Experiment 2, schedule type was varied within sessions using a multiple schedule. In one component, tokens were earned according to a fixed-ratio 50 schedule and exchanged according to a variable-ratio schedule. In the other component, tokens were earned according to a variable-ratio 50 schedule and exchanged according to a fixed-ratio schedule. In both experiments, the number of responses per exchange was varied parametrically across conditions, ranging from 50 to 400 responses. Response rates decreased systematically with increases in the fixed-ratio exchange schedules, but were much less affected by changes in the variable-ratio exchange schedules. Response rates were consistently higher under variable-ratio exchange schedules than tinder comparable fixed-ratio exchange schedules, especially at higher exchange ratios. These response-rate differences were due both to greater pre-ratio pausing and to lower local rates tinder the fixed-ratio exchange schedules. Local response rates increased with proximity to food under the higher fixed-ratio exchange schedules, indicative of discriminative control by the tokens.
A heuristic approach to incremental and reactive scheduling
NASA Technical Reports Server (NTRS)
Odubiyi, Jide B.; Zoch, David R.
1989-01-01
An heuristic approach to incremental and reactive scheduling is described. Incremental scheduling is the process of modifying an existing schedule if the initial schedule does not meet its stated initial goals. Reactive scheduling occurs in near real-time in response to changes in available resources or the occurrence of targets of opportunity. Only minor changes are made during both incremental and reactive scheduling because a goal of re-scheduling procedures is to minimally impact the schedule. The described heuristic search techniques, which are employed by the Request Oriented Scheduling Engine (ROSE), a prototype generic scheduler, efficiently approximate the cost of reaching a goal from a given state and effective mechanisms for controlling search.
Genetic algorithm to solve the problems of lectures and practicums scheduling
NASA Astrophysics Data System (ADS)
Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.
2018-02-01
Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.
Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration
NASA Technical Reports Server (NTRS)
Zelinski, Shannon; Windhorst, Robert
2016-01-01
A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.
Student Scheduling Choices and Time to Completion of a Two-Year Credential
ERIC Educational Resources Information Center
Rzeznik, Mark A.
2017-01-01
All students need to decide how to schedule their classes to complete their credential. This study examined three types of student scheduling choices: full-block scheduling, partial-block scheduling, and traditional scheduling to address two research questions: How do the choices students make in scheduling classes-using three scheduling…
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. © Society for the Experimental Analysis of Behavior.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-08-02
... 941, 941-PR, 941- SS, 941-X, 941-X(PR), Schedule B (Form 941), Schedule R (Form 941)and Schedule B... Islands), 941-X, Adjusted Employer's Quarterly Federal Tax Return or Claim for Refund, 941-X(PR), Schedule...: 941, 941-PR, 941-SS, 941-X, 941-X(PR), Schedule R (Form 941), Schedule B (Form 941), and Schedule B...
Automated Scheduling of Personnel to Staff Operations for the Mars Science Laboratory
NASA Technical Reports Server (NTRS)
Knight, Russell; Mishkin, Andrew; Allbaugh, Alicia
2014-01-01
Leveraging previous work on scheduling personnel for space mission operations, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] to the domain of scheduling personnel for operations of the Mars Science Laboratory. Automated scheduling of personnel is not new. We compare our representations to a sampling of employee scheduling systems available with respect to desired features. We described the constraints required by MSL personnel schedulers and how each is handled by the scheduling algorithm.
Kullberg, Anna; Bergenmar, Mia; Sharp, Lena
2016-05-01
To evaluate fixed scheduling compared with self-scheduling for nursing staff in oncological inpatient care with regard to patient and staff outcomes. Various scheduling models have been tested to attract and retain nursing staff. Little is known about how these schedules affect staff and patients. Fixed scheduling and self-scheduling have been studied to a small extent, solely from a staff perspective. We implemented fixed scheduling on two of four oncological inpatient wards. Two wards kept self-scheduling. Through a quasi-experimental design, baseline and follow-up measurements were collected among staff and patients. The Safety Attitudes Questionnaire was used among staff, as well as study-specific questions for patients and staff. Fixed scheduling was associated with less overtime and fewer possibilities to change shifts. Self-scheduling was associated with more requests from management for short notice shift changes. The type of scheduling did not affect patient-reported outcomes. Fixed scheduling should be considered in order to lower overtime. Further research is necessary and should explore patient outcomes to a greater extent. Scheduling is a core task for nurse managers. Our study suggests fixed scheduling as a strategy for managers to improve the effective use of resources and safety. © 2016 John Wiley & Sons Ltd.
Technology for planning and scheduling under complex constraints
NASA Astrophysics Data System (ADS)
Alguire, Karen M.; Pedro Gomes, Carla O.
1997-02-01
Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.
Network Control Center User Planning System (NCC UPS)
NASA Astrophysics Data System (ADS)
Dealy, Brian
1991-09-01
NCC UPS is presented in the form of the viewgraphs. The following subject areas are covered: UPS overview; NCC UPS role; major NCC UPS functional requirements; interactive user access levels; UPS interfaces; interactive user subsystem; interface navigation; scheduling screen hierarchy; interactive scheduling input panels; autogenerated schedule request panel; schedule data tabular display panel; schedule data graphic display panel; graphic scheduling aid design; and schedule data graphic display.
Network Control Center User Planning System (NCC UPS)
NASA Technical Reports Server (NTRS)
Dealy, Brian
1991-01-01
NCC UPS is presented in the form of the viewgraphs. The following subject areas are covered: UPS overview; NCC UPS role; major NCC UPS functional requirements; interactive user access levels; UPS interfaces; interactive user subsystem; interface navigation; scheduling screen hierarchy; interactive scheduling input panels; autogenerated schedule request panel; schedule data tabular display panel; schedule data graphic display panel; graphic scheduling aid design; and schedule data graphic display.
Automation Improves Schedule Quality and Increases Scheduling Efficiency for Residents.
Perelstein, Elizabeth; Rose, Ariella; Hong, Young-Chae; Cohn, Amy; Long, Micah T
2016-02-01
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. To determine whether computerized decision support can improve the construction of residency schedules, saving time and improving schedule quality. 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. 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). 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.
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.
Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support
NASA Technical Reports Server (NTRS)
Richards, Stephen F.
1992-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.
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…
NASA Astrophysics Data System (ADS)
Buchner, Johannes
2011-12-01
Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the literature: The inability of a GA to properly improve schedules and the generation of schedules with frequent interruptions. Finally, we demonstrate the scheduling framework for several operating telescopes: (1) Dynamic re-scheduling with the AUT Warkworth 12m telescope, (2) Scheduling for the Australian Mopra 22m telescope and scheduling for the Allen Telescope Array. Furthermore, we discuss the applicability of the presented scheduling framework to the Atacama Large Millimeter/submillimeter Array (ALMA, in construction) and the SKA. In particular, during the development phase of the SKA, this dynamic, scalable scheduling framework can accommodate changing conditions.
Peters, Velibor; Houkes, Inge; de Rijk, Angelique E; Bohle, Philip L; Engels, Josephine A; Nijhuis, Frans J N
2016-06-01
Shiftwork is a major job demand for nurses and has been related to various negative consequences. Research suggests that personal and job resources moderate the impact of work schedules on stress, health and well-being. This longitudinal study examined whether the interactions of personal and job resources with work schedule demands predicted work engagement and emotional exhaustion in nursing. This longitudinal study included two waves of data collection with a one year follow-up using self-report questionnaires among 247 nurses working shifts or irregular working hours in residential care for the elderly in the Netherlands. Moderated structural equation modelling was conducted to examine the interactions between personal and job resources and work schedule demands. Two work schedule demands were assessed: type of work schedule (demanding vs. less demanding) and average weekly working hours. Two personal resources, active coping and healthy lifestyle, and two job resources, work schedule control and the work schedule fit with nurses' private life, were assessed. Results showed that the work schedule fit with nurses' private life buffered the relationship between work schedule demands and emotional exhaustion one year later. Furthermore, the work schedule fit with nurses' private life increased work engagement one year later when work schedule demands were high. Work schedule control strengthened the positive relationship between work schedule demands and emotional exhaustion one year later. The personal resources, active coping and healthy lifestyle were no moderators in this model. Nurses suffer less from decreasing work engagement and emotional exhaustion due to work schedule demands when their work schedules fit with their private lives. Work schedule control did not buffer, but strengthened the positive relationship between weekly working hours and emotional exhaustion one year later. Job resources appeared to be more important for nurses' well-being than personal resources. These findings highlight the importance of the fit of a work schedule with nurse's private life, if the work schedule is demanding. Copyright © 2016. Published by Elsevier Ltd.
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).
Generically Used Expert Scheduling System (GUESS): User's Guide Version 1.0
NASA Technical Reports Server (NTRS)
Liebowitz, Jay; Krishnamurthy, Vijaya; Rodens, Ira
1996-01-01
This user's guide contains instructions explaining how to best operate the program GUESS, a generic expert scheduling system. GUESS incorporates several important features for a generic scheduler, including automatic scheduling routines to generate a 'first' schedule for the user, a user interface that includes Gantt charts and enables the human scheduler to manipulate schedules manually, diagnostic report generators, and a variety of scheduling techniques. The current version of GUESS runs on an IBM PC or compatible in the Windows 3.1 or Windows '95 environment.
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.
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.
Scheduling lessons learned from the Autonomous Power System
NASA Technical Reports Server (NTRS)
Ringer, Mark J.
1992-01-01
The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.
Human's choices in situations of time-based diminishing returns.
Hackenberg, T D; Axtell, S A
1993-01-01
Three experiments examined adult humans' choices in situations with contrasting short-term and long-term consequences. Subjects were given repeated choices between two time-based schedules of points exchangeable for money: a fixed schedule and a progressive schedule that began at 0 s and increased by 5 s with each point delivered by that schedule. Under "reset" conditions, choosing the fixed schedule not only produced a point but it also reset the requirements of the progressive schedule to 0 s. In the first two experiments, reset conditions alternated with "no-reset" conditions, in which progressive-schedule requirements were independent of fixed-schedule choices. Experiment 1 entailed choices between a progressive-interval schedule and a fixed-interval schedule, the duration of which varied across conditions. Switching from the progressive- to the fixed-interval schedule was systematically related to fixed-interval size in 4 of 8 subjects, and in all subjects occurred consistently sooner in the progressive-schedule sequence under reset than under no-reset procedures. The latter result was replicated in a second experiment, in which choices between progressive- and fixed-interval schedules were compared with choices between progressive- and fixed-time schedules. In Experiment 3, switching patterns under reset conditions were unrelated to variations in intertrial interval. In none of the experiments did orderly choice patterns depend on verbal descriptions of the contingencies or on schedule-controlled response patterns in the presence of the chosen schedules. The overall pattern of results indicates control of choices by temporarily remote consequences, and is consistent with versions of optimality theory that address performance in situations of diminishing returns. PMID:8315364
An Expert System for Aviation Squadron Flight Scheduling
1991-09-01
SCHEDULING A. OVERVIEW A flight schedule is an organization’s plan to accomplish specific missions with its available resources. It details the mission...schedule for every 24 hour period, and will occasionally write a weekly flight schedule for long range planning purposes. The flight schedule is approved...requirements, and 11 aircraft, trainer, and aircrew availability to formulate the flight schedule. It basically is a plan to optimize the squadron’s resources
Space communications scheduler: A rule-based approach to adaptive deadline scheduling
NASA Technical Reports Server (NTRS)
Straguzzi, Nicholas
1990-01-01
Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.
Research on Production Scheduling System with Bottleneck Based on Multi-agent
NASA Astrophysics Data System (ADS)
Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke
Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.
Hackenberg, T D; Hineline, P N
1992-01-01
Pigeons chose between two schedules of food presentation, a fixed-interval schedule and a progressive-interval schedule that began at 0 s and increased by 20 s with each food delivery provided by that schedule. Choosing one schedule disabled the alternate schedule and stimuli until the requirements of the chosen schedule were satisfied, at which point both schedules were again made available. Fixed-interval duration remained constant within individual sessions but varied across conditions. Under reset conditions, completing the fixed-interval schedule not only produced food but also reset the progressive interval to its minimum. Blocks of sessions under the reset procedure were interspersed with sessions under a no-reset procedure, in which the progressive schedule value increased independent of fixed-interval choices. Median points of switching from the progressive to the fixed schedule varied systematically with fixed-interval value, and were consistently lower during reset than during no-reset conditions. Under the latter, each subject's choices of the progressive-interval schedule persisted beyond the point at which its requirements equaled those of the fixed-interval schedule at all but the highest fixed-interval value. Under the reset procedure, switching occurred at or prior to that equality point. These results qualitatively confirm molar analyses of schedule preference and some versions of optimality theory, but they are more adequately characterized by a model of schedule preference based on the cumulated values of multiple reinforcers, weighted in inverse proportion to the delay between the choice and each successive reinforcer. PMID:1548449
Constraint-based integration of planning and scheduling for space-based observatory management
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Steven F.
1994-01-01
Progress toward the development of effective, practical solutions to space-based observatory scheduling problems within the HSTS scheduling framework is reported. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) short-term observation scheduling problem. The work was motivated by the limitations of the current solution and, more generally, by the insufficiency of classical planning and scheduling approaches in this problem context. HSTS has subsequently been used to develop improved heuristic solution techniques in related scheduling domains and is currently being applied to develop a scheduling tool for the upcoming Submillimeter Wave Astronomy Satellite (SWAS) mission. The salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research are summarized. Then, some key problem decomposition techniques underlying the integrated planning and scheduling approach to the HST problem are described; research results indicate that these techniques provide leverage in solving space-based observatory scheduling problems. Finally, more recently developed constraint-posting scheduling procedures and the current SWAS application focus are summarized.
Perceptions of randomized security schedules.
Scurich, Nicholas; John, Richard S
2014-04-01
Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed. © 2013 Society for Risk Analysis.
NASA Astrophysics Data System (ADS)
Li, Guoliang; Xing, Lining; Chen, Yingwu
2017-11-01
The autonomicity of self-scheduling on Earth observation satellite and the increasing scale of satellite network attract much attention from researchers in the last decades. In reality, the limited onboard computational resource presents challenge for the online scheduling algorithm. This study considered online scheduling problem for a single autonomous Earth observation satellite within satellite network environment. It especially addressed that the urgent tasks arrive stochastically during the scheduling horizon. We described the problem and proposed a hybrid online scheduling mechanism with revision and progressive techniques to solve this problem. The mechanism includes two decision policies, a when-to-schedule policy combining periodic scheduling and critical cumulative number-based event-driven rescheduling, and a how-to-schedule policy combining progressive and revision approaches to accommodate two categories of task: normal tasks and urgent tasks. Thus, we developed two heuristic (re)scheduling algorithms and compared them with other generally used techniques. Computational experiments indicated that the into-scheduling percentage of urgent tasks in the proposed mechanism is much higher than that in periodic scheduling mechanism, and the specific performance is highly dependent on some mechanism-relevant and task-relevant factors. For the online scheduling, the modified weighted shortest imaging time first and dynamic profit system benefit heuristics outperformed the others on total profit and the percentage of successfully scheduled urgent tasks.
MacDonall, James S
2017-09-01
Some have reported changing the schedule at one alternative of a concurrent schedule changed responding at the other alternative (Catania, 1969), which seems odd because no contingencies were changed there. When concurrent schedules are programmed using two schedules, one associated with each alternative that operate continuously, changing the schedule at one alternative also changes the switch schedule at the other alternative. Thus, changes in responding at the constant alternative could be due to the change in the switch schedule. To assess this possibility, six rats were exposed to a series of conditions that alternated between pairs of interval schedules at both alternatives and a pair of interval schedules at one, constant, alternative and a pair of extinction schedules at the other alternative. Comparing run lengths, visit durations and response rates at the constant alternative in the alternating conditions did not show consistent increases and decreases when a strict criterion for changes was used. Using a less stringent definition (any change in mean values) showed changes. The stay/switch analysis suggests it may be inaccurate to apply behavioral contrast to procedures that change from concurrent variable-interval variable-interval schedules to concurrent variable-interval extinction schedules because the contingencies in neither alternative are constant. © 2017 Society for the Experimental Analysis of Behavior.
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.
Transit scheduling: Basic and advanced manuals. Final report
DOE Office of Scientific and Technical Information (OSTI.GOV)
Pine, R.; Niemeyer, J.; Chisholm, R.
1998-12-01
This manual will be of interest to new transit schedulers, experienced schedulers, transit planners, operating staff, and others who need to be conversant with the scheduling process. The materials clearly describe all steps in the bus and light rail scheduling process, under TCRP Project A-11, Transit Scheduling: A Manual with Materials, research was undertaken by Transportation Management and Design of Solana Beach, California, to prepare a transit scheduling manual that incorporates modern training techniques for bus and light rail transit scheduling. The manual consists of two sections: a basic treatment and an advanced section. The basic-level section is in anmore » instructional format designed primarily for novice schedulers and other transit staff. The advance section covers more complex scheduling requirements. Each section may be used sequentially or independently and is designed to integrate with agency apprenticeship and on-the-job training.« less
Achieving reutilization of scheduling software through abstraction and generalization
NASA Technical Reports Server (NTRS)
Wilkinson, George J.; Monteleone, Richard A.; Weinstein, Stuart M.; Mohler, Michael G.; Zoch, David R.; Tong, G. Michael
1995-01-01
Reutilization of software is a difficult goal to achieve particularly in complex environments that require advanced software systems. The Request-Oriented Scheduling Engine (ROSE) was developed to create a reusable scheduling system for the diverse scheduling needs of the National Aeronautics and Space Administration (NASA). ROSE is a data-driven scheduler that accepts inputs such as user activities, available resources, timing contraints, and user-defined events, and then produces a conflict-free schedule. To support reutilization, ROSE is designed to be flexible, extensible, and portable. With these design features, applying ROSE to a new scheduling application does not require changing the core scheduling engine, even if the new application requires significantly larger or smaller data sets, customized scheduling algorithms, or software portability. This paper includes a ROSE scheduling system description emphasizing its general-purpose features, reutilization techniques, and tasks for which ROSE reuse provided a low-risk solution with significant cost savings and reduced software development time.
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.
It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management
ERIC Educational Resources Information Center
Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin
2008-01-01
Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…
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 [Dollars in thousands] () Greyhound Lines, Inc...
49 CFR Schedule C to Subpart B of... - Schedule C 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 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 [Dollars in thousands] () Greyhound Lines, Inc...
49 CFR Schedule C to Subpart B of... - Schedule C 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 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 [Dollars in thousands] () Greyhound Lines, Inc...
Power-based Shift Schedule for Pure Electric Vehicle with a Two-speed Automatic Transmission
NASA Astrophysics Data System (ADS)
Wang, Jiaqi; Liu, Yanfang; Liu, Qiang; Xu, Xiangyang
2016-11-01
This paper introduces a comprehensive shift schedule for a two-speed automatic transmission of pure electric vehicle. Considering about driving ability and efficiency performance of electric vehicles, the power-based shift schedule is proposed with three principles. This comprehensive shift schedule regards the vehicle current speed and motor load power as input parameters to satisfy the vehicle driving power demand with lowest energy consumption. A simulation model has been established to verify the dynamic and economic performance of comprehensive shift schedule. Compared with traditional dynamic and economic shift schedules, simulation results indicate that the power-based shift schedule is superior to traditional shift schedules.
Complex ambulatory settings demand scheduling systems.
Ross, K M
1998-01-01
Practice management systems are becoming more and more complex, as they are asked to integrate all aspects of patient and resource management. Although patient scheduling is a standard expectation in any ambulatory environment, facilities and equipment resource scheduling are additional functionalities of scheduling systems. Because these functions were not typically managed in manual patient scheduling, often the result was resource mismanagement, along with a potential negative impact on utilization, patient flow and provider productivity. As ambulatory organizations have become more seasoned users of practice management software, the value of resource scheduling has become apparent. Appointment scheduling within a fully integrated practice management system is recognized as an enhancement of scheduling itself and provides additional tools to manage other information needs. Scheduling, as one component of patient information management, provides additional tools in these areas.
46 CFR 525.2 - Terminal schedules.
Code of Federal Regulations, 2011 CFR
2011-10-01
... scrap, new assembled motor vehicles, waste paper and paper waste in terminal schedules. (2) Marine... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR SCHEDULES § 525.2 Terminal schedules. (a) Marine terminal operator schedules. A marine terminal operator, at...
46 CFR 525.2 - Terminal schedules.
Code of Federal Regulations, 2010 CFR
2010-10-01
... scrap, new assembled motor vehicles, waste paper and paper waste in terminal schedules. (2) Marine... MARITIME COMMISSION REGULATIONS AFFECTING OCEAN SHIPPING IN FOREIGN COMMERCE MARINE TERMINAL OPERATOR SCHEDULES § 525.2 Terminal schedules. (a) Marine terminal operator schedules. A marine terminal operator, at...
15 CFR 30.61 - Statistical classification schedules.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 15 Commerce and Foreign Trade 1 2011-01-01 2011-01-01 false Statistical classification schedules... § 30.61 Statistical classification schedules. The following statistical classification schedules are....census.gov/trade. (a) Schedule B—Statistical Classification for Domestic and Foreign Commodities Exported...
15 CFR 30.61 - Statistical classification schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 15 Commerce and Foreign Trade 1 2010-01-01 2010-01-01 false Statistical classification schedules... § 30.61 Statistical classification schedules. The following statistical classification schedules are....census.gov/trade. (a) Schedule B—Statistical Classification for Domestic and Foreign Commodities Exported...
Filling the Holes: Work Schedulers as Job Crafters of Employment Practice in Long-Term Health Care
Kossek, Ellen Ernst; Piszczek, Matthew M.; Mcalpine, Kristie L.; Hammer, Leslie B.; Burke, Lisa
2016-01-01
Although work schedulers serve an organizational role influencing decisions about balancing conflicting stakeholder interests over schedules and staffing, scheduling has primarily been described as an objective activity or individual job characteristic. The authors use the lens of job crafting to examine how schedulers in 26 health care facilities enact their roles as they “fill holes” to schedule workers. Qualitative analysis of interview data suggests that schedulers expand their formal scope and influence to meet their interpretations of how to manage stakeholders (employers, workers, and patients). The authors analyze variations in the extent of job crafting (cognitive, physical, relational) to broaden role repertoires. They find evidence that some schedulers engage in rule-bound interpretation to avoid role expansion. They also identify four types of schedulers: enforcers, patient-focused schedulers, employee-focused schedulers, and balancers. The article adds to the job-crafting literature by showing that job crafting is conducted not only to create meaningful work but also to manage conflicting demands and to mediate among the competing labor interests of workers, clients, and employers. PMID:27721517
Conception of Self-Construction Production Scheduling System
NASA Astrophysics Data System (ADS)
Xue, Hai; Zhang, Xuerui; Shimizu, Yasuhiro; Fujimura, Shigeru
With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for the interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce scheduling system without a lot of expense for customization. In this paper, at first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it.
Gain scheduling - Potential hazards and possible remedies
NASA Technical Reports Server (NTRS)
Shamma, Jeff S.; Athans, Michael
1991-01-01
A common gain scheduling rule-of-thumb is to schedule on a slow variable. In this work, it is shown how current gain scheduling practice is necessarily limited to slow variations in the scheduling variable. These limitations are revealed to be consequences of fundamental control concepts. Furthermore, it is shown how a formulation of the gain scheduling procedure can lead toward ultimately removing these restrictions.
Scheduling: A guide for program managers
NASA Technical Reports Server (NTRS)
1994-01-01
The following topics are discussed concerning scheduling: (1) milestone scheduling; (2) network scheduling; (3) program evaluation and review technique; (4) critical path method; (5) developing a network; (6) converting an ugly duckling to a swan; (7) network scheduling problem; (8) (9) network scheduling when resources are limited; (10) multi-program considerations; (11) influence on program performance; (12) line-of-balance technique; (13) time management; (14) recapitulization; and (15) analysis.
Automated Scheduling Via Artificial Intelligence
NASA Technical Reports Server (NTRS)
Biefeld, Eric W.; Cooper, Lynne P.
1991-01-01
Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.
Generating variable and random schedules of reinforcement using Microsoft Excel macros.
Bancroft, Stacie L; Bourret, Jason C
2008-01-01
Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values.
Utilization Bound of Non-preemptive Fixed Priority Schedulers
NASA Astrophysics Data System (ADS)
Park, Moonju; Chae, Jinseok
It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.
Shattuck, Nita Lewis; Matsangas, Panagiotis; Eriksen, Elke; Kulubis, Spiros
2015-08-01
The aim of this study was to assess effectiveness of an alternative, 24-hr-on/72-hr-off watchstanding schedule on sleep and morale of personnel assigned to the President's Emergency Operations Center (PEOC). As part of the White House Military Office, PEOC personnel historically worked a 12-hr "Panama" watch schedule. Personnel reported experiencing chronic insufficient and disrupted sleep patterns and sought advice for improving their watchstanding schedule. Participants (N = 14 active-duty military members, ages 29 to 42 years) completed the Profile of Mood State (POMS) three times: before, during, and after switching to the alternative schedule with 5-hr sleep periods built into their workday. Participants completed a poststudy questionnaire to assess individual schedule preferences. Sleep was measured actigraphically, supplemented by activity logs. As indicated by POMS scores, mood improved significantly on the new schedule. Although average total sleep amount did not change substantively, the timing of sleep was more consistent on the new schedule, resulting in better sleep hygiene. PEOC personnel overwhelmingly preferred the new schedule, reporting not only that they felt more rested but that the new schedule was more conducive to the demands of family life. Demands of family life and time spent commuting were found to be critical factors for acceptance of the alternative schedule. This new schedule will be most effective if personnel adhere to the scheduled rest periods assigned during their 24-hr duty. A successful schedule should avoid conflicts between social life and operational demands. Results may lead to changes in the work schedules of other departments with similar 24/7 responsibilities. © 2015, Human Factors and Ergonomics Society.
Automated Platform Management System Scheduling
NASA Technical Reports Server (NTRS)
Hull, Larry G.
1990-01-01
The Platform Management System was established to coordinate the operation of platform systems and instruments. The management functions are split between ground and space components. Since platforms are to be out of contact with the ground more than the manned base, the on-board functions are required to be more autonomous than those of the manned base. Under this concept, automated replanning and rescheduling, including on-board real-time schedule maintenance and schedule repair, are required to effectively and efficiently meet Space Station Freedom mission goals. In a FY88 study, we developed several promising alternatives for automated platform planning and scheduling. We recommended both a specific alternative and a phased approach to automated platform resource scheduling. Our recommended alternative was based upon use of exactly the same scheduling engine in both ground and space components of the platform management system. Our phased approach recommendation was based upon evolutionary development of the platform. In the past year, we developed platform scheduler requirements and implemented a rapid prototype of a baseline platform scheduler. Presently we are rehosting this platform scheduler rapid prototype and integrating the scheduler prototype into two Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the on-board scheduler in the Platform Management System Testbed. Using these testbeds, we will investigate rescheduling issues, evaluate operational performance and enhance the platform scheduler prototype to demonstrate our evolutionary approach to automated platform scheduling. The work described in this paper was performed prior to Space Station Freedom rephasing, transfer of platform responsibility to Code E, and other recently discussed changes. We neither speculate on these changes nor attempt to predict the impact of the final decisions. As a consequence some of our work and results may be outdated when this paper is published.
Mozumdar, Biswita C; Hornsby, Douglas Neal; Gogate, Adheet S; Intriere, Lisa A; Hanson, Richard; McGreal, Karen; Kelly, Pauline; Ros, Pablo
2003-08-01
To study end-user attitudes and preferences with respect to radiology scheduling systems and to assess implications for retention and extension of the referral base. A study of the institution's historical data indicated reduced satisfaction with the process of patient scheduling in recent years. Sixty physicians who referred patients to a single, large academic radiology department received the survey. The survey was designed to identify (A) the preferred vehicle for patient scheduling (on-line versus telephone scheduling) and (B) whether ease of scheduling was a factor in physicians referring patients to other providers. Referring physicians were asked to forward the survey to any appropriate office staff member in case the latter scheduled appointments for patients. Users were asked to provide comments and suggestions for improvement. The statistical method used was the analysis of proportions. Thirty-three responses were received, corresponding to a return rate of 55%. Twenty-six of the 33 respondents (78.8%, P < .01) stated they were willing to try an online scheduling system; 16 of which tried the system. Twelve of the 16 (75%, P < .05) preferred the on-line application to the telephone system, stating logistical simplification as the primary reason for preference. Three (18.75%) did not consider online scheduling to be more convenient than traditional telephone scheduling. One respondent did not indicate any preference. Eleven of 33 users (33.33%, P < .001) stated that they would change radiology service providers if expectations of scheduling ease are not met. On-line scheduling applications are becoming the preferred scheduling vehicle. Augmenting their capabilities and availability can simplify the scheduling process, improve referring physician satisfaction, and provide a competitive advantage. Referrers are willing to change providers if scheduling expectations are not met.
The MICRO-BOSS scheduling system: Current status and future efforts
NASA Technical Reports Server (NTRS)
Sadeh, Norman M.
1993-01-01
In this paper, a micro-opportunistic approach to factory scheduling was described that closely monitors the evolution of bottlenecks during the construction of the schedule, and continuously redirects search towards the bottleneck that appears to be most critical. This approach differs from earlier opportunistic approaches, as it does not require scheduling large resource subproblems or large job subproblems before revising the current scheduling strategy. This micro-opportunistic approach was implemented in the context of the MICRO-BOSS factory scheduling system. A study comparing MICRO-BOSS against a macro-opportunistic scheduler suggests that the additional flexibility of the micro-opportunistic approach to scheduling generally yields important reductions in both tardiness and inventory.
The R-Shell approach - Using scheduling agents in complex distributed real-time systems
NASA Technical Reports Server (NTRS)
Natarajan, Swaminathan; Zhao, Wei; Goforth, Andre
1993-01-01
Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.
A case study: the initiative to improve RN scheduling at Hamilton Health Sciences.
Wallace, Laurel-Anne; Pierson, Sharon
2008-01-01
In 2003, Hamilton Health Sciences embarked on an initiative to improve and standardize nursing schedules and scheduling practices. The scheduling project was one of several initiatives undertaken by a corporate-wide Nursing Resource Group established to enhance the work environment and patient care and to ensure appropriate utilization of nursing resources across the organization's five hospitals. This article focuses on major activities undertaken in the scheduling initiative. The step-by-step approach described, plus examples of the scheduling resources developed and samples of extended-tour schedules, will all provide insight, potential strategies and practical help for nursing administrators, human resources (HR) personnel and others interested in improving nurse scheduling.
Contribution of Schedule Delays to Cost Growth: How to Make Peace with a Marching Army
NASA Technical Reports Server (NTRS)
Majerowicz, Walt; Bitten, Robert; Emmons, Debra; Shinn, Stephen A.
2016-01-01
Numerous research papers have shown that cost and schedule growth are interrelated for NASA space science missions. Although there has shown to be a strong correlation of cost growth with schedule growth, it is unclear what percentage of cost growth is caused by schedule growth and how schedule growth can be controlled. This paper attempts to quantify this percentage by looking at historical data and show detailed examples of how schedule growth influences cost growth. The paper also addresses a methodology to show an alternate approach for assessing and setting a robust baseline schedule and use schedule performance metrics to help assess if the project is performing to plan. Finally, recommendations are presented to help control schedule growth in order to minimize cost growth for NASA space science missions.
Scheduling from the perspective of the application
DOE Office of Scientific and Technical Information (OSTI.GOV)
Berman, F.; Wolski, R.
1996-12-31
Metacomputing is the aggregation of distributed and high-performance resources on coordinated networks. With careful scheduling, resource-intensive applications can be implemented efficiently on metacomputing systems at the sizes of interest to developers and users. In this paper we focus on the problem of scheduling applications on metacomputing systems. We introduce the concept of application-centric scheduling in which everything about the system is evaluated in terms of its impact on the application. Application-centric scheduling is used by virtually all metacomputer programmers to achieve performance on metacomputing systems. We describe two successful metacomputing applications to illustrate this approach, and describe AppLeS scheduling agentsmore » which generalize the application-centric scheduling approach. Finally, we show preliminary results which compare AppLeS-derived schedules with conventional strip and blocked schedules for a two-dimensional Jacobi code.« less
Production Scheduling for Rehabilitation Workshops.
ERIC Educational Resources Information Center
Hietala, David A.
This publication examines production scheduling procedures for sheltered workshops. The manual includes three major sections: (1) the importance and benefits of production scheduling; (2) how-to information on performing basic scheduling in the workshop; and (3) answers to the question, What makes production scheduling work? The scheduling…
39 CFR 3020.11 - Initial Mail Classification Schedule.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 39 Postal Service 1 2014-07-01 2014-07-01 false Initial Mail Classification Schedule. 3020.11 Section 3020.11 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL PRODUCT LISTS Mail Classification Schedule § 3020.11 Initial Mail Classification Schedule. The initial Mail Classification Schedule shall...
The MICRO-BOSS scheduling system: Current status and future efforts
NASA Technical Reports Server (NTRS)
Sadeh, Norman M.
1992-01-01
In this paper, a micro-opportunistic approach to factory scheduling was described that closely monitors the evolution of bottlenecks during the construction of the schedule and continuously redirects search towards the bottleneck that appears to be most critical. This approach differs from earlier opportunistic approaches, as it does not require scheduling large resource subproblems or large job subproblems before revising the current scheduling strategy. This micro-opportunistic approach was implemented in the context of the MICRO-BOSS factory scheduling system. A study comparing MICRO-BOSS against a macro-opportunistic scheduler suggests that the additional flexibility of the micro-opportunistic approach to scheduling generally yields important reductions in both tardiness and inventory. Current research efforts include: adaptation of MICRO-BOSS to deal with sequence-dependent setups and development of micro-opportunistic reactive scheduling techniques that will enable the system to patch the schedule in the presence of contingencies such as machine breakdowns, raw materials arriving late, job cancellations, etc.
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.
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.
Analysis and design of gain scheduled control systems. Ph.D. Thesis
NASA Technical Reports Server (NTRS)
Shamma, Jeff S.
1988-01-01
Gain scheduling, as an idea, is to construct a global feedback control system for a time varying and/or nonlinear plant from a collection of local time invariant designs. However in the absence of a sound analysis, these designs come with no guarantees on the robustness, performance, or even nominal stability of the overall gain schedule design. Such an analysis is presented for three types of gain scheduling situations: (1) a linear parameter varying plant scheduling on its exogenous parameters, (2) a nonlinear plant scheduling on a prescribed reference trajectory, and (3) a nonlinear plant scheduling on the current plant output. Conditions are given which guarantee that the stability, robustness, and performance properties of the fixed operating point designs carry over to the global gain scheduled designs, such as the scheduling variable should vary slowly and capture the plants nonlinearities. Finally, an alternate design framework is proposed which removes the slowing varying restriction or gain scheduled systems. This framework addresses some fundamental feedback issues previously ignored in standard gain.
Single-Pass Serial Scheduling Heuristic for Eglin AFB Range Services Division Schedule
2009-06-01
scheduling tool for this RCPSP. Research on a schedule improvement metaheuristic and coding of the complete algorithm is required before it can be...a schedule better by applying metaheuristic improvement algorithms to a feasible schedule after it is created. 2.5.1. Greedy Algorithm The...next available position, the algorithm will not utilize all the available range time and manpower. An improvement metaheuristic is required to
ERIC Educational Resources Information Center
Sedwal, Mona; Kamat, Sangeeta
2008-01-01
The Scheduled Castes (SCs, also known as Dalits) and Scheduled Tribes (STs, also known as Adivasis) are among the most socially and educationally disadvantaged groups in India. This paper examines issues concerning school access and equity for Scheduled Caste and Scheduled Tribe communities and also highlights their unique problems, which may…
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.
Code of Federal Regulations, 2010 CFR
2010-04-01
... 20 Employees' Benefits 1 2010-04-01 2010-04-01 false If a person dies while receiving a schedule award, to whom is the balance of the schedule award payable? 10.413 Section 10.413 Employees' Benefits... balance of the schedule award payable? The circumstances under which the balance of a schedule award may...
Code of Federal Regulations, 2011 CFR
2011-04-01
... 20 Employees' Benefits 1 2011-04-01 2011-04-01 false If a person dies while receiving a schedule award, to whom is the balance of the schedule award payable? 10.413 Section 10.413 Employees' Benefits... balance of the schedule award payable? The circumstances under which the balance of a schedule award may...
Advanced Numerical Techniques of Performance Evaluation. Volume 1
1990-06-01
system scheduling3thread. The scheduling thread then runs any other ready thread that can be found. A thread can only sleep or switch out on itself...Polychronopoulos and D.J. Kuck. Guided Self- Scheduling : A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Transactions on Computers C...Kuck 1987] C.D. Polychronopoulos and D.J. Kuck. Guided Self- Scheduling : A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Trans. on Comp
Cohen, S L; Richardson, J; Klebez, J; Febbo, S; Tucker, D
2001-09-01
Biofeedback was used to increase forearm-muscle tension. Feedback was delivered under continuous reinforcement (CRF), variable interval (VI), fixed interval (FI), variable ratio (VR), and fixed ratio (FR) schedules of reinforcement when college students increased their muscle tension (electromyograph, EMG) above a high threshold. There were three daily sessions of feedback, and Session 3 was immediately followed by a session without feedback (extinction). The CRF schedule resulted in the highest EMG, closely followed by the FR and VR schedules, and the lowest EMG scores were produced by the FI and VI schedules. Similarly, the CRF schedule resulted in the greatest amount of time-above-threshold and the VI and FI schedules produced the lowest time-above-threshold. The highest response rates were generated by the FR schedule, followed by the VR schedule. The CRF schedule produced relatively low response rates, comparable to the rates under the VI and FI schedules. Some of the data are consistent with the partial-reinforcement-extinction effect. The present data suggest that different schedules of feedback should be considered in muscle-strengthening-contexts such as during the rehabilitation of muscles following brain damage or peripheral nervous-system injury.
Anchorage Arrival Scheduling Under Off-Nominal Weather Conditions
NASA Technical Reports Server (NTRS)
Grabbe, Shon; Chan, William N.; Mukherjee, Avijit
2012-01-01
Weather can cause flight diversions, passenger delays, additional fuel consumption and schedule disruptions at any high volume airport. The impacts are particularly acute at the Ted Stevens Anchorage International Airport in Anchorage, Alaska due to its importance as a major international portal. To minimize the impacts due to weather, a multi-stage scheduling process is employed that is iteratively executed, as updated aircraft demand and/or airport capacity data become available. The strategic scheduling algorithm assigns speed adjustments for flights that originate outside of Anchorage Center to achieve the proper demand and capacity balance. Similarly, an internal departure-scheduling algorithm assigns ground holds for pre-departure flights that originate from within Anchorage Center. Tactical flight controls in the form of airborne holding are employed to reactively account for system uncertainties. Real-world scenarios that were derived from the January 16, 2012 Anchorage visibility observations and the January 12, 2012 Anchorage arrival schedule were used to test the initial implementation of the scheduling algorithm in fast-time simulation experiments. Although over 90% of the flights in the scenarios arrived at Anchorage without requiring any delay, pre-departure scheduling was the dominant form of control for Anchorage arrivals. Additionally, tactical scheduling was used extensively in conjunction with the pre-departure scheduling to reactively compensate for uncertainties in the arrival demand. For long-haul flights, the strategic scheduling algorithm performed best when the scheduling horizon was greater than 1,000 nmi. With these long scheduling horizons, it was possible to absorb between ten and 12 minutes of delay through speed control alone. Unfortunately, the use of tactical scheduling, which resulted in airborne holding, was found to increase as the strategic scheduling horizon increased because of the additional uncertainty in the arrival times of the aircraft. Findings from these initial experiments indicate that it is possible to schedule arrivals into Anchorage with minimal delays under low-visibility conditions with less disruption to high-cost, international flights.
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.
48 CFR 538.7004 - Solicitation provisions and contract clauses.
Code of Federal Regulations, 2010 CFR
2010-10-01
...— (1) Schedule 70; (2) The Consolidated Schedule containing information technology SINs; and (3... Schedule containing information technology SINs; and (3) Schedule 84. (c) The contracting officer shall... information technology SINs; and (3) Schedule 84. (d) See 552.101-70 for authorized FAR deviations. [73 FR...
48 CFR 538.7004 - Solicitation provisions and contract clauses.
Code of Federal Regulations, 2011 CFR
2011-10-01
...— (1) Schedule 70; (2) The Consolidated Schedule containing information technology SINs; and (3... Schedule containing information technology SINs; and (3) Schedule 84. (c) The contracting officer shall... information technology SINs; and (3) Schedule 84. (d) See 552.101-70 for authorized FAR deviations. [73 FR...
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
Code of Federal Regulations, 2013 CFR
2013-07-01
... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave. Eligible... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee...
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
Code of Federal Regulations, 2012 CFR
2012-07-01
... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave. Eligible... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee...
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
Code of Federal Regulations, 2011 CFR
2011-07-01
... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave. Eligible... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee...
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
Code of Federal Regulations, 2014 CFR
2014-07-01
... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave. Eligible... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee...
A Comparison of Escalating versus Fixed Reinforcement Schedules on Undergraduate Quiz Taking
ERIC Educational Resources Information Center
Mahoney, Amanda
2017-01-01
Drug abstinence studies indicate that escalating reinforcement schedules maintain abstinence for longer periods than fixed reinforcement schedules. The current study evaluated whether escalating reinforcement schedules would maintain more quiz taking than fixed reinforcement schedules. During baseline and for the control group, bonus points were…
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-13
...] Schedules of Controlled Substances: Temporary Placement of Five Synthetic Cannabinoids Into Schedule I... Notice of Intent announcing its intention to temporarily place five synthetic cannabinoids into Schedule... announced its intention to temporarily place five synthetic cannabinoids into schedule I of the Controlled...
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.
Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros
Bancroft, Stacie L; Bourret, Jason C
2008-01-01
Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values. PMID:18595286
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.
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.
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.
Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study.
Rönnberg, Elina; Larsson, Torbjörn
2010-03-01
Hospital wards need to be staffed by nurses round the clock, resulting in irregular working hours for many nurses. Over the years, the nurses' influence on the scheduling has been increased in order to improve their working conditions. In Sweden it is common to apply a kind of self-scheduling where each nurse individually proposes a schedule, and then the final schedule is determined through informal negotiations between the nurses. This kind of self-scheduling is very time-consuming and does often lead to conflicts. We present a pilot study which aims at determining if it is possible to create an optimisation tool that automatically delivers a usable schedule based on the schedules proposed by the nurses. The study is performed at a typical Swedish nursing ward, for which we have developed a mathematical model and delivered schedules. The results of this study are very promising and suggest continued work along these lines.
Goal programming for cyclical auxiliary police scheduling at UiTM Cawangan Perlis
NASA Astrophysics Data System (ADS)
Mustapar, Wasilatul Effah; Nasir, Diana Sirmayunie Mohd; Nor, Nor Azriani Mohamad; Abas, Sharifah Fhahriyah Syed
2017-11-01
Constructing a good and fair schedule for shift workers poses a great challenge as it requires a lot of time and effort. In this study, goal programming has been applied on scheduling to achieve the hard and soft constraints for a cyclical schedule that would ease the head of auxiliary police at building new schedules. To accomplish this goal, shift types were assigned in order to provide a fair schedule that takes into account the auxiliary police's policies and preferences. The model was run using Lingo software. Three out of four goals set for the study were achieved. In addition, the results considered an equal allocation for every auxiliary police, namely 70% for total duty and 30% for the day. Furthermore, the schedule was able to cyclically generate another 10 sets schedule. More importantly, the model has provided unbiased scheduling of auxiliary policies which led to high satisfaction in auxiliary police management.
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.
Scheduling for energy and reliability management on multiprocessor real-time systems
NASA Astrophysics Data System (ADS)
Qi, Xuan
Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.
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.
Dack, Charlotte; Reed, Phil; McHugh, Louise
2010-11-01
The aim of the four present experiments was to explore how different schedules of reinforcement influence schedule-induced behavior, their impact on evaluative ratings given to conditioned stimuli associated with each schedule through evaluative conditioning, and the transfer of these evaluations through derived stimulus networks. Experiment 1 compared two contrasting response reinforcement rules (variable ratio [VR], variable interval [VI]). Experiment 2 varied the response to reinforcement rule between two schedules but equated the outcome to response rate (differential reinforcement of high rate [DRH] vs. VR). Experiment 3 compared molar and molecular aspects of contingencies of reinforcement (tandem VIVR vs. tandem VRVI). Finally, Experiment 4 employed schedules that induced low rates of responding to determine whether, under these circumstances, responses were more sensitive to the molecular aspects of a schedule (differential reinforcement of low rate [DRL] vs. VI). The findings suggest that the transfer of evaluative functions is determined mainly by differences in response rate between the schedules and the molar aspects of the schedules. However, when neither schedule was based on a strong response reinforcement rule, the transfer of evaluative judgments came under the control of the molecular aspects of the schedule.
Automating Mid- and Long-Range Scheduling for NASA's Deep Space Network
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Sorensen, Sugi; Tay, Peter; Carruth, Butch; Coffman, Adam; Wallace, Mike
2012-01-01
NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system is architected as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users who utilize the DSN (representing 37 projects including international partners and ground-based science and calibration users). The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. S(sup 3) has been used for negotiating schedules since April 2011, including the baseline schedules for three launching missions in late 2011. S(sup 3) supports a distributed scheduling model, in which changes can potentially be made by multiple users based on multiple schedule "workspaces" or versions of the schedule. This has led to several challenges in the design of the scheduling database, and of a change proposal workflow that allows users to concur with or to reject proposed schedule changes, and then counter-propose with alternative or additional suggested changes. This paper describes some key aspects of the S(sup 3) system and lessons learned from its operational deployment to date, focusing on the challenges of multi-user collaborative scheduling in a practical and mission-critical setting. We will also describe the ongoing project to extend S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.
A COTS-Based Attitude Dependent Contact Scheduling System
NASA Technical Reports Server (NTRS)
DeGumbia, Jonathan D.; Stezelberger, Shane T.; Woodard, Mark
2006-01-01
The mission architecture of the Gamma-ray Large Area Space Telescope (GLAST) requires a sophisticated ground system component for scheduling the downlink of science data. Contacts between the ````````````````` satellite and the Tracking and Data Relay Satellite System (TDRSS) are restricted by the limited field-of-view of the science data downlink antenna. In addition, contacts must be scheduled when permitted by the satellite s complex and non-repeating attitude profile. Complicating the matter further, the long lead-time required to schedule TDRSS services, combined with the short duration of the downlink contact opportunities, mandates accurate GLAST orbit and attitude modeling. These circumstances require the development of a scheduling system that is capable of predictively and accurately modeling not only the orbital position of GLAST but also its attitude. This paper details the methods used in the design of a Commercial Off The Shelf (COTS)-based attitude-dependent. TDRSS contact Scheduling system that meets the unique scheduling requirements of the GLAST mission, and it suggests a COTS-based scheduling approach to support future missions. The scheduling system applies filtering and smoothing algorithms to telemetered GPS data to produce high-accuracy predictive GLAST orbit ephemerides. Next, bus pointing commands from the GLAST Science Support Center are used to model the complexities of the two dynamic science gathering attitude modes. Attitude-dependent view periods are then generated between GLAST and each of the supporting TDRSs. Numerous scheduling constraints are then applied to account for various mission specific resource limitations. Next, an optimization engine is used to produce an optimized TDRSS contact schedule request which is sent to TDRSS scheduling for confirmation. Lastly, the confirmed TDRSS contact schedule is rectified with an updated ephemeris and adjusted bus pointing commands to produce a final science downlink contact schedule.
Surgical demand scheduling: a review.
Magerlein, J M; Martin, J B
1978-01-01
This article reviews the literature on scheduling of patient demand for surgery and outlines an approach to improving overall performance of hospital surgical suites. Reported scheduling systems are categorized into those that schedule patients in advance of the surgical date and those that schedule available patients on the day of surgery. Approaches to estimating surgical procedure times are also reviewed, and the article concludes with a discussion of the failure to implement the majority of reported scheduling schemes. PMID:367987
Contingency rescheduling of spacecraft operations
NASA Technical Reports Server (NTRS)
Britt, Daniel L.; Geoffroy, Amy L.; Gohring, John R.
1988-01-01
Spacecraft activity scheduling was a focus of attention in artificial intelligence recently. Several scheduling systems were devised which more-or-less successfully address various aspects of the activity scheduling problem, though most of these are not yet mature, with the notable expection of NASA's ESP. Few current scheduling systems, however, make any attempt to deal fully with the problem of modifying a schedule in near-real-time in the event of contingencies which may arise during schedule execution. These contingencies can include resources becoming unavailable unpredictably, a change in spacecraft conditions or environment, or the need to perform an activity not scheduled. In these cases it becomes necessary to repair an existing schedule, disrupting ongoing operations as little as possible. Normal scheduling is just a part of that which must be accomplished during contingency rescheduling. A prototype system named MAESTRO was developed for spacecraft activity scheduling. MAESTRO is briefly described with a focus on recent work in the area of real-time contingency handling. Included is a discussion of some of the complexities of the scheduling problem and how they affect contingency rescheduling, such as temporal constraints between activities, activities which may be interrupted and continued in any of several ways, and different ways to choose a resource complement which will allow continuation of an activity. Various heuristics used in MAESTRO for contingency rescheduling is discussed, as are operational concerns such as interaction of the scheduler with spacecraft subsystems controllers.
Space station payload operations scheduling with ESP2
NASA Technical Reports Server (NTRS)
Stacy, Kenneth L.; Jaap, John P.
1988-01-01
The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center is developing a system of programs to handle all aspects of scheduling payload operations for Space Station. The Expert Scheduling Program (ESP2) is the heart of this system. The task of payload operations scheduling can be simply stated as positioning the payload activities in a mission so that they collect their desired data without interfering with other activities or violating mission constraints. ESP2 is an advanced version of the Experiment Scheduling Program (ESP) which was developed by the Mission Integration Branch beginning in 1979 to schedule Spacelab payload activities. The automatic scheduler in ESP2 is an expert system that embodies the rules that expert planners would use to schedule payload operations by hand. This scheduler uses depth-first searching, backtracking, and forward chaining techniques to place an activity so that constraints (such as crew, resources, and orbit opportunities) are not violated. It has an explanation facility to show why an activity was or was not scheduled at a certain time. The ESP2 user can also place the activities in the schedule manually. The program offers graphical assistance to the user and will advise when constraints are being violated. ESP2 also has an option to identify conflict introduced into an existing schedule by changes to payload requirements, mission constraints, and orbit opportunities.
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.
Duplessis, C A; Miller, J C; Crepeau, L J; Osborn, C M; Dyche, J
2007-01-01
With a desire to increase health, cognitive performance effectiveness, and quality of life for submarine watch-standers underway, we performed an evaluation comparing an alternative, compressed-work (ALT) schedule, designed to enhance circadian rhythm entrainment and sleep hygiene, to the contemporary submarine (SUB) forward rotating schedule, aboard the ballistic-missile submarine, USS Henry M. Jackson (SSBN-730 Gold). We assessed a compressed close-6 watch-schedule ("ALT") relative to the existing backward rotating 6-hr on, 12-hr off 18-hr watch schedule ("SUB") employed underway aboard submarines. We monitored 40 subjects' sleep, and temperature and salivary cortisol from 10 of the 40 for approximately two weeks on each respective schedule underway. The cortisol cosinor mesors (midline estimating statistic of rhythm), and amplitudes did not differ significantly between conditions. The temperature cosinor mesors, and the cosinor amplitude were not significantly different, while the cosine curve fit accounted for significantly more variance in the ALT condition than in the SUB condition. The SUB schedule garnered significantly more sleep (7.1 +/- 0.2 hours) than that of the ALTMID schedule (6.3 +/- 0.3 hours). Surveys revealed that 52% of respondents preferred the SUB schedule, 15% preferred the ALT, and 33% were either indifferent or submitted uninterpretable surveys. The ALT schedule was not superior to the existing SUB schedule by physiological or subjective measures and was incompatible to accommodating operational constraints.
Quantifying and understanding reproductive allocation schedules in plants.
Wenk, Elizabeth Hedi; Falster, Daniel S
2015-12-01
A plant's reproductive allocation (RA) schedule describes the fraction of surplus energy allocated to reproduction as it increases in size. While theorists use RA schedules as the connection between life history and energy allocation, little is known about RA schedules in real vegetation. Here we review what is known about RA schedules for perennial plants using studies either directly quantifying RA or that collected data from which the shape of an RA schedule can be inferred. We also briefly review theoretical models describing factors by which variation in RA may arise. We identified 34 studies from which aspects of an RA schedule could be inferred. Within those, RA schedules varied considerably across species: some species abruptly shift all resources from growth to reproduction; most others gradually shift resources into reproduction, but under a variety of graded schedules. Available data indicate the maximum fraction of energy allocated to production ranges from 0.1 to 1 and that shorter lived species tend to have higher initial RA and increase their RA more quickly than do longer-lived species. Overall, our findings indicate, little data exist about RA schedules in perennial plants. Available data suggest a wide range of schedules across species. Collection of more data on RA schedules would enable a tighter integration between observation and a variety of models predicting optimal energy allocation, plant growth rates, and biogeochemical cycles.
32 CFR 204.9 - Schedule of fees and rates.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 32 National Defense 2 2014-07-01 2014-07-01 false Schedule of fees and rates. 204.9 Section 204.9 National Defense Department of Defense (Continued) OFFICE OF THE SECRETARY OF DEFENSE (CONTINUED) MISCELLANEOUS USER FEES § 204.9 Schedule of fees and rates. (a) Schedule of fees and rates. (1) This schedule...
Applications of dynamic scheduling technique to space related problems: Some case studies
NASA Astrophysics Data System (ADS)
Nakasuka, Shinichi; Ninomiya, Tetsujiro
1994-10-01
The paper discusses the applications of 'Dynamic Scheduling' technique, which has been invented for the scheduling of Flexible Manufacturing System, to two space related scheduling problems: operation scheduling of a future space transportation system, and resource allocation in a space system with limited resources such as space station or space shuttle.
29 CFR 825.202 - Intermittent leave or reduced leave schedule.
Code of Federal Regulations, 2010 CFR
2010-07-01
... LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family... leave schedule is a leave schedule that reduces an employee's usual number of working hours per workweek, or hours per workday. A reduced leave schedule is a change in the employee's schedule for a period of...
5 CFR 610.122 - Variations in work schedules for educational purposes.
Code of Federal Regulations, 2011 CFR
2011-01-01
... SERVICE REGULATIONS HOURS OF DUTY Weekly and Daily Scheduling of Work Work Schedules § 610.122 Variations in work schedules for educational purposes. (a) Notwithstanding § 610.121, the head of an agency may... 5 Administrative Personnel 1 2011-01-01 2011-01-01 false Variations in work schedules for...
Influences on Cocaine Tolerance Assessed under a Multiple Conjunctive Schedule of Reinforcement
ERIC Educational Resources Information Center
Yoon, Jin Ho; Branch, Marc N.
2009-01-01
Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the…
Thinking Outside the Block: An Innovative Alternative to 4X4 Block Scheduling.
ERIC Educational Resources Information Center
Frank, Myra
2002-01-01
Introduces a 4x1 block scheduling method that was developed as an alternative to 4x4 block scheduling. Schedules Fridays for summer school, test preparation, and enrichment and elective courses. Includes suggestions on how to alleviate drawbacks of the 4x1 block schedule. (YDS)
Federal Register 2010, 2011, 2012, 2013, 2014
2011-10-17
... Information for San Francisco International Airport for the Summer 2012 Scheduling Season AGENCY: Department... Guidelines (WSG) effective for the Summer 2012 scheduling season. The FAA has determined this designation is... with the Summer 2012 scheduling season to monitor major scheduling peaks that could result in lengthy...
Discrimination of Variable Schedules Is Controlled by Interresponse Times Proximal to Reinforcement
ERIC Educational Resources Information Center
Tanno, Takayuki; Silberberg, Alan; Sakagami, Takayuki
2012-01-01
In Experiment 1, food-deprived rats responded to one of two schedules that were, with equal probability, associated with a sample lever. One schedule was always variable ratio, while the other schedule, depending on the trial within a session, was: (a) a variable-interval schedule; (b) a tandem variable-interval,…
A survey of planning and scheduling research at the NASA Ames Research Center
NASA Technical Reports Server (NTRS)
Zweben, Monte
1989-01-01
NASA Ames Research Center has a diverse program in planning and scheduling. Some research projects as well as some applications are highlighted. Topics addressed include machine learning techniques, action representations and constraint-based scheduling systems. The applications discussed are planetary rovers, Hubble Space Telescope scheduling, and Pioneer Venus orbit scheduling.
14 CFR 399.81 - Unrealistic or deceptive scheduling.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Unrealistic or deceptive scheduling. 399.81... Unrealistic or deceptive scheduling. (a) It is the policy of the Board to consider unrealistic scheduling of... to the advertising of scheduled performance, it is the policy of the Board to regard as an unfair or...
The Reinforcing Effects of Houselight Illumination during Chained Schedules of Food Presentation
ERIC Educational Resources Information Center
Allen, Ron; Kupfer, Jeff; Malagodi, E. F.
2008-01-01
Pigeons' keypecking was maintained under two- and three-component chained schedules of food presentation. The component schedules were all fixed-interval schedules of either 1- or 2-min duration. Across conditions the presence of houselight illumination within each component schedule was manipulated. For each pigeon, first-component response rates…
Flexible Scheduling to Fit the Firefighters.
ERIC Educational Resources Information Center
Cox, Clarice Robinson
Three flexible scheduling plans were tried in order that firefighters could take regular college courses despite their 24 hours on the 24 off work schedule. Plan one scheduled the firefighters into a regular Monday-Wednesday-Friday class which they attended every other week, making up missed material outside of class. Plan two scheduled special…
NASA Technical Reports Server (NTRS)
Smith, Greg
2003-01-01
Schedule risk assessments determine the likelihood of finishing on time. Each task in a schedule has a varying degree of probability of being finished on time. A schedule risk assessment quantifies these probabilities by assigning values to each task. This viewgraph presentation contains a flow chart for conducting a schedule risk assessment, and profiles applicable several methods of data analysis.
Utilizing AI in Temporal, Spatial, and Resource Scheduling
NASA Technical Reports Server (NTRS)
Stottler, Richard; Kalton, Annaka; Bell, Aaron
2006-01-01
Aurora is a software system enabling the rapid, easy solution of complex scheduling problems involving spatial and temporal constraints among operations and scarce resources (such as equipment, workspace, and human experts). Although developed for use in the International Space Station Processing Facility, Aurora is flexible enough that it can be easily customized for application to other scheduling domains and adapted as the requirements change or become more precisely known over time. Aurora s scheduling module utilizes artificial-intelligence (AI) techniques to make scheduling decisions on the basis of domain knowledge, including knowledge of constraints and their relative importance, interdependencies among operations, and possibly frequent changes in governing schedule requirements. Unlike many other scheduling software systems, Aurora focuses on resource requirements and temporal scheduling in combination. For example, Aurora can accommodate a domain requirement to schedule two subsequent operations to locations adjacent to a shared resource. The graphical interface allows the user to quickly visualize the schedule and perform changes reflecting additional knowledge or alterations in the situation. For example, the user might drag the activity corresponding to the start of operations to reflect a late delivery.
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.
A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy
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
Developing optimal nurses work schedule using integer programming
NASA Astrophysics Data System (ADS)
Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena
2017-08-01
Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.
A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.
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.
NASA Technical Reports Server (NTRS)
Chevalley, Eric; Parke, Bonny; Kraut, Josh M.; Bienert, Nancy; Omar, Faisal; Palmer, Everett A.
2015-01-01
In this paper, successful Time-Based Flow Management (TBFM) scheduling systems for arrivals are considered and adapted to apply to departures. We present a concept of operations that integrates Controller-Managed Spacing tools for departures (CMS-D) with existing tactical departure scheduling tools to coordinate demand at departure fixes in a metroplex environment. We tested our concept in a Human-in-the-Loop simulation and compared the effect of two scheduling conditions: 1) "Departure Scheduling" consisting of an emulation of the Integrated Departure and Arrival Capability (IDAC) where Towers and a Planner (Traffic Management Coordinator at the appropriate facility) coordinate aircraft scheduled takeoff times to departure fixes; and 2) "Arrival Sensitive Departure Scheduling" where, in addition, the Tower and Planner also consider arrival Scheduled Time of Arrivals (STAs) at the airport's dependent runway. Results indicate little difference between the two scheduling conditions, but a large difference between the No Tools and the two scheduling conditions with CMS-D tools. The scheduling/CMS-D tools conditions markedly reduced heading, speed clearances, and workload for controllers who were merging flows at the departure fixes. In the tool conditions, departure controllers conditioned departures earlier rather than later when aircraft were tied near the departure fixes. In the scheduling/CMS-D tools conditions, departures crossed the departure fixes 50 seconds earlier and with an 8% error rate (consisting of time ahead or behind desired time of arrival) compared to a 19% error rate in the No Tool condition. Two exploratory runs showed that similar beneficial effects can be obtained only with the CMS-D tools without scheduling takeoff times, but at the cost of a somewhat higher workload for controllers, indicating the benefits of pre-departure scheduling of aircraft with minimal delays. Hence, we found that CMS-D tools were very beneficial in the metroplex environment we tested but that further research is needed to clarify the benefits of the various scheduling approaches.
Development of Watch Schedule Using Rules Approach
NASA Astrophysics Data System (ADS)
Jurkevicius, Darius; Vasilecas, Olegas
The software for schedule creation and optimization solves a difficult, important and practical problem. The proposed solution is an online employee portal where administrator users can create and manage watch schedules and employee requests. Each employee can login with his/her own account and see his/her assignments, manage requests, etc. Employees set as administrators can perform the employee scheduling online, manage requests, etc. This scheduling software allows users not only to see the initial and optimized watch schedule in a simple and understandable form, but also to create special rules and criteria and input their business. The system using rules automatically will generate watch schedule.
Decomposability and scalability in space-based observatory scheduling
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Stephen F.
1992-01-01
In this paper, we discuss issues of problem and model decomposition within the HSTS scheduling framework. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) scheduling problem, motivated by the limitations of the current solution and, more generally, the insufficiency of classical planning and scheduling approaches in this problem context. We first summarize the salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research. Then, we describe some key problem decomposition techniques supported by HSTS and underlying our integrated planning and scheduling approach, and we discuss the leverage they provide in solving space-based observatory scheduling problems.
Taking the Lag out of Jet Lag through Model-Based Schedule Design
Dean, Dennis A.; Forger, Daniel B.; Klerman, Elizabeth B.
2009-01-01
Travel across multiple time zones results in desynchronization of environmental time cues and the sleep–wake schedule from their normal phase relationships with the endogenous circadian system. Circadian misalignment can result in poor neurobehavioral performance, decreased sleep efficiency, and inappropriately timed physiological signals including gastrointestinal activity and hormone release. Frequent and repeated transmeridian travel is associated with long-term cognitive deficits, and rodents experimentally exposed to repeated schedule shifts have increased death rates. One approach to reduce the short-term circadian, sleep–wake, and performance problems is to use mathematical models of the circadian pacemaker to design countermeasures that rapidly shift the circadian pacemaker to align with the new schedule. In this paper, the use of mathematical models to design sleep–wake and countermeasure schedules for improved performance is demonstrated. We present an approach to designing interventions that combines an algorithm for optimal placement of countermeasures with a novel mode of schedule representation. With these methods, rapid circadian resynchrony and the resulting improvement in neurobehavioral performance can be quickly achieved even after moderate to large shifts in the sleep–wake schedule. The key schedule design inputs are endogenous circadian period length, desired sleep–wake schedule, length of intervention, background light level, and countermeasure strength. The new schedule representation facilitates schedule design, simulation studies, and experiment design and significantly decreases the amount of time to design an appropriate intervention. The method presented in this paper has direct implications for designing jet lag, shift-work, and non-24-hour schedules, including scheduling for extreme environments, such as in space, undersea, or in polar regions. PMID:19543382
Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns
NASA Technical Reports Server (NTRS)
Majerowicz, Walt; Shinn, Stephen A.
2016-01-01
This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.
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.
Multiresource allocation and scheduling for periodic soft real-time applications
NASA Astrophysics Data System (ADS)
Gopalan, Kartik; Chiueh, Tzi-cker
2001-12-01
Real-time applications that utilize multiple system resources, such as CPU, disks, and network links, require coordinated scheduling of these resources in order to meet their end-to-end performance requirements. Most state-of-the-art operating systems support independent resource allocation and deadline-driven scheduling but lack coordination among multiple heterogeneous resources. This paper describes the design and implementation of an Integrated Real-time Resource Scheduler (IRS) that performs coordinated allocation and scheduling of multiple heterogeneous resources on the same machine for periodic soft real-time application. The principal feature of IRS is a heuristic multi-resource allocation algorithm that reserves multiple resources for real-time applications in a manner that can maximize the number of applications admitted into the system in the long run. At run-time, a global scheduler dispatches the tasks of the soft real-time application to individual resource schedulers according to the precedence constraints between tasks. The individual resource schedulers, which could be any deadline based schedulers, can make scheduling decisions locally and yet collectively satisfy a real-time application's performance requirements. The tightness of overall timing guarantees is ultimately determined by the properties of individual resource schedulers. However, IRS maximizes overall system resource utilization efficiency by coordinating deadline assignment across multiple tasks in a soft real-time application.
Dry kiln schedules for commercial woods : temperate and tropical
R. Sidney Boone; Charles J. Kozlik; Paul J. Bois; Eugene M. Wengert
1988-01-01
This report contains suggested dry kiln schedules for over 500 commercial woods, both temperate and tropical. Kiln schedules are completely assembled and written out for easy use. Schedules for several thicknesses and specialty products (e.g. squares, handle stock, gunstock blanks) are given for many species. The majority of the schedules are from the world literature...
Automated Scheduling of Science Activities for Titan Encounters by Cassini
NASA Technical Reports Server (NTRS)
Ray, Trina L.; Knight, Russel L.; Mohr, Dave
2014-01-01
In an effort to demonstrate the efficacy of automated planning and scheduling techniques for large missions, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] and CLASP (Compressed Large-scale Activity Scheduling and Planning) [2] to the domain of scheduling high-level science goals into conflict-free operations plans for Titan encounters by the Cassini spacecraft.
Hwang, I-Shyan
2017-01-01
The K-coverage configuration that guarantees coverage of each location by at least K sensors is highly popular and is extensively used to monitor diversified applications in wireless sensor networks. Long network lifetime and high detection quality are the essentials of such K-covered sleep-scheduling algorithms. However, the existing sleep-scheduling algorithms either cause high cost or cannot preserve the detection quality effectively. In this paper, the Pre-Scheduling-based K-coverage Group Scheduling (PSKGS) and Self-Organized K-coverage Scheduling (SKS) algorithms are proposed to settle the problems in the existing sleep-scheduling algorithms. Simulation results show that our pre-scheduled-based KGS approach enhances the detection quality and network lifetime, whereas the self-organized-based SKS algorithm minimizes the computation and communication cost of the nodes and thereby is energy efficient. Besides, SKS outperforms PSKGS in terms of network lifetime and detection quality as it is self-organized. PMID:29257078
Interactive computer aided shift scheduling.
Gaertner, J
2001-12-01
This paper starts with a discussion of computer aided shift scheduling. After a brief review of earlier approaches, two conceptualizations of this field are introduced: First, shift scheduling as a field that ranges from extremely stable rosters at one pole to rather market-like approaches on the other pole. Unfortunately, already small alterations of a scheduling problem (e.g., the number of groups, the number of shifts) may call for rather different approaches and tools. Second, their environment shapes scheduling problems and scheduling has to be done within idiosyncratic organizational settings. This calls for the amalgamation of scheduling with other tasks (e.g., accounting) and for reflections whether better solutions might become possible by changes in the problem definition (e.g., other service levels, organizational changes). Therefore shift scheduling should be understood as a highly connected problem. Building upon these two conceptualizations, a few examples of software that ease scheduling in some areas of this field are given and future research questions are outlined.
Comparing Book- and Tablet-Based Picture Activity Schedules: Acquisition and Preference.
Giles, Aimee; Markham, Victoria
2017-09-01
Picture activity schedules consist of a sequence of images representing the order of tasks for a person to complete. Although, picture activity schedules have traditionally been presented in a book format, recently picture activity schedules have been evaluated on technological devices such as an iPod™ touch. The present study compared the efficiency of picture activity schedule acquisition on book- and tablet-based modalities. In addition, participant preference for each modality was assessed. Three boys aged below 5 years with a diagnosis of autism participated. Participants were taught to follow the schedules using both modalities. Following mastery of each modality of picture activity schedule, a concurrent-chains preference assessment was conducted to evaluate participant preference for each modality. Differences in acquisition rates across the two modalities were marginal. Preference for book- or tablet-based schedules was idiosyncratic across participants.
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.
Peters, V; de Rijk, A; Engels, J; Heerkens, Y; Nijhuis, F
2016-04-07
Work schedules contribute substantially to the health and well-being of nurses. Too broad typologies are used in research that do not meet the current variety in work schedules. To develop a new typology for nurses' work schedules based on five requirements and to validate the typology. This study is based on a questionnaire returned by 498 nurses (response 51%) including questions regarding nurses' work schedule, socio-demographic, and family characteristics and their appraisal of the work schedule. Frequencies of the different schedules were computed to determine the typology. To validate the typology, differences between the types were tested with ANOVAs, Chi2 and Kruskal-Wallis tests. Five main types can be distinguished based on predetermined requirements and frequencies, namely: (1) fixed early shift, (2) rotating two shift pattern without night shift, (3) rotating three shift pattern, (4) fixed and rotating two shift pattern including night shift, and (5) fixed normal day or afternoon shifts. Nurses in these types of work schedule differed significantly with respect to hours worked, days off between shifts, age, education, years in the job, commuting time, contribution to household income, satisfaction with work schedule and work schedule control. Especially nurses with type 3 schedules differed from other types. A typology of five main types of work schedules is proposed. Content validity of the typology is sufficient and the new typology seems useful for research on work-related aspects of nursing.
Collaborative Resource Allocation
NASA Technical Reports Server (NTRS)
Wang, Yeou-Fang; Wax, Allan; Lam, Raymond; Baldwin, John; Borden, Chester
2007-01-01
Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.
Code of Federal Regulations, 2012 CFR
2012-01-01
... supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... schedules for leader and supervisory wage employees in the Puerto Rico wage area. (a) The Department of... the Puerto Rico wage area. (c) The step 2 rate for the supervisory wage schedule shall be: (1) For...
Code of Federal Regulations, 2014 CFR
2014-01-01
... supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... schedules for leader and supervisory wage employees in the Puerto Rico wage area. (a) The Department of... the Puerto Rico wage area. (c) The step 2 rate for the supervisory wage schedule shall be: (1) For...
Code of Federal Regulations, 2011 CFR
2011-01-01
... supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... schedules for leader and supervisory wage employees in the Puerto Rico wage area. (a) The Department of... the Puerto Rico wage area. (c) The step 2 rate for the supervisory wage schedule shall be: (1) For...
Code of Federal Regulations, 2010 CFR
2010-01-01
... supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... schedules for leader and supervisory wage employees in the Puerto Rico wage area. (a) The Department of... the Puerto Rico wage area. (c) The step 2 rate for the supervisory wage schedule shall be: (1) For...
Code of Federal Regulations, 2013 CFR
2013-01-01
... supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... schedules for leader and supervisory wage employees in the Puerto Rico wage area. (a) The Department of... the Puerto Rico wage area. (c) The step 2 rate for the supervisory wage schedule shall be: (1) For...
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.
45 CFR 2551.52 - What factors are considered in determining a Senior Companion's service schedule?
Code of Federal Regulations, 2011 CFR
2011-10-01
... schedule? (a) Travel time between the Senior Companion's home and place of assignment is not part of the service schedule and is not stipended. (b) Travel time between individual assignments is a part of the service schedule and is stipended. (c) Meal time may be part of the service schedule and is stipended only...
45 CFR 2551.52 - What factors are considered in determining a Senior Companion's service schedule?
Code of Federal Regulations, 2010 CFR
2010-10-01
... schedule? (a) Travel time between the Senior Companion's home and place of assignment is not part of the service schedule and is not stipended. (b) Travel time between individual assignments is a part of the service schedule and is stipended. (c) Meal time may be part of the service schedule and is stipended only...
ERIC Educational Resources Information Center
Cinciripini, Paul M.; And Others
1995-01-01
Participants (n=128) quit smoking on a target date, after a 3-week period of either scheduled reduced smoking, nonscheduled reduced smoking, scheduled nonreduced smoking, or nonscheduled, nonreduced smoking. After one year, the scheduled reduced group performed the best, and the nonscheduled reduced group the worst. Both scheduled groups performed…
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.
75 FR 10018 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1
Federal Register 2010, 2011, 2012, 2013, 2014
2010-03-04
... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income..., Deductions, Credits, etc. (Schedule K-1). OMB Number: 1545-0092. Form Number: 1041 and related Schedules D, J...
A survey of planning and scheduling research at the NASA Ames Research Center
NASA Technical Reports Server (NTRS)
Zweben, Monte
1988-01-01
NASA Ames Research Center has a diverse program in planning and scheduling. This paper highlights some of our research projects as well as some of our applications. Topics addressed include machine learning techniques, action representations and constraint-based scheduling systems. The applications discussed are planetary rovers, Hubble Space Telescope scheduling, and Pioneer Venus orbit scheduling.
Code of Federal Regulations, 2013 CFR
2013-01-01
... reports of exports and imports of Schedule 2 chemicals—(1) Declarations. A Schedule 2 plant site that is declared because it produced, processed or consumed a Schedule 2 chemical at one or more plants above the... plant site that same Schedule 2 chemical above the applicable threshold, must submit export and import...
Code of Federal Regulations, 2014 CFR
2014-01-01
... reports of exports and imports of Schedule 2 chemicals—(1) Declarations. A Schedule 2 plant site that is declared because it produced, processed or consumed a Schedule 2 chemical at one or more plants above the... plant site that same Schedule 2 chemical above the applicable threshold, must submit export and import...
Code of Federal Regulations, 2012 CFR
2012-01-01
... reports of exports and imports of Schedule 2 chemicals—(1) Declarations. A Schedule 2 plant site that is declared because it produced, processed or consumed a Schedule 2 chemical at one or more plants above the... plant site that same Schedule 2 chemical above the applicable threshold, must submit export and import...
28 CFR 2.219 - Maximum terms of imprisonment and supervised release.
Code of Federal Regulations, 2011 CFR
2011-07-01
... other than above (e.g., marijuana/hashish), or schedule III drugs 3 years 2 years. If schedule IV drugs... PCP 5 years 3 years. If schedule I or II drugs other than above (e.g., marijuana, hashish....g., marijuana, hashish), or schedule III or IV drugs 3 years 2 years. If schedule V drugs 3 years 1...
28 CFR 2.219 - Maximum terms of imprisonment and supervised release.
Code of Federal Regulations, 2013 CFR
2013-07-01
... other than above (e.g., marijuana/hashish), or schedule III drugs 3 years 2 years. If schedule IV drugs... PCP 5 years 3 years. If schedule I or II drugs other than above (e.g., marijuana, hashish....g., marijuana, hashish), or schedule III or IV drugs 3 years 2 years. If schedule V drugs 3 years 1...
28 CFR 2.219 - Maximum terms of imprisonment and supervised release.
Code of Federal Regulations, 2012 CFR
2012-07-01
... other than above (e.g., marijuana/hashish), or schedule III drugs 3 years 2 years. If schedule IV drugs... PCP 5 years 3 years. If schedule I or II drugs other than above (e.g., marijuana, hashish....g., marijuana, hashish), or schedule III or IV drugs 3 years 2 years. If schedule V drugs 3 years 1...
28 CFR 2.219 - Maximum terms of imprisonment and supervised release.
Code of Federal Regulations, 2014 CFR
2014-07-01
... other than above (e.g., marijuana/hashish), or schedule III drugs 3 years 2 years. If schedule IV drugs... PCP 5 years 3 years. If schedule I or II drugs other than above (e.g., marijuana, hashish....g., marijuana, hashish), or schedule III or IV drugs 3 years 2 years. If schedule V drugs 3 years 1...
28 CFR 2.219 - Maximum terms of imprisonment and supervised release.
Code of Federal Regulations, 2010 CFR
2010-07-01
... other than above (e.g., marijuana/hashish), or schedule III drugs 3 years 2 years. If schedule IV drugs... PCP 5 years 3 years. If schedule I or II drugs other than above (e.g., marijuana, hashish....g., marijuana, hashish), or schedule III or IV drugs 3 years 2 years. If schedule V drugs 3 years 1...
Integrated planning and scheduling for Earth science data processing
NASA Technical Reports Server (NTRS)
Boddy, Mark; White, Jim; Goldman, Robert; Short, Nick, Jr.
1995-01-01
Several current NASA programs such as the EOSDIS Core System (ECS) have data processing and data management requirements that call for an integrated planning and scheduling capability. In this paper, we describe the experience of applying advanced scheduling technology operationally, in terms of what was accomplished, lessons learned, and what remains to be done in order to achieve similar successes in ECS and other programs. We discuss the importance and benefits of advanced scheduling tools, and our progress toward realizing them, through examples and illustrations based on ECS requirements. The first part of the paper focuses on the Data Archive and Distribution (DADS) V0 Scheduler. We then discuss system integration issues ranging from communication with the scheduler to the monitoring of system events and re-scheduling in response to them. The challenge of adapting the scheduler to domain-specific features and scheduling policies is also considered. Extrapolation to the ECS domain raises issues of integrating scheduling with a product-generation planner (such as PlaSTiC), and implementing conditional planning in an operational system. We conclude by briefly noting ongoing technology development and deployment projects being undertaken by HTC and the ISTB.
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Steven S.
1996-01-01
This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.
Diverse task scheduling for individualized requirements in cloud manufacturing
NASA Astrophysics Data System (ADS)
Zhou, Longfei; Zhang, Lin; Zhao, Chun; Laili, Yuanjun; Xu, Lida
2018-03-01
Cloud manufacturing (CMfg) has emerged as a new manufacturing paradigm that provides ubiquitous, on-demand manufacturing services to customers through network and CMfg platforms. In CMfg system, task scheduling as an important means of finding suitable services for specific manufacturing tasks plays a key role in enhancing the system performance. Customers' requirements in CMfg are highly individualized, which leads to diverse manufacturing tasks in terms of execution flows and users' preferences. We focus on diverse manufacturing tasks and aim to address their scheduling issue in CMfg. First of all, a mathematical model of task scheduling is built based on analysis of the scheduling process in CMfg. To solve this scheduling problem, we propose a scheduling method aiming for diverse tasks, which enables each service demander to obtain desired manufacturing services. The candidate service sets are generated according to subtask directed graphs. An improved genetic algorithm is applied to searching for optimal task scheduling solutions. The effectiveness of the scheduling method proposed is verified by a case study with individualized customers' requirements. The results indicate that the proposed task scheduling method is able to achieve better performance than some usual algorithms such as simulated annealing and pattern search.
A meta-heuristic method for solving scheduling problem: crow search algorithm
NASA Astrophysics Data System (ADS)
Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi
2018-04-01
Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.
Spike: Artificial intelligence scheduling for Hubble space telescope
NASA Technical Reports Server (NTRS)
Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert
1990-01-01
Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.
Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure
NASA Astrophysics Data System (ADS)
Matyska, Ludek; Ruda, Miroslav; Toth, Simon
For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.
24 CFR 982.517 - Utility allowance schedule.
Code of Federal Regulations, 2013 CFR
2013-04-01
... percent or more in the utility rate since the last time the utility allowance schedule was revised. The... allowance schedule to correct any errors, or as necessary to update the schedule. (d) Use of utility...
24 CFR 982.517 - Utility allowance schedule.
Code of Federal Regulations, 2012 CFR
2012-04-01
... percent or more in the utility rate since the last time the utility allowance schedule was revised. The... allowance schedule to correct any errors, or as necessary to update the schedule. (d) Use of utility...
24 CFR 982.517 - Utility allowance schedule.
Code of Federal Regulations, 2014 CFR
2014-04-01
... percent or more in the utility rate since the last time the utility allowance schedule was revised. The... allowance schedule to correct any errors, or as necessary to update the schedule. (d) Use of utility...
Data transmission system and method
NASA Technical Reports Server (NTRS)
Bruck, Jehoshua (Inventor); Langberg, Michael (Inventor); Sprintson, Alexander (Inventor)
2010-01-01
A method of transmitting data packets, where randomness is added to the schedule. Universal broadcast schedules using encoding and randomization techniques are also discussed, together with optimal randomized schedules and an approximation algorithm for finding near-optimal schedules.
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.
Klerman, Elizabeth B; Beckett, Scott A; Landrigan, Christopher P
2016-09-13
In 2011 the U.S. Accreditation Council for Graduate Medical Education began limiting first year resident physicians (interns) to shifts of ≤16 consecutive hours. Controversy persists regarding the effectiveness of this policy for reducing errors and accidents while promoting education and patient care. Using a mathematical model of the effects of circadian rhythms and length of time awake on objective performance and subjective alertness, we quantitatively compared predictions for traditional intern schedules to those that limit work to ≤ 16 consecutive hours. We simulated two traditional schedules and three novel schedules using the mathematical model. The traditional schedules had extended duration work shifts (≥24 h) with overnight work shifts every second shift (including every third night, Q3) or every third shift (including every fourth night, Q4) night; the novel schedules had two different cross-cover (XC) night team schedules (XC-V1 and XC-V2) and a Rapid Cycle Rotation (RCR) schedule. Predicted objective performance and subjective alertness for each work shift were computed for each individual's schedule within a team and then combined for the team as a whole. Our primary outcome was the amount of time within a work shift during which a team's model-predicted objective performance and subjective alertness were lower than that expected after 16 or 24 h of continuous wake in an otherwise rested individual. The model predicted fewer hours with poor performance and alertness, especially during night-time work hours, for all three novel schedules than for either the traditional Q3 or Q4 schedules. Three proposed schedules that eliminate extended shifts may improve performance and alertness compared with traditional Q3 or Q4 schedules. Predicted times of worse performance and alertness were at night, which is also a time when supervision of trainees is lower. Mathematical modeling provides a quantitative comparison approach with potential to aid residency programs in schedule analysis and redesign.
Vaccinating my way--use of alternative vaccination schedules in New York State.
Nadeau, Jessica A; Bednarczyk, Robert A; Masawi, Munyaradzi R; Meldrum, Megan D; Santilli, Loretta; Zansky, Shelley M; Blog, Debra S; Birkhead, Guthrie S; McNutt, Louise-Anne
2015-01-01
To identify children vaccinated following an alternative vaccine schedule using immunization information system data and determine the impact of alternative schedule use on vaccine coverage. Children born in New York State, outside New York City, between January 1, 2009 and August 14, 2011 were assessed for vaccination patterns consistent with use of an alternative schedule. Children who by 9 months of age had at least 3 vaccination visits recorded in the statewide mandatory immunization information system after 41 days of age were classified as either attempting to conform to the Centers for Disease Control and Prevention published recommended vaccination schedule or an alternative schedule. The number of vaccination visits and up-to-date status at age 9 months were compared between groups. Of the 222 628 children studied, the proportion of children following an alternative schedule was 25%. These children were significantly less likely to be up-to-date at age 9 months (15%) compared with those conforming to the routine schedule (90%, P < .05). Children following an alternative schedule on average had about 2 extra vaccine visits compared with children following a routine schedule (P < .05). Almost 1 in 4 children in this study appear to be intentionally deviating from the routine schedule. Intentional deviation leads to poor vaccination coverage leaving children vulnerable to infection and increasing the potential for vaccine-preventable disease outbreaks. Copyright © 2015 Elsevier Inc. All rights reserved.
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.;
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.
19 CFR 162.45a - Summary forfeiture of Schedule I and Schedule II controlled substances.
Code of Federal Regulations, 2010 CFR
2010-04-01
... OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY (CONTINUED) INSPECTION, SEARCH, AND SEIZURE....S.C. 965. Accordingly, in the case of a seizure of Schedule I or Schedule II controlled substances...
SMART operational field test evaluation : schedule adherence report : final report
DOT National Transportation Integrated Search
1997-06-01
Among the paratransit (termed Community Transit within SMART) performance indicators likely to be affected by SMARTs implementation of automated scheduling and dispatch (ASD) is schedule adherence. Schedule adherence refers to a variety of measure...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-11-30
... rehabilitation tax credit more attractive for small projects. In setting the revised fee schedule as initially... schedule appearing below. The fee schedule and instructions concerning the same may also be obtained...
Distributed Processor/Memory Architectures Design Program
1975-02-01
Event Scheduling Plo 31 Globat LAl Message Input Event Sicheduling Fhou ..... ............... 106 32 It tc Iata Representation...298 138 GEX LEX Scheduling Phlmophy ....... ...................... 300 139 Executive Comirol Herarchy... Scheduler Subroutine lnterrelatiomhips . ..... ................. 312 145 Task Scheduler Message Scatuer. . ...... ....................... 315 146
Planning as a Precursor to Scheduling for Space Station Payload Operations
NASA Technical Reports Server (NTRS)
Howell, Eric; Maxwell, Theresa
1995-01-01
Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.
Factors Associated With Pediatrician Responses to Alternative Immunization Schedule Requests.
Mohanty, Salini; Feemster, Kristen A; Buttenheim, Alison; Moser, Charlotte A; Field, Robert I; Mayer, Whitney; Carroll-Scott, Amy
2018-02-01
We conducted a cross-sectional online survey among 4 chapters of the American Academy of Pediatrics from July through October 2014 to describe characteristics of pediatricians and practices associated with practice-level responses to alternative immunization schedule requests. Among 374 pediatricians, 58% reported frequent alternative immunization schedule requests and 24% reported feeling comfortable using them. Pediatricians who work in practices that accommodate alternative immunization schedule requests have increased odds of having a high frequency of alternative immunization schedule requests, and beliefs that relationships with families would be negatively affected if they refused requests. Practices that discontinue care to families who request alternative immunization schedules have increased odds of being a private group practice and having a formal office vaccine policy. Pediatricians are frequently asked to use alternative immunization schedules and many are not comfortable using them. Practice-level responses to alternative immunization schedules are associated with characteristics of pediatricians and practices.
Space network scheduling benchmark: A proof-of-concept process for technology transfer
NASA Technical Reports Server (NTRS)
Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy
1993-01-01
This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.
Campos, Claudia; Leon, Yanerys; Sleiman, Andressa; Urcuyo, Beatriz
2017-03-01
One potential limitation of functional communication training (FCT) is that after the functional communication response (FCR) is taught, the response may be emitted at high rates or inappropriate times. Thus, schedule thinning is often necessary. Previous research has demonstrated that multiple schedules can facilitate schedule thinning by establishing discriminative control of the communication response while maintaining low rates of problem behavior. To date, most applied research evaluating the clinical utility of multiple schedules has done so in the context of behavior maintained by positive reinforcement (e.g., attention or tangible items). This study examined the use of a multiple schedule with alternating Fixed Ratio (FR 1)/extinction (EXT) components for two individuals with developmental disabilities who emitted escape-maintained problem behavior. Although problem behavior remained low during all FCT and multiple schedule phases, the use of the multiple schedule alone did not result in discriminated manding.
NASA Technical Reports Server (NTRS)
Hall, Brendan (Inventor); Bonk, Ted (Inventor); Varadarajan, Srivatsan (Inventor); Smithgall, William Todd (Inventor); DeLay, Benjamin F. (Inventor)
2017-01-01
Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.
Spike: AI scheduling for Hubble Space Telescope after 18 months of orbital operations
NASA Technical Reports Server (NTRS)
Johnston, Mark D.
1992-01-01
This paper is a progress report on the Spike scheduling system, developed by the Space Telescope Science Institute for long-term scheduling of Hubble Space Telescope (HST) observations. Spike is an activity-based scheduler which exploits artificial intelligence (AI) techniques for constraint representation and for scheduling search. The system has been in operational use since shortly after HST launch in April 1990. Spike was adopted for several other satellite scheduling problems; of particular interest was the demonstration that the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. We describe the recent progress made in scheduling search techniques, the lessons learned from early HST operations, and the application of Spike to other problem domains. We also describe plans for the future evolution of the system.
Preference for locus of punishment in a response sequence1
Dardano, J. F.
1972-01-01
Food-deprived pigeons pecked a key under a schedule in which grain was made available after the seventieth peck. In each sequence of 70 responses, either the first, middle, or final response was followed by electric shock. Before the first response of each sequence, each response on a second key changed the color of the food key and the schedule of shock that was correlated with the food key color. Each pigeon preferred a schedule of shock, in that each of the three shock schedules did not occur equally often. The preferred shock schedule and the strength of the preference varied among the pigeons. The overall rate of responding by a pigeon under a given shock schedule was directly related to the pigeon's relative preference for that schedule, except when shock after the first response in the sequence was the most preferred schedule. PMID:16811588
SPIKE: AI scheduling techniques for Hubble Space Telescope
NASA Astrophysics Data System (ADS)
Johnston, Mark D.
1991-09-01
AI (Artificial Intelligence) scheduling techniques for HST are presented in the form of the viewgraphs. The following subject areas are covered: domain; HST constraint timescales; HTS scheduling; SPIKE overview; SPIKE architecture; constraint representation and reasoning; use of suitability functions by scheduling agent; SPIKE screen example; advantages of suitability function framework; limiting search and constraint propagation; scheduling search; stochastic search; repair methods; implementation; and status.
14 CFR 291.44 - BTS Schedule P-12(a), Fuel Consumption by Type of Service and Entity.
Code of Federal Regulations, 2011 CFR
2011-01-01
... TRANSPORTATION Reporting Rules § 291.44 BTS Schedule P-12(a), Fuel Consumption by Type of Service and Entity. (a) For the purposes of BTS schedule P-12(a), type of service shall be either scheduled service or... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false BTS Schedule P-12(a), Fuel Consumption by...
Martin, Jeanne Sophie; Gaudreault, Michael M; Perron, Michel; Laberge, Luc
2016-04-01
Adolescent maturation is associated with delays of the endogenous circadian phase. Consequently, early school schedules may lead to a mismatch between internal and external time, which can be detrimental to adolescent sleep and health. In parallel, chronotype is known to play a role in adolescent health; evening chronotype adolescents are at higher risk for sleep problems and lower academic achievement. In the summer of 2008, Kénogami High School (Saguenay, Canada) was destroyed by fire. Kénogami students were subsequently relocated to Arvida High School (situated 5.3 km away) for the 2008-2009 academic year. A dual school schedule was implemented, with Arvida students attending a morning schedule (0740-1305 h) and Kénogami students an afternoon schedule (1325-1845 h). This study aimed to investigate the effects of such school schedules and chronotype on sleep, light exposure, and daytime functioning. Twenty-four morning and 33 afternoon schedule students wore an actigraph during 7 days to measure sleep and light exposure. Academic achievement was obtained from school. Subjects completed validated questionnaires on daytime sleepiness, psychological distress, social rhythms, school satisfaction, alcohol, and chronotype. Overall, afternoon schedule students had longer sleep duration, lower sleepiness, and lower light exposure than morning schedule students. Evening chronotypes (E-types) reported higher levels of sleepiness than morning chronotypes (M-types) in both morning and afternoon schedules. Furthermore, M-types attending the morning schedule reported higher sleepiness than M-types attending the afternoon schedule. No difference was found between morning and afternoon schedule students with regard to academic achievement, psychological distress, social rhythms, school satisfaction, and alcohol consumption. However, in both schedules, M-type had more regular social rhythms and lower alcohol consumption. In summary, this study emphasizes that an early school schedule is associated with detrimental effects in terms of sleep deprivation and daytime sleepiness, even for M-types. Furthermore, irrespective of school schedule, E-type adolescents face an increased risk for poor daytime functioning. © 2016 The Author(s).
NASA Astrophysics Data System (ADS)
Arons-Polan, Bonnie
This study examined the effect of three schedule types on student achievement in Advanced Placement Biology classes. AP Biology test scores from students on three types of full-year schedules were analyzed to assess the impact schedule type had on student achievement. The three schedules included the block and traditional schedules, and the rotating/hybrid, a blend of the former two schedules. The results indicated the variable most closely associated with success on the AP Biology exam was the length of experience the teachers had teaching the course, regardless of schedule type. Although significant differences were seen in mean AP Biology test scores among the three schedule types, this could be explained by the relationship between instructors' experience and schedule type. Regression analysis determined the two strongest predictors of successful performance on the AP Biology exam were instructors' experience and perceived teaching style, regardless of schedule type. It appears that the economically developed suburbs, had teachers with the largest amount of experience teaching AP Biology, and these teachers reported using a direct approach to teaching, using lecture greater than 50% of the time. The results of this study also suggest when restructuring to improve student achievement, educators should examine other variables in addition to the high school schedule. Restructuring the day to allow for longer classes must be accompanied by professional staff development to allow teachers to develop new teaching methods. Most of the teachers in the survey reported using lecture a great deal of the time, regardless of schedule type. Comments from the teachers from the various schedules revealed that the ability to add student centered, inquiry based activities and labs were dependent on adequate class time. No information on whether or not the teachers were given professional development to expand their repertoire of teaching methods when the school adopted a block or rotating hybrid schedule was obtained. Limitations to this study include the fact that there was no independent verification of teaching style as reported by the teachers in this study. This study involved only Advanced Placement Biology classes, so no generalizations can be made to other science classes.
Request-Driven Schedule Automation for the Deep Space Network
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Call, Jared; Mercado, Marisol
2010-01-01
The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.
Hoffmeister, F
1980-01-01
Rhesus monkeys were trained to complete three multiple schedules. The schedules consisted of three components: a fixed interval (component 1), a variable interval (component 2), and a fixed ratio (component 3). During components 1 and 2, pressing lever 1 was always reinforced by food delivery. During component 3, pressing lever 2 resulted in either food delivery or intravenous infusions of saline solution, solutions of cocaine, of d-amphetamine, of phenmetrazine, or fenetylline. In schedule I, animals were presented with all three components independent of key-pressing behavior during components 1 and 2. In schedule II the availability of component 2 was dependent on completion of component 1. Component 3 was made available only on completion of component 2. Noncompletion of components 1 or 2 resulted in time-out of 15 and 10 min, respectively. Schedule III was identical with schedule II, except that in schedule III the completion of components was indicated only by a change in the lever lights. The influence of self-administered drugs on behavior in all three components was evaluated. Self-administration of psychomotor stimulants impaired the performance of animals and delayed completion of components 1 and 2 of schedules I, II, and III. The effects on behavior were similar with low drug intake in schedule III, moderate intake in schedule II, and high drug intake in schedule I. These effects were strong with self-administration of phenmetrazine, moderate with self-administration of cocaine and d-amphetamine, and weak with self-administration of fenetylline.
48 CFR 538.7001 - Definitions.
Code of Federal Regulations, 2010 CFR
2010-10-01
... used in this subpart, means Schedule 70 information technology contracts, and Consolidated Products and Services Schedule contracts containing information technology SINs. The Consolidated Products and Services... Purchasing. No other Schedules, or SINs, containing information technology outside of Schedule 70 SINs, and...
Real-time subway information for improving transit ridership.
DOT National Transportation Integrated Search
2016-08-01
In recent years, the standardization of transit schedule information has yielded a dramatic increase in the accessibility of computerized transit schedules and given rise to real-time service schedules. Two such real-time service schedules are the Ge...
48 CFR 538.7001 - Definitions.
Code of Federal Regulations, 2011 CFR
2011-10-01
... used in this subpart, means Schedule 70 information technology contracts, and Consolidated Products and Services Schedule contracts containing information technology SINs. The Consolidated Products and Services... Purchasing. No other Schedules, or SINs, containing information technology outside of Schedule 70 SINs, and...
48 CFR 538.7001 - Definitions.
Code of Federal Regulations, 2012 CFR
2012-10-01
... used in this subpart, means Schedule 70 information technology contracts, and Consolidated Products and Services Schedule contracts containing information technology SINs. The Consolidated Products and Services... Purchasing. No other Schedules, or SINs, containing information technology outside of Schedule 70 SINs, and...
48 CFR 538.7001 - Definitions.
Code of Federal Regulations, 2013 CFR
2013-10-01
... used in this subpart, means Schedule 70 information technology contracts, and Consolidated Products and Services Schedule contracts containing information technology SINs. The Consolidated Products and Services... Purchasing. No other Schedules, or SINs, containing information technology outside of Schedule 70 SINs, and...
48 CFR 538.7001 - Definitions.
Code of Federal Regulations, 2014 CFR
2014-10-01
... used in this subpart, means Schedule 70 information technology contracts, and Consolidated Products and Services Schedule contracts containing information technology SINs. The Consolidated Products and Services... Purchasing. No other Schedules, or SINs, containing information technology outside of Schedule 70 SINs, and...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-12-11
...; Information Collection; Schedules for Construction Contracts AGENCIES: Department of Defense (DOD), General... approved information collection requirement concerning schedules for construction contracts. Public...: Submit comments identified by Information Collection 9000- 0058, Schedules for Construction Contracts by...
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.
Code of Federal Regulations, 2011 CFR
2011-10-01
... authorize other agencies to award schedule contracts and publish schedules. For example, the Department of... CONTRACTING FEDERAL SUPPLY SCHEDULE CONTRACTING Federal Supply Schedule Program 38.101 General. (a) The... discounts. Indefinite-delivery contracts are awarded using competitive procedures to firms. The firms...
Analysis of sequencing and scheduling methods for arrival traffic
NASA Technical Reports Server (NTRS)
Neuman, Frank; Erzberger, Heinz
1990-01-01
The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.
THE EFFECTS OF FIXED VERSUS ESCALATING REINFORCEMENT SCHEDULES ON SMOKING ABSTINENCE
Romanowich, Paul; Lamb, R. J.
2015-01-01
Studies indicate that when abstinence is initiated, escalating reinforcement schedules maintain continuous abstinence longer than fixed reinforcement schedules. However, these studies were conducted for shorter durations than most clinical trials and also resulted in larger reinforcer value for escalating participants during the 1st week of the experiment. We tested whether escalating reinforcement schedules maintained abstinence longer than fixed reinforcement schedules in a 12-week clinical trial. Smokers (146) were randomized to an escalating reinforcement schedule, a fixed reinforcement schedule, or a control condition. Escalating reinforcement participants received $5.00 for their first breath carbon monoxide (CO) sample <3 ppm, with a $0.50 increase for each consecutive sample. Fixed reinforcement participants received $19.75 for each breath CO sample <3 ppm. Control participants received payments only for delivering a breath CO sample. Similar proportions of escalating and fixed reinforcement participants met the breath CO criterion at least once. Escalating reinforcement participants maintained criterion breath CO levels longer than fixed reinforcement and control participants. Similar to previous short-term studies, escalating reinforcement schedules maintained longer durations of abstinence than fixed reinforcement schedules during a clinical trial. PMID:25640764
Project Scheduling Based on Risk of Gas Transmission Pipe
NASA Astrophysics Data System (ADS)
Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.
2018-03-01
The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.
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.
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.
Kosmadopoulos, Anastasi; Sargent, Charli; Darwent, David; Zhou, Xuan; Dawson, Drew; Roach, Gregory D
2014-12-01
Extended wakefulness, sleep loss, and circadian misalignment are factors associated with an increased accident risk in shiftwork. Splitting shifts into multiple shorter periods per day may mitigate these risks by alleviating prior wake. However, the effect of splitting the sleep-wake schedule on the homeostatic and circadian contributions to neurobehavioural performance and subjective assessments of one's ability to perform are not known. Twenty-nine male participants lived in a time isolation laboratory for 13 d, assigned to one of two 28-h forced desynchrony (FD) schedules. Depending on the assigned schedule, participants were provided the same total time in bed (TIB) each FD cycle, either consolidated into a single period (9.33 h TIB) or split into two equal halves (2 × 4.67 h TIB). Neurobehavioural performance was regularly assessed with a psychomotor vigilance task (PVT) and subjectively-assessed ability was measured with a prediction of performance on a visual analogue scale. Polysomnography was used to assess sleep, and core body temperature was recorded to assess circadian phase. On average, participants obtained the same amount of sleep in both schedules, but those in the split schedule obtained more slow wave sleep (SWS) on FD days. Mixed-effects ANOVAs indicated no overall difference between the standard and split schedules in neurobehavioural performance or predictions of performance. Main effects of circadian phase and prior wake were present for both schedules, such that performance and subjective ratings of ability were best around the circadian acrophase, worst around the nadir, and declined with increasing prior wake. There was a schedule by circadian phase interaction for all neurobehavioural performance metrics such that performance was better in the split schedule than the standard schedule around the nadir. There was no such interaction for predictions of performance. Performance during the standard schedule was significantly better than the split schedule at 2 h of prior wake, but declined at a steeper rate such that the schedules converged by 4.5-7 h of prior wake. Overall, the results indicate that when the total opportunity for sleep per day is satisfactory, a split sleep-wake schedule is not detrimental to sleep or performance. Indeed, though not reflected in subjective assessments of performance capacity, splitting the schedule may be of some benefit, given its reduction of neurobehavioural impairment at night and its association with increased SWS. Therefore, for some industries that require operations to be sustained around the clock, implementing a split work-rest schedule may be of assistance.
7 CFR 305.23 - Steam sterilization treatment schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 5 2010-01-01 2010-01-01 false Steam sterilization treatment schedules. 305.23... HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Heat Treatments § 305.23 Steam sterilization treatment schedules. Treatment schedule Temperature( °F) Pressure Exposure period...
48 CFR 538.270 - Evaluation of multiple award schedule (MAS) offers.
Code of Federal Regulations, 2010 CFR
2010-10-01
... SERVICES ADMINISTRATION SPECIAL CATEGORIES OF CONTRACTING FEDERAL SUPPLY SCHEDULE CONTRACTING Establishing and Administering Federal Supply Schedules 538.270 Evaluation of multiple award schedule (MAS) offers... determining the Government's price negotiation objectives, consider the following factors: (1) Aggregate...
Testing Task Schedulers on Linux System
NASA Astrophysics Data System (ADS)
Jelenković, Leonardo; Groš, Stjepan; Jakobović, Domagoj
Testing task schedulers on Linux operating system proves to be a challenging task. There are two main problems. The first one is to identify which properties of the scheduler to test. The second problem is how to perform it, e.g., which API to use that is sufficiently precise and in the same time supported on most platforms. This paper discusses the problems in realizing test framework for testing task schedulers and presents one potential solution. Observed behavior of the scheduler is the one used for “normal” task scheduling (SCHED_OTHER), unlike one used for real-time tasks (SCHED_FIFO, SCHED_RR).
Constraint monitoring in TOSCA
NASA Technical Reports Server (NTRS)
Beck, Howard
1992-01-01
The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.
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.
Creative employee scheduling in the health information management department.
Hyde, C S
1998-02-01
What effect do schedules have on employees and department activities? Negative effects such as backlogs, poor employee morale, and absenteeism may be due to scheduling practices currently in place. The value of effective employee scheduling practices may be seen in areas of improved productivity. The process of developing schedules should include assessing department areas, understanding operational needs, choosing an option, and implementation. Finding a schedule that meets the needs of managers as well as those of the employees is rewarding. It is a win-win situation, and the benefits can yield increased productivity, decreased turnover, and higher morale.
Robinson, Candice L; Romero, José R; Kempe, Allison; Pellegrini, Cynthia; Szilagyi, Peter
2018-02-09
In October 2017, the Advisory Committee on Immunization Practices (ACIP) approved the Recommended Immunization Schedule for Children and Adolescents Aged 18 Years or Younger - United States, 2018. The 2018 child and adolescent immunization schedule summarizes ACIP recommendations, including several changes from the 2017 immunization schedules, in three figures and footnotes to the figures. These documents can be found on the CDC immunization schedule website (https://www.cdc.gov/vaccines/schedules/index.html). These immunization schedules are approved by ACIP (https://www.cdc.gov/vaccines/acip/index.html), the American Academy of Pediatrics (https://www.aap.org), the American Academy of Family Physicians (https://www.aafp.org), and the American College of Obstetricians and Gynecologists (https://www.acog.org). Health care providers are advised to use the figures and the footnotes together. The full ACIP recommendations for each vaccine, including contraindications and precautions, can be found at https://www.cdc.gov/vaccines/hcp/acip-recs/index.html. Providers should be aware that changes in recommendations for specific vaccines can occur between annual updates to the childhood/adolescent immunization schedules. If errors or omissions are discovered within the child and adolescent schedule, CDC posts revised versions on the CDC immunization schedule website.
Robinson, Candice L; Romero, José R; Kempe, Allison; Pellegrini, Cynthia
2017-02-10
In October 2016, the Advisory Committee on Immunization Practices (ACIP) approved the Recommended Immunization Schedule for Children and Adolescents Aged 18 Years or Younger-United States, 2017. The 2017 child and adolescent immunization schedule summarizes ACIP recommendations, including several changes from the 2016 immunization schedules, in three figures, and footnotes for the figures. These documents can be found on the CDC immunization schedule website (https://www.cdc.gov/vaccines/schedules/index.html). These immunization schedules are approved by ACIP (https://www.cdc.gov/vaccines/acip/index.html), the American Academy of Pediatrics (https://www.aap.org), the American Academy of Family Physicians (https://www.aafp.org), and the American College of Obstetricians and Gynecologists (http://www.acog.org). Health care providers are advised to use the figures and the combined footnotes together. The full ACIP recommendations for each vaccine, including contraindications and precautions, can be found at https://www.cdc.gov/vaccines/hcp/acip-recs/index.html. Providers should be aware that changes in recommendations for specific vaccines can occur between annual updates to the childhood/adolescent immunization schedules. If errors or omissions are discovered within the child and adolescent schedule, CDC posts revised versions on the CDC immunization schedule website.
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.
Long-Term Effectiveness of Accelerated Hepatitis B Vaccination Schedule in Drug Users
Shah, Dimpy P.; Grimes, Carolyn Z.; Nguyen, Anh T.; Lai, Dejian
2015-01-01
Objectives. We demonstrated the effectiveness of an accelerated hepatitis B vaccination schedule in drug users. Methods. We compared the long-term effectiveness of accelerated (0–1–2 months) and standard (0–1–6 months) hepatitis B vaccination schedules in preventing hepatitis B virus (HBV) infections and anti-hepatitis B (anti-HBs) antibody loss during 2-year follow-up in 707 drug users (HIV and HBV negative at enrollment and completed 3 vaccine doses) from February 2004 to October 2009. Results. Drug users in the accelerated schedule group had significantly lower HBV infection rates, but had a similar rate of anti-HBs antibody loss compared with the standard schedule group over 2 years of follow-up. No chronic HBV infections were observed. Hepatitis C positivity at enrollment and age younger than 40 years were independent risk factors for HBV infection and antibody loss, respectively. Conclusions. An accelerated vaccination schedule was more preferable than a standard vaccination schedule in preventing HBV infections in drug users. To overcome the disadvantages of a standard vaccination schedule, an accelerated vaccination schedule should be considered in drug users with low adherence. Our study should be repeated in different cohorts to validate our findings and establish the role of an accelerated schedule in hepatitis B vaccination guidelines for drug users. PMID:25880946
Use of computerized interview scheduling program for pediatric surgery match applicants.
Stephens, Caroline Q; Hamilton, Nicholas A; Thompson, Ann E; Krishnaswami, Sanjay
2017-06-01
Pediatric surgery fellowship applicants and programs coordinate over 20 interviews per cycle. We hypothesized that replacing e-mail and phone communication with a computerized-scheduling program (CSP) could benefit both parties. We used a CSP to schedule 2016 interviews. Time to schedule and e-mail communication per applicant was compared to 2015, when traditional scheduling was used. Additionally, 2016 interviewees were surveyed about their experience with the CSP vs. traditional means. Analysis was performed using descriptive statistics and a Student's T-test. We found a significant decrease in mean scheduling time from 14.4 to 1.7h (p<0.001) and in e-mails exchanged from 3.4 to 1.0 (p<0.0001). Survey respondents reported 92% satisfaction with the CSP, and 87% found it easier to schedule interviews. Applicants also reported quicker finalization of interview dates (96%), improved access to interview slots (71%), and easier coordination of additional services and time off (63%). Notably, the mean longest time reported to schedule interviews using traditional methods was 7days (range 1-30). Overall, 84% supported widespread adoption of CSPs. Using CSPs improved the scheduling process for the significant majority of interviewees, and our program. If widely adopted, this could greatly improve the efficiency of pediatric surgery interview scheduling. N/A. Copyright © 2017 Elsevier Inc. All rights reserved.
NASA Technical Reports Server (NTRS)
Smith, Stephen F.; Pathak, Dhiraj K.
1991-01-01
In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.
48 CFR 208.405 - Ordering procedures for Federal Supply Schedules.
Code of Federal Regulations, 2014 CFR
2014-10-01
... Federal Supply Schedules. 208.405 Section 208.405 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES AND SERVICES Federal Supply Schedules 208.405 Ordering procedures for Federal Supply Schedules. In all orders...
Vehicle and driver scheduling for public transit.
DOT National Transportation Integrated Search
2009-08-01
The problem of driver scheduling involves the construction of a legal set of shifts, including allowance : of overtime, which cover the blocks in a particular vehicle schedule. A shift is the work scheduled to be performed by : a driver in one day, w...
NASA Astrophysics Data System (ADS)
Xie, Chang; Wen, Jing; Liu, Wenying; Wang, Jiaming
With the development of intelligent dispatching, the intelligence level of network control center full-service urgent need to raise. As an important daily work of network control center, the application of maintenance scheduling intelligent arrangement to achieve high-quality and safety operation of power grid is very important. By analyzing the shortages of the traditional maintenance scheduling software, this paper designs a power grid maintenance scheduling intelligence arrangement supporting system based on power flow forecasting, which uses the advanced technologies in maintenance scheduling, such as artificial intelligence, online security checking, intelligent visualization techniques. It implements the online security checking of maintenance scheduling based on power flow forecasting and power flow adjusting based on visualization, in order to make the maintenance scheduling arrangement moreintelligent and visual.
NASA Astrophysics Data System (ADS)
Leonardi, Marcelo
The primary purpose of this study was to examine the impact of a scheduling change from a trimester 4x4 block schedule to a modified hybrid schedule on student achievement in ninth grade biology courses. This study examined the impact of the scheduling change on student achievement through teacher created benchmark assessments in Genetics, DNA, and Evolution and on the California Standardized Test in Biology. The secondary purpose of this study examined the ninth grade biology teacher perceptions of ninth grade biology student achievement. Using a mixed methods research approach, data was collected both quantitatively and qualitatively as aligned to research questions. Quantitative methods included gathering data from departmental benchmark exams and California Standardized Test in Biology and conducting multiple analysis of covariance and analysis of covariance to determine significance differences. Qualitative methods include journal entries questions and focus group interviews. The results revealed a statistically significant increase in scores on both the DNA and Evolution benchmark exams. DNA and Evolution benchmark exams showed significant improvements from a change in scheduling format. The scheduling change was responsible for 1.5% of the increase in DNA benchmark scores and 2% of the increase in Evolution benchmark scores. The results revealed a statistically significant decrease in scores on the Genetics Benchmark exam as a result of the scheduling change. The scheduling change was responsible for 1% of the decrease in Genetics benchmark scores. The results also revealed a statistically significant increase in scores on the CST Biology exam. The scheduling change was responsible for .7% of the increase in CST Biology scores. Results of the focus group discussions indicated that all teachers preferred the modified hybrid schedule over the trimester schedule and that it improved student achievement.
Dosing Schedules for Pneumococcal Conjugate Vaccine
2014-01-01
Since second generation pneumococcal conjugate vaccines (PCVs) targeting 10 and 13 serotypes became available in 2010, the number of national policy makers considering these vaccines has steadily increased. An important consideration for a national immunization program is the timing and number of doses—the schedule—that will best prevent disease in the population. Data on disease epidemiology and the efficacy or effectiveness of PCV schedules are typically considered when choosing a schedule. Practical concerns, such as the existing vaccine schedule, and vaccine program performance are also important. In low-income countries, pneumococcal disease and deaths typically peak well before the end of the first year of life, making a schedule that provides PCV doses early in life (eg, a 6-, 10- and 14-week schedule) potentially the best option. In other settings, a schedule including a booster dose may address disease that peaks in the second year of life or may be seen to enhance a schedule already in place. A large and growing body of evidence from immunogenicity studies, as well as clinical trials and observational studies of carriage, pneumonia and invasive disease, has been systematically reviewed; these data indicate that schedules of 3 or 4 doses all work well, and that the differences between these regimens are subtle, especially in a mature program in which coverage is high and indirect (herd) effects help enhance protection provided directly by a vaccine schedule. The recent World Health Organization policy statement on PCVs endorsed a schedule of 3 primary doses without a booster or, as a new alternative, 2 primary doses with a booster dose. While 1 schedule may be preferred in a particular setting based on local epidemiology or practical considerations, achieving high coverage with 3 doses is likely more important than the specific timing of doses. PMID:24336059
Instructional versus schedule control of humans' choices in situations of diminishing returns
Hackenberg, Timothy D.; Joker, Veronica R.
1994-01-01
Four adult humans chose repeatedly between a fixed-time schedule (of points later exchangeable for money) and a progressive-time schedule that began at 0 s and increased by a fixed number of seconds with each point delivered by that schedule. Each point delivered by the fixed-time schedule reset the requirements of the progressive-time schedule to its minimum value. Subjects were provided with instructions that specified a particular sequence of choices. Under the initial conditions, the instructions accurately specified the optimal choice sequence. Thus, control by instructions and optimal control by the programmed contingencies both supported the same performance. To distinguish the effects of instructions from schedule sensitivity, the correspondence between the instructed and optimal choice patterns was gradually altered across conditions by varying the step size of the progressive-time schedule while maintaining the same instructions. Step size was manipulated, typically in 1-s units, first in an ascending and then in a descending sequence of conditions. Instructions quickly established control in all 4 subjects but, by narrowing the range of choice patterns, they reduced subsequent sensitivity to schedule changes. Instructional control was maintained across the ascending sequence of progressive-time values for each subject, but eventually diminished, giving way to more schedule-appropriate patterns. The transition from instruction-appropriate to schedule-appropriate behavior was characterized by an increase in the variability of choice patterns and local increases in point density. On the descending sequence of progressive-time values, behavior appeared to be schedule sensitive, sometimes even optimally sensitive, but it did not always change systematically with the contingencies, suggesting the involvement of other factors. PMID:16812747
Wu, Junjie; Waxman, David J.
2014-01-01
Metronomic cyclophosphamide (CPA) treatment activates robust innate anti-tumor immunity and induces major regression of large, implanted brain tumor xenografts when administered on an intermittent, every 6-day schedule, but not on a daily low-dose or a maximum-tolerated dose CPA schedule. Here, we used an implanted GL261 glioma model to compare five intermittent metronomic CPA schedules to elucidate the kinetics and schedule dependence of innate immune cell recruitment and tumor regression. Tumor-recruited natural killer cells induced by two every 6-day treatment cycles were significantly ablated one day after a third CPA treatment, but largely recovered several days later. Natural killer and other tumor-infiltrating innate immune cells peaked 12 days after the last CPA treatment on the every 6-day schedule, suggesting that drug-free intervals longer than 6 days may show increased efficacy. Metronomic CPA treatments spaced 9 or 12 days apart, or on an alternating 6 and 9 day schedule, induced extensive tumor regression, similar to the 6-day schedule, however, the tumor-infiltrating natural killer cell responses were not sustained, leading to rapid resumption of tumor regrowth after day 24, despite ongoing metronomic CPA treatment. Increasing the CPA dose prolonged the period of tumor regression on the every 9-day schedule, but natural killer cell activation was markedly decreased. Thus, while several intermittent metronomic CPA treatment schedules can activate innate immune cell recruitment leading to major tumor regression, sustained immune and anti-tumor responses are only achieved on the 6-day schedule. However, even with this schedule, some tumors eventually relapse, indicating a need for further improvements in immunogenic metronomic therapies. PMID:25069038
Design of an Aircrew Scheduling Decision Aid for the 6916th Electronic Security Squadron.
1987-06-01
Security Classification) Design of an Aircrew Scheduling Decision Aid for the 6916th Electronic Security Squadron 12. PERSONAL AUTHOR(S) Thomas J. Kopf...Because of the great number of possible scheduling alternatives, it is difficult to find an optimal solution to-the scheduling problem. Additionally...changes to the original schedule make it even more difficult to find an optimal solution. The emergence of capable microcompu- ters, decision support
VAXELN Experimentation: Programming a Real-Time Periodic Task Dispatcher Using VAXELN Ada 1.1
1987-11-01
synchronization to the SQM and VAXELN semaphores. Based on real-time scheduling theory, the optimal rate-monotonic scheduling algorithm [Lui 73...schedulability test based on the rate-monotonic algorithm , namely task-lumping [Sha 871, was necessary to cal- culate the theoretically expected schedulability...8217 Guide Digital Equipment Corporation, Maynard, MA, 1986. [Lui 73] Liu, C.L., Layland, J.W. Scheduling Algorithms for Multi-programming in a Hard-Real-Time
Strategies GeoCape Intelligent Observation Studies @ GSFC
NASA Technical Reports Server (NTRS)
Cappelaere, Pat; Frye, Stu; Moe, Karen; Mandl, Dan; LeMoigne, Jacqueline; Flatley, Tom; Geist, Alessandro
2015-01-01
This presentation provides information a summary of the tradeoff studies conducted for GeoCape by the GSFC team in terms of how to optimize GeoCape observation efficiency. Tradeoffs include total ground scheduling with simple priorities, ground scheduling with cloud forecast, ground scheduling with sub-area forecast, onboard scheduling with onboard cloud detection and smart onboard scheduling and onboard image processing. The tradeoffs considered optimzing cost, downlink bandwidth and total number of images acquired.
Long range science scheduling for the Hubble Space Telescope
NASA Technical Reports Server (NTRS)
Miller, Glenn; Johnston, Mark
1991-01-01
Observations with NASA's Hubble Space Telescope (HST) are scheduled with the assistance of a long-range scheduling system (SPIKE) that was developed using artificial intelligence techniques. In earlier papers, the system architecture and the constraint representation and propagation mechanisms were described. The development of high-level automated scheduling tools, including tools based on constraint satisfaction techniques and neural networks is described. The performance of these tools in scheduling HST observations is discussed.
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.
Ma, Cynthia; Mandrekar, Sumithra J; Alberts, Steven R; Croghan, Gary A; Jatoi, Aminah; Reid, Joel M; Hanson, Lorelei J; Bruzek, Laura; Tan, Angelina D; Pitot, Henry C; Erlichman, Charles; Wright, John J; Adjei, Alex A
2007-02-01
Bortezomib, a selective inhibitor of the 20S proteasome with activity in a variety of cancers, exhibits sequence-dependent synergistic cytotoxicity with taxanes and platinum agents. Two different treatment schedules of bortezomib in combination with paclitaxel and carboplatin were tested in this phase I study to evaluate the effects of scheduling on toxicities, pharmacodynamics and clinical activity. Patients with advanced malignancies were alternately assigned to receive (schedule A) paclitaxel and carboplatin (IV d1) followed by bortezomib (IV d2, d5, d8) or (schedule B) bortezomib (IV d1, d4, d8) followed by paclitaxel and carboplatin (IV d2) on a 21-day cycle. Fifty-three patients (A 25, B 28) were treated with a median of 3 cycles (range 1-8) for schedule A and 3.5 cycles (range 1-10) for schedule B. Grade 3 or higher treatment related hematologic adverse events in all cycles of treatment included neutropenia (A 52%, B 50%), anemia (A 12%, B 7.1%) and thrombocytopenia (A 16%, B 17.9%). Non-hematologic treatment related adverse events were fairly mild (primarily grades 1 and 2). The maximum tolerated dose and the recommended doses for future phase II trials are bortezomib 1.2 mg/m2, paclitaxel 135 mg/m2 and carboplatin AUC = 6 for schedule A and bortezomib 1.2 mg/m2, paclitaxel 175 mg/m2 and carboplatin AUC = 6 for schedule B. Six (21.4%) partial responses (PR) were seen with schedule B. In contrast, only 1 (4%) PR was achieved with schedule A. Similar proteasome inhibition was achieved at MTD for both schedules. Administration of sequential bortezomib followed by chemotherapy (schedule B) was well tolerated and associated with an encouraging number of objective responses in this small group of patients. Further studies with this administration schedule are warranted.
49 CFR 237.101 - Scheduling of bridge inspections.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 49 Transportation 4 2011-10-01 2011-10-01 false Scheduling of bridge inspections. 237.101 Section... ADMINISTRATION, DEPARTMENT OF TRANSPORTATION BRIDGE SAFETY STANDARDS Bridge Inspection § 237.101 Scheduling of bridge inspections. (a) Each bridge management program shall include a provision for scheduling an...
77 FR 63766 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-17
... DEPARTMENT OF JUSTICE Drug Enforcement Administration 21 CFR Part 1308 [Docket No. DEA-357] Schedules of Controlled Substances: Placement of Methylone Into Schedule I AGENCY: Drug Enforcement Administration, Department of Justice. ACTION: Notice of proposed rulemaking. SUMMARY: The Drug Enforcement...
77 FR 41258 - FOIA Fee Schedule Update
Federal Register 2010, 2011, 2012, 2013, 2014
2012-07-13
... DEFENSE NUCLEAR FACILITIES 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...
76 FR 43819 - FOIA Fee Schedule Update
Federal Register 2010, 2011, 2012, 2013, 2014
2011-07-22
... DEFENSE NUCLEAR FACILITIES 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...
49 CFR 237.101 - Scheduling of bridge inspections.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Scheduling of bridge inspections. 237.101 Section... ADMINISTRATION, DEPARTMENT OF TRANSPORTATION BRIDGE SAFETY STANDARDS Bridge Inspection § 237.101 Scheduling of bridge inspections. (a) Each bridge management program shall include a provision for scheduling an...
40 CFR 52.1425 - 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.1425 Section...) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Nebraska § 52.1425 Compliance schedules. (a) The compliance schedules for the sources identified below are approved as revisions to the plan...
Scheduling the future NASA Space Network: Experiences with a flexible scheduling prototype
NASA Technical Reports Server (NTRS)
Happell, Nadine; Moe, Karen L.; Minnix, Jay
1993-01-01
NASA's Space Network (SN) provides telecommunications and tracking services to low earth orbiting spacecraft. One proposal for improving resource allocation and automating conflict resolution for the SN is the concept of flexible scheduling. In this concept, each Payload Operations Control Center (POCC) will possess a Space Network User POCC Interface (SNUPI) to support the development and management of flexible requests. Flexible requests express the flexibility, constraints, and repetitious nature of the user's communications requirements. Flexible scheduling is expected to improve SN resource utilization and user satisfaction, as well as reduce the effort to produce and maintain a schedule. A prototype testbed has been developed to better understand flexible scheduling as it applies to the SN. This testbed consists of a SNUPI workstation, an SN scheduler, and a flexible request language that conveys information between the two systems. All three are being evaluated by operations personnel. Benchmark testing is being conducted on the scheduler to quantify the productivity improvements achieved with flexible requests.
Capriotti, Matthew R; Turkel, Jennifer E; Johnson, Rachel A; Espil, Flint M; Woods, Douglas W
2017-01-01
Chronic tic disorders (CTDs) involve motor and/or vocal tics that often cause substantial distress and impairment. Differential reinforcement of other behavior (DRO) schedules of reinforcement produce robust, but incomplete, reductions in tic frequency in youth with CTDs; however, a more robust reduction may be needed to affect durable clinical change. Standard, fixed-amount DRO schedules have not commonly yielded such reductions, so we evaluated a novel, progressive-amount DRO schedule, based on its ability to facilitate sustained abstinence from functionally similar behaviors. Five youth with CTDs were exposed to periods of baseline, fixed-amount DRO (DRO-F), and progressive-amount DRO (DRO-P). Both DRO schedules produced decreases in tic rate and increases in intertic interval duration, but no systematic differences were seen between the two schedules on any dimension of tic occurrence. The DRO-F schedule was generally preferred to the DRO-P schedule. Possible procedural improvements and other future directions are discussed. © 2016 Society for the Experimental Analysis of Behavior.
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.
Performance analysis of a large-grain dataflow scheduling paradigm
NASA Technical Reports Server (NTRS)
Young, Steven D.; Wills, Robert W.
1993-01-01
A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.
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.
NASA Technical Reports Server (NTRS)
Craft, R.; Dunn, C.; Mccord, J.; Simeone, L.
1980-01-01
A user guide and programmer documentation is provided for a system of PRIME 400 minicomputer programs. The system was designed to support loading analyses on the Tracking Data Relay Satellite System (TDRSS). The system is a scheduler for various types of data relays (including tape recorder dumps and real time relays) from orbiting payloads to the TDRSS. Several model options are available to statistically generate data relay requirements. TDRSS time lines (representing resources available for scheduling) and payload/TDRSS acquisition and loss of sight time lines are input to the scheduler from disk. Tabulated output from the interactive system includes a summary of the scheduler activities over time intervals specified by the user and overall summary of scheduler input and output information. A history file, which records every event generated by the scheduler, is written to disk to allow further scheduling on remaining resources and to provide data for graphic displays or additional statistical analysis.
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.
Phase I Design for Completely or Partially Ordered Treatment Schedules
Wages, Nolan A.; O’Quigley, John; Conaway, Mark R.
2013-01-01
The majority of methods for the design of Phase I trials in oncology are based upon a single course of therapy, yet in actual practice it may be the case that there is more than one treatment schedule for any given dose. Therefore, the probability of observing a dose-limiting toxicity (DLT) may depend upon both the total amount of the dose given, as well as the frequency with which it is administered. The objective of the study then becomes to find an acceptable combination of both dose and schedule. Past literature on designing these trials has entailed the assumption that toxicity increases monotonically with both dose and schedule. In this article, we relax this assumption for schedules and present a dose-schedule finding design that can be generalized to situations in which we know the ordering between all schedules and those in which we do not. We present simulation results that compare our method to other suggested dose-schedule finding methodology. PMID:24114957
FIRST FLOOR PLAN AND SCHEDULES. United Engineering Company Ltd., Alameda ...
FIRST FLOOR PLAN AND SCHEDULES. United Engineering Company Ltd., Alameda Shipyard, Ship Repair Facilities, Office Building. First floor plan, door transom schedule, interior finish schedule, sash schedule, exterior color schedule, and location plot plan. John Hudspeth, Architect, at foot of Main Street, Alameda, Calif. Sheet no. Al of 8 sheets, Plan no. 10,007. Scale 1/8 inch to the foot. March 18, 1942, last revised 9/25/43. U.S. Navy, Bureau of Yards & Docks, Contract no. bs 76. Approved for construction October 9, 1943. blueprint - United Engineering Company Shipyard, Office Building No. 137, 2900 Main Street, Alameda, Alameda County, CA
Improved NSGA model for multi objective operation scheduling and its evaluation
NASA Astrophysics Data System (ADS)
Li, Weining; Wang, Fuyu
2017-09-01
Reasonable operation can increase the income of the hospital and improve the patient’s satisfactory level. In this paper, by using multi object operation scheduling method with improved NSGA algorithm, it shortens the operation time, reduces the operation costand lowers the operation risk, the multi-objective optimization model is established for flexible operation scheduling, through the MATLAB simulation method, the Pareto solution is obtained, the standardization of data processing. The optimal scheduling scheme is selected by using entropy weight -Topsis combination method. The results show that the algorithm is feasible to solve the multi-objective operation scheduling problem, and provide a reference for hospital operation scheduling.
Cure Schedule for Stycast 2651/Catalyst 9.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kropka, Jamie Michael; McCoy, John D.
2017-11-01
The Emerson & Cuming technical data sheet (TDS) for Stycast 2651/Catalyst 9 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation uses one of the schedules within the TDS and adds amore » “post cure” to obtain full reaction.« less
Li, Shenghui; Yang, Qian; Chen, Zhe; Jin, Xingming; Jiang, Fan; Shen, Xiaoming
2014-09-03
This study was designed to examine the hypothesis that homework schedule has adverse impacts on Chinese children's sleep-wake habits and sleep duration. A random sample of 19,299 children aged 5.08 to 11.99 years old participated in a large, cross-sectional survey. A parent-administered questionnaire was completed to quantify children's homework schedule and sleep behaviors. Generally, it was demonstrated that more homework schedule was significantly associated with later bedtime, later wake time, and shorter sleep duration. Among all sleep variables, bedtime and sleep duration during weekdays appeared to be most affected by homework schedule, especially homework schedule during weekdays.
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.
NASA Astrophysics Data System (ADS)
Ramli, Razamin; Tein, Lim Huai
2016-08-01
A good work schedule can improve hospital operations by providing better coverage with appropriate staffing levels in managing nurse personnel. Hence, constructing the best nurse work schedule is the appropriate effort. In doing so, an improved selection operator in the Evolutionary Algorithm (EA) strategy for a nurse scheduling problem (NSP) is proposed. The smart and efficient scheduling procedures were considered. Computation of the performance of each potential solution or schedule was done through fitness evaluation. The best so far solution was obtained via special Maximax&Maximin (MM) parent selection operator embedded in the EA, which fulfilled all constraints considered in the NSP.
Artificial Immune Algorithm for Subtask Industrial Robot Scheduling in Cloud Manufacturing
NASA Astrophysics Data System (ADS)
Suma, T.; Murugesan, R.
2018-04-01
The current generation of manufacturing industry requires an intelligent scheduling model to achieve an effective utilization of distributed manufacturing resources, which motivated us to work on an Artificial Immune Algorithm for subtask robot scheduling in cloud manufacturing. This scheduling model enables a collaborative work between the industrial robots in different manufacturing centers. This paper discussed two optimizing objectives which includes minimizing the cost and load balance of industrial robots through scheduling. To solve these scheduling problems, we used the algorithm based on Artificial Immune system. The parameters are simulated with MATLAB and the results compared with the existing algorithms. The result shows better performance than existing.
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH
Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok
2018-01-01
Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology. PMID:29659508
How do employees prioritise when they schedule their own shifts?
Nabe-Nielsen, Kirsten; Lund, Henrik; Ajslev, Jeppe Z; Hansen, Åse Marie; Albertsen, Karen; Hvid, Helge; Garde, Anne Helene
2013-01-01
We investigated how employees prioritised when they scheduled their own shifts and whether priorities depended on age, gender, educational level, cohabitation and health status. We used cross-sectional questionnaire data from the follow-up survey of an intervention study investigating the effect of self-scheduling (n = 317). Intervention group participants were asked about their priorities when scheduling their own shifts succeeded by 17 items covering family/private life, economy, job content, health and sleep. At least half of the participants reported that they were giving high priority to their family life, having consecutive time off, leisure-time activities, rest between shifts, sleep, regularity of their everyday life, health and that the work schedule balanced. Thus, employees consider both their own and the workplace's needs when they have the opportunity to schedule their own shifts. Age, gender, cohabitation and health status were all significantly associated with at least one of these priorities. Intervention studies report limited health effects of self-scheduling. Therefore, we investigated to what extent employees prioritise their health and recuperation when scheduling their own shifts. We found that employees not only consider both their health and family but also the workplace's needs when they schedule their own shifts.
Pérez, Omar D; Aitken, Michael R F; Zhukovsky, Peter; Soto, Fabián A; Urcelay, Gonzalo P; Dickinson, Anthony
2016-12-15
Associative learning theories regard the probability of reinforcement as the critical factor determining responding. However, the role of this factor in instrumental conditioning is not completely clear. In fact, free-operant experiments show that participants respond at a higher rate on variable ratio than on variable interval schedules even though the reinforcement probability is matched between the schedules. This difference has been attributed to the differential reinforcement of long inter-response times (IRTs) by interval schedules, which acts to slow responding. In the present study, we used a novel experimental design to investigate human responding under random ratio (RR) and regulated probability interval (RPI) schedules, a type of interval schedule that sets a reinforcement probability independently of the IRT duration. Participants responded on each type of schedule before a final choice test in which they distributed responding between two schedules similar to those experienced during training. Although response rates did not differ during training, the participants responded at a lower rate on the RPI schedule than on the matched RR schedule during the choice test. This preference cannot be attributed to a higher probability of reinforcement for long IRTs and questions the idea that similar associative processes underlie classical and instrumental conditioning.
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.
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.
Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok
2018-04-16
Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.
77 FR 10391 - Harmonizing Schedule I Drug Requirements
Federal Register 2010, 2011, 2012, 2013, 2014
2012-02-22
... [Docket No. FMCSA-2011-0073] RIN 2126-AB35 Harmonizing Schedule I Drug Requirements AGENCY: Federal Motor... the medical examination report to clarify that drivers may not use Schedule I drugs and be qualified...; email: [email protected] . SUPPLEMENTARY INFORMATION: FMCSA's recent rule harmonizing Schedule I drug...
12 CFR 229.12 - Availability schedule.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 12 Banks and Banking 3 2010-01-01 2010-01-01 false Availability schedule. 229.12 Section 229.12 Banks and Banking FEDERAL RESERVE SYSTEM (CONTINUED) BOARD OF GOVERNORS OF THE FEDERAL RESERVE SYSTEM... Availability Policies § 229.12 Availability schedule. (a) Effective date. The availability schedule contained...
Code of Federal Regulations, 2010 CFR
2010-10-01
... means the agency needing the supplies or services. Schedules e-Library means the on-line source for GSA and VA Federal Supply Schedule contract award information. Schedules e-Library may be accessed at http... REQUIRED SOURCES OF SUPPLIES AND SERVICES Federal Supply Schedules 8.401 Definitions. As used in this...
Timing Is Everything: Adapting to the Flexible Schedule.
ERIC Educational Resources Information Center
Browne, Karen Stevens; Burton, Linda
1989-01-01
Discusses the benefits of flexible scheduling in school media centers and emphasizes the importance of cooperation among media specialists, teachers, administrators, and volunteers in successfully implementing flexible scheduling. The experiences of a school media specialist who introduced flexible scheduling in the media center at Whiskey Bottom…
5 CFR 532.513 - Flexible and compressed work schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Flexible and compressed work schedules... REGULATIONS PREVAILING RATE SYSTEMS Premium Pay and Differentials § 532.513 Flexible and compressed work schedules. Federal Wage System employees who are authorized to work flexible and compressed work schedules...
User interface issues in supporting human-computer integrated scheduling
NASA Technical Reports Server (NTRS)
Cooper, Lynne P.; Biefeld, Eric W.
1991-01-01
The topics are presented in view graph form and include the following: characteristics of Operations Mission Planner (OMP) schedule domain; OMP architecture; definition of a schedule; user interface dimensions; functional distribution; types of users; interpreting user interaction; dynamic overlays; reactive scheduling; and transitioning the interface.
7 CFR 305.8 - Sulfuryl fluoride treatment schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 5 2010-01-01 2010-01-01 false Sulfuryl fluoride treatment schedules. 305.8 Section 305.8 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH... fluoride treatment schedules. Treatment schedule Pressure Temperature ( °F) Dosage rate(lb/1000 cubic feet...
Block Scheduling in High Schools.
ERIC Educational Resources Information Center
Irmsher, Karen
1996-01-01
Block Scheduling has been considered a cure for a lengthy list of educational problems. This report reviews the literature on block schedules and describes some Oregon high schools that have integrated block scheduling. Major disadvantages included resistance to change and requirements that teachers change their teaching strategies. There is…
Space station program phase B definition: Nuclear reactor-powered space station cost and schedules
NASA Technical Reports Server (NTRS)
1971-01-01
Tabulated data are presented on the costs, schedules, and technical characteristics for the space station phases C and D program. The work breakdown structure, schedule data, program ground rules, program costs, cost-estimating rationale, funding schedules, and supporting data are included.
40 CFR 52.1335 - 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.1335 Section...) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS (CONTINUED) Missouri § 52.1335 Compliance schedules. (a) The compliance schedule for the source identified below is approved as a revision to the plan pursuant...
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".
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.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Wayne F. Boyer; Gurdeep S. Hura
2005-09-01
The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less
Characterization of Tactical Departure Scheduling in the National Airspace System
NASA Technical Reports Server (NTRS)
Capps, Alan; Engelland, Shawn A.
2011-01-01
This paper discusses and analyzes current day utilization and performance of the tactical departure scheduling process in the National Airspace System (NAS) to understand the benefits in improving this process. The analysis used operational air traffic data from over 1,082,000 flights during the month of January, 2011. Specific metrics included the frequency of tactical departure scheduling, site specific variances in the technology's utilization, departure time prediction compliance used in the tactical scheduling process and the performance with which the current system can predict the airborne slot that aircraft are being scheduled into from the airport surface. Operational data analysis described in this paper indicates significant room for improvement exists in the current system primarily in the area of reduced departure time prediction uncertainty. Results indicate that a significant number of tactically scheduled aircraft did not meet their scheduled departure slot due to departure time uncertainty. In addition to missed slots, the operational data analysis identified increased controller workload associated with tactical departures which were subject to traffic management manual re-scheduling or controller swaps. An analysis of achievable levels of departure time prediction accuracy as obtained by a new integrated surface and tactical scheduling tool is provided to assess the benefit it may provide as a solution to the identified shortfalls. A list of NAS facilities which are likely to receive the greatest benefit from the integrated surface and tactical scheduling technology are provided.
Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning
NASA Technical Reports Server (NTRS)
Drummond, Mark; Fox, Mark; Tate, Austin; Zweben, Monte
1992-01-01
The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques.
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.
An Enabling Technology for New Planning and Scheduling Paradigms
NASA Technical Reports Server (NTRS)
Jaap, John; Davis, Elizabeth
2004-01-01
The Night Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called ?ask models," from the scientists and technologists for the tasks that are to be scheduled. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next, a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, the models are modified to be compatible with the scheduling engine. Then the models are submitted to the scheduling engine for automatic scheduling or, when requirements are expressed in notes, the timeline is built manually. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components: (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphical methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the intervention of a scheduling expert. The algorithm is tuned for the constraint hierarchies and the complex temporal relationships provided by the modeling schema. It has an extensive search algorithm that can exploit timing flexibilities and constraint and relationship options. (3) An innovative architecture allows multiple remote users to simultaneously model science and technology requirements and other users to model vehicle and hardware characteristics. The architecture allows the remote users to submit scheduling requests directly to the scheduling engine and immediately see the results. These three components are integrated so that science and technology experts with no knowledge of the vehicle or hardware subsystems and no knowledge of the internal workings of the scheduling engine have the ability to build and submit scheduling requests and see the results. The immediate feedback will hone the users' modeling skills and ultimately enable them to produce the desired timeline. This paper summarizes the three components of the enabling technology and describes how this technology would make a new paradigm possible.
Dexter, Franklin; Xiao, Yan; Dow, Angella J; Strader, Melissa M; Ho, Danny; Wachtel, Ruth E
2007-12-01
An anesthesia department implemented scheduling of anesthetics outside of operating rooms (non-OR) by clerks and nurses from other departments using its hospital's enterprise-wide scheduling system. Observational studies chronicled the change over 2 yr as non-OR time was allocated by specialty, and nonanesthesia clerks and nurses scheduled anesthesia teams. Experimental studies investigated how tabular and graphical displays affected the scheduling of milestones (e.g., NPO times) and appointments before anesthetics. Anesthetics performed in allocated time increased progressively from 0% to 75%. Scheduling of anesthetics by nonanesthesia clerks and nurses increased progressively from 0% to 77%. Consistency of patient instructions was improved. The quality of resulting schedules was good. Implementation was not associated with worsening of multiple operational measures of performance such as cancellation rates, turnover times, or complaints. However, schedulers struggled to understand fasting and arrival times of patients, despite using a web site with statistically generated values in tabular formats. Experiments revealed that people ignored their knowledge that anesthetics can start earlier than scheduled. Participants made good decisions with both tabular and graphical displays when scheduling appointments preceding anesthesia. Enterprise-wide scheduling can coordinate anesthetics with other appointments on the same date and improve consistency and accuracy of patient instructions customized to the probability of an anesthetic starting early. The usefulness of implementation depends on the value in having more patient-centered care and/or in having patients arrive just in time for non-OR anesthesia, surgery, or regional block placement (e.g., at facilities with limited physical space).
Appointment standardization evaluation in a primary care facility.
Huang, Yu-Li
2016-07-11
Purpose - The purpose of this paper is to evaluate the performance on standardizing appointment slot length in a primary care clinic to understand the impact of providers' preferences and practice differences. Design/methodology/approach - The treatment time data were collected for each provider. There were six patient types: emergency/urgent care (ER/UC), follow-up patient (FU), new patient, office visit (OV), physical exam, and well-child care. Simulation model was developed to capture patient flow and measure patient wait time, provider idle time, cost, overtime, finish time, and the number of patients scheduled. Four scheduling scenarios were compared: scheduled all patients at 20 minutes; scheduled ER/UC, FU, OV at 20 minutes and others at 40 minutes; scheduled patient types on individual provider preference; and scheduled patient types on combined provider preference. Findings - Standardized scheduling among providers increase cost by 57 per cent, patient wait time by 83 per cent, provider idle time by five minutes per patient, overtime by 22 minutes, finish time by 30 minutes, and decrease patient access to care by approximately 11 per cent. An individualized scheduling approach could save as much as 14 per cent on cost and schedule 1.5 more patients. The combined preference method could save about 8 per cent while the number of patients scheduled remained the same. Research limitations/implications - The challenge is to actually disseminate the findings to medical providers and adjust scheduling systems accordingly. Originality/value - This paper concluded standardization of providers' clinic preference and practice negatively impact clinic service quality and access to care.
40 CFR 141.702 - Sampling schedules.
Code of Federal Regulations, 2011 CFR
2011-07-01
... 40 Protection of Environment 23 2011-07-01 2011-07-01 false Sampling schedules. 141.702 Section... Monitoring Requirements § 141.702 Sampling schedules. (a) Systems required to conduct source water monitoring under § 141.701 must submit a sampling schedule that specifies the calendar dates when the system will...
40 CFR 141.702 - Sampling schedules.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 40 Protection of Environment 22 2010-07-01 2010-07-01 false Sampling schedules. 141.702 Section... Monitoring Requirements § 141.702 Sampling schedules. (a) Systems required to conduct source water monitoring under § 141.701 must submit a sampling schedule that specifies the calendar dates when the system will...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-12
...] Schedules of Controlled Substances: Temporary Placement of Three Synthetic Cannabinoids Into Schedule I... temporarily schedule three synthetic cannabinoids into the Controlled Substances Act (CSA) pursuant to the...). This action is based on a finding by the Deputy Administrator that the placement of these synthetic...
42 CFR 414.62 - Fee schedule for clinical psychologist services.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 42 Public Health 3 2010-10-01 2010-10-01 false Fee schedule for clinical psychologist services... Physicians and Other Practitioners § 414.62 Fee schedule for clinical psychologist services. The fee schedule for clinical psychologist services is set at 100 percent of the amount determined for corresponding...
9 CFR 307.4 - Schedule of operations.
Code of Federal Regulations, 2010 CFR
2010-01-01
... inspectors shall not, except as provided herein, occur prior to 4 hours after the beginning of scheduled... efficient and effective use of inspection personnel. The work schedule must specify daily clock hours of... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Schedule of operations. 307.4 Section...
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…
33 CFR 401.58 - Pleasure craft scheduling.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Pleasure craft scheduling. 401.58... OF TRANSPORTATION SEAWAY REGULATIONS AND RULES Regulations Seaway Navigation § 401.58 Pleasure craft scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in...
15 CFR 712.4 - New Schedule 1 production facility.
Code of Federal Regulations, 2010 CFR
2010-01-01
... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS § 712.4 New Schedule 1 production facility. (a) Establishment of a...) of the CWCR, and you intend to begin production of Schedule 1 chemicals at your facility in...
An Analysis of Research on Block Scheduling
ERIC Educational Resources Information Center
Zepeda, Sally J.; Mayers, R. Stewart
2006-01-01
In this analysis of 58 empirical studies of high school block scheduling, the authors report findings in and across five groupings. Within groups, data were inconsistent regarding whether teachers' practices changed, but teachers believed that staff development was necessary to teach in a block schedule. Block scheduling appeared to increase…
7 CFR 275.20 - ME review schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 4 2010-01-01 2010-01-01 false ME review schedules. 275.20 Section 275.20 Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE... Program Performance § 275.20 ME review schedules. (a) Each State agency shall submit its review schedule...
7 CFR 275.20 - ME review schedules.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 7 Agriculture 4 2012-01-01 2012-01-01 false ME review schedules. 275.20 Section 275.20 Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE... Program Performance § 275.20 ME review schedules. (a) Each State agency shall submit its review schedule...
7 CFR 275.20 - ME review schedules.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 7 Agriculture 4 2011-01-01 2011-01-01 false ME review schedules. 275.20 Section 275.20 Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE... Program Performance § 275.20 ME review schedules. (a) Each State agency shall submit its review schedule...
7 CFR 275.20 - ME review schedules.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 7 Agriculture 4 2013-01-01 2013-01-01 false ME review schedules. 275.20 Section 275.20 Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE... Program Performance § 275.20 ME review schedules. (a) Each State agency shall submit its review schedule...
10 CFR 52.99 - Inspection during construction; ITAAC schedules and notifications; NRC notices.
Code of Federal Regulations, 2014 CFR
2014-01-01
...; ITAAC schedules and notifications; NRC notices. (a) Licensee schedule for completing inspections, tests... schedule for completing the inspections, tests, or analyses in the ITAAC. The licensee shall submit updates... combined license may proceed at its own risk with design and procurement activities, and a licensee may...
10 CFR 52.99 - Inspection during construction; ITAAC schedules and notifications; NRC notices.
Code of Federal Regulations, 2013 CFR
2013-01-01
...; ITAAC schedules and notifications; NRC notices. (a) Licensee schedule for completing inspections, tests... schedule for completing the inspections, tests, or analyses in the ITAAC. The licensee shall submit updates... combined license may proceed at its own risk with design and procurement activities, and a licensee may...
Product Use Scheduler: A Scheduling Module used in EPA’s Human Exposure Model
The scheduling model (SM) was developed for scheduling the use of consumer products in the U.S. EPA’s Human Exposure Model (HEM), an integrated modeling system to estimate human exposure to chemicals in household consumer products. The SM begins with year-long daily activit...
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…
48 CFR 852.236-84 - Schedule of work progress.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Schedule of work progress... Schedule of work progress. As prescribed in 836.575, insert the following clause: Schedule of Work Progress... indicates the anticipated installation of work versus the elapsed contract time, for the approval of the...
7 CFR 305.16 - Cold treatment schedules.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 5 2010-01-01 2010-01-01 false Cold treatment schedules. 305.16 Section 305.16... SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Cold Treatments § 305.16 Cold treatment schedules. Treatment schedule Temperature ( °F) Exposure period T107-a 1 34 or below 14 days. 35 or below 16...
Attenuation and Enhancement of Compliance with Experimental Demand Characteristics
ERIC Educational Resources Information Center
Navarick, Douglas J.
2007-01-01
College students chose between reinforcement schedules in which a key press produced a cartoon video followed by nonreinforcement. The experimenter introduced a demand characteristic by stating a preference for choosing one schedule while indicating that the other schedule was also acceptable. With identical schedules (25 s of reinforcement, 5 s…
10 CFR 2.332 - General case scheduling and management.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 10 Energy 1 2010-01-01 2010-01-01 false General case scheduling and management. 2.332 Section 2... Management for NRC Adjudicatory Hearings § 2.332 General case scheduling and management. (a) Scheduling order... the issues presented, relevant considerations which a party may bring to the attention of the...
A Practical Variation of a Multiple-Schedule Procedure: Brief Schedule-Correlated Stimuli
ERIC Educational Resources Information Center
Tiger, Jeffrey H.; Hanley, Gregory P.; Larsen, Kylie M.
2008-01-01
Multiple schedules using continuous discriminative stimuli have been used to minimize children's disruptive requesting for teacher attention (e.g., colored floral leis; Tiger & Hanley, 2004; Tiger, Hanley, & Heal, 2006). The present study evaluated the effectiveness of, and children's preferences for, two multiple-schedule arrangements in which…
15 CFR 712.4 - New Schedule 1 production facility.
Code of Federal Regulations, 2011 CFR
2011-01-01
... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS § 712.4 New Schedule 1 production facility. (a) Establishment of a...) of the CWCR, and you intend to begin production of Schedule 1 chemicals at your facility in...
Code of Federal Regulations, 2011 CFR
2011-01-01
... COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS § 714.3 Advance declaration requirements for additionally planned production of Schedule 3 chemicals. (a) Declaration... additionally planned production of Schedule 3 chemicals. 714.3 Section 714.3 Commerce and Foreign Trade...
Brief Report: Signals Enhance the Suppressive Effects of Noncontingent Reinforcement
ERIC Educational Resources Information Center
Ringdahl, Joel E.; Call, Nathan A.; Christensen, Tory; Boelter, Eric W.
2010-01-01
The effects of noncontingent reinforcement (NCR) schedules on responding were assessed across two parameters: presence of signal and schedule density. Results indicated that signaled NCR schedules were correlated with greater overall reductions in responding and quicker reductions relative to NCR schedules without a signal. The clinical…
40 CFR 268.13 - Schedule for wastes identified or listed after November 8, 1984.
Code of Federal Regulations, 2011 CFR
2011-07-01
... AGENCY (CONTINUED) SOLID WASTES (CONTINUED) LAND DISPOSAL RESTRICTIONS Schedule for Land Disposal Prohibition and Establishment of Treatment Standards § 268.13 Schedule for wastes identified or listed after... 40 Protection of Environment 27 2011-07-01 2011-07-01 false Schedule for wastes identified or...
40 CFR 268.13 - Schedule for wastes identified or listed after November 8, 1984.
Code of Federal Regulations, 2013 CFR
2013-07-01
... AGENCY (CONTINUED) SOLID WASTES (CONTINUED) LAND DISPOSAL RESTRICTIONS Schedule for Land Disposal Prohibition and Establishment of Treatment Standards § 268.13 Schedule for wastes identified or listed after... 40 Protection of Environment 28 2013-07-01 2013-07-01 false Schedule for wastes identified or...
40 CFR 268.13 - Schedule for wastes identified or listed after November 8, 1984.
Code of Federal Regulations, 2010 CFR
2010-07-01
... AGENCY (CONTINUED) SOLID WASTES (CONTINUED) LAND DISPOSAL RESTRICTIONS Schedule for Land Disposal Prohibition and Establishment of Treatment Standards § 268.13 Schedule for wastes identified or listed after... 40 Protection of Environment 26 2010-07-01 2010-07-01 false Schedule for wastes identified or...
Compound-Schedules Approaches to Noncompliance: Teaching Children When to Ask and When to Work
ERIC Educational Resources Information Center
Lambert, Joseph M.; Clohisy, Anne M.; Blair Barrows, S.; Houchins-Juarez, Nealetta J.
2017-01-01
Researchers have demonstrated for practitioners how to use multiple-schedules preparations to thin initially dense schedules of reinforcement during functional communication training, without sacrificing benefits associated with dense schedules of reinforcement for manding. However, special considerations may be required for practitioners to…
COMPASS: A general purpose computer aided scheduling tool
NASA Technical Reports Server (NTRS)
Mcmahon, Mary Beth; Fox, Barry; Culbert, Chris
1991-01-01
COMPASS is a generic scheduling system developed by McDonnell Douglas under the direction of the Software Technology Branch at JSC. COMPASS is intended to illustrate the latest advances in 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 potential NASA Space Station Freedom standards. COMPASS has some unique characteristics that distinguishes it from commercial products. These characteristics are discussed and used to illustrate some differences between scheduling tools.
Scheduling for the National Hockey League Using a Multi-objective Evolutionary Algorithm
NASA Astrophysics Data System (ADS)
Craig, Sam; While, Lyndon; Barone, Luigi
We describe a multi-objective evolutionary algorithm that derives schedules for the National Hockey League according to three objectives: minimising the teams' total travel, promoting equity in rest time between games, and minimising long streaks of home or away games. Experiments show that the system is able to derive schedules that beat the 2008-9 NHL schedule in all objectives simultaneously, and that it returns a set of schedules that offer a range of trade-offs across the objectives.
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.
Binary Trees and Parallel Scheduling Algorithms.
1980-09-01
been pro- cessed for p. time units. If a job does not complete by its due time, it is tardy. In a nonpreemptive schedule, job i is scheduled to process...the preemptive schedule obtained by the algorithm of section 2.1.2 also minimizes 5Ti, this problem is easily solved in parallel. When lci is to e...August 1978, pp. 657-661. 14. Horn, W. A., "Some simple scheduling algorithms," Naval Res. Logist . Qur., Vol. 21, pp. 177-185, 1974. i5. Hforowitz, E
A criterion autoscheduler for long range planning
NASA Technical Reports Server (NTRS)
Sponsler, Jeffrey L.
1994-01-01
A constraint-based scheduling system called SPIKE is used to create long-term schedules for the Hubble Space Telescope. A meta-level scheduler called the Criterion Autoscheduler for Long range planning (CASL) was created to guide SPIKE's schedule generation according to the agenda of the planning scientists. It is proposed that sufficient flexibility exists in a schedule to allow high level planning heuristics to be applied without adversely affected crucial constraints such as spacecraft efficiency. This hypothesis is supported by test data which is described.
A New Lagrangian Relaxation Method Considering Previous Hour Scheduling for Unit Commitment Problem
NASA Astrophysics Data System (ADS)
Khorasani, H.; Rashidinejad, M.; Purakbari-Kasmaie, M.; Abdollahi, A.
2009-08-01
Generation scheduling is a crucial challenge in power systems especially under new environment of liberalization of electricity industry. A new Lagrangian relaxation method for unit commitment (UC) has been presented for solving generation scheduling problem. This paper focuses on the economical aspect of UC problem, while the previous hour scheduling as a very important issue is studied. In this paper generation scheduling of present hour has been conducted by considering the previous hour scheduling. The impacts of hot/cold start-up cost have been taken in to account in this paper. Case studies and numerical analysis presents significant outcomes while it demonstrates the effectiveness of the proposed method.
Balancing Authority Cooperation Concepts - Intra-Hour Scheduling
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hunsaker, Matthew; Samaan, Nader; Milligan, Michael
2013-03-29
The overall objective of this study was to understand, on an Interconnection-wide basis, the effects intra-hour scheduling compared to hourly scheduling. Moreover, the study sought to understand how the benefits of intra-hour scheduling would change by altering the input assumptions in different scenarios. This report describes results of three separate scenarios with differing key assumptions and comparing the production costs between hourly scheduling and 10-minute scheduling performance. The different scenarios were chosen to provide insight into how the estimated benefits might change by altering input assumptions. Several key assumptions were different in the three scenarios, however most assumptions were similarmore » and/or unchanged among the scenarios.« less
Research on the ITOC based scheduling system for ship piping production
NASA Astrophysics Data System (ADS)
Li, Rui; Liu, Yu-Jun; Hamada, Kunihiro
2010-12-01
Manufacturing of ship piping systems is one of the major production activities in shipbuilding. The schedule of pipe production has an important impact on the master schedule of shipbuilding. In this research, the ITOC concept was introduced to solve the scheduling problems of a piping factory, and an intelligent scheduling system was developed. The system, in which a product model, an operation model, a factory model, and a knowledge database of piping production were integrated, automated the planning process and production scheduling. Details of the above points were discussed. Moreover, an application of the system in a piping factory, which achieved a higher level of performance as measured by tardiness, lead time, and inventory, was demonstrated.
Operations mission planner beyond the baseline
NASA Technical Reports Server (NTRS)
Biefeld, Eric; Cooper, Lynne
1991-01-01
The scheduling of Space Station Freedom must satisfy four major requirements. It must ensure efficient housekeeping operations, maximize the collection of science, respond to changes in tasking and available resources, and accommodate the above changes in a manner that minimizes disruption of the ongoing operations of the station. While meeting these requirements the scheduler must cope with the complexity, scope, and flexibility of SSF operations. This requires the scheduler to deal with an astronomical number of possible schedules. The Operations Mission Planner (OMP) is centered around minimally disruptive replanning and the use of heuristics limit search in scheduling. OMP has already shown several artificial intelligence based scheduling techniques such as Interleaved Iterative Refinement and Bottleneck Identification using Process Chronologies.
Multi-Objective Scheduling for the Cluster II Constellation
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Giuliano, Mark
2011-01-01
This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.
Production Planning and Planting Pattern Scheduling Information System for Horticulture
NASA Astrophysics Data System (ADS)
Vitadiar, Tanhella Zein; Farikhin; Surarso, Bayu
2018-02-01
This paper present the production of planning and planting pattern scheduling faced by horticulture farmer using two methods. Fuzzy time series method use to predict demand on based on sales amount, while linear programming is used to assist horticulture farmers in making production planning decisions and determining the schedule of cropping patterns in accordance with demand predictions of the fuzzy time series method, variable use in this paper is size of areas, production advantage, amount of seeds and age of the plants. This research result production planning and planting patterns scheduling information system with the output is recommendations planting schedule, harvest schedule and the number of seeds will be plant.
Project resource reallocation algorithm
NASA Technical Reports Server (NTRS)
Myers, J. E.
1981-01-01
A methodology for adjusting baseline cost estimates according to project schedule changes is described. An algorithm which performs a linear expansion or contraction of the baseline project resource distribution in proportion to the project schedule expansion or contraction is presented. Input to the algorithm consists of the deck of cards (PACE input data) prepared for the baseline project schedule as well as a specification of the nature of the baseline schedule change. Output of the algorithm is a new deck of cards with all work breakdown structure block and element of cost estimates redistributed for the new project schedule. This new deck can be processed through PACE to produce a detailed cost estimate for the new schedule.
Production scheduling with ant colony optimization
NASA Astrophysics Data System (ADS)
Chernigovskiy, A. S.; Kapulin, D. V.; Noskova, E. E.; Yamskikh, T. N.; Tsarev, R. Yu
2017-10-01
The optimum solution of the production scheduling problem for manufacturing processes at an enterprise is crucial as it allows one to obtain the required amount of production within a specified time frame. Optimum production schedule can be found using a variety of optimization algorithms or scheduling algorithms. Ant colony optimization is one of well-known techniques to solve the global multi-objective optimization problem. In the article, the authors present a solution of the production scheduling problem by means of an ant colony optimization algorithm. A case study of the algorithm efficiency estimated against some others production scheduling algorithms is presented. Advantages of the ant colony optimization algorithm and its beneficial effect on the manufacturing process are provided.
Chemotherapy and treatment scheduling: the Johns Hopkins Oncology Center Outpatient Department.
Majidi, F.; Enterline, J. P.; Ashley, B.; Fowler, M. E.; Ogorzalek, L. L.; Gaudette, R.; Stuart, G. J.; Fulton, M.; Ettinger, D. S.
1993-01-01
The Chemotherapy and Treatment Scheduling System provides integrated appointment and facility scheduling for very complex procedures. It is fully integrated with other scheduling systems at The Johns Hopkins Oncology Center and is supported by the Oncology Clinical Information System (OCIS). It provides a combined visual and textual environment for the scheduling of events that have multiple dimensions and dependencies on other scheduled events. It is also fully integrated with other clinical decision support and ancillary systems within OCIS. The system has resulted in better patient flow through the ambulatory care areas of the Center. Implementing the system required changes in behavior among physicians, staff, and patients. This system provides a working example of building a sophisticated rule-based scheduling system using a relatively simple paradigm. It also is an example of what can be achieved when there is total integration between the operational and clinical components of patient care automation. PMID:8130453
Scheduling Results for the THEMIS Observation Scheduling Tool
NASA Technical Reports Server (NTRS)
Mclaren, David; Rabideau, Gregg; Chien, Steve; Knight, Russell; Anwar, Sadaat; Mehall, Greg; Christensen, Philip
2011-01-01
We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.
Designing a fuzzy scheduler for hard real-time systems
NASA Technical Reports Server (NTRS)
Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami
1992-01-01
In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.
NASA Technical Reports Server (NTRS)
Jaap, John; Davis, Elizabeth; Richardson, Lea
2004-01-01
Planning and scheduling systems organize tasks into a timeline or schedule. Tasks are logically grouped into containers called models. Models are a collection of related tasks, along with their dependencies and requirements, that when met will produce the desired result. 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.
Future Air Traffic Growth and Schedule Model, Supplement
NASA Technical Reports Server (NTRS)
Kimmel, William M. (Technical Monitor); Smith, Jeremy C.; Dollyhigh, Samuel M.
2004-01-01
The Future Air Traffic Growth and Schedule Model was developed as an implementation of the Fratar algorithm to project future traffic flow between airports in a system and of then scheduling the additional flights to reflect current passenger time-of-travel preferences. The methodology produces an unconstrained future schedule from a current (or baseline) schedule and the airport operations growth rates. As an example of the use of the model, future schedules are projected for 2010 and 2022 for all flights arriving at, departing from, or flying between all continental United States airports that had commercial scheduled service for May 17, 2002. Inter-continental US traffic and airports are included and the traffic is also grown with the Fratar methodology to account for their arrivals and departures to the continental US airports. Input data sets derived from the Official Airline Guide (OAG) data and FAA Terminal Area Forecast (TAF) are included in the examples of the computer code execution.
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.
Dedicated heterogeneous node scheduling including backfill scheduling
Wood, Robert R [Livermore, CA; Eckert, Philip D [Livermore, CA; Hommes, Gregg [Pleasanton, CA
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.
Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks.
Micea, Mihai-Victor; Stangaciu, Cristina-Sorina; Stangaciu, Valentin; Curiac, Daniel-Ioan
2017-06-26
Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H²RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU) utilization factor. From the detailed, integrated schedulability analysis of the H²RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.
Scheduling Real-Time Mixed-Criticality Jobs
NASA Astrophysics Data System (ADS)
Baruah, Sanjoy K.; Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Li, Haohan; Marchetti-Spaccamela, Alberto; Megow, Nicole; Stougie, Leen
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors are tight for these two techniques.
Autonomous mission planning and scheduling: Innovative, integrated, responsive
NASA Technical Reports Server (NTRS)
Sary, Charisse; Liu, Simon; Hull, Larry; Davis, Randy
1994-01-01
Autonomous mission scheduling, a new concept for NASA ground data systems, is a decentralized and distributed approach to scientific spacecraft planning, scheduling, and command management. Systems and services are provided that enable investigators to operate their own instruments. In autonomous mission scheduling, separate nodes exist for each instrument and one or more operations nodes exist for the spacecraft. Each node is responsible for its own operations which include planning, scheduling, and commanding; and for resolving conflicts with other nodes. One or more database servers accessible to all nodes enable each to share mission and science planning, scheduling, and commanding information. The architecture for autonomous mission scheduling is based upon a realistic mix of state-of-the-art and emerging technology and services, e.g., high performance individual workstations, high speed communications, client-server computing, and relational databases. The concept is particularly suited to the smaller, less complex missions of the future.
An Example of Discovery Research Involving the Transfer of Stimulus Control
2005-01-01
The initial purpose of the present study was to replicate procedures for teaching preschool children to recruit attention at appropriate times by having an experimenter signal the availability and unavailability of attention (i.e., arrange a multiple schedule involving reinforcement and extinction; Tiger & Hanley, 2004). Following the development of discriminated social responding, the schedule-correlated stimuli were removed (i.e., a mixed schedule of reinforcement was arranged). However, discriminated responding continued during these conditions. Further evaluation suggested that stimulus control over children's social responding had transferred from the schedule-correlated stimuli to the delivery of reinforcement. The effect of a history of reinforcement under multiple-schedule conditions on performance under mixed schedules was then replicated with 2 participants in a reversal design. These findings suggest that following experience with schedule-correlated stimuli, these stimuli may be removed with only modest disruption to discriminated responding. PMID:16463530
Fritz, Jennifer N; Jackson, Lynsey M; Stiefler, Nicole A; Wimberly, Barbara S; Richardson, Amy R
2017-07-01
The effects of noncontingent reinforcement (NCR) without extinction during treatment of problem behavior maintained by social positive reinforcement were evaluated for five individuals diagnosed with autism spectrum disorder. A continuous NCR schedule was gradually thinned to a fixed-time 5-min schedule. If problem behavior increased during NCR schedule thinning, a continuous NCR schedule was reinstated and NCR schedule thinning was repeated with differential reinforcement of alternative behavior (DRA) included. Results showed an immediate decrease in all participants' problem behavior during continuous NCR, and problem behavior maintained at low levels during NCR schedule thinning for three participants. Problem behavior increased and maintained at higher rates during NCR schedule thinning for two other participants; however, the addition of DRA to the intervention resulted in decreased problem behavior and increased mands. © 2017 Society for the Experimental Analysis of Behavior.
ESSOPE: Towards S/C operations with reactive schedule planning
NASA Technical Reports Server (NTRS)
Wheadon, J.
1993-01-01
The ESSOPE is a prototype front-end tool running on a Sun workstation and interfacing to ESOC's MSSS spacecraft control system for the exchange of telecommand requests (to MSSS) and telemetry reports (from MSSS). ESSOPE combines an operations Planner-Scheduler, with a Schedule Execution Control function. Using an internal 'model' of the spacecraft, the Planner generates a schedule based on utilization requests for a variety of payload services by a community of Olympus users, and incorporating certain housekeeping operations. Conflicts based on operational constraints are automatically resolved, by employing one of several available strategies. The schedule is passed to the execution function which drives MSSS to perform it. When the schedule can no longer be met, either because the operator interferes (by delays or changes of requirements), or because ESSOPE has recognized some spacecraft anomalies, the Planner produces a modified schedule maintaining the on-going procedures as far as consistent with the new constraints or requirements.
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.
Alternative scheduling models and their effect on science achievement at the high school level
NASA Astrophysics Data System (ADS)
Dostal, Jay Roland
This study will evaluate alternative scheduling methods implemented in secondary level schools. Students were selected based on parent selection of programs. Traditional scheduling involves numerous academic subjects with small increments of time in each class and block scheduling focuses on fewer academic subjects and more instructional time. This study will compare office referral numbers, absence frequency, and Essential Learner Outcome (ELO) science strand scores in the 8th-grade (pretest) to the same students office referrals, absence frequency, and ELO science strand scores in the 11th-grade (posttest) between Seven Period Traditional Scheduling (SPTS) and Four Period Block Scheduling (FPBS) in the hopes that no matter what schedule students are a part of, the achievement results will be similar. (Study participants had completed both grade level ELO assessments and were continuously enrolled in one high school through their junior year.
NASA Astrophysics Data System (ADS)
Delgado, Francisco; Schumacher, German
2014-08-01
The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.
A NEW APPROACH TO CLASS SCHEDULING. FINAL REPORT.
ERIC Educational Resources Information Center
CANTER, JOHN; AND OTHERS
AN INVESTIGATION OF THE USE OF A PROTOTYPE DEVICE FOR CLASS SCHEDULING WAS MADE. THE BEEKLEY INSITE DEVICE THAT WAS STUDIED USES THE "PEEK-A-BOO" PRINCIPLE OF MATCHING COMPUTER TAPES. A TEST GROUP OF 149 GRADUATE STUDENTS WAS USED. THEIR DESIRED SCHEDULES WERE MATCHED AUTOMATICALLY AGAINST A PROPOSED MASTER SCHEDULE TO EVALUATE THE…
Alternative Work Schedules in Office and Nonoffice Work Settings.
ERIC Educational Resources Information Center
Kirk, Raymond J.; Barton, H. David
A rapidly growing change in the workplace is the replacement of a fixed work schedule with a variety of alternative work schedules (AWS), including both flexible and compressed schedules. Experimenting organizations (N=901) evaluated one of four major categories of AWS in office and nonoffice settings, i.e., a flexible 8-hour day;…
18 CFR 154.304 - Format of statements, schedules, workpapers and supporting data.
Code of Federal Regulations, 2010 CFR
2010-04-01
... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Format of statements, schedules, workpapers and supporting data. 154.304 Section 154.304 Conservation of Power and Water Resources... SCHEDULES AND TARIFFS Material To Be Filed With Changes § 154.304 Format of statements, schedules...
18 CFR 154.304 - Format of statements, schedules, workpapers and supporting data.
Code of Federal Regulations, 2011 CFR
2011-04-01
... 18 Conservation of Power and Water Resources 1 2011-04-01 2011-04-01 false Format of statements, schedules, workpapers and supporting data. 154.304 Section 154.304 Conservation of Power and Water Resources... SCHEDULES AND TARIFFS Material To Be Filed With Changes § 154.304 Format of statements, schedules...
18 CFR 154.304 - Format of statements, schedules, workpapers and supporting data.
Code of Federal Regulations, 2013 CFR
2013-04-01
... 18 Conservation of Power and Water Resources 1 2013-04-01 2013-04-01 false Format of statements, schedules, workpapers and supporting data. 154.304 Section 154.304 Conservation of Power and Water Resources... SCHEDULES AND TARIFFS Material To Be Filed With Changes § 154.304 Format of statements, schedules...
18 CFR 154.304 - Format of statements, schedules, workpapers and supporting data.
Code of Federal Regulations, 2014 CFR
2014-04-01
... 18 Conservation of Power and Water Resources 1 2014-04-01 2014-04-01 false Format of statements, schedules, workpapers and supporting data. 154.304 Section 154.304 Conservation of Power and Water Resources... SCHEDULES AND TARIFFS Material To Be Filed With Changes § 154.304 Format of statements, schedules...
18 CFR 154.304 - Format of statements, schedules, workpapers and supporting data.
Code of Federal Regulations, 2012 CFR
2012-04-01
... 18 Conservation of Power and Water Resources 1 2012-04-01 2012-04-01 false Format of statements, schedules, workpapers and supporting data. 154.304 Section 154.304 Conservation of Power and Water Resources... SCHEDULES AND TARIFFS Material To Be Filed With Changes § 154.304 Format of statements, schedules...
21 CFR 1310.16 - Exemptions for certain scheduled listed chemical products.
Code of Federal Regulations, 2011 CFR
2011-04-01
... 21 Food and Drugs 9 2011-04-01 2011-04-01 false Exemptions for certain scheduled listed chemical... RECORDS AND REPORTS OF LISTED CHEMICALS AND CERTAIN MACHINES § 1310.16 Exemptions for certain scheduled listed chemical products. (a) Upon the application of a manufacturer of a scheduled listed chemical...
15 CFR Supplement No. 1 to Part 714 - Schedule 3 Chemicals
Code of Federal Regulations, 2010 CFR
2010-01-01
... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Schedule 3 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 1 Supplement No. 1 to Part 714—Schedule 3 Chemicals...
15 CFR Supplement No. 1 to Part 713 - Schedule 2 Chemicals
Code of Federal Regulations, 2011 CFR
2011-01-01
... 15 Commerce and Foreign Trade 2 2011-01-01 2011-01-01 false Schedule 2 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 1 Supplement No. 1 to Part 713—Schedule 2 Chemicals...
15 CFR Supplement No. 1 to Part 712 - Schedule 1 Chemicals
Code of Federal Regulations, 2010 CFR
2010-01-01
... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Schedule 1 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 1 Supplement No. 1 to Part 712—Schedule 1 Chemicals...
15 CFR Supplement No. 1 to Part 712 - Schedule 1 Chemicals
Code of Federal Regulations, 2011 CFR
2011-01-01
... 15 Commerce and Foreign Trade 2 2011-01-01 2011-01-01 false Schedule 1 Chemicals no. Supplement no... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 1 Supplement no. 1 to Part 712—Schedule 1 Chemicals...
15 CFR Supplement No. 1 to Part 714 - Schedule 3 Chemicals
Code of Federal Regulations, 2011 CFR
2011-01-01
... 15 Commerce and Foreign Trade 2 2011-01-01 2011-01-01 false Schedule 3 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 1 Supplement No. 1 to Part 714—Schedule 3 Chemicals...
15 CFR Supplement No. 1 to Part 713 - Schedule 2 Chemicals
Code of Federal Regulations, 2010 CFR
2010-01-01
... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Schedule 2 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 1 Supplement No. 1 to Part 713—Schedule 2 Chemicals...
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.
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…
36 CFR 1258.2 - What does the NARA reproduction fee schedule cover?
Code of Federal Regulations, 2010 CFR
2010-07-01
... reproduction fee schedule cover? 1258.2 Section 1258.2 Parks, Forests, and Public Property NATIONAL ARCHIVES AND RECORDS ADMINISTRATION PUBLIC AVAILABILITY AND USE FEES § 1258.2 What does the NARA reproduction fee schedule cover? The NARA reproduction fee schedule in § 1258.12 covers reproduction of: (a) NARA...
36 CFR 1258.2 - What does the NARA reproduction fee schedule cover?
Code of Federal Regulations, 2011 CFR
2011-07-01
... reproduction fee schedule cover? 1258.2 Section 1258.2 Parks, Forests, and Public Property NATIONAL ARCHIVES AND RECORDS ADMINISTRATION PUBLIC AVAILABILITY AND USE FEES § 1258.2 What does the NARA reproduction fee schedule cover? The NARA reproduction fee schedule in § 1258.12 covers reproduction of: (a) NARA...
Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros
ERIC Educational Resources Information Center
Bancroft, Stacie L.; Bourret, Jason C.
2008-01-01
Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time.…
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
Code of Federal Regulations, 2010 CFR
2010-07-01
... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave. Eligible... the serious health condition of a covered family member or the employee or the serious injury or...
5 CFR 532.255 - Regular appropriated fund wage schedules in foreign areas.
Code of Federal Regulations, 2010 CFR
2010-01-01
... schedules shall provide rates of pay for nonsupervisory, leader, supervisory, and production facilitating employees. (b) Schedules shall be— (1) Computed on the basis of a simple average of all regular appropriated fund wage area schedules in effect on December 31; and (2) Effective on the first day of the first pay...
5 CFR 532.255 - Regular appropriated fund wage schedules in foreign areas.
Code of Federal Regulations, 2011 CFR
2011-01-01
... schedules shall provide rates of pay for nonsupervisory, leader, supervisory, and production facilitating employees. (b) Schedules shall be— (1) Computed on the basis of a simple average of all regular appropriated fund wage area schedules in effect on December 31; and (2) Effective on the first day of the first pay...
15 CFR Supplement No. 1 to Part 714 - Schedule 3 Chemicals
Code of Federal Regulations, 2013 CFR
2013-01-01
... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Schedule 3 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 1 Supplement No. 1 to Part 714—Schedule 3 Chemicals...
15 CFR Supplement No. 1 to Part 714 - Schedule 3 Chemicals
Code of Federal Regulations, 2012 CFR
2012-01-01
... 15 Commerce and Foreign Trade 2 2012-01-01 2012-01-01 false Schedule 3 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 1 Supplement No. 1 to Part 714—Schedule 3 Chemicals...
15 CFR Supplement No. 1 to Part 713 - Schedule 2 Chemicals
Code of Federal Regulations, 2012 CFR
2012-01-01
... 15 Commerce and Foreign Trade 2 2012-01-01 2012-01-01 false Schedule 2 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 1 Supplement No. 1 to Part 713—Schedule 2 Chemicals...
15 CFR Supplement No. 1 to Part 712 - Schedule 1 Chemicals
Code of Federal Regulations, 2013 CFR
2013-01-01
... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Schedule 1 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 1 Supplement No. 1 to Part 712—Schedule 1 Chemicals...
15 CFR Supplement No. 1 to Part 712 - Schedule 1 Chemicals
Code of Federal Regulations, 2012 CFR
2012-01-01
... 15 Commerce and Foreign Trade 2 2012-01-01 2012-01-01 false Schedule 1 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 1 Supplement No. 1 to Part 712—Schedule 1 Chemicals...
15 CFR Supplement No. 1 to Part 713 - Schedule 2 Chemicals
Code of Federal Regulations, 2013 CFR
2013-01-01
... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Schedule 2 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 1 Supplement No. 1 to Part 713—Schedule 2 Chemicals...
15 CFR Supplement No. 1 to Part 712 - Schedule 1 Chemicals
Code of Federal Regulations, 2014 CFR
2014-01-01
... 15 Commerce and Foreign Trade 2 2014-01-01 2014-01-01 false Schedule 1 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 1 Supplement No. 1 to Part 712—Schedule 1 Chemicals...
15 CFR Supplement No. 1 to Part 713 - Schedule 2 Chemicals
Code of Federal Regulations, 2014 CFR
2014-01-01
... 15 Commerce and Foreign Trade 2 2014-01-01 2014-01-01 false Schedule 2 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 1 Supplement No. 1 to Part 713—Schedule 2 Chemicals...
15 CFR Supplement No. 1 to Part 714 - Schedule 3 Chemicals
Code of Federal Regulations, 2014 CFR
2014-01-01
... 15 Commerce and Foreign Trade 2 2014-01-01 2014-01-01 false Schedule 3 Chemicals No. Supplement No... (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 1 Supplement No. 1 to Part 714—Schedule 3 Chemicals...
7 CFR 98.3 - Analyses performed and locations of laboratories.
Code of Federal Regulations, 2011 CFR
2011-01-01
... the special laboratory analyses rendered by the Science and Technology as a result of an agreement..., Canned) Fat, salt 1 Schedule BJ (Beef with Natural Juices, Canned) Fat 1 Schedule CS (Canned Meatball Stew) Fat 3 Schedule GP (Frozen Ground Pork) Fat 4 Schedule PJ (Pork with Natural Juices, Canned) Fat 1...
7 CFR 98.3 - Analyses performed and locations of laboratories.
Code of Federal Regulations, 2012 CFR
2012-01-01
... the special laboratory analyses rendered by the Science and Technology as a result of an agreement..., Canned) Fat, salt 1 Schedule BJ (Beef with Natural Juices, Canned) Fat 1 Schedule CS (Canned Meatball Stew) Fat 3 Schedule GP (Frozen Ground Pork) Fat 4 Schedule PJ (Pork with Natural Juices, Canned) Fat 1...
7 CFR 98.3 - Analyses performed and locations of laboratories.
Code of Federal Regulations, 2013 CFR
2013-01-01
... the special laboratory analyses rendered by the Science and Technology as a result of an agreement..., Canned) Fat, salt 1 Schedule BJ (Beef with Natural Juices, Canned) Fat 1 Schedule CS (Canned Meatball Stew) Fat 3 Schedule GP (Frozen Ground Pork) Fat 4 Schedule PJ (Pork with Natural Juices, Canned) Fat 1...
7 CFR 98.3 - Analyses performed and locations of laboratories.
Code of Federal Regulations, 2010 CFR
2010-01-01
... the special laboratory analyses rendered by the Science and Technology as a result of an agreement..., Canned) Fat, salt 1 Schedule BJ (Beef with Natural Juices, Canned) Fat 1 Schedule CS (Canned Meatball Stew) Fat 3 Schedule GP (Frozen Ground Pork) Fat 4 Schedule PJ (Pork with Natural Juices, Canned) Fat 1...
7 CFR 98.3 - Analyses performed and locations of laboratories.
Code of Federal Regulations, 2014 CFR
2014-01-01
... the special laboratory analyses rendered by the Science and Technology as a result of an agreement..., Canned) Fat, salt 1 Schedule BJ (Beef with Natural Juices, Canned) Fat 1 Schedule CS (Canned Meatball Stew) Fat 3 Schedule GP (Frozen Ground Pork) Fat 4 Schedule PJ (Pork with Natural Juices, Canned) Fat 1...
32 CFR 644.8 - Planning and scheduling real estate activities.
Code of Federal Regulations, 2012 CFR
2012-07-01
... 32 National Defense 4 2012-07-01 2011-07-01 true Planning and scheduling real estate activities... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling real estate activities. (a) Normal scheduling. (1) The objective of a planned program is to provide for...
32 CFR 644.8 - Planning and scheduling real estate activities.
Code of Federal Regulations, 2013 CFR
2013-07-01
... 32 National Defense 4 2013-07-01 2013-07-01 false Planning and scheduling real estate activities... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling real estate activities. (a) Normal scheduling. (1) The objective of a planned program is to provide for...
32 CFR 644.8 - Planning and scheduling real estate activities.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 32 National Defense 4 2014-07-01 2013-07-01 true Planning and scheduling real estate activities... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling real estate activities. (a) Normal scheduling. (1) The objective of a planned program is to provide for...
ERIC Educational Resources Information Center
Lee, Ronald; Sturmey, Peter; Fields, Lanny
2007-01-01
Response variability, a fundamental characteristic of behavior, may be in some cases an induced effect of reinforcement schedules. Research on schedule-induced response variability has shown that continuous reinforcement results in less variability than intermittent reinforcement schedules. Studies on the effects of intermittency of reinforcement,…
5 CFR 532.271 - Special wage schedules for National Park Service positions in overlap areas.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 5 Administrative Personnel 1 2012-01-01 2012-01-01 false Special wage schedules for National Park... wage schedules for National Park Service positions in overlap areas. (a)(1) The Department of the Interior shall establish special schedules for wage employees of the National Park Service whose duty...
5 CFR 532.271 - Special wage schedules for National Park Service positions in overlap areas.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Special wage schedules for National Park... wage schedules for National Park Service positions in overlap areas. (a)(1) The Department of the Interior shall establish special schedules for wage employees of the National Park Service whose duty...
5 CFR 532.271 - Special wage schedules for National Park Service positions in overlap areas.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 5 Administrative Personnel 1 2013-01-01 2013-01-01 false Special wage schedules for National Park... wage schedules for National Park Service positions in overlap areas. (a)(1) The Department of the Interior shall establish special schedules for wage employees of the National Park Service whose duty...
5 CFR 532.271 - Special wage schedules for National Park Service positions in overlap areas.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 5 Administrative Personnel 1 2014-01-01 2014-01-01 false Special wage schedules for National Park... wage schedules for National Park Service positions in overlap areas. (a)(1) The Department of the Interior shall establish special schedules for wage employees of the National Park Service whose duty...
5 CFR 532.271 - Special wage schedules for National Park Service positions in overlap areas.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 5 Administrative Personnel 1 2011-01-01 2011-01-01 false Special wage schedules for National Park... wage schedules for National Park Service positions in overlap areas. (a)(1) The Department of the Interior shall establish special schedules for wage employees of the National Park Service whose duty...
State Alternative Work Schedule Manual.
ERIC Educational Resources Information Center
Long, Marion C.; Post, Susan W.
During recent years, there has been increasing interest within both the public and private sectors in the use of alternative work schedules. While a sizable body of literature exists on the use of work scheduling variations among private employers, there is a dearth of information concerning the extent and impact of alternative work schedules in…
Psychological Distance to Reward: Effects of S+ Duration and the Delay Reduction It Signals
ERIC Educational Resources Information Center
Alessandri, Jerome; Stolarz-Fantino, Stephanie; Fantino, Edmund
2011-01-01
A concurrent-chains procedure was used to examine choice between segmented (two-component chained schedules) and unsegmented schedules (simple schedules) in terminal links with equal inter-reinforcement intervals. Previous studies using this kind of experimental procedure showed preference for unsegmented schedules for both pigeons and humans. In…
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-23
... Statement of Surety Companies--Schedule F AGENCY: Bureau of the Fiscal Service, Fiscal Service, Treasury... of Surety Companies--Schedule F.'' DATES: Written comments should be received on or before September... described below: Title: Annual Financial Statement of Surety Companies--Schedule F. OMB Number: 1510-0012...
Distributed intelligent scheduling of FMS
NASA Astrophysics Data System (ADS)
Wu, Zuobao; Cheng, Yaodong; Pan, Xiaohong
1995-08-01
In this paper, a distributed scheduling approach of a flexible manufacturing system (FMS) is presented. A new class of Petri nets called networked time Petri nets (NTPN) for system modeling of networking environment is proposed. The distributed intelligent scheduling is implemented by three schedulers which combine NTPN models with expert system techniques. The simulation results are shown.
NASA Technical Reports Server (NTRS)
Zhu, Zhifan; Gridnev, Sergei; Windhorst, Robert D.
2015-01-01
This User Guide describes SOSS (Surface Operations Simulator and Scheduler) software build and graphic user interface. SOSS is a desktop application that simulates airport surface operations in fast time using traffic management algorithms. It moves aircraft on the airport surface based on information provided by scheduling algorithm prototypes, monitors separation violation and scheduling conformance, and produces scheduling algorithm performance data.
Systemic Sustainability in RtI Using Intervention-Based Scheduling Methodologies
ERIC Educational Resources Information Center
Dallas, William P.
2017-01-01
This study evaluated a scheduling methodology referred to as intervention-based scheduling to address the problem of practice regarding the fidelity of implementing Response to Intervention (RtI) in an existing school schedule design. Employing panel data, this study used fixed-effects regressions and first differences ordinary least squares (OLS)…
Perceptions of Teachers in South Florida Toward Block Scheduling.
ERIC Educational Resources Information Center
Hamdy, Mona; Urich, Ted
1998-01-01
A study was conducted at two metropolitan South Florida high schools to determine perceptions of 100 teachers concerning block scheduling. Teachers felt that the 4 X 4 block schedule contained too many time gaps for teaching foreign languages, English, and math. Teachers believed block schedules benefitted advanced students more than others and…
Code of Federal Regulations, 2011 CFR
2011-01-01
... COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS § 712.9... notifications, and amendments include: (a) Annual declaration on past activities (Schedule 1 chemical production during the previous calendar year); (b) Annual report on exports and imports of Schedule 1 chemicals from...
15 CFR 712.1 - Round to zero rule that applies to activities involving Schedule 1 chemicals.
Code of Federal Regulations, 2011 CFR
2011-01-01
... CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS § 712.1 Round to zero rule that applies to activities involving Schedule 1 chemicals. Facilities that produce, export or... activities involving Schedule 1 chemicals. 712.1 Section 712.1 Commerce and Foreign Trade Regulations...
14 CFR 323.16 - Listings in schedule publications.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Listings in schedule publications. 323.16... schedule publications. Each air carrier filing a notice under § 323.3 (a)(2), (a)(4), (a)(5), or (c) shall continue to list the affected flights in all generally-distributed schedule publications in which the...
14 CFR 323.16 - Listings in schedule publications.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 14 Aeronautics and Space 4 2014-01-01 2014-01-01 false Listings in schedule publications. 323.16... schedule publications. Each air carrier filing a notice under § 323.3 (a)(2), (a)(4), (a)(5), or (c) shall continue to list the affected flights in all generally-distributed schedule publications in which the...
14 CFR 323.16 - Listings in schedule publications.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 14 Aeronautics and Space 4 2012-01-01 2012-01-01 false Listings in schedule publications. 323.16... schedule publications. Each air carrier filing a notice under § 323.3 (a)(2), (a)(4), (a)(5), or (c) shall continue to list the affected flights in all generally-distributed schedule publications in which the...
78 FR 21213 - Federal Employee Pay Schedules and Rates That Are Set by Administrative Discretion
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-10
... Employee Pay Schedules and Rates That Are Set by Administrative Discretion Memorandum for the Heads of... adjustments to any pay systems or pay schedules covering executive branch employees. In light of the Congress..., 2012, regarding general increases in pay schedules and employees' rates of pay that might otherwise...
75 FR 61840 - Proposed Collection; Comment Request for Form 5300 and Schedule Q (Form 5300)
Federal Register 2010, 2011, 2012, 2013, 2014
2010-10-06
... 5300 and Schedule Q (Form 5300) AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and... comments concerning Form 5300, Application for Determination for Employee Benefit Plan, and Schedule Q... Elective Determination Requests (Schedule Q (Form 5300)). OMB Number: 1545-0197. Form Number: Form 5300 and...
Scheduling Independent Partitions in Integrated Modular Avionics Systems
Du, Chenglie; Han, Pengcheng
2016-01-01
Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. All partitions in an IMA system should be integrated together according to a proper schedule such that their deadlines will be met even under the worst case situations. In order to help provide a proper scheduling table for all partitions in IMA systems, we study the schedulability of independent partitions on a multiprocessor platform in this paper. We firstly present an exact formulation to calculate the maximum scaling factor and determine whether all partitions are schedulable on a limited number of processors. Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. Finally, simulation experiments are conducted to show the efficiency and reliability of the approach proposed in terms of time consumption and acceptance ratio. PMID:27942013
Scheduling nurses’ shifts at PGI Cikini Hospital
NASA Astrophysics Data System (ADS)
Nainggolan, J. C. T.; Kusumastuti, R. D.
2018-03-01
Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.
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).
Short-term scheduling of an open-pit mine with multiple objectives
NASA Astrophysics Data System (ADS)
Blom, Michelle; Pearce, Adrian R.; Stuckey, Peter J.
2017-05-01
This article presents a novel algorithm for the generation of multiple short-term production schedules for an open-pit mine, in which several objectives, of varying priority, characterize the quality of each solution. A short-term schedule selects regions of a mine site, known as 'blocks', to be extracted in each week of a planning horizon (typically spanning 13 weeks). Existing tools for constructing these schedules use greedy heuristics, with little optimization. To construct a single schedule in which infrastructure is sufficiently utilized, with production grades consistently close to a desired target, a planner must often run these heuristics many times, adjusting parameters after each iteration. A planner's intuition and experience can evaluate the relative quality and mineability of different schedules in a way that is difficult to automate. Of interest to a short-term planner is the generation of multiple schedules, extracting available ore and waste in varying sequences, which can then be manually compared. This article presents a tool in which multiple, diverse, short-term schedules are constructed, meeting a range of common objectives without the need for iterative parameter adjustment.
Scheduling multimedia services in cloud computing environment
NASA Astrophysics Data System (ADS)
Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing
2018-02-01
Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.
NASA Technical Reports Server (NTRS)
Thalman, Nancy E.; Sparn, Thomas P.
1990-01-01
SURE (Science User Resource Expert) is one of three components that compose the SURPASS (Science User Resource Planning and Scheduling System). This system is a planning and scheduling tool which supports distributed planning and scheduling, based on resource allocation and optimization. Currently SURE is being used within the SURPASS by the UARS (Upper Atmospheric Research Satellite) SOLSTICE instrument to build a daily science plan and activity schedule and in a prototyping effort with NASA GSFC to demonstrate distributed planning and scheduling for the SOLSTICE II instrument on the EOS platform. For the SOLSTICE application the SURE utilizes a rule-based system. Development of a rule-based program using Ada CLIPS as opposed to using conventional programming, allows for capture of the science planning and scheduling heuristics in rules and provides flexibility in inserting or removing rules as the scientific objectives and mission constraints change. The SURE system's role as a component in the SURPASS, the purpose of the SURE planning and scheduling tool, the SURE knowledge base, and the software architecture of the SURE component are described.
Effects of conditioned reinforcement frequency in an intermittent free-feeding situation, 12
Zimmerman, Joseph; Hanford, Peter V.; Brown, Wyman
1967-01-01
Key-pecking intermittently produced a set of brief exteroceptive stimulus changes under two-component multiple schedules of conditioned reinforcement. Throughout the study, free access to grain was concurrently provided on an intermittent basis via a variable-interval tape. Free food presentations scheduled by the tape were delivered if no peck had been emitted for 6 sec, and the brief stimulus changes produced by responding under the multiple schedules were those which accompanied food presentation. The second component of each multiple schedule was always associated with a 1-min, variable-interval schedule of conditioned reinforcement. The schedule associated with the first component was systematically varied and conditioned reinforcement was either absent (extinction) or programmed on a 1-, 3-, 6-, or 12-min variable-interval schedule. Under these conditions, rate of responding in the manipulated component decreased monotonically with a decrease in the frequency of conditioned reinforcement. In addition, contrast effects were often obtained in the constant, second component. These results are similar to those obtained with similar multiple schedules of primary reinforcement. PMID:6033554
Belke, T W
2000-05-01
Six male Wistar rats were exposed to different orders of reinforcement schedules to investigate if estimates from Herrnstein's (1970) single-operant matching law equation would vary systematically with schedule order. Reinforcement schedules were arranged in orders of increasing and decreasing reinforcement rate. Subsequently, all rats were exposed to a single reinforcement schedule within a session to determine within-session changes in responding. For each condition, the operant was lever pressing and the reinforcing consequence was the opportunity to run for 15 s. Estimates of k and R(O) were higher when reinforcement schedules were arranged in order of increasing reinforcement rate. Within a session on a single reinforcement schedule, response rates increased between the beginning and the end of a session. A positive correlation between the difference in parameters between schedule orders and the difference in response rates within a session suggests that the within-session change in response rates may be related to the difference in the asymptotes. These results call into question the validity of parameter estimates from Herrnstein's (1970) equation when reinforcer efficacy changes within a session.
NRC comprehensive records disposition schedule. Revision 3
DOE Office of Scientific and Technical Information (OSTI.GOV)
NONE
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 durationmore » 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).« less
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.
Scheduling rules to achieve lead-time targets in outpatient appointment systems.
Nguyen, Thu-Ba T; Sivakumar, Appa Iyer; Graves, Stephen C
2017-12-01
This paper considers how to schedule appointments for outpatients, for a clinic that is subject to appointment lead-time targets for both new and returning patients. We develop heuristic rules, which are the exact and relaxed appointment scheduling rules, to schedule each new patient appointment (only) in light of uncertainty about future arrivals. The scheduling rules entail two decisions. First, the rules need to determine whether or not a patient's request can be accepted; then, if the request is not rejected, the rules prescribe how to assign the patient to an available slot. The intent of the scheduling rules is to maximize the utilization of the planned resource (i.e., the physician staff), or equivalently to maximize the number of patients that are admitted, while maintaining the service targets on the median, the 95th percentile, and the maximum appointment lead-times. We test the proposed scheduling rules with numerical experiments using real data from the chosen clinic of Tan Tock Seng hospital in Singapore. The results show the efficiency and the efficacy of the scheduling rules, in terms of the service-target satisfaction and the resource utilization. From the sensitivity analysis, we find that the performance of the proposed scheduling rules is fairly robust to the specification of the established lead-time targets.
Choice and conditioned reinforcement.
Fantino, E; Freed, D; Preston, R A; Williams, W A
1991-01-01
A potential weakness of one formulation of delay-reduction theory is its failure to include a term for rate of conditioned reinforcement, that is, the rate at which the terminal-link stimuli occur in concurrent-chains schedules. The present studies assessed whether or not rate of conditioned reinforcement has an independent effect upon choice. Pigeons responded on either modified concurrent-chains schedules or on comparable concurrent-tandem schedules. The initial link was shortened on only one of two concurrent-chains schedules and on only one of two corresponding concurrent-tandem schedules. This manipulation increased rate of conditioned reinforcement sharply in the chain but not in the tandem schedule. According to a formulation of delay-reduction theory, when the outcomes chosen (the terminal links) are equal, as in Experiment 1, choice should depend only on rate of primary reinforcement; thus, choice should be equivalent for the tandem and chain schedules despite a large difference in rate of conditioned reinforcement. When the outcomes chosen are unequal, however, as in Experiment 2, choice should depend upon both rate of primary reinforcement and relative signaled delay reduction; thus, larger preferences should occur in the chain than in the tandem schedules. These predictions were confirmed, suggesting that increasing the rate of conditioned reinforcement on concurrent-chains schedules may have no independent effect on choice. PMID:2037826
Seol, Ye-In; Kim, Young-Kuk
2014-01-01
Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.
2014-01-01
Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10–80% over the existing algorithms. PMID:25121126
U.S. Geological Survey Library classification system
Sasscer, R. Scott
2000-01-01
The U.S. Geological Survey Library classification system has been designed for earth science libraries. It is a tool for assigning call numbers to earth science and allied pure science materials in order to collect these materials into related subject groups on the library shelves and arrange them alphabetically by author and title. The classification can be used as a retrieval system to access materials through the subject and geographic numbers.The classification scheme has been developed over the years since 1904 to meet the ever-changing needs of increased specialization and the development of new areas of research in the earth sciences. The system contains seven schedules: Subject scheduleGeological survey schedule Earth science periodical scheduleGovernment document periodical scheduleGeneral science periodical schedule Earth science map schedule Geographic schedule Introduction provides detailed instructions on the construction of call numbers for works falling into the framework of the classification schedules.The tables following the introduction can be quickly accessed through the use of the newly expanded subject index.The purpose of this publication is to provide the earth science community with a classification and retrieval system for earth science materials, to offer sufficient explanation of its structure and use, and to enable library staff and clientele to classify or access research materials in a library collection.
Dispatch Scheduling of Automated Telescopes
NASA Astrophysics Data System (ADS)
Denny, R. B.
2004-05-01
Automated telescope scheduling systems have traditionally focused on optimiz- ing the use of the observatory, minimizing overhead and maximizing shutter- open time. However, educational and amateur observatories do not enjoy con- sistently good skies. Conditions can change significantly during an observing session, leading to schedule breakage. This gives rise to the need for a scheduling system that is capable of recovering from periods of bad skies, wind, etc. without operator intervention. The concept of dispatch scheduling, where the scheduler makes a "best" choice for the next observation, will be discussed. The choice of next target must consider constraints such as mini- mum altitude or maximum air mass, moon illumination, and sky condition, as well as timing constraints that may arise from linked observations and/or target phasing requirements. It also must be as fair and efficient as prac- tical. A dispatch scheduler (ACPS) was constructed and used to perform a num- ber of simulations with both isolated and multiple/linked observations, and noisy timing. By varying "best next target" choice algorithm, these simula- tions provided insight into the behavior of a dispatch scheduler. This talk will describe the scheduler and present the results of these preliminary sim- ulations, some conclusions that arose from them, and outline areas for fur- ther research.
NASA Astrophysics Data System (ADS)
Iles, E. J.; McCallum, L.; Lovell, J. E. J.; McCallum, J. N.
2018-02-01
As we move into the next era of geodetic VLBI, the scheduling process is one focus for improvement in terms of increased flexibility and the ability to react with changing conditions. A range of simulations were conducted to ascertain the impact of scheduling on geodetic results such as Earth Orientation Parameters (EOPs) and station coordinates. The potential capabilities of new automated scheduling modes were also simulated, using the so-called 'dynamic scheduling' technique. The primary aim was to improve efficiency for both cost and time without losing geodetic precision, particularly to maximise the uses of the Australian AuScope VLBI array. We show that short breaks in observation will not significantly degrade the results of a typical 24 h experiment, whereas simply shortening observing time degrades precision exponentially. We also confirm the new automated, dynamic scheduling mode is capable of producing the same standard of result as a traditional schedule, with close to real-time flexibility. Further, it is possible to use the dynamic scheduler to augment the 3 station Australian AuScope array and thereby attain EOPs of the current global precision with only intermittent contribution from 2 additional stations. We thus confirm automated, dynamic scheduling bears great potential for flexibility and automation in line with aims for future continuous VLBI operations.
Influences on cocaine tolerance assessed under a multiple conjunctive schedule of reinforcement.
Yoon, Jin Ho; Branch, Marc N
2009-11-01
Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the effects of cocaine on key-pecking responses of White Carneau pigeons maintained under a three-component multiple conjunctive FI (10 s, 30 s, & 120 s) FR (5 responses) schedule of food presentation. Dose-effect curves representing the effects of presession cocaine on responding were assessed in the context of (1) acute administration of cocaine (2) chronic administration of cocaine and (3) daily administration of saline. Chronic administration of cocaine generally resulted in tolerance to the response-rate decreasing effects of cocaine, and that tolerance was generally independent of relative FI value, as measured by changes in ED50 values. Daily administration of saline decreased ED50 values to those observed when cocaine was administered acutely. The results show that adding a FR requirement to FI schedules is not sufficient to produce schedule-parameter-specific tolerance. Tolerance to cocaine was generally independent of FI-parameter under the present conjunctive schedules, indicating that a ratio requirement, per se, is not sufficient for tolerance to be dependent on FI parameter.
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
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.
The GBT Dynamic Scheduling System: A New Scheduling Paradigm
NASA Astrophysics Data System (ADS)
O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.
2009-09-01
The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (< 20%) case where the actual weather does not match the predictions, a backup project, chosen from the database, is run instead. Here we give an overview of the GBT DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.
Teaching strategies and student achievement in high school block scheduled biology classes
NASA Astrophysics Data System (ADS)
Louden, Cynthia Knapp
The objectives of this study included determining whether teachers in block or traditionally scheduled biology classes (1) implement inquiry-based instruction more often or with different methods, (2) understand the concept of inquiry-based instruction as it is described in the National Science Standards, (3) have classes with significantly different student achievement, and (4) believe that their school schedule facilitates their use of inquiry-based instruction in the classroom. Biology teachers in block and non-block scheduled classes were interviewed, surveyed, and observed to determine the degree to which they implement inquiry-based instructional practices in their classrooms. State biology exams were used to indicate student achievement. Teachers in block scheduled and traditional classes used inquiry-based instruction with nearly the same frequency. Approximately 30% of all teachers do not understand the concept of inquiry-based instruction as described by the National Science Standards. No significant achievement differences between block and traditionally scheduled biology classes were found using ANCOVA analyses and a nonequivalent control-group quasi-experimental design. Using the same analysis techniques, significant achievement differences were found between biology classes with teachers who used inquiry-based instruction frequently and infrequently. Teachers in block schedules believed that their schedules facilitated inquiry-based instruction more than teachers in traditional schedules.
NASA Technical Reports Server (NTRS)
Davis, Randal; Thalman, Nancy
1993-01-01
The University of Colorado's Laboratory for Atmospheric and Space Physics (CU/LASP) along with the Goddard Space Flight Center (GSFC) and the Jet Propulsion Laboratory (JPL) designed, implemented, tested, and demonstrated a prototype of the distributed, hierarchical planning and scheduling system comtemplated for the Earth Observing System (EOS) project. The planning and scheduling prototype made use of existing systems: CU/LASP's Operations and Science Instrument Support Planning and Scheduling (OASIS-PS) software package; GSFC's Request Oriented Scheduling Engine (ROSE); and JPL's Plan Integrated Timeliner 2 (Plan-It-2). Using these tools, four scheduling nodes were implemented and tied together using a new communications protocol for scheduling applications called the Scheduling Applications Interface Language (SAIL). An extensive and realistic scenario of EOS satellite operations was then developed and the prototype scheduling system was tested and demonstrated using the scenario. Two demonstrations of the system were given to NASA personnel and EOS core system (ECS) contractor personnel. A comprehensive volume of lessons learned was generated and a meeting was held with NASA and ECS representatives to review these lessons learned. A paper and presentation on the project's final results was given at the American Institute of Aeronautics and Astronautics Computing in Aerospace 9 conference.
On program restructuring, scheduling, and communication for parallel processor systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Polychronopoulos, Constantine D.
1986-08-01
This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, thesemore » algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented.« less
NASA Technical Reports Server (NTRS)
Larsen, D. Gail; Schwieder, Paul R.
1993-01-01
Network video conferencing is advancing rapidly throughout the nation, and the Idaho National Engineering Laboratory (INEL), a Department of Energy (DOE) facility, is at the forefront of the development. Engineers at INEL/EG&G designed and installed a very unique DOE videoconferencing system, offering many outstanding features, that include true multipoint conferencing, user-friendly design and operation with no full-time operators required, and the potential for cost effective expansion of the system. One area where INEL/EG&G engineers made a significant contribution to video conferencing was in the development of effective, user-friendly, end station driven scheduling software. A PC at each user site is used to schedule conferences via a windows package. This software interface provides information to the users concerning conference availability, scheduling, initiation, and termination. The menus are 'mouse' controlled. Once a conference is scheduled, a workstation at the hubs monitors the network to initiate all scheduled conferences. No active operator participation is required once a user schedules a conference through the local PC; the workstation automatically initiates and terminates the conference as scheduled. As each conference is scheduled, hard copy notification is also printed at each participating site. Video conferencing is the wave of the future. The use of these user-friendly systems will save millions in lost productivity and travel cost throughout the nation. The ease of operation and conference scheduling will play a key role on the extent industry uses this new technology. The INEL/EG&G has developed a prototype scheduling system for both commercial and federal government use.
A customizable, scalable scheduling and reporting system.
Wood, Jody L; Whitman, Beverly J; Mackley, Lisa A; Armstrong, Robert; Shotto, Robert T
2014-06-01
Scheduling is essential for running a facility smoothly and for summarizing activities in use reports. The Penn State Hershey Clinical Simulation Center has developed a scheduling interface that uses off-the-shelf components, with customizations that adapt to each institution's data collection and reporting needs. The system is designed using programs within the Microsoft Office 2010 suite. Outlook provides the scheduling component, while the reporting is performed using Access or Excel. An account with a calendar is created for the main schedule, with separate resource accounts created for each room within the center. The Outlook appointment form's 2 default tabs are used, in addition to a customized third tab. The data are then copied from the calendar into either a database table or a spreadsheet, where the reports are generated.Incorporating this system into an institution-wide structure allows integration of personnel lists and potentially enables all users to check the schedule from their desktop. Outlook also has a Web-based application for viewing the basic schedule from outside the institution, although customized data cannot be accessed. The scheduling and reporting functions have been used for a year at the Penn State Hershey Clinical Simulation Center. The schedule has increased workflow efficiency, improved the quality of recorded information, and provided more accurate reporting. The Penn State Hershey Clinical Simulation Center's scheduling and reporting system can be adapted easily to most simulation centers and can expand and change to meet future growth with little or no expense to the center.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.
2009-08-01
Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisionsmore » are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.« less
Efficiently Scheduling Multi-core Guest Virtual Machines on Multi-core Hosts in Network Simulation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yoginath, Srikanth B; Perumalla, Kalyan S
2011-01-01
Virtual machine (VM)-based simulation is a method used by network simulators to incorporate realistic application behaviors by executing actual VMs as high-fidelity surrogates for simulated end-hosts. A critical requirement in such a method is the simulation time-ordered scheduling and execution of the VMs. Prior approaches such as time dilation are less efficient due to the high degree of multiplexing possible when multiple multi-core VMs are simulated on multi-core host systems. We present a new simulation time-ordered scheduler to efficiently schedule multi-core VMs on multi-core real hosts, with a virtual clock realized on each virtual core. The distinguishing features of ourmore » approach are: (1) customizable granularity of the VM scheduling time unit on the simulation time axis, (2) ability to take arbitrary leaps in virtual time by VMs to maximize the utilization of host (real) cores when guest virtual cores idle, and (3) empirically determinable optimality in the tradeoff between total execution (real) time and time-ordering accuracy levels. Experiments show that it is possible to get nearly perfect time-ordered execution, with a slight cost in total run time, relative to optimized non-simulation VM schedulers. Interestingly, with our time-ordered scheduler, it is also possible to reduce the time-ordering error from over 50% of non-simulation scheduler to less than 1% realized by our scheduler, with almost the same run time efficiency as that of the highly efficient non-simulation VM schedulers.« less
NASA Astrophysics Data System (ADS)
Larsen, D. Gail; Schwieder, Paul R.
1993-02-01
Network video conferencing is advancing rapidly throughout the nation, and the Idaho National Engineering Laboratory (INEL), a Department of Energy (DOE) facility, is at the forefront of the development. Engineers at INEL/EG&G designed and installed a very unique DOE videoconferencing system, offering many outstanding features, that include true multipoint conferencing, user-friendly design and operation with no full-time operators required, and the potential for cost effective expansion of the system. One area where INEL/EG&G engineers made a significant contribution to video conferencing was in the development of effective, user-friendly, end station driven scheduling software. A PC at each user site is used to schedule conferences via a windows package. This software interface provides information to the users concerning conference availability, scheduling, initiation, and termination. The menus are 'mouse' controlled. Once a conference is scheduled, a workstation at the hubs monitors the network to initiate all scheduled conferences. No active operator participation is required once a user schedules a conference through the local PC; the workstation automatically initiates and terminates the conference as scheduled. As each conference is scheduled, hard copy notification is also printed at each participating site. Video conferencing is the wave of the future. The use of these user-friendly systems will save millions in lost productivity and travel cost throughout the nation. The ease of operation and conference scheduling will play a key role on the extent industry uses this new technology. The INEL/EG&G has developed a prototype scheduling system for both commercial and federal government use.
NASA Astrophysics Data System (ADS)
Larsen, D. G.; Schwieder, P. R.
Network video conferencing is advancing rapidly throughout the nation, and the Idaho National Engineering Laboratory (INEL), a Department of Energy (DOE) facility, is at the forefront of the development. Engineers at INEL/EG&G designed and installed a very unique DOE video conferencing system, offering many outstanding features, that include true multipoint conferencing, user-friendly design and operation with no full-time operators required, and the potential for cost effective expansion of the system. One area where INEL/EG&G engineers made a significant contribution to video conferencing was in the development of effective, user-friendly, end station driven scheduling software. A PC at each user site is used to schedule conferences via a windows package. This software interface provides information to the users concerning conference availability, scheduling, initiation, and termination. The menus are 'mouse' controlled. Once a conference is scheduled, a workstation at the hub monitors the network to initiate all scheduled conferences. No active operator participation is required once a user schedules a conference through the local PC; the workstation automatically initiates and terminates the conference as scheduled. As each conference is scheduled, hard copy notification is also printed at each participating site. Video conferencing is the wave of the future. The use of these user-friendly systems will save millions in lost productivity and travel costs throughout the nation. The ease of operation and conference scheduling will play a key role on the extent industry uses this new technology. The INEL/EG&G has developed a prototype scheduling system for both commercial and federal government use.
Home Health Care for California's Injured Workers: Options for Implementing a Fee Schedule.
Wynn, Barbara O; Boustead, Anne
2015-07-15
The California Department of Industrial Relations/Division of Worker's Compensation asked RAND to provide technical assistance in developing a fee schedule for home health services provided to injured workers. The fee schedule needs to address the full spectrum of home health services ranging from skilled nursing and therapy services to unskilled personal care or chore services that may be provided by family members. RAND researchers consulted with stakeholders in the California workers' compensation system to outline issues the fee schedule should address, reviewed home health fee schedules used by other payers, and conducted interviews with WC administrators from other jurisdictions to elicit their experiences. California stakeholders identified unskilled attendant services as most problematic in determining need and payment rates, particularly services furnished by family members. RAND researchers concentrated on fee schedule options that would result in a single fee schedule covering the full range of home health care services furnished to injured workers and made three sets of recommendations. The first set pertains to obtaining additional information that would highlight the policy issues likely to occur with the implementation of the fee schedule and alternatives for assessing an injured worker's home health care needs. Another approach conforms most closely with the Labor Code requirements. It would integrate the fee schedules used by Medicare, In-Home Health Supportive Services, and the federal Office of Workers' Compensation. The third approach would base the home health fee schedule on rules used by the federal Office of Workers' Compensation.
Re-scheduling as a tool for the power management on board a spacecraft
NASA Technical Reports Server (NTRS)
Albasheer, Omar; Momoh, James A.
1995-01-01
The scheduling of events on board a spacecraft is based on forecast energy levels. The real time values of energy may not coincide with the forecast values; consequently, a dynamic revising to the allocation of power is needed. The re-scheduling is also needed for other reasons on board a spacecraft like the addition of new event which must be scheduled, or a failure of an event due to many different contingencies. This need of rescheduling is very important to the survivability of the spacecraft. In this presentation, a re-scheduling tool will be presented as a part of an overall scheme for the power management on board a spacecraft from the allocation of energy point of view. The overall scheme is based on the optimal use of energy available on board a spacecraft using expert systems combined with linear optimization techniques. The system will be able to schedule maximum number of events utilizing most energy available. The outcome is more events scheduled to share the operation cost of that spacecraft. The system will also be able to re-schedule in case of a contingency with minimal time and minimal disturbance of the original schedule. The end product is a fully integrated planning system capable of producing the right decisions in short time with less human error. The overall system will be presented with the re-scheduling algorithm discussed in detail, then the tests and results will be presented for validations.
NASA Astrophysics Data System (ADS)
Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi
Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.
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.
Avallone, Antonio; Pecori, Biagio; Bianco, Franco; Aloj, Luigi; Tatangelo, Fabiana; Romano, Carmela; Granata, Vincenza; Marone, Pietro; Leone, Alessandra; Botti, Gerardo; Petrillo, Antonella; Caracò, Corradina; Iaffaioli, Vincenzo R; Muto, Paolo; Romano, Giovanni; Comella, Pasquale; Budillon, Alfredo; Delrio, Paolo
2015-10-06
We have previously shown that an intensified preoperative regimen including oxaliplatin plus raltitrexed and 5-fluorouracil/folinic acid (OXATOM/FUFA) during preoperative pelvic radiotherapy produced promising results in locally advanced rectal cancer (LARC). Preclinical evidence suggests that the scheduling of bevacizumab may be crucial to optimize its combination with chemo-radiotherapy. This non-randomized, non-comparative, phase II study was conducted in MRI-defined high-risk LARC. Patients received three biweekly cycles of OXATOM/FUFA during RT. Bevacizumab was given 2 weeks before the start of chemo-radiotherapy, and on the same day of chemotherapy for 3 cycles (concomitant-schedule A) or 4 days prior to the first and second cycle of chemotherapy (sequential-schedule B). Primary end point was pathological complete tumor regression (TRG1) rate. The accrual for the concomitant-schedule was early terminated because the number of TRG1 (2 out of 16 patients) was statistically inconsistent with the hypothesis of activity (30%) to be tested. Conversely, the endpoint was reached with the sequential-schedule and the final TRG1 rate among 46 enrolled patients was 50% (95% CI 35%-65%). Neutropenia was the most common grade ≥ 3 toxicity with both schedules, but it was less pronounced with the sequential than concomitant-schedule (30% vs. 44%). Postoperative complications occurred in 8/15 (53%) and 13/46 (28%) patients in schedule A and B, respectively. At 5 year follow-up the probability of PFS and OS was 80% (95%CI, 66%-89%) and 85% (95%CI, 69%-93%), respectively, for the sequential-schedule. These results highlights the relevance of bevacizumab scheduling to optimize its combination with preoperative chemo-radiotherapy in the management of LARC.
Automated Long - Term Scheduling for the SOFIA Airborne Observatory
NASA Technical Reports Server (NTRS)
Civeit, Thomas
2013-01-01
The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.
An investigation on impacts of scheduling configurations on Mississippi biology subject area testing
NASA Astrophysics Data System (ADS)
Marchette, Frances Lenora
The purpose of this mixed modal study was to compare the results of Biology Subject Area mean scores of students on a 4 x 4 block schedule, A/B block schedule, and traditional year-long schedule for 1A to 5A size schools. This study also reviewed the data to determine if minority or gender issues might influence the test results. Interviews with administrators and teachers were conducted about the type of schedule configuration they use and the influence that the schedule has on student academic performance on the Biology Subject Area Test. Additionally, this research further explored whether schedule configurations allow sufficient time for students to construct knowledge. This study is important to schools, teachers, and administrators because it can assist them in considering the impacts that different types of class schedules have on student performance and if ethnic or gender issues are influencing testing results. This study used the causal-comparative method for the quantitative portion of the study and constant comparative method for the qualitative portion to explore the relationship of school schedules on student academic achievement on the Mississippi Biology Subject Area Test. The aggregate means of selected student scores indicate that the Mississippi Biology Subject Area Test as a measure of student performance reveals no significant difference on student achievement for the three school schedule configurations. The data were adjusted for initial differences of gender, minority, and school size on the three schedule configurations. The results suggest that schools may employ various schedule configurations and expect student performance on the Mississippi Biology Subject Area Test to be unaffected. However, many areas of concern were identified in the interviews that might impact on school learning environments. These concerns relate to effective classroom management, the active involvement of students in learning, the adequacy of teacher education programs and the stress of testing on everyone involved in high-stakes testing.
Glanz, Jason M; Newcomer, Sophia R; Jackson, Michael L; Omer, Saad B; Bednarczyk, Robert A; Shoup, Jo Ann; DeStefano, Frank; Daley, Matthew F
2016-02-15
While the large majority of parents in the U.S. vaccinate their children according to the recommended immunization schedule, some parents have refused or delayed vaccinating, often citing safety concerns. In response to public concern, the U.S. Institute of Medicine (IOM) evaluated existing research regarding the safety of the recommended immunization schedule. The IOM concluded that although available evidence strongly supported the safety of the currently recommended schedule as a whole, additional observational research was warranted to compare health outcomes between fully vaccinated children and those on a delayed or alternative schedule. In addition, the IOM identified the Vaccine Safety Datalink (VSD) as an important resource for conducting this research. Guided by the IOM findings, the Centers for Disease Control and Prevention (CDC) commissioned a White Paper to assess how the VSD could be used to study the safety of the childhood immunization schedule. Guided by subject matter expert engagement, the resulting White Paper outlines a 4 stage approach for identifying exposure groups of undervaccinated children, presents a list of health outcomes of highest priority to examine in this context, and describes various study designs and statistical methods that could be used to analyze the safety of the schedule. While it appears feasible to study the safety of the recommended immunization schedule in settings such as the VSD, these studies will be inherently complex, and as with all observational studies, will need to carefully address issues of confounding and bias. In light of these considerations, decisions about conducting studies of the safety of the schedule will also need to assess epidemiological evidence of potential adverse events that could be related to the schedule, the biological plausibility of an association between an adverse event and the schedule, and public concern about the safety of the schedule. Copyright © 2015 Elsevier Ltd. All rights reserved.
The application of artificial intelligence to astronomical scheduling problems
NASA Technical Reports Server (NTRS)
Johnston, Mark D.
1992-01-01
Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike to other problem domains, and plans for the future evolution of the system.
Enabling New Operations Concepts for Lunar and Mars Exploration
NASA Astrophysics Data System (ADS)
Jaap, John; Maxwell, Theresa
2005-02-01
The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the ``operations concept'' that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a ``job jar'' of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space Flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically; and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.
Enabling New Operations Concepts for Lunar and Mars Exploration
NASA Technical Reports Server (NTRS)
Jaap, John; Maxwell, Theresa
2005-01-01
The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the operations concept that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a job jar of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically, and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.
Traditional/Block Scheduling, Gender, and Test Scores in College Biology Course
ERIC Educational Resources Information Center
Huelskamp, Diana
2014-01-01
Block scheduling is the reallocation of a school day into longer class sessions to allow for more active teaching strategies and active engagement of students, in the effort to increase student performance. Various types of block scheduling exist. Traditional scheduling is when the school day is divided into six to eight sessions, with each…
DOT National Transportation Integrated Search
1995-05-01
Air Traffic Control Specialists (ATCS) work rotating shift schedules for most of their careers. Specifically, many work a counterclockwise rotating shift schedule, called the 2-2-1, or some variation of the schedule. The 2-2-1 involves rotating from ...
Collaborative Scheduling Using JMS in a Mixed Java and .NET Environment
NASA Technical Reports Server (NTRS)
Wang, Yeou-Fang; Wax, Allan; Lam, Ray; Baldwin, John; Borden, Chet
2006-01-01
A viewgraph presentation to demonstrate collaborative scheduling using Java Message Service (JMS) in a mixed Java and .Net environment is given. The topics include: 1) NASA Deep Space Network scheduling; 2) Collaborative scheduling concept; 3) Distributed computing environment; 4) Platform concerns in a distributed environment; 5) Messaging and data synchronization; and 6) The prototype.
45 CFR 2552.52 - What factors are considered in determining a Foster Grandparent's service schedule?
Code of Federal Regulations, 2011 CFR
2011-10-01
... Grandparent's service schedule? (a) Travel time between the Foster Grandparent's home and place of assignment is not part of the service schedule and is not stipended. (b) Travel time between individual assignments is a part of the service schedule and is stipended. (c) Meal time may be part of the service...
45 CFR 2552.52 - What factors are considered in determining a Foster Grandparent's service schedule?
Code of Federal Regulations, 2010 CFR
2010-10-01
... Grandparent's service schedule? (a) Travel time between the Foster Grandparent's home and place of assignment is not part of the service schedule and is not stipended. (b) Travel time between individual assignments is a part of the service schedule and is stipended. (c) Meal time may be part of the service...
The Causal Effect of the School Day Schedule on Adolescents' Academic Achievement
ERIC Educational Resources Information Center
Shapiro, Teny M.; Williams, Kevin M.
2015-01-01
This study looks at the causal impact of the school day schedule on student achievement. How a student's classes are scheduled throughout the day is often determined by necessity, but can have a meaningful impact on academic performance. Acknowledging students' internal clocks and making small changes to scheduling patters could be a relatively…
New Kids on the Block Schedule: Beginning Teachers Face Challenges
ERIC Educational Resources Information Center
Zepeda, Sally J.; Mayers, R. Stewart
2001-01-01
Across the United States, an ever-increasing number of high schools have reevaluated their use of instructional time and have adopted some form of a block schedule. Block scheduling, an innovation grounded in Trump's Flexible Modular Scheduling Design, reorganizes the school day into extended blocks of time, each approximately 70 to 90 minutes.…
Block Scheduling in Missouri: A Study of Administrator and Teacher Perceptions.
ERIC Educational Resources Information Center
Stader, David L.; DeSpain, B. C.
This paper reports on a Missouri study that compared block scheduling to traditional schedules in small high schools (schools with fewer than 500 students in grades 9 to 12). The study focused on small-school administrator and teacher perceptions of the effects of block scheduling on student achievement, school climate, and teacher methodology.…
Room Use for Group Instruction in Regularly Scheduled Classes.
ERIC Educational Resources Information Center
Phay, John E.; McCary, Arthur D.
A method by which accurate accounting by computer might be made of apace and room use by regularly scheduled classes in institutions of higher learning is furnished. Based on well-defined terms, a master room schedule and a master course schedule are prepared on computer cards. This information is then compared with the reported individual room…
Time and Learning: Scheduling for Success. Hot Topics Series.
ERIC Educational Resources Information Center
Kennedy, Robert L., Ed.; Witcher, Ann E., Ed.
This book provides information for educators considering ways to make the best use of time available for learning. Twenty-one articles are divided into 5 chapters. Chapter 1: "How Can We Make the Most of the School Day?" includes an overview and 6 articles: (1) "Block Scheduling" (Karen Irmsher); (2)"The Hybrid Schedule: Scheduling to the…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-06-28
... Change Relating to Technical and Conforming Amendments to the Pricing Schedule June 22, 2012. Pursuant to... amendments to the Pricing Schedule to format pricing the same throughout the Pricing Schedule, correct a... Proposed Rule Change 1. Purpose The Exchange proposes to make clarifying amendments to the Pricing Schedule...
15 CFR Supplement No. 1 to Part 745 - Schedules of Chemicals
Code of Federal Regulations, 2014 CFR
2014-01-01
... 15 Commerce and Foreign Trade 2 2014-01-01 2014-01-01 false Schedules of Chemicals No. Supplement... CHEMICAL WEAPONS CONVENTION REQUIREMENTS Pt. 745, Supp. 1 Supplement No. 1 to Part 745—Schedules of Chemicals C.A.S. Registry No. Schedule 1 A. Toxic chemicals: (1) O-Alkyl (≤C10, incl. cycloalkyl) alkyl (Me...
15 CFR Supplement No. 1 to Part 745 - Schedules of Chemicals
Code of Federal Regulations, 2012 CFR
2012-01-01
... 15 Commerce and Foreign Trade 2 2012-01-01 2012-01-01 false Schedules of Chemicals No. Supplement... CHEMICAL WEAPONS CONVENTION REQUIREMENTS Pt. 745, Supp. 1 Supplement No. 1 to Part 745—Schedules of Chemicals C.A.S. Registry No. Schedule 1 A. Toxic chemicals: (1) O-Alkyl (≤C10, incl. cycloalkyl) alkyl (Me...
15 CFR Supplement No. 1 to Part 745 - Schedules of Chemicals
Code of Federal Regulations, 2013 CFR
2013-01-01
... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Schedules of Chemicals No. Supplement... CHEMICAL WEAPONS CONVENTION REQUIREMENTS Pt. 745, Supp. 1 Supplement No. 1 to Part 745—Schedules of Chemicals C.A.S. Registry No. Schedule 1 A. Toxic chemicals: (1) O-Alkyl (≤C10, incl. cycloalkyl) alkyl (Me...
Some Determinants of Remote Behavioral History Effects in Humans
ERIC Educational Resources Information Center
Hirai, Mariko; Okouchi, Hiroto; Matsumoto, Akio; Lattal, Kennon A.
2011-01-01
Undergraduates were exposed to a series of reinforcement schedules: first, to a fixed-ratio (FR) schedule in the presence of one stimulus and to a differential-reinforcement-of-low-rate (DRL) schedule in the presence of another (multiple FR DRL training), then to a fixed-interval (FI) schedule in the presence of a third stimulus (FI baseline),…
ERIC Educational Resources Information Center
Stambaugh, Laura A.; Demorest, Steven M.
2010-01-01
The effects of three practice schedules on beginning instrumental achievement were explored. A total of 19 seventh-grade clarinet and saxophone students completed one 18-minute practice session using either a blocked schedule causing a low level of cognitive (contextual) interference, a hybrid schedule causing a moderate level of interference, or…
Code of Federal Regulations, 2011 CFR
2011-07-01
... machine cards not available from Federal Supply Schedule contracts. 101-26.509-2 Section 101-26.509-2... Programs § 101-26.509-2 Requisitioning tabulating machine cards not available from Federal Supply Schedule contracts. (a) Requisitions for tabulating machine cards covered by Federal Supply Schedule contracts which...
Code of Federal Regulations, 2010 CFR
2010-07-01
... Can flexitime and other alternative work schedules cost the customer agency more? Yes, GSA customers who extend their regular work schedule by a system of flexible hours shall reimburse GSA for its... alternative work schedules cost the customer agency more? 102-85.170 Section 102-85.170 Public Contracts and...
ERIC Educational Resources Information Center
Bureau of National Affairs, Inc., Washington, DC.
Though the traditional 9:00-to-5:00 work week remains the predominant scheduling choice of most employers, companies in all industries increasingly are using alternative scheduling methods that allow employees to balance their work and family responsibilities. Alternative work schedules for permanent employees frequently are advocated as a…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-07-24
... Change Amending the NYSE Arca Equities Schedule of Fees and Charges for Exchange Services July 18, 2012... the NYSE Arca Equities Schedule of Fees and Charges for Exchange Services (``Fee Schedule''). The... Exchange proposes to amend the Fee Schedule, as described below, and implement the fee changes on July 12...
77 FR 23277 - Wekiva River System Advisory Management Committee Meetings (FY2012)
Federal Register 2010, 2011, 2012, 2013, 2014
2012-04-18
...: Notice of upcoming scheduled meetings. SUMMARY: This notice announces a schedule of upcoming meetings for... 5, 2012 (Recreation Hall). Time: All scheduled meetings will begin at 3 p.m. and will end by 5 p.m... public. Each scheduled meeting will result in decisions and steps that advance the Wekiva River System...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-12-14
... code ``F'', and will not include Royalty Fees, which are pass-through fees whose purpose is to cover..., Inc. Amending Its Fee Schedule December 8, 2010. Pursuant to Section 19(b)(1) of the Securities... proposes to amend its Fee Schedule (the ``Schedule''). While changes to the Schedule pursuant to this...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-12-20
...] Schedules of Controlled Substances: Placement of 5-Methoxy-N,N- Dimethyltryptamine into Schedule I of the... Administration (DEA) places the substance 5- methoxy-N,N-dimethyltryptamine (5-MeO-DMT), including its salts..., actual abuse, pattern of abuse, and the relative potential for abuse of 5-methoxy-N,N-dimethyltryptamine...
ERIC Educational Resources Information Center
Belke, Terry W.
2010-01-01
Previous research suggested that allocation of responses on concurrent schedules of wheel-running reinforcement was less sensitive to schedule differences than typically observed with more conventional reinforcers. To assess this possibility, 16 female Long Evans rats were exposed to concurrent FR FR schedules of reinforcement and the schedule…
Federal Register 2010, 2011, 2012, 2013, 2014
2011-09-30
... Construction Permits Scheduled for March 27, 2012; Comment Sought on Competitive Bidding Procedures for Auction... auction of certain FM broadcast construction permits scheduled to commence on March 27, 2012. This... construction permits and seek comment on the procedures to be used for this auction. This auction is scheduled...
Faculty Salary Schedules in Community-Junior Colleges, 1969-70.
ERIC Educational Resources Information Center
National Education Association, Washington, DC. Research Div.
This report reviews and analyzes the 1969-1970 salary schedules of 52 private and 460 public 2-year colleges throughout the United States. These schedules are based on levels of academic preparation completed, faculty rank, or both (about two-thirds of the reviewed public and one-half the reviewed private institutions base their schedules on level…
Code of Federal Regulations, 2011 CFR
2011-01-01
... CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS Pt. 713, Supp. 2... following any calendar year in which the production, processing, or consumption of a Schedule 2 chemical... exports or imports of a Schedule 2 chemical by a plant site, trading company, or other person subject to...
Code of Federal Regulations, 2011 CFR
2011-01-01
... COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 2 CHEMICALS § 713.3 Annual declaration and reporting requirements for exports and imports of Schedule 2 chemicals. (a) Declarations and... requirements for exports and imports of Schedule 2 chemicals. 713.3 Section 713.3 Commerce and Foreign Trade...
12 CFR 1005.36 - Transfers scheduled before the date of transfer.
Code of Federal Regulations, 2014 CFR
2014-01-01
... of transfer. (a) Timing. (1) For a one-time transfer scheduled five or more business days before the... the timing requirements of that section. (b) Accuracy. (1) For a one-time transfer scheduled five or... 12 Banks and Banking 8 2014-01-01 2014-01-01 false Transfers scheduled before the date of transfer...
12 CFR 1005.36 - Transfers scheduled in advance.
Code of Federal Regulations, 2013 CFR
2013-01-01
...: § 1005.36 Transfers scheduled before the date of transfer. (a) Timing. (1) For a one-time transfer...) For a one-time transfer scheduled five or more business days in advance or for the first in a series... 12 Banks and Banking 8 2013-01-01 2013-01-01 false Transfers scheduled in advance. 1005.36 Section...
49 CFR Appendix A to Part 242 - Schedule of Civil Penalties
Code of Federal Regulations, 2012 CFR
2012-10-01
... 49 Transportation 4 2012-10-01 2012-10-01 false Schedule of Civil Penalties A Appendix A to Part... Appendix A to Part 242—Schedule of Civil Penalties A penalty may be assessed against an individual only for...—Schedule of Civil Penalties 1 Section Violation Willful violation Subpart B—Program and Eligibility...
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.
Production scheduling and rescheduling with genetic algorithms.
Bierwirth, C; Mattfeld, D C
1999-01-01
A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quality of schedules. Finally, this technique is tested for scheduling and rescheduling in a non-deterministic environment. It is shown by experiment that conventional methods of production control are clearly outperformed at reasonable run-time costs.
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.
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.
Scheduling multicore workload on shared multipurpose clusters
NASA Astrophysics Data System (ADS)
Templon, J. A.; Acosta-Silva, C.; Flix Molina, J.; Forti, A. C.; Pérez-Calero Yzquierdo, A.; Starink, R.
2015-12-01
With the advent of workloads containing explicit requests for multiple cores in a single grid job, grid sites faced a new set of challenges in workload scheduling. The most common batch schedulers deployed at HEP computing sites do a poor job at multicore scheduling when using only the native capabilities of those schedulers. This paper describes how efficient multicore scheduling was achieved at the sites the authors represent, by implementing dynamically-sized multicore partitions via a minimalistic addition to the Torque/Maui batch system already in use at those sites. The paper further includes example results from use of the system in production, as well as measurements on the dependence of performance (especially the ramp-up in throughput for multicore jobs) on node size and job size.
Penrod, Becky; Wallace, Michele D; Dyer, Edwin J
2008-01-01
Previous research has suggested that the availability of high-preference stimuli may override the reinforcing efficacy of concurrently available low-preference stimuli under relatively low schedule requirements (e.g., fixed-ratio 1 schedule). It is unknown if similar effects would be obtained under higher schedule requirements. Thus, the current study compared high-preference and low-preference reinforcers under progressively increasing schedule requirements. Results for 3 of the 4 participants indicated that high-preference stimuli maintained responding under higher schedule requirements relative to low-preference stimuli. For 1 participant, high-preference and low-preference stimuli were demonstrated to be equally effective reinforcers under increasing schedule requirements. Implications with respect to rate of performance and response patterns are discussed.
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.
A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications
NASA Astrophysics Data System (ADS)
Entezari-Maleki, Reza; Movaghar, Ali
Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms.
An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint
NASA Technical Reports Server (NTRS)
Garcia, Christopher; Rabadi, Ghaith
2010-01-01
Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.
Explanation of Registration Review Schedule
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.
2001-08-28
This final rule implements fee schedules for payment of parenteral and enteral nutrition (PEN) items and services furnished under the prosthetic device benefit, defined in section 1861(s)(8) of the Social Security Act. The authority for establishing these fee schedules is provided by the Balanced Budget Act of 1997, which amended the Social Security Act at section 1842(s). Section 1842(s) of the Social Security Act specifies that statewide or other area wide fee schedules may be implemented for the following items and services still subject to the reasonable charge payment methodology: medical supplies; home dialysis supplies and equipment; therapeutic shoes; parenteral and enteral nutrients, equipment, and supplies; electromyogram devices; salivation devices; blood products; and transfusion medicine. This final rule describes changes made to the proposed fee schedule payment methodology for these items and services and provides that the fee schedules for PEN items and services are effective for all covered items and services furnished on or after January 1, 2002. Fee schedules will not be implemented for electromyogram devices and salivation devices at this time since these items are not covered by Medicare. In addition, fee schedules will not be implemented for medical supplies, home dialysis supplies and equipment, therapeutic shoes, blood products, and transfusion medicine at this time since the data required to establish these fee schedules are inadequate.
Scholz, Markus; Ackermann, Manuela; Emmrich, Frank; Loeffler, Markus; Kamprad, Manja
2009-01-01
Objectives Recombinant human granulocyte colony-stimulating factor (rhG-CSF) is widely used to treat neutropenia during cytotoxic chemotherapy. The optimal scheduling of rhG-CSF is unknown and can hardly be tested in clinical studies due to numerous therapy parameters affecting outcome (chemotherapeutic regimen, rhG-CSF schedules, individual covariables). Motivated by biomathematical model simulations, we aim to investigate different rhG-CSF schedules in a preclinical chemotherapy mouse model. Methods The time course of hematotoxicity was studied in CD-1 mice after cyclophosphamide (CP) administration. Filgrastim was applied concomitantly in a 2 × 3-factorial design of two dosing options (2 × 20 μg and 4 × 10 μg) and three timing options (directly, one, and two days after CP). Alternatively, a single dose of 40 μg pegfilgrastim was applied at the three timing options. The resulting cytopenia was compared among the schedules. Results Dosing and timing had a significant influence on the effectiveness of filgrastim schedules whereas for pegfilgrastim the timing effect was irrelevant. The best filgrastim and pegfilgrastim schedules exhibited equivalent toxicity. Monocytes dynamics performed analogously to granulocytes. All schedules showed roughly the same lymphotoxicity. Conclusion We conclude that effectiveness of filgrastim application depends heavily on its scheduling during chemotherapy. There is an optimum of timing. Dose splitting is better than concentrated applications. Effectiveness of pegfilgrastim is less dependent on timing. PMID:19707393
Scholz, Markus; Ackermann, Manuela; Emmrich, Frank; Loeffler, Markus; Kamprad, Manja
2009-01-01
Recombinant human granulocyte colony-stimulating factor (rhG-CSF) is widely used to treat neutropenia during cytotoxic chemotherapy. The optimal scheduling of rhG-CSF is unknown and can hardly be tested in clinical studies due to numerous therapy parameters affecting outcome (chemotherapeutic regimen, rhG-CSF schedules, individual covariables). Motivated by biomathematical model simulations, we aim to investigate different rhG-CSF schedules in a preclinical chemotherapy mouse model. The time course of hematotoxicity was studied in CD-1 mice after cyclophosphamide (CP) administration. Filgrastim was applied concomitantly in a 2 x 3-factorial design of two dosing options (2 x 20 mug and 4 x 10 mug) and three timing options (directly, one, and two days after CP). Alternatively, a single dose of 40 mug pegfilgrastim was applied at the three timing options. The resulting cytopenia was compared among the schedules. Dosing and timing had a significant influence on the effectiveness of filgrastim schedules whereas for pegfilgrastim the timing effect was irrelevant. The best filgrastim and pegfilgrastim schedules exhibited equivalent toxicity. Monocytes dynamics performed analogously to granulocytes. All schedules showed roughly the same lymphotoxicity. We conclude that effectiveness of filgrastim application depends heavily on its scheduling during chemotherapy. There is an optimum of timing. Dose splitting is better than concentrated applications. Effectiveness of pegfilgrastim is less dependent on timing.
Sustainable employability in shiftwork: related to types of work schedule rather than age.
Peters, Velibor; Engels, Josephine A; de Rijk, Angelique E; Nijhuis, Frans J N
2015-10-01
There is scarce research on age and sustainable employability of nurses working in various types of work schedules. Earlier research showed that nurses working in work schedules differ regarding age. Different operationalisations of age might explain variations in sustainable employability. Therefore, the aim of this study was to investigate how nurses working in various types of work schedule differ regarding sustainable employability, and the role that age plays in these differences. Age was defined as chronological age, organisational age, life-span age, and functional age. Questionnaires were distributed to 974 Dutch nurses in residential elder care (response rate 51 %) with questions about the type of work schedule, aspects of sustainable employability, various operationalisations of age, and registered sickness absence data were used. Nurses working in various types of work schedules differed regarding aspects of sustainable employability, also when operationalisations of age were added. The 'life-span age' was directly related to aspects of sustainable employability. Statistically, work ability and job satisfaction were only explained by varying operationalisations of age. Nurses' sustainable employability appeared to be mainly related to differences between the types of work schedule rather than age. Fixed early shifts are characterised by the most positive aspects of sustainable employability, and three rotating schedules score worst. To improve sustainable employability, organisations should implement a system in which nurses with different types of work schedule are monitored in combination with their life-span perspective.
Wearden, J H; Lejeune, Helga
2006-02-28
The article deals with response rates (mainly running and peak or terminal rates) on simple and on some mixed-FI schedules and explores the idea that these rates are determined by the average delay of reinforcement for responses occurring during the response periods that the schedules generate. The effects of reinforcement delay are assumed to be mediated by a hyperbolic delay of reinforcement gradient. The account predicts that (a) running rates on simple FI schedules should increase with increasing rate of reinforcement, in a manner close to that required by Herrnstein's equation, (b) improving temporal control during acquisition should be associated with increasing running rates, (c) two-valued mixed-FI schedules with equiprobable components should produce complex results, with peak rates sometimes being higher on the longer component schedule, and (d) that effects of reinforcement probability on mixed-FI should affect the response rate at the time of the shorter component only. All these predictions were confirmed by data, although effects in some experiments remain outside the scope of the model. In general, delay of reinforcement as a determinant of response rate on FI and related schedules (rather than temporal control on such schedules) seems a useful starting point for a more thorough analysis of some neglected questions about performance on FI and related schedules.
Zhang, Hui; Schaubel, Douglas E; Kalbfleisch, John D; Bragg-Gresham, Jennifer L; Robinson, Bruce M; Pisoni, Ronald L; Canaud, Bernard; Jadoul, Michel; Akiba, Takashi; Saito, Akira; Port, Friedrich K; Saran, Rajiv
2012-01-01
The risk of death for hemodialysis patients is thought to be highest on the days following the longest interval without dialysis (usually Mondays and Tuesdays); however, existing results are inconclusive. To clarify this we analyzed Dialysis Outcomes and Practice Patterns Study (DOPPS) data of 22,163 hemodialysis patients from the United States, Europe and Japan. Our study focused on the association between dialysis schedule and day-of-week of all-cause, cardiovascular and non-cardiovascular mortality with day-of-week coding as a time-dependent covariate. The models were adjusted for dialysis schedule, age, country, DOPPS Phase I or II, and other demographic and clinical covariates comparing mortality on each day to the 7-day average. Patients on a Monday-Wednesday-Friday (MFW) schedule had elevated all-cause mortality on Monday, and those on a Tuesday-Thursday-Saturday (TTS) schedule increased risk of mortality on Tuesday in all 3 regions. The association between day-of-week mortality and schedule was generally stronger for cardiovascular than non-cardiovascular mortality, and most pronounced in the United States. Unexpectedly, Japanese patients on a MWF schedule had a higher risk of non-cardiovascular mortality on Fridays, and European patients on a TTS schedule experienced an elevated cardiovascular mortality on Saturdays. Thus, future studies are needed to evaluate the influence of practice patterns on schedule-specific mortality and factors that could modulate this effect. PMID:22297673
21 CFR 1301.33 - Application for bulk manufacture of Schedule I and II substances.
Code of Federal Regulations, 2010 CFR
2010-04-01
... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Application for bulk manufacture of Schedule I and... manufacture of Schedule I and II substances. (a) In the case of an application for registration or reregistration to manufacture in bulk a basic class of controlled substance listed in Schedule I or II, the...
78 FR 19580 - Proposed Collection; Comment Request for Information Collection Tools
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-01
... transmit W-2 series forms to the Social Security Administration. Forms W-2c, W-3c and W-3cPR are used to.... Income Tax Return, Schedule B- Additional Information for Schedule M-3 Filers, Schedule D-Capital Gains... gains and losses from the sale of capital assets. Schedule H (Form 1120) is used by personal service...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-02-06
... Change To Amend the NYSE Arca Options Fee Schedule To Change the Monthly Cost for Option Trading Permits... proposes to amend the NYSE Arca Options Fee Schedule (``Fee Schedule'') to change the monthly cost for... its Fee Schedule to change the monthly cost for OTPs. The Exchange proposes to make the change...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-30
... Change Amending the NYSE Arca Options Fee Schedule To Change the Monthly Cost for Option Trading Permits... proposes to amend the NYSE Arca Options Fee Schedule (``Fee Schedule'') to change the monthly cost for... amend its Fee Schedule to change the monthly cost for OTPs. The Exchange proposes to make the change...
Value of Conditioned Reinforcers as a Function of Temporal Context
ERIC Educational Resources Information Center
O'Daly, Matthew; Meyer, Steven; Fantino, Edmund
2005-01-01
In two experiments, pigeons were trained on a multiple-chain schedule, in which the initial link for one chain was a variable-interval (VI) 100s schedule and for the other chain a VI 10s schedule. The terminal links were both fixed-time 30s schedules signaled by differently colored stimuli. Following training, the pigeons had their preference for…
Code of Federal Regulations, 2010 CFR
2010-01-01
... SECURITY, DEPARTMENT OF COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 1 CHEMICALS Pt. 712, Supp. 2 Supplement No. 2 to Part 712—Deadlines for Submission of Schedule 1 Declarations... following any calendar year in which more than 100 grams aggregate of Schedule 1 chemicals were produced...
Code of Federal Regulations, 2013 CFR
2013-01-01
...)(2) of this section if you produced at your facility in excess of 100 grams aggregate of Schedule 1... you will produce at your facility more than 100 grams aggregate of Schedule 1 chemicals in the next... result in production of more than 100 grams aggregate of Schedule 1 chemicals. (b) Declaration forms to...
Code of Federal Regulations, 2011 CFR
2011-01-01
...)(2) of this section if you produced at your facility in excess of 100 grams aggregate of Schedule 1... you will produce at your facility more than 100 grams aggregate of Schedule 1 chemicals in the next... result in production of more than 100 grams aggregate of Schedule 1 chemicals. (b) Declaration forms to...
Code of Federal Regulations, 2014 CFR
2014-01-01
...)(2) of this section if you produced at your facility in excess of 100 grams aggregate of Schedule 1... you will produce at your facility more than 100 grams aggregate of Schedule 1 chemicals in the next... result in production of more than 100 grams aggregate of Schedule 1 chemicals. (b) Declaration forms to...
ERIC Educational Resources Information Center
Koyama, Takanori; Wang, Hui-Ting
2011-01-01
A literature review was conducted on the effectiveness of activity schedules. Twenty three studies that a) were peer-reviewed, b) were experimental, c) implemented activity schedule as a primary intervention, d) incorporated multiple activities, and e) aimed to teach learners to self-manage individual schedules were included in the review. The…
78 FR 23981 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-23
... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income... Share of Income, Deductions, Credits, etc. (Schedule K-1). OMB Number: 1545-0092. Form Number: 1041 and...
Code of Federal Regulations, 2012 CFR
2012-01-01
... year in which exports or imports of a Schedule 3 chemical by a plant site, trading company, or other... chemical and the export or import of the same or a different Schedule 3 chemical by a declared plant site... CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 2...
Code of Federal Regulations, 2013 CFR
2013-01-01
... a Schedule 3 chemical above the declaration threshold; (ii) You plan to produce at a plant declared...; (iii) You plan to increase the production of a Schedule 3 chemical by declared plants on your plant... production of a Schedule 3 chemical at a declared plant site to an amount above the upper limit of the range...
Code of Federal Regulations, 2012 CFR
2012-01-01
... a Schedule 3 chemical above the declaration threshold; (ii) You plan to produce at a plant declared...; (iii) You plan to increase the production of a Schedule 3 chemical by declared plants on your plant... production of a Schedule 3 chemical at a declared plant site to an amount above the upper limit of the range...
Code of Federal Regulations, 2014 CFR
2014-01-01
... a Schedule 3 chemical above the declaration threshold; (ii) You plan to produce at a plant declared...; (iii) You plan to increase the production of a Schedule 3 chemical by declared plants on your plant... production of a Schedule 3 chemical at a declared plant site to an amount above the upper limit of the range...
Code of Federal Regulations, 2014 CFR
2014-01-01
... year in which exports or imports of a Schedule 3 chemical by a plant site, trading company, or other... chemical and the export or import of the same or a different Schedule 3 chemical by a declared plant site... CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS Pt. 714, Supp. 2...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-12-03
... the Schedules of Civil Penalties for a Violation of a Federal Railroad Safety Law or Federal Railroad... September 21, 2010. The proposal, if adopted, would amend, line by line, FRA's schedules of civil penalties... . SUPPLEMENTARY INFORMATION: FRA's proposal to amend, line by line, FRA's schedules of civil penalties as well as...