Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

NASA Astrophysics Data System (ADS)

Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi

Multimedia applications such as music or video streaming, video teleconferencing and IP telephony are flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve this problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) was proposed in [17]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we propose a call admission control (CAC) algorithm for ORC-GPS, for leaky-bucket constrained sessions with deterministic delay requirements. This CAC algorithm for ORC-GPS determines the optimal values of parameters of ORC-GPS from the deterministic delay requirements of the sessions. In numerical experiments, we compare the CAC algorithm for ORC-GPS with one for GPS in terms of schedulable region and computational complexity.

Evaluation of Recoverable-Robust Timetables on Tree Networks

NASA Astrophysics Data System (ADS)

D'Angelo, Gianlorenzo; di Stefano, Gabriele; Navarra, Alfredo

In the context of scheduling and timetabling, we study a challenging combinatorial problem which is interesting from both a practical and a theoretical point of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disturbances, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the scheduled activities in order to be "prepared" if a delay occurs, and to absorb it without the necessity of re-scheduling the activities from scratch. This realizes the concept of designing so called robust timetables. During the planning phase, one has to consider recovery features that might be applied at runtime if delays occur. Such recovery capabilities are given as input along with the possible delays that must be considered. The objective is the minimization of the overall needed time. The quality of a robust timetable is measured by the price of robustness, i.e. the ratio between the cost of the robust timetable and that of a non-robust optimal timetable. The considered problem is known to be NP-hard. We propose a pseudo-polynomial time algorithm and apply it on random networks and real case scenarios provided by Italian railways. We evaluate the effect of robustness on the scheduling of the activities and provide the price of robustness with respect to different scenarios. We experimentally show the practical effectiveness and efficiency of the proposed algorithm.

Real-time energy-saving metro train rescheduling with primary delay identification

PubMed Central

Li, Keping; Schonfeld, Paul

2018-01-01

This paper aims to reschedule online metro trains in delay scenarios. A graph representation and a mixed integer programming model are proposed to formulate the optimization problem. The solution approach is a two-stage optimization method. In the first stage, based on a proposed train state graph and system analysis, the primary and flow-on delays are specifically analyzed and identified with a critical path algorithm. For the second stage a hybrid genetic algorithm is designed to optimize the schedule, with the delay identification results as input. Then, based on the infrastructure data of Beijing Subway Line 4 of China, case studies are presented to demonstrate the effectiveness and efficiency of the solution approach. The results show that the algorithm can quickly and accurately identify primary delays among different types of delays. The economic cost of energy consumption and total delay is considerably reduced (by more than 10% in each case). The computation time of the Hybrid-GA is low enough for rescheduling online. Sensitivity analyses further demonstrate that the proposed approach can be used as a decision-making support tool for operators. PMID:29474471

Energy latency tradeoffs for medium access and sleep scheduling in wireless sensor networks

NASA Astrophysics Data System (ADS)

Gang, Lu

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. The central thesis of this work is that energy efficient medium access and sleep scheduling mechanisms can be designed without necessarily sacrificing application-specific latency performance. We validate this thesis through results from four case studies that cover various aspects of medium access and sleep scheduling design in wireless sensor networks. Our first effort, DMAC, is to design an adaptive low latency and energy efficient MAC for data gathering to reduce the sleep latency. We propose staggered schedule, duty cycle adaptation, data prediction and the use of more-to-send packets to enable seamless packet forwarding under varying traffic load and channel contentions. Simulation and experimental results show significant energy savings and latency reduction while ensuring high data reliability. The second research effort, DESS, investigates the problem of designing sleep schedules in arbitrary network communication topologies to minimize the worst case end-to-end latency (referred to as delay diameter). We develop a novel graph-theoretical formulation, derive and analyze optimal solutions for the tree and ring topologies and heuristics for arbitrary topologies. The third study addresses the problem of minimum latency joint scheduling and routing (MLSR). By constructing a novel delay graph, the optimal joint scheduling and routing can be solved by M node-disjoint paths algorithm under multiple channel model. We further extended the algorithm to handle dynamic traffic changes and topology changes. A heuristic solution is proposed for MLSR under single channel interference. In the fourth study, EEJSPC, we first formulate a fundamental optimization problem that provides tunable energy-latency-throughput tradeoffs with joint scheduling and power control and present both exponential and polynomial complexity solutions. Then we investigate the problem of minimizing total transmission energy while satisfying transmission requests within a latency bound, and present an iterative approach which converges rapidly to the optimal parameter settings.

Incorporating Active Runway Crossings in Airport Departure Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Malik, Waqar; Jung, Yoon C.

2010-01-01

A mixed integer linear program is presented for deterministically scheduling departure and ar rival aircraft at airport runways. This method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple par king area where any available aircraft can take-off ir respective of its relative sequence with others. In addition, this method explicitly considers separation criteria between successive aircraft and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput and system delay are used independently. Results indicate improvement over a basic first-come-first-serve rule in both system delay and throughput. Minimizing system delay results in small deviations from optimal throughput, whereas minimizing throughput results in large deviations in system delay. Enhancements for computational efficiency are also presented in the form of reformulating certain constraints and defining additional inequalities for better bounds.

Revisiting Bevacizumab + Cytotoxics Scheduling Using Mathematical Modeling: Proof of Concept Study in Experimental Non-Small Cell Lung Carcinoma.

PubMed

Imbs, Diane-Charlotte; El Cheikh, Raouf; Boyer, Arnaud; Ciccolini, Joseph; Mascaux, Céline; Lacarelle, Bruno; Barlesi, Fabrice; Barbolosi, Dominique; Benzekry, Sébastien

2018-01-01

Concomitant administration of bevacizumab and pemetrexed-cisplatin is a common treatment for advanced nonsquamous non-small cell lung cancer (NSCLC). Vascular normalization following bevacizumab administration may transiently enhance drug delivery, suggesting improved efficacy with sequential administration. To investigate optimal scheduling, we conducted a study in NSCLC-bearing mice. First, experiments demonstrated improved efficacy when using sequential vs. concomitant scheduling of bevacizumab and chemotherapy. Combining this data with a mathematical model of tumor growth under therapy accounting for the normalization effect, we predicted an optimal delay of 2.8 days between bevacizumab and chemotherapy. This prediction was confirmed experimentally, with reduced tumor growth of 38% as compared to concomitant scheduling, and prolonged survival (74 vs. 70 days). Alternate sequencing of 8 days failed in achieving a similar increase in efficacy, thus emphasizing the utility of modeling support to identify optimal scheduling. The model could also be a useful tool in the clinic to personally tailor regimen sequences. © 2017 The Authors CPT: Pharmacometrics & Systems Pharmacology published by Wiley Periodicals, Inc. on behalf of American Society for Clinical Pharmacology and Therapeutics.

Choice in situations of time-based diminishing returns: immediate versus delayed consequences of action.

PubMed Central

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

Incorporating User Preferences Within an Optimal Traffic Flow Management Framework

NASA Technical Reports Server (NTRS)

Rios, Joseph Lucio; Sheth, Kapil S.; Guiterrez-Nolasco, Sebastian Armardo

2010-01-01

The effectiveness of future decision support tools for Traffic Flow Management in the National Airspace System will depend on two major factors: computational burden and collaboration. Previous research has focused separately on these two aspects without consideration of their interaction. In this paper, their explicit combination is examined. It is shown that when user preferences are incorporated with an optimal approach to scheduling, runtime is not adversely affected. A benefit-cost ratio is used to measure the influence of user preferences on an optimal solution. This metric shows user preferences can be accommodated without inordinately, negatively affecting the overall system delay. Specifically, incorporating user preferences will increase delays proportionally to increased user satisfaction.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Efficient Trajectory Options Allocation for the Collaborative Trajectory Options Program

NASA Technical Reports Server (NTRS)

Rodionova, Olga; Arneson, Heather; Sridhar, Banavar; Evans, Antony

2017-01-01

The Collaborative Trajectory Options Program (CTOP) is a Traffic Management Initiative (TMI) intended to control the air traffic flow rates at multiple specified Flow Constrained Areas (FCAs), where demand exceeds capacity. CTOP allows flight operators to submit the desired Trajectory Options Set (TOS) for each affected flight with associated Relative Trajectory Cost (RTC) for each option. CTOP then creates a feasible schedule that complies with capacity constraints by assigning affected flights with routes and departure delays in such a way as to minimize the total cost while maintaining equity across flight operators. The current version of CTOP implements a Ration-by-Schedule (RBS) scheme, which assigns the best available options to flights based on a First-Scheduled-First-Served heuristic. In the present study, an alternative flight scheduling approach is developed based on linear optimization. Results suggest that such an approach can significantly reduce flight delays, in the deterministic case, while maintaining equity as defined using a Max-Min fairness scheme.

An interpolated activity during the knowledge-of-results delay interval eliminates the learning advantages of self-controlled feedback schedules.

PubMed

Carter, Michael J; Ste-Marie, Diane M

2017-03-01

The learning advantages of self-controlled knowledge-of-results (KR) schedules compared to yoked schedules have been linked to the optimization of the informational value of the KR received for the enhancement of one's error-detection capabilities. This suggests that information-processing activities that occur after motor execution, but prior to receiving KR (i.e., the KR-delay interval) may underlie self-controlled KR learning advantages. The present experiment investigated whether self-controlled KR learning benefits would be eliminated if an interpolated activity was performed during the KR-delay interval. Participants practiced a waveform matching task that required two rapid elbow extension-flexion reversals in one of four groups using a factorial combination of choice (self-controlled, yoked) and KR-delay interval (empty, interpolated). The waveform had specific spatial and temporal constraints, and an overall movement time goal. The results indicated that the self-controlled + empty group had superior retention and transfer scores compared to all other groups. Moreover, the self-controlled + interpolated and yoked + interpolated groups did not differ significantly in retention and transfer; thus, the interpolated activity eliminated the typically found learning benefits of self-controlled KR. No significant differences were found between the two yoked groups. We suggest the interpolated activity interfered with information-processing activities specific to self-controlled KR conditions that occur during the KR-delay interval and that these activities are vital for reaping the associated learning benefits. These findings add to the growing evidence that challenge the motivational account of self-controlled KR learning advantages and instead highlights informational factors associated with the KR-delay interval as an important variable for motor learning under self-controlled KR schedules.

Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System

NASA Astrophysics Data System (ADS)

Dylewski, Robert; Jardzioch, Andrzej; Dworak, Oliver

2018-03-01

The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.

MDTM: Optimizing Data Transfer using Multicore-Aware I/O Scheduling

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

Zhang, Liang; Demar, Phil; Wu, Wenji

2017-05-09

Bulk data transfer is facing significant challenges in the coming era of big data. There are multiple performance bottlenecks along the end-to-end path from the source to destination storage system. The limitations of current generation data transfer tools themselves can have a significant impact on end-to-end data transfer rates. In this paper, we identify the issues that lead to underperformance of these tools, and present a new data transfer tool with an innovative I/O scheduler called MDTM. The MDTM scheduler exploits underlying multicore layouts to optimize throughput by reducing delay and contention for I/O reading and writing operations. With ourmore » evaluations, we show how MDTM successfully avoids NUMA-based congestion and significantly improves end-to-end data transfer rates across high-speed wide area networks.« less

MDTM: Optimizing Data Transfer using Multicore-Aware I/O Scheduling

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

Zhang, Liang; Demar, Phil; Wu, Wenji

2017-01-01

Bulk data transfer is facing significant challenges in the coming era of big data. There are multiple performance bottlenecks along the end-to-end path from the source to destination storage system. The limitations of current generation data transfer tools themselves can have a significant impact on end-to-end data transfer rates. In this paper, we identify the issues that lead to underperformance of these tools, and present a new data transfer tool with an innovative I/O scheduler called MDTM. The MDTM scheduler exploits underlying multicore layouts to optimize throughput by reducing delay and contention for I/O reading and writing operations. With ourmore » evaluations, we show how MDTM successfully avoids NUMA-based congestion and significantly improves end-to-end data transfer rates across high-speed wide area networks.« less

Optimal therapies of a virus replication model with pharmacological delays based on reverse transcriptase inhibitors and protease inhibitors

NASA Astrophysics Data System (ADS)

Pei, Yongzhen; Li, Changguo; Liang, Xiyin

2017-11-01

A short delay in the pharmacological effect on account of the time required for drug absorption, distribution, and penetration into target cells after application of any anti-viral drug, is defined by the pharmacological delay (Herz et al 1996 Proc. Natl Acad. Sci. USA 93 7247-51). In this paper, a virus replication model with Beddington-DeAngelis incidence rate and the pharmacological and intracellular delays is presented to describe the treatment to cure the virus infection. The optimal controls represent the efficiency of reverse transcriptase inhibitors and protease inhibitors in suppressing viral production and prohibiting new infections. Due to the fact that both the control and state variables contain delays, we derive a necessary conditions for our optimal problem. Based on these results, numerical simulations are implemented not only to show the optimal therapeutic schedules for different infection and release rates, but also to compare the effective of three treatment programs. Furthermore, comparison of therapeutic effects under different maximum tolerable dosages is shown. Our research indicates that (1) the proper and specific treatment program should be determined according to the infection rates of different virus particles; (2) the optimal combined drug treatment is the most efficient; (3) the appropriate proportion of medicament must be formulated during the therapy due to the non-monotonic relationship between maximum tolerable dosages and therapeutic effects; (4) the therapeutic effect is advantageous when the pharmacological delay is considered.

Preliminary Evaluation of BIM-based Approaches for Schedule Delay Analysis

NASA Astrophysics Data System (ADS)

Chou, Hui-Yu; Yang, Jyh-Bin

2017-10-01

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

Improving patient access to an interventional US clinic.

PubMed

Steele, Joseph R; Clarke, Ryan K; Terrell, John A; Brightmon, Tonya R

2014-01-01

A continuous quality improvement project was conducted to increase patient access to a neurointerventional ultrasonography (US) clinic. The clinic was experiencing major scheduling delays because of an increasing patient volume. A multidisciplinary team was formed that included schedulers, medical assistants, nurses, technologists, and physicians. The team created an Ishikawa diagram of the possible causes of the long wait time to the next available appointment and developed a flowchart of the steps involved in scheduling and completing a diagnostic US examination and biopsy. The team then implemented a staged intervention that included adjustments to staffing and room use (stage 1); new procedures for scheduling same-day add-on appointments (stage 2); and a lead technician rotation to optimize patient flow, staffing, and workflow (stage 3). Six months after initiation of the intervention, the mean time to the next available appointment had decreased from 25 days at baseline to 1 day, and the number of available daily appointments had increased from 38 to 55. These improvements resulted from a coordinated provider effort and had a net present value of more than $275,000. This project demonstrates that structural changes in staffing, workflow, and room use can substantially reduce scheduling delays for critical imaging procedures. © RSNA, 2014.

An Evaluation of a Flight Deck Interval Management Algorithm Including Delayed Target Trajectories

NASA Technical Reports Server (NTRS)

Swieringa, Kurt A.; Underwood, Matthew C.; Barmore, Bryan; Leonard, Robert D.

2014-01-01

NASA's first Air Traffic Management (ATM) Technology Demonstration (ATD-1) was created to facilitate the transition of mature air traffic management technologies from the laboratory to operational use. The technologies selected for demonstration are the Traffic Management Advisor with Terminal Metering (TMA-TM), which provides precise timebased scheduling in the terminal airspace; Controller Managed Spacing (CMS), which provides controllers with decision support tools enabling precise schedule conformance; and Interval Management (IM), which consists of flight deck automation that enables aircraft to achieve or maintain precise in-trail spacing. During high demand operations, TMA-TM may produce a schedule and corresponding aircraft trajectories that include delay to ensure that a particular aircraft will be properly spaced from other aircraft at each schedule waypoint. These delayed trajectories are not communicated to the automation onboard the aircraft, forcing the IM aircraft to use the published speeds to estimate the target aircraft's estimated time of arrival. As a result, the aircraft performing IM operations may follow an aircraft whose TMA-TM generated trajectories have substantial speed deviations from the speeds expected by the spacing algorithm. Previous spacing algorithms were not designed to handle this magnitude of uncertainty. A simulation was conducted to examine a modified spacing algorithm with the ability to follow aircraft flying delayed trajectories. The simulation investigated the use of the new spacing algorithm with various delayed speed profiles and wind conditions, as well as several other variables designed to simulate real-life variability. The results and conclusions of this study indicate that the new spacing algorithm generally exhibits good performance; however, some types of target aircraft speed profiles can cause the spacing algorithm to command less than optimal speed control behavior.

Routing and scheduling of hazardous materials shipments: algorithmic approaches to managing spent nuclear fuel transport

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

Cox, R.G.

Much controversy surrounds government regulation of routing and scheduling of Hazardous Materials Transportation (HMT). Increases in operating costs must be balanced against expected benefits from local HMT bans and curfews when promulgating or preempting HMT regulations. Algorithmic approaches for evaluating HMT routing and scheduling regulatory policy are described. A review of current US HMT regulatory policy is presented to provide a context for the analysis. Next, a multiobjective shortest path algorithm to find the set of efficient routes under conflicting objectives is presented. This algorithm generates all efficient routes under any partial ordering in a single pass through the network.more » Also, scheduling algorithms are presented to estimate the travel time delay due to HMT curfews along a route. Algorithms are presented assuming either deterministic or stochastic travel times between curfew cities and also possible rerouting to avoid such cities. These algorithms are applied to the case study of US highway transport of spent nuclear fuel from reactors to permanent repositories. Two data sets were used. One data set included the US Interstate Highway System (IHS) network with reactor locations, possible repository sites, and 150 heavily populated areas (HPAs). The other data set contained estimates of the population residing with 0.5 miles of the IHS and the Eastern US. Curfew delay is dramatically reduced by optimally scheduling departure times unless inter-HPA travel times are highly uncertain. Rerouting shipments to avoid HPAs is a less efficient approach to reducing delay.« less

Real-time adaptive aircraft scheduling

NASA Technical Reports Server (NTRS)

Kolitz, Stephan E.; Terrab, Mostafa

1990-01-01

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

British randomised controlled trial of AV and VV optimization ("BRAVO") study: rationale, design, and endpoints.

PubMed

Whinnett, Zachary I; Sohaib, S M Afzal; Jones, Siana; Kyriacou, Andreas; March, Katherine; Coady, Emma; Mayet, Jamil; Hughes, Alun D; Frenneaux, Michael; Francis, Darrel P

2014-04-03

Echocardiographic optimization of pacemaker settings is the current standard of care for patients treated with cardiac resynchronization therapy. However, the process requires considerable time of expert staff. The BRAVO study is a non-inferiority trial comparing echocardiographic optimization of atrioventricular (AV) and interventricular (VV) delay with an alternative method using non-invasive blood pressure monitoring that can be automated to consume less staff resources. BRAVO is a multi-centre, randomized, cross-over, non-inferiority trial of 400 patients with a previously implanted cardiac resynchronization device. Patients are randomly allocated to six months in each arm. In the echocardiographic arm, AV delay is optimized using the iterative method and VV delay by maximizing LVOT VTI. In the haemodynamic arm AV and VV delay are optimized using non-invasive blood pressure measured using finger photoplethysmography. At the end of each six month arm, patients undergo the primary outcome measure of objective exercise capacity, quantified as peak oxygen uptake (VO2) on a cardiopulmonary exercise test. Secondary outcome measures are echocardiographic measurement of left ventricular remodelling, quality of life score and N-terminal pro B-type Natriuretic Peptide (NT-pro BNP). The study is scheduled to complete recruitment in December 2013 and to complete follow up in December 2014. If exercise capacity is non-inferior with haemodynamic optimization compared with echocardiographic optimization, it would be proof of concept that haemodynamic optimization is an acceptable alternative which has the potential to be more easily implemented. Clinicaltrials.gov NCT01258829.

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs

PubMed Central

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-01-01

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes. PMID:28471416

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs.

PubMed

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-05-04

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.

Simultaneously optimizing dose and schedule of a new cytotoxic agent.

PubMed

Braun, Thomas M; Thall, Peter F; Nguyen, Hoang; de Lima, Marcos

2007-01-01

Traditionally, phase I clinical trial designs are based upon one predefined course of treatment while varying among patients the dose given at each administration. In actual medical practice, patients receive a schedule comprised of several courses of treatment, and some patients may receive one or more dose reductions or delays during treatment. Consequently, the overall risk of toxicity for each patient is a function of both actual schedule of treatment and the differing doses used at each adminstration. Our goal is to provide a practical phase I clinical trial design that more accurately reflects actual medical practice by accounting for both dose per administration and schedule. We propose an outcome-adaptive Bayesian design that simultaneously optimizes both dose and schedule in terms of the overall risk of toxicity, based on time-to-toxicity outcomes. We use computer simulation as a tool to calibrate design parameters. We describe a phase I trial in allogeneic bone marrow transplantation that was designed and is currently being conducted using our new method. Our computer simulations demonstrate that our method outperforms any method that searches for an optimal dose but does not allow schedule to vary, both in terms of the probability of identifying optimal (dose, schedule) combinations, and the numbers of patients assigned to those combinations in the trial. Our design requires greater sample sizes than those seen in traditional phase I studies due to the larger number of treatment combinations examined. Our design also assumes that the effects of multiple administrations are independent of each other and that the hazard of toxicity is the same for all administrations. Our design is the first for phase I clinical trials that is sufficiently flexible and practical to truly reflect clinical practice by varying both dose and the timing and number of administrations given to each patient.

Application of multiobjective optimization to scheduling capacity expansion of urban water resource systems

NASA Astrophysics Data System (ADS)

Mortazavi-Naeini, Mohammad; Kuczera, George; Cui, Lijie

2014-06-01

Significant population increase in urban areas is likely to result in a deterioration of drought security and level of service provided by urban water resource systems. One way to cope with this is to optimally schedule the expansion of system resources. However, the high capital costs and environmental impacts associated with expanding or building major water infrastructure warrant the investigation of scheduling system operational options such as reservoir operating rules, demand reduction policies, and drought contingency plans, as a way of delaying or avoiding the expansion of water supply infrastructure. Traditionally, minimizing cost has been considered the primary objective in scheduling capacity expansion problems. In this paper, we consider some of the drawbacks of this approach. It is shown that there is no guarantee that the social burden of coping with drought emergencies is shared equitably across planning stages. In addition, it is shown that previous approaches do not adequately exploit the benefits of joint optimization of operational and infrastructure options and do not adequately address the need for the high level of drought security expected for urban systems. To address these shortcomings, a new multiobjective optimization approach to scheduling capacity expansion in an urban water resource system is presented and illustrated in a case study involving the bulk water supply system for Canberra. The results show that the multiobjective approach can address the temporal equity issue of sharing the burden of drought emergencies and that joint optimization of operational and infrastructure options can provide solutions superior to those just involving infrastructure options.

Evolution of Query Optimization Methods

NASA Astrophysics Data System (ADS)

Hameurlain, Abdelkader; Morvan, Franck

Query optimization is the most critical phase in query processing. In this paper, we try to describe synthetically the evolution of query optimization methods from uniprocessor relational database systems to data Grid systems through parallel, distributed and data integration systems. We point out a set of parameters to characterize and compare query optimization methods, mainly: (i) size of the search space, (ii) type of method (static or dynamic), (iii) modification types of execution plans (re-optimization or re-scheduling), (iv) level of modification (intra-operator and/or inter-operator), (v) type of event (estimation errors, delay, user preferences), and (vi) nature of decision-making (centralized or decentralized control).

ATD-2 Surface Scheduling and Metering Concept

NASA Technical Reports Server (NTRS)

Coppenbarger, Richard A.; Jung, Yoon Chul; Capps, Richard Alan; Engelland, Shawn A.

2017-01-01

This presentation describes the concept of ATD-2 tactical surface scheduling and metering. The concept is composed of several elements, including data exchange and integration; surface modeling; surface scheduling; and surface metering. The presentation explains each of the elements. Surface metering is implemented to balance demand and capacity• When surface metering is on, target times from surface scheduler areconverted to advisories for throttling demand• Through the scheduling process, flights with CTOTs will not get addedmetering delay (avoids potential for ‘double delay’)• Carriers can designate certain flights as exempt from metering holds• Demand throttle in Phase 1 at CLT is through advisories sent to rampcontrollers for pushback instructions to the flight deck– Push now– Hold for an advised period of time (in minutes)• Principles of surface metering can be more generally applied to otherairports in the NAS to throttle demand via spot-release times (TMATs Strong focus on optimal use of airport resources• Flexibility enables stakeholders to vary the amount of delay theywould like transferred to gate• Addresses practical aspects of executing surface metering in aturbulent real world environment• Algorithms designed for both short term demand/capacityimbalances (banks) or sustained metering situations• Leverage automation to enable surface metering capability withoutrequiring additional positions• Represents first step in Tactical/Strategic fusion• Provides longer look-ahead calculations to enable analysis ofstrategic surface metering potential usage

Optimizing patient flow in a large hospital surgical centre by means of discrete-event computer simulation models.

PubMed

Ferreira, Rodrigo B; Coelli, Fernando C; Pereira, Wagner C A; Almeida, Renan M V R

2008-12-01

This study used the discrete-events computer simulation methodology to model a large hospital surgical centre (SC), in order to analyse the impact of increases in the number of post-anaesthetic beds (PABs), of changes in surgical room scheduling strategies and of increases in surgery numbers. The used inputs were: number of surgeries per day, type of surgical room scheduling, anaesthesia and surgery duration, surgical teams' specialty and number of PABs, and the main outputs were: number of surgeries per day, surgical rooms' use rate and blocking rate, surgical teams' use rate, patients' blocking rate, surgery delays (minutes) and the occurrence of postponed surgeries. Two basic strategies were implemented: in the first strategy, the number of PABs was increased under two assumptions: (a) following the scheduling plan actually used by the hospital (the 'rigid' scheduling - surgical rooms were previously assigned and assignments could not be changed) and (b) following a 'flexible' scheduling (surgical rooms, when available, could be freely used by any surgical team). In the second, the same analysis was performed, increasing the number of patients (up to the system 'feasible maximum') but fixing the number of PABs, in order to evaluate the impact of the number of patients over surgery delays. It was observed that the introduction of a flexible scheduling/increase in PABs would lead to a significant improvement in the SC productivity.

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

NASA Technical Reports Server (NTRS)

Rios, Joseph Lucio; Ross, Kevin

2009-01-01

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Integrated Traffic Flow Management Decision Making

NASA Technical Reports Server (NTRS)

Grabbe, Shon R.; Sridhar, Banavar; Mukherjee, Avijit

2009-01-01

A generalized approach is proposed to support integrated traffic flow management decision making studies at both the U.S. national and regional levels. It can consider tradeoffs between alternative optimization and heuristic based models, strategic versus tactical flight controls, and system versus fleet preferences. Preliminary testing was accomplished by implementing thirteen unique traffic flow management models, which included all of the key components of the system and conducting 85, six-hour fast-time simulation experiments. These experiments considered variations in the strategic planning look-ahead times, the replanning intervals, and the types of traffic flow management control strategies. Initial testing indicates that longer strategic planning look-ahead times and re-planning intervals result in steadily decreasing levels of sector congestion for a fixed delay level. This applies when accurate estimates of the air traffic demand, airport capacities and airspace capacities are available. In general, the distribution of the delays amongst the users was found to be most equitable when scheduling flights using a heuristic scheduling algorithm, such as ration-by-distance. On the other hand, equity was the worst when using scheduling algorithms that took into account the number of seats aboard each flight. Though the scheduling algorithms were effective at alleviating sector congestion, the tactical rerouting algorithm was the primary control for avoiding en route weather hazards. Finally, the modeled levels of sector congestion, the number of weather incursions, and the total system delays, were found to be in fair agreement with the values that were operationally observed on both good and bad weather days.

Analyzing Double Delays at Newark Liberty International Airport

NASA Technical Reports Server (NTRS)

Evans, Antony D.; Lee, Paul

2016-01-01

When weather or congestion impacts the National Airspace System, multiple different Traffic Management Initiatives can be implemented, sometimes with unintended consequences. One particular inefficiency that is commonly identified is in the interaction between Ground Delay Programs (GDPs) and time based metering of internal departures, or TMA scheduling. Internal departures under TMA scheduling can take large GDP delays, followed by large TMA scheduling delays, because they cannot be easily fitted into the overhead stream. In this paper we examine the causes of these double delays through an analysis of arrival operations at Newark Liberty International Airport (EWR) from June to August 2010. Depending on how the double delay is defined between 0.3 percent and 0.8 percent of arrivals at EWR experienced double delays in this period. However, this represents between 21 percent and 62 percent of all internal departures in GDP and TMA scheduling. A deep dive into the data reveals that two causes of high internal departure scheduling delays are upstream flights making up time between their estimated departure clearance times (EDCTs) and entry into time based metering, which undermines the sequencing and spacing underlying the flight EDCTs, and high demand on TMA, when TMA airborne metering delays are high. Data mining methods (currently) including logistic regression, support vector machines and K-nearest neighbors are used to predict the occurrence of double delays and high internal departure scheduling delays with accuracies up to 0.68. So far, key indicators of double delay and high internal departure scheduling delay are TMA virtual runway queue size, and the degree to which estimated runway demand based on TMA estimated times of arrival has changed relative to the estimated runway demand based on EDCTs. However, more analysis is needed to confirm this.

Cascading Delay Risk of Airline Workforce Deployments with Crew Pairing and Schedule Optimization.

PubMed

Chung, Sai Ho; Ma, Hoi Lam; Chan, Hing Kai

2017-08-01

This article concerns the assignment of buffer time between two connected flights and the number of reserve crews in crew pairing to mitigate flight disruption due to flight arrival delay. Insufficient crew members for a flight will lead to flight disruptions such as delays or cancellations. In reality, most of these disruption cases are due to arrival delays of the previous flights. To tackle this problem, many research studies have examined the assignment method based on the historical flight arrival delay data of the concerned flights. However, flight arrival delays can be triggered by numerous factors. Accordingly, this article proposes a new forecasting approach using a cascade neural network, which considers a massive amount of historical flight arrival and departure data. The approach also incorporates learning ability so that unknown relationships behind the data can be revealed. Based on the expected flight arrival delay, the buffer time can be determined and a new dynamic reserve crew strategy can then be used to determine the required number of reserve crews. Numerical experiments are carried out based on one year of flight data obtained from 112 airports around the world. The results demonstrate that by predicting the flight departure delay as the input for the prediction of the flight arrival delay, the prediction accuracy can be increased. Moreover, by using the new dynamic reserve crew strategy, the total crew cost can be reduced. This significantly benefits airlines in flight schedule stability and cost saving in the current big data era. © 2016 Society for Risk Analysis.

Interaction Between Strategic and Local Traffic Flow Controls

NASA Technical Reports Server (NTRS)

Grabbe, Son; Sridhar, Banavar; Mukherjee, Avijit; Morando, Alexander

2010-01-01

The loosely coordinated sets of traffic flow management initiatives that are operationally implemented at the national- and local-levels have the potential to under, over, and inconsistently control flights. This study is designed to explore these interactions through fast-time simulations with an emphasis on identifying inequitable situations in which flights receive multiple uncoordinated delays. Two operationally derived scenarios were considered in which flights arriving into the Dallas/Fort Worth International Airport were first controlled at the national-level, either with a Ground Delay Program or a playbook reroute. These flights were subsequently controlled at the local level. The Traffic Management Advisor assigned them arrival scheduling delays. For the Ground Delay Program scenarios, between 51% and 53% of all arrivals experience both pre-departure delays from the Ground Delay Program and arrival scheduling delays from the Traffic Management Advisor. Of the subset of flights that received multiple delays, between 5.7% and 6.4% of the internal departures were first assigned a pre-departure delay by the Ground Delay Program, followed by a second pre-departure delay as a result of the arrival scheduling. For the playbook reroute scenario, Dallas/Fort Worth International Airport arrivals were first assigned pre-departure reroutes based on the MW_2_DALLAS playbook plan, and were subsequently assigned arrival scheduling delays by the Traffic Management Advisor. Since the airport was operating well below capacity when the playbook reroute was in effect, only 7% of the arrivals were observed to receive both rerouting and arrival scheduling delays. Findings from these initial experiments confirm field observations that Ground Delay Programs operated in conjunction with arrival scheduling can result in inequitable situations in which flights receive multiple uncoordinated delays.

Optimizing MRI Logistics: Prospective Analysis of Performance, Efficiency, and Patient Throughput.

PubMed

Beker, Kevin; Garces-Descovich, Alejandro; Mangosing, Jason; Cabral-Goncalves, Ines; Hallett, Donna; Mortele, Koenraad J

2017-10-01

The objective of this study is to optimize MRI logistics through evaluation of MRI workflow and analysis of performance, efficiency, and patient throughput in a tertiary care academic center. For 2 weeks, workflow data from two outpatient MRI scanners were prospectively collected and stratified by value added to the process (i.e., value-added time, business value-added time, or non-value-added time). Two separate time cycles were measured: the actual MRI process cycle as well as the complete length of patient stay in the department. In addition, the impact and frequency of delays across all observations were measured. A total of 305 MRI examinations were evaluated, including body (34.1%), neurologic (28.9%), musculoskeletal (21.0%), and breast examinations (16.1%). The MRI process cycle lasted a mean of 50.97 ± 24.4 (SD) minutes per examination; the mean non-value-added time was 13.21 ± 18.77 minutes (25.87% of the total process cycle time). The mean length-of-stay cycle was 83.51 ± 33.63 minutes; the mean non-value-added time was 24.33 ± 24.84 minutes (29.14% of the total patient stay). The delay with the highest frequency (5.57%) was IV or port placement, which had a mean delay of 22.82 minutes. The delay with the greatest impact on time was MRI arthrography for which joint injection of contrast medium was necessary but was not accounted for in the schedule (mean delay, 42.2 minutes; frequency, 1.64%). Of 305 patients, 34 (11.15%) did not arrive at or before their scheduled time. Non-value-added time represents approximately one-third of the total MRI process cycle and patient length of stay. Identifying specific delays may expedite the application of targeted improvement strategies, potentially increasing revenue, efficiency, and overall patient satisfaction.

Army Corps of Engineers: Factors Contributing to Cost Increases and Schedule Delays in the Olmsted Locks and Dam Project

DTIC Science & Technology

2017-02-01

to cost increases and schedule delays and (2) what is known about the costs of benefits foregone because of project delays. GAO compared the...Contributors to Cost Increases and Schedule Delays 13 Total Cost of Benefits Foregone from Project Delays at Olmsted Is Uncertain 27 Agency Comments...would take 7 years. The Corps also estimated benefits , such as transportation cost savings, associated with the project. However, once the project was

Choice between Single and Multiple Reinforcers in Concurrent-Chains Schedules

ERIC Educational Resources Information Center

Mazur, James E.

2006-01-01

Pigeons responded on concurrent-chains schedules with equal variable-interval schedules as initial links. One terminal link delivered a single reinforcer after a fixed delay, and the other terminal link delivered either three or five reinforcers, each preceded by a fixed delay. Some conditions included a postreinforcer delay after the single…

The effects of signalled and unsignalled lick-dependent delays on the development of schedule-induced drinking in rats.

PubMed

Pellon, R; Blackman, D E

1991-02-01

Food pellets were programmed to be delivered to rats every 60 sec (Fixed Time 60-sec schedule), and the development of schedule-induced drinking was measured in terms of the amount of water consumed and the number of licks per inter-pellet interval. For some rats (masters) 10-sec delays in food delivery were dependent on licks. Yoked-control rats received food at the same time as their masters and independently of their own behaviour. In Experiment 1, in which the delays were signalled by a blackout, the master rats began to drink, but this schedule-induced behaviour then decreased to levels lower than those shown by the yoked controls. When the signalled delays were discontinued, the drinking of the master rats recovered. In Experiment 2, in which the delays were not signalled, the master rats did not develop as much schedule-induced drinking as the yoked controls, and discontinuing the delays led to only small increases in drinking. These results support the view that schedule-induced drinking is subject to control by its consequences.

Centralized Routing and Scheduling Using Multi-Channel System Single Transceiver in 802.16d

NASA Astrophysics Data System (ADS)

Al-Hemyari, A.; Noordin, N. K.; Ng, Chee Kyun; Ismail, A.; Khatun, S.

This paper proposes a cross-layer optimized strategy that reduces the effect of interferences from neighboring nodes within a mesh networks. This cross-layer design relies on the routing information in network layer and the scheduling table in medium access control (MAC) layer. A proposed routing algorithm in network layer is exploited to find the best route for all subscriber stations (SS). Also, a proposed centralized scheduling algorithm in MAC layer is exploited to assign a time slot for each possible node transmission. The cross-layer optimized strategy is using multi-channel single transceiver and single channel single transceiver systems for WiMAX mesh networks (WMNs). Each node in WMN has a transceiver that can be tuned to any available channel for eliminating the secondary interference. Among the considered parameters in the performance analysis are interference from the neighboring nodes, hop count to the base station (BS), number of children per node, slot reuse, load balancing, quality of services (QoS), and node identifier (ID). Results show that the proposed algorithms significantly improve the system performance in terms of length of scheduling, channel utilization ratio (CUR), system throughput, and average end to end transmission delay.

Probabilistic QoS Analysis In Wireless Sensor Networks

DTIC Science & Technology

2012-04-01

and A.O. Fapojuwo. TDMA scheduling with optimized energy efficiency and minimum delay in clustered wireless sensor networks . IEEE Trans. on Mobile...Research Computer Science and Engineering, Department of 5-1-2012 Probabilistic QoS Analysis in Wireless Sensor Networks Yunbo Wang University of...Wang, Yunbo, "Probabilistic QoS Analysis in Wireless Sensor Networks " (2012). Computer Science and Engineering: Theses, Dissertations, and Student

A Hybrid Cellular Genetic Algorithm for Multi-objective Crew Scheduling Problem

NASA Astrophysics Data System (ADS)

Jolai, Fariborz; Assadipour, Ghazal

Crew scheduling is one of the important problems of the airline industry. This problem aims to cover a number of flights by crew members, such that all the flights are covered. In a robust scheduling the assignment should be so that the total cost, delays, and unbalanced utilization are minimized. As the problem is NP-hard and the objectives are in conflict with each other, a multi-objective meta-heuristic called CellDE, which is a hybrid cellular genetic algorithm, is implemented as the optimization method. The proposed algorithm provides the decision maker with a set of non-dominated or Pareto-optimal solutions, and enables them to choose the best one according to their preferences. A set of problems of different sizes is generated and solved using the proposed algorithm. Evaluating the performance of the proposed algorithm, three metrics are suggested, and the diversity and the convergence of the achieved Pareto front are appraised. Finally a comparison is made between CellDE and PAES, another meta-heuristic algorithm. The results show the superiority of CellDE.

"The stone which the builders rejected...": Delay of reinforcement and response rate on fixed-interval and related schedules.

PubMed

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.

Design and architecture of the Mars relay network planning and analysis framework

NASA Technical Reports Server (NTRS)

Cheung, K. M.; Lee, C. H.

2002-01-01

In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

Signals, resistance to change, and conditioned reinforcement in a multiple schedule.

PubMed

Bell, Matthew C; Gomez, Belen E; Kessler, Kira

2008-06-01

The effect of signals on resistance to change was evaluated using pigeons responding on a three-component multiple schedule. Each component contained a variable-interval initial link followed by a fixed-time terminal link. One component was an unsignaled-delay schedule, and two were equivalent signaled-delay schedules. After baseline training, resistance to change was assessed through (a) extinction and (b) adding free food to the intercomponent interval. During these tests, the signal stimulus from one of the signaled-delay components (SIG-T) was replaced with the initial-link stimulus from that component, converting it to an unsignaled-delay schedule. That signal stimulus was added to the delay period of the unsignaled-delay component (UNS), converting it to a signaled-delay schedule. The remaining signaled component remained unchanged (SIG-C). Resistance-to-change tests showed removing the signal had a minimal effect on resistance to change in the SIG-T component compared to the unchanged SIG-C component except for one block during free-food testing. Adding the signal to the UNS component significantly increased response rates suggesting that component had low response strength. Interestingly, the direction of the effect was in the opposite direction from what is typically observed. Results are consistent with the conclusion that the signal functioned as a conditioned reinforcer and inconsistent with a generalization-decrement explanation.

Optimizing Air Transportation Service to Metroplex Airports. Par 2; Analysis Using the Airline Schedule Optimization Model (ASOM)

NASA Technical Reports Server (NTRS)

Donoue, George; Hoffman, Karla; Sherry, Lance; Ferguson, John; Kara, Abdul Qadar

2010-01-01

The air transportation system is a significant driver of the U.S. economy, providing safe, affordable, and rapid transportation. During the past three decades airspace and airport capacity has not grown in step with demand for air transportation; the failure to increase capacity at the same rate as the growth in demand results in unreliable service and systemic delay. This report describes the results of an analysis of airline strategic decision-making that affects geographic access, economic access, and airline finances, extending the analysis of these factors using historic data (from Part 1 of the report). The Airline Schedule Optimization Model (ASOM) was used to evaluate how exogenous factors (passenger demand, airline operating costs, and airport capacity limits) affect geographic access (markets-served, scheduled flights, aircraft size), economic access (airfares), airline finances (profit), and air transportation efficiency (aircraft size). This analysis captures the impact of the implementation of airport capacity limits, as well as the effect of increased hedged fuel prices, which serve as a proxy for increased costs per flight that might occur if auctions or congestion pricing are imposed; also incorporated are demand elasticity curves based on historical data that provide information about how passenger demand is affected by airfare changes.

A Human-in-the Loop Evaluation of a Coordinated Arrival Departure Scheduling Operations for Managing Departure Delays at LaGuardia Airport

NASA Technical Reports Server (NTRS)

Lee, Paul U.; Smith, Nancy M.; Bienert, Nancy; Brasil, Connie; Buckley, Nathan; Chevalley, Eric; Homola, Jeffrey; Omar, Faisal; Parke, Bonny; Yoo, Hyo-Sang

2016-01-01

LaGuardia (LGA) departure delay was identified by the stakeholders and subject matter experts as a significant bottleneck in the New York metropolitan area. Departure delay at LGA is primarily due to dependency between LGA's arrival and departure runways: LGA departures cannot begin takeoff until arrivals have cleared the runway intersection. If one-in one-out operations are not maintained and a significant arrival-to-departure imbalance occurs, the departure backup can persist through the rest of the day. At NASA Ames Research Center, a solution called "Departure-sensitive Arrival Spacing" (DSAS) was developed to maximize the departure throughput without creating significant delays in the arrival traffic. The concept leverages a Terminal Sequencing and Spacing (TSS) operations that create and manage the arrival schedule to the runway threshold and added an interface enhancement to the traffic manager's timeline to provide the ability to manually adjust inter-arrival spacing to build precise gaps for multiple departures between arrivals. A more complete solution would include a TSS algorithm enhancement that could automatically build these multi-departure gaps. With this set of capabilities, inter-arrival spacing could be controlled for optimal departure throughput. The concept was prototyped in a human-in-the- loop (HITL) simulation environment so that operational requirements such as coordination procedures, timing and magnitude of TSS schedule adjustments, and display features for Tower, TRACON and Traffic Management Unit could be determined. A HITL simulation was conducted in August 2014 to evaluate the concept in terms of feasibility, controller workload impact, and potential benefits. Three conditions were tested, namely a Baseline condition without scheduling, TSS condition that schedules the arrivals to the runway threshold, and TSS+DSAS condition that adjusts the arrival schedule to maximize the departure throughput. The results showed that during high arrival demand period, departure throughput could be incrementally increased under TSS and TSS+DSAS conditions without compromising the arrival throughput. The concept, operational procedures, and summary results were originally published in ATM20151 but detailed results were omitted. This paper expands on the earlier paper to provide the detailed results on throughput, conformance, safety, flight time/distance, etc. that provide extra insights into the feasibility and the potential benefits on the concept.

Design principles and algorithms for automated air traffic management

NASA Technical Reports Server (NTRS)

Erzberger, Heinz

1995-01-01

This paper presents design principles and algorithm for building a real time scheduler. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high altitude airspace far from the airport and low altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time.

Optimal Integration of Departure and Arrivals in Terminal Airspace

NASA Technical Reports Server (NTRS)

Xue, Min; Zelinski, Shannon Jean

2012-01-01

Coordination of operations with spatially and temporally shared resources such as route segments, fixes, and runways improves the efficiency of terminal airspace management. Problems in this category include scheduling and routing, thus they are normally difficult to solve compared with pure scheduling problems. In order to reduce the computational time, a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA) was introduced in this work and applied to a test case based on existing literature. The experiment showed that new method can solve the whole problem in fast time instead of solving sub-problems sequentially with a window technique. The results showed a 60% or 406 second delay reduction was achieved by sharing departure fixes (more details on the comparison with MILP results will be presented in the final paper). Furthermore, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial segregation, which may introduce unnecessary delays. In this work, spatial segregation, temporal segregation, and hybrid segregation were formulated using the new algorithm. Results showed that spatial and temporal segregation approaches achieved similar delay. Hybrid segregation introduced much less delay than the other two approaches. For a total of 9 interacting departures and arrivals, delay reduction varied from 4 minutes to 6.4 minutes corresponding flight time uncertainty from 0 to 60 seconds. Considering the amount of flights that could be affected, total annual savings with hybrid segregation would be significant.

Tolerance to cocaine's effects on schedule-controlled behavior: role of delay between pause-ending responses and reinforcement.

PubMed

Macaskill, Anne C; Branch, Marc N

2012-01-01

The schedule of reinforcement under which behavior is maintained is an important contributor to whether tolerance to the behavioral effects of cocaine develops. Schedule parameter value (for example, fixed-ratio size) has been shown to affect the development of tolerance under some schedule types but not others, but the specific procedural variables causing this effect remain to be identified. To date, schedule-parameter-related tolerance has developed when a longer pause after reinforcement does not lead to a shorter delay between the response that ends the pause and reinforcement. The current study investigated the importance of this variable in pigeons using a multiple chained Fixed-Ratio 1, Fixed-Time x schedule, in which the first key peck in a trial produced a stimulus change and initiated a delay at the end of which food was presented regardless of whether or not additional pecks were made during the delay. Dose-response curves were assessed before, during and after chronic (daily) administration of cocaine. Tolerance to the pause-increasing effects of cocaine occurred to a similar degree regardless of the scheduled time between the end of the pause and reinforcement. Therefore, the relationship between pause length and delay to reinforcement does not provide an explanation for schedule-parameter-related tolerance. Copyright © 2011 Elsevier Inc. All rights reserved.

A quantitative analysis of sensitivity to the conditioned reinforcing value of terminal-link stimuli in a concurrent-chains schedule.

PubMed Central

Omino, T

1993-01-01

Pigeons were exposed to a concurrent-chains schedule in which a single variable-interval 30-s schedule was used in the initial links and fixed-time schedules were used in the terminal links. Three types of keylight conditions were used in the terminal links. In the first condition, different delays were associated with different keylight stimuli (cued condition). In the second condition, different delays were associated with the same stimulus, either a blackout (uncued blackout condition) or a white key (uncued white condition). Paired values of terminal-link fixed-time schedules differed by a constant ratio of 3:1, while the absolute value of delays was varied from 3 s to 54 s. The results showed that choice proportions for the shorter of two delays increased when the absolute size of the delays was increased for all keylight conditions. Further, the choice proportions for the shorter delay increased from the uncued blackout condition, to the uncued white condition, to the cued condition. A modified version of Fantino's (1969) delay-reduction model (expressed as a function relating the response ratio to the delay-reduction ratio) can be applied to these data by showing that sensitivity to delay reduction increased from the uncued blackout condition, to the uncued white condition, to the cued condition. Thus, the present study demonstrated that a modified version of the delay-reduction model can be used to assess quantitative differences in the terminal-link keylight condition in terms of sensitivity to delay reduction (i.e., the conditioned reinforcing value of the terminal-link keylight stimuli). PMID:8283150

On optimal scheduling and air traffic control in the near terminal area. M.S. Thesis

NASA Technical Reports Server (NTRS)

Sarris, A. H.

1971-01-01

A scheme is proposed for automated air traffic control of landing aircraft in the vicinity of the airport. Each aircraft is put under the control of an airport-based computer as soon as it enters the near-terminal area (NTA). Scheduling is done immediately thereafter. The aircraft is given a flight plan which, if followed precisely, will lead it to the runway at a prespecified time. The geometry of the airspace in the NTA is chosen so that delays are executed far from the outer marker, and violations of minimum altitude and lateral separations are avoided. Finally, a solution to the velocity mix problem is proposed.

Forensic Schedule Analysis of Construction Delay in Military Projects in the Middle East

DTIC Science & Technology

This research performs forensic schedule analysis of delay factors that impacted recent large-scale military construction projects in the Middle East...The methodologies for analysis are adapted from the Professional Practice Guide to Forensic Schedule Analysis, particularly Method 3.7 Modeled

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

Amphetamine increases schedule-induced drinking reduced by negative punishment procedures.

PubMed

Pérez-Padilla, Angeles; Pellón, Ricardo

2003-05-01

d-Amphetamine has been reported to increase schedule-induced drinking punished by lick-dependent signalled delays in food delivery. This might reflect a drug-behaviour interaction dependent on the type of punisher, because no such effect has been found when drinking was reduced by lick-contingent electric shocks. However, the anti-punishment effect of amphetamine could be mediated by other behavioural processes, such as a loss of discriminative control or an increase in the value of delayed reinforcers. To test the effects of d-amphetamine on the acquisition and maintenance of schedule-induced drinking reduced by unsignalled delays in food delivery. Rats received 10-s unsignalled delays initiated by each lick after polydipsia was induced by a fixed-time 30-s food reinforcement schedule or from the outset of the experiment. Yoked-control rats received these same delays but independently of their own behaviour. d-Amphetamine (0.1-3.0 mg/kg) was then tested IP. d-Amphetamine dose-dependently increased and then decreased punished schedule-induced drinking. The drug led to dose-dependent reductions when the delays were not contingent or when they were applied from the outset of training. These results support the contention that d-amphetamine has an increasing effect on schedule-induced drinking that has been previously reduced by a negative punishment procedure. This effect cannot be attributed to other potentially involved processes, and therefore support the idea that drug effects on punished behaviour depend on punishment being delays in food or shock deliveries.

Modelling the effects of booster dose vaccination schedules and recommendations for public health immunization programs: the case of Haemophilus influenzae serotype b.

PubMed

Charania, Nadia A; Moghadas, Seyed M

2017-09-13

Haemophilus influenzae serotype b (Hib) has yet to be eliminated despite the implementation of routine infant immunization programs. There is no consensus regarding the number of primary vaccine doses and an optimal schedule for the booster dose. We sought to evaluate the effect of a booster dose after receiving the primary series on the long-term disease incidence. A stochastic model of Hib transmission dynamics was constructed to compare the long-term impact of a booster vaccination and different booster schedules after receiving the primary series on the incidence of carriage and symptomatic disease. We parameterized the model with available estimates for the efficacy of Hib conjugate vaccine and durations of both vaccine-induced and naturally acquired immunity. We found that administering a booster dose substantially reduced the population burden of Hib disease compared to the scenario of only receiving the primary series. Comparing the schedules, the incidence of carriage for a 2-year delay (on average) in booster vaccination was comparable or lower than that observed for the scenario of booster dose within 1 year after primary series. The temporal reduction of symptomatic disease was similar in the two booster schedules, suggesting no superiority of one schedule over the other in terms of reducing the incidence of symptomatic disease. The findings underscore the importance of a booster vaccination for continued decline of Hib incidence. When the primary series provides a high level of protection temporarily, delaying the booster dose (still within the average duration of protection conferred by the primary series) may be beneficial to maintain longer-term protection levels and decelerate the decline of herd immunity in the population.

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.

Multichannel-Sensing Scheduling and Transmission-Energy Optimizing in Cognitive Radio Networks with Energy Harvesting.

PubMed

Hoan, Tran-Nhut-Khai; Hiep, Vu-Van; Koo, In-Soo

2016-03-31

This paper considers cognitive radio networks (CRNs) utilizing multiple time-slotted primary channels in which cognitive users (CUs) are powered by energy harvesters. The CUs are under the consideration that hardware constraints on radio devices only allow them to sense and transmit on one channel at a time. For a scenario where the arrival of harvested energy packets and the battery capacity are finite, we propose a scheme to optimize (i) the channel-sensing schedule (consisting of finding the optimal action (silent or active) and sensing order of channels) and (ii) the optimal transmission energy set corresponding to the channels in the sensing order for the operation of the CU in order to maximize the expected throughput of the CRN over multiple time slots. Frequency-switching delay, energy-switching cost, correlation in spectrum occupancy across time and frequency and errors in spectrum sensing are also considered in this work. The performance of the proposed scheme is evaluated via simulation. The simulation results show that the throughput of the proposed scheme is greatly improved, in comparison to related schemes in the literature. The collision ratio on the primary channels is also investigated.

A Concept and Implementation of Optimized Operations of Airport Surface Traffic

NASA Technical Reports Server (NTRS)

Jung, Yoon C.; Hoang, Ty; Montoya, Justin; Gupta, Gautam; Malik, Waqar; Tobias, Leonard

2010-01-01

This paper presents a new concept of optimized surface operations at busy airports to improve the efficiency of taxi operations, as well as reduce environmental impacts. The suggested system architecture consists of the integration of two decoupled optimization algorithms. The Spot Release Planner provides sequence and timing advisories to tower controllers for releasing departure aircraft into the movement area to reduce taxi delay while achieving maximum throughput. The Runway Scheduler provides take-off sequence and arrival runway crossing sequence to the controllers to maximize the runway usage. The description of a prototype implementation of this integrated decision support tool for the airport control tower controllers is also provided. The prototype decision support tool was evaluated through a human-in-the-loop experiment, where both the Spot Release Planner and Runway Scheduler provided advisories to the Ground and Local Controllers. Initial results indicate the average number of stops made by each departure aircraft in the departure runway queue was reduced by more than half when the controllers were using the advisories, which resulted in reduced taxi times in the departure queue.

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F.

2014-04-01

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this paper develops a novel hybrid genetic algorithm (HGA) with three genetic operators. Proposed HGA applies a modified approach to generate a pool of initial solutions, and also uses an improved heuristic called the iterated swap procedure to improve the initial solutions. We consider the make-to-order production approach that some sequences between jobs are assumed as tabu based on maximum allowable setup cost. In addition, the results are compared to some recently developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect to accuracy and efficiency of solution.

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.

Wheels-Off Time Uncertainty Impact on Benefits of Early Call for Release Scheduling

NASA Technical Reports Server (NTRS)

Palopo, Kee; Chatterji, Gano B.; Almog, Noam

2017-01-01

Arrival traffic scenarios with 808 flights from 173 airports to Houston George Bush International airport are simulated to determine if Call For Release flights can receive a benefit in terms of less delay over other flights by scheduling prior to gate pushback (look-ahead in time) as opposed to at gate pushback. Call for Release flights are departures that require approval from Air Route Traffic Control Center prior to release. Realism is brought to the study by including gate departure delay and taxi-out delay uncertainties for the 77 major U. S. airports. Gate departure delay uncertainty is assumed to increase as a function of look-ahead time. Results show that Call For Release flights from an airport within the freeze horizon (a region surrounding the arrival airport) can get an advantage over other flights to a capacity constrained airport by scheduling prior to gate pushback, provided the wheels-off time uncertainty with respect to schedule is controlled to a small value, such as within a three-minute window. Another finding of the study is that system delay, measured as the sum of arrival delays, is smaller when flights are scheduled in the order of arrival compared to in the order of departure. Because flights from airports within the freeze horizon are scheduled in the order of departure, an increase in the number of internal airports with a larger freeze horizon increases system delay. Delay in the given scenario was found to increase by 126% (from 13.8 hours to 31.2 hours) as freeze horizon was increased from 30-minutes to 2-hours in the baseline scenario.

Circadian phase, dynamics of subjective sleepiness and sensitivity to blue light in young adults complaining of a delayed sleep schedule.

PubMed

Moderie, Christophe; Van der Maren, Solenne; Dumont, Marie

2017-06-01

To assess factors that might contribute to a delayed sleep schedule in young adults with sub-clinical features of delayed sleep phase disorder. Two groups of 14 young adults (eight women) were compared: one group complaining of a delayed sleep schedule and a control group with an earlier bedtime and no complaint. For one week, each subject maintained a target bedtime reflecting their habitual sleep schedule. Subjects were then admitted to the laboratory for the assessment of circadian phase (dim light melatonin onset), subjective sleepiness, and non-visual light sensitivity. All measures were timed relative to each participant's target bedtime. Non-visual light sensitivity was evaluated using subjective sleepiness and salivary melatonin during 1.5-h exposure to blue light, starting one hour after target bedtime. Compared to control subjects, delayed subjects had a later circadian phase and a slower increase of subjective sleepiness in the late evening. There was no group difference in non-visual sensitivity to blue light, but we found a positive correlation between melatonin suppression and circadian phase within the delayed group. Our results suggest that a late circadian phase, a slow build-up of sleep need, and an increased circadian sensitivity to blue light contribute to the complaint of a delayed sleep schedule. These findings provide targets for strategies aiming to decreasing the severity of a sleep delay and the negative consequences on daytime functioning and health. Copyright © 2017 Elsevier B.V. All rights reserved.

Methodology for Analysis, Modeling and Simulation of Airport Gate-waiting Delays

NASA Astrophysics Data System (ADS)

Wang, Jianfeng

This dissertation presents methodologies to estimate gate-waiting delays from historical data, to identify gate-waiting-delay functional causes in major U.S. airports, and to evaluate the impact of gate operation disruptions and mitigation strategies on gate-waiting delay. Airport gates are a resource of congestion in the air transportation system. When an arriving flight cannot pull into its gate, the delay it experiences is called gate-waiting delay. Some possible reasons for gate-waiting delay are: the gate is occupied, gate staff or equipment is unavailable, the weather prevents the use of the gate (e.g. lightning), or the airline has a preferred gate assignment. Gate-waiting delays potentially stay with the aircraft throughout the day (unless they are absorbed), adding costs to passengers and the airlines. As the volume of flights increases, ensuring that airport gates do not become a choke point of the system is critical. The first part of the dissertation presents a methodology for estimating gate-waiting delays based on historical, publicly available sources. Analysis of gate-waiting delays at major U.S. airports in the summer of 2007 identifies the following. (i) Gate-waiting delay is not a significant problem on majority of days; however, the worst delay days (e.g. 4% of the days at LGA) are extreme outliers. (ii) The Atlanta International Airport (ATL), the John F. Kennedy International Airport (JFK), the Dallas/Fort Worth International Airport (DFW) and the Philadelphia International Airport (PHL) experience the highest gate-waiting delays among major U.S. airports. (iii) There is a significant gate-waiting-delay difference between airlines due to a disproportional gate allocation. (iv) Gate-waiting delay is sensitive to time of a day and schedule peaks. According to basic principles of queueing theory, gate-waiting delay can be attributed to over-scheduling, higher-than-scheduled arrival rate, longer-than-scheduled gate-occupancy time, and reduced gate availability. Analysis of the worst days at six major airports in the summer of 2007 indicates that major gate-waiting delays are primarily due to operational disruptions---specifically, extended gate occupancy time, reduced gate availability and higher-than-scheduled arrival rate (usually due to arrival delay). Major gate-waiting delays are not a result of over-scheduling. The second part of this dissertation presents a simulation model to evaluate the impact of gate operational disruptions and gate-waiting-delay mitigation strategies, including building new gates, implementing common gates, using overnight off-gate parking and adopting self-docking gates. Simulation results show the following effects of disruptions: (i) The impact of arrival delay in a time window (e.g. 7 pm to 9 pm) on gate-waiting delay is bounded. (ii) The impact of longer-than-scheduled gate-occupancy times in a time window on gate-waiting delay can be unbounded and gate-waiting delay can increase linearly as the disruption level increases. (iii) Small reductions in gate availability have a small impact on gate-waiting delay due to slack gate capacity, while larger reductions have a non-linear impact as slack gate capacity is used up. Simulation results show the following effects of mitigation strategies: (i) Implementing common gates is an effective mitigation strategy, especially for airports with a flight schedule not dominated by one carrier, such as LGA. (ii) The overnight off-gate rule is effective in mitigating gate-waiting delay for flights stranded overnight following departure cancellations. This is especially true at airports where the gate utilization is at maximum overnight, such as LGA and DFW. The overnight off-gate rule can also be very effective to mitigate gate-waiting delay due to operational disruptions in evenings. (iii) Self-docking gates are effective in mitigating gate-waiting delay due to reduced gate availability.

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.

Evolution of Resistance to Targeted Anti-Cancer Therapies during Continuous and Pulsed Administration Strategies

PubMed Central

Foo, Jasmine; Michor, Franziska

2009-01-01

The discovery of small molecules targeted to specific oncogenic pathways has revolutionized anti-cancer therapy. However, such therapy often fails due to the evolution of acquired resistance. One long-standing question in clinical cancer research is the identification of optimum therapeutic administration strategies so that the risk of resistance is minimized. In this paper, we investigate optimal drug dosing schedules to prevent, or at least delay, the emergence of resistance. We design and analyze a stochastic mathematical model describing the evolutionary dynamics of a tumor cell population during therapy. We consider drug resistance emerging due to a single (epi)genetic alteration and calculate the probability of resistance arising during specific dosing strategies. We then optimize treatment protocols such that the risk of resistance is minimal while considering drug toxicity and side effects as constraints. Our methodology can be used to identify optimum drug administration schedules to avoid resistance conferred by one (epi)genetic alteration for any cancer and treatment type. PMID:19893626

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.

Energy optimization for upstream data transfer in 802.15.4 beacon-enabled star formulation

NASA Astrophysics Data System (ADS)

Liu, Hua; Krishnamachari, Bhaskar

2008-08-01

Energy saving is one of the major concerns for low rate personal area networks. This paper models energy consumption for beacon-enabled time-slotted media accessing control cooperated with sleeping scheduling in a star network formulation for IEEE 802.15.4 standard. We investigate two different upstream (data transfer from devices to a network coordinator) strategies: a) tracking strategy: the devices wake up and check status (track the beacon) in each time slot; b) non-tracking strategy: nodes only wake-up upon data arriving and stay awake till data transmitted to the coordinator. We consider the tradeoff between energy cost and average data transmission delay for both strategies. Both scenarios are formulated as optimization problems and the optimal solutions are discussed. Our results show that different data arrival rate and system parameters (such as contention access period interval, upstream speed etc.) result in different strategies in terms of energy optimization with maximum delay constraints. Hence, according to different applications and system settings, different strategies might be chosen by each node to achieve energy optimization for both self-interested view and system view. We give the relation among the tunable parameters by formulas and plots to illustrate which strategy is better under corresponding parameters. There are two main points emphasized in our results with delay constraints: on one hand, when the system setting is fixed by coordinator, nodes in the network can intelligently change their strategies according to corresponding application data arrival rate; on the other hand, when the nodes' applications are known by the coordinator, the coordinator can tune the system parameters to achieve optimal system energy consumption.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

PubMed Central

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

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

PubMed

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.

Flight Departure Delay and Rerouting Under Uncertainty in En Route Convective Weather

NASA Technical Reports Server (NTRS)

Mukherjee, Avijit; Grabbe, Shon; Sridhar, Banavar

2011-01-01

Delays caused by uncertainty in weather forecasts can be reduced by improving traffic flow management decisions. This paper presents a methodology for traffic flow management under uncertainty in convective weather forecasts. An algorithm for assigning departure delays and reroutes to aircraft is presented. Departure delay and route assignment are executed at multiple stages, during which, updated weather forecasts and flight schedules are used. At each stage, weather forecasts up to a certain look-ahead time are treated as deterministic and flight scheduling is done to mitigate the impact of weather on four-dimensional flight trajectories. Uncertainty in weather forecasts during departure scheduling results in tactical airborne holding of flights. The amount of airborne holding depends on the accuracy of forecasts as well as the look-ahead time included in the departure scheduling. The weather forecast look-ahead time is varied systematically within the experiments performed in this paper to analyze its effect on flight delays. Based on the results, longer look-ahead times cause higher departure delays and additional flying time due to reroutes. However, the amount of airborne holding necessary to prevent weather incursions reduces when the forecast look-ahead times are higher. For the chosen day of traffic and weather, setting the look-ahead time to 90 minutes yields the lowest total delay cost.

Determinants of choice for pigeons and humans on concurrent-chains schedules of reinforcement.

PubMed

Belke, T W; Pierce, W D; Powell, R A

1989-09-01

Concurrent-chains schedules of reinforcement were arranged for humans and pigeons. Responses of humans were reinforced with tokens exchangeable for money, and key pecks of 4 birds were reinforced with food. Variable-interval 30-s and 40-s schedules operated in the terminal links of the chains. Condition 1 exposed subjects to variable-interval 90-s and variable-interval 30-s initial links, respectively. Conditions 2 and 3 arranged equal initial-link schedules of 40 s or 120 s. Experimental conditions tested the descriptive adequacy of five equations: reinforcement density, delay reduction, modified delay reduction, matching and maximization. Results based on choice proportions and switch rates during the initial links showed that pigeons behaved in accord with delay-reduction models, whereas humans maximized overall rate of reinforcement. As discussed by Logue and associates in self-control research, different types of reinforcement may affect sensitivity to delay differentially. Pigeons' responses were reinforced with food, a reinforcer that is consumable upon presentation. Humans' responses were reinforced with money, a reinforcer exchanged for consumable reinforcers after it was earned. Reinforcers that are immediately consumed may generate high sensitivity to delay and behavior described as delay reduction. Reinforces with longer times to consumption may generate low sensitivity to delay and behavior that maximizes overall payoff.

Transitional and Steady-State Choice Behavior under an Adjusting-Delay Schedule

ERIC Educational Resources Information Center

Torres, L. Valencia; Araujo, S. da Costa; Sanchez, C. M. Olarte; Body, S.; Bradshaw, C. M.; Szabadi, E.

2011-01-01

Twelve rats made repeated choices on an adjusting-delay schedule between a smaller reinforcer (A) that was delivered immediately after a response and a larger reinforcer (B) that was delivered after a delay which increased or decreased by 20% depending on the subject's choices in successive blocks of trials. In two phases of the experiment (100…

Active flutter suppression using optical output feedback digital controllers

NASA Technical Reports Server (NTRS)

1982-01-01

A method for synthesizing digital active flutter suppression controllers using the concept of optimal output feedback is presented. A convergent algorithm is employed to determine constrained control law parameters that minimize an infinite time discrete quadratic performance index. Low order compensator dynamics are included in the control law and the compensator parameters are computed along with the output feedback gain as part of the optimization process. An input noise adjustment procedure is used to improve the stability margins of the digital active flutter controller. Sample rate variation, prefilter pole variation, control structure variation and gain scheduling are discussed. A digital control law which accommodates computation delay can stabilize the wing with reasonable rms performance and adequate stability margins.

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

PubMed

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

Spot and Runway Departure Advisor (SARDA)

NASA Technical Reports Server (NTRS)

Jung, Yoon

2016-01-01

Spot and Runway Departure Advisor (SARDA) is a decision support tool to assist airline ramp controllers and ATC tower controllers to manage traffic on the airport surface to significantly improve efficiency and predictability in surface operations. The core function of the tool is the runway scheduler which generates an optimal solution for runway sequence and schedule of departure aircraft, which would minimize system delay and maximize runway throughput. The presentation also discusses the latest status of NASA's current surface research through a collaboration with an airline partner, where a tool is developed for airline ramp operators to assist departure pushback operations. The presentation describes the concept of the SARDA tool and results from human-in-the-loop simulations conducted in 2012 for Dallas-Ft. Worth International Airport and 2014 for Charlotte airport ramp tower.

Route Optimization for Offloading Congested Meter Fixes

NASA Technical Reports Server (NTRS)

Xue, Min; Zelinski, Shannon

2016-01-01

The Optimized Route Capability (ORC) concept proposed by the FAA facilitates traffic managers to identify and resolve arrival flight delays caused by bottlenecks formed at arrival meter fixes when there exists imbalance between arrival fixes and runways. ORC makes use of the prediction capability of existing automation tools, monitors the traffic delays based on these predictions, and searches the best reroutes upstream of the meter fixes based on the predictions and estimated arrival schedules when delays are over a predefined threshold. Initial implementation and evaluation of the ORC concept considered only reroutes available at the time arrival congestion was first predicted. This work extends previous work by introducing an additional dimension in reroute options such that ORC can find the best time to reroute and overcome the 'firstcome- first-reroute' phenomenon. To deal with the enlarged reroute solution space, a genetic algorithm was developed to solve this problem. Experiments were conducted using the same traffic scenario used in previous work, when an arrival rush was created for one of the four arrival meter fixes at George Bush Intercontinental Houston Airport. Results showed the new approach further improved delay savings. The suggested route changes from the new approach were on average 30 minutes later than those using other approaches, and fewer numbers of reroutes were required. Fewer numbers of reroutes reduce operational complexity and later reroutes help decision makers deal with uncertain situations.

Choice and conditioned reinforcement.

PubMed Central

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

System-level power optimization for real-time distributed embedded systems

NASA Astrophysics Data System (ADS)

Luo, Jiong

Power optimization is one of the crucial design considerations for modern electronic systems. In this thesis, we present several system-level power optimization techniques for real-time distributed embedded systems, based on dynamic voltage scaling, dynamic power management, and management of peak power and variance of the power profile. Dynamic voltage scaling has been widely acknowledged as an important and powerful technique to trade off dynamic power consumption and delay. Efficient dynamic voltage scaling requires effective variable-voltage scheduling mechanisms that can adjust voltages and clock frequencies adaptively based on workloads and timing constraints. For this purpose, we propose static variable-voltage scheduling algorithms utilizing criticalpath driven timing analysis for the case when tasks are assumed to have uniform switching activities, as well as energy-gradient driven slack allocation for a more general scenario. The proposed techniques can achieve closeto-optimal power savings with very low computational complexity, without violating any real-time constraints. We also present algorithms for power-efficient joint scheduling of multi-rate periodic task graphs along with soft aperiodic tasks. The power issue is addressed through both dynamic voltage scaling and power management. Periodic task graphs are scheduled statically. Flexibility is introduced into the static schedule to allow the on-line scheduler to make local changes to PE schedules through resource reclaiming and slack stealing, without interfering with the validity of the global schedule. We provide a unified framework in which the response times of aperiodic tasks and power consumption are dynamically optimized simultaneously. Interconnection network fabrics point to a new generation of power-efficient and scalable interconnection architectures for distributed embedded systems. As the system bandwidth continues to increase, interconnection networks become power/energy limited as well. Variable-frequency links have been designed by circuit designers for both parallel and serial links, which can adaptively regulate the supply voltage of transceivers to a desired link frequency, to exploit the variations in bandwidth requirement for power savings. We propose solutions for simultaneous dynamic voltage scaling of processors and links. The proposed solution considers real-time scheduling, flow control, and packet routing jointly. It can trade off the power consumption on processors and communication links via efficient slack allocation, and lead to more power savings than dynamic voltage scaling on processors alone. For battery-operated systems, the battery lifespan is an important concern. Due to the effects of discharge rate and battery recovery, the discharge pattern of batteries has an impact on the battery lifespan. Battery models indicate that even under the same average power consumption, reducing peak power current and variance in the power profile can increase the battery efficiency and thereby prolong battery lifetime. To take advantage of these effects, we propose battery-driven scheduling techniques for embedded applications, to reduce the peak power and the variance in the power profile of the overall system under real-time constraints. The proposed scheduling algorithms are also beneficial in addressing reliability and signal integrity concerns by effectively controlling peak power and variance of the power profile.

Effects of burstiness on the air transportation system

NASA Astrophysics Data System (ADS)

Ito, Hidetaka; Nishinari, Katsuhiro

2017-01-01

The effects of burstiness in complex networks have received considerable attention. In particular, the effects on temporal distance and delays in the air transportation system are significant owing to their huge impact on our society. Therefore, in this paper, the temporal distance of empirical U.S. flight schedule data is compared with that of regularized data without burstiness to analyze the effects of burstiness. The temporal distance is calculated by a graph analysis method considering flight delays, missed connections, flight cancellations, and congestion. In addition, we propose two temporal distance indexes based on passengers' behavior to quantify the effects. As a result, we find that burstiness reduces both the scheduled and the actual temporal distances for business travelers, while delays caused by missed connections and congestion are increased. We also find that the decrease of the scheduled temporal distance by burstiness is offset by an increase of the delays for leisure passengers. Moreover, we discover that the positive effect of burstiness is lost when flight schedules are overcrowded.

Effects of burstiness on the air transportation system.

PubMed

Ito, Hidetaka; Nishinari, Katsuhiro

2017-01-01

The effects of burstiness in complex networks have received considerable attention. In particular, the effects on temporal distance and delays in the air transportation system are significant owing to their huge impact on our society. Therefore, in this paper, the temporal distance of empirical U.S. flight schedule data is compared with that of regularized data without burstiness to analyze the effects of burstiness. The temporal distance is calculated by a graph analysis method considering flight delays, missed connections, flight cancellations, and congestion. In addition, we propose two temporal distance indexes based on passengers' behavior to quantify the effects. As a result, we find that burstiness reduces both the scheduled and the actual temporal distances for business travelers, while delays caused by missed connections and congestion are increased. We also find that the decrease of the scheduled temporal distance by burstiness is offset by an increase of the delays for leisure passengers. Moreover, we discover that the positive effect of burstiness is lost when flight schedules are overcrowded.

Spot and Runway Departure Advisor

NASA Technical Reports Server (NTRS)

Jung, Yoon Chul

2013-01-01

The Spot and Runway Departure Advisor (SARDA) is a research prototype of a decision support tool for ATC tower controllers to assist in manging and controlling traffic on the surface of an airport. SARDA employs a scheduler to generate an optimal runway schedule and gate push-back - spot release sequence and schedule that improves efficiency of surface operations. The advisories for ATC tower controllers are displayed on an Electronic Flight Strip (EFS) system. The human-in-the-loop simulation of the SARDA tool was conducted for east operations of Dallas-Ft. Worth International Airport (DFW) to evaluate performance of the SARDA tool and human factors, such as situational awareness and workload. The results indicates noticeable taxi delay reduction and fuel savings by using the SARDA tool. Reduction in controller workload were also observed throughout the scenario runs. The future plan includes modeling and simulation of the ramp operations of the Charlotte International Airport, and develop a decision support tool for the ramp controllers.

Sleep and cognitive performance of African-Americans and European-Americans before and during circadian misalignment produced by an abrupt 9-h delay in the sleep/wake schedule

PubMed Central

Crowley, Stephanie J.; Eastman, Charmane I.

2017-01-01

We conducted two studies of circadian misalignment in non-Hispanic African and European-Americans. In the first, the sleep/wake (light/dark) schedule was advanced 9 h, similar to flying east, and in the second these schedules were delayed 9 h, similar to flying west or sleeping during the day after night work. We confirmed that the free-running circadian period is shorter in African-Americans compared to European-Americans, and found differences in the magnitude and direction of circadian rhythm phase shifts which were related to the circadian period. The sleep and cognitive performance data from the first study (published in this journal) documented the impairment in both ancestry groups due to this extreme circadian misalignment. African-Americans slept less and performed slightly worse during advanced/misaligned days than European-Americans. The current analysis is of sleep and cognitive performance from the second study. Participants were 23 African-Americans and 22 European-Americans (aged 18–44 years). Following four baseline days (8 h time in bed, based on habitual sleep), the sleep/wake schedule was delayed by 9 h for three days. Sleep was monitored using actigraphy. During the last two baseline/aligned days and the first two delayed/misaligned days, beginning 2 h after waking, cognitive performance was assessed every 3 h using the Automated Neuropsychological Assessment Metrics (ANAM) battery. Mixed model ANOVAs assessed the effects of ancestry (African-American or European-American) and condition (baseline/aligned or delayed/misaligned) on sleep and performance. There was decreased sleep and impaired cognitive performance in both ancestry groups during the two delayed/misaligned days relative to baseline/aligned days. Sleep and cognitive performance did not differ between African-Americans and European-Americans during either baseline/aligned or delayed/misaligned days. While our previous work showed that an advance in the sleep/wake schedule impaired the sleep of African-Americans more than European-Americans, delaying the sleep/wake schedule impaired the sleep and cognitive performance of African-Americans and European-Americans equally. PMID:29073187

QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

PubMed

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

2016-02-01

As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

Strategies for Optimal MAC Parameters Tuning in IEEE 802.15.6 Wearable Wireless Sensor Networks.

PubMed

Alam, Muhammad Mahtab; Ben Hamida, Elyes

2015-09-01

Wireless body area networks (WBAN) has penetrated immensely in revolutionizing the classical heath-care system. Recently, number of WBAN applications has emerged which introduce potential limits to existing solutions. In particular, IEEE 802.15.6 standard has provided great flexibility, provisions and capabilities to deal emerging applications. In this paper, we investigate the application-specific throughput analysis by fine-tuning the physical (PHY) and medium access control (MAC) parameters of the IEEE 802.15.6 standard. Based on PHY characterizations in narrow band, at the MAC layer, carrier sense multiple access collision avoidance (CSMA/CA) and scheduled access protocols are extensively analyzed. It is concluded that, IEEE 802.15.6 standard can satisfy most of the WBANs applications throughput requirements by maximum achieving 680 Kbps. However, those emerging applications which require high quality audio or video transmissions, standard is not able to meet their constraints. Moreover, delay, energy efficiency and successful packet reception are considered as key performance metrics for comparing the MAC protocols. CSMA/CA protocol provides the best results to meet the delay constraints of medical and non-medical WBAN applications. Whereas, the scheduled access approach, performs very well both in energy efficiency and packet reception ratio.

Channel Acquisition for Massive MIMO-OFDM With Adjustable Phase Shift Pilots

NASA Astrophysics Data System (ADS)

You, Li; Gao, Xiqi; Swindlehurst, A. Lee; Zhong, Wen

2016-03-01

We propose adjustable phase shift pilots (APSPs) for channel acquisition in wideband massive multiple-input multiple-output (MIMO) systems employing orthogonal frequency division multiplexing (OFDM) to reduce the pilot overhead. Based on a physically motivated channel model, we first establish a relationship between channel space-frequency correlations and the channel power angle-delay spectrum in the massive antenna array regime, which reveals the channel sparsity in massive MIMO-OFDM. With this channel model, we then investigate channel acquisition, including channel estimation and channel prediction, for massive MIMO-OFDM with APSPs. We show that channel acquisition performance in terms of sum mean square error can be minimized if the user terminals' channel power distributions in the angle-delay domain can be made non-overlapping with proper phase shift scheduling. A simplified pilot phase shift scheduling algorithm is developed based on this optimal channel acquisition condition. The performance of APSPs is investigated for both one symbol and multiple symbol data models. Simulations demonstrate that the proposed APSP approach can provide substantial performance gains in terms of achievable spectral efficiency over the conventional phase shift orthogonal pilot approach in typical mobility scenarios.

Evaluation of Scheduling Methods for Multiple Runways

NASA Technical Reports Server (NTRS)

Bolender, Michael A.; Slater, G. L.

1996-01-01

Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

Proceedings of the Annual ACM Symposium (11th) on Principles of Distributed Computing Held in Vancouver, British Columbia, Canada on 10-12 Aug 1992

DTIC Science & Technology

1992-08-10

scheduler’s strategy. At the beginning of the is delayed at this state. A routing edge (Si,Tj), execution, the scheduler delays all messages sent for...graph G and Appendix). We remark that the choice of "play" the role ý-’ the scheduler . The scheduler’s constants in the above definition is not...34’ Annmul Symposium ical wakeup . Also, assume that during [t, t + x], for on Foundations of Computer Science. IEEE, t > 2n, a specific route of length at most

Wiener-Hopf optimal control of a hydraulic canal prototype with fractional order dynamics.

PubMed

Feliu-Batlle, Vicente; Feliu-Talegón, Daniel; San-Millan, Andres; Rivas-Pérez, Raúl

2017-06-26

This article addresses the control of a laboratory hydraulic canal prototype that has fractional order dynamics and a time delay. Controlling this prototype is relevant since its dynamics closely resembles the dynamics of real main irrigation canals. Moreover, the dynamics of hydraulic canals vary largely when the operation regime changes since they are strongly nonlinear systems. All this makes difficult to design adequate controllers. The controller proposed in this article looks for a good time response to step commands. The design criterium for this controller is minimizing the integral performance index ISE. Then a new methodology to control fractional order processes with a time delay, based on the Wiener-Hopf control and the Padé approximation of the time delay, is developed. Moreover, in order to improve the robustness of the control system, a gain scheduling fractional order controller is proposed. Experiments show the adequate performance of the proposed controller. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Design Considerations for a New Terminal Area Arrival Scheduler

NASA Technical Reports Server (NTRS)

Thipphavong, Jane; Mulfinger, Daniel

2010-01-01

Design of a terminal area arrival scheduler depends on the interrelationship between throughput, delay and controller intervention. The main contribution of this paper is an analysis of the above interdependence for several stochastic behaviors of expected system performance distributions in the aircraft s time of arrival at the meter fix and runway. Results of this analysis serve to guide the scheduler design choices for key control variables. Two types of variables are analyzed, separation buffers and terminal delay margins. The choice for these decision variables was tested using sensitivity analysis. Analysis suggests that it is best to set the separation buffer at the meter fix to its minimum and adjust the runway buffer to attain the desired system performance. Delay margin was found to have the least effect. These results help characterize the variables most influential in the scheduling operations of terminal area arrivals.

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.

Food-deprivation effects on punished schedule-induced drinking in rats.

PubMed Central

Lamas, E; Pellón, R

1995-01-01

Food-deprived rats (at 80% of their free-feeding weights) were exposed to a fixed-time 60-s schedule of food-pellet presentation and developed schedule-induced drinking. Lick-dependent signaled delays (10 s) to food presentation led to decreased drinking, which recovered when the signaled delays were discontinued. A major effect of this punishment contingency was to increase the proportion of interpellet intervals without any licks. The drinking of yoked control rats, which received food at the same times as those exposed to the signaled delay contingency (masters), was not consistently reduced. When food-deprivation level was changed to 90%, all master and yoked control rats showed decreases in punished or unpunished schedule-induced drinking. When the body weights were reduced to 70%, most master rats increased punished behavior to levels similar to those of unpunished drinking. This effect was not observed for yoked controls. Therefore, body-weight loss increased the resistance of schedule-induced drinking to reductions by punishment. Food-deprivation effects on punished schedule-induced drinking are similar to their effects on food-maintained lever pressing. This dependency of punishment on food-deprivation level supports the view that schedule-induced drinking can be modified by the same variables that affect operant behavior in general. PMID:7622981

Do we perform surgical programming well? How can we improve it?

PubMed

Albareda, J; Clavel, D; Mahulea, C; Blanco, N; Ezquerra, L; Gómez, J; Silva, J M

The objective is to establish the duration of our interventions, intermediate times and surgical performance. This will create a virtual waiting list to apply a mathematical programme that performs programming with maximum performance. Retrospective review of 49 surgical sessions obtaining the delay in start time, intermediate time and surgical performance. Retrospective review of 4,045 interventions performed in the last 3 years to obtain the average duration of each type of surgery. Creation of a virtual waiting list of 700 patients in order to perform virtual programming through the MIQCP-P until achieving optimal performance. Our surgical performance with manual programming was 75.9%, ending 22.4% later than 3pm. The performance in the days without suspensions was 78.4%. The delay at start time was 9.7min. The optimum performance was 77.5% with a confidence of finishing before 15h of 80.6%. The waiting list has been scheduled in 254 sessions. Our manual surgical performance without suspensions (78.4%) was superior to the optimal (77.5%), generating days finished later than 3pm and suspensions. The possibilities for improvement are to achieve punctuality at the start time and adjust the schedule to the ideal performance. The virtual programming has allowed us to obtain our ideal performance and to establish the number of operating rooms necessary to solve the waiting list created. The data obtained in virtual mathematical programming are reliable enough to implement this model with guarantees. Copyright © 2017 SECOT. Publicado por Elsevier España, S.L.U. All rights reserved.

Optimizing Perioperative Decision Making: Improved Information for Clinical Workflow Planning

PubMed Central

Doebbeling, Bradley N.; Burton, Matthew M.; Wiebke, Eric A.; Miller, Spencer; Baxter, Laurence; Miller, Donald; Alvarez, Jorge; Pekny, Joseph

2012-01-01

Perioperative care is complex and involves multiple interconnected subsystems. Delayed starts, prolonged cases and overtime are common. Surgical procedures account for 40–70% of hospital revenues and 30–40% of total costs. Most planning and scheduling in healthcare is done without modern planning tools, which have potential for improving access by assisting in operations planning support. We identified key planning scenarios of interest to perioperative leaders, in order to examine the feasibility of applying combinatorial optimization software solving some of those planning issues in the operative setting. Perioperative leaders desire a broad range of tools for planning and assessing alternate solutions. Our modeled solutions generated feasible solutions that varied as expected, based on resource and policy assumptions and found better utilization of scarce resources. Combinatorial optimization modeling can effectively evaluate alternatives to support key decisions for planning clinical workflow and improving care efficiency and satisfaction. PMID:23304284

Optimizing perioperative decision making: improved information for clinical workflow planning.

PubMed

Doebbeling, Bradley N; Burton, Matthew M; Wiebke, Eric A; Miller, Spencer; Baxter, Laurence; Miller, Donald; Alvarez, Jorge; Pekny, Joseph

2012-01-01

Perioperative care is complex and involves multiple interconnected subsystems. Delayed starts, prolonged cases and overtime are common. Surgical procedures account for 40-70% of hospital revenues and 30-40% of total costs. Most planning and scheduling in healthcare is done without modern planning tools, which have potential for improving access by assisting in operations planning support. We identified key planning scenarios of interest to perioperative leaders, in order to examine the feasibility of applying combinatorial optimization software solving some of those planning issues in the operative setting. Perioperative leaders desire a broad range of tools for planning and assessing alternate solutions. Our modeled solutions generated feasible solutions that varied as expected, based on resource and policy assumptions and found better utilization of scarce resources. Combinatorial optimization modeling can effectively evaluate alternatives to support key decisions for planning clinical workflow and improving care efficiency and satisfaction.

Daily Profiles of Light Exposure and Evening Use of Light-emitting Devices in Young Adults Complaining of a Delayed Sleep Schedule.

PubMed

Van der Maren, Solenne; Moderie, Christophe; Duclos, Catherine; Paquet, Jean; Daneault, Véronique; Dumont, Marie

2018-04-01

A number of factors can contribute to a delayed sleep schedule. An important factor could be a daily profile of light exposure favoring a later circadian phase. This study aimed to compare light exposure between 14 young adults complaining of a delayed sleep schedule and 14 matched controls and to identify possible associations between habitual light exposure and circadian phase. Exposure to white and blue light was recorded with ambulatory monitors for 7 consecutive days. Participants also noted their daily use of light-emitting devices before bedtime. Endogenous circadian phase was estimated with the dim light melatonin onset (DLMO) in the laboratory. The amplitude of the light-dark cycle to which the subjects were exposed was smaller in delayed than in control subjects, and smaller amplitude was associated with a later DLMO. Smaller amplitude was due to both decreased exposure in the daytime and increased exposure at night. Total exposure to blue light, but not to white light, was lower in delayed subjects, possibly due to lower exposure to blue-rich outdoor light. Lower daily exposure to blue light was associated with a later DLMO. Timing of relative increases and decreases of light exposure in relation to endogenous circadian phase was also compared between the 2 groups. In delayed subjects, there was a relatively higher exposure to white and blue light 2 h after DLMO, a circadian time with maximal phase-delaying effect. Delayed participants also had higher exposure to light 8 to 10 h after DLMO, which occurred mostly during their sleep episode but may have some phase-advancing effects. Self-reported use of light-emitting devices before bedtime was higher in delayed than in control subjects and was associated with a later DLMO. This study suggests that individuals complaining of a delayed sleep schedule engage in light-related behaviors favoring a later circadian phase and a later bedtime.

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.

Anthrax vaccine adsorbed: further evidence supporting continuing the vaccination series rather than restarting the series when doses are delayed.

PubMed

Pittman, Phillip R; Cavicchia, M A; Kingsbury, J L; Johnson, N A; Barrera-Oro, J G; Schmader, T; Korman, L; Quinn, X; Ranadive, M

2014-09-03

Whether to restart or continue the series when anthrax vaccine doses are missed is a frequent medical management problem. We applied the noninferiority analysis model to this prospective study comparing the Bacillus anthracis protective antigen (PA) IgG antibody response and lethal toxin neutralization activity at day 28 to the anthrax vaccine adsorbed (AVA) (Biothrax®) administered on schedule or delayed. A total of 600 volunteers were enrolled: 354 in the on-schedule cohort; 246 in the delayed cohort. Differences were noted in immune responses between cohorts (p<0.0001) and among the racial categories (p<0.0001). Controlling for covariates, the delayed cohort was non-inferior to the on-schedule cohort for the rate of 4-fold rise in both anti-PA IgG concentration (p<0.0001) and TNA ED50 titers (p<0.0001); as well as the mean log10-transformed anti-PA IgG concentration (p<0.0001) and the mean log10-transformed TNA ED50 titers (p<0.0001). Providing a missed AVA dose after a delay as long as 5-7 years, elicits anti-PA IgG antibody and TNA ED50 responses that are robust and non-inferior to the responses observed when the 6-month dose is given on-schedule. These important data suggest it is not necessary to restart the series when doses of the anthrax vaccine are delayed as long as 5 or more years. Published by Elsevier Ltd.

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

DTIC Science & Technology

2016-09-09

prenticeship Scheduling (COVAS), which performs ma- chine learning using human expert demonstration, in conjunction with optimization, to automatically and ef...ficiently produce optimal solutions to challenging real- world scheduling problems. COVAS first learns a policy from human scheduling demonstration via...apprentice- ship learning , then uses this initial solution to provide a tight bound on the value of the optimal solution, thereby substantially

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir Hossein; Goldbert, Alan; Bagasol, Leonard Neil; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it is shown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Rapid Acquisition of Preference in Concurrent Chains: Effects of "d"-Amphetamine on Sensitivity to Reinforcement Delay

ERIC Educational Resources Information Center

Ta, Wei-Min; Pitts, Raymond C.; Hughes, Christine E.; McLean, Anthony P.; Grace, Randolph C.

2008-01-01

The purpose of this study was to examine effects of "d"-amphetamine on choice controlled by reinforcement delay. Eight pigeons responded under a concurrent-chains procedure in which one terminal-link schedule was always fixed- interval 8 s, and the other terminal-link schedule changed from session to session between fixed-interval 4 s and…

A method of operation scheduling based on video transcoding for cluster equipment

NASA Astrophysics Data System (ADS)

Zhou, Haojie; Yan, Chun

2018-04-01

Because of the cluster technology in real-time video transcoding device, the application of facing the massive growth in the number of video assignments and resolution and bit rate of diversity, task scheduling algorithm, and analyze the current mainstream of cluster for real-time video transcoding equipment characteristics of the cluster, combination with the characteristics of the cluster equipment task delay scheduling algorithm is proposed. This algorithm enables the cluster to get better performance in the generation of the job queue and the lower part of the job queue when receiving the operation instruction. In the end, a small real-time video transcode cluster is constructed to analyze the calculation ability, running time, resource occupation and other aspects of various algorithms in operation scheduling. The experimental results show that compared with traditional clustering task scheduling algorithm, task delay scheduling algorithm has more flexible and efficient characteristics.

Efficiency of performing pulmonary procedures in a shared endoscopy unit: procedure time, turnaround time, delays, and procedure waiting time.

PubMed

Verma, Akash; Lee, Mui Yok; Wang, Chunhong; Hussein, Nurmalah B M; Selvi, Kalai; Tee, Augustine

2014-04-01

The purpose of this study was to assess the efficiency of performing pulmonary procedures in the endoscopy unit in a large teaching hospital. A prospective study from May 20 to July 19, 2013, was designed. The main outcome measures were procedure delays and their reasons, duration of procedural steps starting from patient's arrival to endoscopy unit, turnaround time, total case durations, and procedure wait time. A total of 65 procedures were observed. The most common procedure was BAL (61%) followed by TBLB (31%). Overall procedures for 35 (53.8%) of 65 patients were delayed by ≥ 30 minutes, 21/35 (60%) because of "spillover" of the gastrointestinal and surgical cases into the time block of pulmonary procedure. Time elapsed between end of pulmonary procedure and start of the next procedure was ≥ 30 minutes in 8/51 (16%) of cases. In 18/51 (35%) patients there was no next case in the room after completion of the pulmonary procedure. The average idle time of the room after the end of pulmonary procedure and start of next case or end of shift at 5:00 PM if no next case was 58 ± 53 minutes. In 17/51 (33%) patients the room's idle time was >60 minutes. A total of 52.3% of patients had the wait time >2 days and 11% had it ≥ 6 days, reason in 15/21 (71%) being unavailability of the slot. Most pulmonary procedures were delayed due to spillover of the gastrointestinal and surgical cases into the block time allocated to pulmonary procedures. The most common reason for difficulty encountered in scheduling the pulmonary procedure was slot unavailability. This caused increased procedure waiting time. The strategies to reduce procedure delays and turnaround times, along with improved scheduling methods, may have a favorable impact on the volume of procedures performed in the unit thereby optimizing the existing resources.

Design Principles and Algorithms for Air Traffic Arrival Scheduling

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; Itoh, Eri

2014-01-01

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

Algorithm comparison for schedule optimization in MR fingerprinting.

PubMed

Cohen, Ouri; Rosen, Matthew S

2017-09-01

In MR Fingerprinting, the flip angles and repetition times are chosen according to a pseudorandom schedule. In previous work, we have shown that maximizing the discrimination between different tissue types by optimizing the acquisition schedule allows reductions in the number of measurements required. The ideal optimization algorithm for this application remains unknown, however. In this work we examine several different optimization algorithms to determine the one best suited for optimizing MR Fingerprinting acquisition schedules. Copyright © 2017 Elsevier Inc. All rights reserved.

Using Optimization to Improve Test Planning

DTIC Science & Technology

2017-09-01

friendly and to display the output differently, the test and evaluation test schedule optimization model would be a good tool for the test and... evaluation schedulers. 14. SUBJECT TERMS schedule optimization, test planning 15. NUMBER OF PAGES 223 16. PRICE CODE 17. SECURITY CLASSIFICATION OF...make the input more user-friendly and to display the output differently, the test and evaluation test schedule optimization model would be a good tool

Dutch national immunization schedule: compliance and associated characteristics for the primary series.

PubMed

Scheepers, Elsemieke D; van Lier, Alies; Drijfhout, Ingrid H; Berbers, Guy; van der Maas, Nicoline A T; de Melker, Hester E; Knol, Mirjam J

2017-06-01

In the Netherlands, the recommended priming immunization schedule for diphtheria, tetanus, pertussis and polio (DTaP-IPV) is at 2, 3 and 4 months of age. We evaluated the compliance with the recommended schedule, as well as its characteristics. We included all infants born between 2007 and 2012 who received minimally one DTaP-IPV vaccination (n = 1,061,578). Infants complied with the schedule if they received the first vaccination between 6 and 9 weeks of age, and the second and third vaccination 2-6 weeks after the first and second vaccination. We examined associations between compliance and several characteristics using log-binomial regression. Compliance for the first, second and third vaccination was 81.6, 88.3 and 84.2%, respectively. Compliance with the total recommended schedule was 64.5%, and increased from 60.1% for 2007 to 68.5% for 2012. Compliance was higher for full-term infants (65.9%), infants with normal birth weight (66.0%) and when both parents were born in the Netherlands (66.8%). Delayed vaccination during the primary vaccination schedule occurs in one sixth of the Dutch children. Efforts to improve compliance should be focused in particular on preterm infants, infants with low birth weight and infants whose parents are not born in the Netherlands. What is Known: • A delayed start of vaccination leads to a longer period at risk for infectious diseases, e.g. pertussis • Delayed vaccination is associated with several factors including prematurity, low birth weight, family size, birth order, low socioeconomic status and health status of the child What is New: • Compliance with the recommended priming immunization schedule for diphtheria, tetanus, pertussis and polio was 64.5%, and increased from 60.1% for 2007 to 68.5% for 2012 • If the first vaccination was delayed, there was a higher chance that the following vaccinations were administered 'out-of-schedule' as well, resulting in even a higher age at second and third vaccination.

Effects of a Signaled Delay to Reinforcement in the Previous and Upcoming Ratios on Between-Ratio Pausing in Fixed-Ratio Schedules

ERIC Educational Resources Information Center

Harris, Aimee; Foster, T. Mary; Levine, Joshua; Temple, William

2012-01-01

Domestic hens responded under multiple fixed-ratio fixed-ratio schedules with equal fixed ratios. One component provided immediate reinforcement and the other provided reinforcement after a delay, signaled by the offset of the key light. The components were presented quasi-randomly so that all four possible transitions occurred in each session.…

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…

Alternative Outpatient Chemotherapy Scheduling Method to Improve Patient Service Quality and Nurse Satisfaction.

PubMed

Huang, Yu-Li; Bryce, Alan H; Culbertson, Tracy; Connor, Sarah L; Looker, Sherry A; Altman, Kristin M; Collins, James G; Stellner, Winston; McWilliams, Robert R; Moreno-Aspitia, Alvaro; Ailawadhi, Sikander; Mesa, Ruben A

2018-02-01

Optimal scheduling and calendar management in an outpatient chemotherapy unit is a complex process that is driven by a need to focus on safety while accommodating a high degree of variability. Primary constraints are infusion times, staffing resources, chair availability, and unit hours. We undertook a process to analyze our existing management models across multiple practice settings in our health care system, then developed a model to optimize safety and efficiency. The model was tested in one of the community chemotherapy units. We assessed staffing violations as measured by nurse-to-patient ratios throughout the workday and at key points during treatment. Staffing violations were tracked before and after the implementation of the new model. The new model reduced staffing violations by nearly 50% and required fewer chairs to treat the same number of patients for the selected clinic day. Actual implementation results indicated that the new model leveled the distribution of patients across the workday with an 18% reduction in maximum chair utilization and a 27% reduction in staffing violations. Subsequently, a positive impact on peak pharmacy workload reduced delays by as much as 35 minutes. Nursing staff satisfaction with the new model was positive. We conclude that the proposed optimization approach with regard to nursing resource assignment and workload balance throughout a day effectively improves patient service quality and staff satisfaction.

Optimal radiotherapy dose schedules under parametric uncertainty

NASA Astrophysics Data System (ADS)

Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

2016-01-01

We consider the effects of parameter uncertainty on the optimal radiation schedule in the context of the linear-quadratic model. Our interest arises from the observation that if inter-patient variability in normal and tumor tissue radiosensitivity or sparing factor of the organs-at-risk (OAR) are not accounted for during radiation scheduling, the performance of the therapy may be strongly degraded or the OAR may receive a substantially larger dose than the allowable threshold. This paper proposes a stochastic radiation scheduling concept to incorporate inter-patient variability into the scheduling optimization problem. Our method is based on a probabilistic approach, where the model parameters are given by a set of random variables. Our probabilistic formulation ensures that our constraints are satisfied with a given probability, and that our objective function achieves a desired level with a stated probability. We used a variable transformation to reduce the resulting optimization problem to two dimensions. We showed that the optimal solution lies on the boundary of the feasible region and we implemented a branch and bound algorithm to find the global optimal solution. We demonstrated how the configuration of optimal schedules in the presence of uncertainty compares to optimal schedules in the absence of uncertainty (conventional schedule). We observed that in order to protect against the possibility of the model parameters falling into a region where the conventional schedule is no longer feasible, it is required to avoid extremal solutions, i.e. a single large dose or very large total dose delivered over a long period. Finally, we performed numerical experiments in the setting of head and neck tumors including several normal tissues to reveal the effect of parameter uncertainty on optimal schedules and to evaluate the sensitivity of the solutions to the choice of key model parameters.

A Method for Forecasting the Commercial Air Traffic Schedule in the Future

NASA Technical Reports Server (NTRS)

Long, Dou; Lee, David; Gaier, Eric; Johnson, Jesse; Kostiuk, Peter

1999-01-01

This report presents an integrated set of models that forecasts air carriers' future operations when delays due to limited terminal-area capacity are considered. This report models the industry as a whole, avoiding unnecessary details of competition among the carriers. To develop the schedule outputs, we first present a model to forecast the unconstrained flight schedules in the future, based on the assumption of rational behavior of the carriers. Then we develop a method to modify the unconstrained schedules, accounting for effects of congestion due to limited NAS capacities. Our underlying assumption is that carriers will modify their operations to keep mean delays within certain limits. We estimate values for those limits from changes in planned block times reflected in the OAG. Our method for modifying schedules takes many means of reducing the delays into considerations, albeit some of them indirectly. The direct actions include depeaking, operating in off-hours, and reducing hub airports'operations. Indirect actions include using secondary airports, using larger aircraft, and selecting new hub airports, which, we assume, have already been modeled in the FAA's TAF. Users of our suite of models can substitute an alternative forecast for the TAF.

Systemic delay propagation in the US airport network

PubMed Central

Fleurquin, Pablo; Ramasco, José J.; Eguiluz, Victor M.

2013-01-01

Technologically driven transport systems are characterized by a networked structure connecting operation centers and by a dynamics ruled by pre-established schedules. Schedules impose serious constraints on the timing of the operations, condition the allocation of resources and define a baseline to assess system performance. Here we study the performance of an air transportation system in terms of delays. Technical, operational or meteorological issues affecting some flights give rise to primary delays. When operations continue, such delays can propagate, magnify and eventually involve a significant part of the network. We define metrics able to quantify the level of network congestion and introduce a model that reproduces the delay propagation patterns observed in the U.S. performance data. Our results indicate that there is a non-negligible risk of systemic instability even under normal operating conditions. We also identify passenger and crew connectivity as the most relevant internal factor contributing to delay spreading. PMID:23362459

Leveraging Hypoxia-Activated Prodrugs to Prevent Drug Resistance in Solid Tumors.

PubMed

Lindsay, Danika; Garvey, Colleen M; Mumenthaler, Shannon M; Foo, Jasmine

2016-08-01

Experimental studies have shown that one key factor in driving the emergence of drug resistance in solid tumors is tumor hypoxia, which leads to the formation of localized environmental niches where drug-resistant cell populations can evolve and survive. Hypoxia-activated prodrugs (HAPs) are compounds designed to penetrate to hypoxic regions of a tumor and release cytotoxic or cytostatic agents; several of these HAPs are currently in clinical trial. However, preliminary results have not shown a survival benefit in several of these trials. We hypothesize that the efficacy of treatments involving these prodrugs depends heavily on identifying the correct treatment schedule, and that mathematical modeling can be used to help design potential therapeutic strategies combining HAPs with standard therapies to achieve long-term tumor control or eradication. We develop this framework in the specific context of EGFR-driven non-small cell lung cancer, which is commonly treated with the tyrosine kinase inhibitor erlotinib. We develop a stochastic mathematical model, parametrized using clinical and experimental data, to explore a spectrum of treatment regimens combining a HAP, evofosfamide, with erlotinib. We design combination toxicity constraint models and optimize treatment strategies over the space of tolerated schedules to identify specific combination schedules that lead to optimal tumor control. We find that (i) combining these therapies delays resistance longer than any monotherapy schedule with either evofosfamide or erlotinib alone, (ii) sequentially alternating single doses of each drug leads to minimal tumor burden and maximal reduction in probability of developing resistance, and (iii) strategies minimizing the length of time after an evofosfamide dose and before erlotinib confer further benefits in reduction of tumor burden. These results provide insights into how hypoxia-activated prodrugs may be used to enhance therapeutic effectiveness in the clinic.

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.

Application of modern control theory to scheduling and path-stretching maneuvers of aircraft in the near terminal area

NASA Technical Reports Server (NTRS)

Athans, M.

1974-01-01

A design concept of the dynamic control of aircraft in the near terminal area is discussed. An arbitrary set of nominal air routes, with possible multiple merging points, all leading to a single runway, is considered. The system allows for the automated determination of acceleration/deceleration of aircraft along the nominal air routes, as well as for the automated determination of path-stretching delay maneuvers. In addition to normal operating conditions, the system accommodates: (1) variable commanded separations over the outer marker to allow for takeoffs and between successive landings and (2) emergency conditions under which aircraft in distress have priority. The system design is based on a combination of three distinct optimal control problems involving a standard linear-quadratic problem, a parameter optimization problem, and a minimum-time rendezvous problem.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James L.

2010-01-01

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Memory-Based Structured Application Specific Integrated Circuit (ASIC) Study

DTIC Science & Technology

2008-10-01

memory interface, arbiter/ schedulers for rescheduling the memory requests according to some schedule policy, and memory channels for communicating...between the power-savings and the wakeup overhead with respect to both wakeup power and wakeup delay. For example, dream mode can save 50% more static...power than sleep mode, but at the expense of twice the wake delay and three times the wakeup energy. The user can specify power-gating modes for various components.

Shuttle Rocket Motor Program: NASA should delay awarding some construction contracts. Report to the Chair, Subcommittee on Government Activities and Transportation, Committee on Government Operations, House of Representatives

NASA Technical Reports Server (NTRS)

1992-01-01

Even though the executive branch has proposed terminating the Advanced Solid Rocket Motor (ASRM) program, NASA is proceeding with all construction activity planned for FY 1992 to avoid schedule slippage if the program is reinstated by Congress. However, NASA could delay some construction activities for at least a few months without affecting the current launch data schedule. For example, NASA could delay Yellow Creek's motor storage and dock projects, Stennis' dock project, and Kennedy's rotation processing and surge facility and dock projects. Starting all construction activities as originally planned could result in unnecessarily incurring additional costs and termination liability if the funding for FY 1993 is not provided. If Congress decides to continue the program, construction could still be completed in time to avoid schedule slippage.

A Novel Component Carrier Configuration and Switching Scheme for Real-Time Traffic in a Cognitive-Radio-Based Spectrum Aggregation System

PubMed Central

Fu, Yunhai; Ma, Lin; Xu, Yubin

2015-01-01

In spectrum aggregation (SA), two or more component carriers (CCs) of different bandwidths in different bands can be aggregated to support a wider transmission bandwidth. The scheduling delay is the most important design constraint for the broadband wireless trunking (BWT) system, especially in the cognitive radio (CR) condition. The current resource scheduling schemes for spectrum aggregation become questionable and are not suitable for meeting the challenge of the delay requirement. Consequently, the authors propose a novel component carrier configuration and switching scheme for real-time traffic (RT-CCCS) to satisfy the delay requirement in the CR-based SA system. In this work, the authors consider a sensor-network-assisted CR network. The authors first introduce a resource scheduling structure for SA in the CR condition. Then the proposed scheme is analyzed in detail. Finally, simulations are carried out to verify the analysis on the proposed scheme. Simulation results prove that our proposed scheme can satisfy the delay requirement in the CR-based SA system. PMID:26393594

Preference for a stimulus that follows a relatively aversive event: contrast or delay reduction?

PubMed

Singer, Rebecca A; Berry, Laura M; Zentall, Thomas R

2007-03-01

Several types of contrast effects have been identified including incentive contrast, anticipatory contrast, and behavioral contrast. Clement, Feltus, Kaiser, and Zentall (2000) proposed a type of contrast that appears to be different from these others and called it within-trial contrast. In this form of contrast the relative value of a reinforcer depends on the events that occur immediately prior to the reinforcer. Reinforcers that follow relatively aversive events are preferred over those that follow less aversive events. In many cases the delay reduction hypothesis proposed by Fantino (1969) also can account for such effects. The current experiments provide a direct test of the delay reduction and contrast hypotheses by manipulating the schedule of reinforcement while holding trial duration constant. In Experiment 1, preference for fixed-interval (FI) versus differential-reinforcement-of-other-behavior (DRO) schedules of reinforcement was assessed. Some pigeons preferred one schedule over the other while others demonstrated a position (side) preference. Thus, no systematic preference was found. In Experiment 2, a simultaneous color discrimination followed the FI or DRO schedule, and following training, preference was assessed by presenting the two positive stimuli simultaneously. Consistent with the contrast hypothesis, pigeons showed a significant preference for the positive stimulus that in training had followed their less preferred schedule.

Incidence and root causes of delays in emergency orthopaedic procedures: a single-centre experience of 36,017 consecutive cases over seven years.

PubMed

Caesar, Ulla; Karlsson, Jon; Hansson, Elisabeth

2018-01-01

Emergency surgery is unplanned by definition and patients are scheduled for surgery with minimal preparation. Some patients who have sustained emergency orthopaedic trauma or other conditions must be operated on immediately or within a few hours, while others can wait until the hospital's resources permit and/or the patients' health status has been optimised as needed. This may affect the prioritisation procedures for both emergency and elective surgery and might result in waiting lists, not only for planned procedures but also for emergencies. The main purpose of this retrospective, observational, single-centre study was to evaluate and describe for the number and reasons of delays, as well as waiting times in emergency orthopaedic surgery using data derived from the hospital's records and registers. All the emergency patients scheduled for emergency surgery whose procedures were rescheduled and delayed between 1 January 2007 and 31 December 2013 were studied. We found that 24% (8474) of the 36,017 patients scheduled for emergency surgeries were delayed and rescheduled at least once, some several times. Eighty per cent of these delays were due to organisational causes. Twenty-one per cent of all the delayed patients had surgery within 24 h, whilst 41% waited for more than 24 h, up to 3 days. A large number of the clinic's emergency orthopaedic procedures were rescheduled and delayed and the majority of the delays were related to organisational reasons. The results can be interpreted in two ways; first, organisational reasons are avoidable and the potential for improvement is great and, secondly and most importantly, the delays might negatively affect patient outcomes.

Critical Path Method Networks and Their Use in Claims Analysis.

DTIC Science & Technology

1984-01-01

produced will only be as good as the time invested and the knowledge of the scheduler. A schedule which is based on faulty logic or which contains... fundementals of putting a schedule together but also *how the construction process functions so that the delays can be accurately inserted. When

48 CFR 1352.271-73 - Schedule of work.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Manpower Loading Curve. (4) Trade Manning Curves. (5) Subcontracting List. (b) The Production Schedule... events, and activities and shall clearly identify the critical path. The Total Manpower Loading Curve... deviation in the Production Schedule which results in a delay in the completion of work on a vessel past the...

48 CFR 1352.271-73 - Schedule of work.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Manpower Loading Curve. (4) Trade Manning Curves. (5) Subcontracting List. (b) The Production Schedule... events, and activities and shall clearly identify the critical path. The Total Manpower Loading Curve... deviation in the Production Schedule which results in a delay in the completion of work on a vessel past the...

48 CFR 1352.271-73 - Schedule of work.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Manpower Loading Curve. (4) Trade Manning Curves. (5) Subcontracting List. (b) The Production Schedule... events, and activities and shall clearly identify the critical path. The Total Manpower Loading Curve... deviation in the Production Schedule which results in a delay in the completion of work on a vessel past the...

48 CFR 1352.271-73 - Schedule of work.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Manpower Loading Curve. (4) Trade Manning Curves. (5) Subcontracting List. (b) The Production Schedule... events, and activities and shall clearly identify the critical path. The Total Manpower Loading Curve... deviation in the Production Schedule which results in a delay in the completion of work on a vessel past the...

48 CFR 1352.271-73 - Schedule of work.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Manpower Loading Curve. (4) Trade Manning Curves. (5) Subcontracting List. (b) The Production Schedule... events, and activities and shall clearly identify the critical path. The Total Manpower Loading Curve... deviation in the Production Schedule which results in a delay in the completion of work on a vessel past the...

Separation Assurance and Scheduling Coordination in the Arrival Environment

NASA Technical Reports Server (NTRS)

Aweiss, Arwa S.; Cone, Andrew C.; Holladay, Joshua J.; Munoz, Epifanio; Lewis, Timothy A.

2016-01-01

Separation assurance (SA) automation has been proposed as either a ground-based or airborne paradigm. The arrival environment is complex because aircraft are being sequenced and spaced to the arrival fix. This paper examines the effect of the allocation of the SA and scheduling functions on the performance of the system. Two coordination configurations between an SA and an arrival management system are tested using both ground and airborne implementations. All configurations have a conflict detection and resolution (CD&R) system and either an integrated or separated scheduler. Performance metrics are presented for the ground and airborne systems based on arrival traffic headed to Dallas/ Fort Worth International airport. The total delay, time-spacing conformance, and schedule conformance are used to measure efficiency. The goal of the analysis is to use the metrics to identify performance differences between the configurations that are based on different function allocations. A surveillance range limitation of 100 nmi and a time delay for sharing updated trajectory intent of 30 seconds were implemented for the airborne system. Overall, these results indicate that the surveillance range and the sharing of trajectories and aircraft schedules are important factors in determining the efficiency of an airborne arrival management system. These parameters are not relevant to the ground-based system as modeled for this study because it has instantaneous access to all aircraft trajectories and intent. Creating a schedule external to the CD&R and the scheduling conformance system was seen to reduce total delays for the airborne system, and had a minor effect on the ground-based system. The effect of an external scheduler on other metrics was mixed.

A Novel Particle Swarm Optimization Approach for Grid Job Scheduling

NASA Astrophysics Data System (ADS)

Izakian, Hesam; Tork Ladani, Behrouz; Zamanifar, Kamran; Abraham, Ajith

This paper represents a Particle Swarm Optimization (PSO) algorithm, for grid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper we used a PSO approach for grid job scheduling. The scheduler aims at minimizing makespan and flowtime simultaneously. Experimental studies show that the proposed novel approach is more efficient than the PSO approach reported in the literature.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James

2014-01-01

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

A low delay transmission method of multi-channel video based on FPGA

NASA Astrophysics Data System (ADS)

Fu, Weijian; Wei, Baozhi; Li, Xiaobin; Wang, Quan; Hu, Xiaofei

2018-03-01

In order to guarantee the fluency of multi-channel video transmission in video monitoring scenarios, we designed a kind of video format conversion method based on FPGA and its DMA scheduling for video data, reduces the overall video transmission delay.In order to sace the time in the conversion process, the parallel ability of FPGA is used to video format conversion. In order to improve the direct memory access (DMA) writing transmission rate of PCIe bus, a DMA scheduling method based on asynchronous command buffer is proposed. The experimental results show that this paper designs a low delay transmission method based on FPGA, which increases the DMA writing transmission rate by 34% compared with the existing method, and then the video overall delay is reduced to 23.6ms.

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System.

PubMed

Duan, Litian; Wang, Zizhong John; Duan, Fu

2016-11-16

In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range.

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System

PubMed Central

Duan, Litian; Wang, Zizhong John; Duan, Fu

2016-01-01

In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range. PMID:27854342

Palonosetron as an anti-emetic and anti-nausea agent in oncology.

PubMed

Aapro, Matti S

2007-12-01

Palonosetron (Aloxi(®), Onicit(®), Paloxi(®)) is a second-generation 5-HT(3) receptor antagonist (RA) with an extended half-life of ~40 hours and high binding affinity for the 5-HT₃ receptor that is markedly different from other 5-HT(3) RAs. Phase III trials demonstrate that a single dose of palonosetron compared with traditional 5-HT₃ RAs is more effective in preventing chemotherapy-induced nausea and vomiting (CINV) during the first 24 hours following chemotherapy (acute CINV), and also exhibits prolonged efficacy to provide significantly better protection from CINV in the delayed and overall phases. This superior and extended protection from CINV conferred by palonosetron following a single intravenous dose before chemotherapy simplifies dosing schedules. Recent research has focused on optimization of palonosetron-based antiemetic regimens, particularly in combination with steroids and neurokinin-1 RAs. The available clinical data indicate high control rates for palonosetron, suggesting a synergistic potential for protection in patients scheduled to receive emetogenic drug regimens.

Audit of the Functioning of the Elective Neurosurgical Operation Theater in India: A Prospective Study and Review of Literature.

PubMed

Saikia, Amrit Kumar; Sriganesh, Kamath; Ranjan, Manish; Claire, Marie; Mittal, Mohit; Pandey, Paritosh

2015-08-01

Knowledge about the utilization of the operation theater (OT) is essential to improve its efficiency. This study evaluated the neurosurgical operation theater utilization in a neurosciences teaching hospital. Data collected included OT start time, delay in start, anesthesia induction time, surgical preparation time, anesthesia recovery time, operating time, time between cases, and theater closing time. Five hundred thirty-seven surgeries were performed during the study period. The percentage of time used for anesthesia induction, actual surgical procedure, recovery from anesthesia, and theater preparation between the two cases were 8%, 70%, 6% and 5%, respectively. Fourteen percent of scheduled cases were cancelled. On 220 occasions (70.51%), theater was over-run. Late start contributed to loss of 8370 minutes (140 hours) of theater time. This study identified the proportion of time spent on each activity in the neurosurgical OT. This knowledge is likely to facilitate better planning of neurosurgical theater schedule and result in optimal utilization. Copyright © 2015 Elsevier Inc. All rights reserved.

A Fast-Time Simulation Tool for Analysis of Airport Arrival Traffic

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; Meyn, Larry A.; Neuman, Frank

2004-01-01

The basic objective of arrival sequencing in air traffic control automation is to match traffic demand and airport capacity while minimizing delays. The performance of an automated arrival scheduling system, such as the Traffic Management Advisor developed by NASA for the FAA, can be studied by a fast-time simulation that does not involve running expensive and time-consuming real-time simulations. The fast-time simulation models runway configurations, the characteristics of arrival traffic, deviations from predicted arrival times, as well as the arrival sequencing and scheduling algorithm. This report reviews the development of the fast-time simulation method used originally by NASA in the design of the sequencing and scheduling algorithm for the Traffic Management Advisor. The utility of this method of simulation is demonstrated by examining the effect on delays of altering arrival schedules at a hub airport.

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

PubMed

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

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

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

PubMed Central

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

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

Networking for large-scale science: infrastructure, provisioning, transport and application mapping

NASA Astrophysics Data System (ADS)

Rao, Nageswara S.; Carter, Steven M.; Wu, Qishi; Wing, William R.; Zhu, Mengxia; Mezzacappa, Anthony; Veeraraghavan, Malathi; Blondin, John M.

2005-01-01

Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

PubMed

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

PubMed Central

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-01

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR. PMID:26742046

An Optimal Static Scheduling Algorithm for Hard Real-Time Systems Specified in a Prototyping Language

DTIC Science & Technology

1989-12-01

to construct because the mechanism is a dispatching procedure. Since all nonpreemptive schedules are contained in the set of all preemptive schedules...the optimal value of T’.. in the preemptive case is at least a lower bound on the optimal T., for the nonpreemptive schedules. This principle is the...adapt to changes in the enviro.nment. In hard real-time systems, tasks are also distinguished as preemptable and nonpreemptable . A task is preemptable

Particle swarm optimization based space debris surveillance network scheduling

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

Response-food delay gradients for lever pressing and schedule-induced licking in rats.

PubMed

Pellón, Ricardo; Pérez-Padilla, Angeles

2013-06-01

Eight food-deprived Wistar rats developed stable patterns of lever pressing and licking when exposed to a fixed-time 30-s schedule of food pellet presentation. The rats were trained to lever press by presenting the lever 10 s before the programmed food delivery, with the food pellet being delivered immediately upon a lever press. The operant contingency was then removed and the lever was inserted through the entire interfood interval, being withdrawn with food delivery and reinserted 2 s later. On successive phases of the study, a protective contingency postponed food delivery if responses (lever presses or licks) occurred within the last 1, 2, 5, 10, 20, or 25 s of the interfood interval. Lever pressing was reduced at much shorter response-food delays than those that reduced licking. These results demonstrate that reinforcement contributes to the maintenance of different response patterns on periodic schedules, and that different responses are differentially sensitive to delays.

Fast Missile Boat Project Planning using CPM and What If Analysis Method

NASA Astrophysics Data System (ADS)

Silvianita; Firmansyah, R.; Rosyid, D. M.; Suntoyo; Chamelia, D. M.

2018-03-01

This paper discusses analysis of fast ship missile project planning with CPM and What If analysis.The poor performance can cause project delay and cost overruns, these two things often occur in a project management. Scheduling has an important role to control the project. Good scheduling is required because it will affect the product quality. Scheduling is useful to manage the activities so that the project completion time can be as short as possible and it is used to determine the costs of the project are in optimum condition. The alternatives that can be used to overcome the delay project namely increasing labor and equipment.Project planning can be done to determine whether the project is already in an optimum condition. Alternatives that can be used to overcome the delay in the project is to increase labor and equipment, the next is to look for the optimum solution taking into account the duration and gain of each alternative.

Monte Carlo Simulations for VLBI2010

NASA Astrophysics Data System (ADS)

Wresnik, J.; Böhm, J.; Schuh, H.

2007-07-01

Monte Carlo simulations are carried out at the Institute of Geodesy and Geophysics (IGG), Vienna, and at Goddard Space Flight Center (GSFC), Greenbelt (USA), with the goal to design a new geodetic Very Long Baseline Interferometry (VLBI) system. Influences of the schedule, the network geometry and the main stochastic processes on the geodetic results are investigated. Therefore schedules are prepared with the software package SKED (Vandenberg 1999), and different strategies are applied to produce temporally very dense schedules which are compared in terms of baseline length repeatabilities. For the simulation of VLBI observations a Monte Carlo Simulator was set up which creates artificial observations by randomly simulating wet zenith delay and clock values as well as additive white noise representing the antenna errors. For the simulation at IGG the VLBI analysis software OCCAM (Titov et al. 2004) was adapted. Random walk processes with power spectrum densities of 0.7 and 0.1 psec2/sec are used for the simulation of wet zenith delays. The clocks are simulated with Allan Standard Deviations of 1*10^-14 @ 50 min and 2*10^-15 @ 15 min and three levels of white noise, 4 psec, 8 psec and, 16 psec, are added to the artificial observations. The variations of the power spectrum densities of the clocks and wet zenith delays, and the application of different white noise levels show clearly that the wet delay is the critical factor for the improvement of the geodetic VLBI system. At GSFC the software CalcSolve is used for the VLBI analysis, therefore a comparison between the software packages OCCAM and CalcSolve was done with simulated data. For further simulations the wet zenith delay was modeled by a turbulence model. This data was provided by Nilsson T. and was added to the simulation work. Different schedules have been run.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

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

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.

Hypogonadism and Sex Steroid Replacement Therapy in Girls with Turner Syndrome.

PubMed

Gawlik, Aneta; Hankus, Magdalena; Such, Kamila; Drosdzol-Cop, Agnieszka; Madej, Paweł; Borkowska, Marzena; Zachurzok, Agnieszka; Malecka-Tendera, Ewa

2016-12-01

Turner syndrome is the most common example of hypergonadotropic hypogonadism resulting from gonadal dysgenesis. Most patients present delayed, or even absent, puberty. Premature ovarian failure can be expected even if spontaneous menarche occurs. Laboratory markers of gonadal dysgenesis are well known. The choice of optimal hormone replacement therapy in children and adolescents remains controversial, particularly regarding the age at which therapy should be initiated, and the dose and route of estrogen administration. On the basis of a review of the literature, we present the most acceptable schedule of sex steroid replacement therapy in younger patients with Turner syndrome. Copyright © 2016 North American Society for Pediatric and Adolescent Gynecology. Published by Elsevier Inc. All rights reserved.

Performance comparison of some evolutionary algorithms on job shop scheduling problems

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

Air Traffic Control: Economics of Flight

NASA Technical Reports Server (NTRS)

Murphy, James R.

2004-01-01

Contents include the following: 1. Commercial flight is a partnership. Airlines. Pilots. Air traffic control. 2. Airline schedules and weather problems can cause delays at the airport. Delays are inevitable in de-regulated industry due to simple economics. 3.Delays can be mitigated. Build more runways/technology. Increase airspace supply. 4. Cost/benefit analysis determine justification.

48 CFR 752.7002 - Travel and transportation.

Code of Federal Regulations, 2014 CFR

2014-10-01

... required by scheduled commercial air carrier using the most expeditious route. One stopover en route for a... time at post. (h) Delays en route. The Contractor may grant to travelers under this contract reasonable delays en route while in travel status when such delays are caused by events beyond the control of such...

Design of an Aircrew Scheduling Decision Aid for the 6916th Electronic Security Squadron.

DTIC Science & Technology

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

Evolution of resistance to anti-cancer therapy during general dosing schedules

PubMed Central

Foo, Jasmine; Michor, Franziska

2009-01-01

Anti-cancer drugs targeted to specific oncogenic pathways have shown promising therapeutic results in the past few years; however, drug resistance remains an important obstacle for these therapies. Resistance to these drugs can emerge due to a variety of reasons including genetic or epigenetic changes which alter the binding site of the drug target, cellular metabolism or export mechanisms. Obtaining a better understanding of the evolution of resistant populations during therapy may enable the design of more effective therapeutic regimens which prevent or delay progression of disease due to resistance. In this paper, we use stochastic mathematical models to study the evolutionary dynamics of resistance under time-varying dosing schedules and pharmacokinetic effects. The populations of sensitive and resistant cells are modeled as multi-type non-homogeneous birth-death processes in which the drug concentration affects the birth and death rates of both the sensitive and resistant cell populations in continuous time. This flexible model allows us to consider the effects of generalized treatment strategies as well as detailed pharmacokinetic phenomena such as drug elimination and accumulation over multiple doses. We develop estimates for the probability of developing resistance and moments of the size of the resistant cell population. With these estimates, we optimize treatment schedules over a subspace of tolerated schedules to minimize the risk of disease progression due to resistance as well as locate ideal schedules for controlling the population size of resistant clones in situations where resistance is inevitable. Our methodology can be used to describe dynamics of resistance arising due to a single (epi)genetic alteration in any tumor type. PMID:20004211

Numerical solution of a conspicuous consumption model with constant control delay☆

PubMed Central

Huschto, Tony; Feichtinger, Gustav; Hartl, Richard F.; Kort, Peter M.; Sager, Sebastian; Seidl, Andrea

2011-01-01

We derive optimal pricing strategies for conspicuous consumption products in periods of recession. To that end, we formulate and investigate a two-stage economic optimal control problem that takes uncertainty of the recession period length and delay effects of the pricing strategy into account. This non-standard optimal control problem is difficult to solve analytically, and solutions depend on the variable model parameters. Therefore, we use a numerical result-driven approach. We propose a structure-exploiting direct method for optimal control to solve this challenging optimization problem. In particular, we discretize the uncertainties in the model formulation by using scenario trees and target the control delays by introduction of slack control functions. Numerical results illustrate the validity of our approach and show the impact of uncertainties and delay effects on optimal economic strategies. During the recession, delayed optimal prices are higher than the non-delayed ones. In the normal economic period, however, this effect is reversed and optimal prices with a delayed impact are smaller compared to the non-delayed case. PMID:22267871

Schedule-induced polydipsia in the spontaneously hypertensive rat and its relation to impulsive behaviour.

PubMed

Ibias, Javier; Pellón, Ricardo

2011-09-30

Eight Spontaneously Hypertensive Rat (SHR), 8 Wistar-Kyoto (WKY) and 8 Wistar rats, all male, maintained at 80-85% of their free-feeding weight by controlled access to food, were exposed to a series of fixed time (FT) schedules whereby food pellets were regularly delivered regardless of the animals' behaviour. The FT values used were 9, 15, 30, 60, 120 and 180 s, with the order of presentation of the schedules among the animals being counterbalanced (except under the FT 120-s and 180-s schedules, which were successively presented as the last two of the series). Due to freely available access to water, the animals developed schedule-induced drinking under all FT schedules, marked by the characteristic bitonic function that relates the number of licks and amount of water drunk to the length of the inter-food interval. Wistar and WKY rats displayed maximum drinking under an FT 15-s schedule, with WKY rats registering lower quantities across all FT values. Among SHR rats, maximum schedule-induced polydipsia was observed under the FT 30-s schedule, with a rightward shift in the bitonic function compared to controls. For long FT values, the temporal distribution of licks within inter-food intervals was shifted slightly towards the right in the SHR rats. In a subsequent study, only the SHR and Wistar rats were used, and the animals were exposed to a delay-discounting procedure. The rats were faced with successive choices, in which they could choose between an immediate reward of one food pellet and another of four food pellets at a delay of 3, 6, 12 or 24s. In the case of the longer delays, SHR rats chose the immediate reward of lower magnitude more often than did their Wistar counterparts, and also committed a greater number of omissions during the forced-choice trials of the procedure. The results indicate that differences in schedule-induced polydipsia are related to indexes of cognitive rather than motor impulsivity, a finding in line with the theoretical idea that adjunctive behaviour is linked to operant reinforcement processes. Copyright © 2011 Elsevier B.V. All rights reserved.

The Value of Weather Forecast in Irrigation

NASA Astrophysics Data System (ADS)

Cai, X.; Wang, D.

2007-12-01

This paper studies irrigation scheduling (when and how much water to apply during the crop growth season) in the Havana Lowlands region, Illinois, using meteorological, agronomic and agricultural production data from 2002. Irrigation scheduling determines the timing and amount of water applied to an irrigated cropland during the crop growing season. In this study a hydrologic-agronomic simulation is coupled with an optimization algorithm to search for the optimal irrigation schedule under various weather forecast horizons. The economic profit of irrigated corn from an optimized scheduling is compared to that from and the actual schedule, which is adopted from a pervious study. Extended and reliable climate prediction and weather forecast are found to be significantly valuable. If a weather forecast horizon is long enough to include the critical crop growth stage, in which crop yield bears the maximum loss over all stages, much economic loss can be avoided. Climate predictions of one to two months, which can cover the critical period, might be even more beneficial during a dry year. The other purpose of this paper is to analyze farmers' behavior in irrigation scheduling by comparing the "actual" schedule to the "optimized" ones. The ultimate goal of irrigation schedule optimization is to provide information to farmers so that they may modify their behavior. In practice, farmers' decision may not follow an optimal irrigation schedule due to the impact of various factors such as natural conditions, policies, farmers' habits and empirical knowledge, and the uncertain or inexact information that they receive. In this study farmers' behavior in irrigation decision making is analyzed by comparing the "actual" schedule to the "optimized" ones. This study finds that the identification of the crop growth stage with the most severe water stress is critical for irrigation scheduling. For the case study site in the year of 2002, framers' response to water stress was found to be late; they did not even respond appropriately to a major rainfall just 3 days ahead, which might be due to either an unreliable weather forecast or farmer's ignorance of the forecast.

Effects of the NMDA receptor antagonists dizocilpine and Ro 63-1908 on delay-discounting and risky decision-making in a gambling task.

PubMed

Higgins, Guy A; Silenieks, Leo B; MacMillan, Cam; Zeeb, Fiona D; Thevarkunnel, Sandy

2018-04-22

Previous studies demonstrated that NMDA receptor antagonists such as dizocilpine (MK801) and the GluN2B NMDA antagonist Ro 63-1908 promote impulsive action (motor impulsivity). The effects of these treatments on impulsive choice and decision-making is less well characterized. Two experiments were undertaken. In the first experiment, given evidence for delay order as a factor in choice selection, the effect of dizocilpine was examined in a delay discounting task with separate groups of male Long-Evans rats trained to a schedule of either ascending (i.e. 0-40 s), or descending delays (i.e. 40-0 s). Under the ascending-delay schedule, dizocilpine (0.03-0.06 mg/kg SC) reduced discounting, yet on the descending-delay schedule discounting was increased. Subgrouping rats according to discounting rate under vehicle pretreatment were consistent with a treatment-induced choice perseveration. In a second experiment, male Long-Evans rats were trained to a gambling task (rGT). Neither dizocilpine (0.01-0.06 mg/kg SC) nor Ro 63-1908 (0.1-1 mg/kg SC) shifted choice from the advantageous to the disadvantageous options. However dizocilpine, and marginally Ro 63-1908, increased choice of the least risky, but suboptimal option. This effect was most evident in rats that initially preferred the disadvantageous options. Consistent with previous studies, both treatments increased measures of motor impulsivity. These results demonstrate that dizocilpine has effects on discounting dependent on delay order and likely reflective of perseveration. On the rGT task, neither dizocilpine nor Ro 63-1908 promoted risky choice, yet both NMDA receptor antagonists increased impulsive action. Copyright © 2018 Elsevier B.V. All rights reserved.

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

NASA Astrophysics Data System (ADS)

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

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

Sensibility study in a flexible job shop scheduling problem

NASA Astrophysics Data System (ADS)

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

2013-10-01

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

Chip-set for quality of service support in passive optical networks

NASA Astrophysics Data System (ADS)

Ringoot, Edwin; Hoebeke, Rudy; Slabbinck, B. Hans; Verhaert, Michel

1998-10-01

In this paper the design of a chip-set for QoS provisioning in ATM-based Passive Optical Networks is discussed. The implementation of a general-purpose switch chip on the Optical Network Unit is presented, with focus on the design of the cell scheduling and buffer management logic. The cell scheduling logic supports `colored' grants, priority jumping and weighted round-robin scheduling. The switch chip offers powerful buffer management capabilities enabling the efficient support of GFR and UBR services. Multicast forwarding is also supported. In addition, the architecture of a MAC controller chip developed for a SuperPON access network is introduced. In particular, the permit scheduling logic and its implementation on the Optical Line Termination will be discussed. The chip-set enables the efficient support of services with different service requirements on the SuperPON. The permit scheduling logic built into the MAC controller chip in combination with the cell scheduling and buffer management capabilities of the switch chip can be used by network operators to offer guaranteed service performance to delay sensitive services, and to efficiently and fairly distribute any spare capacity to delay insensitive services.

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

NASA Technical Reports Server (NTRS)

Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.

2012-01-01

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

Framework for computationally efficient optimal irrigation scheduling using ant colony optimization

USDA-ARS?s Scientific Manuscript database

A general optimization framework is introduced with the overall goal of reducing search space size and increasing the computational efficiency of evolutionary algorithm application for optimal irrigation scheduling. The framework achieves this goal by representing the problem in the form of a decisi...

Research on crude oil storage and transportation based on optimization algorithm

NASA Astrophysics Data System (ADS)

Yuan, Xuhua

2018-04-01

At present, the optimization theory and method have been widely used in the optimization scheduling and optimal operation scheme of complex production systems. Based on C++Builder 6 program development platform, the theoretical research results are implemented by computer. The simulation and intelligent decision system of crude oil storage and transportation inventory scheduling are designed. The system includes modules of project management, data management, graphics processing, simulation of oil depot operation scheme. It can realize the optimization of the scheduling scheme of crude oil storage and transportation system. A multi-point temperature measuring system for monitoring the temperature field of floating roof oil storage tank is developed. The results show that by optimizing operating parameters such as tank operating mode and temperature, the total transportation scheduling costs of the storage and transportation system can be reduced by 9.1%. Therefore, this method can realize safe and stable operation of crude oil storage and transportation system.

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.

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

NASA Technical Reports Server (NTRS)

Kleiner, Steven C.

1998-01-01

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

Car painting process scheduling with harmony search algorithm

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

Pitch Guidance Optimization for the Orion Abort Flight Tests

NASA Technical Reports Server (NTRS)

Stillwater, Ryan Allanque

2010-01-01

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

A Mixed Integer Linear Program for Airport Departure Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Jung, Yoon Chul

2009-01-01

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

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

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

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

Optimal Scheduling of Time-Shiftable Electric Loads in Expeditionary Power Grids

DTIC Science & Technology

2015-09-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS OPTIMAL SCHEDULING OF TIME-SHIFTABLE ELECTRIC LOADS IN EXPEDITIONARY POWER GRIDS by John G...to 09-25-2015 4. TITLE AND SUBTITLE OPTIMAL SCHEDULING OF TIME-SHIFTABLE ELECTRIC LOADS IN EXPEDI- TIONARY POWER GRIDS 5. FUNDING NUMBERS 6. AUTHOR(S...eliminate unmanaged peak demand, reduce generator peak-to-average power ratios, and facilitate a persistent shift to higher fuel efficiency. Using

Benefit Opportunities for Integrated Surface and Airspace Departure Scheduling: A Study of Operations at Charlotte-Douglas International Airport

NASA Technical Reports Server (NTRS)

Coppenbarger, Rich; Jung, Yoon; Kozon, Tom; Farrahi, Amir; Malik, Wakar; Lee, Hanbong; Chevalley, Eric; Kistler, Matt

2016-01-01

NASA is collaborating with the FAA and aviation industry to develop and demonstrate new capabilities that integrate arrival, departure, and surface air-traffic operations. The concept relies on trajectory-based departure scheduling and collaborative decision making to reduce delays and uncertainties in taxi and climb operations. The paper describes the concept and benefit mechanisms aimed at improving flight efficiency and predictability while maintaining or improving operational throughput. The potential impact of the technology is studied and discussed through a quantitative analysis of relevant shortfalls at the site identified for initial deployment and demonstration in 2017: Charlotte-Douglas International Airport. Results from trajectory analysis indicate substantial opportunity to reduce taxi delays for both departures and arrivals by metering departures at the gate in a manner that maximizes throughput while adhering to takeoff restrictions due mostly to airspace constraints. Substantial taxi-out delay reduction is shown for flights subject to departure restrictions stemming from traffic flow management initiatives. Opportunities to improve the predictability of taxi, takeoff, and climb operations are examined and their potential impact on airline scheduling decisions and air-traffic forecasting is discussed. In addition, the potential to improve throughput with departure scheduling that maximizes use of available runway and airspace capacity is analyzed.

A novel LTE scheduling algorithm for green technology in smart grid.

PubMed

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

PubMed Central

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

Multi-objective optimization of discrete time-cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

NASA Astrophysics Data System (ADS)

Shahriari, Mohammadreza

2016-06-01

The time-cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate extra resources to short the finishing time of project and the project managers are intended to spend the lowest possible amount of money and achieve the maximum crashing time, as a result, both direct and indirect costs will be influenced in the project, and here, we are facing into the time value of money. It means that when we crash the starting activities in a project, the extra investment will be tied in until the end date of the project; however, when we crash the final activities, the extra investment will be tied in for a much shorter period. This study is presenting a two-objective mathematical model for balancing compressing the project time with activities delay to prepare a suitable tool for decision makers caught in available facilities and due to the time of projects. Also drawing the scheduling problem to real world conditions by considering nonlinear objective function and the time value of money are considered. The presented problem was solved using NSGA-II, and the effect of time compressing reports on the non-dominant set.

Unsignaled Delay of Reinforcement, Relative Time, and Resistance to Change

ERIC Educational Resources Information Center

Shahan, Timothy A.; Lattal, Kennon A.

2005-01-01

Two experiments with pigeons examined the effects of unsignaled, nonresetting delays of reinforcement on responding maintained by different reinforcement rates. In Experiment 1, 3-s unsignaled delays were introduced into each component of a multiple variable-interval (VI) 15-s VI 90-s VI 540-s schedule. When considered as a proportion of the…

75 FR 41920 - Agency Information Collection; Activity Under OMB Review; Airline Service Quality Performance...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-19

... and analyze air traffic delays. Wheels-up and wheels-down times are used in conjunction with departure and arrival times to show the extent of ground delays. Actual elapsed flight time, wheels-down minus wheels- up time, is compared to scheduled elapsed flight time to identify airborne delays. The reporting...

Evaluations of Some Scheduling Algorithms for Hard Real-Time Systems

DTIC Science & Technology

1990-06-01

construct because the mechanism is a dispatching procedure. Since all nonpreemptive schedules are contained in the set of all preemptive schedules, the...optimal value of Tmax in the preemptive case is at least a lower bound on the optimal Tmax for the nonpreemptive schedules. This principle is the basis...23 b. Nonpreemptable Version .............................................. 24 4. The Minimize Maximum Tardiness with Earliest Start

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.

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2008-01-01

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

On scheduling task systems with variable service times

NASA Astrophysics Data System (ADS)

Maset, Richard G.; Banawan, Sayed A.

1993-08-01

Several strategies have been proposed for developing optimal and near-optimal schedules for task systems (jobs consisting of multiple tasks that can be executed in parallel). Most such strategies, however, implicitly assume deterministic task service times. We show that these strategies are much less effective when service times are highly variable. We then evaluate two strategies—one adaptive, one static—that have been proposed for retaining high performance despite such variability. Both strategies are extensions of critical path scheduling, which has been found to be efficient at producing near-optimal schedules. We found the adaptive approach to be quite effective.

Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy.

PubMed

Xing, KeYi; Han, LiBin; Zhou, MengChu; Wang, Feng

2012-06-01

Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

NASA Astrophysics Data System (ADS)

Zhou, Jing; Dong, Shoubin

2018-06-01

In recent years many heuristic algorithms have been proposed to solve task scheduling problems in the cloud environment owing to their optimization capability. This article proposes a hybrid glowworm swarm optimization (HGSO) based on glowworm swarm optimization (GSO), which uses a technique of evolutionary computation, a strategy of quantum behaviour based on the principle of neighbourhood, offspring production and random walk, to achieve more efficient scheduling with reasonable scheduling costs. The proposed HGSO reduces the redundant computation and the dependence on the initialization of GSO, accelerates the convergence and more easily escapes from local optima. The conducted experiments and statistical analysis showed that in most cases the proposed HGSO algorithm outperformed previous heuristic algorithms to deal with independent tasks.

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.

Scheduling algorithm for data relay satellite optical communication based on artificial intelligent optimization

NASA Astrophysics Data System (ADS)

Zhao, Wei-hu; Zhao, Jing; Zhao, Shang-hong; Li, Yong-jun; Wang, Xiang; Dong, Yi; Dong, Chen

2013-08-01

Optical satellite communication with the advantages of broadband, large capacity and low power consuming broke the bottleneck of the traditional microwave satellite communication. The formation of the Space-based Information System with the technology of high performance optical inter-satellite communication and the realization of global seamless coverage and mobile terminal accessing are the necessary trend of the development of optical satellite communication. Considering the resources, missions and restraints of Data Relay Satellite Optical Communication System, a model of optical communication resources scheduling is established and a scheduling algorithm based on artificial intelligent optimization is put forwarded. According to the multi-relay-satellite, multi-user-satellite, multi-optical-antenna and multi-mission with several priority weights, the resources are scheduled reasonable by the operation: "Ascertain Current Mission Scheduling Time" and "Refresh Latter Mission Time-Window". The priority weight is considered as the parameter of the fitness function and the scheduling project is optimized by the Genetic Algorithm. The simulation scenarios including 3 relay satellites with 6 optical antennas, 12 user satellites and 30 missions, the simulation result reveals that the algorithm obtain satisfactory results in both efficiency and performance and resources scheduling model and the optimization algorithm are suitable in multi-relay-satellite, multi-user-satellite, and multi-optical-antenna recourses scheduling problem.

Cloud computing task scheduling strategy based on improved differential evolution algorithm

NASA Astrophysics Data System (ADS)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

NASA Astrophysics Data System (ADS)

Zhai, Wenzheng; Hu, Yue-Li; Ran, Feng

2017-07-01

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

OPTIMIZATION OF MUD HAMMER DRILLING PERFORMANCE - A PROGRAM TO BENCHMARK THE VIABILITY OF ADVANCED MUD HAMMER DRILLING

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

Arnis Judzis

2002-10-01

This document details the progress to date on the OPTIMIZATION OF MUD HAMMER DRILLING PERFORMANCE -- A PROGRAM TO BENCHMARK THE VIABILITY OF ADVANCED MUD HAMMER DRILLING contract for the quarter starting July 2002 through September 2002. Even though we are awaiting the optimization portion of the testing program, accomplishments include the following: (1) Smith International agreed to participate in the DOE Mud Hammer program. (2) Smith International chromed collars for upcoming benchmark tests at TerraTek, now scheduled for 4Q 2002. (3) ConocoPhillips had a field trial of the Smith fluid hammer offshore Vietnam. The hammer functioned properly, though themore » well encountered hole conditions and reaming problems. ConocoPhillips plan another field trial as a result. (4) DOE/NETL extended the contract for the fluid hammer program to allow Novatek to ''optimize'' their much delayed tool to 2003 and to allow Smith International to add ''benchmarking'' tests in light of SDS Digger Tools' current financial inability to participate. (5) ConocoPhillips joined the Industry Advisors for the mud hammer program. (6) TerraTek acknowledges Smith International, BP America, PDVSA, and ConocoPhillips for cost-sharing the Smith benchmarking tests allowing extension of the contract to complete the optimizations.« less

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

PubMed Central

Zhu, Xiaoning

2014-01-01

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

Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Tang, Dunbing; Dai, Min

2015-09-01

The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production planning and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed smalland large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.

Gain-scheduling multivariable LPV control of an irrigation canal system.

PubMed

Bolea, Yolanda; Puig, Vicenç

2016-07-01

The purpose of this paper is to present a multivariable linear parameter varying (LPV) controller with a gain scheduling Smith Predictor (SP) scheme applicable to open-flow canal systems. This LPV controller based on SP is designed taking into account the uncertainty in the estimation of delay and the variation of plant parameters according to the operating point. This new methodology can be applied to a class of delay systems that can be represented by a set of models that can be factorized into a rational multivariable model in series with left/right diagonal (multiple) delays, such as, the case of irrigation canals. A multiple pool canal system is used to test and validate the proposed control approach. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Contextual Interference in Complex Bimanual Skill Learning Leads to Better Skill Persistence

PubMed Central

Pauwels, Lisa; Swinnen, Stephan P.; Beets, Iseult A. M.

2014-01-01

The contextual interference (CI) effect is a robust phenomenon in the (motor) skill learning literature. However, CI has yielded mixed results in complex task learning. The current study addressed whether the CI effect is generalizable to bimanual skill learning, with a focus on the temporal evolution of memory processes. In contrast to previous studies, an extensive training schedule, distributed across multiple days of practice, was provided. Participants practiced three frequency ratios across three practice days following either a blocked or random practice schedule. During the acquisition phase, better overall performance for the blocked practice group was observed, but this difference diminished as practice progressed. At immediate and delayed retention, the random practice group outperformed the blocked practice group, except for the most difficult frequency ratio. Our main finding is that the random practice group showed superior performance persistence over a one week time interval in all three frequency ratios compared to the blocked practice group. This study contributes to our understanding of learning, consolidation and memory of complex motor skills, which helps optimizing training protocols in future studies and rehabilitation settings. PMID:24960171

Power plant maintenance scheduling using ant colony optimization: an improved formulation

NASA Astrophysics Data System (ADS)

Foong, Wai Kuan; Maier, Holger; Simpson, Angus

2008-04-01

It is common practice in the hydropower industry to either shorten the maintenance duration or to postpone maintenance tasks in a hydropower system when there is expected unserved energy based on current water storage levels and forecast storage inflows. It is therefore essential that a maintenance scheduling optimizer can incorporate the options of shortening the maintenance duration and/or deferring maintenance tasks in the search for practical maintenance schedules. In this article, an improved ant colony optimization-power plant maintenance scheduling optimization (ACO-PPMSO) formulation that considers such options in the optimization process is introduced. As a result, both the optimum commencement time and the optimum outage duration are determined for each of the maintenance tasks that need to be scheduled. In addition, a local search strategy is presented in this article to boost the robustness of the algorithm. When tested on a five-station hydropower system problem, the improved formulation is shown to be capable of allowing shortening of maintenance duration in the event of expected demand shortfalls. In addition, the new local search strategy is also shown to have significantly improved the optimization ability of the ACO-PPMSO algorithm.

Surgery scheduling optimization considering real life constraints and comprehensive operation cost of operating room.

PubMed

Xiang, Wei; Li, Chong

2015-01-01

Operating Room (OR) is the core sector in hospital expenditure, the operation management of which involves a complete three-stage surgery flow, multiple resources, prioritization of the various surgeries, and several real-life OR constraints. As such reasonable surgery scheduling is crucial to OR management. To optimize OR management and reduce operation cost, a short-term surgery scheduling problem is proposed and defined based on the survey of the OR operation in a typical hospital in China. The comprehensive operation cost is clearly defined considering both under-utilization and overutilization. A nested Ant Colony Optimization (nested-ACO) incorporated with several real-life OR constraints is proposed to solve such a combinatorial optimization problem. The 10-day manual surgery schedules from a hospital in China are compared with the optimized schedules solved by the nested-ACO. Comparison results show the advantage using the nested-ACO in several measurements: OR-related time, nurse-related time, variation in resources' working time, and the end time. The nested-ACO considering real-life operation constraints such as the difference between first and following case, surgeries priority, and fixed nurses in pre/post-operative stage is proposed to solve the surgery scheduling optimization problem. The results clearly show the benefit of using the nested-ACO in enhancing the OR management efficiency and minimizing the comprehensive overall operation cost.

Instructional versus schedule control of humans' choices in situations of diminishing returns

PubMed Central

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

14 CFR 1214.805 - Unforeseen customer delay.

Code of Federal Regulations, 2013 CFR

2013-01-01

... problem pose a threat of delay to the Shuttle launch schedule or critical off-line activities, NASA shall... availability of facilities, equipment, and personnel. In requesting NASA to make such special efforts, the customer shall agree to reimburse NASA the estimated additional cost incurred. ...

14 CFR 1214.805 - Unforeseen customer delay.

Code of Federal Regulations, 2011 CFR

2011-01-01

... problem pose a threat of delay to the Shuttle launch schedule or critical off-line activities, NASA shall... availability of facilities, equipment, and personnel. In requesting NASA to make such special efforts, the customer shall agree to reimburse NASA the estimated additional cost incurred. ...

14 CFR 1214.805 - Unforeseen customer delay.

Code of Federal Regulations, 2012 CFR

2012-01-01

... problem pose a threat of delay to the Shuttle launch schedule or critical off-line activities, NASA shall... availability of facilities, equipment, and personnel. In requesting NASA to make such special efforts, the customer shall agree to reimburse NASA the estimated additional cost incurred. ...

Simulated Stochastic Approximation Annealing for Global Optimization with a Square-Root Cooling Schedule

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

Liang, Faming; Cheng, Yichen; Lin, Guang

2014-06-13

Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to have such a long CPU time. This paper proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation Markov chain Monte Carlo, it is shown that themore » new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, e.g., a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors.« less

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

PubMed Central

Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach. PMID:24319361

AI techniques for a space application scheduling problem

NASA Technical Reports Server (NTRS)

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

1991-01-01

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

Multi-objective approach for energy-aware workflow scheduling in cloud computing environments.

PubMed

Yassa, Sonia; Chelouah, Rachid; Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach.

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

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

2014-01-01

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

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

PubMed

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

2014-01-01

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

Optimal Integration of Departures and Arrivals in Terminal Airspace

NASA Technical Reports Server (NTRS)

Xue, Min; Zelinski, Shannon Jean

2013-01-01

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations - spatial, temporal, and hybrid separations - were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buffer, spatial separation outperformed temporal separation when the uncertainty buffer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buffer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buffer sizes.

Assessing "First Mile" Supply Chain Factors Affecting Timeliness of School-Based Deworming Interventions: Supply and Logistics Performance Indicators.

PubMed

Koporc, Kimberly M; Strunz, Eric; Holloway, Cassandra; Addiss, David G; Lin, William

2015-12-01

Between 2007 and 2012, Children Without Worms (CWW) oversaw the Johnson & Johnson (J&J) donation of Vermox (mebendazole) for treatment of school-age children to control soil-transmitted helminthiasis (STH). To identify factors associated with on-time, delayed, or missed mass drug administration (MDA) interventions, and explore possible indicators for supply chain performance for drug donation programs, we reviewed program data for the 14 STH-endemic countries CWW supported during 2007-2012. Data from drug applications, shipping records, and annual treatment reports were tracked using Microsoft Excel. Qualitative data from interviews with key personnel were used to provide additional context on the causes of delayed or missed MDAs. Four possible contributory factors to delayed or missed MDAs were considered: production, shipping, customs clearance, and miscellaneous in-country issues. Coverage rates were calculated by dividing the number of treatments administered by the number of children targeted during the MDA. Of the approved requests for 78 MDAs, 54 MDAs (69%) were successfully implemented during or before the scheduled month. Ten MDAs (13%) were classified as delayed; seven of these were delayed by one month or less. An additional 14 MDAs (18%) were classified as missed. For the 64 on-time or delayed MDAs, the mean coverage was approximately 88%. To continue to assess the supply chain processes and identify areas for improvement, we identified four indicators or metrics for supply chain performance that can be applied across all neglected tropical disease (NTD) drug donation programs: (1) donor having available inventory to satisfy the country request for donation; (2) donor shipping the approved number of doses; (3) shipment arriving at the Central Medical Stores one month in advance of the scheduled MDA date; and (4) country programs implementing the MDA as scheduled.

Immediate Postsession Feeding Reduces Operant Responding in Rats

ERIC Educational Resources Information Center

Smethells, John R.; Fox, Andrew T.; Andrews, Jennifer J.; Reilly, Mark P.

2012-01-01

Three experiments investigated the effects of immediate and delayed postsession feeding on progressive-ratio and variable-interval schedule performance in rats. During Experiments 1 and 2, immediate postsession feeding decreased the breakpoint, or largest completed ratio, under progressive-ratio schedules. Experiment 3 was conducted to extend the…

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

NASA Technical Reports Server (NTRS)

Arneson, Heather; Bloem, Michael

2009-01-01

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Toward an understanding of the impact of production pressure on safety performance in construction operations.

PubMed

Han, Sanguk; Saba, Farzaneh; Lee, Sanghyun; Mohamed, Yasser; Peña-Mora, Feniosky

2014-07-01

It is not unusual to observe that actual schedule and quality performances are different from planned performances (e.g., schedule delay and rework) during a construction project. Such differences often result in production pressure (e.g., being pressed to work faster). Previous studies demonstrated that such production pressure negatively affects safety performance. However, the process by which production pressure influences safety performance, and to what extent, has not been fully investigated. As a result, the impact of production pressure has not been incorporated much into safety management in practice. In an effort to address this issue, this paper examines how production pressure relates to safety performance over time by identifying their feedback processes. A conceptual causal loop diagram is created to identify the relationship between schedule and quality performances (e.g., schedule delays and rework) and the components related to a safety program (e.g., workers' perceptions of safety, safety training, safety supervision, and crew size). A case study is then experimentally undertaken to investigate this relationship with accident occurrence with the use of data collected from a construction site; the case study is used to build a System Dynamics (SD) model. The SD model, then, is validated through inequality statistics analysis. Sensitivity analysis and statistical screening techniques further permit an evaluation of the impact of the managerial components on accident occurrence. The results of the case study indicate that schedule delays and rework are the critical factors affecting accident occurrence for the monitored project. Copyright © 2013 Elsevier Ltd. All rights reserved.

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.

Optimization of Dosing for EGFR-Mutant Non–Small Cell Lung Cancer with Evolutionary Cancer Modeling

PubMed Central

Chmielecki, Juliann; Foo, Jasmine; Oxnard, Geoffrey R.; Hutchinson, Katherine; Ohashi, Kadoaki; Somwar, Romel; Wang, Lu; Amato, Katherine R.; Arcila, Maria; Sos, Martin L.; Socci, Nicholas D.; Viale, Agnes; de Stanchina, Elisa; Ginsberg, Michelle S.; Thomas, Roman K.; Kris, Mark G.; Inoue, Akira; Ladanyi, Marc; Miller, Vincent A.; Michor, Franziska; Pao, William

2012-01-01

Non–small cell lung cancers (NSCLCs) that harbor mutations within the epidermal growth factor receptor (EGFR) gene are sensitive to the tyrosine kinase inhibitors (TKIs) gefitinib and erlotinib. Unfortunately, all patients treated with these drugs will acquire resistance, most commonly as a result of a secondary mutation within EGFR (T790M). Because both drugs were developed to target wild-type EGFR, we hypothesized that current dosing schedules were not optimized for mutant EGFR or to prevent resistance. To investigate this further, we developed isogenic TKI-sensitive and TKI-resistant pairs of cell lines that mimic the behavior of human tumors. We determined that the drug-sensitive and drug-resistant EGFR-mutant cells exhibited differential growth kinetics, with the drug-resistant cells showing slower growth. We incorporated these data into evolutionary mathematical cancer models with constraints derived from clinical data sets. This modeling predicted alternative therapeutic strategies that could prolong the clinical benefit of TKIs against EGFR-mutant NSCLCs by delaying the development of resistance. PMID:21734175

Understanding London's Water Supply Tradeoffs When Scheduling Interventions Under Deep Uncertainty

NASA Astrophysics Data System (ADS)

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

2015-12-01

Water supply planning in many major world cities faces several challenges associated with but not limited to climate change, population growth and insufficient land availability for infrastructure development. Long-term plans to maintain supply-demand balance and ecosystem services require careful consideration of uncertainties associated with future conditions. The current approach for London's water supply planning utilizes least cost optimization of future intervention schedules with limited uncertainty consideration. Recently, the focus of the long-term plans has shifted from solely least cost performance to robustness and resilience of the system. Identifying robust scheduling of interventions requires optimizing over a statistically representative sample of stochastic inputs which may be computationally difficult to achieve. In this study we optimize schedules using an ensemble of plausible scenarios and assess how manipulating that ensemble influences the different Pareto-approximate intervention schedules. We investigate how a major stress event's location in time as well as the optimization problem formulation influence the Pareto-approximate schedules. A bootstrapping method that respects the non-stationary trend of climate change scenarios and ensures the even distribution of the major stress event in the scenario ensemble is proposed. Different bootstrapped hydrological scenario ensembles are assessed using many-objective scenario optimization of London's future water supply and demand intervention scheduling. However, such a "fixed" scheduling of interventions approach does not aim to embed flexibility or adapt effectively as the future unfolds. Alternatively, making decisions based on the observations of occurred conditions could help planners who prefer adaptive planning. We will show how rules to guide the implementation of interventions based on observations may result in more flexible strategies.

14 CFR § 1214.805 - Unforeseen customer delay.

Code of Federal Regulations, 2014 CFR

2014-01-01

... problem pose a threat of delay to the Shuttle launch schedule or critical off-line activities, NASA shall... availability of facilities, equipment, and personnel. In requesting NASA to make such special efforts, the customer shall agree to reimburse NASA the estimated additional cost incurred. ...

Minerva: An Integrated Geospatial/Temporal Toolset for Real-time Science Decision Making and Data Collection

NASA Astrophysics Data System (ADS)

Lees, D. S.; Cohen, T.; Deans, M. C.; Lim, D. S. S.; Marquez, J.; Heldmann, J. L.; Hoffman, J.; Norheim, J.; Vadhavk, N.

2016-12-01

Minerva integrates three capabilities that are critical to the success of NASA analogs. It combines NASA's Exploration Ground Data Systems (xGDS) and Playbook software, and MIT's Surface Exploration Traverse Analysis and Navigation Tool (SEXTANT). Together, they help to plan, optimize, and monitor traverses; schedule and track activity; assist with science decision-making and document sample and data collection. Pre-mission, Minerva supports planning with a priori map data (e.g., UAV and satellite imagery) and activity scheduling. During missions, xGDS records and broadcasts live data to a distributed team who take geolocated notes and catalogue samples. Playbook provides live schedule updates and multi-media chat. Post-mission, xGDS supports data search and visualization for replanning and analysis. NASA's BASALT (Biologic Analog Science Associated with Lava Terrains) and FINESSE (Field Investigations to Enable Solar System Science and Exploration) projects use Minerva to conduct field science under simulated Mars mission conditions including 5 and 15 minute one-way communication delays. During the recent BASALT-FINESSE mission, two field scientists (EVA team) executed traverses across volcanic terrain to characterize and sample basalts. They wore backpacks with communications and imaging capabilities, and carried field portable spectrometers. The Science Team was 40 km away in a simulated mission control center. The Science Team monitored imaging (video and still), spectral, voice, location and physiological data from the EVA team via the network from the field, under communication delays. Minerva provided the Science Team with a unified context of operations at the field site, so they could make meaningful remote contributions to the collection of 10's of geotagged samples. Minerva's mission architecture will be presented with technical details and capabilities. Through the development, testing and application of Minerva, we are defining requirements for the design of future capabilities to support human and human-robotic missions to deep space and Mars.

The Basic Organizing/Optimizing Training Scheduler (BOOTS): User's Guide. Technical Report 151.

ERIC Educational Resources Information Center

Church, Richard L.; Keeler, F. Laurence

This report provides the step-by-step instructions required for using the Navy's Basic Organizing/Optimizing Training Scheduler (BOOTS) system. BOOTS is a computerized tool designed to aid in the creation of master training schedules for each Navy recruit training command. The system is defined in terms of three major functions: (1) data file…

Task Scheduling in Desktop Grids: Open Problems

NASA Astrophysics Data System (ADS)

Chernov, Ilya; Nikitina, Natalia; Ivashko, Evgeny

2017-12-01

We survey the areas of Desktop Grid task scheduling that seem to be insufficiently studied so far and are promising for efficiency, reliability, and quality of Desktop Grid computing. These topics include optimal task grouping, "needle in a haystack" paradigm, game-theoretical scheduling, domain-imposed approaches, special optimization of the final stage of the batch computation, and Enterprise Desktop Grids.

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.

Influence of temporal context on value in the multiple-chains and successive-encounters procedures.

PubMed

O'Daly, Matthew; Angulo, Samuel; Gipson, Cassandra; Fantino, Edmund

2006-05-01

This set of studies explored the influence of temporal context across multiple-chain and multiple-successive-encounters procedures. Following training with different temporal contexts, the value of stimuli sharing similar reinforcement schedules was assessed by presenting these stimuli in concurrent probes. The results for the multiple-chain schedule indicate that temporal context does impact the value of a conditioned reinforcer consistent with delay-reduction theory, such that a stimulus signaling a greater reduction in delay until reinforcement has greater value. Further, nonreinforced stimuli that are concurrently presented with the preferred terminal link also have greater value, consistent with value transfer. The effects of context on value for conditions with the multiple-successive-encounters procedure, however, appear to depend on whether the search schedule or alternate handling schedule was manipulated, as well as on whether the tested stimuli were the rich or lean schedules in their components. Overall, the results help delineate the conditions under which temporal context affects conditioned-reinforcement value (acting as a learning variable) and the conditions under which it does not (acting as a performance variable), an issue of relevance to theories of choice.

Stability of formation control using a consensus protocol under directed communications with two time delays and delay scheduling

NASA Astrophysics Data System (ADS)

Cepeda-Gomez, Rudy; Olgac, Nejat

2016-01-01

We consider a linear algorithm to achieve formation control in a group of agents which are driven by second-order dynamics and affected by two rationally independent delays. One of the delays is in the position and the other in the velocity information channels. These delays are taken as constant and uniform throughout the system. The communication topology is assumed to be directed and fixed. The formation is attained by adding a supplementary control term to the stabilising consensus protocol. In preparation for the formation control logic, we first study the stability of the consensus, using the recent cluster treatment of characteristic roots (CTCR) paradigm. This effort results in a unique depiction of the non-conservative stability boundaries in the domain of the delays. However, CTCR requires the knowledge of the potential stability switching loci exhaustively within this domain. The creation of these loci is done in a new surrogate coordinate system, called the 'spectral delay space (SDS)'. The relative stability is also investigated, which has to do with the speed of reaching consensus. This step leads to a paradoxical control design concept, called the 'delay scheduling', which highlights the fact that the group behaviour may be enhanced by increasing the delays. These steps lead to a control strategy to establish a desired group formation that guarantees spacing among the agents. Example case studies are presented to validate the underlying analytical derivations.

The Effects of Meal Schedule and Quantity on Problematic Behavior.

ERIC Educational Resources Information Center

Wacker, David P.; And Others

1996-01-01

Two case examples (a toddler with severe developmental delays and a 7-year old with severe mental retardation) illustrating effects of meal schedule and food quantity on displays of problematic behavior are offered. Brief functional analyses of aberrant behavior provided useful information for interpreting distinct patterns of behavior. (DB)

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

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.

Optimization of scheduling system for plant watering using electric cars in agro techno park

NASA Astrophysics Data System (ADS)

Oktavia Adiwijaya, Nelly; Herlambang, Yudha; Slamin

2018-04-01

Agro Techno Park in University of Jember is a special area used for the development of agriculture, livestock and fishery. In this plantation, the process of watering the plants is according to the frequency of each plant needs. This research develops the optimization of plant watering scheduling system using edge coloring of graph. This research was conducted in 3 stages, namely, data collection phase, analysis phase, and system development stage. The collected data was analyzed and then converted into a graph by using bipartite adjacency matrix representation. The development phase is conducted to build a web-based watering schedule optimization system. The result of this research showed that the schedule system is optimal because it can maximize the use of all electric cars to water the plants and minimize the number of idle cars.

A note on resource allocation scheduling with group technology and learning effects on a single machine

NASA Astrophysics Data System (ADS)

Lu, Yuan-Yuan; Wang, Ji-Bo; Ji, Ping; He, Hongyu

2017-09-01

In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.

Computer-aided resource planning and scheduling for radiological services

NASA Astrophysics Data System (ADS)

Garcia, Hong-Mei C.; Yun, David Y.; Ge, Yiqun; Khan, Javed I.

1996-05-01

There exists tremendous opportunity in hospital-wide resource optimization based on system integration. This paper defines the resource planning and scheduling requirements integral to PACS, RIS and HIS integration. An multi-site case study is conducted to define the requirements. A well-tested planning and scheduling methodology, called Constrained Resource Planning model, has been applied to the chosen problem of radiological service optimization. This investigation focuses on resource optimization issues for minimizing the turnaround time to increase clinical efficiency and customer satisfaction, particularly in cases where the scheduling of multiple exams are required for a patient. How best to combine the information system efficiency and human intelligence in improving radiological services is described. Finally, an architecture for interfacing a computer-aided resource planning and scheduling tool with the existing PACS, HIS and RIS implementation is presented.

Status Report on the Development of Micro-Scheduling Software for the Advanced Outage Control Center Project

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

Germain, Shawn St.; Thomas, Kenneth; Farris, Ronald

2014-09-01

The long-term viability of existing nuclear power plants (NPPs) in the United States (U.S.) is dependent upon a number of factors, including maintaining high capacity factors, maintaining nuclear safety, and reducing operating costs, particularly those associated with refueling outages. Refueling outages typically take 20-30 days, and for existing light water NPPs in the U.S., the reactor cannot be in operation during the outage. Furthermore, given that many NPPs generate between $1-1.5 million/day in revenue when in operation, there is considerable interest in shortening the length of refueling outages. Yet, refueling outages are highly complex operations, involving multiple concurrent and dependentmore » activities that are difficult to coordinate. Finding ways to improve refueling outage performance while maintaining nuclear safety has proven to be difficult. The Advanced Outage Control Center project is a research and development (R&D) demonstration activity under the Light Water Reactor Sustainability (LWRS) Program. LWRS is a R&D program which works with industry R&D programs to establish technical foundations for the licensing and managing of long-term, safe, and economical operation of current NPPs. The Advanced Outage Control Center project has the goal of improving the management of commercial NPP refueling outages. To accomplish this goal, this INL R&D project is developing an advanced outage control center (OCC) that is specifically designed to maximize the usefulness of communication and collaboration technologies for outage coordination and problem resolution activities. This report describes specific recent efforts to develop a capability called outage Micro-Scheduling. Micro-Scheduling is the ability to allocate and schedule outage support task resources on a sub-hour basis. Micro-Scheduling is the real-time fine-tuning of the outage schedule to react to the actual progress of the primary outage activities to ensure that support task resources are optimally deployed with the least amount of delay and unproductive use of resources. The remaining sections of this report describe in more detail the scheduling challenges that occur during outages, how a Micro-Scheduling capability helps address those challenges, and provides a status update on work accomplished to date and the path forward.« less

Cost Minimization for Joint Energy Management and Production Scheduling Using Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Shah, Rahul H.

Production costs account for the largest share of the overall cost of manufacturing facilities. With the U.S. industrial sector becoming more and more competitive, manufacturers are looking for more cost and resource efficient working practices. Operations management and production planning have shown their capability to dramatically reduce manufacturing costs and increase system robustness. When implementing operations related decision making and planning, two fields that have shown to be most effective are maintenance and energy. Unfortunately, the current research that integrates both is limited. Additionally, these studies fail to consider parameter domains and optimization on joint energy and maintenance driven production planning. Accordingly, production planning methodology that considers maintenance and energy is investigated. Two models are presented to achieve well-rounded operating strategy. The first is a joint energy and maintenance production scheduling model. The second is a cost per part model considering maintenance, energy, and production. The proposed methodology will involve a Time-of-Use electricity demand response program, buffer and holding capacity, station reliability, production rate, station rated power, and more. In practice, the scheduling problem can be used to determine a joint energy, maintenance, and production schedule. Meanwhile, the cost per part model can be used to: (1) test the sensitivity of the obtained optimal production schedule and its corresponding savings by varying key production system parameters; and (2) to determine optimal system parameter combinations when using the joint energy, maintenance, and production planning model. Additionally, a factor analysis on the system parameters is conducted and the corresponding performance of the production schedule under variable parameter conditions, is evaluated. Also, parameter optimization guidelines that incorporate maintenance and energy parameter decision making in the production planning framework are discussed. A modified Particle Swarm Optimization solution technique is adopted to solve the proposed scheduling problem. The algorithm is described in detail and compared to Genetic Algorithm. Case studies are presented to illustrate the benefits of using the proposed model and the effectiveness of the Particle Swarm Optimization approach. Numerical Experiments are implemented and analyzed to test the effectiveness of the proposed model. The proposed scheduling strategy can achieve savings of around 19 to 27 % in cost per part when compared to the baseline scheduling scenarios. By optimizing key production system parameters from the cost per part model, the baseline scenarios can obtain around 20 to 35 % in savings for the cost per part. These savings further increase by 42 to 55 % when system parameter optimization is integrated with the proposed scheduling problem. Using this method, the most influential parameters on the cost per part are the rated power from production, the production rate, and the initial machine reliabilities. The modified Particle Swarm Optimization algorithm adopted allows greater diversity and exploration compared to Genetic Algorithm for the proposed joint model which results in it being more computationally efficient in determining the optimal scheduling. While Genetic Algorithm could achieve a solution quality of 2,279.63 at an expense of 2,300 seconds in computational effort. In comparison, the proposed Particle Swarm Optimization algorithm achieved a solution quality of 2,167.26 in less than half the computation effort which is required by Genetic Algorithm.

White Paper on studying the safety of the childhood immunization schedule in the Vaccine Safety Datalink.

PubMed

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.

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

Jeong, J; Deasy, J O

Purpose: Concurrent chemo-radiation therapy (CCRT) has become a more common cancer treatment option with a better tumor control rate for several tumor sites, including head and neck and lung cancer. In this work, possible optimal chemotherapy schedules were investigated by implementing chemotherapy cell-kill into a tumor response model of RT. Methods: The chemotherapy effect has been added into a published model (Jeong et al., PMB (2013) 58:4897), in which the tumor response to RT can be simulated with the effects of hypoxia and proliferation. Based on the two-compartment pharmacokinetic model, the temporal concentration of chemotherapy agent was estimated. Log cell-killmore » was assumed and the cell-kill constant was estimated from the observed increase in local control due to concurrent chemotherapy. For a simplified two cycle CCRT regime, several different starting times and intervals were simulated with conventional RT regime (2Gy/fx, 5fx/wk). The effectiveness of CCRT was evaluated in terms of reduction in radiation dose required for 50% of control to find the optimal chemotherapy schedule. Results: Assuming the typical slope of dose response curve (γ50=2), the observed 10% increase in local control rate was evaluated to be equivalent to an extra RT dose of about 4 Gy, from which the cell-kill rate of chemotherapy was derived to be about 0.35. Best response was obtained when chemotherapy was started at about 3 weeks after RT began. As the interval between two cycles decreases, the efficacy of chemotherapy increases with broader range of optimal starting times. Conclusion: The effect of chemotherapy has been implemented into the resource-conservation tumor response model to investigate CCRT. The results suggest that the concurrent chemotherapy might be more effective when delayed for about 3 weeks, due to lower tumor burden and a larger fraction of proliferating cells after reoxygenation.« less

Schedule Risks Due to Delays in Advanced Technology Development

NASA Technical Reports Server (NTRS)

Reeves, John D. Jr.; Kayat, Kamal A.; Lim, Evan

2008-01-01

This paper discusses a methodology and modeling capability that probabilistically evaluates the likelihood and impacts of delays in advanced technology development prior to the start of design, development, test, and evaluation (DDT&E) of complex space systems. The challenges of understanding and modeling advanced technology development considerations are first outlined, followed by a discussion of the problem in the context of lunar surface architecture analysis. The current and planned methodologies to address the problem are then presented along with sample analyses and results. The methodology discussed herein provides decision-makers a thorough understanding of the schedule impacts resulting from the inclusion of various enabling advanced technology assumptions within system design.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

PubMed

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling

PubMed Central

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-01-01

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols. PMID:26393608

Nuclear Energy Encore in Sweden.

ERIC Educational Resources Information Center

Fishlock, David

1991-01-01

This article traces Sweden's decision to indefinitely delay their previous plan to phase out nuclear power generators which had been scheduled for 1995. Discussed as major factors in this delay are the excellent safety record of current reactors and the unacceptable economic, as well as environmental, consequences of switching to other power…

10 CFR 950.21 - Notification of covered event.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Energy DEPARTMENT OF ENERGY STANDBY SUPPORT FOR CERTAIN NUCLEAR PLANT DELAYS Claims Administration Process § 950.21 Notification of covered event. (a) A sponsor shall submit in writing to the Claims Administrator a notification that a covered event has occurred that has delayed the schedule for construction or...

10 CFR 950.21 - Notification of covered event.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Energy DEPARTMENT OF ENERGY STANDBY SUPPORT FOR CERTAIN NUCLEAR PLANT DELAYS Claims Administration Process § 950.21 Notification of covered event. (a) A sponsor shall submit in writing to the Claims Administrator a notification that a covered event has occurred that has delayed the schedule for construction or...

10 CFR 950.21 - Notification of covered event.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Energy DEPARTMENT OF ENERGY STANDBY SUPPORT FOR CERTAIN NUCLEAR PLANT DELAYS Claims Administration Process § 950.21 Notification of covered event. (a) A sponsor shall submit in writing to the Claims Administrator a notification that a covered event has occurred that has delayed the schedule for construction or...

10 CFR 950.21 - Notification of covered event.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Energy DEPARTMENT OF ENERGY STANDBY SUPPORT FOR CERTAIN NUCLEAR PLANT DELAYS Claims Administration Process § 950.21 Notification of covered event. (a) A sponsor shall submit in writing to the Claims Administrator a notification that a covered event has occurred that has delayed the schedule for construction or...

Motivational Control of Impulsive Behavior Interacts with Choice Opportunities

ERIC Educational Resources Information Center

Tanno, Takayuki; Kurashima, Ryo; Watanabe, Shigeru

2011-01-01

Impulsive behavior has been investigated through choice between a smaller/immediate reinforcer and a larger/delayed reinforcer, or through performance on a differential reinforcement of low rate (DRL) schedule. In the present study, we investigated a methodological divergence between these two procedures: in the former procedure, delay is a…

Integrating LMINET with TAAM and SIMMOD: A Feasibility Study

NASA Technical Reports Server (NTRS)

Long, Dou; Stouffer-Coston, Virginia; Kostiuk, Peter; Kula, Richard; Yackovetsky, Robert (Technical Monitor)

2001-01-01

LMINET is a queuing network air traffic simulation model implemented at 64 large airports and the entire National Airspace System in the United States. TAAM and SIMMOD are two widely used air traffic event-driven simulation models mostly for airports. Based on our proposed Progressive Augmented window approach, TAAM and SIMMOD are integrated with LMINET though flight schedules. In the integration, the flight schedules are modified through the flight delays reported by the other models. The benefit to the local simulation study is to let TAAM or SIMMOD take the modified schedule from LMINET, which takes into account of the air traffic congestion and flight delays at the national network level. We demonstrate the value of the integrated models by the case studies at Chicago O'Hare International Airport and Washington Dulles International Airport. Details of the integration are reported and future work for a full-blown integration is identified.

Optimizing donor scheduling before recruitment: An effective approach to increasing apheresis platelet collections.

PubMed

Lokhandwala, Parvez M; Shike, Hiroko; Wang, Ming; Domen, Ronald E; George, Melissa R

2018-01-01

Typical approach for increasing apheresis platelet collections is to recruit new donors. Here, we investigated the effectiveness of an alternative strategy: optimizing donor scheduling, prior to recruitment, at a hospital-based blood donor center. Analysis of collections, during the 89 consecutive months since opening of donor center, was performed. Linear regression and segmented time-series analyses were performed to calculate growth rates of collections and to test for statistical differences, respectively. Pre-intervention donor scheduling capacity was 39/month. In the absence of active donor recruitment, during the first 29 months, the number of collections rose gradually to 24/month (growth-rate of 0.70/month). However, between month-30 and -55, collections exhibited a plateau at 25.6 ± 3.0 (growth-rate of -0.09/month) (p<0.0001). This plateau-phase coincided with donor schedule approaching saturation (65.6 ± 7.6% schedule booked). Scheduling capacity was increased by following two interventions: adding an apheresis instrument (month-56) and adding two more collection days/week (month-72). Consequently, the scheduling capacity increased to 130/month. Post-interventions, apheresis platelet collections between month-56 and -81 exhibited a spontaneous renewed growth at a rate of 0.62/month (p<0.0001), in absence of active donor recruitment. Active donor recruitment in month-82 and -86, when the donor schedule had been optimized to accommodate further growth, resulted in a dramatic but transient surge in collections. Apheresis platelet collections plateau at nearly 2/3rd of the scheduling capacity. Optimizing the scheduling capacity prior to active donor recruitment is an effective strategy to increase platelet collections at a hospital-based donor center.

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

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-01-01

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

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

Optimization of a pH-shift control strategy for producing monoclonal antibodies in Chinese hamster ovary cell cultures using a pH-dependent dynamic model.

PubMed

Hogiri, Tomoharu; Tamashima, Hiroshi; Nishizawa, Akitoshi; Okamoto, Masahiro

2018-02-01

To optimize monoclonal antibody (mAb) production in Chinese hamster ovary cell cultures, culture pH should be temporally controlled with high resolution. In this study, we propose a new pH-dependent dynamic model represented by simultaneous differential equations including a minimum of six system component, depending on pH value. All kinetic parameters in the dynamic model were estimated using an evolutionary numerical optimization (real-coded genetic algorithm) method based on experimental time-course data obtained at different pH values ranging from 6.6 to 7.2. We determined an optimal pH-shift schedule theoretically. We validated this optimal pH-shift schedule experimentally and mAb production increased by approximately 40% with this schedule. Throughout this study, it was suggested that the culture pH-shift optimization strategy using a pH-dependent dynamic model is suitable to optimize any pH-shift schedule for CHO cell lines used in mAb production projects. Copyright © 2017 The Society for Biotechnology, Japan. Published by Elsevier B.V. All rights reserved.

Discriminated Timeout Avoidance in Pigeons: The Roles of Added Stimuli

ERIC Educational Resources Information Center

DeFulio, Anthony; Hackenberg, Timothy D.

2007-01-01

Two experiments examined pigeons' postponement of a signaled extinction period, or timeout (TO), from an ongoing schedule of response-dependent food delivery. A concurrent-operant procedure was used in which responses on one (food) key produced food according to a variable-interval schedule and responses on a second (postponement) key delayed the…

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

PubMed

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

2014-01-01

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

Optimal load scheduling in commercial and residential microgrids

NASA Astrophysics Data System (ADS)

Ganji Tanha, Mohammad Mahdi

Residential and commercial electricity customers use more than two third of the total energy consumed in the United States, representing a significant resource of demand response. Price-based demand response, which is in response to changes in electricity prices, represents the adjustments in load through optimal load scheduling (OLS). In this study, an efficient model for OLS is developed for residential and commercial microgrids which include aggregated loads in single-units and communal loads. Single unit loads which include fixed, adjustable and shiftable loads are controllable by the unit occupants. Communal loads which include pool pumps, elevators and central heating/cooling systems are shared among the units. In order to optimally schedule residential and commercial loads, a community-based optimal load scheduling (CBOLS) is proposed in this thesis. The CBOLS schedule considers hourly market prices, occupants' comfort level, and microgrid operation constraints. The CBOLS' objective in residential and commercial microgrids is the constrained minimization of the total cost of supplying the aggregator load, defined as the microgrid load minus the microgrid generation. This problem is represented by a large-scale mixed-integer optimization for supplying single-unit and communal loads. The Lagrangian relaxation methodology is used to relax the linking communal load constraint and decompose the independent single-unit functions into subproblems which can be solved in parallel. The optimal solution is acceptable if the aggregator load limit and the duality gap are within the bounds. If any of the proposed criteria is not satisfied, the Lagrangian multiplier will be updated and a new optimal load schedule will be regenerated until both constraints are satisfied. The proposed method is applied to several case studies and the results are presented for the Galvin Center load on the 16th floor of the IIT Tower in Chicago.

Efficient operation scheduling for adsorption chillers using predictive optimization-based control methods

NASA Astrophysics Data System (ADS)

Bürger, Adrian; Sawant, Parantapa; Bohlayer, Markus; Altmann-Dieses, Angelika; Braun, Marco; Diehl, Moritz

2017-10-01

Within this work, the benefits of using predictive control methods for the operation of Adsorption Cooling Machines (ACMs) are shown on a simulation study. Since the internal control decisions of series-manufactured ACMs often cannot be influenced, the work focuses on optimized scheduling of an ACM considering its internal functioning as well as forecasts for load and driving energy occurrence. For illustration, an assumed solar thermal climate system is introduced and a system model suitable for use within gradient-based optimization methods is developed. The results of a system simulation using a conventional scheme for ACM scheduling are compared to the results of a predictive, optimization-based scheduling approach for the same exemplary scenario of load and driving energy occurrence. The benefits of the latter approach are shown and future actions for application of these methods for system control are addressed.

Uplink Packet-Data Scheduling in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Choi, Young Woo; Kim, Seong-Lyun

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

Efficacy of melatonin with behavioural sleep-wake scheduling for delayed sleep-wake phase disorder: A double-blind, randomised clinical trial.

PubMed

Sletten, Tracey L; Magee, Michelle; Murray, Jade M; Gordon, Christopher J; Lovato, Nicole; Kennaway, David J; Gwini, Stella M; Bartlett, Delwyn J; Lockley, Steven W; Lack, Leon C; Grunstein, Ronald R; Rajaratnam, Shantha M W

2018-06-01

Delayed Sleep-Wake Phase Disorder (DSWPD) is characterised by sleep initiation insomnia when attempting sleep at conventional times and difficulty waking at the required time for daytime commitments. Although there are published therapeutic guidelines for the administration of melatonin for DSWPD, to our knowledge, randomised controlled trials are lacking. This trial tested the efficacy of 0.5 mg melatonin, combined with behavioural sleep-wake scheduling, for improving sleep initiation in clinically diagnosed DSWPD patients with a delayed endogenous melatonin rhythm relative to patient-desired (or -required) bedtime (DBT). This randomised, placebo-controlled, double-blind clinical trial was conducted in an Australian outpatient DSWPD population. Following 1-wk baseline, clinically diagnosed DSWPD patients with delayed melatonin rhythm relative to DBT (salivary dim light melatonin onset [DLMO] after or within 30 min before DBT) were randomised to 4-wk treatment with 0.5 mg fast-release melatonin or placebo 1 h before DBT for at least 5 consecutive nights per week. All patients received behavioural sleep-wake scheduling, consisting of bedtime scheduled at DBT. The primary outcome was actigraphic sleep onset time. Secondary outcomes were sleep efficiency in the first third of time in bed (SE T1) on treatment nights, subjective sleep-related daytime impairment (Patient Reported Outcomes Measurement Information System [PROMIS]), PROMIS sleep disturbance, measures of daytime sleepiness, clinician-rated change in illness severity, and DLMO time. Between September 13, 2012 and September 1, 2014, 307 participants were registered; 116 were randomised to treatment (intention-to-treat n = 116; n = 62 males; mean age, 29.0 y). Relative to baseline and compared to placebo, sleep onset occurred 34 min earlier (95% confidence interval [CI] -60 to -8) in the melatonin group. SE T1 increased; PROMIS sleep-related impairment, PROMIS sleep disturbance, insomnia severity, and functional disability decreased; and a greater proportion of patients showed more than minimal clinician-rated improvement following melatonin treatment (52.8%) compared to placebo (24.0%) (P < 0.05). The groups did not differ in the number of nights treatment was taken per protocol. Post-treatment DLMO assessed in a subset of patients (n = 43) was not significantly different between groups. Adverse events included light-headedness, daytime sleepiness, and decreased libido, although rates were similar between treatment groups. The clinical benefits or safety of melatonin with long-term treatment were not assessed, and it remains unknown whether the same treatment regime would benefit patients experiencing DSWPD sleep symptomology without a delay in the endogenous melatonin rhythm. In this study, melatonin treatment 1 h prior to DBT combined with behavioural sleep-wake scheduling was efficacious for improving objective and subjective measures of sleep disturbances and sleep-related impairments in DSWPD patients with delayed circadian phase relative to DBT. Improvements were achieved largely through the sleep-promoting effects of melatonin, combined with behavioural sleep-wake scheduling. This trial was registered with the Australian New Zealand Clinical Trials Registry, ACTRN12612000425897.

Development of a decentralized multi-axis synchronous control approach for real-time networks.

PubMed

Xu, Xiong; Gu, Guo-Ying; Xiong, Zhenhua; Sheng, Xinjun; Zhu, Xiangyang

2017-05-01

The message scheduling and the network-induced delays of real-time networks, together with the different inertias and disturbances in different axes, make the synchronous control of the real-time network-based systems quite challenging. To address this challenge, a decentralized multi-axis synchronous control approach is developed in this paper. Due to the limitations of message scheduling and network bandwidth, error of the position synchronization is firstly defined in the proposed control approach as a subset of preceding-axis pairs. Then, a motion message estimator is designed to reduce the effect of network delays. It is proven that position and synchronization errors asymptotically converge to zero in the proposed controller with the delay compensation. Finally, simulation and experimental results show that the developed control approach can achieve the good position synchronization performance for the multi-axis motion over the real-time network. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Energy conservation in ad hoc multimedia networks using traffic-shaping mechanisms

NASA Astrophysics Data System (ADS)

Chandra, Surendar

2003-12-01

In this work, we explore network traffic shaping mechanisms that deliver packets at pre-determined intervals; allowing the network interface to transition to a lower power consuming sleep state. We focus our efforts on commodity devices, IEEE 802.11b ad hoc mode and popular streaming formats. We argue that factors such as the lack of scheduling clock phase synchronization among the participants and scheduling delays introduced by back ground tasks affect the potential energy savings. Increasing the periodic transmission delays to transmit data infrequently can offset some of these effects at the expense of flooding the wireless channel for longer periods of time; potentially increasing the time to acquire the channel for non-multimedia traffic. Buffering mechanisms built into media browsers can mitigate the effects of these added delays from being mis-interpreted as network congestion. We show that practical implementations of such traffic shaping mechanisms can offer significant energy savings.

A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization

PubMed Central

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems. PMID:25143977

A DAG scheduling scheme on heterogeneous computing systems using tuple-based chemical reaction optimization.

PubMed

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems.

Resource planning and scheduling of payload for satellite with particle swarm optimization

NASA Astrophysics Data System (ADS)

Li, Jian; Wang, Cheng

2007-11-01

The resource planning and scheduling technology of payload is a key technology to realize an automated control for earth observing satellite with limited resources on satellite, which is implemented to arrange the works states of various payloads to carry out missions by optimizing the scheme of the resources. The scheduling task is a difficult constraint optimization problem with various and mutative requests and constraints. Based on the analysis of the satellite's functions and the payload's resource constraints, a proactive planning and scheduling strategy based on the availability of consumable and replenishable resources in time-order is introduced along with dividing the planning and scheduling period to several pieces. A particle swarm optimization algorithm is proposed to address the problem with an adaptive mutation operator selection, where the swarm is divided into groups with different probabilities to employ various mutation operators viz., differential evolution, Gaussian and random mutation operators. The probabilities are adjusted adaptively by comparing the effectiveness of the groups to select a proper operator. The simulation results have shown the feasibility and effectiveness of the method.

The office management of ejaculatory disorders

PubMed Central

2016-01-01

Premature ejaculation (PE), delayed ejaculation (DE), anejaculation (AE) and retrograde ejaculation (RE) are four main ejaculatory disorders (EjDs) observed in clinical practice. Despite their high prevalence, EjDs remain underdiagnosed and undertreated. Primary care physicians should incorporate the discussion of sexual health topics into routine visits to facilitate EjD diagnosis and treatment. Because the causes of EjDs are multifactorial, the management of EjDs is etiology-specific and may require a holistic approach. Dapoxetine, a selective serotonin reuptake inhibitor, is the only drug approved for on-demand treatment of lifelong and acquired PE. In clinical practice, scheduled follow-up visits, risk factor treatment, appropriate dose escalation, adequate sexual attempts, patient education, and partner involvement are critical factors responsible for optimal overall management of PE and dapoxetine treatment outcomes. PMID:27652225

The office management of ejaculatory disorders.

PubMed

Jiann, Bang-Ping

2016-08-01

Premature ejaculation (PE), delayed ejaculation (DE), anejaculation (AE) and retrograde ejaculation (RE) are four main ejaculatory disorders (EjDs) observed in clinical practice. Despite their high prevalence, EjDs remain underdiagnosed and undertreated. Primary care physicians should incorporate the discussion of sexual health topics into routine visits to facilitate EjD diagnosis and treatment. Because the causes of EjDs are multifactorial, the management of EjDs is etiology-specific and may require a holistic approach. Dapoxetine, a selective serotonin reuptake inhibitor, is the only drug approved for on-demand treatment of lifelong and acquired PE. In clinical practice, scheduled follow-up visits, risk factor treatment, appropriate dose escalation, adequate sexual attempts, patient education, and partner involvement are critical factors responsible for optimal overall management of PE and dapoxetine treatment outcomes.

Expert systems tools for Hubble Space Telescope observation scheduling

NASA Technical Reports Server (NTRS)

Miller, Glenn; Rosenthal, Don; Cohen, William; Johnston, Mark

1987-01-01

The utility of expert systems techniques for the Hubble Space Telescope (HST) planning and scheduling is discussed and a plan for development of expert system tools which will augment the existing ground system is described. Additional capabilities provided by these tools will include graphics-oriented plan evaluation, long-range analysis of the observation pool, analysis of optimal scheduling time intervals, constructing sequences of spacecraft activities which minimize operational overhead, and optimization of linkages between observations. Initial prototyping of a scheduler used the Automated Reasoning Tool running on a LISP workstation.

A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

NASA Astrophysics Data System (ADS)

Pu, Xun; Lu, XianLiang

2011-10-01

Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

Investigating the Impact of Off-Nominal Events on High-Density "Green" Arrivals

NASA Technical Reports Server (NTRS)

Callatine, Todd J.; Cabrall, Christopher; Kupfer, Michael; Martin, Lynne; Mercer, Joey; Palmer, Everett A.

2012-01-01

Trajectory-based controller tools developed to support a schedule-based terminal-area air traffic management (ATM) concept have been shown effective for enabling green arrivals along Area Navigation (RNAV) routes in moderately high-density traffic conditions. A recent human-in-the-loop simulation investigated the robustness of the concept and tools to off-nominal events events that lead to situations in which runway arrival schedules require adjustments and controllers can no longer use speed control alone to impose the necessary delays. Study participants included a terminal-area Traffic Management Supervisor responsible for adjusting the schedules. Sector-controller participants could issue alternate RNAV transition routes to absorb large delays. The study also included real-time winds/wind-forecast changes. The results indicate that arrival spacing accuracy, schedule conformance, and tool usage and usefulness are similar to that observed in simulations of nominal operations. However, the time and effort required to recover from an off-nominal event is highly context-sensitive, and impacted by the required schedule adjustments and control methods available for managing the evolving situation. The research suggests ways to bolster the off-nominal recovery process, and highlights challenges related to using human-in-the-loop simulation to investigate the safety and robustness of advanced ATM concepts.

Long-term behavioral sensitization to apomorphine is independent of conditioning and increases conditioned pecking, but not preference, in pigeons.

PubMed

Anselme, Patrick; Edeş, Neslihan; Tabrik, Sepideh; Güntürkün, Onur

2018-01-15

When rodents are given a free choice between a variable option and a constant option, they may prefer variability. This preference is even sometimes increased following repeated administration of a dopamine agonist. The present study was the first to examine preference for variability under the systemic administration of a dopamine agonist, apomorphine (Apo), in birds. Experiment 1 tested the drug-free preference and the propensity to choose of pigeons for a constant over a variable delay. It appeared that they preferred and decided more quickly to peck at the optimal delay option. Experiment 2 assessed the effects of a repeated injection of Apo on delay preference, in comparison with previous control tests within the same individuals. Apo treatment might have decreased the number of pecks at the constant option across the different experimental phases, but failed to induce a preference for the variable option. In Experiment 3, two groups of pigeons (Apo-sensitized and saline) were used in order to avoid inhomogeneity in treatments. They had to choose between a 50% probability option and a 5-s delay option. Conditioned pecking and the propensity to choose were higher in the Apo-sensitized pigeons, but, in each group, the pigeons showed indifference between the two options. This experiment also showed that long-term behavioral sensitization to Apo can occur independently of a conditioning process. These results suggest that Apo sensitization can enhance the attractiveness of conditioned cues, while having no effect on the development of a preference for variable-delay and probabilistic schedules of reinforcement. Copyright © 2017 Elsevier B.V. All rights reserved.

77 FR 13978 - Railroad Workplace Safety; Adjacent-Track On-Track Safety for Roadway Workers

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-08

... rule; delay of effective date and request for comments. SUMMARY: This document delays the effective date of the final rule published November 30, 2011, and scheduled to take effect on May 1, 2012. The final rule mandates that roadway workers comply with specified on-track safety procedures that railroads...

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

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

Effects of Using an Ipod App to Manage Recreation Tasks

ERIC Educational Resources Information Center

Uphold, Nicole M.; Douglas, Karen H.; Loseke, Dannell L.

2016-01-01

A withdrawal design study evaluated the effectiveness of using constant time delay to teach six adults with a developmental disability to program and use an iPod touch® as an electronic photographic activity schedule (ePAS). The ePAS, created with the First Then Visual Schedule app, consisted of photographs of different exercises to complete…

Benefit Assessment of the Precision Departure Release Capability Concept

NASA Technical Reports Server (NTRS)

Palopo, Kee; Chatterji, Gano B.; Lee, Hak-Tae

2011-01-01

A Precision Departure Release Capability concept is being evaluated by both the National Aeronautics and Space Administration and the Federal Aviation Administration as part of a larger goal of improving throughput, efficiency and capacity in integrated departure, arrival and surface operations. The concept is believed to have the potential of increasing flight efficiency and throughput by avoiding missing assigned slots and minimizing speed increase or path stretch to recover the slot. The main thrust of the paper is determining the impact of early and late departures from the departure runway when an aircraft has a slot assigned either at a meter fix or at the arrival airport. Results reported in the paper are for two scenarios. The first scenario considers flights out of Dallas/Fort Worth destined for Hartsfield-Jackson International Airport in Atlanta flying through the Meridian meter-fix in the Memphis Center with miles-in-trail constraints. The second scenario considers flights destined to George Bush Intercontinental/Houston Airport with specified airport arrival rate constraint. Results show that delay reduction can be achieved by allowing reasonable speed changes in scheduling. It was determined that the traffic volume between Dallas/Fort Worth and Atlanta via the Meridian fix is low and the departures times are spread enough that large departure schedule uncertainty can be tolerated. Flights can depart early or late within 90 minutes without accruing much more delay due to miles-in-trail constraint at the Meridian fix. In the Houston scenario, 808 arrivals from 174 airports were considered. Results show that delay experienced by the 16 Dallas/Fort Worth departures is higher if initial schedules of the remaining 792 flights are kept unaltered while they are rescheduled. Analysis shows that the probability of getting the initially assigned slot back after perturbation and rescheduling decreases with increasing standard deviation of the departure delay distributions. Results show that most Houston arrivals can be expected to be on time based on the assumed zero-mean Normal departure delay distributions achievable by Precision Departure Release Capability. In the current system, airport-departure delay, which is the sum of gate-departure delay and taxi-out delay, is observed at the airports. This delay acts as a bias, which can be reduced by Precision Departure Release Capability.

Assessing “First Mile” Supply Chain Factors Affecting Timeliness of School-Based Deworming Interventions: Supply and Logistics Performance Indicators

PubMed Central

Koporc, Kimberly M.; Strunz, Eric; Holloway, Cassandra; Addiss, David G.; Lin, William

2015-01-01

Background Between 2007 and 2012, Children Without Worms (CWW) oversaw the Johnson & Johnson (J&J) donation of Vermox (mebendazole) for treatment of school-age children to control soil-transmitted helminthiasis (STH). To identify factors associated with on-time, delayed, or missed mass drug administration (MDA) interventions, and explore possible indicators for supply chain performance for drug donation programs, we reviewed program data for the 14 STH-endemic countries CWW supported during 2007–2012. Methodology Data from drug applications, shipping records, and annual treatment reports were tracked using Microsoft Excel. Qualitative data from interviews with key personnel were used to provide additional context on the causes of delayed or missed MDAs. Four possible contributory factors to delayed or missed MDAs were considered: production, shipping, customs clearance, and miscellaneous in-country issues. Coverage rates were calculated by dividing the number of treatments administered by the number of children targeted during the MDA. Principal Findings Of the approved requests for 78 MDAs, 54 MDAs (69%) were successfully implemented during or before the scheduled month. Ten MDAs (13%) were classified as delayed; seven of these were delayed by one month or less. An additional 14 MDAs (18%) were classified as missed. For the 64 on-time or delayed MDAs, the mean coverage was approximately 88%. Conclusions and Significance To continue to assess the supply chain processes and identify areas for improvement, we identified four indicators or metrics for supply chain performance that can be applied across all neglected tropical disease (NTD) drug donation programs: (1) donor having available inventory to satisfy the country request for donation; (2) donor shipping the approved number of doses; (3) shipment arriving at the Central Medical Stores one month in advance of the scheduled MDA date; and (4) country programs implementing the MDA as scheduled. PMID:26657842

Scheduling Algorithms for Maximizing Throughput with Zero-Forcing Beamforming in a MIMO Wireless System

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.

Simultaneous Scheduling of Jobs, AGVs and Tools Considering Tool Transfer Times in Multi Machine FMS By SOS Algorithm

NASA Astrophysics Data System (ADS)

Sivarami Reddy, N.; Ramamurthy, D. V., Dr.; Prahlada Rao, K., Dr.

2017-08-01

This article addresses simultaneous scheduling of machines, AGVs and tools where machines are allowed to share the tools considering transfer times of jobs and tools between machines, to generate best optimal sequences that minimize makespan in a multi-machine Flexible Manufacturing System (FMS). Performance of FMS is expected to improve by effective utilization of its resources, by proper integration and synchronization of their scheduling. Symbiotic Organisms Search (SOS) algorithm is a potent tool which is a better alternative for solving optimization problems like scheduling and proven itself. The proposed SOS algorithm is tested on 22 job sets with makespan as objective for scheduling of machines and tools where machines are allowed to share tools without considering transfer times of jobs and tools and the results are compared with the results of existing methods. The results show that the SOS has outperformed. The same SOS algorithm is used for simultaneous scheduling of machines, AGVs and tools where machines are allowed to share tools considering transfer times of jobs and tools to determine the best optimal sequences that minimize makespan.

Planning and Scheduling for Fleets of Earth Observing Satellites

NASA Technical Reports Server (NTRS)

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

2001-01-01

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

A self-organizing neural network for job scheduling in distributed systems

NASA Astrophysics Data System (ADS)

Newman, Harvey B.; Legrand, Iosif C.

2001-08-01

The aim of this work is to describe a possible approach for the optimization of the job scheduling in large distributed systems, based on a self-organizing Neural Network. This dynamic scheduling system should be seen as adaptive middle layer software, aware of current available resources and making the scheduling decisions using the "past experience." It aims to optimize job specific parameters as well as the resource utilization. The scheduling system is able to dynamically learn and cluster information in a large dimensional parameter space and at the same time to explore new regions in the parameters space. This self-organizing scheduling system may offer a possible solution to provide an effective use of resources for the off-line data processing jobs for future HEP experiments.

Social Reinforcement Delays in Free-Flying Honey Bees (Apis mellifera L.)

PubMed Central

Craig, David Philip Arthur; Grice, James W.; Varnon, Chris A.; Gibson, B.; Sokolowski, Michel B. C.; Abramson, Charles I.

2012-01-01

Free-flying honey bees (Apis mellifera L.) reactions were observed when presented with varying schedules of post-reinforcement delays of 0 s, 300 s, or 600 s. We measured inter-visit-interval, response length, inter-response-time, and response rate. Honey bees exposed to these post-reinforcement delay intervals exhibit one of several patterns compared to groups not encountering delays, and had longer inter-visit-intervals. We observed no group differences in inter-response time. Honey bees with higher response rates tended to not finish the experiment. The removal of the delay intervals increased response rates for those subjects that completed the trials. PMID:23056425

Incorporation of Tropical Cyclone Avoidance Into Automated Ship Scheduling

DTIC Science & Technology

2014-06-01

damage and even sink ships. Avoiding TCs adds to fuel costs and causes delays. In the private sector, commercial shipping uses automated routing...improvements in forecasting have enabled ships to avoid TC-impacted areas altogether. Avoiding TCs does not come without a cost . Delaying departure or...steaming around a TC results in more fuel being burned at a high cost , plus the cost due to the delay in arrival at the destination, and the associated

Optimizing The Scheduling Of Recruitment And Initial Training For Soldiers In The Australian Army

DTIC Science & Technology

2016-03-01

SCHEDULING OF RECRUITMENT AND INITIAL TRAINING FOR SOLDIERS IN THE AUSTRALIAN ARMY by Melissa T. Joy March 2016 Thesis Advisor: Kenneth...SOLDIERS IN THE AUSTRALIAN ARMY 5. FUNDING NUMBERS 6. AUTHOR(S) Melissa T. Joy 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Naval...This thesis develops a master scheduling program to optimize recruitment into the Australian Army by employment category. The goal of the model

Noninvasive, automatic optimization strategy in cardiac resynchronization therapy.

PubMed

Reumann, Matthias; Osswald, Brigitte; Doessel, Olaf

2007-07-01

Optimization of cardiac resynchronization therapy (CRT) is still unsolved. It has been shown that optimal electrode position,atrioventricular (AV) and interventricular (VV) delays improve the success of CRT and reduce the number of non-responders. However, no automatic, noninvasive optimization strategy exists to date. Cardiac resynchronization therapy was simulated on the Visible Man and a patient data-set including fiber orientation and ventricular heterogeneity. A cellular automaton was used for fast computation of ventricular excitation. An AV block and a left bundle branch block were simulated with 100%, 80% and 60% interventricular conduction velocity. A right apical and 12 left ventricular lead positions were set. Sequential optimization and optimization with the downhill simplex algorithm (DSA) were carried out. The minimal error between isochrones of the physiologic excitation and the therapy was computed automatically and leads to an optimal lead position and timing. Up to 1512 simulations were carried out per pathology per patient. One simulation took 4 minutes on an Apple Macintosh 2 GHz PowerPC G5. For each electrode pair an optimal pacemaker delay was found. The DSA reduced the number of simulations by an order of magnitude and the AV-delay and VV - delay were determined with a much higher resolution. The findings are well comparable with clinical studies. The presented computer model of CRT automatically evaluates an optimal lead position and AV-delay and VV-delay, which can be used to noninvasively plan an optimal therapy for an individual patient. The application of the DSA reduces the simulation time so that the strategy is suitable for pre-operative planning in clinical routine. Future work will focus on clinical evaluation of the computer models and integration of patient data for individualized therapy planning and optimization.

A feasibility study: Selection of a personalized radiotherapy fractionation schedule using spatiotemporal optimization

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

Kim, Minsun, E-mail: mk688@uw.edu; Stewart, Robert D.; Phillips, Mark H.

2015-11-15

Purpose: To investigate the impact of using spatiotemporal optimization, i.e., intensity-modulated spatial optimization followed by fractionation schedule optimization, to select the patient-specific fractionation schedule that maximizes the tumor biologically equivalent dose (BED) under dose constraints for multiple organs-at-risk (OARs). Methods: Spatiotemporal optimization was applied to a variety of lung tumors in a phantom geometry using a range of tumor sizes and locations. The optimal fractionation schedule for a patient using the linear-quadratic cell survival model depends on the tumor and OAR sensitivity to fraction size (α/β), the effective tumor doubling time (T{sub d}), and the size and location of tumormore » target relative to one or more OARs (dose distribution). The authors used a spatiotemporal optimization method to identify the optimal number of fractions N that maximizes the 3D tumor BED distribution for 16 lung phantom cases. The selection of the optimal fractionation schedule used equivalent (30-fraction) OAR constraints for the heart (D{sub mean} ≤ 45 Gy), lungs (D{sub mean} ≤ 20 Gy), cord (D{sub max} ≤ 45 Gy), esophagus (D{sub max} ≤ 63 Gy), and unspecified tissues (D{sub 05} ≤ 60 Gy). To assess plan quality, the authors compared the minimum, mean, maximum, and D{sub 95} of tumor BED, as well as the equivalent uniform dose (EUD) for optimized plans to conventional intensity-modulated radiation therapy plans prescribing 60 Gy in 30 fractions. A sensitivity analysis was performed to assess the effects of T{sub d} (3–100 days), tumor lag-time (T{sub k} = 0–10 days), and the size of tumors on optimal fractionation schedule. Results: Using an α/β ratio of 10 Gy, the average values of tumor max, min, mean BED, and D{sub 95} were up to 19%, 21%, 20%, and 19% larger than those from conventional prescription, depending on T{sub d} and T{sub k} used. Tumor EUD was up to 17% larger than the conventional prescription. For fast proliferating tumors with T{sub d} less than 10 days, there was no significant increase in tumor BED but the treatment course could be shortened without a loss in tumor BED. The improvement in the tumor mean BED was more pronounced with smaller tumors (p-value = 0.08). Conclusions: Spatiotemporal optimization of patient plans has the potential to significantly improve local tumor control (larger BED/EUD) of patients with a favorable geometry, such as smaller tumors with larger distances between the tumor target and nearby OAR. In patients with a less favorable geometry and for fast growing tumors, plans optimized using spatiotemporal optimization and conventional (spatial-only) optimization are equivalent (negligible differences in tumor BED/EUD). However, spatiotemporal optimization yields shorter treatment courses than conventional spatial-only optimization. Personalized, spatiotemporal optimization of treatment schedules can increase patient convenience and help with the efficient allocation of clinical resources. Spatiotemporal optimization can also help identify a subset of patients that might benefit from nonconventional (large dose per fraction) treatments that are ineligible for the current practice of stereotactic body radiation therapy.« less

An operation support expert system based on on-line dynamics simulation and fuzzy reasoning for startup schedule optimization in fossil power plants

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

Matsumoto, H.; Eki, Y.; Kaji, A.

1993-12-01

An expert system which can support operators of fossil power plants in creating the optimum startup schedule and executing it accurately is described. The optimum turbine speed-up and load-up pattern is obtained through an iterative manner which is based on fuzzy resonating using quantitative calculations as plant dynamics models and qualitative knowledge as schedule optimization rules with fuzziness. The rules represent relationships between stress margins and modification rates of the schedule parameters. Simulations analysis proves that the system provides quick and accurate plant startups.

Robust optimization for nonlinear time-delay dynamical system of dha regulon with cost sensitivity constraint in batch culture

NASA Astrophysics Data System (ADS)

Yuan, Jinlong; Zhang, Xu; Liu, Chongyang; Chang, Liang; Xie, Jun; Feng, Enmin; Yin, Hongchao; Xiu, Zhilong

2016-09-01

Time-delay dynamical systems, which depend on both the current state of the system and the state at delayed times, have been an active area of research in many real-world applications. In this paper, we consider a nonlinear time-delay dynamical system of dha-regulonwith unknown time-delays in batch culture of glycerol bioconversion to 1,3-propanediol induced by Klebsiella pneumonia. Some important properties and strong positive invariance are discussed. Because of the difficulty in accurately measuring the concentrations of intracellular substances and the absence of equilibrium points for the time-delay system, a quantitative biological robustness for the concentrations of intracellular substances is defined by penalizing a weighted sum of the expectation and variance of the relative deviation between system outputs before and after the time-delays are perturbed. Our goal is to determine optimal values of the time-delays. To this end, we formulate an optimization problem in which the time delays are decision variables and the cost function is to minimize the biological robustness. This optimization problem is subject to the time-delay system, parameter constraints, continuous state inequality constraints for ensuring that the concentrations of extracellular and intracellular substances lie within specified limits, a quality constraint to reflect operational requirements and a cost sensitivity constraint for ensuring that an acceptable level of the system performance is achieved. It is approximated as a sequence of nonlinear programming sub-problems through the application of constraint transcription and local smoothing approximation techniques. Due to the highly complex nature of this optimization problem, the computational cost is high. Thus, a parallel algorithm is proposed to solve these nonlinear programming sub-problems based on the filled function method. Finally, it is observed that the obtained optimal estimates for the time-delays are highly satisfactory via numerical simulations.

A Method for Optimal Load Dispatch of a Multi-zone Power System with Zonal Exchange Constraints

NASA Astrophysics Data System (ADS)

Hazarika, Durlav; Das, Ranjay

2018-04-01

This paper presented a method for economic generation scheduling of a multi-zone power system having inter zonal operational constraints. For this purpose, the generator rescheduling for a multi area power system having inter zonal operational constraints has been represented as a two step optimal generation scheduling problem. At first, the optimal generation scheduling has been carried out for the zone having surplus or deficient generation with proper spinning reserve using co-ordination equation. The power exchange required for the deficit zones and zones having no generation are estimated based on load demand and generation for the zone. The incremental transmission loss formulas for the transmission lines participating in the power transfer process among the zones are formulated. Using these, incremental transmission loss expression in co-ordination equation, the optimal generation scheduling for the zonal exchange has been determined. Simulation is carried out on IEEE 118 bus test system to examine the applicability and validity of the method.

Monitoring of timely and delayed vaccinations: a nation-wide registry-based study of Norwegian children aged < 2 years.

PubMed

Riise, Øystein Rolandsen; Laake, Ida; Bergsaker, Marianne Adeleide Riise; Nøkleby, Hanne; Haugen, Inger Lise; Storsæter, Jann

2015-11-13

Delayed vaccinations increase the risk for vaccine preventable diseases (VPDs). Monitoring of delayed vaccinations by using a national immunisation registry has not been studied in countries recommending a two-dose (3 and 5 months of age) primary series of e.g., pertussis vaccine. Surveillance/monitoring of all vaccinations may improve vaccination programmes functioning. We obtained information from the Norwegian immunisation registry (SYSVAK) on all programme vaccinations received at age up to 730 days in children born in 2010 (n = 63,382). Timely vaccinations were received up to 7 days after the recommended age. Vaccinations were considered delayed if they were received more than one month after the recommended age in the schedule. In vaccinated children, timely administration of the subsequent three doses of pertussis and one dose of measles occurred in 73.8, 47.6, 53.6 and 43.5 % respectively. Delay for one or more programme vaccinations (diphtheria, tetanus, pertussis, polio, Haemophilus influenza type B, invasive pneumococcal disease, measles, mumps or rubella) was present in 28,336 (44.7 %) children. Among those who were delayed the mean duration was 139 days. The proportion of children that had vaccinations delayed differed among counties (range 37.4 %-57.8 %). Immigrant children were more frequently delayed 52.3 % vs. 43.1 %, RR 1.21 (95 % CI 1.19, 1.24). Children scheduled for vaccines in the summer holiday month (July) were more frequently delayed than others (1(st) dose pertussis vaccine 6.5 % vs. 3.9 % RR 1.65 (95 % CI 1.48, 1.85). Priming against pertussis (2(nd) dose), pneumococcal (2(nd) dose) and measles (1(st) dose) was delayed in 16.8, 18.6 and 29.3 % respectively. Vaccinations were frequently delayed. Delayed vaccinations differed among counties and occurred more frequently during the summer vacation (July) and in the immigrant population. Monitoring improves programme surveillance and may be used on an annual basis.

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

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

Sleep disorders - overview

MedlinePlus

... Hypersomina; Daytime sleepiness; Sleep rhythm; Sleep disruptive behaviors; Jet lag ... disrupted sleep schedule include: Irregular sleep-wake syndrome Jet lag syndrome Shift work sleep disorder Delayed sleep ...

19 CFR 162.45 - Summary forfeiture: Property other than Schedule I and Schedule II controlled substances. Notice...

Code of Federal Regulations, 2010 CFR

2010-04-01

... 812), exceeds $5,000, the notice will be published for at least three successive weeks in a newspaper...-in-interest shall be notified of the newspaper and expected dates of publication of such notice. (2... kind included in two or more seizures will be advertised as one unit. (c) Delay of publication...

Optimal Control for Stochastic Delay Evolution Equations

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

Meng, Qingxin, E-mail: mqx@hutc.zj.cn; Shen, Yang, E-mail: skyshen87@gmail.com

2016-08-15

In this paper, we investigate a class of infinite-dimensional optimal control problems, where the state equation is given by a stochastic delay evolution equation with random coefficients, and the corresponding adjoint equation is given by an anticipated backward stochastic evolution equation. We first prove the continuous dependence theorems for stochastic delay evolution equations and anticipated backward stochastic evolution equations, and show the existence and uniqueness of solutions to anticipated backward stochastic evolution equations. Then we establish necessary and sufficient conditions for optimality of the control problem in the form of Pontryagin’s maximum principles. To illustrate the theoretical results, we applymore » stochastic maximum principles to study two examples, an infinite-dimensional linear-quadratic control problem with delay and an optimal control of a Dirichlet problem for a stochastic partial differential equation with delay. Further applications of the two examples to a Cauchy problem for a controlled linear stochastic partial differential equation and an optimal harvesting problem are also considered.« less

Optimal exponential synchronization of general chaotic delayed neural networks: an LMI approach.

PubMed

Liu, Meiqin

2009-09-01

This paper investigates the optimal exponential synchronization problem of general chaotic neural networks with or without time delays by virtue of Lyapunov-Krasovskii stability theory and the linear matrix inequality (LMI) technique. This general model, which is the interconnection of a linear delayed dynamic system and a bounded static nonlinear operator, covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks (CNNs), bidirectional associative memory (BAM) networks, and recurrent multilayer perceptrons (RMLPs) with or without delays. Using the drive-response concept, time-delay feedback controllers are designed to synchronize two identical chaotic neural networks as quickly as possible. The control design equations are shown to be a generalized eigenvalue problem (GEVP) which can be easily solved by various convex optimization algorithms to determine the optimal control law and the optimal exponential synchronization rate. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws.

An order insertion scheduling model of logistics service supply chain considering capacity and time factors.

PubMed

Liu, Weihua; Yang, Yi; Wang, Shuqing; Liu, Yang

2014-01-01

Order insertion often occurs in the scheduling process of logistics service supply chain (LSSC), which disturbs normal time scheduling especially in the environment of mass customization logistics service. This study analyses order similarity coefficient and order insertion operation process and then establishes an order insertion scheduling model of LSSC with service capacity and time factors considered. This model aims to minimize the average unit volume operation cost of logistics service integrator and maximize the average satisfaction degree of functional logistics service providers. In order to verify the viability and effectiveness of our model, a specific example is numerically analyzed. Some interesting conclusions are obtained. First, along with the increase of completion time delay coefficient permitted by customers, the possible inserting order volume first increases and then trends to be stable. Second, supply chain performance reaches the best when the volume of inserting order is equal to the surplus volume of the normal operation capacity in mass service process. Third, the larger the normal operation capacity in mass service process is, the bigger the possible inserting order's volume will be. Moreover, compared to increasing the completion time delay coefficient, improving the normal operation capacity of mass service process is more useful.

Scheduling fertilizer applications as a simple mitigation option for reducing N2O emission in intensively managed mown grassland systems

NASA Astrophysics Data System (ADS)

Neftel, Albrecht; Calanca, Pierluigi; Felber, Raphael; Grant, Robert; Conen, Franz

2014-05-01

A general principle in all proposed N2O mitigation options is the fertilization according to plants' requirements. Meanwhile the amount of N fertilization allowed is regulated in many countries. Due to the high pressure from food security and the need for economic efficiency the given limits are generally used up. In mown grassland systems a simple mitigation option is to optimize the timing of the fertilizer applications. Application of fertilizer, both organic manure and mineral fertilizer, is generally scheduled after each cut in a narrow time window. In practice, the delay between cut and fertilizer application is determined by weather conditions, management conditions and most important by the planning and experience of the individual farmer. Many field experiments have shown that enhanced N2O emissions tend to occur after cuts but before the application of fertilizer, especially when soils are characterized by a high WFPS. These findings suggest that the time of fertilizer application has an important implications for the N2O emission rate and that scheduling fertilization according to soil conditions might be a simple, cheap and efficient measure to mitigate N2O emissions. In this paper we report on results from a sensitivity analysis aiming at quantifying the effects of the timing of the fertilizer applications on N2O emissions from intensively managed, mown grasslands. Simulations for different time schedules were carried out with the comprehensive ecosystem model "ECOSYS" . To our knowledge this aspect has not been systematically investigated from a scientific point of view, but might have been always there within the experiences of attentive environmentally concerned farmers.

Scheduling Earth Observing Satellites with Evolutionary Algorithms

NASA Technical Reports Server (NTRS)

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

2003-01-01

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

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.

Construction schedules slack time minimizing

NASA Astrophysics Data System (ADS)

Krzemiński, Michał

2017-07-01

The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.

PubMed

Yu, Zhang; Yang, Xiaomei

2013-01-01

By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

Nurse Scheduling by Cooperative GA with Effective Mutation Operator

NASA Astrophysics Data System (ADS)

Ohki, Makoto

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

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.

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

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Local Bifurcations and Optimal Theory in a Delayed Predator-Prey Model with Threshold Prey Harvesting

NASA Astrophysics Data System (ADS)

Tankam, Israel; Tchinda Mouofo, Plaire; Mendy, Abdoulaye; Lam, Mountaga; Tewa, Jean Jules; Bowong, Samuel

2015-06-01

We investigate the effects of time delay and piecewise-linear threshold policy harvesting for a delayed predator-prey model. It is the first time that Holling response function of type III and the present threshold policy harvesting are associated with time delay. The trajectories of our delayed system are bounded; the stability of each equilibrium is analyzed with and without delay; there are local bifurcations as saddle-node bifurcation and Hopf bifurcation; optimal harvesting is also investigated. Numerical simulations are provided in order to illustrate each result.

An Expert System for Aviation Squadron Flight Scheduling

DTIC Science & Technology

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

WFIRST: Exoplanet Target Selection and Scheduling with Greedy Optimization

NASA Astrophysics Data System (ADS)

Keithly, Dean; Garrett, Daniel; Delacroix, Christian; Savransky, Dmitry

2018-01-01

We present target selection and scheduling algorithms for missions with direct imaging of exoplanets, and the Wide Field Infrared Survey Telescope (WFIRST) in particular, which will be equipped with a coronagraphic instrument (CGI). Optimal scheduling of CGI targets can maximize the expected value of directly imaged exoplanets (completeness). Using target completeness as a reward metric and integration time plus overhead time as a cost metric, we can maximize the sum completeness for a mission with a fixed duration. We optimize over these metrics to create a list of target stars using a greedy optimization algorithm based off altruistic yield optimization (AYO) under ideal conditions. We simulate full missions using EXOSIMS by observing targets in this list for their predetermined integration times. In this poster, we report the theoretical maximum sum completeness, mean number of detected exoplanets from Monte Carlo simulations, and the ideal expected value of the simulated missions.

KC-46 Tanker Modernization: Delivery of First Fully Capable Aircraft Has Been Delayed over One Year and Additional Delays Are Possible

DTIC Science & Technology

2017-03-01

delays. As shown, the remaining schedule was modified to allow Boeing to deliver the first 18 aircraft and pods separately by October 2018, 14...testing. Among other things, Boeing is contractually required to deliver a total of 18 aircraft and 9 wing air refueling pod sets by August 2017...Parameters and System Attributes and Status of Technical Performance Capabilities 18 Appendix II GAO Contact and Staff Acknowledgments 20 Related

[Post-exposure antirabies vaccination. Early serological response to vaccine cultivated on VERO cells using a reduced 2-1-1 schedule].

PubMed

Colnot, F; Sureau, P; Alexandre, J L; Arnaudo, J P; Hesse, J Y; Jeanmaire, H

1994-11-12

An abbreviated 2-1-1 schedule for post-exposure rabies vaccination would theoretically lead to more rapid production of specific antibodies than the classical schedule. We measured early serological response to the 2-1-1 schedule. Patients consulting the antirabies centre of the Epinal hospital from June 1992 to June 1993 who had never been vaccinated and whose exposure history justified antirabies vaccination were included in this study. Fifty subjects were vaccinated with PVRV (purified vero rabies vaccine, Pasteur Institute) cultured on VERO (vervet monkey origin) cells using the abbreviated 2-1-1 schedule of 2 doses (0.5 ml = 2.5 IU/dose) on day 0 and 1 dose on days 7 and 21. Antirabies antibodies were assayed using the Platelia Rage immunoenzyme method (Diagnostic Pasteur) on day 21. Titres above 0.5 IU were considered to give protection and non-protected subjects were seen again on day 28 for a supplementary dose. Only 34 subjects (68%) had protective antibody titres on day 21, but by day 28, 48 (96%) had acquired immunity. In this study population, the age range was from 1 to 83 years and age over 30 years appeared to delay antibody formation. These findings emphasize the importance of initial antirabies immunoglobulins if short incubation in suspected and the need for serological follow-up if delayed antibody formation is suspected (subjects over 30).

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

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

2006-01-01

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

Multi-objective LQR with optimum weight selection to design FOPID controllers for delayed fractional order processes.

PubMed

Das, Saptarshi; Pan, Indranil; Das, Shantanu

2015-09-01

An optimal trade-off design for fractional order (FO)-PID controller is proposed with a Linear Quadratic Regulator (LQR) based technique using two conflicting time domain objectives. A class of delayed FO systems with single non-integer order element, exhibiting both sluggish and oscillatory open loop responses, have been controlled here. The FO time delay processes are handled within a multi-objective optimization (MOO) formalism of LQR based FOPID design. A comparison is made between two contemporary approaches of stabilizing time-delay systems withinLQR. The MOO control design methodology yields the Pareto optimal trade-off solutions between the tracking performance and total variation (TV) of the control signal. Tuning rules are formed for the optimal LQR-FOPID controller parameters, using median of the non-dominated Pareto solutions to handle delayed FO processes. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

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

PubMed Central

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

2014-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Aspects of job scheduling

NASA Technical Reports Server (NTRS)

Phillips, K.

1976-01-01

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

Diagnostic delays in children with early-onset epilepsy: impact, reasons, and opportunities to improve care

PubMed Central

Berg, Anne T.; Loddenkemper, Tobias; Baca, Christine B.

2014-01-01

Purpose Delayed diagnosis of early-onset epilepsy is a potentially important and avoidable complication in epilepsy care. We examined the frequency of diagnostic delays in young children with newly presenting epilepsy, their developmental impact, and reasons for delays. Methods Children who developed epilepsy before their third birthday were identified in a prospective community-based cohort. An interval ≥1 month from second seizure to diagnosis was considered a delay. Testing of development at baseline and for up to three years after and of IQ 8–9 years later was performed. Detailed parental baseline interview accounts and medical records were reviewed to identify potential reasons for delays. Factors associated with delays included the parent, child, pediatrician, neurologist, and scheduling. Results Diagnostic delays occurred in 70/172 (41%) children. Delays occurred less often if children had received medical attention for the first seizure (p<0.0001), previously had neonatal or febrile seizures (p=0.02), had only convulsions before diagnosis (p=0.005) or had a college-educated parent (p=0.01). A ≥1 month diagnostic delay was associated with an average 7.4 point drop (p=0.02) in the Vineland Scales of Adaptive Behavior motor score. The effect was present at diagnosis, persisted for at least three years, and was also apparent in IQ scores 8–9 years later which were lower in association with a diagnostic delay by 8.4 points (p=0.06) for processing speed up to 14.5 points (p=0.004) for full scale IQ, after adjustment for parental education and other epilepsy-related clinical factors. Factors associated with delayed diagnosis included parents not recognizing events as seizures (N=47), pediatricians missing or deferring diagnosis (N=15), neurologists deferring diagnosis (N=7), and scheduling problems (N=11). Significance Diagnostic delays occur in many young children with epilepsy. They are associated with substantial decrements in development and IQ later in childhood. Several factors influence diagnostic delays and may represent opportunities for intervention and improved care. PMID:24313635

77 FR 33808 - Agency Information Collection; Activity Under OMB Review: Airline Service Quality Performance...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-07

... Administration uses Part 234 data to pinpoint and analyze air traffic delays. Wheels-up and wheels-down times are... elapsed flight time, wheels-down minus wheels- up time, is compared to scheduled elapsed flight time to... the air network, which enables the FAA to study the ripple effects of delays at hub airports. The data...

78 FR 8638 - Self-Regulatory Organizations; National Stock Exchange, Inc.; Notice of Filing and Immediate...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-06

... Change To Delay the Operative Date of Rule 11.20A Regarding Market-Wide Circuit Breakers Due to... the market- wide circuit breakers on a pilot basis for a period scheduled to start on February 4, 2013... changed to April 8, 2013. The proposal would delay the operative date of the market-wide circuit breaker...

Advanced access: reducing waiting and delays in primary care.

PubMed

Murray, Mark; Berwick, Donald M

2003-02-26

Delay of care is a persistent and undesirable feature of current health care systems. Although delay seems to be inevitable and linked to resource limitations, it often is neither. Rather, it is usually the result of unplanned, irrational scheduling and resource allocation. Application of queuing theory and principles of industrial engineering, adapted appropriately to clinical settings, can reduce delay substantially, even in small practices, without requiring additional resources. One model, sometimes referred to as advanced access, has increasingly been shown to reduce waiting times in primary care. The core principle of advanced access is that patients calling to schedule a physician visit are offered an appointment the same day. Advanced access is not sustainable if patient demand for appointments is permanently greater than physician capacity to offer appointments. Six elements of advanced access are important in its application balancing supply and demand, reducing backlog, reducing the variety of appointment types, developing contingency plans for unusual circumstances, working to adjust demand profiles, and increasing the availability of bottleneck resources. Although these principles are powerful, they are counter to deeply held beliefs and established practices in health care organizations. Adopting these principles requires strong leadership investment and support.

Scheduling optimization of design stream line for production research and development projects

NASA Astrophysics Data System (ADS)

Liu, Qinming; Geng, Xiuli; Dong, Ming; Lv, Wenyuan; Ye, Chunming

2017-05-01

In a development project, efficient design stream line scheduling is difficult and important owing to large design imprecision and the differences in the skills and skill levels of employees. The relative skill levels of employees are denoted as fuzzy numbers. Multiple execution modes are generated by scheduling different employees for design tasks. An optimization model of a design stream line scheduling problem is proposed with the constraints of multiple executive modes, multi-skilled employees and precedence. The model considers the parallel design of multiple projects, different skills of employees, flexible multi-skilled employees and resource constraints. The objective function is to minimize the duration and tardiness of the project. Moreover, a two-dimensional particle swarm algorithm is used to find the optimal solution. To illustrate the validity of the proposed method, a case is examined in this article, and the results support the feasibility and effectiveness of the proposed model and algorithm.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

NASA Astrophysics Data System (ADS)

Wang, Ji-Bo; Wang, Ming-Zheng; Ji, Ping

2012-05-01

In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1 < a < 0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.

Cloud computing task scheduling strategy based on differential evolution and ant colony optimization

NASA Astrophysics Data System (ADS)

Ge, Junwei; Cai, Yu; Fang, Yiqiu

2018-05-01

This paper proposes a task scheduling strategy DEACO based on the combination of Differential Evolution (DE) and Ant Colony Optimization (ACO), aiming at the single problem of optimization objective in cloud computing task scheduling, this paper combines the shortest task completion time, cost and load balancing. DEACO uses the solution of the DE to initialize the initial pheromone of ACO, reduces the time of collecting the pheromone in ACO in the early, and improves the pheromone updating rule through the load factor. The proposed algorithm is simulated on cloudsim, and compared with the min-min and ACO. The experimental results show that DEACO is more superior in terms of time, cost, and load.

Scheduling Software for Complex Scenarios

NASA Technical Reports Server (NTRS)

2006-01-01

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

Two-machine flow shop scheduling integrated with preventive maintenance planning

NASA Astrophysics Data System (ADS)

Wang, Shijin; Liu, Ming

2016-02-01

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

Scheduling IT Staff at a Bank: A Mathematical Programming Approach

PubMed Central

Labidi, M.; Mrad, M.; Gharbi, A.; Louly, M. A.

2014-01-01

We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT) staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules. PMID:24772032

Scheduling IT staff at a bank: a mathematical programming approach.

PubMed

Labidi, M; Mrad, M; Gharbi, A; Louly, M A

2014-01-01

We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT) staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules.

Distributed Optimal Consensus Control for Multiagent Systems With Input Delay.

PubMed

Zhang, Huaipin; Yue, Dong; Zhao, Wei; Hu, Songlin; Dou, Chunxia; Huaipin Zhang; Dong Yue; Wei Zhao; Songlin Hu; Chunxia Dou; Hu, Songlin; Zhang, Huaipin; Dou, Chunxia; Yue, Dong; Zhao, Wei

2018-06-01

This paper addresses the problem of distributed optimal consensus control for a continuous-time heterogeneous linear multiagent system subject to time varying input delays. First, by discretization and model transformation, the continuous-time input-delayed system is converted into a discrete-time delay-free system. Two delicate performance index functions are defined for these two systems. It is shown that the performance index functions are equivalent and the optimal consensus control problem of the input-delayed system can be cast into that of the delay-free system. Second, by virtue of the Hamilton-Jacobi-Bellman (HJB) equations, an optimal control policy for each agent is designed based on the delay-free system and a novel value iteration algorithm is proposed to learn the solutions to the HJB equations online. The proposed adaptive dynamic programming algorithm is implemented on the basis of a critic-action neural network (NN) structure. Third, it is proved that local consensus errors of the two systems and weight estimation errors of the critic-action NNs are uniformly ultimately bounded while the approximated control policies converge to their target values. Finally, two simulation examples are presented to illustrate the effectiveness of the developed method.

Residency Training: Quality improvement projects in neurology residency and fellowship: applying DMAIC methodology.

PubMed

Kassardjian, Charles D; Williamson, Michelle L; van Buskirk, Dorothy J; Ernste, Floranne C; Hunderfund, Andrea N Leep

2015-07-14

Teaching quality improvement (QI) is a priority for residency and fellowship training programs. However, many medical trainees have had little exposure to QI methods. The purpose of this study is to review a rigorous and simple QI methodology (define, measure, analyze, improve, and control [DMAIC]) and demonstrate its use in a fellow-driven QI project aimed at reducing the number of delayed and canceled muscle biopsies at our institution. DMAIC was utilized. The project aim was to reduce the number of delayed muscle biopsies to 10% or less within 24 months. Baseline data were collected for 12 months. These data were analyzed to identify root causes for muscle biopsy delays and cancellations. Interventions were developed to address the most common root causes. Performance was then remeasured for 9 months. Baseline data were collected on 97 of 120 muscle biopsies during 2013. Twenty biopsies (20.6%) were delayed. The most common causes were scheduling too many tests on the same day and lack of fasting. Interventions aimed at patient education and biopsy scheduling were implemented. The effect was to reduce the number of delayed biopsies to 6.6% (6/91) over the next 9 months. Familiarity with QI methodologies such as DMAIC is helpful to ensure valid results and conclusions. Utilizing DMAIC, we were able to implement simple changes and significantly reduce the number of delayed muscle biopsies at our institution. © 2015 American Academy of Neurology.

Using filtered forecasting techniques to determine personalized monitoring schedules for patients with open-angle glaucoma.

PubMed

Schell, Greggory J; Lavieri, Mariel S; Helm, Jonathan E; Liu, Xiang; Musch, David C; Van Oyen, Mark P; Stein, Joshua D

2014-08-01

To determine whether dynamic and personalized schedules of visual field (VF) testing and intraocular pressure (IOP) measurements result in an improvement in disease progression detection compared with fixed interval schedules for performing these tests when evaluating patients with open-angle glaucoma (OAG). Secondary analyses using longitudinal data from 2 randomized controlled trials. A total of 571 participants from the Advanced Glaucoma Intervention Study (AGIS) and the Collaborative Initial Glaucoma Treatment Study (CIGTS). Perimetric and tonometric data were obtained for AGIS and CIGTS trial participants and used to parameterize and validate a Kalman filter model. The Kalman filter updates knowledge about each participant's disease dynamics as additional VF tests and IOP measurements are obtained. After incorporating the most recent VF and IOP measurements, the model forecasts each participant's disease dynamics into the future and characterizes the forecasting error. To determine personalized schedules for future VF tests and IOP measurements, we developed an algorithm by combining the Kalman filter for state estimation with the predictive power of logistic regression to identify OAG progression. The algorithm was compared with 1-, 1.5-, and 2-year fixed interval schedules of obtaining VF and IOP measurements. Length of diagnostic delay in detecting OAG progression, efficiency of detecting progression, and number of VF and IOP measurements needed to assess for progression. Participants were followed in the AGIS and CIGTS trials for a mean (standard deviation) of 6.5 (2.8) years. Our forecasting model achieved a 29% increased efficiency in identifying OAG progression (P<0.0001) and detected OAG progression 57% sooner (reduced diagnostic delay) (P = 0.02) than following a fixed yearly monitoring schedule, without increasing the number of VF tests and IOP measurements required. The model performed well for patients with mild and advanced disease. The model performed significantly more testing of patients who exhibited OAG progression than nonprogressing patients (1.3 vs. 1.0 tests per year; P<0.0001). Use of dynamic and personalized testing schedules can enhance the efficiency of OAG progression detection and reduce diagnostic delay compared with yearly fixed monitoring intervals. If further validation studies confirm these findings, such algorithms may be able to greatly enhance OAG management. Copyright © 2014 American Academy of Ophthalmology. Published by Elsevier Inc. All rights reserved.

Towards optimization of ACRT schedules applied to the gradient freeze growth of cadmium zinc telluride

NASA Astrophysics Data System (ADS)

Divecha, Mia S.; Derby, Jeffrey J.

2017-12-01

Historically, the melt growth of II-VI crystals has benefitted from the application of the accelerated crucible rotation technique (ACRT). Here, we employ a comprehensive numerical model to assess the impact of two ACRT schedules designed for a cadmium zinc telluride growth system per the classical recommendations of Capper and co-workers. The ;flow maximizing; ACRT schedule, with higher rotation, effectively mixes the solutal field in the melt but does not reduce supercooling adjacent to the growth interface. The ACRT schedule derived for stable Ekman flow, with lower rotation, proves more effective in reducing supercooling and promoting stable growth. These counterintuitive results highlight the need for more comprehensive studies on the optimization of ACRT schedules for specific growth systems and for desired growth outcomes.

Effect of Uncertainty on Deterministic Runway Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Malik, Waqar; Jung, Yoon C.

2012-01-01

Active runway scheduling involves scheduling departures for takeoffs and arrivals for runway crossing subject to numerous constraints. This paper evaluates the effect of uncertainty on a deterministic runway scheduler. The evaluation is done against a first-come- first-serve scheme. In particular, the sequence from a deterministic scheduler is frozen and the times adjusted to satisfy all separation criteria; this approach is tested against FCFS. The comparison is done for both system performance (throughput and system delay) and predictability, and varying levels of congestion are considered. The modeling of uncertainty is done in two ways: as equal uncertainty in availability at the runway as for all aircraft, and as increasing uncertainty for later aircraft. Results indicate that the deterministic approach consistently performs better than first-come-first-serve in both system performance and predictability.

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

Using Knowledge Base for Event-Driven Scheduling of Web Monitoring Systems

NASA Astrophysics Data System (ADS)

Kim, Yang Sok; Kang, Sung Won; Kang, Byeong Ho; Compton, Paul

Web monitoring systems report any changes to their target web pages by revisiting them frequently. As they operate under significant resource constraints, it is essential to minimize revisits while ensuring minimal delay and maximum coverage. Various statistical scheduling methods have been proposed to resolve this problem; however, they are static and cannot easily cope with events in the real world. This paper proposes a new scheduling method that manages unpredictable events. An MCRDR (Multiple Classification Ripple-Down Rules) document classification knowledge base was reused to detect events and to initiate a prompt web monitoring process independent of a static monitoring schedule. Our experiment demonstrates that the approach improves monitoring efficiency significantly.

Online stochastic optimization of radiotherapy patient scheduling.

PubMed

Legrain, Antoine; Fortin, Marie-Andrée; Lahrichi, Nadia; Rousseau, Louis-Martin

2015-06-01

The effective management of a cancer treatment facility for radiation therapy depends mainly on optimizing the use of the linear accelerators. In this project, we schedule patients on these machines taking into account their priority for treatment, the maximum waiting time before the first treatment, and the treatment duration. We collaborate with the Centre Intégré de Cancérologie de Laval to determine the best scheduling policy. Furthermore, we integrate the uncertainty related to the arrival of patients at the center. We develop a hybrid method combining stochastic optimization and online optimization to better meet the needs of central planning. We use information on the future arrivals of patients to provide an accurate picture of the expected utilization of resources. Results based on real data show that our method outperforms the policies typically used in treatment centers.

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

DOE PAGES

Liu, Guodong; Starke, Michael R.; Xiao, B.; ...

2017-01-13

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With themore » goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.« less

An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems

PubMed Central

Idris, Hajara; Junaidu, Sahalu B.; Adewumi, Aderemi O.

2017-01-01

The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user’s Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user’s QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time. PMID:28545075

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

PubMed

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

2017-01-01

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

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

PubMed Central

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

2017-01-01

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

Integrated Demand Management: Minimizing Unanticipated Excessive Departure Delay while Ensuring Fairness from a Traffic Management Initiative

NASA Technical Reports Server (NTRS)

Yoo, Hyo-Sang; Brasil, Connie; Buckley, Nathan; Mohlenbrink, Christoph; Speridakos, Constantine; Parke, Bonny; Hodell, Gita; Lee, Paul U.; Smith, Nancy M.

2017-01-01

This paper introduces NASA's Integrated Demand Management (IDM) concept and presents the results from an early proof-of-concept evaluation and an exploratory experiment. An initial development of the concept was focused on integrating two systems - i.e. the FAA's newly deployed Traffic Flow Management System (TFMS) tool called the Collaborative Trajectory Options Program (CTOP) and the Time-Based Flow Management (TBFM) system with Extended Metering (XM) capabilities to manage projected heavy traffic demand into a capacity-constrained airport. A human-in-the-loop (HITL) simulation experiment was conducted to demonstrate the feasibility of the initial development of the concept by adapting it to an arrival traffic problem at Newark Liberty International Airport (EWR) during clear weather conditions. In this study, the CTOP was utilized to strategically plan the arrival traffic demand by controlling take-off times of both short- and long-haul flights (long-hauls specify aircraft outside TBFM regions and short-hauls specify aircraft within TBFM regions) in a way that results in equitable delays among the groups. Such strategic planning allows less airborne delay to occur within TBFM by feeding manageable long-haul traffic demand while reserving sufficient slots in the overhead streams for the short-haul departures. The manageable traffic demand indicates the TBFM scheduler assigns no more airborne delay than its assigned airspace is capable of absorbing. TBFM then uses its time-based metering capabilities to deliver the desirable throughput by tactically rescheduling the TBFM entered long-haul flights and short-haul departures. Additional research was also performed to explore use of Required Time of Arrival (RTA) capabilities as a potential control mechanism for the airborne flights to improve arrival traffic delivery accuracy of scheduled long-haul traffic demand. The study results show that both short- and long-haul flights received similar ground delays. In addition, there was a noticeable reduction in the total amount of excessive unanticipated last-minute ground delays, i.e. delays that are frequently imposed on the short-haul flight in current day operations due to saturation in the overhead stream, commonly referred to as 'double penalty'. Furthermore, the concept achieved the target throughput while minimizing the expected cost associated with overall delays in arrival traffic. Assessment of the RTA capabilities showed that there was indeed improvement of the scheduled entry times into TBFM regions by using RTA capabilities. However, with respect to reduction in delays incurred within TBFM, there was no observable benefit of improving the precision of long-haul flights entry times.

A derived heuristics based multi-objective optimization procedure for micro-grid scheduling

NASA Astrophysics Data System (ADS)

Li, Xin; Deb, Kalyanmoy; Fang, Yanjun

2017-06-01

With the availability of different types of power generators to be used in an electric micro-grid system, their operation scheduling as the load demand changes with time becomes an important task. Besides satisfying load balance constraints and the generator's rated power, several other practicalities, such as limited availability of grid power and restricted ramping of power output from generators, must all be considered during the operation scheduling process, which makes it difficult to decide whether the optimization results are accurate and satisfactory. In solving such complex practical problems, heuristics-based customized optimization algorithms are suggested. However, due to nonlinear and complex interactions of variables, it is difficult to come up with heuristics in such problems off-hand. In this article, a two-step strategy is proposed in which the first task deciphers important heuristics about the problem and the second task utilizes the derived heuristics to solve the original problem in a computationally fast manner. Specifically, the specific operation scheduling is considered from a two-objective (cost and emission) point of view. The first task develops basic and advanced level knowledge bases offline from a series of prior demand-wise optimization runs and then the second task utilizes them to modify optimized solutions in an application scenario. Results on island and grid connected modes and several pragmatic formulations of the micro-grid operation scheduling problem clearly indicate the merit of the proposed two-step procedure.

An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm

PubMed Central

Lu, Guangquan; Xiong, Ying; Wang, Yunpeng

2016-01-01

The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration. PMID:27768732

An optimal control model approach to the design of compensators for simulator delay

NASA Technical Reports Server (NTRS)

Baron, S.; Lancraft, R.; Caglayan, A.

1982-01-01

The effects of display delay on pilot performance and workload and of the design of the filters to ameliorate these effects were investigated. The optimal control model for pilot/vehicle analysis was used both to determine the potential delay effects and to design the compensators. The model was applied to a simple roll tracking task and to a complex hover task. The results confirm that even small delays can degrade performance and impose a workload penalty. A time-domain compensator designed by using the optimal control model directly appears capable of providing extensive compensation for these effects even in multi-input, multi-output problems.

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

PubMed

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

2018-01-01

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

Remote Collaboration on Task Scheduling for Humans at Mars

NASA Technical Reports Server (NTRS)

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

2006-01-01

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

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

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

2006-01-01

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

U.S. announces one-year delay for visa waiver program change

NASA Astrophysics Data System (ADS)

The U.S. State Department has announced that it is delaying by one year a new rule affecting citizens from visa waiver program countries. The new rule, which was scheduled to go into effect on 1 October 2003, requires visitors from these countries to obtain non-immigrant visas to enter the United States if they do not have machine-readable passports. The announced delay means that this rule will now go into effect 26 October 2004 instead.The delay does not apply to five visa waiver countries—Andorra, Brunei, Liechtenstein, Luxembourg, and Slovenia—because most of the citizens of these nations already carry passports that are machine-readable.

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

Circadian phase resetting in older people by ocular bright light exposure.

PubMed

Klerman, E B; Duffy, J F; Dijk, D J; Czeisler, C A

2001-01-01

Aging is associated with frequent complaints about earlier bedtimes and waketimes. These changes in sleep timing are associated with an earlier timing of multiple endogenous rhythms, including core body temperature (CBT) and plasma melatonin, driven by the circadian pacemaker. One possible cause of the age-related shift of endogenous circadian rhythms and the timing of sleep relative to clock time is a change in the phase-shifting capacity of the circadian pacemaker in response to the environmental light-dark cycle, the principal synchronizer of the human circadian system. We studied the response of the circadian system of 24 older men and women and 23 young men to scheduled exposure to ocular bright light stimuli. Light stimuli were 5 hours in duration, administered for 3 consecutive days at an illuminance of approximately 10,000 lux. Light stimuli were scheduled 1.5 or 3.5 hours after the CBT nadir to induce shifts of endogenous circadian pacemaker to an earlier hour (phase advances) or were scheduled 1.5 hours before the CBT nadir to induce shifts to a later hour (phase delays). The rhythms of CBT and plasma melatonin assessed under constant conditions served as markers of circadian phase. Bright light stimuli elicited robust responses of the circadian timing system in older people; both phase advances and phase delays were induced. The magnitude of the phase delays did not differ significantly between older and younger individuals, but the phase advances were significantly attenuated in older people. The attenuated response to light stimuli that induce phase advances does not explain the advanced phase of the circadian pacemaker in older people. The maintained responsiveness of the circadian pacemaker to light implies that scheduled bright light exposure can be used to treat circadian phase disturbances in older people.

Optimized Hypervisor Scheduler for Parallel Discrete Event Simulations on Virtual Machine Platforms

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

Yoginath, Srikanth B; Perumalla, Kalyan S

2013-01-01

With the advent of virtual machine (VM)-based platforms for parallel computing, it is now possible to execute parallel discrete event simulations (PDES) over multiple virtual machines, in contrast to executing in native mode directly over hardware as is traditionally done over the past decades. While mature VM-based parallel systems now offer new, compelling benefits such as serviceability, dynamic reconfigurability and overall cost effectiveness, the runtime performance of parallel applications can be significantly affected. In particular, most VM-based platforms are optimized for general workloads, but PDES execution exhibits unique dynamics significantly different from other workloads. Here we first present results frommore » experiments that highlight the gross deterioration of the runtime performance of VM-based PDES simulations when executed using traditional VM schedulers, quantitatively showing the bad scaling properties of the scheduler as the number of VMs is increased. The mismatch is fundamental in nature in the sense that any fairness-based VM scheduler implementation would exhibit this mismatch with PDES runs. We also present a new scheduler optimized specifically for PDES applications, and describe its design and implementation. Experimental results obtained from running PDES benchmarks (PHOLD and vehicular traffic simulations) over VMs show over an order of magnitude improvement in the run time of the PDES-optimized scheduler relative to the regular VM scheduler, with over 20 reduction in run time of simulations using up to 64 VMs. The observations and results are timely in the context of emerging systems such as cloud platforms and VM-based high performance computing installations, highlighting to the community the need for PDES-specific support, and the feasibility of significantly reducing the runtime overhead for scalable PDES on VM platforms.« less

The Effects of Two Schedules of Instruction with Constant Time Delay on the Receptive Word Learning Skills of Preschool Children with Developmental Delays

ERIC Educational Resources Information Center

Spino, Margie A.

2013-01-01

Young children with special needs in inclusive settings may be provided special education services by itinerant early childhood special education (ECSE) teachers. These teachers typically travel to the community-based preschool program and work with a child for about 1 hour, 1 day each week. Research suggests that once itinerant ECSE teachers…

An Order Insertion Scheduling Model of Logistics Service Supply Chain Considering Capacity and Time Factors

PubMed Central

Yang, Yi; Wang, Shuqing; Liu, Yang

2014-01-01

Order insertion often occurs in the scheduling process of logistics service supply chain (LSSC), which disturbs normal time scheduling especially in the environment of mass customization logistics service. This study analyses order similarity coefficient and order insertion operation process and then establishes an order insertion scheduling model of LSSC with service capacity and time factors considered. This model aims to minimize the average unit volume operation cost of logistics service integrator and maximize the average satisfaction degree of functional logistics service providers. In order to verify the viability and effectiveness of our model, a specific example is numerically analyzed. Some interesting conclusions are obtained. First, along with the increase of completion time delay coefficient permitted by customers, the possible inserting order volume first increases and then trends to be stable. Second, supply chain performance reaches the best when the volume of inserting order is equal to the surplus volume of the normal operation capacity in mass service process. Third, the larger the normal operation capacity in mass service process is, the bigger the possible inserting order's volume will be. Moreover, compared to increasing the completion time delay coefficient, improving the normal operation capacity of mass service process is more useful. PMID:25276851

Staggered scheduling of sensor estimation and fusion for tracking over long-haul links

DOE PAGES

Liu, Qiang; Rao, Nageswara S. V.; Wang, Xin

2016-08-01

Networked sensing can be found in a multitude of real-world applications. Here, we focus on the communication-and computation-constrained long-haul sensor networks, where sensors are remotely deployed over a vast geographical area to perform certain tasks. Of special interest is a class of such networks where sensors take measurements of one or more dynamic targets and send their state estimates to a remote fusion center via long-haul satellite links. The severe loss and delay over such links can easily reduce the amount of sensor data received by the fusion center, thereby limiting the potential information fusion gain and resulting in suboptimalmore » tracking performance. In this paper, starting with the temporal-domain staggered estimation for an individual sensor, we explore the impact of the so-called intra-state prediction and retrodiction on estimation errors. We then investigate the effect of such estimation scheduling across different sensors on the spatial-domain fusion performance, where the sensing time epochs across sensors are scheduled in an asynchronous and staggered manner. In particular, the impact of communication delay and loss as well as sensor bias on such scheduling is explored by means of numerical and simulation studies that demonstrate the validity of our analysis.« less

A framework for using ant colony optimization to schedule environmental flow management alternatives for rivers, wetlands, and floodplains

NASA Astrophysics Data System (ADS)

Szemis, J. M.; Maier, H. R.; Dandy, G. C.

2012-08-01

Rivers, wetlands, and floodplains are in need of management as they have been altered from natural conditions and are at risk of vanishing because of river development. One method to mitigate these impacts involves the scheduling of environmental flow management alternatives (EFMA); however, this is a complex task as there are generally a large number of ecological assets (e.g., wetlands) that need to be considered, each with species with competing flow requirements. Hence, this problem evolves into an optimization problem to maximize an ecological benefit within constraints imposed by human needs and the physical layout of the system. This paper presents a novel optimization framework which uses ant colony optimization to enable optimal scheduling of EFMAs, given constraints on the environmental water that is available. This optimization algorithm is selected because, unlike other currently popular algorithms, it is able to account for all aspects of the problem. The approach is validated by comparing it to a heuristic approach, and its utility is demonstrated using a case study based on the Murray River in South Australia to investigate (1) the trade-off between plant recruitment (i.e., promoting germination) and maintenance (i.e., maintaining habitat) flow requirements, (2) the trade-off between flora and fauna flow requirements, and (3) a hydrograph inversion case. The results demonstrate the usefulness and flexibility of the proposed framework as it is able to determine EFMA schedules that provide optimal or near-optimal trade-offs between the competing needs of species under a range of operating conditions and valuable insight for managers.

Approximation algorithms for scheduling unrelated parallel machines with release dates

NASA Astrophysics Data System (ADS)

Avdeenko, T. V.; Mesentsev, Y. A.; Estraykh, I. V.

2017-01-01

In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.

PWFQ: a priority-based weighted fair queueing algorithm for the downstream transmission of EPON

NASA Astrophysics Data System (ADS)

Xu, Sunjuan; Ye, Jiajun; Zou, Junni

2005-11-01

In the downstream direction of EPON, all ethernet frames share one downlink channel from the OLT to destination ONUs. To guarantee differentiated services, a scheduling algorithm is needed to solve the link-sharing issue. In this paper, we first review the classical WFQ algorithm and point out the shortcomings existing in the fair queueing principle of WFQ algorithm for EPON. Then we propose a novel scheduling algorithm called Priority-based WFQ (PWFQ) algorithm which distributes bandwidth based on priority. PWFQ algorithm can guarantee the quality of real-time services whether under light load or under heavy load. Simulation results also show that PWFQ algorithm not only can improve delay performance of real-time services, but can also meet the worst-case delay bound requirements.

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

PubMed

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

PubMed Central

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Discrimination training facilitates pigeons' performance on one-trial-per-day delayed matching of key location

PubMed Central

Willson, Robert J.; Wilkie, Donald M.

1991-01-01

Six pigeons were tested on a one-trial-per-day variant of delayed matching of key location. In one condition, a trial began with the illumination of a pair of quasi-randomly selected pecking keys in a large 10-key test box. Pigeons' pecks to one key (the sample) were reinforced with 8-second access to grain on a variable-interval 30-second schedule, whereas pecks to the other key (the distractor) had no scheduled consequences. In the second condition, the nonreinforced distractor was not presented. In both conditions, subjects were removed from the apparatus after 15 minutes and placed in a holding cage. Subjects were subsequently replaced in the box after a delay (retention interval) of 30 seconds and were reexposed to the illuminated sample and distractor keys for 1 minute. If a pigeon made more pecks to the sample during this interval, the distractor was extinguished and subsequent pecks to the sample were reinforced on the previous schedule for an additional 15 minutes. If, however, a pigeon made more pecks to the distractor, both keys were extinguished and the subject was returned to its home cage. For all subjects, matching-to-sample accuracy was higher in the first condition. In a second experiment, the retention interval was increased to 5, 15, and 30 minutes, and then to 1, 2, 4, 8, 12, and 24 hours. Most subjects remembered the correct key location for up to 4 hours, and in one case, up to 24 hours, demonstrating a spatial-memory proficiency far better than previously reported in this species on delayed matching tasks. The results are discussed in terms of the commonly held distinction between working and reference memory. PMID:16812633

Evolutionarily stable learning schedules and cumulative culture in discrete generation models.

PubMed

Aoki, Kenichi; Wakano, Joe Yuichiro; Lehmann, Laurent

2012-06-01

Individual learning (e.g., trial-and-error) and social learning (e.g., imitation) are alternative ways of acquiring and expressing the appropriate phenotype in an environment. The optimal choice between using individual learning and/or social learning may be dictated by the life-stage or age of an organism. Of special interest is a learning schedule in which social learning precedes individual learning, because such a schedule is apparently a necessary condition for cumulative culture. Assuming two obligatory learning stages per discrete generation, we obtain the evolutionarily stable learning schedules for the three situations where the environment is constant, fluctuates between generations, or fluctuates within generations. During each learning stage, we assume that an organism may target the optimal phenotype in the current environment by individual learning, and/or the mature phenotype of the previous generation by oblique social learning. In the absence of exogenous costs to learning, the evolutionarily stable learning schedules are predicted to be either pure social learning followed by pure individual learning ("bang-bang" control) or pure individual learning at both stages ("flat" control). Moreover, we find for each situation that the evolutionarily stable learning schedule is also the one that optimizes the learned phenotype at equilibrium. Copyright © 2012 Elsevier Inc. All rights reserved.

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

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

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

Towards Optimization of ACRT Schedules Applied to the Gradient Freeze Growth of Cadmium Zinc Telluride

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

Divecha, Mia S.; Derby, Jeffrey J.

Historically, the melt growth of II-VI crystals has benefitted by the application of the accelerated crucible rotation technique (ACRT). Here, we employ a comprehensive numerical model to assess the impact of two ACRT schedules designed for a cadmium zinc telluride growth system per the classical recommendations of Capper and co-workers. The “flow maximizing” ACRT schedule, with higher rotation, effectively mixes the solutal field in the melt but does not reduce supercooling adjacent to the growth interface. The ACRT schedule derived for stable Ekman flow, with lower rotation, proves more effective in reducing supercooling and promoting stable growth. Furthermore, these counterintuitivemore » results highlight the need for more comprehensive studies on the optimization of ACRT schedules for specific growth systems and for desired growth outcomes.« less

Towards Optimization of ACRT Schedules Applied to the Gradient Freeze Growth of Cadmium Zinc Telluride

DOE PAGES

Divecha, Mia S.; Derby, Jeffrey J.

2017-10-03

Historically, the melt growth of II-VI crystals has benefitted by the application of the accelerated crucible rotation technique (ACRT). Here, we employ a comprehensive numerical model to assess the impact of two ACRT schedules designed for a cadmium zinc telluride growth system per the classical recommendations of Capper and co-workers. The “flow maximizing” ACRT schedule, with higher rotation, effectively mixes the solutal field in the melt but does not reduce supercooling adjacent to the growth interface. The ACRT schedule derived for stable Ekman flow, with lower rotation, proves more effective in reducing supercooling and promoting stable growth. Furthermore, these counterintuitivemore » results highlight the need for more comprehensive studies on the optimization of ACRT schedules for specific growth systems and for desired growth outcomes.« less

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

PubMed Central

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

2013-01-01

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

Optimizing Aesthetic Outcomes in Delayed Breast Reconstruction

PubMed Central

2017-01-01

Background: The need to restore both the missing breast volume and breast surface area makes achieving excellent aesthetic outcomes in delayed breast reconstruction especially challenging. Autologous breast reconstruction can be used to achieve both goals. The aim of this study was to identify surgical maneuvers that can optimize aesthetic outcomes in delayed breast reconstruction. Methods: This is a retrospective review of operative and clinical records of all patients who underwent unilateral or bilateral delayed breast reconstruction with autologous tissue between April 2014 and January 2017. Three groups of delayed breast reconstruction patients were identified based on patient characteristics. Results: A total of 26 flaps were successfully performed in 17 patients. Key surgical maneuvers for achieving aesthetically optimal results were identified. A statistically significant difference for volume requirements was identified in cases where a delayed breast reconstruction and a contralateral immediate breast reconstruction were performed simultaneously. Conclusions: Optimal aesthetic results can be achieved with: (1) restoration of breast skin envelope with tissue expansion when possible, (2) optimal positioning of a small skin paddle to be later incorporated entirely into a nipple areola reconstruction when adequate breast skin surface area is present, (3) limiting the reconstructed breast mound to 2 skin tones when large area skin resurfacing is required, (4) increasing breast volume by deepithelializing, not discarding, the inferior mastectomy flap skin, (5) eccentric division of abdominal flaps when an immediate and delayed bilateral breast reconstructions are performed simultaneously; and (6) performing second-stage breast reconstruction revisions and fat grafting. PMID:28894666

Air Traffic Management Technology Demonstration-1 Concept of Operations (ATD-1 ConOps), Version 2.0

NASA Technical Reports Server (NTRS)

Baxley, Brian T.; Johnson, William C.; Swenson, Harry N.; Robinson, John E.; Prevot, Tom; Callantine, Todd J.; Scardina, John; Greene, Michael

2013-01-01

This document is an update to the operations and procedures envisioned for NASA s Air Traffic Management (ATM) Technology Demonstration #1 (ATD-1). The ATD-1 Concept of Operations (ConOps) integrates three NASA technologies to achieve high throughput, fuel-efficient arrival operations into busy terminal airspace. They are Traffic Management Advisor with Terminal Metering (TMA-TM) for precise time-based schedules to the runway and points within the terminal area, Controller-Managed Spacing (CMS) decision support tools for terminal controllers to better manage aircraft delay using speed control, and Flight deck Interval Management (FIM) avionics and flight crew procedures to conduct airborne spacing operations. The ATD-1 concept provides de-conflicted and efficient operations of multiple arrival streams of aircraft, passing through multiple merge points, from top-of-descent (TOD) to the Final Approach Fix. These arrival streams are Optimized Profile Descents (OPDs) from en route altitude to the runway, using primarily speed control to maintain separation and schedule. The ATD-1 project is currently addressing the challenges of integrating the three technologies, and their implantation into an operational environment. The ATD-1 goals include increasing the throughput of high-density airports, reducing controller workload, increasing efficiency of arrival operations and the frequency of trajectory-based operations, and promoting aircraft ADS-B equipage.

NASA's ATM Technology Demonstration-1: Integrated Concept of Arrival Operations

NASA Technical Reports Server (NTRS)

Baxley, Brian T.; Swenson, Harry N.; Prevot, Thomas; Callantine, Todd J.

2012-01-01

This paper describes operations and procedures envisioned for NASA s Air Traffic Management (ATM) Technology Demonstration #1 (ATD-1). The ATD-1 Concept of Operations (ConOps) demonstration will integrate three NASA technologies to achieve high throughput, fuel-efficient arrival operations into busy terminal airspace. They are Traffic Management Advisor with Terminal Metering (TMA-TM) for precise time-based schedules to the runway and points within the terminal area, Controller-Managed Spacing (CMS) decision support tools for terminal controllers to better manage aircraft delay using speed control, and Flight deck Interval Management (FIM) avionics and flight crew procedures to conduct airborne spacing operations. The ATD-1 concept provides de-conflicted and efficient operations of multiple arrival streams of aircraft, passing through multiple merge points, from top-of-descent (TOD) to touchdown. It also enables aircraft to conduct Optimized Profile Descents (OPDs) from en route altitude to the runway, using primarily speed control to maintain separation and schedule. The ATD-1 project is currently addressing the challenges of integrating the three technologies, and implantation into an operational environment. Goals of the ATD-1 demonstration include increasing the throughput of high-density airports, reducing controller workload, increasing efficiency of arrival operations and the frequency of trajectory-based operations, and promoting aircraft ADS-B equipage.

Development of OTM Syngas Process and Testing of Syngas Derived Ultra-clean Fuels in Diesel Engines and Fuel Cells

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

E.T.; James P. Meagher; Prasad Apte

2002-12-31

This topical report summarizes work accomplished for the Program from November 1, 2001 to December 31, 2002 in the following task areas: Task 1: Materials Development; Task 2: Composite Development; Task 4: Reactor Design and Process Optimization; Task 8: Fuels and Engine Testing; 8.1 International Diesel Engine Program; 8.2 Nuvera Fuel Cell Program; and Task 10: Program Management. Major progress has been made towards developing high temperature, high performance, robust, oxygen transport elements. In addition, a novel reactor design has been proposed that co-produces hydrogen, lowers cost and improves system operability. Fuel and engine testing is progressing well, but wasmore » delayed somewhat due to the hiatus in program funding in 2002. The Nuvera fuel cell portion of the program was completed on schedule and delivered promising results regarding low emission fuels for transportation fuel cells. The evaluation of ultra-clean diesel fuels continues in single cylinder (SCTE) and multiple cylinder (MCTE) test rigs at International Truck and Engine. FT diesel and a BP oxygenate showed significant emissions reductions in comparison to baseline petroleum diesel fuels. Overall through the end of 2002 the program remains under budget, but behind schedule in some areas.« less

Fixed-interval performance and self-control in infants.

PubMed Central

Darcheville, J C; Rivière, V; Wearden, J H

1993-01-01

Twenty-six infants, 3 to 23 months old, were trained on fixed-interval schedules ranging from 10 s to 80 s. The operant response was touching an illuminated location on a touch-sensitive screen, and 20 s of cartoon presentation was the reinforcer. The subjects were also trained in a six-phase self-control procedure in which the critical phases involved choice between 20 s of cartoon available after a 0.5-s delay (impulsive choice) and 40 s of cartoon delayed for 40 s (self-controlled choice). All the youngest children (3 to 5 months) showed long postreinforcement pauses on the fixed-interval schedule, with most intervals involving the emission of a single, reinforced, response, and all made self-controlled choices. Older subjects (9 to 23 months) either produced the same pattern as the younger ones on the fixed-interval schedule (classified as pause-sensitive subjects) or produced short pauses and higher steady response rates (classified as pause-insensitive subjects). All pause-sensitive subjects made self-controlled choices in the self-control condition, and all pause-insensitive subjects made impulsive ones. PMID:8409821

Controller Strategies for Automation Tool Use under Varying Levels of Trajectory Prediction Uncertainty

NASA Technical Reports Server (NTRS)

Morey, Susan; Prevot, Thomas; Mercer, Joey; Martin, Lynne; Bienert, Nancy; Cabrall, Christopher; Hunt, Sarah; Homola, Jeffrey; Kraut, Joshua

2013-01-01

A human-in-the-loop simulation was conducted to examine the effects of varying levels of trajectory prediction uncertainty on air traffic controller workload and performance, as well as how strategies and the use of decision support tools change in response. This paper focuses on the strategies employed by two controllers from separate teams who worked in parallel but independently under identical conditions (airspace, arrival traffic, tools) with the goal of ensuring schedule conformance and safe separation for a dense arrival flow in en route airspace. Despite differences in strategy and methods, both controllers achieved high levels of schedule conformance and safe separation. Overall, results show that trajectory uncertainties introduced by wind and aircraft performance prediction errors do not affect the controllers' ability to manage traffic. Controller strategies were fairly robust to changes in error, though strategies were affected by the amount of delay to absorb (scheduled time of arrival minus estimated time of arrival). Using the results and observations, this paper proposes an ability to dynamically customize the display of information including delay time based on observed error to better accommodate different strategies and objectives.

Optimization of MLS receivers for multipath environments

NASA Technical Reports Server (NTRS)

Mcalpine, G. A.; Irwin, S. H.; NELSON; Roleyni, G.

1977-01-01

Optimal design studies of MLS angle-receivers and a theoretical design-study of MLS DME-receivers are reported. The angle-receiver results include an integration of the scan data processor and tracking filter components of the optimal receiver into a unified structure. An extensive simulation study comparing the performance of the optimal and threshold receivers in a wide variety of representative dynamical interference environments was made. The optimal receiver was generally superior. A simulation of the performance of the threshold and delay-and-compare receivers in various signal environments was performed. An analysis of combined errors due to lateral reflections from vertical structures with small differential path delays, specular ground reflections with neglible differential path delays, and thermal noise in the receivers is provided.

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.

Probabilistic Nowcasting of Low-Visibility Procedure States at Vienna International Airport During Cold Season

NASA Astrophysics Data System (ADS)

Kneringer, Philipp; Dietz, Sebastian J.; Mayr, Georg J.; Zeileis, Achim

2018-04-01

Airport operations are sensitive to visibility conditions. Low-visibility events may lead to capacity reduction, delays and economic losses. Different levels of low-visibility procedures (lvp) are enacted to ensure aviation safety. A nowcast of the probabilities for each of the lvp categories helps decision makers to optimally schedule their operations. An ordered logistic regression (OLR) model is used to forecast these probabilities directly. It is applied to cold season forecasts at Vienna International Airport for lead times of 30-min out to 2 h. Model inputs are standard meteorological measurements. The skill of the forecasts is accessed by the ranked probability score. OLR outperforms persistence, which is a strong contender at the shortest lead times. The ranked probability score of the OLR is even better than the one of nowcasts from human forecasters. The OLR-based nowcasting system is computationally fast and can be updated instantaneously when new data become available.

Optimal updating magnitude in adaptive flat-distribution sampling

NASA Astrophysics Data System (ADS)

Zhang, Cheng; Drake, Justin A.; Ma, Jianpeng; Pettitt, B. Montgomery

2017-11-01

We present a study on the optimization of the updating magnitude for a class of free energy methods based on flat-distribution sampling, including the Wang-Landau (WL) algorithm and metadynamics. These methods rely on adaptive construction of a bias potential that offsets the potential of mean force by histogram-based updates. The convergence of the bias potential can be improved by decreasing the updating magnitude with an optimal schedule. We show that while the asymptotically optimal schedule for the single-bin updating scheme (commonly used in the WL algorithm) is given by the known inverse-time formula, that for the Gaussian updating scheme (commonly used in metadynamics) is often more complex. We further show that the single-bin updating scheme is optimal for very long simulations, and it can be generalized to a class of bandpass updating schemes that are similarly optimal. These bandpass updating schemes target only a few long-range distribution modes and their optimal schedule is also given by the inverse-time formula. Constructed from orthogonal polynomials, the bandpass updating schemes generalize the WL and Langfeld-Lucini-Rago algorithms as an automatic parameter tuning scheme for umbrella sampling.

Optimal updating magnitude in adaptive flat-distribution sampling.

PubMed

Zhang, Cheng; Drake, Justin A; Ma, Jianpeng; Pettitt, B Montgomery

2017-11-07

We present a study on the optimization of the updating magnitude for a class of free energy methods based on flat-distribution sampling, including the Wang-Landau (WL) algorithm and metadynamics. These methods rely on adaptive construction of a bias potential that offsets the potential of mean force by histogram-based updates. The convergence of the bias potential can be improved by decreasing the updating magnitude with an optimal schedule. We show that while the asymptotically optimal schedule for the single-bin updating scheme (commonly used in the WL algorithm) is given by the known inverse-time formula, that for the Gaussian updating scheme (commonly used in metadynamics) is often more complex. We further show that the single-bin updating scheme is optimal for very long simulations, and it can be generalized to a class of bandpass updating schemes that are similarly optimal. These bandpass updating schemes target only a few long-range distribution modes and their optimal schedule is also given by the inverse-time formula. Constructed from orthogonal polynomials, the bandpass updating schemes generalize the WL and Langfeld-Lucini-Rago algorithms as an automatic parameter tuning scheme for umbrella sampling.

Optimal scan timing and intravenous route for contrast-enhanced computed tomography in patients after Fontan operation.

PubMed

Park, Eun-Ah; Lee, Whal; Chung, Se-Young; Yin, Yong Hu; Chung, Jin Wook; Park, Jae Hyung

2010-01-01

To determine the optimal scan timing and adequate intravenous route for patients having undergone the Fontan operation. A total of 88 computed tomographic images in 49 consecutive patients who underwent the Fontan operation were retrospectively evaluated and divided into 7 groups: group 1, bolus-tracking method with either intravenous route (n = 20); group 2, 1-minute-delay scan with single antecubital route (n = 36); group 3, 1-minute-delay scan with both antecubital routes (n = 2); group 4, 1-minute-delay scan with foot vein route (n = 3); group 5, 1-minute-delay scan with simultaneous infusion via both antecubital and foot vein routes (n = 2); group 6, 3-minute-delay scan with single antecubital route (n = 22); and group 7, 3-minute-delay scan with foot vein route (n = 3). The presence of beam-hardening artifact, uniform enhancement, and optimal enhancement was evaluated at the right pulmonary artery (RPA), left pulmonary artery (LPA), and Fontan tract. Optimal enhancement was determined when evaluation of thrombus was possible. Standard deviation was measured at the RPA, LPA, and Fontan tract. Beam-hardening artifacts of the RPA, LPA, and Fontan tract were frequently present in groups 1, 4, and 5. The success rate of uniform and optimal enhancement was highest (100%) in groups 6 and 7, followed by group 2 (75%). An SD of less than 30 Hounsfield unit for the pulmonary artery and Fontan tract was found in groups 3, 6, and 7. The optimal enhancement of the pulmonary arteries and Fontan tract can be achieved by a 3-minute-delay scan irrespective of the intravenous route location.

Cell cycle-tailored targeting of metastatic melanoma: Challenges and opportunities.

PubMed

Haass, Nikolas K; Gabrielli, Brian

2017-07-01

The advent of targeted therapies of metastatic melanoma, such as MAPK pathway inhibitors and immune checkpoint antagonists, has turned dermato-oncology from the "bad guy" to the "poster child" in oncology. Current targeted therapies are effective, although here is a clear need to develop combination therapies to delay the onset of resistance. Many antimelanoma drugs impact on the cell cycle but are also dependent on certain cell cycle phases resulting in cell cycle phase-specific drug insensitivity. Here, we raise the question: Have combination trials been abandoned prematurely as ineffective possibly only because drug scheduling was not optimized? Firstly, if both drugs of a combination hit targets in the same melanoma cell, cell cycle-mediated drug insensitivity should be taken into account when planning combination therapies, timing of dosing schedules and choice of drug therapies in solid tumors. Secondly, if the combination is designed to target different tumor cell subpopulations of a heterogeneous tumor, one drug effective in a particular subpopulation should not negatively impact on the other drug targeting another subpopulation. In addition to the role of cell cycle stage and progression on standard chemotherapeutics and targeted drugs, we discuss the utilization of cell cycle checkpoint control defects to enhance chemotherapeutic responses or as targets themselves. We propose that cell cycle-tailored targeting of metastatic melanoma could further improve therapy outcomes and that our real-time cell cycle imaging 3D melanoma spheroid model could be utilized as a tool to measure and design drug scheduling approaches. © 2017 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Sleep, Circadian Rhythms, and Performance During Space Shuttle Missions

NASA Technical Reports Server (NTRS)

Neri, David F.; Czeisler, Charles A.; Dijk, Derk-Jan; Wyatt, James K.; Ronda, Joseph M.; Hughes, Rod J.

2003-01-01

Sleep and circadian rhythms may be disturbed during spaceflight, and these disturbances can affect crewmembers' performance during waking hours. The mechanisms underlying sleep and circadian rhythm disturbances in space are not well understood, and effective countermeasures are not yet available. We investigated sleep, circadian rhythms, cognitive performance, and light-dark cycles in five astronauts prior to, during, and after the 16-day STS-90 mission and the IO-day STS-95 mission. The efficacy of low-dose, alternative-night, oral melatonin administration as a countermeasure for sleep disturbances was evaluated. During these missions, scheduled rest activity cycles were 20-35 minutes shorter than 24 hours. Light levels on the middeck and in the Spacelab were very low; whereas on the flight deck (which has several windows), they were highly variable. Circadian rhythm abnormalities were observed. During the second half of the missions, the rhythm of urinary cortisol appeared to be delayed relative to the sleep-wake schedule. Performance during wakefulness was impaired. Astronauts slept only about 6.5 hours per day, and subjective sleep quality was lower in space. No beneficial effects of melatonin (0.3 mg administered prior to sleep episodes on alternate nights) were observed. A surprising finding was a marked increase in rapid eye movement (REM) sleep upon return to Earth. We conclude that these Space Shuttle missions were associated with circadian rhythm disturbances, sleep loss, decrements in neurobehavioral performance, and alterations in REM sleep homeostasis. Shorter than 24-hour rest-activity schedules and exposure to light-dark cycles inadequate for optimal circadian synchronization may have contributed to these disturbances.

Application of the Software as a Service Model to the Control of Complex Building Systems

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

Stadler, Michael; Donadee, Jonathan; Marnay, Chris

2011-03-17

In an effort to create broad access to its optimization software, Lawrence Berkeley National Laboratory (LBNL), in collaboration with the University of California at Davis (UC Davis) and OSISoft, has recently developed a Software as a Service (SaaS) Model for reducing energy costs, cutting peak power demand, and reducing carbon emissions for multipurpose buildings. UC Davis currently collects and stores energy usage data from buildings on its campus. Researchers at LBNL sought to demonstrate that a SaaS application architecture could be built on top of this data system to optimize the scheduling of electricity and heat delivery in the building.more » The SaaS interface, known as WebOpt, consists of two major parts: a) the investment& planning and b) the operations module, which builds on the investment& planning module. The operational scheduling and load shifting optimization models within the operations module use data from load prediction and electrical grid emissions models to create an optimal operating schedule for the next week, reducing peak electricity consumption while maintaining quality of energy services. LBNL's application also provides facility managers with suggested energy infrastructure investments for achieving their energy cost and emission goals based on historical data collected with OSISoft's system. This paper describes these models as well as the SaaS architecture employed by LBNL researchers to provide asset scheduling services to UC Davis. The peak demand, emissions, and cost implications of the asset operation schedule and investments suggested by this optimization model are analysed.« less

Application of the Software as a Service Model to the Control of Complex Building Systems

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

Stadler, Michael; Donadee, Jon; Marnay, Chris

2011-03-18

In an effort to create broad access to its optimization software, Lawrence Berkeley National Laboratory (LBNL), in collaboration with the University of California at Davis (UC Davis) and OSISoft, has recently developed a Software as a Service (SaaS) Model for reducing energy costs, cutting peak power demand, and reducing carbon emissions for multipurpose buildings. UC Davis currently collects and stores energy usage data from buildings on its campus. Researchers at LBNL sought to demonstrate that a SaaS application architecture could be built on top of this data system to optimize the scheduling of electricity and heat delivery in the building.more » The SaaS interface, known as WebOpt, consists of two major parts: a) the investment& planning and b) the operations module, which builds on the investment& planning module. The operational scheduling and load shifting optimization models within the operations module use data from load prediction and electrical grid emissions models to create an optimal operating schedule for the next week, reducing peak electricity consumption while maintaining quality of energy services. LBNL's application also provides facility managers with suggested energy infrastructure investments for achieving their energy cost and emission goals based on historical data collected with OSISoft's system. This paper describes these models as well as the SaaS architecture employed by LBNL researchers to provide asset scheduling services to UC Davis. The peak demand, emissions, and cost implications of the asset operation schedule and investments suggested by this optimization model are analyzed.« less

Incentive-compatible guaranteed renewable health insurance premiums.

PubMed

Herring, Bradley; Pauly, Mark V

2006-05-01

Theoretical models of guaranteed renewable insurance display front-loaded premium schedules. Such schedules both cover lifetime total claims of low-risk and high-risk individuals and provide an incentive for those who remain low-risk to continue to purchase the policy. Questions have been raised of whether actual individual insurance markets in the US approximate the behavior predicted by these models, both because young consumers may not be able to "afford" front-loading and because insurers may behave strategically in ways that erode the value of protection against risk reclassification. In this paper, the optimal competitive age-based premium schedule for a benchmark guaranteed renewable health insurance policy is estimated using medical expenditure data. Several factors are shown to reduce the amount of front-loading necessary. Indeed, the resulting optimal premium path increases with age. Actual premium paths exhibited by purchasers of individual insurance are close to the optimal renewable schedule we estimate. Finally, consumer utility associated with the feature is examined.

Applications of colored petri net and genetic algorithms to cluster tool scheduling

NASA Astrophysics Data System (ADS)

Liu, Tung-Kuan; Kuo, Chih-Jen; Hsiao, Yung-Chin; Tsai, Jinn-Tsong; Chou, Jyh-Horng

2005-12-01

In this paper, we propose a method, which uses Coloured Petri Net (CPN) and genetic algorithm (GA) to obtain an optimal deadlock-free schedule and to solve re-entrant problem for the flexible process of the cluster tool. The process of the cluster tool for producing a wafer usually can be classified into three types: 1) sequential process, 2) parallel process, and 3) sequential parallel process. But these processes are not economical enough to produce a variety of wafers in small volume. Therefore, this paper will propose the flexible process where the operations of fabricating wafers are randomly arranged to achieve the best utilization of the cluster tool. However, the flexible process may have deadlock and re-entrant problems which can be detected by CPN. On the other hand, GAs have been applied to find the optimal schedule for many types of manufacturing processes. Therefore, we successfully integrate CPN and GAs to obtain an optimal schedule with the deadlock and re-entrant problems for the flexible process of the cluster tool.

Metroplex Optimization Model Expansion and Analysis: The Airline Fleet, Route, and Schedule Optimization Model (AFRS-OM)

NASA Technical Reports Server (NTRS)

Sherry, Lance; Ferguson, John; Hoffman, Karla; Donohue, George; Beradino, Frank

2012-01-01

This report describes the Airline Fleet, Route, and Schedule Optimization Model (AFRS-OM) that is designed to provide insights into airline decision-making with regards to markets served, schedule of flights on these markets, the type of aircraft assigned to each scheduled flight, load factors, airfares, and airline profits. The main inputs to the model are hedged fuel prices, airport capacity limits, and candidate markets. Embedded in the model are aircraft performance and associated cost factors, and willingness-to-pay (i.e. demand vs. airfare curves). Case studies demonstrate the application of the model for analysis of the effects of increased capacity and changes in operating costs (e.g. fuel prices). Although there are differences between airports (due to differences in the magnitude of travel demand and sensitivity to airfare), the system is more sensitive to changes in fuel prices than capacity. Further, the benefits of modernization in the form of increased capacity could be undermined by increases in hedged fuel prices

Inverse optimal design of input-to-state stabilisation for affine nonlinear systems with input delays

NASA Astrophysics Data System (ADS)

Cai, Xiushan; Meng, Lingxin; Zhang, Wei; Liu, Leipo

2018-03-01

We establish robustness of the predictor feedback control law to perturbations appearing at the system input for affine nonlinear systems with time-varying input delay and additive disturbances. Furthermore, it is shown that it is inverse optimal with respect to a differential game problem. All of the stability and inverse optimality proofs are based on the infinite-dimensional backstepping transformation and an appropriate Lyapunov functional. A single-link manipulator subject to input delays and disturbances is given to illustrate the validity of the proposed method.

VAXELN Experimentation: Programming a Real-Time Periodic Task Dispatcher Using VAXELN Ada 1.1

DTIC Science & Technology

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.

Physical exercise accelerates reentrainment of human sleep-wake cycle but not of plasma melatonin rhythm to 8-h phase-advanced sleep schedule.

PubMed

Yamanaka, Yujiro; Hashimoto, Satoko; Tanahashi, Yusuke; Nishide, Shin-Ya; Honma, Sato; Honma, Ken-Ichi

2010-03-01

Effects of timed physical exercise were examined on the reentrainment of sleep-wake cycle and circadian rhythms to an 8-h phase-advanced sleep schedule. Seventeen male adults spent 12 days in a temporal isolation facility with dim light conditions (<10 lux). The sleep schedule was phase-advanced by 8 h from their habitual sleep times for 4 days, which was followed by a free-run session for 6 days, during which the subjects were deprived of time cues. During the shift schedule, the exercise group (n = 9) performed physical exercise with a bicycle ergometer in the early and middle waking period for 2 h each. The control group (n = 8) sat on a chair at those times. Their sleep-wake cycles were monitored every day by polysomnography and/or weight sensor equipped with a bed. The circadian rhythm in plasma melatonin was measured on the baseline day before phase shift: on the 4th day of shift schedule and the 5th day of free-run. As a result, the sleep-onset on the first day of free-run in the exercise group was significantly phase-advanced from that in the control and from the baseline. On the other hand, the circadian melatonin rhythm was significantly phase-delayed in the both groups, showing internal desynchronization of the circadian rhythms. The sleep-wake cycle resynchronized to the melatonin rhythm by either phase-advance or phase-delay shifts in the free-run session. These findings indicate that the reentrainment of the sleep-wake cycle to a phase-advanced schedule occurs independent of the circadian pacemaker and is accelerated by timed physical exercise.

Nuclear Waste: Defense Waste Processing Facility-Cost, Schedule, and Technical Issues.

DTIC Science & Technology

1992-06-17

gallons of high-level radioactive waste stored in underground tanks at the savannah major facility involved Is the Defense Waste Processing Facility ( DwPF ...As a result of concerns about potential problems with the DWPF and delays in its scheduled start-up, the Chairman of the Environment, Energy, and...Natural Resources Subcommittee, House Committee on Government Operations, asked GAO to review the status of the DWPF and other facilities. This report

Fast Optimization for Aircraft Descent and Approach Trajectory

NASA Technical Reports Server (NTRS)

Luchinsky, Dmitry G.; Schuet, Stefan; Brenton, J.; Timucin, Dogan; Smith, David; Kaneshige, John

2017-01-01

We address problem of on-line scheduling of the aircraft descent and approach trajectory. We formulate a general multiphase optimal control problem for optimization of the descent trajectory and review available methods of its solution. We develop a fast algorithm for solution of this problem using two key components: (i) fast inference of the dynamical and control variables of the descending trajectory from the low dimensional flight profile data and (ii) efficient local search for the resulting reduced dimensionality non-linear optimization problem. We compare the performance of the proposed algorithm with numerical solution obtained using optimal control toolbox General Pseudospectral Optimal Control Software. We present results of the solution of the scheduling problem for aircraft descent using novel fast algorithm and discuss its future applications.

Fixed-interval performance and self-control in children.

PubMed Central

Darcheville, J C; Rivière, V; Wearden, J H

1992-01-01

Operant responses of 16 children (mean age 6 years and 1 month) were reinforced according to different fixed-interval schedules (with interreinforcer intervals of 20, 30, or 40 s) in which the reinforcers were either 20-s or 40-s presentations of a cartoon. In another procedure, they received training on a self-control paradigm in which both reinforcer delay (0.5 s or 40 s) and reinforcer duration (20 s or 40 s of cartoons) varied, and subjects were offered a choice between various combinations of delay and duration. Individual differences in behavior under the self-control procedure were precisely mirrored by individual differences under the fixed-interval schedule. Children who chose the smaller immediate reinforcer on the self-control procedure (impulsive) produced short postreinforcement pauses and high response rates in the fixed-interval conditions, and both measures changed little with changes in fixed-interval value. Conversely, children who chose the larger delayed reinforcer in the self-control condition (the self-controlled subjects) exhibited lower response rates and long postreinforcement pauses, which changed systematically with changes in the interval, in their fixed-interval performances. PMID:1573372

Satellite Delivery of Aviation Weather Data

NASA Technical Reports Server (NTRS)

Kerczewski, Robert J.; Haendel, Richard

2001-01-01

With aviation traffic continuing to increase worldwide, reducing the aviation accident rate and aviation schedule delays is of critical importance. In the United States, the National Aeronautics and Space Administration (NASA) has established the Aviation Safety Program and the Aviation System Capacity Program to develop and test new technologies to increase aviation safety and system capacity. Weather is a significant contributor to aviation accidents and schedule delays. The timely dissemination of weather information to decision makers in the aviation system, particularly to pilots, is essential in reducing system delays and weather related aviation accidents. The NASA Glenn Research Center is investigating improved methods of weather information dissemination through satellite broadcasting directly to aircraft. This paper describes an on-going cooperative research program with NASA, Rockwell Collins, WorldSpace, Jeppesen and American Airlines to evaluate the use of satellite digital audio radio service (SDARS) for low cost broadcast of aviation weather information, called Satellite Weather Information Service (SWIS). The description and results of the completed SWIS Phase 1 are presented, and the description of the on-going SWIS Phase 2 is given.

Dose Schedule Optimization and the Pharmacokinetic Driver of Neutropenia

PubMed Central

Patel, Mayankbhai; Palani, Santhosh; Chakravarty, Arijit; Yang, Johnny; Shyu, Wen Chyi; Mettetal, Jerome T.

2014-01-01

Toxicity often limits the utility of oncology drugs, and optimization of dose schedule represents one option for mitigation of this toxicity. Here we explore the schedule-dependency of neutropenia, a common dose-limiting toxicity. To this end, we analyze previously published mathematical models of neutropenia to identify a pharmacokinetic (PK) predictor of the neutrophil nadir, and confirm this PK predictor in an in vivo experimental system. Specifically, we find total AUC and Cmax are poor predictors of the neutrophil nadir, while a PK measure based on the moving average of the drug concentration correlates highly with neutropenia. Further, we confirm this PK parameter for its ability to predict neutropenia in vivo following treatment with different doses and schedules. This work represents an attempt at mechanistically deriving a fundamental understanding of the underlying pharmacokinetic drivers of neutropenia, and provides insights that can be leveraged in a translational setting during schedule selection. PMID:25360756

Optimizing Chemotherapy Dose and Schedule by Norton-Simon Mathematical Modeling

PubMed Central

Traina, Tiffany A.; Dugan, Ute; Higgins, Brian; Kolinsky, Kenneth; Theodoulou, Maria; Hudis, Clifford A.; Norton, Larry

2011-01-01

Background To hasten and improve anticancer drug development, we created a novel approach to generating and analyzing preclinical dose-scheduling data so as to optimize benefit-to-toxicity ratios. Methods We applied mathematical methods based upon Norton-Simon growth kinetic modeling to tumor-volume data from breast cancer xenografts treated with capecitabine (Xeloda®, Roche) at the conventional schedule of 14 days of treatment followed by a 7-day rest (14 - 7). Results The model predicted that 7 days of treatment followed by a 7-day rest (7 - 7) would be superior. Subsequent preclinical studies demonstrated that this biweekly capecitabine schedule allowed for safe delivery of higher daily doses, improved tumor response, and prolonged animal survival. Conclusions We demonstrated that the application of Norton-Simon modeling to the design and analysis of preclinical data predicts an improved capecitabine dosing schedule in xenograft models. This method warrants further investigation and application in clinical drug development. PMID:20519801

A Three-Stage Enhanced Reactive Power and Voltage Optimization Method for High Penetration of Solar

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

Ke, Xinda; Huang, Renke; Vallem, Mallikarjuna R.

This paper presents a three-stage enhanced volt/var optimization method to stabilize voltage fluctuations in transmission networks by optimizing the usage of reactive power control devices. In contrast with existing volt/var optimization algorithms, the proposed method optimizes the voltage profiles of the system, while keeping the voltage and real power output of the generators as close to the original scheduling values as possible. This allows the method to accommodate realistic power system operation and market scenarios, in which the original generation dispatch schedule will not be affected. The proposed method was tested and validated on a modified IEEE 118-bus system withmore » photovoltaic data.« less

System and method for optimal load and source scheduling in context aware homes

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

Shetty, Pradeep; Foslien Graber, Wendy; Mangsuli, Purnaprajna R.

A controller for controlling energy consumption in a home includes a constraints engine to define variables for multiple appliances in the home corresponding to various home modes and persona of an occupant of the home. A modeling engine models multiple paths of energy utilization of the multiple appliances to place the home into a desired state from a current context. An optimal scheduler receives the multiple paths of energy utilization and generates a schedule as a function of the multiple paths and a selected persona to place the home in a desired state.

Effects of Delay Duration on the WMS Logical Memory Performance of Older Adults with Probable Alzheimer's Disease, Probable Vascular Dementia, and Normal Cognition.

PubMed

Montgomery, Valencia; Harris, Katie; Stabler, Anthony; Lu, Lisa H

2017-05-01

To examine how the duration of time delay between Wechsler Memory Scale (WMS) Logical Memory I and Logical Memory II (LM) affected participants' recall performance. There are 46,146 total Logical Memory administrations to participants diagnosed with either Alzheimer's disease (AD), vascular dementia (VaD), or normal cognition in the National Alzheimer's Disease Coordinating Center's Uniform Data Set. Only 50% of the sample was administered the standard 20-35 min of delay as specified by WMS-R and WMS-III. We found a significant effect of delay time duration on proportion of information retained for the VaD group compared to its control group, which remained after adding LMI raw score as a covariate. There was poorer retention of information with longer delay for this group. This association was not as strong for the AD and cognitively normal groups. A 24.5-min delay was most optimal for differentiating AD from VaD participants (47.7% classification accuracy), an 18.5-min delay was most optimal for differentiating AD versus normal participants (51.7% classification accuracy), and a 22.5-min delay was most optimal for differentiating VaD versus normal participants (52.9% classification accuracy). Considering diagnostic implications, our findings suggest that test administration should incorporate precise tracking of delay periods. We recommend a 20-min delay with 18-25-min range. Poor classification accuracy based on LM data alone is a reminder that story memory performance is only one piece of data that contributes to complex clinical decisions. However, strict adherence to the recommended range yields optimal data for diagnostic decisions. © The Author 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Optimal control of LQR for discrete time-varying systems with input delays

NASA Astrophysics Data System (ADS)

Yin, Yue-Zhu; Yang, Zhong-Lian; Yin, Zhi-Xiang; Xu, Feng

2018-04-01

In this work, we consider the optimal control problem of linear quadratic regulation for discrete time-variant systems with single input and multiple input delays. An innovative and simple method to derive the optimal controller is given. The studied problem is first equivalently converted into a problem subject to a constraint condition. Last, with the established duality, the problem is transformed into a static mathematical optimisation problem without input delays. The optimal control input solution to minimise performance index function is derived by solving this optimisation problem with two methods. A numerical simulation example is carried out and its results show that our two approaches are both feasible and very effective.

Scheduling algorithms for rapid imaging using agile Cubesat constellations

NASA Astrophysics Data System (ADS)

Nag, Sreeja; Li, Alan S.; Merrick, James H.

2018-02-01

Distributed Space Missions such as formation flight and constellations, are being recognized as important Earth Observation solutions to increase measurement samples over space and time. Cubesats are increasing in size (27U, ∼40 kg in development) with increasing capabilities to host imager payloads. Given the precise attitude control systems emerging in the commercial market, Cubesats now have the ability to slew and capture images within short notice. We propose a modular framework that combines orbital mechanics, attitude control and scheduling optimization to plan the time-varying, full-body orientation of agile Cubesats in a constellation such that they maximize the number of observed images and observation time, within the constraints of Cubesat hardware specifications. The attitude control strategy combines bang-bang and PD control, with constraints such as power consumption, response time, and stability factored into the optimality computations and a possible extension to PID control to account for disturbances. Schedule optimization is performed using dynamic programming with two levels of heuristics, verified and improved upon using mixed integer linear programming. The automated scheduler is expected to run on ground station resources and the resultant schedules uplinked to the satellites for execution, however it can be adapted for onboard scheduling, contingent on Cubesat hardware and software upgrades. The framework is generalizable over small steerable spacecraft, sensor specifications, imaging objectives and regions of interest, and is demonstrated using multiple 20 kg satellites in Low Earth Orbit for two case studies - rapid imaging of Landsat's land and coastal images and extended imaging of global, warm water coral reefs. The proposed algorithm captures up to 161% more Landsat images than nadir-pointing sensors with the same field of view, on a 2-satellite constellation over a 12-h simulation. Integer programming was able to verify that optimality of the dynamic programming solution for single satellites was within 10%, and find up to 5% more optimal solutions. The optimality gap for constellations was found to be 22% at worst, but the dynamic programming schedules were found at nearly four orders of magnitude better computational speed than integer programming. The algorithm can include cloud cover predictions, ground downlink windows or any other spatial, temporal or angular constraints into the orbital module and be integrated into planning tools for agile constellations.

On Time Delay Margin Estimation for Adaptive Control and Optimal Control Modification

NASA Technical Reports Server (NTRS)

Nguyen, Nhan T.

2011-01-01

This paper presents methods for estimating time delay margin for adaptive control of input delay systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent an adaptive law by a locally bounded linear approximation within a small time window. The time delay margin of this input delay system represents a local stability measure and is computed analytically by three methods: Pade approximation, Lyapunov-Krasovskii method, and the matrix measure method. These methods are applied to the standard model-reference adaptive control, s-modification adaptive law, and optimal control modification adaptive law. The windowing analysis results in non-unique estimates of the time delay margin since it is dependent on the length of a time window and parameters which vary from one time window to the next. The optimal control modification adaptive law overcomes this limitation in that, as the adaptive gain tends to infinity and if the matched uncertainty is linear, then the closed-loop input delay system tends to a LTI system. A lower bound of the time delay margin of this system can then be estimated uniquely without the need for the windowing analysis. Simulation results demonstrates the feasibility of the bounded linear stability method for time delay margin estimation.

Optimal Design for Informative Protocols in Xenograft Tumor Growth Inhibition Experiments in Mice.

PubMed

Lestini, Giulia; Mentré, France; Magni, Paolo

2016-09-01

Tumor growth inhibition (TGI) models are increasingly used during preclinical drug development in oncology for the in vivo evaluation of antitumor effect. Tumor sizes are measured in xenografted mice, often only during and shortly after treatment, thus preventing correct identification of some TGI model parameters. Our aims were (i) to evaluate the importance of including measurements during tumor regrowth and (ii) to investigate the proportions of mice included in each arm. For these purposes, optimal design theory based on the Fisher information matrix implemented in PFIM4.0 was applied. Published xenograft experiments, involving different drugs, schedules, and cell lines, were used to help optimize experimental settings and parameters using the Simeoni TGI model. For each experiment, a two-arm design, i.e., control versus treatment, was optimized with or without the constraint of not sampling during tumor regrowth, i.e., "short" and "long" studies, respectively. In long studies, measurements could be taken up to 6 g of tumor weight, whereas in short studies the experiment was stopped 3 days after the end of treatment. Predicted relative standard errors were smaller in long studies than in corresponding short studies. Some optimal measurement times were located in the regrowth phase, highlighting the importance of continuing the experiment after the end of treatment. In the four-arm designs, the results showed that the proportions of control and treated mice can differ. To conclude, making measurements during tumor regrowth should become a general rule for informative preclinical studies in oncology, especially when a delayed drug effect is suspected.

Optimal design for informative protocols in xenograft tumor growth inhibition experiments in mice

PubMed Central

Lestini, Giulia; Mentré, France; Magni, Paolo

2016-01-01

Tumor growth inhibition (TGI) models are increasingly used during preclinical drug development in oncology for the in vivo evaluation of antitumor effect. Tumor sizes are measured in xenografted mice, often only during and shortly after treatment, thus preventing correct identification of some TGI model parameters. Our aims were i) to evaluate the importance of including measurements during tumor regrowth; ii) to investigate the proportions of mice included in each arm. For these purposes, optimal design theory based on the Fisher information matrix implemented in PFIM4.0 was applied. Published xenograft experiments, involving different drugs, schedules and cell lines, were used to help optimize experimental settings and parameters using the Simeoni TGI model. For each experiment, a two-arm design, i.e. control vs treatment, was optimized with or without the constraint of not sampling during tumor regrowth, i.e. “short” and “long” studies, respectively. In long studies, measurements could be taken up to 6 grams of tumor weight, whereas in short studies the experiment was stopped three days after the end of treatment. Predicted relative standard errors were smaller in long studies than in corresponding short studies. Some optimal measurement times were located in the regrowth phase, highlighting the importance of continuing the experiment after the end of treatment. In the four-arm designs, the results showed that the proportions of control and treated mice can differ. To conclude, making measurements during tumor regrowth should become a general rule for informative preclinical studies in oncology, especially when a delayed drug effect is suspected. PMID:27306546

A partial differential equation model and its reduction to an ordinary differential equation model for prostate tumor growth under intermittent hormone therapy.

PubMed

Tao, Youshan; Guo, Qian; Aihara, Kazuyuki

2014-10-01

Hormonal therapy with androgen suppression is a common treatment for advanced prostate tumors. The emergence of androgen-independent cells, however, leads to a tumor relapse under a condition of long-term androgen deprivation. Clinical trials suggest that intermittent androgen suppression (IAS) with alternating on- and off-treatment periods can delay the relapse when compared with continuous androgen suppression (CAS). In this paper, we propose a mathematical model for prostate tumor growth under IAS therapy. The model elucidates initial hormone sensitivity, an eventual relapse of a tumor under CAS therapy, and a delay of a relapse under IAS therapy, which are due to the coexistence of androgen-dependent cells, androgen-independent cells resulting from reversible changes by adaptation, and androgen-independent cells resulting from irreversible changes by genetic mutations. The model is formulated as a free boundary problem of partial differential equations that describe the evolution of populations of the abovementioned three types of cells during on-treatment periods and off-treatment periods. Moreover, the model can be transformed into a piecewise linear ordinary differential equation model by introducing three new volume variables, and the study of the resulting model may help to devise optimal IAS schedules.

Optimizing Air Transportation Service to Metroplex Airports. Part 1; Analysis of Historical Data

NASA Technical Reports Server (NTRS)

Donohue, George; Hoffman, Karla; Sherry, Lance; Ferguson, John; Kara, Abdul Qadar

2010-01-01

The air transportation system is a significant driver of the U.S. economy, providing safe, affordable, and rapid transportation. During the past three decades airspace and airport capacity has not grown in step with demand for air transportation (+4% annual growth), resulting in unreliable service and systemic delays. Estimates of the impact of delays and unreliable air transportation service on the economy range from $32B to $41B per year. This report describes the results of an analysis of airline strategic decision-making with regards to: (1) geographic access, (2) economic access, and (3) airline finances. This analysis evaluated markets-served, scheduled flights, aircraft size, airfares, and profit from 2005-2009. During this period, airlines experienced changes in costs of operation (due to fluctuations in hedged fuel prices), changes in travel demand (due to changes in the economy), and changes in infrastructure capacity (due to the capacity limits at EWR, JFK, and LGA). This analysis captures the impact of the implementation of capacity limits at airports, as well as the effect of increased costs of operation (i.e. hedged fuel prices). The increases in costs of operation serve as a proxy for increased costs per flight that might occur if auctions or congestion pricing are imposed.

Behavioral effects of delayed timeouts from reinforcement.

PubMed

Byrne, Tom; Poling, Alan

2017-03-01

Timeouts are sometimes used in applied settings to reduce target responses, and in some circumstances delays are unavoidably imposed between the onset of a timeout and the offset of the response that produces it. The present study examined the effects of signaled and unsignaled timeouts in rats exposed to concurrent fixed-ratio 1 fixed-ratio 1 schedules of food delivery, where each response on one lever, the location of which changed across conditions, produced both food and a delayed 10-s timeout. Delays of 0 to 38 s were examined. Delayed timeouts often, but not always, substantially reduced the number of responses emitted on the lever that produced timeouts relative to the number emitted on the lever that did not produce timeouts. In general, greater sensitivity was observed to delayed timeouts when they were signaled. These results demonstrate that delayed timeouts, like other delayed consequences, can affect behavior, albeit less strongly than immediate consequences. © 2017 Society for the Experimental Analysis of Behavior.

An Effective Massive Sensor Network Data Access Scheme Based on Topology Control for the Internet of Things.

PubMed

Yi, Meng; Chen, Qingkui; Xiong, Neal N

2016-11-03

This paper considers the distributed access and control problem of massive wireless sensor networks' data access center for the Internet of Things, which is an extension of wireless sensor networks and an element of its topology structure. In the context of the arrival of massive service access requests at a virtual data center, this paper designs a massive sensing data access and control mechanism to improve the access efficiency of service requests and makes full use of the available resources at the data access center for the Internet of things. Firstly, this paper proposes a synergistically distributed buffer access model, which separates the information of resource and location. Secondly, the paper divides the service access requests into multiple virtual groups based on their characteristics and locations using an optimized self-organizing feature map neural network. Furthermore, this paper designs an optimal scheduling algorithm of group migration based on the combination scheme between the artificial bee colony algorithm and chaos searching theory. Finally, the experimental results demonstrate that this mechanism outperforms the existing schemes in terms of enhancing the accessibility of service requests effectively, reducing network delay, and has higher load balancing capacity and higher resource utility rate.

Planning Risk-Based SQC Schedules for Bracketed Operation of Continuous Production Analyzers.

PubMed

Westgard, James O; Bayat, Hassan; Westgard, Sten A

2018-02-01

To minimize patient risk, "bracketed" statistical quality control (SQC) is recommended in the new CLSI guidelines for SQC (C24-Ed4). Bracketed SQC requires that a QC event both precedes and follows (brackets) a group of patient samples. In optimizing a QC schedule, the frequency of QC or run size becomes an important planning consideration to maintain quality and also facilitate responsive reporting of results from continuous operation of high production analytic systems. Different plans for optimizing a bracketed SQC schedule were investigated on the basis of Parvin's model for patient risk and CLSI C24-Ed4's recommendations for establishing QC schedules. A Sigma-metric run size nomogram was used to evaluate different QC schedules for processes of different sigma performance. For high Sigma performance, an effective SQC approach is to employ a multistage QC procedure utilizing a "startup" design at the beginning of production and a "monitor" design periodically throughout production. Example QC schedules are illustrated for applications with measurement procedures having 6-σ, 5-σ, and 4-σ performance. Continuous production analyzers that demonstrate high σ performance can be effectively controlled with multistage SQC designs that employ a startup QC event followed by periodic monitoring or bracketing QC events. Such designs can be optimized to minimize the risk of harm to patients. © 2017 American Association for Clinical Chemistry.

Teaching self-control with qualitatively different reinforcers.

PubMed

Passage, Michael; Tincani, Matt; Hantula, Donald A

2012-01-01

This study examined the effectiveness of using qualitatively different reinforcers to teach self-control to an adolescent boy who had been diagnosed with an intellectual disability. First, he was instructed to engage in an activity without programmed reinforcement. Next, he was instructed to engage in the activity under a two-choice fixed-duration schedule of reinforcement. Finally, he was exposed to self-control training, during which the delay to a more preferred reinforcer was initially short and then increased incrementally relative to the delay to a less preferred reinforcer. Self-control training effectively increased time on task to earn the delayed reinforcer.

Optimizing human activity patterns using global sensitivity analysis.

PubMed

Fairchild, Geoffrey; Hickmann, Kyle S; Mniszewski, Susan M; Del Valle, Sara Y; Hyman, James M

2014-12-01

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule's regularity for a population. We show how to tune an activity's regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

Integrating Reservations and Queuing in Remote Laboratory Scheduling

ERIC Educational Resources Information Center

Lowe, D.

2013-01-01

Remote laboratories (RLs) have become increasingly seen as a useful tool in supporting flexible shared access to scarce laboratory resources. An important element in supporting shared access is coordinating the scheduling of the laboratory usage. Optimized scheduling can significantly decrease access waiting times and improve the utilization level…

Irrigation scheduling by ET and soil water sensing

USDA-ARS?s Scientific Manuscript database

Irrigation scheduling is the process of deciding when, where and how much to irrigate, usually with the goal of optimizing economic return on investment in land, equipment, inputs and personnel. This hour-long seminar presents methods of irrigation scheduling based, on the one hand on estimates of t...

Naval Postgraduate School Scheduling Support System (NPS4)

DTIC Science & Technology

1992-03-01

NPSS ...... .................. 156 2. Final Exam Scheduler .. .......... 159 F. PRESENTATION SYSTEM ... ............. . 160 G. USER INTERFACE... NPSS ...... .................. 185 2. Final Exam Model ... ............ 186 3. The Class Schedulers .. .......... 186 4. Assessment of Problem Model...Information Distribution ....... 150 4.13 NPSS Optimization Process .... ............ . 157 4.14 NPSS Performance ..... ................ . 159 4.15 Department

Evolutionary Scheduler for the Deep Space Network

NASA Technical Reports Server (NTRS)

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

2010-01-01

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

Computing the Expected Cost of an Appointment Schedule for Statistically Identical Customers with Probabilistic Service Times

PubMed Central

Dietz, Dennis C.

2014-01-01

A cogent method is presented for computing the expected cost of an appointment schedule where customers are statistically identical, the service time distribution has known mean and variance, and customer no-shows occur with time-dependent probability. The approach is computationally efficient and can be easily implemented to evaluate candidate schedules within a schedule optimization algorithm. PMID:24605070

Knowledge-Based Scheduling of Arrival Aircraft in the Terminal Area

NASA Technical Reports Server (NTRS)

Krzeczowski, K. J.; Davis, T.; Erzberger, H.; Lev-Ram, Israel; Bergh, Christopher P.

1995-01-01

A knowledge based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real time simulation. The scheduling system automatically sequences, assigns landing times, and assign runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithm is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reductions, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithm is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper describes the scheduling algorithms, gives examples of their use, and presents data regarding their potential benefits to the air traffic system.

Knowledge-based scheduling of arrival aircraft

NASA Technical Reports Server (NTRS)

Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

1995-01-01

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

Optimal Preventive Maintenance Schedule based on Lifecycle Cost and Time-Dependent Reliability

DTIC Science & Technology

2011-11-10

Page 1 of 16 UNCLASSIFIED: Distribution Statement A. Approved for public release. 12IDM-0064 Optimal Preventive Maintenance Schedule based... 1 . INTRODUCTION Customers and product manufacturers demand continued functionality of complex equipment and processes. Degradation of material...Documentation Page Form ApprovedOMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response

Software For Integer Programming

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1992-01-01

Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.

Fog computing job scheduling optimization based on bees swarm

NASA Astrophysics Data System (ADS)

Bitam, Salim; Zeadally, Sherali; Mellouk, Abdelhamid

2018-04-01

Fog computing is a new computing architecture, composed of a set of near-user edge devices called fog nodes, which collaborate together in order to perform computational services such as running applications, storing an important amount of data, and transmitting messages. Fog computing extends cloud computing by deploying digital resources at the premise of mobile users. In this new paradigm, management and operating functions, such as job scheduling aim at providing high-performance, cost-effective services requested by mobile users and executed by fog nodes. We propose a new bio-inspired optimization approach called Bees Life Algorithm (BLA) aimed at addressing the job scheduling problem in the fog computing environment. Our proposed approach is based on the optimized distribution of a set of tasks among all the fog computing nodes. The objective is to find an optimal tradeoff between CPU execution time and allocated memory required by fog computing services established by mobile users. Our empirical performance evaluation results demonstrate that the proposal outperforms the traditional particle swarm optimization and genetic algorithm in terms of CPU execution time and allocated memory.

Optimal estimation of parameters and states in stochastic time-varying systems with time delay

NASA Astrophysics Data System (ADS)

Torkamani, Shahab; Butcher, Eric A.

2013-08-01

In this study estimation of parameters and states in stochastic linear and nonlinear delay differential systems with time-varying coefficients and constant delay is explored. The approach consists of first employing a continuous time approximation to approximate the stochastic delay differential equation with a set of stochastic ordinary differential equations. Then the problem of parameter estimation in the resulting stochastic differential system is represented as an optimal filtering problem using a state augmentation technique. By adapting the extended Kalman-Bucy filter to the resulting system, the unknown parameters of the time-delayed system are estimated from noise-corrupted, possibly incomplete measurements of the states.

Optimal non-linear health insurance.

PubMed

Blomqvist, A

1997-06-01

Most theoretical and empirical work on efficient health insurance has been based on models with linear insurance schedules (a constant co-insurance parameter). In this paper, dynamic optimization techniques are used to analyse the properties of optimal non-linear insurance schedules in a model similar to one originally considered by Spence and Zeckhauser (American Economic Review, 1971, 61, 380-387) and reminiscent of those that have been used in the literature on optimal income taxation. The results of a preliminary numerical example suggest that the welfare losses from the implicit subsidy to employer-financed health insurance under US tax law may be a good deal smaller than previously estimated using linear models.

Bandwidth reduction for video-on-demand broadcasting using secondary content insertion

NASA Astrophysics Data System (ADS)

Golynski, Alexander; Lopez-Ortiz, Alejandro; Poirier, Guillaume; Quimper, Claude-Guy

2005-01-01

An optimal broadcasting scheme under the presence of secondary content (i.e. advertisements) is proposed. The proposed scheme works both for movies encoded in a Constant Bit Rate (CBR) or a Variable Bit Rate (VBR) format. It is shown experimentally that secondary content in movies can make Video-on-Demand (VoD) broadcasting systems more efficient. An efficient algorithm is given to compute the optimal broadcasting schedule with secondary content, which in particular significantly improves over the best previously known algorithm for computing the optimal broadcasting schedule without secondary content.

Using the Autism Diagnostic Interview-Revised and the Autism Diagnostic Observation Schedule with Young Children with Developmental Delay: Evaluating Diagnostic Validity

ERIC Educational Resources Information Center

Gray, Kylie M.; Tonge, Bruce J.; Sweeney, Deborah J.

2008-01-01

Few studies have focused on the validity of the ADI-R and ADOS in the assessment of preschool children with developmental delay. This study aimed to evaluate the diagnostic validity of the ADI-R and the ADOS in young children. Two-hundred and nine children aged 20-55 months participated in the study, 120 of whom received a diagnosis of autism.…

Ford-Class Aircraft Carrier: Congress Should Consider Revising Cost Cap Legislation to Include All Construction Costs

DTIC Science & Technology

2014-11-01

thus increasing the likelihood of additional testing delays. For example, testing of the ship’s fire sprinklers was delayed because construction of...not deploy as scheduled or will deploy without fully tested systems . The Navy is implementing steps to achieve the $11.5 billion congressional cost...cap, by postponing installation of some systems until after ship delivery, and deferring an estimated $200 million - $250 million in previously

Modelling Temporal Schedule of Urban Trains Using Agent-Based Simulation and NSGA2-BASED Multiobjective Optimization Approaches

NASA Astrophysics Data System (ADS)

Sahelgozin, M.; Alimohammadi, A.

2015-12-01

Increasing distances between locations of residence and services leads to a large number of daily commutes in urban areas. Developing subway systems has been taken into consideration of transportation managers as a response to this huge amount of travel demands. In developments of subway infrastructures, representing a temporal schedule for trains is an important task; because an appropriately designed timetable decreases Total passenger travel times, Total Operation Costs and Energy Consumption of trains. Since these variables are not positively correlated, subway scheduling is considered as a multi-criteria optimization problem. Therefore, proposing a proper solution for subway scheduling has been always a controversial issue. On the other hand, research on a phenomenon requires a summarized representation of the real world that is known as Model. In this study, it is attempted to model temporal schedule of urban trains that can be applied in Multi-Criteria Subway Schedule Optimization (MCSSO) problems. At first, a conceptual framework is represented for MCSSO. Then, an agent-based simulation environment is implemented to perform Sensitivity Analysis (SA) that is used to extract the interrelations between the framework components. These interrelations is then taken into account in order to construct the proposed model. In order to evaluate performance of the model in MCSSO problems, Tehran subway line no. 1 is considered as the case study. Results of the study show that the model was able to generate an acceptable distribution of Pareto-optimal solutions which are applicable in the real situations while solving a MCSSO is the goal. Also, the accuracy of the model in representing the operation of subway systems was significant.

Multi-time Scale Joint Scheduling Method Considering the Grid of Renewable Energy

NASA Astrophysics Data System (ADS)

Zhijun, E.; Wang, Weichen; Cao, Jin; Wang, Xin; Kong, Xiangyu; Quan, Shuping

2018-01-01

Renewable new energy power generation prediction error like wind and light, brings difficulties to dispatch the power system. In this paper, a multi-time scale robust scheduling method is set to solve this problem. It reduces the impact of clean energy prediction bias to the power grid by using multi-time scale (day-ahead, intraday, real time) and coordinating the dispatching power output of various power supplies such as hydropower, thermal power, wind power, gas power and. The method adopts the robust scheduling method to ensure the robustness of the scheduling scheme. By calculating the cost of the abandon wind and the load, it transforms the robustness into the risk cost and optimizes the optimal uncertainty set for the smallest integrative costs. The validity of the method is verified by simulation.

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

Real-time distributed scheduling algorithm for supporting QoS over WDM networks

NASA Astrophysics Data System (ADS)

Kam, Anthony C.; Siu, Kai-Yeung

1998-10-01

Most existing or proposed WDM networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently they are not suitable for data applications involving bursty traffic patterns. The MIT AON Consortium has developed an all-optical LAN/MAN testbed which provides time-slotted WDM service and employs fast-tunable transceivers in each optical terminal. In this paper, we explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time-sharing the wavelengths in a fair manner. In particular, we develop a real-time distributed protocol for best-effort traffic over this time-slotted WDM service with near-optical fairness and throughput characteristics. As an additional design feature, our protocol supports the allocation of guaranteed bandwidths to selected connections. This feature acts as a first step towards supporting integrated services and quality-of-service guarantees over WDM networks. To achieve high throughput, our approach is based on scheduling transmissions, as opposed to collision- based schemes. Our distributed protocol involves one MAN scheduler and several LAN schedulers (one per LAN) in a master-slave arrangement. Because of propagation delays and limits on control channel capacities, all schedulers are designed to work with partial, delayed traffic information. Our distributed protocol is of the `greedy' type to ensure fast execution in real-time in response to dynamic traffic changes. It employs a hybrid form of rate and credit control for resource allocation. We have performed extensive simulations, which show that our protocol allocates resources (transmitters, receivers, wavelengths) fairly with high throughput, and supports bandwidth guarantees.

Systems Engineering Using Heritage Spacecraft Technology: Lessons Learned from Discovery and New Frontiers Deep Space Missions

NASA Technical Reports Server (NTRS)

Barley, Bryan; Newhouse, Marilyn; Clardy, Dennon

2011-01-01

In the design and development of complex spacecraft missions, project teams frequently assume the use of advanced technology or heritage systems to enable a mission or reduce the overall mission risk and cost. As projects proceed through the development life cycle, increasingly detailed knowledge of the advanced or heritage systems and the system environment identifies unanticipated issues that result in cost overruns or schedule impacts. The Discovery & New Frontiers (D&NF) Program Office recently studied cost overruns and schedule delays resulting from advanced technology or heritage assumptions for 6 D&NF missions. The goal was to identify the underlying causes for the overruns and delays, and to develop practical mitigations to assist the D&NF projects in identifying potential risks and controlling the associated impacts to proposed mission costs and schedules. The study found that the cost and schedule growth did not result from technical hurdles requiring significant technology development. Instead, systems engineering processes did not identify critical issues early enough in the design cycle to ensure project schedules and estimated costs address the inherent risks. In general, the overruns were traceable to: inadequate understanding of the heritage system s behavior within the proposed spacecraft design and mission environment; an insufficient level of experience with the heritage system; or an inadequate scoping of the system-wide impacts necessary to implement the heritage or advanced technology. This presentation summarizes the study s findings and offers suggestions for improving the project s ability to identify and manage the risks inherent in the technology and heritage design solution.

Surgical scheduling: a lean approach to process improvement.

PubMed

Simon, Ross William; Canacari, Elena G

2014-01-01

A large teaching hospital in the northeast United States had an inefficient, paper-based process for scheduling orthopedic surgery that caused delays and contributed to site/side discrepancies. The hospital's leaders formed a team with the goals of developing a safe, effective, patient-centered, timely, efficient, and accurate orthopedic scheduling process; smoothing the schedule so that block time was allocated more evenly; and ensuring correct site/side. Under the resulting process, real-time patient information is entered into a database during the patient's preoperative visit in the surgeon's office. The team found the new process reduced the occurrence of site/side discrepancies to zero, reduced instances of changing the sequence of orthopedic procedures by 70%, and increased patient satisfaction. Copyright © 2014 AORN, Inc. Published by Elsevier Inc. All rights reserved.

The Carrier's Liability for Damage Caused by Delay in International Air Transport

NASA Technical Reports Server (NTRS)

Lee, Kang Bin

2003-01-01

Delay in the air transport occurs when passengers, baggage or cargo do not arrive at their destination at the time indicated in the contract of carriage. The causes of delay in the carriage of passengers are booking errors or double booking, delayed departure of aircraft, incorrect information regarding the time of departure, failure to land at the scheduled destination and changes in flight schedule or addition of extra landing stops. Delay in the carriage of baggage or cargo may have different causes: no reservation, lack of space, failure to load the baggage or cargo at the right place, or to deliver the covering documents at the right place. The Montreal Convention of 1999 Article 19 provides that 'The carrier is liable for damage occasioned by delay in the carriage by air of passengers, baggage or cargo. Nevertheless, the carder shall not be liable for damage occasioned by delay if it proves that it and its servants and agents took all measures that could reasonably be required to avoid the damage or that it was impossible for it or them to take such measures'. The Montreal Convention Article 22 provides liability limits of the carrier in case of delay for passengers and their baggage and for cargo. In the carriage of persons, the liability of the carrier for each passenger is limited to 4,150 SDR. In the carriage of baggage, the liability of the carrier is limited to 1,000 SDR for each passenger unless a special declaration as to the value of the baggage has been made. In the carriage of cargo, the liability of the carrier is limited to 17 SDR per kilogram unless a special declaration as to the value of the cargo has been made. The Montreal Convention Article 19 has shortcomings: it is silent on the duration of the liability for carriage,andit does not make any distinction between persons and good. It does not give any indication concerning the circumstances to be taken into account in cases of delay, and about the length of delay. In conclusion, it is desirable to define the period of carriage with accuracy, and to insert the word 'unreasonable' in Article 19.

Delayed growth

MedlinePlus

Growth - slow (child 0 - 5 years); Weight gain - slow (child 0 - 5 years); Slow rate of growth; Retarded growth and development; ... A child should have regular, well-baby check-ups with a health care provider. These checkups are usually scheduled ...

Surveillance and Delay Advisory System

DOT National Transportation Integrated Search

1999-08-01

The Federal Highway Administration's Office of Motor Carrier and Highway Safety began a 4-year research project in September 1997 to evaluate the role of motor carrier scheduling practices in interstate commercial motor vehicle (CMV) driver fatigue. ...

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

DOE PAGES

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu; ...

2017-11-03

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

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

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

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.

Beam Design and User Scheduling for Nonorthogonal Multiple Access With Multiple Antennas Based on Pareto Optimality

NASA Astrophysics Data System (ADS)

Seo, Junyeong; Sung, Youngchul

2018-06-01

In this paper, an efficient transmit beam design and user scheduling method is proposed for multi-user (MU) multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) downlink, based on Pareto-optimality. The proposed beam design and user scheduling method groups simultaneously-served users into multiple clusters with practical two users in each cluster, and then applies spatical zeroforcing (ZF) across clusters to control inter-cluster interference (ICI) and Pareto-optimal beam design with successive interference cancellation (SIC) to two users in each cluster to remove interference to strong users and leverage signal-to-interference-plus-noise ratios (SINRs) of interference-experiencing weak users. The proposed method has flexibility to control the rates of strong and weak users and numerical results show that the proposed method yields good performance.

Determining optimal selling price and lot size with process reliability and partial backlogging considerations

NASA Astrophysics Data System (ADS)

Hsieh, Tsu-Pang; Cheng, Mei-Chuan; Dye, Chung-Yuan; Ouyang, Liang-Yuh

2011-01-01

In this article, we extend the classical economic production quantity (EPQ) model by proposing imperfect production processes and quality-dependent unit production cost. The demand rate is described by any convex decreasing function of the selling price. In addition, we allow for shortages and a time-proportional backlogging rate. For any given selling price, we first prove that the optimal production schedule not only exists but also is unique. Next, we show that the total profit per unit time is a concave function of price when the production schedule is given. We then provide a simple algorithm to find the optimal selling price and production schedule for the proposed model. Finally, we use a couple of numerical examples to illustrate the algorithm and conclude this article with suggestions for possible future research.

Optimal scheduling of micro grids based on single objective programming

NASA Astrophysics Data System (ADS)

Chen, Yue

2018-04-01

Faced with the growing demand for electricity and the shortage of fossil fuels, how to optimally optimize the micro-grid has become an important research topic to maximize the economic, technological and environmental benefits of the micro-grid. This paper considers the role of the battery and the micro-grid and power grid to allow the exchange of power not exceeding 150kW preconditions, the main study of the economy to load for the goal is to minimize the electricity cost (abandonment of wind), to establish an optimization model, and to solve the problem by genetic algorithm. The optimal scheduling scheme is obtained and the utilization of renewable energy and the impact of the battery involved in regulation are analyzed.

Research on logistics scheduling based on PSO

NASA Astrophysics Data System (ADS)

Bao, Huifang; Zhou, Linli; Liu, Lei

2017-08-01

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

On the theory of singular optimal controls in dynamic systems with control delay

NASA Astrophysics Data System (ADS)

Mardanov, M. J.; Melikov, T. K.

2017-05-01

An optimal control problem with a control delay is considered, and a more broad class of singular (in classical sense) controls is investigated. Various sequences of necessary conditions for the optimality of singular controls in recurrent form are obtained. These optimality conditions include analogues of the Kelley, Kopp-Moyer, R. Gabasov, and equality-type conditions. In the proof of the main results, the variation of the control is defined using Legendre polynomials.

The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

NASA Technical Reports Server (NTRS)

Shinn, Stephen A.; Bryson, Jonathan; Klein, Gerald; Lunz-Ruark, Val; Majerowicz, Walt; McKeever, J.; Nair, Param

2016-01-01

Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

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

NASA Astrophysics Data System (ADS)

Hakim, L.; Bakhtiar, T.; Jaharuddin

2017-01-01

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

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

DTIC Science & Technology

2010-03-01

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

Optimization of nas lemoore scheduling to support a growing aircraft population

DTIC Science & Technology

2017-03-01

requirements, and, without knowing the other squadrons’ flight plans , creates his or her squadron’s flight schedule. Figure 2 illustrates the process each...Lemoore, they do not communicate their flight schedules among themselves; hence, the daily flight plan generated by each squadron is independently...manual process for aircraft flight scheduling at Naval Air Station (NAS) Lemoore accommodates the independent needs of 16 fighter resident squadrons as

Stochastic flow shop scheduling of overlapping jobs on tandem machines in application to optimizing the US Army's deliberate nuclear, biological, and chemical decontamination process, (final report). Master's thesis

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

Novikov, V.

1991-05-01

The U.S. Army's detailed equipment decontamination process is a stochastic flow shop which has N independent non-identical jobs (vehicles) which have overlapping processing times. This flow shop consists of up to six non-identical machines (stations). With the exception of one station, the processing times of the jobs are random variables. Based on an analysis of the processing times, the jobs for the 56 Army heavy division companies were scheduled according to the best shortest expected processing time - longest expected processing time (SEPT-LEPT) sequence. To assist in this scheduling the Gap Comparison Heuristic was developed to select the best SEPT-LEPTmore » schedule. This schedule was then used in balancing the detailed equipment decon line in order to find the best possible site configuration subject to several constraints. The detailed troop decon line, in which all jobs are independent and identically distributed, was then balanced. Lastly, an NBC decon optimization computer program was developed using the scheduling and line balancing results. This program serves as a prototype module for the ANBACIS automated NBC decision support system.... Decontamination, Stochastic flow shop, Scheduling, Stochastic scheduling, Minimization of the makespan, SEPT-LEPT Sequences, Flow shop line balancing, ANBACIS.« less

User’s guide to SNAP for ArcGIS® :ArcGIS interface for scheduling and network analysis program

Treesearch

Woodam Chung; Dennis Dykstra; Fred Bower; Stephen O’Brien; Richard Abt; John. and Sessions

2012-01-01

This document introduces a computer software named SNAP for ArcGIS® , which has been developed to streamline scheduling and transportation planning for timber harvest areas. Using modern optimization techniques, it can be used to spatially schedule timber harvest with consideration of harvesting costs, multiple products, alternative...

Set covering algorithm, a subprogram of the scheduling algorithm for mission planning and logistic evaluation

NASA Technical Reports Server (NTRS)

Chang, H.

1976-01-01

A computer program using Lemke, Salkin and Spielberg's Set Covering Algorithm (SCA) to optimize a traffic model problem in the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) was documented. SCA forms a submodule of SAMPLE and provides for input and output, subroutines, and an interactive feature for performing the optimization and arranging the results in a readily understandable form for output.

Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

PubMed Central

Wan, Long

2014-01-01

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example. PMID:25147861

Model-based optimization of G-CSF treatment during cytotoxic chemotherapy.

PubMed

Schirm, Sibylle; Engel, Christoph; Loibl, Sibylle; Loeffler, Markus; Scholz, Markus

2018-02-01

Although G-CSF is widely used to prevent or ameliorate leukopenia during cytotoxic chemotherapies, its optimal use is still under debate and depends on many therapy parameters such as dosing and timing of cytotoxic drugs and G-CSF, G-CSF pharmaceuticals used and individual risk factors of patients. We integrate available biological knowledge and clinical data regarding cell kinetics of bone marrow granulopoiesis, the cytotoxic effects of chemotherapy and pharmacokinetics and pharmacodynamics of G-CSF applications (filgrastim or pegfilgrastim) into a comprehensive model. The model explains leukocyte time courses of more than 70 therapy scenarios comprising 10 different cytotoxic drugs. It is applied to develop optimized G-CSF schedules for a variety of clinical scenarios. Clinical trial results showed validity of model predictions regarding alternative G-CSF schedules. We propose modifications of G-CSF treatment for the chemotherapies 'BEACOPP escalated' (Hodgkin's disease), 'ETC' (breast cancer), and risk-adapted schedules for 'CHOP-14' (aggressive non-Hodgkin's lymphoma in elderly patients). We conclude that we established a model of human granulopoiesis under chemotherapy which allows predictions of yet untested G-CSF schedules, comparisons between them, and optimization of filgrastim and pegfilgrastim treatment. As a general rule of thumb, G-CSF treatment should not be started too early and patients could profit from filgrastim treatment continued until the end of the chemotherapy cycle.

Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

PubMed Central

Zhang, Guang-Qian; Wang, Jian-Jun; Liu, Ya-Jing

2014-01-01

m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem. PMID:24982933

Hubble Systems Optimize Hospital Schedules

NASA Technical Reports Server (NTRS)

2009-01-01

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

Cascaded Optimization for a Persistent Data Ferrying Unmanned Aircraft

NASA Astrophysics Data System (ADS)

Carfang, Anthony

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

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.

Minimizing metastatic risk in radiotherapy fractionation schedules

NASA Astrophysics Data System (ADS)

Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin

2015-11-01

Metastasis is the process by which cells from a primary tumor disperse and form new tumors at distant anatomical locations. The treatment and prevention of metastatic cancer remains an extremely challenging problem. This work introduces a novel biologically motivated objective function to the radiation optimization community that takes into account metastatic risk instead of the status of the primary tumor. In this work, we consider the problem of developing fractionated irradiation schedules that minimize production of metastatic cancer cells while keeping normal tissue damage below an acceptable level. A dynamic programming framework is utilized to determine the optimal fractionation scheme. We evaluated our approach on a breast cancer case using the heart and the lung as organs-at-risk (OAR). For small tumor α /β values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger α /β values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the α /β values of the OARs, and the normal tissue sparing factors. Interestingly, in contrast to standard models, hypo-fractionated and semi-hypo-fractionated schedules (large initial doses with doses tapering off with time) were suggested even with large tumor α/β values. Numerical results indicate the potential for significant reduction in metastatic risk.

Minimizing delays in the Jordanian construction industry by adopting BIM technology

NASA Astrophysics Data System (ADS)

Btoush, M.; Harun, A. T.

2017-11-01

The Jordanian construction industry plays a significant role and contributes immensely to the gross domestic product (GDP) of the economy. However, the Jordanian public work and housing ministry and most industry players including engineers and contractors have reported that most of the projects experience delays which lead time and cost overruns, and extra efforts. The main causes of delays identified by researchers include poor scheduling and planning, change orders, site conditions, weather, late deliveries, incompetent technical staff. To address these challenges, the implementation of building information modelling (BIM) is paramount. This paper presents BIM as a powerful tool for reducing delays in Jordan construction projects. The paper focuses on two main parts; the first part involves the identification of the major causes of delays, and the second part is to accurately outline the roles and responsibilities of BIM specialist in construction projects. Finally, the paper matches the roles and responsibilities of BIM specialist and the causes of delays, and how the delays are addressed through BIM specialist.

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

NASA Astrophysics Data System (ADS)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

When good pigeons make bad decisions: Choice with probabilistic delays and outcomes.

PubMed

Pisklak, Jeffrey M; McDevitt, Margaret A; Dunn, Roger M; Spetch, Marcia L

2015-11-01

Pigeons chose between an (optimal) alternative that sometimes provided food after a 10-s delay and other times after a 40-s delay and another (suboptimal) alternative that sometimes provided food after 10 s but other times no food after 40 s. When outcomes were not signaled during the delays, pigeons strongly preferred the optimal alternative. When outcomes were signaled, choices of the suboptimal alternative increased and most pigeons preferred the alternative that provided no food after the long delay despite the cost in terms of obtained food. The pattern of results was similar whether the short delays occurred on 25% or 50% of the trials. Shortening the 40-s delay to food sharply reduced suboptimal choices, but shortening the delay to no food had little effect. The results suggest that a signaled delay to no food does not punish responding in probabilistic choice procedures. The findings are discussed in terms of conditioned reinforcement by signals for good news. © Society for the Experimental Analysis of Behavior.

Application of Hybrid Optimization-Expert System for Optimal Power Management on Board Space Power Station

NASA Technical Reports Server (NTRS)

Momoh, James; Chattopadhyay, Deb; Basheer, Omar Ali AL

1996-01-01

The space power system has two sources of energy: photo-voltaic blankets and batteries. The optimal power management problem on-board has two broad operations: off-line power scheduling to determine the load allocation schedule of the next several hours based on the forecast of load and solar power availability. The nature of this study puts less emphasis on speed requirement for computation and more importance on the optimality of the solution. The second category problem, on-line power rescheduling, is needed in the event of occurrence of a contingency to optimally reschedule the loads to minimize the 'unused' or 'wasted' energy while keeping the priority on certain type of load and minimum disturbance of the original optimal schedule determined in the first-stage off-line study. The computational performance of the on-line 'rescheduler' is an important criterion and plays a critical role in the selection of the appropriate tool. The Howard University Center for Energy Systems and Control has developed a hybrid optimization-expert systems based power management program. The pre-scheduler has been developed using a non-linear multi-objective optimization technique called the Outer Approximation method and implemented using the General Algebraic Modeling System (GAMS). The optimization model has the capability of dealing with multiple conflicting objectives viz. maximizing energy utilization, minimizing the variation of load over a day, etc. and incorporates several complex interaction between the loads in a space system. The rescheduling is performed using an expert system developed in PROLOG which utilizes a rule-base for reallocation of the loads in an emergency condition viz. shortage of power due to solar array failure, increase of base load, addition of new activity, repetition of old activity etc. Both the modules handle decision making on battery charging and discharging and allocation of loads over a time-horizon of a day divided into intervals of 10 minutes. The models have been extensively tested using a case study for the Space Station Freedom and the results for the case study will be presented. Several future enhancements of the pre-scheduler and the 'rescheduler' have been outlined which include graphic analyzer for the on-line module, incorporating probabilistic considerations, including spatial location of the loads and the connectivity using a direct current (DC) load flow model.

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

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.

Cancellation of scheduled procedures as a mechanism to generate hospital bed surge capacity-a pilot study.

PubMed

Soremekun, Olan A; Zane, Richard D; Walls, Andrew; Allen, Matthew B; Seefeld, Kimberly J; Pallin, Daniel J

2011-06-01

The ability to generate hospital beds in response to a mass-casualty incident is an essential component of public health preparedness. Although many acute care hospitals' emergency response plans include some provision for delaying or cancelling elective procedures in the event of an inpatient surge, no standardized method for implementing and quantifying the impact of this strategy exists in the literature. The aim of this study was to develop a methodology to prospectively emergency plan for implementing a strategy of delaying procedures and quantifying the potential impact of this strategy on creating hospital bed capacity. This is a pilot study. A categorization methodology was devised and applied retrospectively to all scheduled procedures during four one-week periods chosen by convenience. The categorization scheme grouped procedures into four categories: (A) procedures with no impact on inpatient capacity; (B) procedures that could be delayed indefinitely; (C) procedures that could be delayed by one week; and (D) procedures that could not be delayed. The categorization scheme was applied by two research assistants and an emergency medicine resident. All three raters categorized the first 100 cases to allow for calculation of inter-rater reliability. Maximal hospital bed capacity was defined as the 95th percentile weekday occupancy, as this is more representative of functional bed capacity than is the number of licensed beds. The main outcome was the number of hospital beds that could be created by postponing procedures in categories B and C. Maximal hospital bed capacity was 816 beds. Mean occupancy during weekdays was 759 versus 694 on weekends. By postponing Group B and C procedures, a mean of 60 beds (51 general medical/surgical and nine intensive care unit (ICU)) could be created on weekdays, and four beds (three general medical/surgical and one ICU) on weekends. This represents 7.3% and 0.49% of maximal hospital bed capacity and ICU capacity, respectively. In the event that sustained surge is needed, delaying all category B and C procedures for one week would lead to the generation of 1,235 hospital-bed days. Inter-rater reliability was high (kappa = 0.74) indicating good agreement between all three raters. For the institution studied, the strategy of delaying scheduled procedures could generate inpatient capacity with maximal impact during weekdays and little impact on weekends. Future research is needed to validate the categorization scheme and increase the ability to predict inpatient surge capacity across various hospital types and sizes.

Based new WiMax simulation model to investigate Qos with OPNET modeler in sheduling environment

NASA Astrophysics Data System (ADS)

Saini, Sanju; Saini, K. K.

2012-11-01

WiMAX stands for World Interoperability for Microwave Access. It is considered a major part of broadband wireless network having the IEEE 802.16 standard. WiMAX provides innovative, fixed as well as mobile platforms for broadband internet access anywhere anytime with different transmission modes. The results show approximately equal load and throughput while the delay values vary among the different Base Stations Introducing the various type of scheduling algorithm, like FIFO,PQ,WFQ, for comparison of four type of scheduling service, with its own QoS needs and also introducing OPNET modeler support for Worldwide Interoperability for Microwave Access (WiMAX) network. The simulation results indicate the correctness and the effectiveness of this algorithm. This paper presents a WiMAX simulation model designed with OPNET modeler 14 to measure the delay, load and the throughput performance factors.

Experience With Wound VAC and Delayed Primary Closure of Contaminated Soft Tissue Injuries in Iraq

DTIC Science & Technology

2006-11-01

wound was definitively closed by delayed primary closure, flap mobilization, or split-thickness skin grafting . The VAC system was also used...postoperatively for 3 to 5 days over skin grafts , then removed at the bedside to assess graft take. Granulation tissue was not a prerequisite for wound closure...hospital until the closed wounds were clean and dry with good skin graft incorporation. All patients were scheduled for follow-up in our outpatient

Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

PubMed Central

Jin, Junchen

2016-01-01

The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality. PMID:27436998

Chronic Artificial Blue-Enriched White Light Is an Effective Countermeasure to Delayed Circadian Phase and Neurobehavioral Decrements

PubMed Central

Najjar, Raymond P.; Wolf, Luzian; Taillard, Jacques; Schlangen, Luc J. M.; Salam, Alex

2014-01-01

Studies in Polar Base stations, where personnel have no access to sunlight during winter, have reported circadian misalignment, free-running of the sleep-wake rhythm, and sleep problems. Here we tested light as a countermeasure to circadian misalignment in personnel of the Concordia Polar Base station during the polar winter. We hypothesized that entrainment of the circadian pacemaker to a 24-h light-dark schedule would not occur in all crew members (n = 10) exposed to 100–300 lux of standard fluorescent white (SW) light during the daytime, and that chronic non-time restricted daytime exposure to melanopsin-optimized blue-enriched white (BE) light would establish an a stable circadian phase, in participants, together with increased cognitive performance and mood levels. The lighting schedule consisted of an alternation between SW lighting (2 weeks), followed by a BE lighting (2 weeks) for a total of 9 weeks. Rest-activity cycles assessed by actigraphy showed a stable rest-activity pattern under both SW and BE light. No difference was found between light conditions on the intra-daily stability, variability and amplitude of activity, as assessed by non-parametric circadian analysis. As hypothesized, a significant delay of about 30 minutes in the onset of melatonin secretion occurred with SW, but not with BE light. BE light significantly enhanced well being and alertness compared to SW light. We propose that the superior efficacy of blue-enriched white light versus standard white light involves melanopsin-based mechanisms in the activation of the non-visual functions studied, and that their responses do not dampen with time (over 9-weeks). This work could lead to practical applications of light exposure in working environment where background light intensity is chronically low to moderate (polar base stations, power plants, space missions, etc.), and may help design lighting strategies to maintain health, productivity, and personnel safety. PMID:25072880

Sleep patterns in high school and university students: a longitudinal study.

PubMed

Urner, Martin; Tornic, Jure; Bloch, Konrad E

2009-08-01

We performed a longitudinal study to investigate whether changes in social zeitgebers and age alter sleep patterns in students during the transition from high school to university. Actimetry was performed on 24 high-school students (mean age+/-SD: 18.4+/-0.9 yrs; 12 females) for two weeks. Recordings were repeated in the same subjects 5 yrs later when they were university students. The sleep period duration and its center, the mid-sleep time, and total sleep time were estimated by actimetry. Actigraphic total sleep time was similar when in high school and at the university on school days (6.31+/-0.47 vs. 6.45+/-0.80 h, p = ns) and longer on leisure days by 1.10+/-1.10 h (p < 0.0001 vs. school days) when in high school, but not at the university. Compared to the high school situation, the mid-sleep time was delayed when at the university on school days (03:11+/-0.6 vs. 03:55+/-0.7 h, p < 0.0001), but not on leisure days. Individual mid-sleep times on school and leisure days when in high school were significantly correlated with the corresponding values 5 yrs later when at the university (r = 0.58 and r = 0.55, p < 0.05, respectively). The large differences in total sleep time between school and leisure days when students attended high school and the delayed mid-sleep time on school days when students attended university are consistent with a circadian phase shift due to changes in class schedules, other zeitgebers, and lifestyle preferences. Age-related changes may also have occurred, although some individuality of the sleep pattern was maintained during the 5 yr study span. These findings have important implications for optimizing school and work schedules in students of different age and level of education.

Autonomous Hybrid Priority Queueing for Scheduling Residential Energy Demands

NASA Astrophysics Data System (ADS)

Kalimullah, I. Q.; Shamroukh, M.; Sahar, N.; Shetty, S.

2017-05-01

The advent of smart grid technologies has opened up opportunities to manage the energy consumption of the users within a residential smart grid system. Demand response management is particularly being employed to reduce the overall load on an electricity network which could in turn reduce outages and electricity costs. The objective of this paper is to develop an intelligible scheduler to optimize the energy available to a micro grid through hybrid queueing algorithm centered around the consumers’ energy demands. This is achieved by shifting certain schedulable load appliances to light load hours. Various factors such as the type of demand, grid load, consumers’ energy usage patterns and preferences are considered while formulating the logical constraints required for the algorithm. The algorithm thus obtained is then implemented in MATLAB workspace to simulate its execution by an Energy Consumption Scheduler (ECS) found within smart meters, which automatically finds the optimal energy consumption schedule tailor made to fit each consumer within the micro grid network.

Using the principles of circadian physiology enhances shift schedule design

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

Connolly, J.J.; Moore-Ede, M.C.

1987-01-01

Nuclear power plants must operate 24 h, 7 days a week. For the most part, shift schedules currently in use at nuclear power plants have been designed to meet operational needs without considering the biological clocks of the human operators. The development of schedules that also take circadian principles into account is a positive step that can be taken to improve plant safety by optimizing operator alertness. These schedules reduce the probability of human errors especially during backshifts. In addition, training programs that teach round-the-clock workers how to deal with the problems of shiftwork can help to optimize performance andmore » alertness. These programs teach shiftworkers the underlying causes of the sleep problems associated with shiftwork and also provide coping strategies for improving sleep and dealing with the transition between shifts. When these training programs are coupled with an improved schedule, the problems associated with working round-the-clock can be significantly reduced.« less

Neural Network Prediction of New Aircraft Design Coefficients

NASA Technical Reports Server (NTRS)

Norgaard, Magnus; Jorgensen, Charles C.; Ross, James C.

1997-01-01

This paper discusses a neural network tool for more effective aircraft design evaluations during wind tunnel tests. Using a hybrid neural network optimization method, we have produced fast and reliable predictions of aerodynamical coefficients, found optimal flap settings, and flap schedules. For validation, the tool was tested on a 55% scale model of the USAF/NASA Subsonic High Alpha Research Concept aircraft (SHARC). Four different networks were trained to predict coefficients of lift, drag, moment of inertia, and lift drag ratio (C(sub L), C(sub D), C(sub M), and L/D) from angle of attack and flap settings. The latter network was then used to determine an overall optimal flap setting and for finding optimal flap schedules.

Multi-time scale energy management of wind farms based on comprehensive evaluation technology

NASA Astrophysics Data System (ADS)

Xu, Y. P.; Huang, Y. H.; Liu, Z. J.; Wang, Y. F.; Li, Z. Y.; Guo, L.

2017-11-01

A novel energy management of wind farms is proposed in this paper. Firstly, a novel comprehensive evaluation system is proposed to quantify economic properties of each wind farm to make the energy management more economical and reasonable. Then, a combination of multi time-scale schedule method is proposed to develop a novel energy management. The day-ahead schedule optimizes unit commitment of thermal power generators. The intraday schedule is established to optimize power generation plan for all thermal power generating units, hydroelectric generating sets and wind power plants. At last, the power generation plan can be timely revised in the process of on-line schedule. The paper concludes with simulations conducted on a real provincial integrated energy system in northeast China. Simulation results have validated the proposed model and corresponding solving algorithms.

Optimal Shift Duration and Sequence: Recommended Approach for Short-Term Emergency Response Activations for Public Health and Emergency Management

PubMed Central

Burgess, Paula A.

2007-01-01

Since September 11, 2001, and the consequent restructuring of the US preparedness and response activities, public health workers are increasingly called on to activate a temporary round-the-clock staffing schedule. These workers may have to make key decisions that could significantly impact the health and safety of the public. The unique physiological demands of rotational shift work and night shift work have the potential to negatively impact decisionmaking ability. A responsible, evidence-based approach to scheduling applies the principles of circadian physiology, as well as unique individual physiologies and preferences. Optimal scheduling would use a clockwise (morning-afternoon-night) rotational schedule: limiting night shifts to blocks of 3, limiting shift duration to 8 hours, and allowing 3 days of recuperation after night shifts. PMID:17413074

Optimization Models for Scheduling of Jobs

PubMed Central

Indika, S. H. Sathish; Shier, Douglas R.

2006-01-01

This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignments for these jobs are assumed to be known. We are interested in how best to schedule a number of new jobs that the facility will be processing in the near future. We first develop a mixed integer quadratic programming model (MIQP) for this problem. Since the exact solution of this MIQP formulation is time consuming, we develop a heuristic procedure, based on existing bin packing techniques. This heuristic is further enhanced by application of certain local optimality conditions. PMID:27274921

Artificial Bee Colony Optimization for Short-Term Hydrothermal Scheduling

NASA Astrophysics Data System (ADS)

Basu, M.

2014-12-01

Artificial bee colony optimization is applied to determine the optimal hourly schedule of power generation in a hydrothermal system. Artificial bee colony optimization is a swarm-based algorithm inspired by the food foraging behavior of honey bees. The algorithm is tested on a multi-reservoir cascaded hydroelectric system having prohibited operating zones and thermal units with valve point loading. The ramp-rate limits of thermal generators are taken into consideration. The transmission losses are also accounted for through the use of loss coefficients. The algorithm is tested on two hydrothermal multi-reservoir cascaded hydroelectric test systems. The results of the proposed approach are compared with those of differential evolution, evolutionary programming and particle swarm optimization. From numerical results, it is found that the proposed artificial bee colony optimization based approach is able to provide better solution.

Scheduling, revenue management, and fairness in an academic-hospital radiology division.

PubMed

Baum, Richard; Bertsimas, Dimitris; Kallus, Nathan

2014-10-01

Physician staff of academic hospitals today practice in several geographic locations including their main hospital. This is referred to as the extended campus. With extended campuses expanding, the growing complexity of a single division's schedule means that a naive approach to scheduling compromises revenue. Moreover, it may provide an unfair allocation of individual revenue, desirable or burdensome assignments, and the extent to which the preferences of each individual are met. This has adverse consequences on incentivization and employee satisfaction and is simply against business policy. We identify the daily scheduling of physicians in this context as an operational problem that incorporates scheduling, revenue management, and fairness. Noting previous success of operations research and optimization in each of these disciplines, we propose a simple unified optimization formulation of this scheduling problem using mixed-integer optimization. Through a study of implementing the approach at the Division of Angiography and Interventional Radiology at the Brigham and Women's Hospital, which is directed by one of the authors, we exemplify the flexibility of the model to adapt to specific applications, the tractability of solving the model in practical settings, and the significant impact of the approach, most notably in increasing revenue by 8.2% over previous operating revenue while adhering strictly to a codified fairness and objectivity. We found that the investment in implementing such a system is far outweighed by the large potential revenue increase and the other benefits outlined. Copyright © 2014 AUR. Published by Elsevier Inc. All rights reserved.

Deep Space Network Scheduling Using Evolutionary Computational Methods

NASA Technical Reports Server (NTRS)

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

2007-01-01

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

Reliability-based optimization of maintenance scheduling of mechanical components under fatigue

PubMed Central

Beaurepaire, P.; Valdebenito, M.A.; Schuëller, G.I.; Jensen, H.A.

2012-01-01

This study presents the optimization of the maintenance scheduling of mechanical components under fatigue loading. The cracks of damaged structures may be detected during non-destructive inspection and subsequently repaired. Fatigue crack initiation and growth show inherent variability, and as well the outcome of inspection activities. The problem is addressed under the framework of reliability based optimization. The initiation and propagation of fatigue cracks are efficiently modeled using cohesive zone elements. The applicability of the method is demonstrated by a numerical example, which involves a plate with two holes subject to alternating stress. PMID:23564979

Asymptotic analysis of SPTA-based algorithms for no-wait flow shop scheduling problem with release dates.

PubMed

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

PubMed Central

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms. PMID:24764774

Visually Exploring Transportation Schedules.

PubMed

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

2016-01-01

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

Later school start time is associated with improved sleep and daytime functioning in adolescents.

PubMed

Boergers, Julie; Gable, Christopher J; Owens, Judith A

2014-01-01

Chronic insufficient sleep is a growing concern among adolescents and is associated with a host of adverse health consequences. Early school start times may be an environmental contributor to this problem. The purpose of this study was to examine the impact of a delay in school start time on sleep patterns, sleepiness, mood, and health-related outcomes. Boarding students (n = 197, mean age = 15.6 yr) attending an independent high school completed the School Sleep Habits Survey before and after the school start time was experimentally delayed from 8:00 a.m. to 8:25 a.m. The delay in school start time was associated with a significant (29 min) increase in sleep duration on school nights. The percentage of students receiving 8 or more hours of sleep on a school night increased to more than double, from 18% to 44%. Students in 9th and 10th grade and those with lower baseline sleep amounts were more likely to report improvements in sleep duration after the schedule change. Daytime sleepiness, depressed mood, and caffeine use were all significantly reduced after the delay in school start time. Sleep duration reverted to baseline levels when the original (earlier) school start time was reinstituted. A modest (25 min) delay in school start time was associated with significant improvements in sleep duration, daytime sleepiness, mood, and caffeine use. These findings have important implications for public policy and add to research suggesting the health benefits of modifying school schedules to more closely align with adolescents' circadian rhythms and sleep needs.

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

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

A TOTP-based enhanced route optimization procedure for mobile IPv6 to reduce handover delay and signalling overhead.

PubMed

Shah, Peer Azmat; Hasbullah, Halabi B; Lawal, Ibrahim A; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO).

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

DTIC Science & Technology

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

Increased impulsive choice for saccharin during PCP withdrawal in female monkeys: influence of menstrual cycle phase

PubMed Central

Carroll, Marilyn E.; Kohl, Emily A.; Johnson, Krista M.; LaNasa, Rachel M.

2013-01-01

Background In previous studies with male and female rhesus monkeys withdrawal of access to oral phencyclidine (PCP) self administration reduced responding for food under a high fixed-ratio (FR) schedule more in males than females and with a delay discounting (DD) task with saccharin (SACC) as the reinforcer. Impulsive choice for SACC increased during PCP withdrawal more than females. Objectives The goal of the present study was to examine the effect of PCP (0.25 or 0.5 mg/ml) withdrawal on impulsive choice for SACC in females during the follicular and luteal phases of the menstrual cycle. Materials and methods In Component 1 PCP and water were available from 2 drinking spouts for 1.5 h sessions under concurrent FR 16 schedules. In Component 2 a SACC solution was available for 45 min under a DD schedule. Monkeys had a choice of one immediate SACC delivery (0.6 ml) or 6 delayed SACC deliveries, and the delay was increased by 1 sec after a response on the delayed lever and decreased by 1 sec after a response on the immediate lever. There was then a 10-day water substitution phase, or PCP-withdrawal, that occurred during the mid-folllicular phase (Days 7–11) or the late-luteal (Days 24–28) phase of the menstrual cycle. Access to PCP and concurrent water was then restored, and the PCP withdrawal procedure was repeated over several follicular and luteal menstrual phases. Results PCP deliveries were higher during the luteal vs the follicular phase. Impulsive choice was greater during the luteal (vs follicular) phase during withdrawal of the higher PCP concentration. Conclusions PCP withdrawal was associated with elevated impulsive choice for SACC, especially in the luteal (vs follicular) phase of the menstrual cycle in female monkeys. PMID:23344553

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.

Mass transit : many management successes at WMATA, but capital planning could be enhanced

DOT National Transportation Integrated Search

2001-07-01

In recent years, the Washington Metropolitan Area Transit Authority's (WMATA) public transit system has experienced problems related to the safety and reliability of its transit services, including equipment breakdowns, delays in scheduled service, u...

Air Traffic Control: Status of FAA's Standard Terminal Automation Replacement System Project

DOT National Transportation Integrated Search

1997-03-01

Since the early 1980s, FAA's modernization efforts have experienced lengthy : schedule delays and substantial cost overruns. Because of such problems, in : 1994, FAA restructured its acquisition of the Terminal Advanced Automation : System into more ...

Network coding based joint signaling and dynamic bandwidth allocation scheme for inter optical network unit communication in passive optical networks

NASA Astrophysics Data System (ADS)

Wei, Pei; Gu, Rentao; Ji, Yuefeng

2014-06-01

As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.

The Effects of the Uncertainty of Departures on Multi-Center Traffic Management Advisor (TMA) Scheduling

NASA Technical Reports Server (NTRS)

Thipphavong, Jane; Landry, Steven J.

2005-01-01

The Multi-center Traffic Management Advisor (McTMA) provides a platform for regional or national traffic flow management, by allowing long-range cooperative time-based metering to constrained resources, such as airports or air traffic control center boundaries. Part of the demand for resources is made up of proposed departures, whose actual departure time is difficult to predict. For this reason, McTMA does not schedule the departures in advance, but rather relies on traffic managers to input their requested departure time. Because this happens only a short while before the aircraft's actual departure, McTMA is unable to accurately predict the amount of delay airborne aircraft will need to take in order to accommodate the departures. The proportion of demand which is made up by such proposed departures increases as the horizon over which metering occurs gets larger. This study provides an initial analysis of the severity of this problem in a 400-500 nautical mile metering horizon and discusses potential solutions to accommodate these departures. The challenge is to smoothly incorporate departures with the airborne stream while not excessively delaying the departures.' In particular, three solutions are reviewed: (1) scheduling the departures at their proposed departure time; (2) not scheduling the departures in advance; and (3) scheduling the departures at some time in the future based on an estimated error in their proposed time. The first solution is to have McTMA to automatically schedule the departures at their proposed departure times. Since the proposed departure times are indicated in their flight times in advance, this method is the simplest, but studies have shown that these proposed times are often incorrect2 The second option is the current practice, which avoids these inaccuracies by only scheduling aircraft when a confirmed prediction of departure time is obtained from the tower of the departure airport. Lastly, McTMA can schedule the departures at a predicted departure time based on statistical data of past departure time performance. It has been found that departures usually have a wheels-up time after their indicated proposed departure time, as shown in Figure 1. Hence, the departures were scheduled at a time in the future based on the mean error in proposed departure times for their airport.

Orexin signaling via the orexin 1 receptor mediates operant responding for food reinforcement.

PubMed

Sharf, Ruth; Sarhan, Maysa; Brayton, Catherine E; Guarnieri, Douglas J; Taylor, Jane R; DiLeone, Ralph J

2010-04-15

Orexin (hypocretin) signaling is implicated in drug addiction and reward, but its role in feeding and food-motivated behavior remains unclear. We investigated orexin's contribution to food-reinforced instrumental responding using an orexin 1 receptor (Ox1r) antagonist, orexin -/- (OKO) and littermate wildtype (WT) mice, and RNAi-mediated knockdown of orexin. C57BL/6J (n = 76) and OKO (n = 39) mice were trained to nose poke for food under a variable ratio schedule of reinforcement. After responding stabilized, a progressive ratio schedule was initiated to evaluate motivation to obtain food reinforcement. Blockade of Ox1r in C57BL/6J mice impaired performance under both the variable ratio and progressive ratio schedules of reinforcement, indicating impaired motivational processes. In contrast, OKO mice initially demonstrated a delay in acquisition but eventually achieved levels of responding similar to those observed in WT animals. Moreover, OKO mice did not differ from WT mice under a progressive ratio schedule, indicating delayed learning processes but no motivational impairments. Considering the differences between pharmacologic blockade of Ox1r and the OKO mice, animals with RNAi mediated knockdown of orexin were then generated and analyzed to eliminate possible developmental effects of missing orexin. Orexin gene knockdown in the lateral hypothalamus in C57BL/6J mice resulted in blunted performance under both the variable ratio and progressive ratio schedules, resembling data obtained following Ox1r antagonism. The behavior seen in OKO mice likely reflects developmental compensation often seen in mutant animals. These data suggest that activation of the Ox1r is a necessary component of food-reinforced responding, motivation, or both in normal mice. Copyright 2010 Society of Biological Psychiatry. Published by Elsevier Inc. All rights reserved.