WorldWideScience

Sample records for ratio schedule finally

  1. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans

    2010-01-01

    Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact...... on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way....

  2. Second-order schedules of token reinforcement with pigeons: effects of fixed- and variable-ratio exchange schedules.

    Science.gov (United States)

    Foster, T A; Hackenberg, T D; Vaidya, M

    2001-09-01

    Pigeons' key pecks produced food under second-order schedules of token reinforcement, with light-emitting diodes serving as token reinforcers. In Experiment 1, tokens were earned according to a fixed-ratio 50 schedule and were exchanged for food according to either fixed-ratio or variable-ratio exchange schedules, with schedule type varied across conditions. In Experiment 2, schedule type was varied within sessions using a multiple schedule. In one component, tokens were earned according to a fixed-ratio 50 schedule and exchanged according to a variable-ratio schedule. In the other component, tokens were earned according to a variable-ratio 50 schedule and exchanged according to a fixed-ratio schedule. In both experiments, the number of responses per exchange was varied parametrically across conditions, ranging from 50 to 400 responses. Response rates decreased systematically with increases in the fixed-ratio exchange schedules, but were much less affected by changes in the variable-ratio exchange schedules. Response rates were consistently higher under variable-ratio exchange schedules than tinder comparable fixed-ratio exchange schedules, especially at higher exchange ratios. These response-rate differences were due both to greater pre-ratio pausing and to lower local rates tinder the fixed-ratio exchange schedules. Local response rates increased with proximity to food under the higher fixed-ratio exchange schedules, indicative of discriminative control by the tokens.

  3. Medicare Program; Revisions to Payment Policies Under the Physician Fee Schedule and Other Revisions to Part B for CY 2017; Medicare Advantage Bid Pricing Data Release; Medicare Advantage and Part D Medical Loss Ratio Data Release; Medicare Advantage Provider Network Requirements; Expansion of Medicare Diabetes Prevention Program Model; Medicare Shared Savings Program Requirements. Final rule.

    Science.gov (United States)

    2016-11-15

    This major final rule addresses changes to the physician fee schedule and other Medicare Part B payment policies, such as changes to the Value Modifier, to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services, as well as changes in the statute. This final rule also includes changes related to the Medicare Shared Savings Program, requirements for Medicare Advantage Provider Networks, and provides for the release of certain pricing data from Medicare Advantage bids and of data from medical loss ratio reports submitted by Medicare health and drug plans. In addition, this final rule expands the Medicare Diabetes Prevention Program model.

  4. Schedules of controlled substances: temporary placement of three synthetic cannabinoids into Schedule I. Final order.

    Science.gov (United States)

    2013-05-16

    The Deputy Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cannabinoids under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48). This action is based on a finding by the Deputy Administrator that the placement of these synthetic cannabinoids and their salts, isomers and salts of isomers into Schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the full effect of the CSA and the Controlled Substances Import and Export Act (CSIEA) and their implementing regulations including criminal, civil and administrative penalties, sanctions and regulatory controls of Schedule I substances will be imposed on the manufacture, distribution, possession, importation, and exportation of these synthetic cannabinoids.

  5. 26 CFR 26.2642-5 - Finality of inclusion ratio.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 14 2010-04-01 2010-04-01 false Finality of inclusion ratio. 26.2642-5 Section...-5 Finality of inclusion ratio. (a) Direct skips. The inclusion ratio applicable to a direct skip...) Other GSTs. With respect to taxable distributions and taxable terminations, the inclusion ratio for a...

  6. Progressive-Ratio Schedules and Applied Behavior Analysis

    Science.gov (United States)

    Poling, Alan

    2010-01-01

    Establishing appropriate relations between the basic and applied areas of behavior analysis has been of long and persistent interest to the author. In this article, the author illustrates that there is a direct relation between how hard an organism will work for access to an object or activity, as indexed by the largest ratio completed under a…

  7. Evaluation of Absolute and Relative Reinforcer Value Using Progressive-Ratio Schedules

    Science.gov (United States)

    Francisco, Monica T.; Borrero, John C.; Sy, Jolene R.

    2008-01-01

    We evaluated behavior exhibited by individuals with developmental disabilities using progressive-ratio (PR) schedules. High- and low-preference stimuli were determined based on the results of a paired-stimulus preference assessment and were evaluated in subsequent reinforcer and PR assessments using concurrent and single schedules of presentation.…

  8. Concurrent variable-interval variable-ratio schedules in a dynamic choice environment.

    Science.gov (United States)

    Bell, Matthew C; Baum, William M

    2017-11-01

    Most studies of operant choice have focused on presenting subjects with a fixed pair of schedules across many experimental sessions. Using these methods, studies of concurrent variable- interval variable-ratio schedules helped to evaluate theories of choice. More recently, a growing literature has focused on dynamic choice behavior. Those dynamic choice studies have analyzed behavior on a number of different time scales using concurrent variable-interval schedules. Following the dynamic choice approach, the present experiment examined performance on concurrent variable-interval variable-ratio schedules in a rapidly changing environment. Our objectives were to compare performance on concurrent variable-interval variable-ratio schedules with extant data on concurrent variable-interval variable-interval schedules using a dynamic choice procedure and to extend earlier work on concurrent variable-interval variable-ratio schedules. We analyzed performances at different time scales, finding strong similarities between concurrent variable-interval variable-interval and concurrent variable-interval variable- ratio performance within dynamic choice procedures. Time-based measures revealed almost identical performance in the two procedures compared with response-based measures, supporting the view that choice is best understood as time allocation. Performance at the smaller time scale of visits accorded with the tendency seen in earlier research toward developing a pattern of strong preference for and long visits to the richer alternative paired with brief "samples" at the leaner alternative ("fix and sample"). © 2017 Society for the Experimental Analysis of Behavior.

  9. A NEW APPROACH TO CLASS SCHEDULING. FINAL REPORT.

    Science.gov (United States)

    CANTER, JOHN; AND OTHERS

    AN INVESTIGATION OF THE USE OF A PROTOTYPE DEVICE FOR CLASS SCHEDULING WAS MADE. THE BEEKLEY INSITE DEVICE THAT WAS STUDIED USES THE "PEEK-A-BOO" PRINCIPLE OF MATCHING COMPUTER TAPES. A TEST GROUP OF 149 GRADUATE STUDENTS WAS USED. THEIR DESIRED SCHEDULES WERE MATCHED AUTOMATICALLY AGAINST A PROPOSED MASTER SCHEDULE TO EVALUATE THE…

  10. Schedule for Rating Disabilities; the Endocrine System. Final rule.

    Science.gov (United States)

    2017-11-02

    This document amends the Department of Veterans Affairs (VA) Schedule for Rating Disabilities (VASRD) by revising the portion of the Schedule that addresses endocrine conditions and disorders of the endocrine system. The effect of this action is to ensure that the VASRD uses current medical terminology and to provide detailed and updated criteria for evaluation of endocrine disorders.

  11. Response-rate differences in variable-interval and variable-ratio schedules: An old problem revisited

    OpenAIRE

    Cole, Mark R.

    1994-01-01

    In Experiment 1, a variable-ratio 10 schedule became, successively, a variable-interval schedule with only the minimum interreinforcement intervals yoked to the variable ratio, or a variable-interval schedule with both interreinforcement intervals and reinforced interresponse times yoked to the variable ratio. Response rates in the variable-interval schedule with both interreinforcement interval and reinforced interresponse time yoking fell between the higher rates maintained by the variable-...

  12. SMART operational field test evaluation : scheduler survey report : final report

    Science.gov (United States)

    1997-06-01

    The Suburban Mobility Authority for Regional Transportation (SMART) has installed an automatic scheduling and dispatch system (ASD) in Southeast Michigan in accordance with their plans to implement ITS as a site for an operational field test. The pur...

  13. On the Correspondence between Preference Assessment Outcomes and Progressive-Ratio Schedule Assessments of Stimulus Value

    Science.gov (United States)

    DeLeon, Iser G.; Frank, Michelle A.; Gregory, Meagan K.; Allman, Melissa J.

    2009-01-01

    The current study examined whether stimuli of different preference levels would be associated with different amounts of work maintained by the stimuli, as determined through progressive-ratio schedule break points. Using a paired-choice preference assessment, stimuli were classified as high, moderate, or low preference for 4 individuals with…

  14. Effect of reinforcer magnitude on performance maintained by progressive-ratio schedules.

    Science.gov (United States)

    Rickard, J F; Body, S; Zhang, Z; Bradshaw, C M; Szabadi, E

    2009-01-01

    This experiment examined the relationship between reinforcer magnitude and quantitative measures of performance on progressive-ratio schedules. Fifteen rats were trained under a progressive-ratio schedule in seven phases of the experiment in which the volume of a 0.6-M sucrose solution reinforcer was varied within the range 6-300 microl. Overall response rates in successive ratios conformed to a bitonic equation derived from Killeen's (1994) Mathematical Principles of Reinforcement. The "specific activation" parameter, a, which is presumed to reflect the incentive value of the reinforcer, was a monotonically increasing function of reinforcer volume; the "response time" parameter, delta, which defines the minimum response time, increased as a function of reinforcer volume; the "currency" parameter, beta, which is presumed to reflect the coupling of responses to the reinforcer, declined as a function of volume. Running response rate (response rate calculated after exclusion of the postreinforcement pause) decayed monotonically as a function of ratio size; the index of curvature of this function increased as a function of reinforcer volume. Postreinforcement pause increased as a function of ratio size. Estimates of a derived from overall response rates and postreinforcement pauses showed a modest positive correlation across conditions and between animals. Implications of the results for the quantification of reinforcer value and for the use of progressive-ratio schedules in behavioral neuroscience are discussed.

  15. A theory of behaviour on progressive ratio schedules, with applications in behavioural pharmacology.

    Science.gov (United States)

    Bradshaw, C M; Killeen, P R

    2012-08-01

    Mathematical principles of reinforcement (MPR) provide the theoretical basis for a family of models of schedule-controlled behaviour. A model of fixed-ratio schedule performance that was applied to behaviour on progressive ratio (PR) schedules showed systematic departures from the data. This study aims to derive a new model from MPR that will account for overall and running response rates in the component ratios of PR schedules, and their decline toward 0, the breakpoint. The role of pausing is represented in a real-time model containing four parameters: T (0) and k are the intercept and slope of the linear relation between post-reinforcement pause duration and the prior inter-reinforcer interval; a (specific activation) measures the incentive value of the reinforcer; δ (response time) sets biomechanical limits on response rate. Running rate is predicted to decrease with negative acceleration as ratio size increments, overall rate to increase and then decrease. Differences due to type of progression are explained as hysteresis in the control by reinforcement rates. Re-analysis of extant data focuses on the effects of acute treatment with antipsychotic drugs, lesions of the nucleus accumbens core, and destruction of orexinergic neurones of the lateral hypothalamus. The new model resolves some anomalies evident in earlier analyses, and provides new insights to the results of these interventions. Because they can render biologically relevant parameters, mathematical models can provide greater power in interpreting the effects of interventions on the processes underlying schedule-controlled behaviour than is possible for first-order data such as the breakpoint.

  16. Schedules of Controlled Substances: Placement of UR-144, XLR11, and AKB48 into Schedule I. Final rule.

    Science.gov (United States)

    2016-05-11

    With the issuance of this final rule, the Drug Enforcement Administration places (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11), and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48), including their salts, isomers, and salts of isomers whenever the existence of such salts, isomers, and salts of isomers is possible, into schedule I of the Controlled Substances Act. This scheduling action is pursuant to the Controlled Substances Act which requires that such actions be made on the record after opportunity for a hearing through formal rulemaking. This action imposes the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle UR-144, XLR11, or AKB48.

  17. Medicare program; revisions to payment policies under the physician fee schedule, clinical laboratory fee schedule & other revisions to Part B for CY 2014. Final rule with comment period.

    Science.gov (United States)

    2013-12-10

    This major final rule with comment period addresses changes to the physician fee schedule, clinical laboratory fee schedule, and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. This final rule with comment period also includes a discussion in the Supplementary Information regarding various programs. (See the Table of Contents for a listing of the specific issues addressed in the final rule with comment period.)

  18. Packet-Scheduling Algorithm by the Ratio of Transmit Power to the Transmission Bits in 3GPP LTE Downlink

    Directory of Open Access Journals (Sweden)

    Gil Gye-Tae

    2010-01-01

    Full Text Available Packet scheduler plays the central role in determining the overall performance of the 3GPP long-term evolution (LTE based on packet-switching operation. In this paper, a novel minimum transmit power-based (MP packet-scheduling algorithm is proposed that can achieve power-efficient transmission to the UEs while providing both system throughput gain and fairness improvement. The proposed algorithm is based on a new scheduling metric focusing on the ratio of the transmit power per bit and allocates the physical resource block (PRB to the UE that requires the least ratio of the transmit power per bit. Through computer simulation, the performance of the proposed MP packet-scheduling algorithm is compared with the conventional packet-scheduling algorithms by two primary criteria: fairness and throughput. The simulation results show that the proposed algorithm outperforms the conventional algorithms in terms of the fairness and throughput.

  19. Concurrent progressive-ratio schedules: built-in controls in the study of delayed reward efficacy.

    Science.gov (United States)

    Jarmolowicz, David P; Hudnall, Jennifer L

    2014-08-15

    Delayed rewards maintain lower rates of operant responding than immediate rewards, and when given a choice between immediate and delayed rewards, individuals typically choose the immediate reward, even when it is smaller (a phenomenon called delay discounting). The behavioral and neural mechanisms underlying these behavioral patterns, however, are not conclusively understood. The present study developed a method to examine the efficacy of delayed rewards in a way that is suitable for pharmacological manipulation of delayed reward efficacy (while controlling for general changes in reward efficacy). The progressive ratio (PR) paradigm often used to examine reward efficacy was modified such that two PR schedules for lever pressing concurrently yet independently were presented. Across a series of conditions, a range of delays (3-81s) were arranged on one of the levers while the reward on the other lever remained immediate. PR breakpoints (the highest ratio completed on each lever, our measure of reward efficacy) systematically decreased on the delayed, but not on the immediate reward lever, suggesting that delays decreased reward efficacy. This decrease in breakpoint resulted in bias in within-session responding that was accounted for by models that adjusted reward value by the delay to that reward. Unlike the standard PR paradigm, the present arrangement provided the controls needed to differentiate delay specific from general changes in reward efficacy. The present method should be helpful in the study of the behavioral and neural mechanisms of delayed reward efficacy. Modifications of the present paradigm should be useful for pharmacological studies. Copyright © 2014 Elsevier B.V. All rights reserved.

  20. Contingency discriminability and the generalized matching law describe choice on concurrent ratio schedules of wheel-running reinforcement.

    Science.gov (United States)

    Belke, Terry W

    2012-07-01

    Belke (2010) showed that on concurrent ratio schedules, the difference in ratio requirements required to produce near exclusive preference for the lower ratio alternative was substantively greater when the reinforcer was wheel running than when it was sucrose. The current study replicated this finding and showed that this choice behavior can be described by the matching law and the contingency discriminability model. Eight female Long Evans rats were exposed to concurrent VR schedules of wheel-running reinforcement (30s) and the schedule value of the initially preferred alternative was systematically increased. Two rats rapidly developed exclusive preference for the lower ratio alternative, but the majority did not - even when ratios differed by 20:1. Analysis showed that estimates of slopes from the matching law and the proportion of reinforcers misattributed from the contingency discriminability model were related to the ratios at which near exclusive preference developed. The fit of these models would be consistent with misattribution of reinforcers or poor discrimination between alternatives due to the long duration of wheel running. Copyright © 2012 Elsevier B.V. All rights reserved.

  1. Evidence for positive, but not negative, behavioral contrast with wheel-running reinforcement on multiple variable-ratio schedules.

    Science.gov (United States)

    Belke, Terry W; Pierce, W David

    2016-12-01

    Rats responded on a multiple variable-ratio (VR) 10 VR 10 schedule of reinforcement in which lever pressing was reinforced by the opportunity to run in a wheel for 30s in both the changed (manipulated) and unchanged components. To generate positive contrast, the schedule of reinforcement in the changed component was shifted to extinction; to generate negative contrast, the schedule was shifted to VR 3. With the shift to extinction in the changed component, wheel-running and local lever-pressing rates increased in the unchanged component, a result supporting positive contrast; however, the shift to a VR 3 schedule in the changed component showed no evidence of negative contrast in the unaltered setting, only wheel running decreased in the unchanged component. Changes in wheel-running rates across components were consistent in showing a compensation effect, depending on whether the schedule manipulation increased or decreased opportunities for wheel running in the changed component. These findings are the first to demonstrate positive behavioral contrast on a multiple schedule with wheel running as reinforcement in both components. Copyright © 2016 Elsevier B.V. All rights reserved.

  2. 76 FR 72721 - Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty...

    Science.gov (United States)

    2011-11-25

    ...)] Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty and... galvanized steel wire, provided for in subheading 7217.20 of the Harmonized Tariff Schedule of the United... merchandise as galvanized steel wire which is a cold- drawn carbon quality steel product in coils, of solid...

  3. Entity’s Irregular Demand Scheduling of the Wholesale Electricity Market based on the Forecast of Hourly Price Ratios

    Directory of Open Access Journals (Sweden)

    O. V. Russkov

    2015-01-01

    Full Text Available The article considers a hot issue to forecast electric power demand amounts and prices for the entities of wholesale electricity market (WEM, which are in capacity of a large user with production technology requirements prevailing over hourly energy planning ones. An electric power demand of such entities is on irregular schedule. The article analyses mathematical models, currently applied to forecast demand amounts and prices. It describes limits of time-series models and fundamental ones in case of hourly forecasting an irregular demand schedule of the electricity market entity. The features of electricity trading at WEM are carefully analysed. Factors that influence on irregularity of demand schedule of the metallurgical plant are shown. The article proposes method for the qualitative forecast of market price ratios as a tool to reduce a dependence on the accuracy of forecasting an irregular schedule of demand. It describes the differences between the offered method and the similar ones considered in research studies and scholarly works. The correlation between price ratios and relaxation in the requirements for the forecast accuracy of the electric power consumption is analysed. The efficiency function of forecast method is derived. The article puts an increased focus on description of the mathematical model based on the method of qualitative forecast. It shows main model parameters and restrictions the electricity market imposes on them. The model prototype is described as a programme module. Methods to assess an effectiveness of the proposed forecast model are examined. The positive test results of the model using JSC «Volzhsky Pipe Plant» data are given. A conclusion is drawn concerning the possibility to decrease dependence on the forecast accuracy of irregular schedule of entity’s demand at WEM. The effective trading tool has been found for the entities of irregular demand schedule at WEM. The tool application allows minimizing cost

  4. Schedules of controlled substances: extension of temporary placement of UR-144, XLR11, and AKB48 in schedule I of the Controlled Substances Act. Final order.

    Science.gov (United States)

    2015-05-15

    The Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to extend the temporary placement of (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48), including their salts, isomers, and salts of isomers whenever the existence of such salts, isomers, and salts of isomers is possible, in schedule I of the Controlled Substances Act. The current final order temporarily placing UR-144, XLR11, and AKB48 in schedule I is due to expire on May 15, 2015. This final order will extend the temporary scheduling of UR-144, XLR11, and AKB48 to May 15, 2016, or until the permanent scheduling action for these three substances is completed, whichever occurs first.

  5. Medicare program; replacement of reasonable charge methodology by fee schedules for parenteral and enteral nutrients, equipment, and supplies. Final rule.

    Science.gov (United States)

    2001-08-28

    This final rule implements fee schedules for payment of parenteral and enteral nutrition (PEN) items and services furnished under the prosthetic device benefit, defined in section 1861(s)(8) of the Social Security Act. The authority for establishing these fee schedules is provided by the Balanced Budget Act of 1997, which amended the Social Security Act at section 1842(s). Section 1842(s) of the Social Security Act specifies that statewide or other area wide fee schedules may be implemented for the following items and services still subject to the reasonable charge payment methodology: medical supplies; home dialysis supplies and equipment; therapeutic shoes; parenteral and enteral nutrients, equipment, and supplies; electromyogram devices; salivation devices; blood products; and transfusion medicine. This final rule describes changes made to the proposed fee schedule payment methodology for these items and services and provides that the fee schedules for PEN items and services are effective for all covered items and services furnished on or after January 1, 2002. Fee schedules will not be implemented for electromyogram devices and salivation devices at this time since these items are not covered by Medicare. In addition, fee schedules will not be implemented for medical supplies, home dialysis supplies and equipment, therapeutic shoes, blood products, and transfusion medicine at this time since the data required to establish these fee schedules are inadequate.

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

    Science.gov (United States)

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

    2010-01-01

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

  7. 77 FR 35425 - Crystalline Silicon Photovoltaic Cells and Modules From China; Scheduling of the Final Phase of...

    Science.gov (United States)

    2012-06-13

    ... Silicon Photovoltaic Cells and Modules From China; Scheduling of the Final Phase of Countervailing Duty... silicon photovoltaic cells and modules, provided for in subheadings 8501.31.80, 8501.61.00, 8507.20.80... photovoltaic cells, and modules, laminates, and panels, consisting of crystalline silicon photovoltaic cells...

  8. 76 FR 72719 - Certain Stilbenic Optical Brightening Agents From China and Taiwan; Scheduling of the Final Phase...

    Science.gov (United States)

    2011-11-25

    ... Optical Brightening Agents From China and Taiwan; Scheduling of the Final Phase of Antidumping... whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in the United States is materially retarded, by reason of less-than-fair-value...

  9. 77 FR 50160 - Steel Wire Garment Hangers From Taiwan and Vietnam; Scheduling of the Final Phase of...

    Science.gov (United States)

    2012-08-20

    ...)] Steel Wire Garment Hangers From Taiwan and Vietnam; Scheduling of the Final Phase of Countervailing Duty...(b) of the Act (19 U.S.C. 1673d(b)) to determine whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in the United...

  10. 77 FR 50713 - Steel Wire Garment Hangers From Taiwan and Vietnam; (Corrected Notice) Scheduling of the Final...

    Science.gov (United States)

    2012-08-22

    ...)] Steel Wire Garment Hangers From Taiwan and Vietnam; (Corrected Notice) Scheduling of the Final Phase of...) under section 735(b) of the Act (19 U.S.C. 1673d(b)) to determine whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in...

  11. 77 FR 3281 - High Pressure Steel Cylinders From China; Scheduling of the Final Phase of Countervailing Duty...

    Science.gov (United States)

    2012-01-23

    ...)] High Pressure Steel Cylinders From China; Scheduling of the Final Phase of Countervailing Duty and... retarded, by reason of subsidized and less-than-fair-value imports from China of high pressure steel... (``high pressure steel cylinders''). High pressure steel cylinders are fabricated of chrome alloy steel...

  12. Apparent diffusion coefficient ratio correlates significantly with prostate cancer gleason score at final pathology

    DEFF Research Database (Denmark)

    Boesen, Lars; Chabanova, Elizaveta; Løgager, Vibeke

    2015-01-01

    PURPOSE: To evaluate the correlation between apparent diffusion coefficient measurements (ADCtumor and ADCratio ) and the Gleason score from radical prostatectomy specimens. MATERIALS AND METHODS: Seventy-one patients with clinically localized prostate cancer scheduled for radical prostatectomy...... correlated with the Gleason score from the prostatectomy specimens. RESULTS: The association between ADC measurements and Gleason score showed a significant negative correlation (P ... ) and 0.90 (ADCratio ) when discriminating Gleason score ≤7(3+4) from Gleason score ≥7(4+3). CONCLUSION: ADC measurements showed a significant correlation with tumor Gleason score at final pathology. The ADCratio demonstrated the best correlation compared to the ADCtumor value and radically improved...

  13. Exclusive Preference Develops Less Readily on Concurrent Ratio Schedules with Wheel-Running than with Sucrose Reinforcement

    Science.gov (United States)

    Belke, Terry W.

    2010-01-01

    Previous research suggested that allocation of responses on concurrent schedules of wheel-running reinforcement was less sensitive to schedule differences than typically observed with more conventional reinforcers. To assess this possibility, 16 female Long Evans rats were exposed to concurrent FR FR schedules of reinforcement and the schedule…

  14. 1 Tbit/inch2 Recording in Angular-Multiplexing Holographic Memory with Constant Signal-to-Scatter Ratio Schedule

    Science.gov (United States)

    Hosaka, Makoto; Ishii, Toshiki; Tanaka, Asato; Koga, Shogo; Hoshizawa, Taku

    2013-09-01

    We developed an iterative method for optimizing the exposure schedule to obtain a constant signal-to-scatter ratio (SSR) to accommodate various recording conditions and achieve high-density recording. 192 binary images were recorded in the same location of a medium in approximately 300×300 µm2 using an experimental system embedded with a blue laser diode with a 405 nm wavelength and an objective lens with a 0.85 numerical aperture. The recording density of this multiplexing corresponds to 1 Tbit/in.2. The recording exposure time was optimized through the iteration of a three-step sequence consisting of total reproduced intensity measurement, target signal calculation, and recording energy density calculation. The SSR of pages recorded with this method was almost constant throughout the entire range of the reference beam angle. The signal-to-noise ratio of the sampled pages was over 2.9 dB, which is higher than the reproducible limit of 1.5 dB in our experimental system.

  15. Classification of two steroids, prostanozol and methasterone, as Schedule III anabolic steroids under the Controlled Substance Act. Final rule.

    Science.gov (United States)

    2012-07-30

    With the issuance of this Final Rule, the Administrator of the DEA classifies the following two steroids as "anabolic steroids'' under the Controlled Substances Act (CSA): prostanozol (17[beta]-hydroxy-5[alpha]-androstano[3,2-c]pyrazole) and methasterone (2[alpha],17[alpha]-dimethyl-5[alpha]-androstan-17[beta]-ol-3-one). These steroids and their salts, esters, and ethers are Schedule III controlled substances subject to the regulatory control provisions of the CSA.

  16. Evidence for a role of 5-HT2C receptors in the motor aspects of performance, but not the efficacy of food reinforcers, in a progressive ratio schedule

    NARCIS (Netherlands)

    Bezzina, G.; Body, S.; Cheung, T.H.; Hampson, C.L.; Bradshaw, C.M.; Glennon, J.C.; Szabadi, E.

    2015-01-01

    RATIONALE: 5-Hydroxytryptamine2C (5-HT2C) receptor agonists reduce the breakpoint in progressive ratio schedules of reinforcement, an effect that has been attributed to a decrease of the efficacy of positive reinforcers. However, a reduction of the breakpoint may also reflect motor impairment.

  17. Final Report - Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS)

    Energy Technology Data Exchange (ETDEWEB)

    Principal Investigator: Dr. Abdella Battou

    2009-05-22

    The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation

  18. Faigue Avoidance Scheduling Tool (FAST) Phase II SBIR Final Report, Part 1

    Science.gov (United States)

    2006-05-01

    Report No. AFRL-HE-BR-TR-2004-0015. 56 FASTTM Final Report NTI, Inc. F33615-00-C-6013 APPENDECES Appendix 1: Research Protocol entitled, "The Relative...stored in the testing facility. In the case of a true emergency, San Antonio Emergency Medical Service (EMS) will be called for acute cardiac life

  19. Evidence for a role of 5-HT2C receptors in the motor aspects of performance, but not the efficacy of food reinforcers, in a progressive ratio schedule.

    Science.gov (United States)

    Bezzina, G; Body, S; Cheung, T H C; Hampson, C L; Bradshaw, C M; Glennon, J C; Szabadi, E

    2015-02-01

    5-Hydroxytryptamine2C (5-HT2C) receptor agonists reduce the breakpoint in progressive ratio schedules of reinforcement, an effect that has been attributed to a decrease of the efficacy of positive reinforcers. However, a reduction of the breakpoint may also reflect motor impairment. Mathematical models can help to differentiate between these processes. The effects of the 5-HT2C receptor agonist Ro-600175 ((αS)-6-chloro-5-fluoro-α-methyl-1H-indole-1-ethanamine) and the non-selective 5-HT receptor agonist 1-(m-chlorophenyl)piperazine (mCPP) on rats' performance on a progressive ratio schedule maintained by food pellet reinforcers were assessed using a model derived from Killeen's Behav Brain Sci 17:105-172, 1994 general theory of schedule-controlled behaviour, 'mathematical principles of reinforcement'. Rats were trained under the progressive ratio schedule, and running and overall response rates in successive ratios were analysed using the model. The effects of the agonists on estimates of the model's parameters, and the sensitivity of these effects to selective antagonists, were examined. Ro-600175 and mCPP reduced the breakpoint. Neither agonist significantly affected a (the parameter expressing incentive value), but both agonists increased δ (the parameter expressing minimum response time). The effects of both agonists could be attenuated by the selective 5-HT2C receptor antagonist SB-242084 (6-chloro-5-methyl-N-{6-[(2-methylpyridin-3-yl)oxy]pyridin-3-yl}indoline-1-carboxamide). The effect of mCPP was not altered by isamoltane, a selective 5-HT1B receptor antagonist, or MDL-100907 ((±)2,3-dimethoxyphenyl-1-(2-(4-piperidine)methanol)), a selective 5-HT2A receptor antagonist. The results are consistent with the hypothesis that the effect of the 5-HT2C receptor agonists on progressive ratio schedule performance is mediated by an impairment of motor capacity rather than by a reduction of the incentive value of the food reinforcer.

  20. Branching Ratios and Spectral Functions of $\\tau$ Decays final ALEPH measurements and physics implications

    CERN Document Server

    Schael, S.; Bruneliere, R.; De Bonis, I.; Decamp, D.; Goy, C.; Jezequel, S.; Lees, J.-P.; Martin, F.; Merle, E.; Minard, M.-N.; Pietrzyk, B.; Trocme, B.; Bravo, S.; Casado, M.P.; Chmeissani, M.; Crespo, J.M.; Fernandez, E.; Fernandez-Bosman, M.; Garrido, Ll.; Martinez, M.; Pacheco, A.; Ruiz, H.; Colaleo, A.; Creanza, D.; De Filippis, N.; de Palma, M.; Iaselli, G.; Maggi, G.; Maggi, M.; Nuzzo, S.; Ranieri, A.; Raso, G.; Ruggieri, F.; Selvaggi, G.; Silvestris, L.; Tempesta, P.; Tricomi, A.; Zito, G.; Huang, X.; Lin, J.; Ouyang, Q.; Wang, T.; Xie, Y.; Xu, R.; Xue, S.; Zhang, J.; Zhang, L.; Zhao, W.; Abbaneo, D.; Barklow, T.; Buchmuller, O.; Cattaneo, M.; Clerbaux, B.; Drevermann, H.; Forty, R.W.; Frank, M.; Gianotti, F.; Hansen, J.B.; Harvey, J.; Hutchcroft, D.E.; Janot, P.; Jost, B.; Kado, M.; Mato, P.; Moutoussi, A.; Ranjard, F.; Rolandi, L.; Schlatter, D.; Teubert, F.; Valassi, A.; Videau, I.; Badaud, F.; Dessagne, S.; Falvard, A.; Fayolle, D.; Gay, P.; Jousset, J.; Michel, B.; Monteil, S.; Pallin, D.; Pascolo, J.M.; Perret, P.; Hansen, J.D.; Hansen, J.R.; Hansen, P.H.; Kraan, A.C.; Nilsson, B.S.; Kyriakis, A.; Markou, C.; Simopoulou, E.; Vayaki, A.; Zachariadou, K.; Blondel, A.; Brient, J.-C.; Machefert, F.; Rouge, A.; Videau, H.; Ciulli, V.; Focardi, E.; Parrini, G.; Antonelli, A.; Antonelli, M.; Bencivenni, G.; Bossi, F.; Capon, G.; Cerutti, F.; Chiarella, V.; Laurelli, P.; Mannocchi, G.; Murtas, G.P.; Passalacqua, L.; Kennedy, J.; Lynch, J.G.; Negus, P.; O'Shea, V.; Thompson, A.S.; Wasserbaech, S.; Cavanaugh, R.; Dhamotharan, S.; Geweniger, C.; Hanke, P.; Hepp, V.; Kluge, E.E.; Putzer, A.; Stenzel, H.; Tittel, K.; Wunsch, M.; Phys., Kirchhoff Inst.; Beuselinck, R.; Cameron, W.; Davies, G.; Dornan, P.J.; Girone, M.; Marinelli, N.; Nowell, J.; Rutherford, S.A.; Sedgbeer, J.K.; Thompson, J.C.; White, R.; Ghete, V.M.; Girtler, P.; Kneringer, E.; Kuhn, D.; Rudolph, G.; Bouhova-Thacker, E.; Bowdery, C.K.; Clarke, D.P.; Ellis, G.; Finch, A.J.; Foster, F.; Hughes, G.; Jones, R.W.L.; Pearson, M.R.; Robertson, N.A.; Smizanska, M.; van der Aa, O.; Delaere, C.; Leibenguth, G.; Lemaitre, V.; Blumenschein, U.; Holldorfer, F.; Jakobs, K.; Kayser, F.; Muller, A.-S.; Renk, B.; Sander, H.-G.; Schmeling, S.; Wachsmuth, H.; Zeitnitz, C.; Ziegler, T.; Bonissent, A.; Coyle, P.; Curtil, C.; Ealet, A.; Fouchez, D.; Payre, P.; Tilquin, A.; Ragusa, F.; David, A.; Dietl, H.; Ganis, G.; Huttmann, K.; Lutjens, G.; Manner, W.; Moser, H.-G.; Settles, R.; Villegas, M.; Wolf, G.; Boucrot, J.; Callot, O.; Davier, M.; Duflot, L.; Grivaz, J.-F.; Heusse, Ph.; Hocker, Andreas; Jacholkowska, A.; Serin, L.; Veillet, J.-J.; Yuan, C.Z.; Zhang, Z.Q.; Azzurri, P.; Bagliesi, Giuseppe; Boccali, T.; Foa, L.; Giammanco, A.; Giassi, A.; Ligabue, F.; Messineo, A.; Palla, F.; Sanguinetti, G.; Sciaba, A.; Sguazzoni, G.; Spagnolo, P.; Tenchini, R.; Venturi, A.; Verdini, P.G.; Awunor, O.; Blair, G.A.; Cowan, G.; Garcia-Bellido, A.; Green, M.G.; Medcalf, T.; Misiejuk, A.; Strong, J.A.; Teixeira-Dias, P.; Clifft, R.W.; Edgecock, T.R.; Norton, P.R.; Tomalin, I.R.; Ward, J.J.; Bloch-Devaux, Brigitte; Boumediene, D.; Colas, P.; Fabbro, B.; Lancon, E.; Lemaire, M.-C.; Locci, E.; Perez, P.; Rander, J.; Tuchming, B.; Vallage, G.; Litke, A.M.; Taylor, G.; Booth, C.N.; Cartwright, S.; Combley, F.; Hodgson, P.N.; Lehto, M.; Thompson, L.F.; Bohrer, A.; Brandt, S.; Grupen, C.; Hess, J.; Ngac, A.; Prange, G.; Borean, C.; Giannini, G.; He, H.; Putz, J.; Rothberg, J.; Armstrong, S.R.; Berkelman, Karl; Cranmer, K.; Ferguson, D.P.S.; Gao, Y.; Gonzalez, S.; Hayes, O.J.; Hu, H.; Jin, S.; Kile, J.; McNamara, P.A., III; Nielsen, J.; Pan, Y.B.; von Wimmersperg-Toeller, J.H.; Wiedenmann, W.; Wu, J.; Wu, Sau Lan; Wu, X.; Zobernig, G.; Dissertori, G.

    2005-01-01

    The full LEP-1 data set collected with the ALEPH detector at the $Z$ pole during 1991-1995 is analysed in order to measure the $\\tau$ decay branching fractions. The analysis follows the global method used in the published study based on 1991-1993 data, but several improvements are introduced, especially concerning the treatment of photons and $\\pi^0$'s. Extensive systematic studies are performed, in order to match the large statistics of the data sample corresponding to over 300\\,000 measured and identified $\\tau$ decays. Branching fractions are obtained for the two leptonic channels and eleven hadronic channels defined by their respective numbers of charged particles and $\\pi^0$'s. Using previously published ALEPH results on final states with charged and neutral kaons, corrections are applied to the hadronic channels to derive branching ratios for exclusive final states without kaons. Thus the analyses of the full LEP-1 ALEPH data are combined to yield a complete description of $\\tau$ decays, encompassing 22...

  1. Schedules of Controlled Substances: Placement of FDA-Approved Products of Oral Solutions Containing Dronabinol [(-)-delta-9-transtetrahydrocannabinol (delta-9-THC)] in Schedule II. Interim final rule, with request for comments.

    Science.gov (United States)

    2017-03-23

    On July 1, 2016, the U.S. Food and Drug Administration (FDA) approved a new drug application for Syndros, a drug product consisting of dronabinol [(-)-delta-9-trans-tetrahydrocannabinol (delta-9-THC)] oral solution. Thereafter, the Department of Health and Human Services (HHS) provided the Drug Enforcement Administration (DEA) with a scheduling recommendation that would result in Syndros (and other oral solutions containing dronabinol) being placed in schedule II of the Controlled Substances Act (CSA). In accordance with the CSA, as revised by the Improving Regulatory Transparency for New Medical Therapies Act, DEA is hereby issuing an interim final rule placing FDA-approved products of oral solutions containing dronabinol in schedule II of the CSA.

  2. Effect of quinolinic acid-induced lesions of the nucleus accumbens core on performance on a progressive ratio schedule of reinforcement: implications for inter-temporal choice.

    Science.gov (United States)

    Bezzina, G; Body, S; Cheung, T H C; Hampson, C L; Deakin, J F W; Anderson, I M; Szabadi, E; Bradshaw, C M

    2008-04-01

    The nucleus accumbens core (AcbC) is believed to contribute to the control of operant behaviour by reinforcers. Recent evidence suggests that it is not crucial for determining the incentive value of immediately available reinforcers, but is important for maintaining the values of delayed reinforcers. This study aims to examine the effect of AcbC lesions on performance on a progressive-ratio schedule using a quantitative model that dissociates effects of interventions on motor and motivational processes (Killeen 1994 Mathematical principles of reinforcement. Behav Brain Sci 17:105-172). Rats with bilateral quinolinic acid-induced lesions of the AcbC (n = 15) or sham lesions (n = 14) were trained to lever-press for food-pellet reinforcers under a progressive-ratio schedule. In Phase 1 (90 sessions) the reinforcer was one pellet; in Phase 2 (30 sessions), it was two pellets; in Phase 3, (30 sessions) it was one pellet. The performance of both groups conformed to the model of progressive-ratio performance (group mean data: r2 > 0.92). The motor parameter, delta, was significantly higher in the AcbC-lesioned than the sham-lesioned group, reflecting lower overall response rates in the lesioned group. The motivational parameter, a, was sensitive to changes in reinforcer size, but did not differ significantly between the two groups. The AcbC-lesioned group showed longer post-reinforcement pauses and lower running response rates than the sham-lesioned group. The results suggest that destruction of the AcbC impairs response capacity but does not alter the efficacy of food reinforcers. The results are consistent with recent findings that AcbC lesions do not alter sensitivity to reinforcer size in inter-temporal choice schedules.

  3. Retail sales of scheduled listed chemical products; self-certification of regulated sellers of scheduled listed chemical products. Interim final rule with request for comment.

    Science.gov (United States)

    2006-09-26

    In March 2006, the President signed the Combat Methamphetamine Epidemic Act of 2005, which establishes new requirements for retail sales of over-the-counter (nonprescription) products containing the List I chemicals ephedrine, pseudoephedrine, and phenylpropanolamine. The three chemicals can be used to manufacture methamphetamine illegally. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements. This action establishes daily and 30-day limits on the sales of scheduled listed chemical products to individuals and requires recordkeeping on most sales.

  4. Medicare program; payment policies under the physician fee schedule, five-year review of work relative value units, clinical laboratory fee schedule: signature on requisition, and other revisions to part B for CY 2012. Final rule with comment period.

    Science.gov (United States)

    2011-11-28

    This final rule with comment period addresses changes to the physician fee schedule and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. It also addresses, implements or discusses certain statutory provisions including provisions of the Patient Protection and Affordable Care Act, as amended by the Health Care and Education Reconciliation Act of 2010 (collectively known as the Affordable Care Act) and the Medicare Improvements for Patients and Providers Act (MIPPA) of 2008. In addition, this final rule with comment period discusses payments for Part B drugs; Clinical Laboratory Fee Schedule: Signature on Requisition; Physician Quality Reporting System; the Electronic Prescribing (eRx) Incentive Program; the Physician Resource-Use Feedback Program and the value modifier; productivity adjustment for ambulatory surgical center payment system and the ambulance, clinical laboratory, and durable medical equipment prosthetics orthotics and supplies (DMEPOS) fee schedules; and other Part B related issues.

  5. Unattached radon daughter atoms and radon daughter equilibrium ratios in uranium mines. Final report

    International Nuclear Information System (INIS)

    Holaday, D.A.

    1972-01-01

    Uranium mines in Colorado and New Mexico were surveyed for airborne concentrations of radon (10043922) and radon daughters. A procedure for measuring individual daughters and the fraction of each existing as free atoms was developed and used for field monitoring. Samples were taken in working areas and particle counts were made. The data was analyzed to determine the ratio of radon to radon daughters as well as the ratios among the radon daughters. The author concludes that since the radon to working level ratios have not changed much in 20 years, using the ratio as the basis for estimating relative biological hazard is just as uncertain now as then. The large number of daughters present as free atoms indicate that the lung radiation doses calculated using any of the lung models need reexamination

  6. Influence of coffee/water ratio on the final quality of espresso coffee

    OpenAIRE

    Andueza, S. (Susana); Vila, M.A. (María A.); Peña, M.P. (María Paz) de; Cid, C. (Concepción)

    2007-01-01

    Espresso coffee is a polyphasic beverage in which the physico-chemical and sensory characteristics obviously depend on both the selection of ground roasted coffee and the technical conditions of the percolation process. The aim of this work was to evaluate the influence of the coffee/water ratio on the physico-chemical and sensory quality of espresso coffee. Furthermore, the influence of botanical varieties (Arabica and Robusta) and the type of roast (conventional and torrefacto) on the selec...

  7. Design and development of a continuously variable ratio transmission for automotive vehicles. Final report

    Energy Technology Data Exchange (ETDEWEB)

    None

    1978-09-30

    Work accomplished between July 1974 and October 1978 in a program directed toward the design and development of a continuously variable ratio transmission (CVT) for an automotive vehicle is reported. The following major accomplishments were achieved: the laboratory and mathematical projections establishing the viability of the program and the predicted attainment of the primary goal of fuel economy were verified; the proposed Concept Demonstration prototype hydromechanical transmission (HMT) was completed from design to operation; the HMT was thoroughly tested in the laboratory and on the road and its in-vehicle performance was verified by independent testing laboratories; and design of a second generation Pre-Production HMT has proceeded to the point of confirming the practicality of the automotive HMT size and weight; most of the necessary information has been generated which could permit its production cost/competitiveness to be evaluated. (LCL)

  8. Start of Final Assembly of the CMS Barrel Yoke on schedule at P5 the 1st august, 2000. I

    CERN Multimedia

    Hubert Gerwig, CERN/ EP-CMI

    2000-01-01

    The Barrel Yoke and the vacuumtank weigh 6500 tonnes. The barrel Yoke consists of 5 rings eacu one weighing 1200 tonnes. The vacuum tank is a stainless steel structure weighing 270 tonnes (length = 13 m , outer diamter 7.6 m) The final assembly of these items will take approximately 1 year from now on.

  9. 76 FR 72438 - Certain Steel Nails From the United Arab Emirates; Scheduling of the Final Phase of Antidumping...

    Science.gov (United States)

    2011-11-23

    ..., shaft lengths and shaft diameters. Finishes include, but are not limited to, coating in vinyl, zinc...://www.usitc.gov ). The public record for this investigation may be viewed on the Commission's electronic... prehearing staff report in the final phase of this investigation will be placed in the nonpublic record on...

  10. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

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

  11. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

    We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...

  12. The triangle scheduling problem

    NARCIS (Netherlands)

    Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard

    2017-01-01

    This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to

  13. Effects of SKF-83566 and haloperidol on performance on progressive ratio schedules maintained by sucrose and corn oil reinforcement: quantitative analysis using a new model derived from the Mathematical Principles of Reinforcement (MPR).

    Science.gov (United States)

    Olarte-Sánchez, C M; Valencia-Torres, L; Cassaday, H J; Bradshaw, C M; Szabadi, E

    2013-12-01

    Mathematical models can assist the interpretation of the effects of interventions on schedule-controlled behaviour and help to differentiate between processes that may be confounded in traditional performance measures such as response rate and the breakpoint in progressive ratio (PR) schedules. The effects of a D1-like dopamine receptor antagonist, 8-bromo-2,3,4,5-tetrahydro-3-methyl-5-phenyl-1H-3-benzazepin-7-ol hydrobromide (SKF-83566), and a D2-like receptor antagonist, haloperidol, on rats' performance on PR schedules maintained by sucrose and corn oil reinforcers were assessed using a new model derived from Killeen's (Behav Brain Sci 17:105-172, 1994) Mathematical Principles of Reinforcement. Separate groups of rats were trained under a PR schedule using sucrose or corn oil reinforcers. SKF-83566 (0.015 and 0.03 mg kg(-1)) and haloperidol (0.05 and 0.1 mg kg(-1)) were administered intraperitoneally (five administrations of each treatment). Running and overall response rates in successive ratios were analysed using the new model, and estimates of the model's parameters were compared between treatments. Haloperidol reduced a (the parameter expressing incentive value) in the case of both reinforcers, but did not affect the parameters related to response time and post-reinforcement pausing. SKF-83566 reduced a and k (the parameter expressing sensitivity of post-reinforcement pausing to the prior inter-reinforcement interval) in the case of sucrose, but did not affect any of the parameters in the case of corn oil. The results are consistent with the hypothesis that blockade of both D1-like and D2-like receptors reduces the incentive value of sucrose, whereas the incentive value of corn oil is more sensitive to blockade of D2-like than D1-like receptors.

  14. Medicare Program; Revisions to Payment Policies Under the Physician Fee Schedule and Other Revisions to Part B for CY 2018; Medicare Shared Savings Program Requirements; and Medicare Diabetes Prevention Program. Final rule.

    Science.gov (United States)

    2017-11-15

    This major final rule addresses changes to the Medicare physician fee schedule (PFS) and other Medicare Part B payment policies such as changes to the Medicare Shared Savings Program, to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services, as well as changes in the statute. In addition, this final rule includes policies necessary to begin offering the expanded Medicare Diabetes Prevention Program model.

  15. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  16. Medicare program; revisions to payment policies under the Physician Fee Schedule, Clinical Laboratory Fee Schedule, access to identifiable data for the Center for Medicare and Medicaid Innovation Models & other revisions to Part B for CY 2015. Final rule with comment period.

    Science.gov (United States)

    2014-11-13

    This major final rule with comment period addresses changes to the physician fee schedule, and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services, as well as changes in the statute. See the Table of Contents for a listing of the specific issues addressed in this rule.

  17. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    Warfare, Naval Sea Systems Command Acquisition Cycle Time : Defining the Problem David Tate, Institute for Defense Analyses Schedule Analytics Jennifer...research was comprised of the following high- level steps :  Identify and review primary data sources 1...research. However, detailed reviews of the OMB IT Dashboard data revealed that schedule data is highly aggregated. Program start date and program end date

  18. Cost and schedule estimate to construct the tunnel and shaft remedial shielding concept, Los Alamos Meson Physics Facility, Los Alamos National Laboratory, Los Alamos, New Mexico. Final report

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1993-11-30

    The report provides an estimate of the cost and associated schedule to construct the tunnel and shaft remedial shielding concept. The cost and schedule estimate is based on a preliminary concept intended to address the potential radiation effects on Line D and Line Facilities in event of a beam spill. The construction approach utilizes careful tunneling methods based on available excavation and ground support technology. The tunneling rates and overall productivity on which the cost and project schedule are estimated are based on conservative assumptions with appropriate contingencies to address the uncertainty associated with geological conditions. The report is intended to provide supplemental information which will assist in assessing the feasibility of the tunnel and shaft concept and justification for future development of this particular aspect of remedial shielding for Line D and Line D Facilities.

  19. Progressive ratio (PR) schedules and the sipometer: Do they measure wanting, liking, and/or reward? A tribute to Anthony Sclafani and Karen Ackroff.

    Science.gov (United States)

    Kissileff, H R; Herzog, M

    2018-03-01

    This paper honors the contributions made by Anthony (Tony) Sclafani and Karen Ackroff to both the Columbia University Seminar on Appetitive Behavior and to the field of ingestive behavior in general. We review their use of the progressive ratio (PR) licking paradigm, to determine whether the taste of sucrose, independent of its post-ingestive effects, is always positively reinforcing in animals. They demonstrated a monotonic increase in licking as concentration increased, and obtained results identical to those obtained with a lever-pressing paradigm, but licking was easier and more natural than lever pressing. The PR paradigm was translated to evaluate liquid food reward value in humans. An instrument (the sipometer) was devised that initially permitted a few seconds access to small amounts of a sweet beverage as the participants increased the time to obtain it in 3-5-sec increments. The device went through two refinements and currently delivers the reinforcer and measures the pressure exerted to obtain it. The sipometer is compared with other techniques for measuring motivation and reward. The use of the sipometer and the PR method are discussed in relation to the theoretical challenges inherent in measuring motivation and pleasure, from both psychological and behavioral economics perspectives, and why it is or is not important to separate these processes for both theoretical and practical applications. Copyright © 2017 Elsevier Ltd. All rights reserved.

  20. Dewey Decimal Classification Online Project: Evaluation of a Library Schedule and Index Integrated into the Subject Searching Capabilities of an Online Catalog. Final Report.

    Science.gov (United States)

    Markey, Karen; Demeyer, Anh N.

    In this research project, subject terms from the Dewey Decimal Classification (DDC) Schedules and Relative Index were incorporated into an online catalog as searcher's tools for subject access, browsing, and display. Four features of the DDC were employed to help searchers browse for and match their own subject terms with the online catalog's…

  1. Self-certification and employee training of mail-order distributors of scheduled listed chemical products. Interim final rule with request for comment.

    Science.gov (United States)

    2011-04-13

    On October 12, 2010, the President signed the Combat Methamphetamine Enhancement Act of 2010 (MEA). It establishes new requirements for mail-order distributors of scheduled listed chemical products. Mail-order distributors must now self-certify to DEA in order to sell scheduled listed chemical products at retail. Sales at retail are those sales intended for personal use; mail-order distributors that sell scheduled listed chemical products not intended for personal use, e.g., sale to a university, are not affected by the new law. This self-certification must include a statement that the mail-order distributor understands each of the requirements that apply under part 1314 and agrees to comply with these requirements. Additionally, mail-order distributors are now required to train their employees prior to self certification. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements and other existing regulations related to self-certification.

  2. Ultra-rapid high dose irradiation schedules for the palliation of brain metastases: final results of the first two studies by the radiation therapy oncology group

    International Nuclear Information System (INIS)

    Borgelt, B.; Gelber, R.; Larson, M.; Hendrickson, F.; Griffin, T.; Rother, R.

    1981-01-01

    Between January, 1971, and February, 1976, the Radiation Therapy Oncology Group entered 1902 evaluable patients into two sequential Phase III national cooperative trials to study the effectiveness of different time dose radiotherapy schemes on the palliation of patients with brain metastases. Each trial included an optional arm into which patients were randomized to receive 1000 rad/1 fraction (26 patients, First study) or 1200 rad/2 fractions (33 patients, Second study). Comparisons were made with 143 control patients randomized by the same participating institutions to receive a more protracted course of irradiation (2000, 3000 or 4000 rad/1-4wks). Response of patients receiving ultra-rapid treatment, as assessed by the percent who had improvement in neurologic function, was comparable to that of patients receiving the more protracted schedules. Promptness of neurologic function improvement, treatment morbidity and median survival were also comparable to those of patients receiving 2000 to 4000 rad. However, the duration of improvement, time to progression of neurologic status and rate of complete disappearance of neurologic symptoms were generally less for those patients who received 1000 or 1200 rad. These results suggest that ultra-rapid, high dose irradiation schedules may not be so effective as higher dose schedules in the palliation of patients with brain metastases

  3. Efficient Academic Scheduling at the U.S. Naval Academy

    National Research Council Canada - National Science Library

    Zane, David

    2003-01-01

    This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...

  4. Measurement of the Branching Ratios of D+ and D+s Hadronic Decays to Four-Body Final States Containing a KS

    Science.gov (United States)

    Link, J. M.; Reyes, M.; Yager, P. M.; Anjos, J. C.; Bediaga, I.; Göbel, C.; Magnin, J.; Massafferi, A.; de Miranda, J. M.; Pepe, I. M.; Dos Reis, A. C.; Simão, F. R.; Carrillo, S.; Casimiro, E.; Sánchez-Hernández, A.; Uribe, C.; Vázquez, F.; Cinquini, L.; Cumalat, J. P.; O'Reilly, B.; Ramirez, J. E.; Vaandering, E. W.; Butler, J. N.; Cheung, H. W.; Gaines, I.; Garbincius, P. H.; Garren, L. A.; Gottschalk, E.; Kasper, P. H.; Kreymer, A. E.; Kutschke, R.; Bianco, S.; Fabbri, F. L.; Sarwar, S.; Zallo, A.; Cawlfield, C.; Kim, D. Y.; Rahimi, A.; Wiss, J.; Gardner, R.; Chung, Y. S.; Kang, J. S.; Ko, B. R.; Kwak, J. W.; Lee, K. B.; Park, H.; Alimonti, G.; Boschini, M.; Caccianiga, B.; D'Angelo, P.; Dicorato, M.; Dini, P.; Giammarchi, M.; Inzani, P.; Leveraro, F.; Malvezzi, S.; Menasce, D.; Mezzadri, M.; Milazzo, L.; Moroni, L.; Pedrini, D.; Pontoglio, C.; Prelz, F.; Rovere, M.; Sala, A.; Sala, S.; Davenport, T. F.; Agostino, L.; Arena, V.; Boca, G.; Bonomi, G.; Gianini, G.; Liguori, G.; Merlo, M.; Pantea, D.; Ratti, S. P.; Riccardi, C.; Segoni, I.; Viola, L.; Vitulo, P.; Hernandez, H.; Lopez, A. M.; Mendez, H.; Mendez, L.; Mirles, A.; Montiel, E.; Olaya, D.; Paris, A.; Quinones, J.; Rivera, C.; Xiong, W.; Zhang, Y.; Wilson, J. R.; Cho, K.; Handler, T.; Engh, D.; Hosack, M.; Johns, W. E.; Nehring, M.; Sheldon, P. D.; Stenson, K.; Webster, M.; Sheaff, M.

    2001-10-01

    We have studied hadronic four-body decays of D+ and D+s mesons with a KS in the final state using data recorded during the 1996-1997 fixed-target run of the Fermilab high energy photoproduction experiment FOCUS. We report a new branching ratio measurement of Γ(D+-->KSK- π+π+)/Γ(D+-->KSπ+π+π-) = 0.0768+/-0.0041+/-0.0032. We make the first observation of three new decay modes with branching ratios Γ(D+-->KSK+π+π- )/Γ(D+-->KSπ+π+π-) = 0.0562+/-0.0039+/-0.0040, Γ(D+-->KSK+K- π+)/Γ(D+-->KSπ+π+π-) = 0.0077+/-0.0015+/-0.0009, and Γ(D+s-->KSK+π+π- )/Γ(D+s-->KSK- π+π+) = 0.586+/-0.052+/-0.043, where in each case the first error is statistical and the second error is systematic.

  5. SPANR planning and scheduling

    Science.gov (United States)

    Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry

    2001-07-01

    SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.

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

    Science.gov (United States)

    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.

  7. Multiple determinants of transfer of evaluative function after conditioning with free-operant schedules of reinforcement.

    Science.gov (United States)

    Dack, Charlotte; Reed, Phil; McHugh, Louise

    2010-11-01

    The aim of the four present experiments was to explore how different schedules of reinforcement influence schedule-induced behavior, their impact on evaluative ratings given to conditioned stimuli associated with each schedule through evaluative conditioning, and the transfer of these evaluations through derived stimulus networks. Experiment 1 compared two contrasting response reinforcement rules (variable ratio [VR], variable interval [VI]). Experiment 2 varied the response to reinforcement rule between two schedules but equated the outcome to response rate (differential reinforcement of high rate [DRH] vs. VR). Experiment 3 compared molar and molecular aspects of contingencies of reinforcement (tandem VIVR vs. tandem VRVI). Finally, Experiment 4 employed schedules that induced low rates of responding to determine whether, under these circumstances, responses were more sensitive to the molecular aspects of a schedule (differential reinforcement of low rate [DRL] vs. VI). The findings suggest that the transfer of evaluative functions is determined mainly by differences in response rate between the schedules and the molar aspects of the schedules. However, when neither schedule was based on a strong response reinforcement rule, the transfer of evaluative judgments came under the control of the molecular aspects of the schedule.

  8. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

    Larco Martinelli, J.A.; Wiers, V.C.S.; Fransoo, J.C.

    2013-01-01

    Time is the most critical resource at the disposal of schedulers. Hence, an adequate management of time from the schedulers may impact positively on the scheduler’s productivity and responsiveness to uncertain scheduling environments. This paper presents a field study of how schedulers make use of

  9. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1992-03-01

    Title 44 United States Code, ''Public Printing and Documents,'' regulations cited in the General Services Administration's (GSA) ''Federal Information Resources Management Regulations'' (FIRMR), Part 201-9, ''Creation, Maintenance, and Use of Records,'' and regulation issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter XII, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 2, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 2 totally reorganizes the records schedules from a functional arrangement to an arrangement by the host office. A subject index and a conversion table have also been developed for the NRC schedules to allow staff to identify the new schedule numbers easily and to improve their ability to locate applicable schedules

  10. The influence of zirconia precursor/binding polymer mass ratio in the intermediate electrospun composite fibers on the phase transformation of final zirconia nanofibers

    Energy Technology Data Exchange (ETDEWEB)

    Rodaev, Vyacheslav V.; Zhigachev, Andrey O.; Korenkov, Viktor V.; Golovin, Yuri I. [Institute for Nanotechnology and Nanomaterials, Tambov State University, Internatsionalnaya Str. 33, 392000, Tambov (Russian Federation)

    2016-09-15

    Nanofibrous zirconia was fabricated by calcination of electrospun zirconium oxychloride/polyethylene oxide (PEO) composite fibers with different mass fraction of the components. ZrO{sub 2} nanofibers were characterized by scanning electron microscopy (SEM), nitrogen adsorption at 77 K, and X-ray diffractometry (XRD). It was revealed that increase in ZrOCl{sub 2}/PEO mass ratio above the threshold value significantly decreases tetragonal phase (t-ZrO{sub 2}) content and increases monoclinic phase (m-ZrO{sub 2}) content in final ceramic nanofibers. Distinct t-ZrO{sub 2} → m-ZrO{sub 2} transformation takes place when average ZrO{sub 2} grain size approaches to 30 nm. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  11. Measurement of Branching Ratios of $D^+$ and $D^+_s$ Hadronic Decays to Four-Body Final States Containing a $K^0_S$

    Energy Technology Data Exchange (ETDEWEB)

    Ko, Byeong Rok [Korea Univ., Seoul (South Korea)

    2001-12-01

    We have studied hadronic four-body de ays of $D^+$ and $D^+_s$ mesons with a $K^0_S$ in the final state using data recorded during the 1996-1997 fixed- target run at Fermilab high energy photoproduction experiment FOCUS.We report a new branching ratio of $\\Gamma(D^+ \\to K^0_S K^- \\pi^+\\pi^+$)/$\\Gamma$($D^+ \\to K^0_S \\pi^+\\pi^+ \\pi^-$) = 0.0768 $\\pm$ 0.0041 $\\pm$ 0.0032. We make the first observation of three new decay modes with branching ratios of the $\\Gamma(D^+ \\to K^0_S K^+ \\pi^+\\pi^-$)/$\\Gamma(D^+ \\to K^0_S \\pi^+\\pi^+\\pi^-$) = 0.05620 $\\pm$ 0.0039 $\\pm$ 0.0040, $\\Gamma(D^+ \\to K^0_S K^+K^-\\pi^+$)/$\\Gamma(D^+ \\to K^0_S \\pi^+\\pi^+\\pi^-$) = 0.0077 $\\pm$ 0.0015 $\\pm$ 0.0009 and $\\Gamma(D^+_s \\to K^0_S K^+\\pi^+\\pi^-$)/$\\Gamma(D^+_s \\to K^0_S K^- \\pi^+\\pi^+$) = 0.5860 $\\pm$ 0.052 $\\pm$ 0.043, where in each case the first error is statistical and the second error is systematic .

  12. Measurement of the branching ratios of D(+) and D(+)(s) hadronic decays to four-body final states containing a K(S).

    Science.gov (United States)

    Link, J M; Reyes, M; Yager, P M; Anjos, J C; Bediaga, I; Göbel, C; Magnin, J; Massafferi, A; de Miranda, J M; Pepe, I M; dos Reis, A C; Simão, F R; Carrillo, S; Casimiro, E; Sánchez-Hernández, A; Uribe, C; Vázquez, F; Cinquini, L; Cumalat, J P; O'Reilly, B; Ramirez, J E; Vaandering, E W; Butler, J N; Cheung, H W; Gaines, I; Garbincius, P H; Garren, L A; Gottschalk, E; Kasper, P H; Kreymer, A E; Kutschke, R; Bianco, S; Fabbri, F L; Sarwar, S; Zallo, A; Cawlfield, C; Kim, D Y; Rahimi, A; Wiss, J; Gardner, R; Chung, Y S; Kang, J S; Ko, B R; Kwak, J W; Lee, K B; Park, H; Alimonti, G; Boschini, M; Caccianiga, B; D'Angelo, P; DiCorato, M; Dini, P; Giammarchi, M; Inzani, P; Leveraro, F; Malvezzi, S; Menasce, D; Mezzadri, M; Milazzo, L; Moroni, L; Pedrini, D; Pontoglio, C; Prelz, F; Rovere, M; Sala, A; Sala, S; Davenport, T F; Agostino, L; Arena, V; Boca, G; Bonomi, G; Gianini, G; Liguori, G; Merlo, M; Pantea, D; Ratti, S P; Riccardi, C; Segoni, I; Viola, L; Vitulo, P; Hernandez, H; Lopez, A M; Mendez, H; Mendez, L; Mirles, A; Montiel, E; Olaya, D; Paris, A; Quinones, J; Rivera, C; Xiong, W; Zhang, Y; Wilson, J R; Cho, K; Handler, T; Engh, D; Hosack, M; Johns, W E; Nehring, M; Sheldon, P D; Stenson, K; Webster, M; Sheaff, M

    2001-10-15

    We have studied hadronic four-body decays of D(+) and D(+)(s) mesons with a K(S) in the final state using data recorded during the 1996-1997 fixed-target run of the Fermilab high energy photoproduction experiment FOCUS. We report a new branching ratio measurement of gamma(D(+)-->K(S)K-pi(+)pi(+))/gamma(D(+)-->K(S)pi(+)pi(+)pi(-)) = 0.0768+/-0.0041+/-0.0032. We make the first observation of three new decay modes with branching ratios gamma(D(+)-->K(S)K+pi(+)pi(-))/gamma(D(+)-->K(S)pi(+)pi(+)pi(-)) = 0.0562+/-0.0039+/-0.0040, gamma(D(+)-->K(S)K+K-pi(+))/gamma(D(+)-->K(S)pi(+)pi(+)pi(-)) = 0.0077+/-0.0015+/-0.0009, and gamma(D(+)(s)-->K(S)K+pi(+)pi(-))/gamma(D(+)(s)-->K(S)K-pi(+)pi(+)) = 0.586+/-0.052+/-0.043, where in each case the first error is statistical and the second error is systematic.

  13. Medicare Program; Merit-Based Incentive Payment System (MIPS) and Alternative Payment Model (APM) Incentive Under the Physician Fee Schedule, and Criteria for Physician-Focused Payment Models. Final rule with comment period.

    Science.gov (United States)

    2016-11-04

    The Medicare Access and CHIP Reauthorization Act of 2015 (MACRA) repeals the Medicare sustainable growth rate (SGR) methodology for updates to the physician fee schedule (PFS) and replaces it with a new approach to payment called the Quality Payment Program that rewards the delivery of high-quality patient care through two avenues: Advanced Alternative Payment Models (Advanced APMs) and the Merit-based Incentive Payment System (MIPS) for eligible clinicians or groups under the PFS. This final rule with comment period establishes incentives for participation in certain alternative payment models (APMs) and includes the criteria for use by the Physician-Focused Payment Model Technical Advisory Committee (PTAC) in making comments and recommendations on physician-focused payment models (PFPMs). Alternative Payment Models are payment approaches, developed in partnership with the clinician community, that provide added incentives to deliver high-quality and cost-efficient care. APMs can apply to a specific clinical condition, a care episode, or a population. This final rule with comment period also establishes the MIPS, a new program for certain Medicare-enrolled practitioners. MIPS will consolidate components of three existing programs, the Physician Quality Reporting System (PQRS), the Physician Value-based Payment Modifier (VM), and the Medicare Electronic Health Record (EHR) Incentive Program for Eligible Professionals (EPs), and will continue the focus on quality, cost, and use of certified EHR technology (CEHRT) in a cohesive program that avoids redundancies. In this final rule with comment period we have rebranded key terminology based on feedback from stakeholders, with the goal of selecting terms that will be more easily identified and understood by our stakeholders.

  14. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    Squires, K.G.

    1995-01-01

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

  15. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  16. Instructions, multiple schedules, and extinction: Distinguishing rule-governed from schedule-controlled behavior.

    Science.gov (United States)

    Hayes, S C; Brownstein, A J; Haas, J R; Greenway, D E

    1986-09-01

    Schedule sensitivity has usually been examined either through a multiple schedule or through changes in schedules after steady-state responding has been established. This study compared the effects of these two procedures when various instructions were given. Fifty-five college students responded in two 32-min sessions under a multiple fixed-ratio 18/differential-reinforcement-of-low-rate 6-s schedule, followed by one session of extinction. Some subjects received no instructions regarding the appropriate rates of responding, whereas others received instructions to respond slowly, rapidly, or both. Relative to the schedule in operation, the instructions were minimal, partially inaccurate, or accurate. When there was little schedule sensitivity in the multiple schedule, there was little in extinction. When apparently schedule-sensitive responding occurred in the multiple schedule, however, sensitivity in extinction occurred only if differential responding in the multiple schedule could not be due to rules supplied by the experimenter. This evidence shows that rule-governed behavior that occurs in the form of schedule-sensitive behavior may not in fact become schedule-sensitive even though it makes contact with the scheduled reinforcers.

  17. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis also compares the daily flight schedules that it designs with the schedules of the existing airlines. Furthermore, it creates instances that represent different economic and fuel-prices conditions and derives schedules under these different conditions. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas---model, computational method, and simulation for validation---is proposed.

  18. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  19. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad; Alnuweiri, Hussein M.; Alouini, Mohamed-Slim

    2012-01-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.

  20. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad

    2012-09-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.

  1. Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect

    Directory of Open Access Journals (Sweden)

    Mingbao Cheng

    2013-01-01

    Full Text Available We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect. The objective is to minimize the performance criteria of makespan and the total flow time. For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect. Furthermore, by using the shortest total processing times first (STPT rule, we construct the worst-case performance ratios for both criteria. Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.

  2. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Adults (19 Years of Age and ... diseases that can be prevented by vaccines . 2018 Immunization Schedule Recommended Vaccinations for Adults by Age and ...

  3. Instant Childhood Immunization Schedule

    Science.gov (United States)

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

  4. Web Publishing Schedule

    Science.gov (United States)

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

  5. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, H.; Skutella, M.; Woeginger, Gerhard

    2003-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  6. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Skutella, M.; Woeginger, G.J.; Paterson, M.

    2000-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  7. Outage scheduling and implementation

    International Nuclear Information System (INIS)

    Allison, J.E.; Segall, P.; Smith, R.R.

    1986-01-01

    Successful preparation and implementation of an outage schedule and completion of scheduled and emergent work within an identified critical path time frame is a result of careful coordination by Operations, Work Control, Maintenance, Engineering, Planning and Administration and others. At the Fast Flux Test Facility (FFTF) careful planning has been responsible for meeting all scheduled outage critical paths

  8. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

  9. Final results of the cadmium and spectral ratios obtained inside of the fuel rod positioned in the central position of the IPEN/MB-01 nuclear reactor

    Energy Technology Data Exchange (ETDEWEB)

    Bitelli, Ulysses d' Utra; Mura, Luiz Ernesto C.; Santos, Diogo Feliciano dos, E-mail: ubitelli@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil); Lambiasi, Beatriz G.N. [Centro Tecnologico da Marinha em Sao Paulo (CTMSP), SP (Brazil)

    2015-07-01

    The spectral ratios are very important to determine some nuclear reactors parameters such as reaction rates, fuel lifetime, etc and some safety operational conditions. This study aims to determine the spectral ratios in 2 (two) spatial positions located inside the core of the Nuclear Reactor IPEN/MB-01. These places are at the central position of the nuclear reactor core in an asymptotic neutron flux region. The experiment consists in inserting different activation foil detectors inside an experimental fuel rod. The experimental rod is assembled at the central position of the reactor core. Activation neutron foil detectors of different elements such as {sup 197}Au, {sup 238}U, {sup 45}Sc, {sup 58}Ni, {sup 24}Mg, {sup 47}Ti and {sup 115m}In were used to cover a large range of neutron spectrum. Saturation activity per target nucleus was obtained by gamma spectrometry using a HPGe system. The experimental cadmium ratios compared with values computed by MCNP-4C code show good agreement. (author)

  10. Brief-stimulus presentations on multiform tandem schedules

    OpenAIRE

    Reed, Phil

    1994-01-01

    Three experiments examined the influence of a brief stimulus (a light) on the behavior of food-deprived rats whose lever pressing on tandem schedules comprising components of different schedule types resulted in food presentation. In Experiment 1, either a tandem variable-ratio variable-interval or a tandem variable-interval variable-ratio schedule was used. The variable-interval requirement in the tandem variable-ratio variable-interval schedule was yoked to the time taken to complete the va...

  11. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

    Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

  12. Revised data taking schedule with ion beams

    CERN Document Server

    Gazdzicki, Marek; Aduszkiewicz, A; Andrieu, B; Anticic, T; Antoniou, N; Argyriades, J; Asryan, A G; Baatar, B; Blondel, A; Blumer, J; Boldizsar, L; Bravar, A; Brzychczyk, J; Bubak, A; Bunyatov, S A; Choi, K U; Christakoglou, P; Chung, P; Cleymans, J; Derkach, D A; Diakonos, F; Dominik, W; Dumarchez, J; Engel, R; Ereditato, A; Feofilov, G A; Fodor, Z; Ferrero, A; Gazdzicki, M; Golubeva, M; Grebieszkow, K; Grzeszczuk, A; Guber, F; Hasegawa, T; Haungs, A; Igolkin, S; Ivanov, A S; Ivashkin, A; Kadija, K; Katrynska, N; Kielczewska, D; Kikola, D; Kisiel, J; Kobayashi, T; Kolesnikov, V I; Kolev, D; Kolevatov, R S; Kondratiev, V P; Kowalski, S; Kurepin, A; Lacey, R; Laszlo, A; Lyubushkin, V V; Majka, Z; I Malakhov, A; Marchionni, A; Marcinek, A; Maris, I; Matveev, V; Melkumov, G L; Meregaglia, A; Messina, M; Mijakowski, P; Mitrovski, M; Montaruli, T; Mrówczynski, St; Murphy, S; Nakadaira, T; Naumenko, P A; Nikolic, V; Nishikawa, K; Palczewski, T; Pálla, G; Panagiotou, A D; Peryt, W; Planeta, R; Pluta, J; Popov, B A; Posiadala, M; Przewlocki, P; Rauch, W; Ravonel, M; Renfordt, R; Röhrich, D; Rondio, E; Rossi, B; Roth, M; Rubbia, A; Rybczynski, M; Sadovskii, A; Sakashita, K; Schuster, T; Sekiguchi, T; Seyboth, P; Shibata, M; Sissakian, A N; Skrzypczak, E; Slodkowski, M; Sorin, A S; Staszel, P; Stefanek, G; Stepaniak, J; Strabel, C; Ströbele, H; Susa, T; Szentpétery, I; Szuba, M; Tada, M; Taranenko, A; Tsenov, R; Ulrich, R; Unger, M; Vassiliou, M; Vechernin, V V; Vesztergombi, G; Wlodarczyk, Z; Wojtaszek, A; Zipper, W; CERN. Geneva. SPS and PS Experiments Committee; SPSC

    2009-01-01

    This document presents the revised data taking schedule of NA61 with ion beams. The revision takes into account limitations due to the new LHC schedule as well as final results concerning the physics performance with secondary ion beams. It is proposed to take data with primary Ar and Xe beams in 2012 and 2014, respectively, and to test and use for physics a secondary B beam from primary Pb beam fragmentation in 2010, 2011 and 2013.

  13. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

    This paper describes the Project Scheduling system being employed by the Decommissioning Operations Contractor at the Shippingport Station Decommissioning Project (SSDP). Results from the planning system show that the project continues to achieve its cost and schedule goals. An integrated cost and schedule control system (C/SCS) which uses the concept of earned value for measurement of performance was instituted in accordance with DOE orders. The schedule and cost variances generated by the C/SCS system are used to confirm management's assessment of project status. This paper describes the types of schedules and tools used on the SSDP project to plan and monitor the work, and identifies factors that are unique to a decommissioning project that make scheduling critical to the achievement of the project's goals. 1 fig

  14. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

    This Program Reference Schedule Baseline (PRSB) provides the baseline Program-level milestones and associated schedules for the Civilian Radioactive Waste Management Program. It integrates all Program-level schedule-related activities. This schedule baseline will be used by the Director, Office of Civilian Radioactive Waste Management (OCRWM), and his staff to monitor compliance with Program objectives. Chapter 1 includes brief discussions concerning the relationship of the PRSB to the Program Reference Cost Baseline (PRCB), the Mission Plan, the Project Decision Schedule, the Total System Life Cycle Cost report, the Program Management Information System report, the Program Milestone Review, annual budget preparation, and system element plans. Chapter 2 includes the identification of all Level 0, or Program-level, milestones, while Chapter 3 presents and discusses the critical path schedules that correspond to those Level 0 milestones

  15. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

    International audience; —Symbiotic job scheduling exploits the fact that in a system with shared resources, the performance of jobs is impacted by the behavior of other co-running jobs. By coscheduling combinations of jobs that have low interference, the performance of a system can be increased. In this paper, we investigate the impact of using symbiotic job scheduling for increasing throughput. We find that even for a theoretically optimal scheduler, this impact is very low, despite the subs...

  16. Investigation of the application of 4He/36Ar ratio and 222Rn measurements to the exploration for uranium mineral deposits. Final report

    International Nuclear Information System (INIS)

    Schutz, D.F.

    1981-06-01

    The sites of three uranium ore deposits of diverse geologic settings have been studied by a limited sampling of near-surface and subsurface soil gas, soil, and core materials to determine whether the uranium decay products 226 Ra, 222 Rn, 210 Pb, and 4 He may be useful as indicators of subsurface uranium mineralization. It was concluded that in the near-surface environment of all three sites, the 222 Rn levels were less than would be expected from closed system equilibrium with the soil itself and any anomalies with the underlying ore is fortuitous and does not provide a basis for guiding an exploration drilling operation. In contrast to the results for 222 Rn, the results for adsorbed 210 Pb show a number of locations with 210 Pb concentrations in the near-surface environment in excess of that expected from closed systems accumulations. However, the value of 210 Pb measurements as indicators of subsurface uranium deposits is considered inconclusive by the author. Radium-226 distributions in the near-surface samples at the three sites do not show significant patterns that are related to underlying ore. Most soil-gas samples have 4 He/ 36 Ar ratios significantly in excess of atmospheric levels. However, the lack of consistent relation to uranium mineralization either in areal or vertical distribution, coupled with the ability to measure excess 4 He in soils not associated in any way with uranium mineralization leads to the interpretation that much, if not all of the excess 4 He measured in soil gas is the result of in situ formation and not from allogenic sources

  17. The influence of "preparedness" on autoshaping, schedule performance, and choice.

    Science.gov (United States)

    Burns, J D; Malone, J C

    1992-11-01

    Two groups of experimentally naive pigeons were exposed to an autoshaping procedure in which the response key was mounted on the wall (the conventional location) or on the floor of the chamber. In two experiments, subjects readily responded to the wall key, but floor-key subjects required shaping. A subsequent experiment compared performance of wall- and floor-key groups on an ascending series of fixed-ratio schedule values, resistance to extinction, differential reinforcement of other behavior, and reversal of key assignment. Each experiment was followed by several sessions of fixed-ratio training; the performance of the wall- and floor-key groups was almost identical throughout. In the final experiment, a fixed-ratio requirement could be completed on either or both keys. Birds initially chose the key on which they had responded during the preceding (reversal of key assignment) experiment. However, within a few sessions both groups showed almost exclusive preference for the floor key. Preference for a key located on the floor may follow from the fact that pigeons are ground feeders and may thus be more "prepared" to peck the floor than to peck a wall. However, autoshaping, under the conditions prevailing here, occurred much more readily to the wall key, suggesting that pecking a vertical surface is more highly prepared. Difficulties in determining relative preparedness seem moot, however, given the lack of between-group differences in the intervening experiments. It is thus unlikely that schedule performances critically depend upon the specific operant response involved.

  18. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

    The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…

  19. Range Scheduling Aid (RSA)

    Science.gov (United States)

    Logan, J. R.; Pulvermacher, M. K.

    1991-01-01

    Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

  20. Golden Ratio

    Indian Academy of Sciences (India)

    Our attraction to another body increases if the body is symmetricaland in proportion. If a face or a structure is in proportion,we are more likely to notice it and find it beautiful.The universal ratio of beauty is the 'Golden Ratio', found inmany structures. This ratio comes from Fibonacci numbers.In this article, we explore this ...

  1. Golden Ratio

    Indian Academy of Sciences (India)

    Keywords. Fibonacci numbers, golden ratio, Sanskrit prosody, solar panel. Abstract. Our attraction to another body increases if the body is symmetricaland in proportion. If a face or a structure is in proportion,we are more likely to notice it and find it beautiful.The universal ratio of beauty is the 'Golden Ratio', found inmany ...

  2. Golden Ratio

    Indian Academy of Sciences (India)

    Our attraction to another body increases if the body is sym- metrical and in proportion. If a face or a structure is in pro- portion, we are more likely to notice it and find it beautiful. The universal ratio of beauty is the 'Golden Ratio', found in many structures. This ratio comes from Fibonacci numbers. In this article, we explore this ...

  3. Influences on Cocaine Tolerance Assessed under a Multiple Conjunctive Schedule of Reinforcement

    Science.gov (United States)

    Yoon, Jin Ho; Branch, Marc N.

    2009-01-01

    Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the…

  4. Generating variable and random schedules of reinforcement using Microsoft Excel macros.

    Science.gov (United States)

    Bancroft, Stacie L; Bourret, Jason C

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values.

  5. NRC comprehensive records disposition schedule. Revision 3

    International Nuclear Information System (INIS)

    1998-02-01

    Title 44 US Code, ''Public Printing and Documents,'' regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ''Management and Use of Information and Records,'' and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA's General Records Schedule (dated August 1995)

  6. Scheduling multimedia services in cloud computing environment

    Science.gov (United States)

    Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing

    2018-02-01

    Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.

  7. NRC comprehensive records disposition schedule. Revision 3

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

    Title 44 US Code, ``Public Printing and Documents,`` regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ``Management and Use of Information and Records,`` and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ``Records Management,`` require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA`s General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ``NRC`s Comprehensive Records Disposition Schedule,`` and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA`s General Records Schedule (dated August 1995).

  8. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

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

  9. The Composition of the Master Schedule

    Science.gov (United States)

    Thomas, Cynthia C.; Behrend, Dirk; MacMillan, Daniel S.

    2010-01-01

    Over a period of about four months, the IVS Coordinating Center (IVSCC) each year composes the Master Schedule for the IVS observing program of the next calendar year. The process begins in early July when the IVSCC contacts the IVS Network Stations to request information about available station time as well as holiday and maintenance schedules for the upcoming year. Going through various planning stages and a review process with the IVS Observing Program Committee (OPC), the final version of the Master Schedule is posted by early November. We describe the general steps of the composition and illustrate them with the example of the planning for the Master Schedule of the 2010 observing year.

  10. Courts, Scheduled Damages, and Medical Malpractice Insurance

    DEFF Research Database (Denmark)

    Bertoli, Paola; Grembi, Veronica

    We assess the impact of the introduction of schedules of non-economic damages (i.e. tiered caps systems) on the behavior of insurers operating in the medical liability market for hospitals while controlling the performance of the judicial system, measured as court backlog. Using a difference......-in-differences strategy on Italian data, we find that the introduction of schedules increases the presence of insurers (i.e. medical liability market attractiveness) only in inefficient judicial districts. In the same way, court inefficiency is attractive to insurers for average values of schedules penetration...... of the market, with an increasing positive impact of inefficiency as the territorial coverage of schedules increases. Finally, no significant impact is registered on paid premiums. Our analysis sheds light on a complex set of elements affecting the decisions of insurers in malpractice markets. The analysis...

  11. Sex ratios

    OpenAIRE

    West, Stuart A; Reece, S E; Sheldon, Ben C

    2002-01-01

    Sex ratio theory attempts to explain variation at all levels (species, population, individual, brood) in the proportion of offspring that are male (the sex ratio). In many cases this work has been extremely successful, providing qualitative and even quantitative explanations of sex ratio variation. However, this is not always the situation, and one of the greatest remaining problems is explaining broad taxonomic patterns. Specifically, why do different organisms show so ...

  12. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  13. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  14. CERN confirms LHC schedule

    CERN Document Server

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.

  15. DMEPOS Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...

  16. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features......’ priority as well as multimodal team allocation, enhanced project schedules (EPS), where remedial actions scenarios (RAS) are added, were introduced. They reflect potential schedule modifications in case of uncertainties and promote a dynamic sequencing of involved tasks rather than the static conventional...... this document as an instruction set. The electronic file of your paper will be formatted further at Journal of Software. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column....

  17. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...... depends on the actual stand allocation but also on the number of zones and the layout of these. A mathematical model of the problem is proposed, which integrates the stand allocation and the staff scheduling. A heuristic solution method is developed and applied on a real case from British Airways, London...

  18. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-11-01

    This single page document is the November 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the production reactor.

  19. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-01

    This single page document is the October 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  20. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-15

    This single page document is the October 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  1. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-09-15

    This single page document is the September 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  2. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-15

    This single page document is the December 16, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  3. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-01

    This single page document is the December 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  4. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  5. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  6. Technology for planning and scheduling under complex constraints

    Science.gov (United States)

    Alguire, Karen M.; Pedro Gomes, Carla O.

    1997-02-01

    Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

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

    Science.gov (United States)

    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.

  8. Potential support ratios

    DEFF Research Database (Denmark)

    Kjærgaard, Søren; Canudas-Romo, Vladimir

    2017-01-01

    The ‘prospective potential support ratio’ has been proposed by researchers as a measure that accurately quantifies the burden of ageing, by identifying the fraction of a population that has passed a certain measure of longevity, for example, 17 years of life expectancy. Nevertheless......, the prospective potential support ratio usually focuses on the current mortality schedule, or period life expectancy. Instead, in this paper we look at the actual mortality experienced by cohorts in a population, using cohort life tables. We analyse differences between the two perspectives using mortality models...

  9. ATLAS construction schedule

    CERN Multimedia

    Kotamaki, M

    The goal during the last few months has been to freeze and baseline as much as possible the schedules of various ATLAS systems and activities. The main motivations for the re-baselining of the schedules have been the new LHC schedule aiming at first collisions in early 2006 and the encountered delays in civil engineering as well as in the production of some of the detectors. The process was started by first preparing a new installation schedule that takes into account all the new external constraints and the new ATLAS staging scenario. The installation schedule version 3 was approved in the March EB and it provides the Ready For Installation (RFI) milestones for each system, i.e. the date when the system should be available for the start of the installation. TCn is now interacting with the systems aiming at a more realistic and resource loaded version 4 before the end of the year. Using the new RFI milestones as driving dates a new summary schedule has been prepared, or is under preparation, for each system....

  10. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

    Nuijten, W.P.M.; Le Pape, C.

    1998-01-01

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

  11. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

    Whitman, N.M.

    1993-01-01

    Planning and scheduling is a process whose time has come to PSI Energy. With an awareness of the challenges ahead, individuals must look for ways to enhance the corporate competitiveness. Working toward this goal means that each individual has to dedicate themselves to this more competitive corporate environment. Being competitive may be defined as the ability of each employee to add value to the corporation's economic well being. The timely and successful implementation of projects greatly enhances competitiveness. Those projects that do not do well often suffer from lack of proper execution - not for lack of talent or strategic vision. Projects are consumers of resources such as cash and people. They produce a return when completed and will generate a better return when properly completed utilizing proven project management techniques. Completing projects on time, within budget and meeting customer expectations is the way a corporation builds it's future. This paper offers suggestions on implementing planning and scheduling and provides a review of results in the form of management reports

  12. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

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

  13. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    2015-01-01

    of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal......Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... utility of being at the origin. Another issue is that models with the exponential marginal utility formulation suffer from empirical identification problems. Though our results are not decisive, they partly support the constant-affine specification, in which the value of travel time variability...

  14. Measurements of t t bar cross sections in association with b jets and inclusive jets and their ratio using dilepton final states in pp collisions at √{ s } = 13TeV

    Science.gov (United States)

    Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Asilar, E.; Bergauer, T.; Brandstetter, J.; Brondolin, E.; Dragicevic, M.; Erö, J.; Flechl, M.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Hörmann, N.; Hrubec, J.; Jeitler, M.; König, A.; Krätschmer, I.; Liko, D.; Matsushita, T.; Mikulec, I.; Rabady, D.; Rad, N.; Rohringer, H.; Schieck, J.; Strauss, J.; Waltenberger, W.; Wulz, C.-E.; Chekhovsky, V.; Mossolov, V.; Suarez Gonzalez, J.; Shumeiko, N.; Alderweireldt, S.; De Wolf, E. A.; Janssen, X.; Lauwers, J.; Van De Klundert, M.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Van Spilbeeck, A.; Abu Zeid, S.; Blekman, F.; D'Hondt, J.; De Bruyn, I.; De Clercq, J.; Deroover, K.; Lowette, S.; Moortgat, S.; Moreels, L.; Olbrechts, A.; Python, Q.; Skovpen, K.; Tavernier, S.; Van Doninck, W.; Van Mulders, P.; Van Parijs, I.; Brun, H.; Clerbaux, B.; De Lentdecker, G.; Delannoy, H.; Fasanella, G.; Favart, L.; Goldouzian, R.; Grebenyuk, A.; Karapostoli, G.; Lenzi, T.; Luetic, J.; Maerschalk, T.; Marinov, A.; Randle-conde, A.; Seva, T.; Vander Velde, C.; Vanlaer, P.; Vannerom, D.; Yonamine, R.; Zenoni, F.; Zhang, F.; Cimmino, A.; Cornelis, T.; Dobur, D.; Fagot, A.; Gul, M.; Khvastunov, I.; Poyraz, D.; Salva, S.; Schöfbeck, R.; Tytgat, M.; Van Driessche, W.; Verbeke, W.; Zaganidis, N.; Bakhshiansohi, H.; Bondu, O.; Brochet, S.; Bruno, G.; Caudron, A.; De Visscher, S.; Delaere, C.; Delcourt, M.; Francois, B.; Giammanco, A.; Jafari, A.; Komm, M.; Krintiras, G.; Lemaitre, V.; Magitteri, A.; Mertens, A.; Musich, M.; Piotrzkowski, K.; Quertenmont, L.; Vidal Marono, M.; Wertz, S.; Beliy, N.; Aldá Júnior, W. L.; Alves, F. L.; Alves, G. A.; Brito, L.; Hensel, C.; Moraes, A.; Pol, M. E.; Rebello Teles, P.; Belchior Batista Das Chagas, E.; Carvalho, W.; Chinellato, J.; Custódio, A.; Da Costa, E. M.; Da Silveira, G. G.; De Jesus Damiao, D.; Fonseca De Souza, S.; Huertas Guativa, L. M.; Malbouisson, H.; Mora Herrera, C.; Mundim, L.; Nogima, H.; Santoro, A.; Sznajder, A.; Tonelli Manganote, E. J.; Torres Da Silva De Araujo, F.; Vilela Pereira, A.; Ahuja, S.; Bernardes, C. A.; Fernandez Perez Tomei, T. R.; Gregores, E. M.; Mercadante, P. G.; Moon, C. S.; Novaes, S. F.; Padula, Sandra S.; Romero Abad, D.; Ruiz Vargas, J. C.; Aleksandrov, A.; Hadjiiska, R.; Iaydjiev, P.; Rodozov, M.; Stoykova, S.; Sultanov, G.; Vutova, M.; Dimitrov, A.; Glushkov, I.; Litov, L.; Pavlov, B.; Petkov, P.; Fang, W.; Gao, X.; Ahmad, M.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Chen, M.; Chen, Y.; Jiang, C. H.; Leggat, D.; Liu, Z.; Romeo, F.; Shaheen, S. M.; Spiezia, A.; Tao, J.; Wang, C.; Wang, Z.; Yazgan, E.; Zhang, H.; Zhao, J.; Ban, Y.; Chen, G.; Li, Q.; Liu, S.; Mao, Y.; Qian, S. J.; Wang, D.; Xu, Z.; Avila, C.; Cabrera, A.; Chaparro Sierra, L. F.; Florez, C.; González Hernández, C. F.; Ruiz Alvarez, J. D.; Godinovic, N.; Lelas, D.; Puljak, I.; Ribeiro Cipriano, P. M.; Sculac, T.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Ferencek, D.; Kadija, K.; Mesic, B.; Susa, T.; Ather, M. W.; Attikis, A.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Rykaczewski, H.; Finger, M.; Finger, M.; Carrera Jarrin, E.; Abdelalim, A. A.; Mohammed, Y.; Salama, E.; Dewanjee, R. K.; Kadastik, M.; Perrini, L.; Raidal, M.; Tiko, A.; Veelken, C.; Eerola, P.; Pekkanen, J.; Voutilainen, M.; Härkönen, J.; Järvinen, T.; Karimäki, V.; Kinnunen, R.; Lampén, T.; Lassila-Perini, K.; Lehti, S.; Lindén, T.; Luukka, P.; Tuominen, E.; Tuominiemi, J.; Tuovinen, E.; Talvitie, J.; Tuuva, T.; Besancon, M.; Couderc, F.; Dejardin, M.; Denegri, D.; Faure, J. L.; Ferri, F.; Ganjour, S.; Ghosh, S.; Givernaud, A.; Gras, P.; Hamel de Monchenault, G.; Jarry, P.; Kucher, I.; Locci, E.; Machet, M.; Malcles, J.; Rander, J.; Rosowsky, A.; Sahin, M. Ö.; Titov, M.; Abdulsalam, A.; Antropov, I.; Baffioni, S.; Beaudette, F.; Busson, P.; Cadamuro, L.; Chapon, E.; Charlot, C.; Davignon, O.; Granier de Cassagnac, R.; Jo, M.; Lisniak, S.; Lobanov, A.; Miné, P.; Nguyen, M.; Ochando, C.; Ortona, G.; Paganini, P.; Pigard, P.; Regnard, S.; Salerno, R.; Sirois, Y.; Stahl Leiton, A. G.; Strebler, T.; Yilmaz, Y.; Zabi, A.; Zghiche, A.; Agram, J.-L.; Andrea, J.; Bloch, D.; Brom, J.-M.; Buttignol, M.; Chabert, E. C.; Chanon, N.; Collard, C.; Conte, E.; Coubez, X.; Fontaine, J.-C.; Gelé, D.; Goerlach, U.; Le Bihan, A.-C.; Van Hove, P.; Gadrat, S.; Beauceron, S.; Bernet, C.; Boudoul, G.; Chierici, R.; Contardo, D.; Courbon, B.; Depasse, P.; El Mamouni, H.; Fay, J.; Finco, L.; Gascon, S.; Gouzevitch, M.; Grenier, G.; Ille, B.; Lagarde, F.; Laktineh, I. B.; Lethuillier, M.; Mirabito, L.; Pequegnot, A. L.; Perries, S.; Popov, A.; Sordini, V.; Vander Donckt, M.; Viret, S.; Toriashvili, T.; Lomidze, D.; Autermann, C.; Beranek, S.; Feld, L.; Kiesel, M. K.; Klein, K.; Lipinski, M.; Preuten, M.; Schomakers, C.; Schulz, J.; Verlage, T.; Albert, A.; Brodski, M.; Dietz-Laursonn, E.; Duchardt, D.; Endres, M.; Erdmann, M.; Erdweg, S.; Esch, T.; Fischer, R.; Güth, A.; Hamer, M.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Knutzen, S.; Merschmeyer, M.; Meyer, A.; Millet, P.; Mukherjee, S.; Olschewski, M.; Padeken, K.; Pook, T.; Radziej, M.; Reithler, H.; Rieger, M.; Scheuch, F.; Sonnenschein, L.; Teyssier, D.; Thüer, S.; Flügge, G.; Kargoll, B.; Kress, T.; Künsken, A.; Lingemann, J.; Müller, T.; Nehrkorn, A.; Nowack, A.; Pistone, C.; Pooth, O.; Stahl, A.; Aldaya Martin, M.; Arndt, T.; Asawatangtrakuldee, C.; Beernaert, K.; Behnke, O.; Behrens, U.; Bin Anuar, A. A.; Borras, K.; Botta, V.; Campbell, A.; Connor, P.; Contreras-Campana, C.; Costanza, F.; Diez Pardos, C.; Eckerlin, G.; Eckstein, D.; Eichhorn, T.; Eren, E.; Gallo, E.; Garay Garcia, J.; Geiser, A.; Gizhko, A.; Grados Luyando, J. M.; Grohsjean, A.; Gunnellini, P.; Harb, A.; Hauk, J.; Hempel, M.; Jung, H.; Kalogeropoulos, A.; Kasemann, M.; Keaveney, J.; Kleinwort, C.; Korol, I.; Krücker, D.; Lange, W.; Lelek, A.; Lenz, T.; Leonard, J.; Lipka, K.; Lohmann, W.; Mankel, R.; Melzer-Pellmann, I.-A.; Meyer, A. B.; Mittag, G.; Mnich, J.; Mussgiller, A.; Ntomari, E.; Pitzl, D.; Placakyte, R.; Raspereza, A.; Roland, B.; Savitskyi, M.; Saxena, P.; Shevchenko, R.; Spannagel, S.; Stefaniuk, N.; Van Onsem, G. P.; Walsh, R.; Wen, Y.; Wichmann, K.; Wissing, C.; Bein, S.; Blobel, V.; Centis Vignali, M.; Draeger, A. R.; Dreyer, T.; Garutti, E.; Gonzalez, D.; Haller, J.; Hoffmann, M.; Junkes, A.; Klanner, R.; Kogler, R.; Kovalchuk, N.; Kurz, S.; Lapsien, T.; Marchesini, I.; Marconi, D.; Meyer, M.; Niedziela, M.; Nowatschin, D.; Pantaleo, F.; Peiffer, T.; Perieanu, A.; Scharf, C.; Schleper, P.; Schmidt, A.; Schumann, S.; Schwandt, J.; Sonneveld, J.; Stadie, H.; Steinbrück, G.; Stober, F. M.; Stöver, M.; Tholen, H.; Troendle, D.; Usai, E.; Vanelderen, L.; Vanhoefer, A.; Vormwald, B.; Akbiyik, M.; Barth, C.; Baur, S.; Baus, C.; Berger, J.; Butz, E.; Caspart, R.; Chwalek, T.; Colombo, F.; De Boer, W.; Dierlamm, A.; Freund, B.; Friese, R.; Giffels, M.; Gilbert, A.; Haitz, D.; Hartmann, F.; Heindl, S. M.; Husemann, U.; Kassel, F.; Kudella, S.; Mildner, H.; Mozer, M. U.; Müller, Th.; Plagge, M.; Quast, G.; Rabbertz, K.; Schröder, M.; Shvetsov, I.; Sieber, G.; Simonis, H. J.; Ulrich, R.; Wayand, S.; Weber, M.; Weiler, T.; Williamson, S.; Wöhrmann, C.; Wolf, R.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Giakoumopoulou, V. A.; Kyriakis, A.; Loukas, D.; Topsis-Giotis, I.; Kesisoglou, S.; Panagiotou, A.; Saoulidou, N.; Evangelou, I.; Flouris, G.; Foudas, C.; Kokkas, P.; Manthos, N.; Papadopoulos, I.; Paradas, E.; Strologas, J.; Triantis, F. A.; Csanad, M.; Filipovic, N.; Pasztor, G.; Bencze, G.; Hajdu, C.; Horvath, D.; Sikler, F.; Veszpremi, V.; Vesztergombi, G.; Zsigmond, A. J.; Beni, N.; Czellar, S.; Karancsi, J.; Makovec, A.; Molnar, J.; Szillasi, Z.; Bartók, M.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Choudhury, S.; Komaragiri, J. R.; Bahinipati, S.; Bhowmik, S.; Mal, P.; Mandal, K.; Nayak, A.; Sahoo, D. K.; Sahoo, N.; Swain, S. K.; Bansal, S.; Beri, S. B.; Bhatnagar, V.; Bhawandeep, U.; Chawla, R.; Dhingra, N.; Kalsi, A. K.; Kaur, A.; Kaur, M.; Kumar, R.; Kumari, P.; Mehta, A.; Mittal, M.; Singh, J. B.; Walia, G.; Kumar, Ashok; Shah, Aashaq; Bhardwaj, A.; Chauhan, S.; Choudhary, B. C.; Garg, R. B.; Keshri, S.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, R.; Sharma, V.; Bhattacharya, R.; Bhattacharya, S.; Dey, S.; Dutt, S.; Dutta, S.; Ghosh, S.; Majumdar, N.; Modak, A.; Mondal, K.; Mukhopadhyay, S.; Nandan, S.; Purohit, A.; Roy, A.; Roy, D.; Roy Chowdhury, S.; Sarkar, S.; Sharan, M.; Thakur, S.; Behera, P. K.; Chudasama, R.; Dutta, D.; Jha, V.; Kumar, V.; Mohanty, A. K.; Netrakanti, P. K.; Pant, L. M.; Shukla, P.; Topkar, A.; Aziz, T.; Dugad, S.; Mahakud, B.; Mitra, S.; Mohanty, G. B.; Parida, B.; Sur, N.; Sutar, B.; Banerjee, S.; Bhattacharya, S.; Chatterjee, S.; Das, P.; Guchait, M.; Jain, Sa.; Kumar, S.; Maity, M.; Majumder, G.; Mazumdar, K.; Sarkar, T.; Wickramage, N.; Chauhan, S.; Dube, S.; Hegde, V.; Kapoor, A.; Kothekar, K.; Pandey, S.; Rane, A.; Sharma, S.; Chenarani, S.; Eskandari Tadavani, E.; Etesami, S. M.; Khakzad, M.; Mohammadi Najafabadi, M.; Naseri, M.; Paktinat Mehdiabadi, S.; Rezaei Hosseinabadi, F.; Safarzadeh, B.; Zeinali, M.; Felcini, M.; Grunewald, M.; Abbrescia, M.; Calabria, C.; Caputo, C.; Colaleo, A.; Creanza, D.; Cristella, L.; De Filippis, N.; De Palma, M.; Fiore, L.; Iaselli, G.; Maggi, G.; Maggi, M.; Miniello, G.; My, S.; Nuzzo, S.; Pompili, A.; Pugliese, G.; Radogna, R.; Ranieri, A.; Selvaggi, G.; Sharma, A.; Silvestris, L.; Venditti, R.; Verwilligen, P.; Abbiendi, G.; Battilana, C.; Bonacorsi, D.; Braibant-Giacomelli, S.; Brigliadori, L.; Campanini, R.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Chhibra, S. S.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Guiducci, L.; Marcellini, S.; Masetti, G.; Navarria, F. L.; Perrotta, A.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Albergo, S.; Costa, S.; Di Mattia, A.; Giordano, F.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Chatterjee, K.; Ciulli, V.; Civinini, C.; D'Alessandro, R.; Focardi, E.; Lenzi, P.; Meschini, M.; Paoletti, S.; Russo, L.; Sguazzoni, G.; Strom, D.; Viliani, L.; Benussi, L.; Bianco, S.; Fabbri, F.; Piccolo, D.; Primavera, F.; Calvelli, V.; Ferro, F.; Robutti, E.; Tosi, S.; Brianza, L.; Brivio, F.; Ciriolo, V.; Dinardo, M. E.; Fiorendi, S.; Gennai, S.; Ghezzi, A.; Govoni, P.; Malberti, M.; Malvezzi, S.; Manzoni, R. A.; Menasce, D.; Moroni, L.; Paganoni, M.; Pauwels, K.; Pedrini, D.; Pigazzini, S.; Ragazzi, S.; Tabarelli de Fatis, T.; Buontempo, S.; Cavallo, N.; Di Guida, S.; Esposito, M.; Fabozzi, F.; Fienga, F.; Iorio, A. O. M.; Khan, W. A.; Lanza, G.; Lista, L.; Meola, S.; Paolucci, P.; Sciacca, C.; Thyssen, F.; Azzi, P.; Bacchetta, N.; Benato, L.; Boletti, A.; Carlin, R.; Carvalho Antunes De Oliveira, A.; Checchia, P.; Dall'Osso, M.; De Castro Manzano, P.; Dorigo, T.; Gasparini, U.; Gozzelino, A.; Lacaprara, S.; Margoni, M.; Meneguzzo, A. T.; Michelotto, M.; Montecassiano, F.; Passaseo, M.; Pozzobon, N.; Ronchese, P.; Rossin, R.; Simonetto, F.; Torassa, E.; Zanetti, M.; Zotto, P.; Zumerle, G.; Braghieri, A.; Fallavollita, F.; Magnani, A.; Montagna, P.; Ratti, S. P.; Re, V.; Ressegotti, M.; Riccardi, C.; Salvini, P.; Vai, I.; Vitulo, P.; Alunni Solestizi, L.; Bilei, G. M.; Ciangottini, D.; Fanò, L.; Lariccia, P.; Leonardi, R.; Mantovani, G.; Mariani, V.; Menichelli, M.; Saha, A.; Santocchia, A.; Spiga, D.; Androsov, K.; Azzurri, P.; Bagliesi, G.; Bernardini, J.; Boccali, T.; Borrello, L.; Castaldi, R.; Ciocci, M. A.; Dell'Orso, R.; Fedi, G.; Giassi, A.; Grippo, M. T.; Ligabue, F.; Lomtadze, T.; Martini, L.; Messineo, A.; Palla, F.; Rizzi, A.; Savoy-Navarro, A.; Spagnolo, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; Cipriani, M.; Del Re, D.; Diemoz, M.; Gelli, S.; Longo, E.; Margaroli, F.; Marzocchi, B.; Meridiani, P.; Organtini, G.; Paramatti, R.; Preiato, F.; Rahatlou, S.; Rovelli, C.; Santanastasio, F.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Bartosik, N.; Bellan, R.; Biino, C.; Cartiglia, N.; Cenna, F.; Costa, M.; Covarelli, R.; Degano, A.; Demaria, N.; Kiani, B.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Monteil, E.; Monteno, M.; Obertino, M. M.; Pacher, L.; Pastrone, N.; Pelliccioni, M.; Pinna Angioni, G. L.; Ravera, F.; Romero, A.; Ruspa, M.; Sacchi, R.; Shchelina, K.; Sola, V.; Solano, A.; Staiano, A.; Traczyk, P.; Belforte, S.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Zanetti, A.; Kim, D. H.; Kim, G. N.; Kim, M. S.; Lee, J.; Lee, S.; Lee, S. W.; Oh, Y. D.; Sekmen, S.; Son, D. C.; Yang, Y. C.; Lee, A.; Kim, H.; Moon, D. H.; Brochero Cifuentes, J. A.; Goh, J.; Kim, T. J.; Cho, S.; Choi, S.; Go, Y.; Gyun, D.; Ha, S.; Hong, B.; Jo, Y.; Kim, Y.; Lee, K.; Lee, K. S.; Lee, S.; Lim, J.; Park, S. K.; Roh, Y.; Almond, J.; Kim, J.; Lee, H.; Oh, S. B.; Radburn-Smith, B. C.; Seo, S. h.; Yang, U. K.; Yoo, H. D.; Yu, G. B.; Choi, M.; Kim, H.; Kim, J. H.; Lee, J. S. H.; Park, I. C.; Ryu, G.; Choi, Y.; Hwang, C.; Lee, J.; Yu, I.; Dudenas, V.; Juodagalvis, A.; Vaitkus, J.; Ahmed, I.; Ibrahim, Z. A.; Md Ali, M. A. B.; Mohamad Idris, F.; Wan Abdullah, W. A. T.; Yusli, M. N.; Zolkapli, Z.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-De La Cruz, I.; Lopez-Fernandez, R.; Mejia Guisao, J.; Sanchez-Hernandez, A.; Carrillo Moreno, S.; Oropeza Barrera, C.; Vazquez Valencia, F.; Pedraza, I.; Salazar Ibarguen, H. A.; Uribe Estrada, C.; Morelos Pineda, A.; Krofcheck, D.; Butler, P. H.; Ahmad, A.; Ahmad, M.; Hassan, Q.; Hoorani, H. R.; Saddique, A.; Shah, M. A.; Shoaib, M.; Waqas, M.; Bialkowska, H.; Bluj, M.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Romanowska-Rybinska, K.; Szleper, M.; Zalewski, P.; Bunkowski, K.; Byszuk, A.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Olszewski, M.; Pyskir, A.; Walczak, M.; Bargassa, P.; Beirão Da Cruz E Silva, C.; Calpas, B.; Di Francesco, A.; Faccioli, P.; Gallinaro, M.; Hollar, J.; Leonardo, N.; Lloret Iglesias, L.; Nemallapudi, M. V.; Seixas, J.; Toldaiev, O.; Vadruccio, D.; Varela, J.; Afanasiev, S.; Bunin, P.; Gavrilenko, M.; Golutvin, I.; Gorbunov, I.; Kamenev, A.; Karjavin, V.; Lanev, A.; Malakhov, A.; Matveev, V.; Palichik, V.; Perelygin, V.; Shmatov, S.; Shulha, S.; Skatchkov, N.; Smirnov, V.; Voytishin, N.; Zarubin, A.; Ivanov, Y.; Kim, V.; Kuznetsova, E.; Levchenko, P.; Murzin, V.; Oreshkin, V.; Smirnov, I.; Sulimov, V.; Uvarov, L.; Vavilov, S.; Vorobyev, A.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Karneyeu, A.; Kirsanov, M.; Krasnikov, N.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Gavrilov, V.; Lychkovskaya, N.; Popov, V.; Pozdnyakov, I.; Safronov, G.; Spiridonov, A.; Toms, M.; Vlasov, E.; Zhokin, A.; Aushev, T.; Bylinkin, A.; Chadeeva, M.; Polikarpov, S.; Rusinov, V.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Terkulov, A.; Baskakov, A.; Belyaev, A.; Boos, E.; Bunichev, V.; Dubinin, M.; Dudko, L.; Klyukhin, V.; Kodolova, O.; Korneeva, N.; Lokhtin, I.; Miagkov, I.; Obraztsov, S.; Perfilov, M.; Savrin, V.; Volkov, P.; Blinov, V.; Skovpen, Y.; Shtol, D.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Elumakhov, D.; Kachanov, V.; Kalinin, A.; Konstantinov, D.; Krychkine, V.; Petrov, V.; Ryutin, R.; Sobol, A.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Cirkovic, P.; Devetak, D.; Dordevic, M.; Milosevic, J.; Rekovic, V.; Alcaraz Maestre, J.; Barrio Luna, M.; Cerrada, M.; Colino, N.; De La Cruz, B.; Delgado Peris, A.; Escalante Del Valle, A.; Fernandez Bedoya, C.; Fernández Ramos, J. P.; Flix, J.; Fouz, M. C.; Garcia-Abia, P.; Gonzalez Lopez, O.; Goy Lopez, S.; Hernandez, J. M.; Josa, M. I.; Pérez-Calero Yzquierdo, A.; Puerta Pelayo, J.; Quintario Olmeda, A.; Redondo, I.; Romero, L.; Soares, M. S.; de Trocóniz, J. F.; Missiroli, M.; Moran, D.; Cuevas, J.; Erice, C.; Fernandez Menendez, J.; Gonzalez Caballero, I.; González Fernández, J. R.; Palencia Cortezon, E.; Sanchez Cruz, S.; Suárez Andrés, I.; Vischia, P.; Vizan Garcia, J. M.; Cabrillo, I. J.; Calderon, A.; Chazin Quero, B.; Curras, E.; Fernandez, M.; Garcia-Ferrero, J.; Gomez, G.; Lopez Virto, A.; Marco, J.; Martinez Rivero, C.; Matorras, F.; Piedra Gomez, J.; Rodrigo, T.; Ruiz-Jimeno, A.; Scodellaro, L.; Trevisani, N.; Vila, I.; Vilar Cortabitarte, R.; Abbaneo, D.; Auffray, E.; Baillon, P.; Ball, A. H.; Barney, D.; Bianco, M.; Bloch, P.; Bocci, A.; Botta, C.; Camporesi, T.; Castello, R.; Cepeda, M.; Cerminara, G.; Chen, Y.; d'Enterria, D.; Dabrowski, A.; Daponte, V.; David, A.; De Gruttola, M.; De Roeck, A.; Di Marco, E.; Dobson, M.; Dorney, B.; du Pree, T.; Dünser, M.; Dupont, N.; Elliott-Peisert, A.; Everaerts, P.; Franzoni, G.; Fulcher, J.; Funk, W.; Gigi, D.; Gill, K.; Glege, F.; Gulhan, D.; Gundacker, S.; Guthoff, M.; Harris, P.; Hegeman, J.; Innocente, V.; Janot, P.; Karacheban, O.; Kieseler, J.; Kirschenmann, H.; Knünz, V.; Kornmayer, A.; Kortelainen, M. J.; Lange, C.; Lecoq, P.; Lourenço, C.; Lucchini, M. T.; Malgeri, L.; Mannelli, M.; Martelli, A.; Meijers, F.; Merlin, J. A.; Mersi, S.; Meschi, E.; Milenovic, P.; Moortgat, F.; Mulders, M.; Neugebauer, H.; Orfanelli, S.; Orsini, L.; Pape, L.; Perez, E.; Peruzzi, M.; Petrilli, A.; Petrucciani, G.; Pfeiffer, A.; Pierini, M.; Racz, A.; Reis, T.; Rolandi, G.; Rovere, M.; Sakulin, H.; Sauvan, J. B.; Schäfer, C.; Schwick, C.; Seidel, M.; Sharma, A.; Silva, P.; Sphicas, P.; Steggemann, J.; Stoye, M.; Tosi, M.; Treille, D.; Triossi, A.; Tsirou, A.; Veckalns, V.; Veres, G. I.; Verweij, M.; Wardle, N.; Zagozdzinska, A.; Zeuner, W. D.; Bertl, W.; Deiters, K.; Erdmann, W.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; Kotlinski, D.; Langenegger, U.; Rohe, T.; Wiederkehr, S. A.; Bachmair, F.; Bäni, L.; Berger, P.; Bianchini, L.; Casal, B.; Dissertori, G.; Dittmar, M.; Donegà, M.; Grab, C.; Heidegger, C.; Hits, D.; Hoss, J.; Kasieczka, G.; Klijnsma, T.; Lustermann, W.; Mangano, B.; Marionneau, M.; Martinez Ruiz del Arbol, P.; Masciovecchio, M.; Meinhard, M. T.; Meister, D.; Micheli, F.; Musella, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pata, J.; Pauss, F.; Perrin, G.; Perrozzi, L.; Quittnat, M.; Rossini, M.; Schönenberger, M.; Starodumov, A.; Tavolaro, V. R.; Theofilatos, K.; Vesterbacka Olsson, M. L.; Wallny, R.; Zhu, D. H.; Aarrestad, T. K.; Amsler, C.; Caminada, L.; Canelli, M. F.; De Cosa, A.; Donato, S.; Galloni, C.; Hinzmann, A.; Hreus, T.; Kilminster, B.; Ngadiuba, J.; Pinna, D.; Rauco, G.; Robmann, P.; Salerno, D.; Seitz, C.; Yang, Y.; Zucchetta, A.; Candelise, V.; Doan, T. H.; Jain, Sh.; Khurana, R.; Konyushikhin, M.; Kuo, C. M.; Lin, W.; Pozdnyakov, A.; Yu, S. S.; Kumar, Arun; Chang, P.; Chang, Y. H.; Chao, Y.; Chen, K. F.; Chen, P. H.; Fiori, F.; Hou, W.-S.; Hsiung, Y.; Liu, Y. F.; Lu, R.-S.; Miñano Moya, M.; Paganis, E.; Psallidas, A.; Tsai, J. f.; Asavapibhop, B.; Kovitanggoon, K.; Singh, G.; Srimanobhas, N.; Adiguzel, A.; Bakirci, M. N.; Boran, F.; Damarseckin, S.; Demiroglu, Z. S.; Dozen, C.; Eskut, E.; Girgis, S.; Gokbulut, G.; Guler, Y.; Hos, I.; Kangal, E. E.; Kara, O.; Kiminsu, U.; Oglakci, M.; Onengut, G.; Ozdemir, K.; Ozturk, S.; Polatoz, A.; Sunar Cerci, D.; Turkcapar, S.; Zorbakir, I. S.; Zorbilmez, C.; Bilin, B.; Karapinar, G.; Ocalan, K.; Yalvac, M.; Zeyrek, M.; Gülmez, E.; Kaya, M.; Kaya, O.; Yetkin, E. A.; Cakir, A.; Cankocak, K.; Grynyov, B.; Levchuk, L.; Sorokin, P.; Aggleton, R.; Ball, F.; Beck, L.; Brooke, J. J.; Burns, D.; Clement, E.; Cussans, D.; Flacher, H.; Goldstein, J.; Grimes, M.; Heath, G. P.; Heath, H. F.; Jacob, J.; Kreczko, L.; Lucas, C.; Newbold, D. M.; Paramesvaran, S.; Poll, A.; Sakuma, T.; Seif El Nasr-storey, S.; Smith, D.; Smith, V. J.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Calligaris, L.; Cieri, D.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Olaiya, E.; Petyt, D.; Shepherd-Themistocleous, C. H.; Thea, A.; Tomalin, I. R.; Williams, T.; Baber, M.; Bainbridge, R.; Buchmuller, O.; Bundock, A.; Casasso, S.; Citron, M.; Colling, D.; Corpe, L.; Dauncey, P.; Davies, G.; De Wit, A.; Della Negra, M.; Di Maria, R.; Dunne, P.; Elwood, A.; Futyan, D.; Haddad, Y.; Hall, G.; Iles, G.; James, T.; Lane, R.; Laner, C.; Lyons, L.; Magnan, A.-M.; Malik, S.; Mastrolorenzo, L.; Nash, J.; Nikitenko, A.; Pela, J.; Pesaresi, M.; Raymond, D. M.; Richards, A.; Rose, A.; Scott, E.; Seez, C.; Summers, S.; Tapper, A.; Uchida, K.; Vazquez Acosta, M.; Virdee, T.; Wright, J.; Zenz, S. C.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Reid, I. D.; Symonds, P.; Teodorescu, L.; Turner, M.; Borzou, A.; Call, K.; Dittmann, J.; Hatakeyama, K.; Liu, H.; Pastika, N.; Bartek, R.; Dominguez, A.; Buccilli, A.; Cooper, S. I.; Henderson, C.; Rumerio, P.; West, C.; Arcaro, D.; Avetisyan, A.; Bose, T.; Gastler, D.; Rankin, D.; Richardson, C.; Rohlf, J.; Sulak, L.; Zou, D.; Benelli, G.; Cutts, D.; Garabedian, A.; Hakala, J.; Heintz, U.; Hogan, J. M.; Kwok, K. H. M.; Laird, E.; Landsberg, G.; Mao, Z.; Narain, M.; Piperov, S.; Sagir, S.; Spencer, E.; Syarif, R.; Band, R.; Brainerd, C.; Burns, D.; Calderon De La Barca Sanchez, M.; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Erbacher, R.; Flores, C.; Funk, G.; Gardner, M.; Ko, W.; Lander, R.; Mclean, C.; Mulhearn, M.; Pellett, D.; Pilot, J.; Shalhout, S.; Shi, M.; Smith, J.; Squires, M.; Stolp, D.; Tos, K.; Tripathi, M.; Wang, Z.; Bachtis, M.; Bravo, C.; Cousins, R.; Dasgupta, A.; Florent, A.; Hauser, J.; Ignatenko, M.; Mccoll, N.; Saltzberg, D.; Schnaible, C.; Valuev, V.; Bouvier, E.; Burt, K.; Clare, R.; Ellison, J.; Gary, J. W.; Ghiasi Shirazi, S. M. A.; Hanson, G.; Heilman, J.; Jandir, P.; Kennedy, E.; Lacroix, F.; Long, O. R.; Olmedo Negrete, M.; Paneva, M. I.; Shrinivas, A.; Si, W.; Wei, H.; Wimpenny, S.; Yates, B. R.; Branson, J. G.; Cerati, G. B.; Cittolin, S.; Derdzinski, M.; Holzner, A.; Klein, D.; Kole, G.; Krutelyov, V.; Letts, J.; Macneill, I.; Olivito, D.; Padhi, S.; Pieri, M.; Sani, M.; Sharma, V.; Simon, S.; Tadel, M.; Vartak, A.; Wasserbaech, S.; Würthwein, F.; Yagil, A.; Zevi Della Porta, G.; Amin, N.; Bhandari, R.; Bradmiller-Feld, J.; Campagnari, C.; Dishaw, A.; Dutta, V.; Franco Sevilla, M.; George, C.; Golf, F.; Gouskos, L.; Gran, J.; Heller, R.; Incandela, J.; Mullin, S. D.; Ovcharova, A.; Qu, H.; Richman, J.; Stuart, D.; Suarez, I.; Yoo, J.; Anderson, D.; Bendavid, J.; Bornheim, A.; Lawhorn, J. M.; Newman, H. B.; Pena, C.; Spiropulu, M.; Vlimant, J. R.; Xie, S.; Zhu, R. Y.; Andrews, M. B.; Ferguson, T.; Paulini, M.; Russ, J.; Sun, M.; Vogel, H.; Vorobiev, I.; Weinberg, M.; Cumalat, J. P.; Ford, W. T.; Jensen, F.; Johnson, A.; Krohn, M.; Leontsinis, S.; Mulholland, T.; Stenson, K.; Wagner, S. R.; Alexander, J.; Chaves, J.; Chu, J.; Dittmer, S.; Mcdermott, K.; Mirman, N.; Patterson, J. R.; Rinkevicius, A.; Ryd, A.; Skinnari, L.; Soffi, L.; Tan, S. M.; Tao, Z.; Thom, J.; Tucker, J.; Wittich, P.; Zientek, M.; Winn, D.; Abdullin, S.; Albrow, M.; Apollinari, G.; Apresyan, A.; Apyan, A.; Banerjee, S.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Bolla, G.; Burkett, K.; Butler, J. N.; Canepa, A.; Cheung, H. W. K.; Chlebana, F.; Cremonesi, M.; Duarte, J.; Elvira, V. D.; Fisk, I.; Freeman, J.; Gecse, Z.; Gottschalk, E.; Gray, L.; Green, D.; Grünendahl, S.; Gutsche, O.; Harris, R. M.; Hasegawa, S.; Hirschauer, J.; Hu, Z.; Jayatilaka, B.; Jindariani, S.; Johnson, M.; Joshi, U.; Klima, B.; Kreis, B.; Lammel, S.; Lincoln, D.; Lipton, R.; Liu, M.; Liu, T.; Lopes De Sá, R.; Lykken, J.; Maeshima, K.; Magini, N.; Marraffino, J. M.; Maruyama, S.; Mason, D.; McBride, P.; Merkel, P.; Mrenna, S.; Nahn, S.; O'Dell, V.; Pedro, K.; Prokofyev, O.; Rakness, G.; Ristori, L.; Schneider, B.; Sexton-Kennedy, E.; Soha, A.; Spalding, W. J.; Spiegel, L.; Stoynev, S.; Strait, J.; Strobbe, N.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vernieri, C.; Verzocchi, M.; Vidal, R.; Wang, M.; Weber, H. A.; Whitbeck, A.; Acosta, D.; Avery, P.; Bortignon, P.; Brinkerhoff, A.; Carnes, A.; Carver, M.; Curry, D.; Das, S.; Field, R. D.; Furic, I. K.; Konigsberg, J.; Korytov, A.; Kotov, K.; Ma, P.; Matchev, K.; Mei, H.; Mitselmakher, G.; Rank, D.; Shchutska, L.; Sperka, D.; Terentyev, N.; Thomas, L.; Wang, J.; Wang, S.; Yelton, J.; Linn, S.; Markowitz, P.; Martinez, G.; Rodriguez, J. L.; Ackert, A.; Adams, T.; Askew, A.; Hagopian, S.; Hagopian, V.; Johnson, K. F.; Kolberg, T.; Perry, T.; Prosper, H.; Santra, A.; Yohay, R.; Baarmand, M. M.; Bhopatkar, V.; Colafranceschi, S.; Hohlmann, M.; Noonan, D.; Roy, T.; Yumiceva, F.; Adams, M. R.; Apanasevich, L.; Berry, D.; Betts, R. R.; Cavanaugh, R.; Chen, X.; Evdokimov, O.; Gerber, C. E.; Hangal, D. A.; Hofman, D. J.; Jung, K.; Kamin, J.; Sandoval Gonzalez, I. D.; Tonjes, M. B.; Trauger, H.; Varelas, N.; Wang, H.; Wu, Z.; Zhang, J.; Bilki, B.; Clarida, W.; Dilsiz, K.; Durgut, S.; Gandrajula, R. P.; Haytmyradov, M.; Khristenko, V.; Merlo, J.-P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Ogul, H.; Onel, Y.; Ozok, F.; Penzo, A.; Snyder, C.; Tiras, E.; Wetzel, J.; Yi, K.; Blumenfeld, B.; Cocoros, A.; Eminizer, N.; Fehling, D.; Feng, L.; Gritsan, A. V.; Maksimovic, P.; Roskes, J.; Sarica, U.; Swartz, M.; Xiao, M.; You, C.; Al-bataineh, A.; Baringer, P.; Bean, A.; Boren, S.; Bowen, J.; Castle, J.; Khalil, S.; Kropivnitskaya, A.; Majumder, D.; Mcbrayer, W.; Murray, M.; Royon, C.; Sanders, S.; Stringer, R.; Tapia Takaki, J. D.; Wang, Q.; Ivanov, A.; Kaadze, K.; Maravin, Y.; Mohammadi, A.; Saini, L. K.; Skhirtladze, N.; Toda, S.; Rebassoo, F.; Wright, D.; Anelli, C.; Baden, A.; Baron, O.; Belloni, A.; Calvert, B.; Eno, S. C.; Ferraioli, C.; Hadley, N. J.; Jabeen, S.; Jeng, G. Y.; Kellogg, R. G.; Kunkle, J.; Mignerey, A. C.; Ricci-Tam, F.; Shin, Y. H.; Skuja, A.; Tonwar, S. C.; Abercrombie, D.; Allen, B.; Azzolini, V.; Barbieri, R.; Baty, A.; Bi, R.; Bierwagen, K.; Brandt, S.; Busza, W.; Cali, I. A.; D'Alfonso, M.; Demiragli, Z.; Gomez Ceballos, G.; Goncharov, M.; Hsu, D.; Iiyama, Y.; Innocenti, G. M.; Klute, M.; Kovalskyi, D.; Lai, Y. S.; Lee, Y.-J.; Levin, A.; Luckey, P. D.; Maier, B.; Marini, A. C.; Mcginn, C.; Mironov, C.; Narayanan, S.; Niu, X.; Paus, C.; Roland, C.; Roland, G.; Salfeld-Nebgen, J.; Stephans, G. S. F.; Tatar, K.; Velicanu, D.; Wang, J.; Wang, T. W.; Wyslouch, B.; Benvenuti, A. C.; Chatterjee, R. M.; Evans, A.; Hansen, P.; Kalafut, S.; Kao, S. C.; Kubota, Y.; Lesko, Z.; Mans, J.; Nourbakhsh, S.; Ruckstuhl, N.; Rusack, R.; Tambe, N.; Turkewitz, J.; Acosta, J. G.; Oliveros, S.; Avdeeva, E.; Bloom, K.; Claes, D. R.; Fangmeier, C.; Gonzalez Suarez, R.; Kamalieddin, R.; Kravchenko, I.; Monroy, J.; Siado, J. E.; Snow, G. R.; Stieger, B.; Alyari, M.; Dolen, J.; Godshalk, A.; Harrington, C.; Iashvili, I.; Kharchilava, A.; Parker, A.; Rappoccio, S.; Roozbahani, B.; Alverson, G.; Barberis, E.; Hortiangtham, A.; Massironi, A.; Morse, D. M.; Nash, D.; Orimoto, T.; Teixeira De Lima, R.; Trocino, D.; Wang, R.-J.; Wood, D.; Bhattacharya, S.; Charaf, O.; Hahn, K. A.; Mucia, N.; Odell, N.; Pollack, B.; Schmitt, M. H.; Sung, K.; Trovato, M.; Velasco, M.; Dev, N.; Hildreth, M.; Hurtado Anampa, K.; Jessop, C.; Karmgard, D. J.; Kellams, N.; Lannon, K.; Loukas, N.; Marinelli, N.; Meng, F.; Mueller, C.; Musienko, Y.; Planer, M.; Reinsvold, A.; Ruchti, R.; Rupprecht, N.; Smith, G.; Taroni, S.; Wayne, M.; Wolf, M.; Woodard, A.; Alimena, J.; Antonelli, L.; Bylsma, B.; Durkin, L. S.; Flowers, S.; Francis, B.; Hart, A.; Hill, C.; Ji, W.; Liu, B.; Luo, W.; Puigh, D.; Winer, B. L.; Wulsin, H. W.; Benaglia, A.; Cooperstein, S.; Driga, O.; Elmer, P.; Hardenbrook, J.; Hebda, P.; Lange, D.; Luo, J.; Marlow, D.; Mei, K.; Ojalvo, I.; Olsen, J.; Palmer, C.; Piroué, P.; Stickland, D.; Svyatkovskiy, A.; Tully, C.; Malik, S.; Norberg, S.; Barker, A.; Barnes, V. E.; Folgueras, S.; Gutay, L.; Jha, M. K.; Jones, M.; Jung, A. W.; Khatiwada, A.; Miller, D. H.; Neumeister, N.; Schulte, J. F.; Sun, J.; Wang, F.; Xie, W.; Cheng, T.; Parashar, N.; Stupak, J.; Adair, A.; Akgun, B.; Chen, Z.; Ecklund, K. M.; Geurts, F. J. M.; Guilbaud, M.; Li, W.; Michlin, B.; Northup, M.; Padley, B. P.; Roberts, J.; Rorie, J.; Tu, Z.; Zabel, J.; Betchart, B.; Bodek, A.; de Barbaro, P.; Demina, R.; Duh, Y. t.; Ferbel, T.; Galanti, M.; Garcia-Bellido, A.; Han, J.; Hindrichs, O.; Khukhunaishvili, A.; Lo, K. H.; Tan, P.; Verzetti, M.; Ciesielski, R.; Goulianos, K.; Mesropian, C.; Agapitos, A.; Chou, J. P.; Gershtein, Y.; Gómez Espinosa, T. A.; Halkiadakis, E.; Heindl, M.; Hughes, E.; Kaplan, S.; Kunnawalkam Elayavalli, R.; Kyriacou, S.; Lath, A.; Montalvo, R.; Nash, K.; Osherson, M.; Saka, H.; Salur, S.; Schnetzer, S.; Sheffield, D.; Somalwar, S.; Stone, R.; Thomas, S.; Thomassen, P.; Walker, M.; Foerster, M.; Heideman, J.; Riley, G.; Rose, K.; Spanier, S.; Thapa, K.; Bouhali, O.; Castaneda Hernandez, A.; Celik, A.; Dalchenko, M.; De Mattia, M.; Delgado, A.; Dildick, S.; Eusebi, R.; Gilmore, J.; Huang, T.; Kamon, T.; Mueller, R.; Pakhotin, Y.; Patel, R.; Perloff, A.; Perniè, L.; Rathjens, D.; Safonov, A.; Tatarinov, A.; Ulmer, K. A.; Akchurin, N.; Damgov, J.; De Guio, F.; Dragoiu, C.; Dudero, P. R.; Faulkner, J.; Gurpinar, E.; Kunori, S.; Lamichhane, K.; Lee, S. W.; Libeiro, T.; Peltola, T.; Undleeb, S.; Volobouev, I.; Wang, Z.; Greene, S.; Gurrola, A.; Janjam, R.; Johns, W.; Maguire, C.; Melo, A.; Ni, H.; Sheldon, P.; Tuo, S.; Velkovska, J.; Xu, Q.; Arenton, M. W.; Barria, P.; Cox, B.; Hirosky, R.; Ledovskoy, A.; Li, H.; Neu, C.; Sinthuprasith, T.; Sun, X.; Wang, Y.; Wolfe, E.; Xia, F.; Clarke, C.; Harr, R.; Karchin, P. E.; Sturdy, J.; Zaleski, S.; Belknap, D. A.; Buchanan, J.; Caillol, C.; Dasu, S.; Dodd, L.; Duric, S.; Gomber, B.; Grothe, M.; Herndon, M.; Hervé, A.; Hussain, U.; Klabbers, P.; Lanaro, A.; Levine, A.; Long, K.; Loveless, R.; Pierro, G. A.; Polese, G.; Ruggles, T.; Savin, A.; Smith, N.; Smith, W. H.; Taylor, D.; Woods, N.; CMS Collaboration

    2018-01-01

    The cross sections for the production of t t bar b b bar and t t bar jj events and their ratio σ t t bar b b bar /σ t t bar jj are measured using data corresponding to an integrated luminosity of 2.3 fb-1collected in pp collisions at √{ s } = 13 TeV with the CMS detector at the LHC. Events with two leptons (e or μ) and at least four reconstructed jets, including at least two identified as b quark jets, in the final state are selected. In the full phase space, the measured ratio is 0.022 ± 0.003(stat) ± 0.006(syst), the cross section σ t t bar b b bar is 4.0 ± 0.6(stat) ± 1.3(syst) pb and σ t t bar jj is 184 ± 6(stat) ± 33(syst) pb. The measurements are compared with the standard model expectations obtained from a POWHEG simulation at next-to-leading-order interfaced with PYTHIA.

  15. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

    The scheduling limits for a typical long year taking into account technical stops, machine development, spe- cial physics runs are presented. An attempt is then made to outline a ten year post LS1 schedule taking into account the disparate requirements outlined in the previous talks in this session. The demands on the planned long shutdowns and the impact of these demands on their proposed length will be discussed. The option of using ion running as a pre-shutdown cool-down period will be addressed.

  16. Anesthesiology Nurse Scheduling using Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Leopoldo Altamirano

    2012-02-01

    Full Text Available In this article we present an approach designed to solve a real world problem: the Anesthesiology Nurse Scheduling Problem (ANSP at a public French hospital. The anesthesiology nurses are one of the most shared resources in the hospital and we attempt to find a fair/balanced schedule for them, taking into account a set of constraints and the nursesarsquo; stated preferences, concerning the different shifts. We propose a particle swarm optimization algorithm to solve the ANSP. Finally, we compare our technique with previous results obtained using integer programming.

  17. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    Biefeld, Eric W.; Cooper, Lynne P.

    1991-01-01

    Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

  18. Schedule optimization study implementation plan

    International Nuclear Information System (INIS)

    1993-11-01

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

  19. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

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

  20. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  1. Hybrid job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1995-01-01

    We consider the problem of scheduling jobs in a hybrid job shop. We use the term 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times. The Shifting Bottleneck procedure can be generalized to deal with

  2. Practical job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1998-01-01

    The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop

  3. "Creative" Work Schedules.

    Science.gov (United States)

    Blai, Boris

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

  4. Where do we stand with fuzzy project scheduling?

    CERN Document Server

    Bonnal, Pierre; Lacoste, Germain

    2004-01-01

    Fuzzy project scheduling has interested several researchers in the past two decades; about 20 articles have been written on this issue. Contrary to stochastic project-scheduling approaches that are used by many project schedulers, and even if the axiomatic associated to the theory of probabilities is not always compatible with decision-making situations, fuzzy project-scheduling approaches that are most suited to these situations have been kept in the academic sphere. This paper starts by recalling the differences one can observe between uncertainty and imprecision. Then most of the published research works that have been done in this field are summarized. Finally, a framework for addressing the resource-constrained fuzzy project- scheduling problem is proposed. This framework uses temporal linguistic descriptors, which might become very interesting features to the project-scheduling practitioners.

  5. Conception of Self-Construction Production Scheduling System

    Science.gov (United States)

    Xue, Hai; Zhang, Xuerui; Shimizu, Yasuhiro; Fujimura, Shigeru

    With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for the interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce scheduling system without a lot of expense for customization. In this paper, at first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it.

  6. Direct block scheduling technology: Analysis of Avidity

    Directory of Open Access Journals (Sweden)

    Felipe Ribeiro Souza

    Full Text Available Abstract This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit. Each block is analyzed individually in order to define the best target period. This methodology presents an improvement of the classical methodology derived from Lerchs-Grossmann's initial proposition improved by Whittle. This paper presents the differences between these methodologies, specially focused on the algorithms' avidity. Avidity is classically defined by the voracious search algorithms, whereupon some of the most famous greedy algorithms are Branch and Bound, Brutal Force and Randomized. Strategies based on heuristics can accentuate the voracity of the optimizer system. The applied algorithm use simulated annealing combined with Tabu Search. The most avid algorithm can select the most profitable blocks in early periods, leading to higher present value in the first periods of mine operation. The application of discount factors to blocks on the Lerchs-Grossmann's final pit has an accentuated effect with time, and this effect may make blocks scheduled for the end of the mine life unfeasible, representing a trend to a decrease in reported reserves.

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

    Science.gov (United States)

    Zoch, David R.

    1991-01-01

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

  8. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

  9. Modelling altered fractionation schedules

    International Nuclear Information System (INIS)

    Fowler, J.F.

    1993-01-01

    The author discusses the conflicting requirements of hyperfractionation and accelerated fractionation used in radiotherapy, and the development of computer modelling to predict how to obtain an optimum of tumour cell kill without exceeding normal-tissue tolerance. The present trend is to shorten hyperfractionated schedules from 6 or 7 weeks to give overall times of 4 or 5 weeks as in new schedules by Herskovic et al (1992) and Harari (1992). Very high doses are given, much higher than can be given when ultrashort schedules such as CHART (12 days) are used. Computer modelling has suggested that optimum overall times, to yield maximum cell kill in tumours ((α/β = 10 Gy) for a constant level of late complications (α/β = 3 Gy) would be X or X-1 weeks, where X is the doubling time of the tumour cells in days (Fowler 1990). For median doubling times of about 5 days, overall times of 4 or 5 weeks should be ideal. (U.K.)

  10. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time-differentiated cong......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...

  11. Measurement of ttbb production rate in final state with lepton+jets and the cross section ratio ttbb/ttjj at 8 TeV with the CMS detector

    CERN Document Server

    Verlage, Tobias Anton

    2015-01-01

    The cross sections of the associated production of a top-quark pair with at least two additional jets or two additional b jets are measured in the final state with one lepton and jets. The study is performed for an integrated luminosity of 19.6 fb$^{-1}$ at a center-of-mass energy of $\\sqrt{s}$\\,=\\,8 TeV. To identify the jets originating from the top-quark pair decay a kinematic fit with mass constraints, multivariate classifiers in categories split by the jet multiplicity and b-tag discriminants of the jets are used. The contributions of $\\rm{t\\bar{t}b\\bar{b}}$ and $\\rm{t\\bar{t}jj}$ with at least two additional b jets or jets of any flavor are measured with a simultaneous template fit using shapes of b-tag discriminants. The measured cross sections $\\sigma(\\rm{t\\bar{t}b\\bar{b}}) =271.0 \\pm 103.0(stat)\\pm 32.2(syst)\\pm 7.0(lumi)$ fb, $\\sigma(\\rm{t\\bar{t}jj}) = 23.1 \\pm 2.3(stat)\\pm 2.9(syst)\\pm 0.6(lumi)$ pb and the cross section ratio $\\sigma(\\rm{t\\bar{t}b\\bar{b}})$/$\\sigma(\\rm{t\\bar{t}jj}) = 0....

  12. Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros

    Science.gov (United States)

    Bancroft, Stacie L.; Bourret, Jason C.

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time.…

  13. Toward an Autonomous Telescope Network: the TBT Scheduler

    Science.gov (United States)

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

    2015-09-01

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

  14. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1982-07-01

    Effective January 1, 1982, NRC will institute records retention and disposal practices in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 22 which apply to housekeeping or facilitative records. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  15. Practical quantum appointment scheduling

    Science.gov (United States)

    Touchette, Dave; Lovitz, Benjamin; Lütkenhaus, Norbert

    2018-04-01

    We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even when considering experimental errors. Along with the ability to generate constant-amplitude coherent states over two modes, this protocol requires the ability to transfer these modes back-and-forth between the two parties multiple times with very low losses. The implementation requirements are thus still challenging. Along the way, we develop tools to study quantum information cost of interactive protocols in the finite regime.

  16. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

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

    Science.gov (United States)

    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.

  18. 75 FR 47451 - Schedules of Controlled Substances; Placement of 2,5-Dimethoxy-4-(n)-propylthiophenethylamine and...

    Science.gov (United States)

    2010-08-06

    ... only one piece of background scientific data used to evaluate the abuse potential of drugs or other... opiates previously scheduled under the CSA. Even though the scheduling of BZP was finalized more than six...

  19. Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

    Directory of Open Access Journals (Sweden)

    Shyamala Loganathan

    2015-01-01

    Full Text Available Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

  20. Perceptions of randomized security schedules.

    Science.gov (United States)

    Scurich, Nicholas; John, Richard S

    2014-04-01

    Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed. © 2013 Society for Risk Analysis.

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

    Energy Technology Data Exchange (ETDEWEB)

    United States. Bonneville Power Administration.

    2006-11-01

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

  2. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    . The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care....... Mathematical and logic-based models are presented for the problems considered. Novel components are added to existing models and the modeling decisions are justified. In one case, the model is solved by a simple, but efficient greedy construction heuristic. In the remaining cases, column generation is applied...

  3. Engineering schedule control of nuclear power project planning and management

    International Nuclear Information System (INIS)

    Meng Hao

    2014-01-01

    Nuclear power design is the important part of project management of nuclear power project, it is the way to control the project organization, design schedule, design progress, design quality and cost control. The good schedule system and control is the key to the success for the project. It is also analyzed the problem during the project, by using some theory and analyze the project structure, design schedule management, IED and document management and interface management propose some new idea for better improve the design management to finally better improve the management quality and efficiency. (author)

  4. Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

    Directory of Open Access Journals (Sweden)

    Sukho Oh

    2018-04-01

    Full Text Available 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.

  5. Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

    Science.gov (United States)

    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.

  6. Sport Tournament Automated Scheduling System

    OpenAIRE

    Raof R. A. A; Sudin S.; Mahrom N.; Rosli A. N. C

    2018-01-01

    The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calc...

  7. On program restructuring, scheduling, and communication for parallel processor systems

    Energy Technology Data Exchange (ETDEWEB)

    Polychronopoulos, Constantine D. [Univ. of Illinois, Urbana, IL (United States)

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

  8. Message Scheduling and Forwarding in Congested DTNs

    KAUST Repository

    Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem

    2012-01-01

    Multi-copy utility-based routing has been considered as one of the most applicable approaches to effective message delivery in Delay Tolerant Networks (DTNs). By allowing multiple message replicas launched, the ratio of message delivery or delay can be significantly reduced compared with other counterparts. Such an advantage, nonetheless, is at the expense of taking more buffer space at each node and higher complexity in message forwarding decisions. This paper investigates an efficient message scheduling and dropping policy via analytical modeling approach, aiming to achieve optimal performance in terms of message delivery delay. Extensive simulation results, based on a synthetic mobility model and real mobility traces, show that the proposed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.

  9. Message Scheduling and Forwarding in Congested DTNs

    KAUST Repository

    Elwhishi, Ahmed

    2012-08-19

    Multi-copy utility-based routing has been considered as one of the most applicable approaches to effective message delivery in Delay Tolerant Networks (DTNs). By allowing multiple message replicas launched, the ratio of message delivery or delay can be significantly reduced compared with other counterparts. Such an advantage, nonetheless, is at the expense of taking more buffer space at each node and higher complexity in message forwarding decisions. This paper investigates an efficient message scheduling and dropping policy via analytical modeling approach, aiming to achieve optimal performance in terms of message delivery delay. Extensive simulation results, based on a synthetic mobility model and real mobility traces, show that the proposed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.

  10. Sensor Transmission Power Schedule for Smart Grids

    Science.gov (United States)

    Gao, C.; Huang, Y. H.; Li, J.; Liu, X. D.

    2017-11-01

    Smart grid has attracted much attention by the requirement of new generation renewable energy. Nowadays, the real-time state estimation, with the help of phasor measurement unit, plays an important role to keep smart grid stable and efficient. However, the limitation of the communication channel is not considered by related work. Considering the familiar limited on-board batteries wireless sensor in smart grid, transmission power schedule is designed in this paper, which minimizes energy consumption with proper EKF filtering performance requirement constrain. Based on the event-triggered estimation theory, the filtering algorithm is also provided to utilize the information contained in the power schedule. Finally, its feasibility and performance is demonstrated using the standard IEEE 39-bus system with phasor measurement units (PMUs).

  11. Schedules of Controlled Substances: Temporary Placement of 4-Fluoroisobutyryl Fentanyl into Schedule I. Temporary scheduling order.

    Science.gov (United States)

    2017-05-03

    The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule the synthetic opioid, N-(4-fluorophenyl)-N-(1-phenethylpiperidin-4-yl)isobutyramide (4-fluoroisobutyryl fentanyl or para-fluoroisobutyryl fentanyl), and its isomers, esters, ethers, salts and salts of isomers, esters, and ethers, into schedule I pursuant to the temporary scheduling provisions of the Controlled Substances Act. This action is based on a finding by the Administrator that the placement of 4-fluoroisobutyryl fentanyl into schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, 4-fluoroisobutyryl fentanyl.

  12. Contribution of Schedule Delays to Cost Growth: How to Make Peace with a Marching Army

    Science.gov (United States)

    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.

  13. Practical principles in appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Mandjes, M.

    2015-01-01

    Appointment schedules aim at achieving a proper balance between the conflicting interests of the service provider and her clients: a primary objective of the service provider is to fully utilize her available time, whereas clients want to avoid excessive waiting times. Setting up schedules that

  14. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

    Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

  15. Modeling the Cray memory scheduler

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-04-01

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

  16. Flexible Work Schedules. ERIC Digest.

    Science.gov (United States)

    Kerka, Sandra

    Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…

  17. AP1000 construction schedule

    International Nuclear Information System (INIS)

    Winters, J.W.

    2001-01-01

    Westinghouse performed this study as part of EPRI interest in advancing the use of computer aided processes to reduce the cost of nuclear power plants. EPRI believed that if one could relate appropriate portions of an advanced light water reactor plant model to activities in its construction sequence, and this relationship could be portrayed visually, then optimization of the construction sequence could be developed as never before. By seeing a 3-D representation of the plant at any point in its construction sequence, more informed decisions can be made on the feasibility or attractiveness of follow on or parallel steps in the sequence. The 3-D representation of construction as a function of time (4-D) could also increase the confidence of potential investors concerning the viability of the schedule and the plant ultimate cost. This study performed by Westinghouse confirmed that it is useful to be able to visualize a plant construction in 3-D as a function of time in order to optimize the sequence of construction activities. (author)

  18. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

    Introduction The endgame of CMS installation in the underground cavern is in full swing, with several major milestones having been passed since the last CMS week. The Tracker was installed inside the Vactank just before the CERN end-of-year shutdown. Shortly after the reopening in 2008, the two remaining endcap disks, YE-2 and YE-1, were lowered, marking the completion of eight years of assembly in the surface building SX5. The remaining tasks, before the detector can be closed for the Cosmic Run At Four Tesla (CRAFT), are the installation of the thermal shields, the cabling of the negative endcap, the cabling of the tracker and the beam pipe installation. In addition to these installation tasks, a test closure of the positive endcap is planned just before the installation of the central beam pipe. The schedule is tight and complicated but the goal to close CMS by the end of May for a cosmic test with magnetic field remains feasible. Safety With all large components now being underground, the shortage...

  19. Technology Cost and Schedule Estimation (TCASE) Final Report

    Science.gov (United States)

    Wallace, Jon; Schaffer, Mark

    2015-01-01

    During the 2014-2015 project year, the focus of the TCASE project has shifted from collection of historical data from many sources to securing a data pipeline between TCASE and NASA's widely used TechPort system. TCASE v1.0 implements a data import solution that was achievable within the project scope, while still providing the basis for a long-term ability to keep TCASE in sync with TechPort. Conclusion: TCASE data quantity is adequate and the established data pipeline will enable future growth. Data quality is now highly dependent the quality of data in TechPort. Recommendation: Technology development organizations within NASA should continue to work closely with project/program data tracking and archiving efforts (e.g. TechPort) to ensure that the right data is being captured at the appropriate quality level. TCASE would greatly benefit, for example, if project cost/budget information was included in TechPort in the future.

  20. Scheduling reinforcement about once a day.

    Science.gov (United States)

    Eckerman, D A

    1999-04-01

    A pigeon earned its daily food by pecking a key according to reinforcement schedules that produced food about once per day. Fixed-interval (FI), Fixed-time (FT), and various complex schedules were arranged to demonstrate the degree to which a scalloped pattern of responding remained. Pausing continued until about an hour before the reinforcer could be earned for FIs of 12, 24, and 48 h. Pausing was not as long for FIs of 18, 19, and 23 h. Pausing of about 24 h was seen for FI 36 h. FT 24 h produced continued responding but at a diminished frequency. The pattern of responding was strongly controlled by the schedule of reinforcement and seemed relatively independent of the cycle of human activity in the surrounding laboratory. Effects of added ratio contingencies and of signaling the availability of reinforcement in FT were also examined. Signaled FTs of 5 min-3 h produced more responding during the signal (autoshaping) than did FTs of 19 or 24 h.

  1. New Approaches to Irrigation Scheduling of Vegetables

    Directory of Open Access Journals (Sweden)

    Michael D. Cahn

    2017-04-01

    Full Text Available Using evapotranspiration (ET data for scheduling irrigations on vegetable farms is challenging due to imprecise crop coefficients, time consuming computations, and the need to simultaneously manage many fields. Meanwhile, the adoption of soil moisture monitoring in vegetables has historically been limited by sensor accuracy and cost, as well as labor required for installation, removal, and collection of readings. With recent improvements in sensor technology, public weather-station networks, satellite and aerial imaging, wireless communications, and cloud computing, many of the difficulties in using ET data and soil moisture sensors for irrigation scheduling of vegetables can now be addressed. Web and smartphone applications have been developed that automate many of the calculations involved in ET-based irrigation scheduling. Soil moisture sensor data can be collected through wireless networks and accessed using web browser or smartphone apps. Energy balance methods of crop ET estimation, such as eddy covariance and Bowen ratio, provide research options for further developing and evaluating crop coefficient guidelines of vegetables, while recent advancements in surface renewal instrumentation have led to a relatively low-cost tool for monitoring crop water requirement in commercial farms. Remote sensing of crops using satellite, manned aircraft, and UAV platforms may also provide useful tools for vegetable growers to evaluate crop development, plant stress, water consumption, and irrigation system performance.

  2. Flow-shop scheduling problem under uncertainties: Review and trends

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

    Full Text Available Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. Thus, it is important to study scheduling and sequencing activities under uncertainties since they can cause infeasibilities and disturbances. The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research. To this end, 100 papers about FS and flexible flow-shop scheduling problems published from 2001 to October 2016 were analyzed and classified. Trends in the reviewed literature are presented and finally some research opportunities in the field are proposed.

  3. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector has been derived by using the Youla parameterization. The use...... in connection with H_inf gain scheduling controllers....

  4. Adaptive scheduling with postexamining user selection under nonidentical fading

    KAUST Repository

    Gaaloul, Fakhreddine

    2012-11-01

    This paper investigates an adaptive scheduling algorithm for multiuser environments with statistically independent but nonidentically distributed (i.n.d.) channel conditions. The algorithm aims to reduce feedback load by sequentially and arbitrarily examining the user channels. It also provides improved performance by realizing postexamining best user selection. The first part of the paper presents new formulations for the statistics of the signal-to-noise ratio (SNR) of the scheduled user under i.n.d. channel conditions. The second part capitalizes on the findings in the first part and presents various performance and processing complexity measures for adaptive discrete-time transmission. The results are then extended to investigate the effect of outdated channel estimates on the statistics of the scheduled user SNR, as well as some performance measures. Numerical results are provided to clarify the usefulness of the scheduling algorithm under perfect or outdated channel estimates. © 1967-2012 IEEE.

  5. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

  6. Computer-aided resource planning and scheduling for radiological services

    Science.gov (United States)

    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.

  7. Multispectral processing of ERTS-A (LANDSAT) data for uranium exploration in the Wind River Basin, Wyoming: a visible region ratio to enhance surface alteration associated with roll-type uraium deposits. Final report, June 1974--July 1975

    International Nuclear Information System (INIS)

    Salmon, B.C.; Pillars, W.W.

    1975-07-01

    The purpose of this report is to document possible detection capabilities of the LANDSAT multispectral scanner data for use in exploration for uranium roll-type deposits. Spectral reflectivity, mineralogy, iron content, and color paramenters were measured for twenty natural surface samples collected from a semiarid region. The relationships of these properties to LANDSAT response-weighted reflectances and to reflectance ratios are discussed. It was found that the single ratio technique of multispectral processing is likely to be sensitive enough to separate hematitic stain, but not limonitic. A combination of the LANDSAT R/sub 5,4/ and R/sub 7,6/ ratios, and a processing technique sensitive to vegetative cover is recommended for detecting areas of limonitic stain. Digital level slicing of LANDSAT R/sub 5,4/ over the Wind River Basin, after geometric correction, resulted in adequate enhancement of Triassic redbeds and lighter red materials, but not for limonitic areas. No recommendations for prospects in the area were made. Information pertaining to techniques of evaluating laboratory reflectance spectra for remote sensing applications, ratio processing, and planimetric correction of LANDSAT data is presented qualitatively

  8. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Infants and Children (Birth through 6 ... any questions please talk to your doctor. 2018 Immunization Schedule Recommended Vaccinations for Infants and Children Schedule ...

  9. Operating Theatre Planning and Scheduling.

    NARCIS (Netherlands)

    Hans, Elias W.; Vanberkel, P.T.; Hall, R.

    2012-01-01

    In this chapter we present a number of approaches to operating theatre planning and scheduling. We organize these approaches hierarchically which serves to illustrate the breadth of problems confronted by researchers. At each hierarchicalplanning level we describe common problems, solution

  10. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  11. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  12. Executive Schedule C System (ESCS)

    Data.gov (United States)

    Office of Personnel Management — Used to store information on Federal employees in the Senior Executive Service (SES) and appointed employees in the Schedule C System. Every four years, just after...

  13. Parental work schedules and child overweight and obesity.

    Science.gov (United States)

    Champion, S L; Rumbold, A R; Steele, E J; Giles, L C; Davies, M J; Moore, V M

    2012-04-01

    Studies in school-age children have consistently shown a positive association between maternal paid work hours and child obesity. However, there is conflicting evidence about the impact of maternal work hours scheduled at nonstandard times (for example, evenings, nights or weekends), and no previous examination of paternal work schedules and child weight. We examined the associations between maternal, paternal and combined parental paid work schedules and overweight/obesity in children at age 9 years. Data were analysed from the most recent follow-up of 9-year-old children (n=434) in an Australian birth cohort study. Children were measured and classified as overweight/obese using the International Obesity Taskforce body mass index cutoff points. Current working conditions of parents were obtained from a structured interview with the primary caregiver. Logistic regression analyses were used to investigate the effect of parental work schedules on child overweight/obesity with adjustment for a range of sociodemographic and household factors associated with parental employment and child weight. At 9 years of age, 99 children (22.8%) were overweight or obese. When parental work schedules were examined separately, child overweight/obesity was significantly associated with paternal nonstandard work schedules (adjusted odds ratio (OR) 1.97, 95% confidence interval (CI) 1.08-3.61). There was no association with any type of maternal work schedule. We also found an association between child overweight/obesity and circumstances in which both parents worked nonstandard schedules; however, this was of borderline statistical significance in the adjusted models (adjusted OR 2.26, 95% CI 0.99-5.16). Work hours scheduled at nonstandard times, when worked by the father or both parents, were associated with child overweight and obesity. These findings indicate the potential importance of fathers' paid work arrangements for child overweight/obesity, which until recently has largely

  14. Construction schedules slack time minimizing

    Science.gov (United States)

    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.

  15. Space network scheduling benchmark: A proof-of-concept process for technology transfer

    Science.gov (United States)

    Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy

    1993-01-01

    This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

  16. Online scheduling policies for multiclass call centers with impatient customers

    NARCIS (Netherlands)

    Jouini, O.; Pot, S.A.; Koole, G.M.; Dallery, Y.

    2010-01-01

    We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI / GI / s + M queue, we focus on developing scheduling policies that satisfy a target ratio constraint on the abandonment probabilities of premium customers to

  17. A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

    KAUST Repository

    Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem

    2013-01-01

    new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive

  18. Human Schedule Performance, Protocol Analysis, and the "Silent Dog" Methodology

    Science.gov (United States)

    Cabello, Francisco; Luciano, Carmen; Gomez, Inmaculada; Barnes-Holmes, Dermot

    2004-01-01

    The purpose of the current experiment was to investigate the role of private verbal behavior on the operant performances of human adults, using a protocol analysis procedure with additional methodological controls (the "silent dog" method). Twelve subjects were exposed to fixed ratio 8 and differential reinforcement of low rate 3-s schedules. For…

  19. Evaluation of kiln-drying schedules for wild cherry wood (Cerasus avium)

    OpenAIRE

    Korkut, Süleyman; Ünsal, Öner; Kocaefe, Duygu; Aytin, Ayhan; Gökyar, Asli

    2013-01-01

    Wild cherry wood (Cerasus avium (L.) Monench) lumber with a nominal thickness of 5 cm from Duzce region in Turkey was dried through conventional kiln drying using two different programs which are unprotective drying schedules, and protective drying schedules. The aim was to obtain the most desirable kiln schedule for keeping the wood quality at an appropriate level up to final moisture content of 12±2% was reached. Intensity of warping (twist, bow, cup, crook) occurrence, superficial, interna...

  20. Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission.

    Science.gov (United States)

    Qin, Danyang; Yang, Songxiang; Zhang, Yan; Ma, Jingya; Ding, Qun

    2017-06-09

    Wireless energy collecting technology can effectively reduce the network time overhead and prolong the wireless sensor network (WSN) lifetime. However, the traditional energy collecting technology cannot achieve the balance between ergodic channel capacity and average collected energy. In order to solve the problem of the network transmission efficiency and the limited energy of wireless devices, three improved scheduling mechanisms are proposed: improved signal noise ratio (SNR) scheduling mechanism (IS2M), improved N-SNR scheduling mechanism (INS2M) and an improved Equal Throughput scheduling mechanism (IETSM) for different channel conditions to improve the whole network performance. Meanwhile, the average collected energy of single users and the ergodic channel capacity of three scheduling mechanisms can be obtained through the order statistical theory in Rayleig, Ricean, Nakagami- m and Weibull fading channels. It is concluded that the proposed scheduling mechanisms can achieve better balance between energy collection and data transmission, so as to provide a new solution to realize synchronous information and energy transmission for WSNs.

  1. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1983-05-01

    Effective January 1, 1982, NRC will institute records retention and disposal practives in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 24 which apply to housekeeping or facilitative records. NRCS-I applies to records common to all or most NRC offices; NRCS-II applies to program records as found in the various offices of the Commission, Atomic Safety and Licensing Board Panel, and the Atomic Safety and Licensing Appeal Panel; NRCS-III applies to records accumulated by the Advisory Committee on Reactor Safeguards; and NRCS-IV applies to records accumulated in the various NRC offices under the Executive Director for Operations. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  2. Sport Tournament Automated Scheduling System

    Directory of Open Access Journals (Sweden)

    Raof R. A. A

    2018-01-01

    Full Text Available The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calculating the scores of each tournament. The problem of scheduling the matches of a round robin and knock-out phase in a sport league are given focus. The problem is defined formally and the computational complexity is being noted. A solution algorithm is presented using a two-step approach. The first step is the creation of a tournament pattern and is based on known graph-theoretic method. The second one is an assignment problem and it is solved using a constraint based depth-first branch and bound procedure that assigns actual teams to numbers in the pattern. As a result, the scheduling process and knock down phase become easy for the tournament organizer and at the same time increasing the level of reliability.

  3. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1991-01-01

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

  4. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1991-01-01

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

  5. Measurement of the Ratio of Inclusive Cross Sections σ(p(bar p) → Z + b-jet)/σ(p(bar p) → Z + jet) in the Dilepton Final States

    International Nuclear Information System (INIS)

    Smith, Kenneth James

    2010-01-01

    The inclusive production of b-jets with a Z boson is an important background to searches for the Higgs boson in associated ZH → llb(bar b) production at the Fermilab Tevatron collider. This thesis describes the most precise measurement to date of the ratio of inclusive cross sections σ(p(bar p) → Z + b-jet)/σ(p(bar p) → Z + jet) when a Z boson decays into two electrons or muons. The measurement uses a data sample from p(bar p) collisions at the center of mass energy √s = 1.96 TeV corresponding to an integrated luminosity of 4.2 fb -1 collected by the D0 detector. The measured ratio σ(Z + b-jet)/σ(Z + jet) is 0.0187 ± 0.0021(stat) ± 0.0015(syst) for jets with transverse momentum p T > 20 GeV and pseudorapidity |η| (le) 2.5. The measurement is compared with the next-to-leading order theoretical predictions from MCFM and is found to be consistent within uncertainties.

  6. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1997-01-01

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

  7. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  8. CARMENES instrument control system and operational scheduler

    Science.gov (United States)

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

    2014-07-01

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

  9. EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING

    Institute of Scientific and Technical Information of China (English)

    Lei Deming; Wu Zhiming

    2005-01-01

    A new representation method is first presented based on priority rules. According to this method, each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm, the conflict occurring in the corresponding machine is resolved by the corresponding priority rule. Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed,in which both archive maintenance and fitness assignment use crowding measure. Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.

  10. Artificial intelligence approaches to astronomical observation scheduling

    Science.gov (United States)

    Johnston, Mark D.; Miller, Glenn

    1988-01-01

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

  11. On the modeling of uplink inter-cell interference based on proportional fair scheduling

    KAUST Repository

    Tabassum, Hina

    2012-10-03

    We derive a semi-analytical expression for the uplink inter-cell interference (ICI) assuming proportional fair scheduling (with a maximum normalized signal-to-noise ratio (SNR) criterion) deployed in the cellular network. The derived expression can be customized for different models of channel statistics that can capture path loss, shadowing, and fading. Firstly, we derive an expression for the distribution of the locations of the allocated user in a given cell. Then, we derive the distribution and moment generating function of the uplink ICI from one interfering cell. Finally, we determine the moment generating function of the cumulative uplink ICI from all interfering cells. The derived expression is utilized to evaluate important network performance metrics such as outage probability and fairness among users. The accuracy of the derived expressions is verified by comparing the obtained results to Monte Carlo simulations. © 2012 IEEE.

  12. On the modeling of uplink inter-cell interference based on proportional fair scheduling

    KAUST Repository

    Tabassum, Hina; Yilmaz, Ferkan; Dawy, Zaher; Alouini, Mohamed-Slim

    2012-01-01

    We derive a semi-analytical expression for the uplink inter-cell interference (ICI) assuming proportional fair scheduling (with a maximum normalized signal-to-noise ratio (SNR) criterion) deployed in the cellular network. The derived expression can be customized for different models of channel statistics that can capture path loss, shadowing, and fading. Firstly, we derive an expression for the distribution of the locations of the allocated user in a given cell. Then, we derive the distribution and moment generating function of the uplink ICI from one interfering cell. Finally, we determine the moment generating function of the cumulative uplink ICI from all interfering cells. The derived expression is utilized to evaluate important network performance metrics such as outage probability and fairness among users. The accuracy of the derived expressions is verified by comparing the obtained results to Monte Carlo simulations. © 2012 IEEE.

  13. 25 CFR 142.7 - How are transportation and scheduling determined?

    Science.gov (United States)

    2010-04-01

    ... advantage of economies of scale and consider geographic disparity and distribution of sites. (b) Itineraries... shipping season the final departure and arrival schedules must be distributed prior to the commencement of...

  14. 77 FR 42332 - Large Power Transformers From Korea; Revised Schedule for the Subject Investigation

    Science.gov (United States)

    2012-07-18

    ... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-1189 (Final)] Large Power Transformers From Korea; Revised Schedule for the Subject Investigation AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date: July 12, 2012. FOR FURTHER INFORMATION CONTACT: Edward...

  15. 75 FR 41891 - Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States

    Science.gov (United States)

    2010-07-19

    ... INTERNATIONAL TRADE COMMISSION [Investigation No. 1205-8] Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States AGENCY: United States International Trade Commission. ACTION: Change in date for transmitting final recommendations to the President. SUMMARY: The...

  16. Analysis of K/sup -/K/sup +/ and. pi. /sup -/. pi. /sup +/ final states in 13 GeV K/sup -/p interactions. [Differential cross sections, density matrix elements, branching ratio

    Energy Technology Data Exchange (ETDEWEB)

    Brandenburg, G W; Carnegie, R K; Cashmore, R J; Davier, M; Lasinski, T A; Leith, D W.G.S.; Mathews, J A.J.; Walden, P; Williams, S H [Stanford Linear Accelerator Center, Calif. (USA)

    1976-03-01

    The differential cross sections and density matrix elements for the phi and rho/sup 0/ mesons have been measured in the reactions K/sup -/p..-->..K/sup -/K/sup +/(..lambda..,..sigma../sup 0/) and K/sup -/p..--> pi../sup -/..pi../sup +/(..lambda..,..sigma../sup 0/) at 13 GeV using a wire chamber spectrometer. The analysis shows that while the vector meson production is dominated by the natural parity exchange amplitude, some unnatural parity exchange is also required. Furthermore the phi and rho natural exchange cross sections are identical in shape and have the 2:1 relative strength expected in the quark model with K* and K** exchange degeneracy. The analysis of the clear peak-dip rho/sup 0/-..omega.. interference pattern observed in the ..pi../sup -/..pi../sup +/ data indicates that the ..omega.. production is in phase with the rho and of similar magnitude. Both the S* and f' meson are clearly observed in this experiment. The S* data are found to be consistent with S* parameters deduced from ..pi pi.. scattering analyses. The f' density matrix elements and a new limit on the f'..--> pi../sup -/..pi../sup +/ branching ratio are presented.

  17. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  18. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  19. How useful are preemptive schedules?

    NARCIS (Netherlands)

    Brucker, P.; Heitmann, S.; Hurink, J.L.

    2001-01-01

    Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also

  20. Interaction in activity location scheduling

    NARCIS (Netherlands)

    Tabak, V.; Vries, de B.; Dijkstra, J.; Jessurun, A.J.

    2006-01-01

    In this paper we discuss the interaction in activity location scheduling which is the main subject of an ongoing research project called "User Simulation of Space Utilization". The aim of this research project is to develop an overall model for the simulation of human movement and utilization of

  1. Scheduling with target start times

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.; Klein Haneveld, W.K.; Vrieze, O.J.; Kallenberg, L.C.M.

    1997-01-01

    We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum

  2. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen

    2013-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous machines/processors and a certain degree of uncertainty about the actual sizes of jobs. The first characteristic entails machine dependent processing times of jobs and is captured by the classical

  3. Flexible Schedules and Shift Work.

    Science.gov (United States)

    Beers, Thomas M.

    2000-01-01

    Flexible work hours have gained prominence, as more than 25 million workers (27.6% of all full-time workers) can now vary their schedules. However, there has been little change since the mid-1980s in the proportion who work a shift other than a regular daytime shift. (JOW)

  4. Scheduling periodic tasks with slack

    NARCIS (Netherlands)

    Korst, J.H.M.; Aarts, E.H.L.; Lenstra, J.K.

    1997-01-01

    We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of identical processors, assuming that some slack is allowed in the time between successive executions of a periodic task. We prove that the problem is NP-hard in the strong sense. Necessary and sufficient

  5. Toward Realistic Acquisition Schedule Estimates

    Science.gov (United States)

    2016-04-30

    replace earlier versions of the F/A-18. Joint and International Nature At the time of JSF conception, there was a clear preference at the highest levels...ALPHABET SOUP ” (Aboulafia, 2015) OF STUDIES AND CONCEPTS • … MERGED INTO JAST • … WHICH EVOLVED TO JSF • WELL-KNOWN COST AND SCHEDULE

  6. Analyzing NPS Scheduling Using OSIRIS

    Science.gov (United States)

    1993-03-01

    School TEACHER SCHEDULE BLOCKS REPORT Date: 2/19/93 Period Name ID Term Days 1234 Adragna , Joe 170401 1 F xx Agrawal, Brij 120101 1 F xx Almquist...LOAD REPORT Date: 3/18/93 Total Max Consec Total Teacher ID Term Classes Classes Stud Adragna , Joe 170401 1 1 1 3 Agrawal, Brij 120101 1 2 2 98 Aiello

  7. Intercell scheduling: A negotiation approach using multi-agent coalitions

    Science.gov (United States)

    Tian, Yunna; Li, Dongni; Zheng, Dan; Jia, Yunde

    2016-10-01

    Intercell scheduling problems arise as a result of intercell transfers in cellular manufacturing systems. Flexible intercell routes are considered in this article, and a coalition-based scheduling (CBS) approach using distributed multi-agent negotiation is developed. Taking advantage of the extended vision of the coalition agents, the global optimization is improved and the communication cost is reduced. The objective of the addressed problem is to minimize mean tardiness. Computational results show that, compared with the widely used combinatorial rules, CBS provides better performance not only in minimizing the objective, i.e. mean tardiness, but also in minimizing auxiliary measures such as maximum completion time, mean flow time and the ratio of tardy parts. Moreover, CBS is better than the existing intercell scheduling approach for the same problem with respect to the solution quality and computational costs.

  8. Multiuser switched diversity scheduling systems with per-user threshold

    KAUST Repository

    Nam, Haewoon

    2010-05-01

    A multiuser switched diversity scheduling scheme with per-user feedback threshold is proposed and analyzed in this paper. The conventional multiuser switched diversity scheduling scheme uses a single feedback threshold for every user, where the threshold is a function of the average signal-to-noise ratios (SNRs) of the users as well as the number of users involved in the scheduling process. The proposed scheme, however, constructs a sequence of feedback thresholds instead of a single feedback threshold such that each user compares its channel quality with the corresponding feedback threshold in the sequence. Numerical and simulation results show that thanks to the flexibility of threshold selection, where a potentially different threshold can be used for each user, the proposed scheme provides a higher system capacity than that for the conventional scheme. © 2006 IEEE.

  9. A General State-Space Formulation for Online Scheduling

    Directory of Open Access Journals (Sweden)

    Dhruv Gupta

    2017-11-01

    Full Text Available We present a generalized state-space model formulation particularly motivated by an online scheduling perspective, which allows modeling (1 task-delays and unit breakdowns; (2 fractional delays and unit downtimes, when using discrete-time grid; (3 variable batch-sizes; (4 robust scheduling through the use of conservative yield estimates and processing times; (5 feedback on task-yield estimates before the task finishes; (6 task termination during its execution; (7 post-production storage of material in unit; and (8 unit capacity degradation and maintenance. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings. Finally, we demonstrate the effectiveness of this model on a case study from the field of bio-manufacturing.

  10. Enhanced OTSG economics optimizing CAPEX + OPEX + Schedule

    Energy Technology Data Exchange (ETDEWEB)

    Armstrong, Peter [KTI Engineered to Perform (Canada)

    2011-07-01

    This presentation gives an insight into the economics involved in producing once-through steam (OTSG) generators in Canada and it offers a proposal for improving returns in the industry. The objective of this presentation was to show the importance of developing OTSG manufacturing based on the future of this technology. The growing demand for OTSG by oil companies was presented, suggesting that this is a good time to put effort into developing more efficient designs. After the background of this technology was discussed, several economical aspects of the process were addressed; for instance, reducing capital expenditure (CAPEX) and operation expenditure (OPEX), outsourcing production, and project scheduling and execution. Initiatives proposed included: reducing plot size, producing larger OTSGs, reducing downtime, using alternative fuels, forming a global manufacturing network, and avoiding order blockage. Finally, the idea of designing a portable OTSG was proposed, showing its flexibility in oil extraction projects.

  11. Scheduling of Irrigation and Leaching Requirements

    Directory of Open Access Journals (Sweden)

    Amer Hassan Al-haddad

    2015-03-01

    Full Text Available Iraq depends mainly on Tigris and Euphrates Rivers to provide high percentage of agricultural water use for thousands years. At last years, Iraq is suffering from shortage in water resources due to global climate changes and unfair water politics of the neighboring countries, which affected the future of agriculture plans for irrigation, added to that the lack of developed systems of water management in the irrigation projects and improper allocation of irrigation water, which reduces water use efficiency and lead to losing irrigation water and decreasing in agricultural yield. This study aims at studying the usability of irrigation and leaching scheduling within the irrigating projects and putting a complete annual or seasonal irrigation program as a solution for the scarcity of irrigation water, the increase of irrigation efficiency, lessening the salinity in the projects and preparing an integral irrigation calendar through field measurements of soil physical properties and chemical for project selected and compared to the results of the irrigation scheduling and leaching with what is proposed by the designers. The process is accomplished by using a computer program which was designed by Water Resources Department at the University of Baghdad, with some modification to generalize it and made it applicable to various climatic zone and different soil types. Study area represented by large project located at the Tigris River, and this project was (Al-Amara irrigation project. Sufficient samples of project's soil were collected so as to identify soil physical and chemical properties and the salinity of soil and water as well as identifying the agrarian cycles virtually applied to this project. Finally, a comparison was conducted between the calculated water quantities and the suggested ones by the designers. The research results showed that using this kind of scheduling (previously prepared irrigation and leaching scheduling with its properties

  12. Development of Watch Schedule Using Rules Approach

    Science.gov (United States)

    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.

  13. Project management with dynamic scheduling baseline scheduling, risk analysis and project control

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

    The topic of this book is known as dynamic scheduling, and is used to refer to three dimensions of project management and scheduling: the construction of a baseline schedule and the analysis of a project schedule's risk as preparation of the project control phase during project progress. This dynamic scheduling point of view implicitly assumes that the usability of a project's baseline schedule is rather limited and only acts as a point of reference in the project life cycle.

  14. Optimal Time-Abstract Schedulers for CTMDPs and Markov Games

    Directory of Open Access Journals (Sweden)

    Markus Rabe

    2010-06-01

    Full Text Available We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount role in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathematical point of view, however, the question of approximation is secondary compared to the fundamental question whether or not optimal control exists. We demonstrate the existence of optimal schedulers for the time-abstract scheduler classes for all CTMDPs. Our proof is constructive: We show how to compute optimal time-abstract strategies with finite memory. It turns out that these optimal schedulers have an amazingly simple structure---they converge to an easy-to-compute memoryless scheduling policy after a finite number of steps. Finally, we show that our argument can easily be lifted to Markov games: We show that both players have a likewise simple optimal strategy in these more general structures.

  15. Designing a prototype of the ITER pulse scheduling system

    International Nuclear Information System (INIS)

    Yamamoto, T.; Yonekawa, I.; Ohta, K.; Hosoyama, H.; Hashimoto, Y.; Wallander, A.; Winter, A.; Sugie, T.; Kusama, Y.; Kawano, Y.; Yoshino, R.

    2012-01-01

    Highlights: ► We designed a prototype of the ITER pulse scheduling system. ► Structure of ITER pulse schedules was designed. ► Validation and automatic value assignment functions were adopted. ► A prototype will be implemented in 2011. - Abstract: A prototype of the ITER pulse scheduling system that prepares and manages parameters for ITER plasma operations has been designed. Based on the analyzed requirements on the system, structure of the parameters and necessary functions were determined. Segment and module structures were tuned to the ITER requirements. Three types of validations assure sanity of the parameters. The design limits check and the operation window check verify whether the values of the parameters do not exceed the limits. The consistency check calculates dependency among parameters in accordance with logics described in a scripting language. The ITER pulse scheduling system provides interface with a physics model and simulator. Some abstract physics parameters are converted to engineering parameters with the physics simulation. The results of simulation such as plasma characteristics of specified parameters are also shown to the researchers. The tool to specify the parameters is data-driven. Therefore, it is flexible for changes of number of the parameters. A prototype is being implemented in 2011. Using the prototype, this design will be verified and refined. The evaluation of the prototype will be a basis of the final production of the ITER pulse scheduling system.

  16. Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

    Science.gov (United States)

    Xia, Feng; Ma, Longhua; Peng, Chen; Sun, Youxian; Dong, Jinxiang

    2008-01-01

    There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS) scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting cross-layer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An event-driven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN. PMID:27879934

  17. Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

    Directory of Open Access Journals (Sweden)

    Jinxiang Dong

    2008-07-01

    Full Text Available There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting crosslayer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An eventdriven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN.

  18. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo

    Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker cons...... consumption and the impact on the remaining network and the customer service level. The model is applied to 4 real cases from Maersk Line. Solutions are comparable or superior to those chosen by operations managers. Cost savings of up to 58% may be achieved.......Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker...

  19. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

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

    Science.gov (United States)

    2010-07-22

    .../or continuing information collections, as required by the Paperwork Reduction Act of 1995, Public Law... Income, Credits, Deductions and Other Items), Schedule L (Balance Sheets per Books), Schedule M-1 (Reconciliation of Income (Loss) per Books With Income (Loss) per Return)), Schedule M-2 (Analysis of Partners...

  1. Preemptive scheduling in overloaded systems

    Czech Academy of Sciences Publication Activity Database

    Chrobak, M.; Epstein, L.; Noga, J.; Sgall, Jiří; van Stee, R.; Tichý, Tomáš; Vakhania, N.

    2003-01-01

    Roč. 67, č. 1 (2003), s. 183-197 ISSN 0022-0000 R&D Projects: GA ČR GA201/01/1195; GA MŠk ME 476; GA AV ČR IAA1019901; GA MŠk LN00A056 Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905 Keywords : scheduling * online algorithms * benefit Subject RIV: BA - General Mathematics Impact factor: 0.795, year: 2003

  2. WCET Analysis for Preemptive Scheduling

    OpenAIRE

    Altmeyer, Sebastian; Gebhard, Gernot

    2008-01-01

    Hard real-time systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it gets even more complex if tasks are scheduled preemptively -- especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compu...

  3. Scheduling Maintenance Jobs in Networks

    OpenAIRE

    Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman

    2017-01-01

    We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral t...

  4. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1995-02-01

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

  5. Broadcast scheduling for mobile advertising

    OpenAIRE

    De Reyck, B.; Degraeve, Z.

    2003-01-01

    We describe a broadcast scheduling system developed for a precision marketing firm specialized in location-sensitive permission-based mobile advertising using SMS (Short Message Service) text messaging. Text messages containing advertisements were sent to registered customers when they were shopping in one of two shopping centers in the vicinity of London. The ads typically contained a limited-time promotional offer. The company's problem was deciding which ads to send out to which customers ...

  6. Schedule of the nuclear program

    International Nuclear Information System (INIS)

    Heigl, F.

    1977-01-01

    The lecure tries to explain the main phases which must be passed to establish nuclear power plants, the feasibility phase, preconstruction and construction phase. Each phase consists of a lot of activities which are commented. Further the lecture tries to give some ideas of durances and dependence between the phases or activities to get a complete time schedule of the realization of a nuclear power project. (HP) [de

  7. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  8. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1993-01-01

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

  9. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

    2016-10-15

    Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

  10. Shiftwork Scheduling for the 1990s.

    Science.gov (United States)

    Coleman, Richard M.

    1989-01-01

    The author discusses the problems of scheduling shift work, touching on such topics as employee desires, health requirements, and business needs. He presents a method for developing shift schedules that addresses these three areas. Implementation hints are also provided. (CH)

  11. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    Over the last ten years, there have been numerous applications of evolutionary algorithms to a variety of scheduling problems. Like most other research on heuristic scheduling, the primary aim of the research has been on deterministic formulations of the problems. This is in contrast to real world...... scheduling problems which are usually not deterministic. Usually at the time the schedule is made some information about the problem and processing environment is available, but this information is uncertain and likely to change during schedule execution. Changes frequently encountered in scheduling...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...

  12. Pittsburgh International Airport - Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Here you can find Pittsburgh International Airport’s Monthly Scheduled Traffic Reports. Each of these reports contain a year-over-year (YOY) analysis of scheduled...

  13. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Durable Medical Equipment, Prosthetics-Orthotics, and Supplies Fee Schedule. The list contains the fee schedule amounts, floors, and ceilings for all procedure codes...

  14. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

    General Services Administration — GSA eLibrary (formerly Schedules e-Library) is the online source for the latest contract award information for: GSA Schedules; Department of Veterans Affairs (VA)...

  15. Interactive Anticipatory Scheduling for Two Military Applications

    National Research Council Canada - National Science Library

    Howe, Adele

    2003-01-01

    ...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...

  16. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

    Matveev, A.

    2010-01-01

    Four types of schedules differing in the level of their detail are singled out to enhance the efficiency of Belene NPP Project implementation planning and monitoring: Level 1 Schedule–Summary Integrated Overall Time Schedule (SIOTS) is an appendix to EPC Contract. The main purpose of SIOTS is the large scale presentation of the current information on the Project implementation. Level 2 Schedule–Integrated Overall Time Schedule (IOTS)is the contract schedule for the Contractor (ASE JSC) and their subcontractors.The principal purpose of IOTS is the work progress planning and monitoring, the analysis of the effect of activities implementation upon the progress of the Project as a whole. IOTS is the reporting schedule at the Employer –Contractor level. Level 3 Schedules, Detail Time Schedules(DTS) are developed by those who actually perform the work and are agreed upon with Atomstroyexport JSC.The main purpose of DTS is the detail planning of Atomstroyexport subcontractor's activities. DTSare the reporting schedules at the level of Contractor-Subcontractor. Level 4 Schedules are the High Detail Time Schedules (HDTS), which are the day-to-day plans of work implementation and are developed, as a rule, for a week's time period.Each lower level time schedule details the activities of the higher level time schedule

  17. Vehicle and driver scheduling for public transit.

    Science.gov (United States)

    2009-08-01

    The problem of driver scheduling involves the construction of a legal set of shifts, including allowance : of overtime, which cover the blocks in a particular vehicle schedule. A shift is the work scheduled to be performed by : a driver in one day, w...

  18. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed; Alouini, Mohamed-Slim; Ayadi, Yassin

    2017-01-01

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  19. 40 CFR 141.702 - Sampling schedules.

    Science.gov (United States)

    2010-07-01

    ... serving at least 10,000 people must submit their sampling schedule for the initial round of source water... submitting the sampling schedule that EPA approves. (3) Systems serving fewer than 10,000 people must submit... analytical result for a scheduled sampling date due to equipment failure, loss of or damage to the sample...

  20. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  1. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

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

  2. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

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

  3. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

    ... DELAWARE RIVER BASIN COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River... Administrative Manual--Part III--Basin Regulations--Water Supply Charges to revise the schedule of water charges... commenter and the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please...

  4. Mechanisms for scheduling games with selfish players

    NARCIS (Netherlands)

    Hoeksma, R.P.

    2015-01-01

    Many challenges in operations research involve optimization. In particular, scheduling treats the optimal planning of tasks. This thesis focuses on machine scheduling models, where a number of tasks, called jobs, need to be scheduled on one or more machines. The outcome is determined by which job is

  5. Military Free Fall Scheduling And Manifest Optimization Model

    Science.gov (United States)

    2016-12-01

    zone. As interest in qualifying more personnel increased, the course expanded. By the mid-1990s, Reyes explains, a new location was required to better...Since 2005, the Chilean Professional Soccer Association has used operations research techniques to schedule professional leagues in Chile . These...a new parachute the students are using, the RA-1. The RA-1 parachute has a longer glide ratio, which means the rate of descent is slower than with

  6. Influences on cocaine tolerance assessed under a multiple conjunctive schedule of reinforcement.

    Science.gov (United States)

    Yoon, Jin Ho; Branch, Marc N

    2009-11-01

    Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the effects of cocaine on key-pecking responses of White Carneau pigeons maintained under a three-component multiple conjunctive FI (10 s, 30 s, & 120 s) FR (5 responses) schedule of food presentation. Dose-effect curves representing the effects of presession cocaine on responding were assessed in the context of (1) acute administration of cocaine (2) chronic administration of cocaine and (3) daily administration of saline. Chronic administration of cocaine generally resulted in tolerance to the response-rate decreasing effects of cocaine, and that tolerance was generally independent of relative FI value, as measured by changes in ED50 values. Daily administration of saline decreased ED50 values to those observed when cocaine was administered acutely. The results show that adding a FR requirement to FI schedules is not sufficient to produce schedule-parameter-specific tolerance. Tolerance to cocaine was generally independent of FI-parameter under the present conjunctive schedules, indicating that a ratio requirement, per se, is not sufficient for tolerance to be dependent on FI parameter.

  7. Responsive versus scheduled feeding for preterm infants.

    Science.gov (United States)

    Watson, Julie; McGuire, William

    2015-10-13

    Feeding preterm infants in response to their hunger and satiation cues (responsive, cue-based, or infant-led feeding) rather than at scheduled intervals might enhance infants' and parents' experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. To assess the effect of feeding preterm infants on a responsive basis versus feeding prescribed volumes at scheduled intervals on growth, duration of hospital stay, and parental satisfaction. We used the standard search strategy of the Cochrane Neonatal Review Group. This included searches of the Cochrane Central Register of Controlled Trials (CENTRAL, The Cochrane Library, Issue 9, 2015), MEDLINE (1966 to September 2015), EMBASE (1980 to September 2015), and CINAHL (1982 to September 2015), conference proceedings, previous reviews, and trial registries. Randomised controlled trials (RCTs) or quasi-RCTs that compared a policy of feeding preterm infants on a responsive basis versus feeding at scheduled intervals. Two review authors assessed trial eligibility and risk of bias and undertook data extraction independently. We analysed the treatment effects in the individual trials and reported the risk ratio and risk difference for dichotomous data and mean difference (MD) for continuous data, with respective 95% confidence intervals (CIs). We used a fixed-effect model in meta-analyses and explored the potential causes of heterogeneity in sensitivity analyses. We found nine eligible RCTs including 593 infants in total. These trials compared responsive with scheduled interval regimens in preterm infants in the transition phase from intragastric tube to oral feeding. The trials were generally small and contained various methodological weaknesses including lack of blinding and incomplete assessment of all randomised participants. Meta-analyses, although limited by data quality and availability, suggest that responsive feeding

  8. The Use of Player-centered Positive Reinforcement to Schedule In-game Rewards Increases Enjoyment and Performance in a Serious Game

    Directory of Open Access Journals (Sweden)

    Aniket Nagle

    2014-10-01

    Full Text Available Among the methods used to increase enjoyment and performance in serious games, reward schedules, i.e., determining when in-game rewards should be given, have not been sufficiently explored. In the present study, we designed a simple memory training serious game and compared two methods of scheduling rewards, both based on the paradigm of positive reinforcement: fixed ratio schedule, in which rewards were given after a fixed number of correct responses, and variable ratio schedule, in which rewards were given after an unpredictable number of correct responses. To account for the variability in player preference for rewards, a player-centered sub-mode was included in both schedules by adjusting the schedule ratio according to player preference for rewards. The effectiveness of this approach was tested by comparing it against two more sub-modes: one which used a predetermined ratio, and another which set the ratio to the opposite of player preference. The game was put online and tested with 210 participants. Enjoyment, performance, duration of gameplay, and likelihood to play again were significantly higher in the player-centered sub-mode than the other sub-modes. On average, the variable-ratio schedule was better in the outcome measures than the fixed-ratio schedule. The results highlight the importance of in-game rewards, and indicate that giving rewards according to a player-centered variable-ratio schedule has the potential to make serious games more effective.

  9. It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management

    Science.gov (United States)

    Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin

    2008-01-01

    Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…

  10. Financial Key Ratios

    OpenAIRE

    Tănase Alin-Eliodor

    2014-01-01

    This article focuses on computing techniques starting from trial balance data regarding financial key ratios. There are presented activity, liquidity, solvency and profitability financial key ratios. It is presented a computing methodology in three steps based on a trial balance.

  11. Cure Schedule for Stycast 2651/Catalyst 9.

    Energy Technology Data Exchange (ETDEWEB)

    Kropka, Jamie Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); McCoy, John D. [New Mexico Inst. of Mining and Technology, Socorro, NM (United States)

    2017-11-01

    The Emerson & Cuming technical data sheet (TDS) for Stycast 2651/Catalyst 9 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation uses one of the schedules within the TDS and adds a “post cure” to obtain full reaction.

  12. Optimizing Unmanned Aircraft System Scheduling

    Science.gov (United States)

    2008-06-01

    ASC-U uses a deterministic algorithm to optimize over a given finite time horizon to obtain near-optimal UAS mission area assignments. ASC-U...the details of the algorithm . We set an upper bound on the total number of schedules that can be generated, so as not to create unsolvable ILPs. We...COL_MISSION_NAME)) If Trim( CStr (rMissions(iRow, COL_MISSION_REQUIRED))) <> "" Then If CLng(rMissions(iRow, COL_MISSION_REQUIRED)) > CLng

  13. A System for Automatically Generating Scheduling Heuristics

    Science.gov (United States)

    Morris, Robert

    1996-01-01

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

  14. Routine environmental monitoring schedule, calendar year 1995

    International Nuclear Information System (INIS)

    Schmidt, J.W.; Markes, B.M.; McKinney, S.M.

    1994-12-01

    This document provides Bechtel Hanford, Inc. (BHI) and Westinghouse Hanford Company (WHC) a schedule of monitoring and sampling routines for the Operational Environmental Monitoring (OEM) program during calendar year (CY) 1995. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near-Field Monitoring and may depend on the site history, radiological status, use and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1995

  15. Comparison of two kiln-drying schedules for turkish hazel ( Corylus colurna ) lumber of 5-cm thickness

    OpenAIRE

    Korkut, Süleyman; As, Nusret; Büyüksari, Ümit

    2018-01-01

    Abstract: Turkish hazel (Corylus colurna) lumber with a nominal thickness of 5 cm from the Kastamonu region, Turkey, was dried through conventional kiln drying using two different programs, a non-protective drying schedule and a protective drying schedule. The goal of the study was to obtain a kiln schedule that would maintain wood quality and also save drying time until a final moisture content of 8 ± 2% was reached. The intensity of warping (twisting, bowing, cupping, crooking), superficial...

  16. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1994-02-01

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

  17. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

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

  18. 75 FR 69851 - U.S. Citizenship and Immigration Services Fee Schedule; Correction

    Science.gov (United States)

    2010-11-16

    ...] RIN 1615-AB80 U.S. Citizenship and Immigration Services Fee Schedule; Correction AGENCY: U.S. Citizenship and Immigration Services, DHS. ACTION: Final rule; correction. SUMMARY: The Department of Homeland Security corrects an inadvertent error in the amendatory language of the final rule U.S. Citizenship and...

  19. Flexible job-shop scheduling based on genetic algorithm and simulation validation

    Directory of Open Access Journals (Sweden)

    Zhou Erming

    2017-01-01

    Full Text Available This paper selects flexible job-shop scheduling problem as the research object, and Constructs mathematical model aimed at minimizing the maximum makespan. Taking the transmission reverse gear production line of a transmission corporation as an example, genetic algorithm is applied for flexible jobshop scheduling problem to get the specific optimal scheduling results with MATLAB. DELMIA/QUEST based on 3D discrete event simulation is applied to construct the physical model of the production workshop. On the basis of the optimal scheduling results, the logical link of the physical model for the production workshop is established, besides, importing the appropriate process parameters to make virtual simulation on the production workshop. Finally, through analyzing the simulated results, it shows that the scheduling results are effective and reasonable.

  20. Final Report

    Energy Technology Data Exchange (ETDEWEB)

    Gurney, Kevin R. [Arizona Univ., Mesa, AZ (United States)

    2015-01-12

    This document constitutes the final report under DOE grant DE-FG-08ER64649. The organization of this document is as follows: first, I will review the original scope of the proposed research. Second, I will present the current draft of a paper nearing submission to Nature Climate Change on the initial results of this funded effort. Finally, I will present the last phase of the research under this grant which has supported a Ph.D. student. To that end, I will present the graduate student’s proposed research, a portion of which is completed and reflected in the paper nearing submission. This final work phase will be completed in the next 12 months. This final workphase will likely result in 1-2 additional publications and we consider the results (as exemplified by the current paper) high quality. The continuing results will acknowledge the funding provided by DOE grant DE-FG-08ER64649.

  1. Final Report

    Energy Technology Data Exchange (ETDEWEB)

    DeTar, Carleton [P.I.

    2012-12-10

    This document constitutes the Final Report for award DE-FC02-06ER41446 as required by the Office of Science. It summarizes accomplishments and provides copies of scientific publications with significant contribution from this award.

  2. Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Mohamed H

    2006-01-01

    Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

  3. Optimal Scheduling of Residential Microgrids Considering Virtual Energy Storage System

    Directory of Open Access Journals (Sweden)

    Weiliang Liu

    2018-04-01

    Full Text Available The increasingly complex residential microgrids (r-microgrid consisting of renewable generation, energy storage systems, and residential buildings require a more intelligent scheduling method. Firstly, aiming at the radiant floor heating/cooling system widely utilized in residential buildings, the mathematical relationship between the operative temperature and heating/cooling demand is established based on the equivalent thermodynamic parameters (ETP model, by which the thermal storage capacity is analyzed. Secondly, the radiant floor heating/cooling system is treated as virtual energy storage system (VESS, and an optimization model based on mixed-integer nonlinear programming (MINLP for r-microgrid scheduling is established which takes thermal comfort level and economy as the optimization objectives. Finally, the optimal scheduling results of two typical r-microgrids are analyzed. Case studies demonstrate that the proposed scheduling method can effectively employ the thermal storage capacity of radiant floor heating/cooling system, thus lowering the operating cost of the r-microgrid effectively while ensuring the thermal comfort level of users.

  4. Baseline development, economic risk, and schedule risk: An integrated approach

    International Nuclear Information System (INIS)

    Tonkinson, J.A.

    1994-01-01

    The economic and schedule risks of Environmental Restoration (ER) projects are commonly analyzed toward the end of the baseline development process. Risk analysis is usually performed as the final element of the scheduling or estimating processes for the purpose of establishing cost and schedule contingency. However, there is an opportunity for earlier assessment of risks, during development of the technical scope and Work Breakdown Structure (WBS). Integrating the processes of risk management and baselining provides for early incorporation of feedback regarding schedule and cost risk into the proposed scope of work. Much of the information necessary to perform risk analysis becomes available during development of the technical baseline, as the scope of work and WBS are being defined. The analysis of risk can actually be initiated early on during development of the technical baseline and continue throughout development of the complete project baseline. Indeed, best business practices suggest that information crucial to the success of a project be analyzed and incorporated into project planning as soon as it is available and usable

  5. Bilevel Fuzzy Chance Constrained Hospital Outpatient Appointment Scheduling Model

    Directory of Open Access Journals (Sweden)

    Xiaoyang Zhou

    2016-01-01

    Full Text Available Hospital outpatient departments operate by selling fixed period appointments for different treatments. The challenge being faced is to improve profit by determining the mix of full time and part time doctors and allocating appointments (which involves scheduling a combination of doctors, patients, and treatments to a time period in a department optimally. In this paper, a bilevel fuzzy chance constrained model is developed to solve the hospital outpatient appointment scheduling problem based on revenue management. In the model, the hospital, the leader in the hierarchy, decides the mix of the hired full time and part time doctors to maximize the total profit; each department, the follower in the hierarchy, makes the decision of the appointment scheduling to maximize its own profit while simultaneously minimizing surplus capacity. Doctor wage and demand are considered as fuzzy variables to better describe the real-life situation. Then we use chance operator to handle the model with fuzzy parameters and equivalently transform the appointment scheduling model into a crisp model. Moreover, interactive algorithm based on satisfaction is employed to convert the bilevel programming into a single level programming, in order to make it solvable. Finally, the numerical experiments were executed to demonstrate the efficiency and effectiveness of the proposed approaches.

  6. Dynamic Appliances Scheduling in Collaborative MicroGrids System

    Science.gov (United States)

    Bilil, Hasnae; Aniba, Ghassane; Gharavi, Hamid

    2017-01-01

    In this paper a new approach which is based on a collaborative system of MicroGrids (MG’s), is proposed to enable household appliance scheduling. To achieve this, appliances are categorized into flexible and non-flexible Deferrable Loads (DL’s), according to their electrical components. We propose a dynamic scheduling algorithm where users can systematically manage the operation of their electric appliances. The main challenge is to develop a flattening function calculus (reshaping) for both flexible and non-flexible DL’s. In addition, implementation of the proposed algorithm would require dynamically analyzing two successive multi-objective optimization (MOO) problems. The first targets the activation schedule of non-flexible DL’s and the second deals with the power profiles of flexible DL’s. The MOO problems are resolved by using a fast and elitist multi-objective genetic algorithm (NSGA-II). Finally, in order to show the efficiency of the proposed approach, a case study of a collaborative system that consists of 40 MG’s registered in the load curve for the flattening program has been developed. The results verify that the load curve can indeed become very flat by applying the proposed scheduling approach. PMID:28824226

  7. Project Robust Scheduling Based on the Scattered Buffer Technology

    Directory of Open Access Journals (Sweden)

    Nansheng Pang

    2018-04-01

    Full Text Available The research object in this paper is the sub network formed by the predecessor’s affect on the solution activity. This paper is to study three types of influencing factors from the predecessors that lead to the delay of starting time of the solution activity on the longest path, and to analyze the influence degree on the delay of the solution activity’s starting time from different types of factors. On this basis, through the comprehensive analysis of various factors that influence the solution activity, this paper proposes a metric that is used to evaluate the solution robustness of the project scheduling, and this metric is taken as the optimization goal. This paper also adopts the iterative process to design a scattered buffer heuristics algorithm based on the robust scheduling of the time buffer. At the same time, the resource flow network is introduced in this algorithm, using the tabu search algorithm to solve baseline scheduling. For the generation of resource flow network in the baseline scheduling, this algorithm designs a resource allocation algorithm with the maximum use of the precedence relations. Finally, the algorithm proposed in this paper and some other algorithms in previous literature are taken into the simulation experiment; under the comparative analysis, the experimental results show that the algorithm proposed in this paper is reasonable and feasible.

  8. Optimal Intermittent Dose Schedules for Chemotherapy Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nadia ALAM

    2013-08-01

    Full Text Available In this paper, a design method for optimal cancer chemotherapy schedules via genetic algorithm (GA is presented. The design targets the key objective of chemotherapy to minimize the size of cancer tumor after a predefined time with keeping toxic side effects in limit. This is a difficult target to achieve using conventional clinical methods due to poor therapeutic indices of existing anti-cancer drugs. Moreover, there are clinical limitations in treatment administration to maintain continuous treatment. Besides, carefully decided rest periods are recommended to for patient’s comfort. Three intermittent drug scheduling schemes are presented in this paper where GA is used to optimize the dose quantities and timings by satisfying several treatment constraints. All three schemes are found to be effective in total elimination of cancer tumor after an agreed treatment length. The number of cancer cells is found zero at the end of the treatment for all three cases with tolerable toxicity. Finally, two of the schemes, “Fixed interval variable dose (FIVD and “Periodic dose” that are periodic in characteristic have been emphasized due to their additional simplicity in administration along with friendliness to patients. responses to the designed treatment schedules. Therefore the proposed design method is capable of planning effective, simple, patient friendly and acceptable chemotherapy schedules.

  9. VVER-1000 dominance ratio

    International Nuclear Information System (INIS)

    Gorodkov, S.

    2009-01-01

    Dominance ratio, or more precisely, its closeness to unity, is important characteristic of large reactor. It allows evaluate beforehand the number of source iterations required in deterministic calculations of power spatial distribution. Or the minimal number of histories to be modeled for achievement of statistical error level desired in large core Monte Carlo calculations. In this work relatively simple approach for dominance ratio evaluation is proposed. It essentially uses core symmetry. Dependence of dominance ratio on neutron flux spatial distribution is demonstrated. (author)

  10. WWER-1000 dominance ratio

    International Nuclear Information System (INIS)

    Gorodkov, S.S.

    2009-01-01

    Dominance ratio, or more precisely, its closeness to unity, is important characteristic of large reactor. It allows evaluate beforehand the number of source iterations required in deterministic calculations of power spatial distribution. Or the minimal number of histories to be modeled for achievement of statistical error level desired in large core Monte Carlo calculations. In this work relatively simple approach for dominance ratio evaluation is proposed. It essentially uses core symmetry. Dependence of dominance ratio on neutron flux spatial distribution is demonstrated. (Authors)

  11. Sharpening Sharpe Ratios

    OpenAIRE

    William N. Goetzmann; Jonathan E. Ingersoll Jr.; Matthew I. Spiegel; Ivo Welch

    2002-01-01

    It is now well known that the Sharpe ratio and other related reward-to-risk measures may be manipulated with option-like strategies. In this paper we derive the general conditions for achieving the maximum expected Sharpe ratio. We derive static rules for achieving the maximum Sharpe ratio with two or more options, as well as a continuum of derivative contracts. The optimal strategy has a truncated right tail and a fat left tail. We also derive dynamic rules for increasing the Sharpe ratio. O...

  12. A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

    KAUST Repository

    Elwhishi, Ahmed

    2013-05-01

    Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.

  13. Parallel Machine Scheduling with Batch Delivery to Two Customers

    Directory of Open Access Journals (Sweden)

    Xueling Zhong

    2015-01-01

    Full Text Available In some make-to-order supply chains, the manufacturer needs to process and deliver products for customers at different locations. To coordinate production and distribution operations at the detailed scheduling level, we study a parallel machine scheduling model with batch delivery to two customers by vehicle routing method. In this model, the supply chain consists of a processing facility with m parallel machines and two customers. A set of jobs containing n1 jobs from customer 1 and n2 jobs from customer 2 are first processed in the processing facility and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that the tradeoff between maximum arrival time of the jobs and total distribution cost is minimized. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We provide polynomial time heuristics with worst-case performance analysis for the problem. If m=2 and (n1-b(n2-b<0, we propose a heuristic with worst-case ratio bound of 3/2, where b is the capacity of the delivery shipment. Otherwise, the worst-case ratio bound of the heuristic we propose is 2-2/(m+1.

  14. Planning construction of integrative schedule management for nuclear power project

    International Nuclear Information System (INIS)

    Zeng Zhenglin; Wang Wenying; Peng Fei

    2012-01-01

    This paper introduces the planning construction of integrative schedule management for Nuclear Power Project. It details schedule management system and the requirement of schedulers and the mode of three schedule management flats. And analysis it combing with the implementation of construction water and all special schedules before FCD to further propose the improving and researching direction for the integrative schedule management. (authors)

  15. A Formal Product-Line Engineering Approach for Schedulers

    NARCIS (Netherlands)

    Orhan, Güner; Aksit, Mehmet; Rensink, Arend; Jololian, Leon; Robbins, David E.; Fernandes, Steven L.

    2017-01-01

    Scheduling techniques have been applied to a large category of software systems, such as, processor scheduling in operating systems, car scheduling in elevator systems, facility scheduling at airports, antenna scheduling in radar systems, scheduling of events, control signals and data in

  16. Measuring robustness of port plug maintenance schedules in fusion remote handling

    Energy Technology Data Exchange (ETDEWEB)

    Schoen, P.W., E-mail: p.w.schoen@heemskerk-innovative.nl [Heemskerk Innovative Technology, Sassenheim (Netherlands); Thomas, J. [CCFE EURATOM/CCFE Fusion Association, Culham Science Centre, Abingdon OX14 3DB (United Kingdom); Boessenkool, H. [FOM Institute DIFFER, Association EURATOM-FOM, Partner in the Trilateral Euregio Cluster, PO Box 1207, 3430 BE Nieuwegein (Netherlands); Heemskerk, C.J.M. [Heemskerk Innovative Technology, Sassenheim (Netherlands)

    2015-12-15

    Unexpected events during maintenance operations of a fusion plant like JET or ITER may require rescheduling, suspending the execution of the current procedure to pick it up later. In this paper, we look at how the introduction of slack influences the port plug maintenance schedule robustness. We introduce a metrics to measure the robustness. Simulating disruptions we evaluate the effect on a schedule. Finally, we show how the robustness is affected when introducing different amounts of slack.

  17. Measuring robustness of port plug maintenance schedules in fusion remote handling

    International Nuclear Information System (INIS)

    Schoen, P.W.; Thomas, J.; Boessenkool, H.; Heemskerk, C.J.M.

    2015-01-01

    Unexpected events during maintenance operations of a fusion plant like JET or ITER may require rescheduling, suspending the execution of the current procedure to pick it up later. In this paper, we look at how the introduction of slack influences the port plug maintenance schedule robustness. We introduce a metrics to measure the robustness. Simulating disruptions we evaluate the effect on a schedule. Finally, we show how the robustness is affected when introducing different amounts of slack.

  18. Narrative Finality

    Directory of Open Access Journals (Sweden)

    Armine Kotin Mortimer

    1981-01-01

    Full Text Available The cloturai device of narration as salvation represents the lack of finality in three novels. In De Beauvoir's Tous les hommes sont mortels an immortal character turns his story to account, but the novel makes a mockery of the historical sense by which men define themselves. In the closing pages of Butor's La Modification , the hero plans to write a book to save himself. Through the thrice-considered portrayal of the Paris-Rome relationship, the ending shows the reader how to bring about closure, but this collective critique written by readers will always be a future book. Simon's La Bataille de Pharsale , the most radical attempt to destroy finality, is an infinite text. No new text can be written. This extreme of perversion guarantees bliss (jouissance . If the ending of De Beauvoir's novel transfers the burden of non-final world onto a new victim, Butor's non-finality lies in the deferral to a future writing, while Simon's writer is stuck in a writing loop, in which writing has become its own end and hence can have no end. The deconstructive and tragic form of contemporary novels proclaims the loss of belief in a finality inherent in the written text, to the profit of writing itself.

  19. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

    Satyanarayan, Arvind; Strazzulla, Daniel; Klokmose, Clemens Nylandsted

    2013-01-01

    CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event is availa......CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event...... is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  20. The ASDEX Upgrade discharge schedule

    International Nuclear Information System (INIS)

    Neu, G.; Engelhardt, K.; Raupp, G.; Treutterer, W.; Zasche, D.; Zehetbauer, T.

    2007-01-01

    ASDEX Upgrade's recently commissioned discharge control system (DCS) marks the transition from a traditional programmed system to a highly flexible 'data driven' one. The allocation of application processes (APs) to controllers, the interconnection of APs through uniquely named signals, and AP control parameter values are all defined as data, and can easily be adapted to the requirements of a particular discharge. The data is laid down in a set of XML documents which APs request via HTTP from a configuration server before a discharge. The use of XML allows for easy parsing, and structural validation through (XSD) schemas. The central input to the configuration process is the discharge schedule (DS), which embodies the dynamic behaviour of a planned discharge as reference trajectories grouped in segments, concatenated through transition conditions. Editing, generation and validation tools, and version control through CVS allow for efficient management of DSs

  1. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L E

    1992-01-01

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

  2. An EV Charging Scheduling Mechanism Based on Price Negotiation

    Directory of Open Access Journals (Sweden)

    Baocheng Wang

    2018-05-01

    Full Text Available Scheduling EV user’s charging behavior based on charging price and applying renewable energy resources are the effective methods to release the load pressure of power grids brought about by the large-scale popularity of electric vehicles (EVs. This paper presents a novel approach for EV charging scheduling based on price negotiation. Firstly, the EV charging system framework based on price negotiation and renewable energy resources is discussed. Secondly, the price negotiation model is presented, including the initial price models and the conditions of transactions. Finally, an EV charging scheduling mechanism based on price negotiation (CSM-PN, including the price adjustment strategies of both the operator and EV users is proposed to seek a final transaction during multi-round price negotiation. Simulation results show that this novel approach can effectively improve the charging station operator’s income, reduce the EV users’ costs, and balance the load of the power grid while improving the efficiency of the EV charging system.

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

    Science.gov (United States)

    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.

  4. Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

    Science.gov (United States)

    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

  5. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

    Full Text Available The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: flight scheduling, aircraft scheduling, crew scheduling and disruptions management. These aforementioned scheduling and planning problems faced by all airline companies in the airline sector were examined in detail. Studies reveal that companies using the advanced methods might gain significant cost reductions. However, even then, the time required for solving large scale problems may not satisfy the decision quality desired by decision makers. In such cases, using modern decision methods integrated with advanced technologies offer companies an opportunity for significant cost-advantages.

  6. Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2005-01-01

    We present an approach to the analysis and optimization of heterogeneous distributed embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organized in a hierarchy. In this paper, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems....... Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example....

  7. Choice with frequently changing food rates and food ratios.

    Science.gov (United States)

    Baum, William M; Davison, Michael

    2014-03-01

    In studies of operant choice, when one schedule of a concurrent pair is varied while the other is held constant, the constancy of the constant schedule may exert discriminative control over performance. In our earlier experiments, schedules varied reciprocally across components within sessions, so that while food ratio varied food rate remained constant. In the present experiment, we held one variable-interval (VI) schedule constant while varying the concurrent VI schedule within sessions. We studied five conditions, each with a different constant left VI schedule. On the right key, seven different VI schedules were presented in seven different unsignaled components. We analyzed performances at several different time scales. At the longest time scale, across conditions, behavior ratios varied with food ratios as would be expected from the generalized matching law. At shorter time scales, effects due to holding the left VI constant became more and more apparent, the shorter the time scale. In choice relations across components, preference for the left key leveled off as the right key became leaner. Interfood choice approximated strict matching for the varied right key, whereas interfood choice hardly varied at all for the constant left key. At the shortest time scale, visit patterns differed for the left and right keys. Much evidence indicated the development of a fix-and-sample pattern. In sum, the procedural difference made a large difference to performance, except for choice at the longest time scale and the fix-and-sample pattern at the shortest time scale. © Society for the Experimental Analysis of Behavior.

  8. Appearance of Abnormal Cardiothoracic Ratio of Fetuses with Hemoglobin Bart's Disease: Life Table Analysis.

    Science.gov (United States)

    Wanapirak, Chanane; Sirichotiyakul, Supatra; Luewan, Suchaya; Srisupundit, Kasemsri; Tongprasert, Fuanglada; Tongsong, Theera

    2017-10-01

    Objective  To determine the timeline of the first appearance of an increased CT ratio of fetuses with hemoglobin (Hb) Bart's disease. Materials and Methods  A prospective longitudinal study was conducted on pregnancies at risk for fetal Hb Bart's disease. Sonographic markers including cardiothoracic (CT) ratio and middle cerebral artery peak systolic velocity (MCA-PSV) were serially assessed and recorded from the first trimester. The definite diagnosis of fetal Hb Bart's disease based on DNA analysis (CVS), or fetal Hb typing (HPLC; cordocentesis) was performed at the first appearance of an increased CT ratio. Results  Of 275 pregnancies at risk, 64 fetuses were finally proven to be affected and life table analysis was performed. Most affected fetuses showed an increased CT ratio in late first trimester and early second trimester, with median time of the first appearance at 13 weeks and all affected fetuses were detected at 23 weeks or less. The CT ratio yielded a sensitivity of 100 % at a gestational age of 23 weeks with a false-positive rate of 8 %. MCA-PSV appeared later than CT ratio. Only 9.4 % of affected cases developed abnormal MCA-PSV before an increased CT ratio. Conclusion  The timeline of the first appearance of an increased CT ratio of fetuses with Hb Bart's disease was established. This may help us identify Hb Bart's disease among fetuses at risk in earlier gestation and proper schedules for serial ultrasound could be made more effectively. © Georg Thieme Verlag KG Stuttgart · New York.

  9. Analisis Performansi Algoritma Penjadwalan Log Rule dan Frame Level Schedule Skenario Multicell Pada Layer Mac LTE

    Directory of Open Access Journals (Sweden)

    Ridwan

    2016-03-01

    Full Text Available Mobile telecommunications technology gradually evolved to support better services such as voice, data, and video to users of telecommunications services. LTE (Long Term Evolution is a network based on Internet Protocol (IP standardized by 3rd Generation Partnership Project (3GPP. To support it, LTE requires a mechanism that can support. One of them by applying methods of scheduling packets in each service. Scheduling is a different treatment to packets that come in accordance with the priorities of the scheduling algorithm. In this research, to analyze the performance of LTE with paramater delay, packet loss ratio, throughput and fairness index uses a scheduling algorithms Frame Level Schedule (FLS and Log Rule on LTE-Simulator with scenarios using Voip traffic, Video and Best Effort (BE. The results is scheduling algorithms FLS is better than log rule in term of throughput values, while of scheduling algorithms log rule is better than FLS in terms of delay based on the number and speed of the users. This indicates that both scheduling algorithms suitable for use in LTE networks within conditions of traffic real time services, but not for non real time services such as BE.

  10. On Coding of Scheduling Information in OFDM

    OpenAIRE

    Gunnarsson, Fredrik; Moosavi, Reza; Eriksson, Jonas; Larsson, Erik G.; Wiberg, Niklas; Frenger, Pål

    2009-01-01

    Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The...

  11. Management of Temporal Constraints for Factory Scheduling.

    Science.gov (United States)

    1987-06-01

    consistency of scheduling decisions were implemented in both the ISIS [Fox 84] and SOJA [LePape 85a] scheduling systems. More recent work with the...kinds of time propagation systems: the symbolic and the numeric ones. Symbolic systems combine relationships with a temporal logic a la Allen [Allen 81...maintains consistency by narrowing time windows associated with activities as decisions are made, and SOJA [LePape 85b] guarantees a schedule’s

  12. Cost effective shift schedules enhance utility operations

    International Nuclear Information System (INIS)

    Coleman, R.M.

    1995-01-01

    This article describes how new shift scheduling concepts can save utility operations millions of dollars every year and yet maintain safety and improve employee morale. The key to scheduling is to define and match the work load. This includes discretionary as well as daily, weekly, and yearly core work loads. In most power plants the overall work load (including maintenance, operations, materials handling, etc.) on day shift is greater than on other shifts, hence an unbalanced schedule would be appropriate

  13. Trustable Virtual Machine Scheduling in a Cloud

    OpenAIRE

    Hermenier , Fabien; Henrio , Ludovic

    2017-01-01

    International audience; In an Infrastructure As A Service (IaaS) cloud, the scheduler deploys VMs to servers according to service level objectives (SLOs). Clients and service providers must both trust the infrastructure. In particular they must be sure that the VM scheduler takes decisions that are consistent with its advertised behaviour. The difficulties to master every theoretical and practical aspects of a VM scheduler implementation leads however to faulty behaviours that break SLOs and ...

  14. Flow shop scheduling with heterogeneous workers

    OpenAIRE

    Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier

    2014-01-01

    We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the labor integration of persons with disabilities, an important aim not only for these centers but for any company d...

  15. A hybrid job-shop scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  16. LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

    OpenAIRE

    Prakhar Ojha; Siddhartha R Thota; Vani M; Mohit P Tahilianni

    2015-01-01

    An operating system scheduler is expected to not allow processor stay idle if there is any process ready or waiting for its execution. This problem gains more importance as the numbers of processes always outnumber the processors by large margins. It is in this regard that schedulers are provided with the ability to preempt a running process, by following any scheduling algorithm, and give us an illusion of simultaneous running of several processes. A process which is allowed t...

  17. Detecting isotopic ratio outliers

    International Nuclear Information System (INIS)

    Bayne, C.K.; Smith, D.H.

    1985-01-01

    An alternative method is proposed for improving isotopic ratio estimates. This method mathematically models pulse-count data and uses iterative reweighted Poisson regression to estimate model parameters to calculate the isotopic ratios. This computer-oriented approach provides theoretically better methods than conventional techniques to establish error limits and to identify outliers. 6 refs., 3 figs., 3 tabs

  18. Detecting isotopic ratio outliers

    Science.gov (United States)

    Bayne, C. K.; Smith, D. H.

    An alternative method is proposed for improving isotopic ratio estimates. This method mathematically models pulse-count data and uses iterative reweighted Poisson regression to estimate model parameters to calculate the isotopic ratios. This computer-oriented approach provides theoretically better methods than conventional techniques to establish error limits and to identify outliers.

  19. Detecting isotopic ratio outliers

    International Nuclear Information System (INIS)

    Bayne, C.K.; Smith, D.H.

    1986-01-01

    An alternative method is proposed for improving isotopic ratio estimates. This method mathematically models pulse-count data and uses iterative reweighted Poisson regression to estimate model parameters to calculate the isotopic ratios. This computer-oriented approach provides theoretically better methods than conventional techniques to establish error limits and to identify outliers

  20. Cloud Service Scheduling Algorithm Research and Optimization

    Directory of Open Access Journals (Sweden)

    Hongyan Cui

    2017-01-01

    Full Text Available We propose a cloud service scheduling model that is referred to as the Task Scheduling System (TSS. In the user module, the process time of each task is in accordance with a general distribution. In the task scheduling module, we take a weighted sum of makespan and flowtime as the objective function and use an Ant Colony Optimization (ACO and a Genetic Algorithm (GA to solve the problem of cloud task scheduling. Simulation results show that the convergence speed and output performance of our Genetic Algorithm-Chaos Ant Colony Optimization (GA-CACO are optimal.

  1. A customizable, scalable scheduling and reporting system.

    Science.gov (United States)

    Wood, Jody L; Whitman, Beverly J; Mackley, Lisa A; Armstrong, Robert; Shotto, Robert T

    2014-06-01

    Scheduling is essential for running a facility smoothly and for summarizing activities in use reports. The Penn State Hershey Clinical Simulation Center has developed a scheduling interface that uses off-the-shelf components, with customizations that adapt to each institution's data collection and reporting needs. The system is designed using programs within the Microsoft Office 2010 suite. Outlook provides the scheduling component, while the reporting is performed using Access or Excel. An account with a calendar is created for the main schedule, with separate resource accounts created for each room within the center. The Outlook appointment form's 2 default tabs are used, in addition to a customized third tab. The data are then copied from the calendar into either a database table or a spreadsheet, where the reports are generated.Incorporating this system into an institution-wide structure allows integration of personnel lists and potentially enables all users to check the schedule from their desktop. Outlook also has a Web-based application for viewing the basic schedule from outside the institution, although customized data cannot be accessed. The scheduling and reporting functions have been used for a year at the Penn State Hershey Clinical Simulation Center. The schedule has increased workflow efficiency, improved the quality of recorded information, and provided more accurate reporting. The Penn State Hershey Clinical Simulation Center's scheduling and reporting system can be adapted easily to most simulation centers and can expand and change to meet future growth with little or no expense to the center.

  2. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

    ...) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE NATIONAL SECURITY INDUSTRIAL BASE REGULATIONS DEFENSE PRIORITIES AND ALLOCATIONS SYSTEM Industrial Priorities § 700.14 Preferential scheduling. (a) A...

  3. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

  4. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... that will be used in this study. LBS is a scheduling method that rests upon the theories of line-of-balance and which uses the graphic representation of a flowline chart. As such, LBS is adapted for planning and management of workflows and, thus, may provide a solution to the identified shortcomings of CPM. Even...

  5. Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

    Directory of Open Access Journals (Sweden)

    Atinat Palawan

    2016-05-01

    Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

  6. Optimal Residential Load Scheduling Under Utility and Rooftop Photovoltaic Units

    Directory of Open Access Journals (Sweden)

    Ghulam Hafeez

    2018-03-01

    Full Text Available With the rapid advancement in technology, electrical energy consumption is increasing rapidly. Especially, in the residential sector, more than 80% of electrical energy is being consumed because of consumer negligence. This brings the challenging task of maintaining the balance between the demand and supply of electric power. In this paper, we focus on the problem of load balancing via load scheduling under utility and rooftop photovoltaic (PV units to reduce electricity cost and peak to average ratio (PAR in demand-side management. For this purpose, we adopted genetic algorithm (GA, binary particle swarm optimization (BPSO, wind-driven optimization (WDO, and our proposed genetic WDO (GWDO algorithm, which is a hybrid of GA and WDO, to schedule the household load. For energy cost estimation, combined real-time pricing (RTP and inclined block rate (IBR were used. The proposed algorithm shifts load from peak consumption hours to off-peak hours based on combined pricing scheme and generation from rooftop PV units. Simulation results validate our proposed GWDO algorithm in terms of electricity cost and PAR reduction while considering all three scenarios which we have considered in this work: (1 load scheduling without renewable energy sources (RESs and energy storage system (ESS, (2 load scheduling with RESs, and (3 load scheduling with RESs and ESS. Furthermore, our proposed scheme reduced electricity cost and PAR by 22.5% and 29.1% in scenario 1, 47.7% and 30% in scenario 2, and 49.2% and 35.4% in scenario 3, respectively, as compared to unscheduled electricity consumption.

  7. Flow shop scheduling algorithm to optimize warehouse activities

    Directory of Open Access Journals (Sweden)

    P. Centobelli

    2016-01-01

    Full Text Available Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities.

  8. 75 FR 47503 - Schedules of Controlled Substances; Placement of 2,5-Dimethoxy-4-(n)-propylthiophenethylamine and...

    Science.gov (United States)

    2010-08-06

    ... scientific background information, comparisons of potency differences are only one piece of background... the CSA. Even though the scheduling of BZP was finalized more than six years ago, DEA has been advised...

  9. A New Software for Management, Scheduling, and Optimization for the Light Hydrocarbon Pipeline Network System of Daqing Oilfield

    Directory of Open Access Journals (Sweden)

    Yongtu Liang

    2014-01-01

    Full Text Available This paper presents the new software which specifically developed based on Visual Studio 2010 for Daqing Oilfield China includes the most complex light hydrocarbon pipeline network system in Asia, has become a powerful auxiliary tool to manage field data, makes scheduling plans for batching operation, and optimizes pumping plans. Firstly, DMM for recording and managing field data is summarized. Then, the batch scheduling simulation module called SSM for the difficult batch-scheduling issues of the multiple-source pipeline network system is introduced. Finally, SOM, that is Scheduling Optimization Module, is indicated for solving the problem of the pumps being started up/shut-down frequently.

  10. Final Report

    DEFF Research Database (Denmark)

    Heiselberg, Per; Brohus, Henrik; Nielsen, Peter V.

    This final report for the Hybrid Ventilation Centre at Aalborg University describes the activities and research achievement in the project period from August 2001 to August 2006. The report summarises the work performed and the results achieved with reference to articles and reports published...

  11. 29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.

    Science.gov (United States)

    2010-07-01

    ... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee... 29 Labor 3 2010-07-01 2010-07-01 false Scheduling of intermittent or reduced schedule leave. 825... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the...

  12. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje E.; Braaksma, Aleida; Vliegen, Ingrid M. H.; Boucherie, Richard J.; Litvak, Nelly; Hans, Erwin W.

    2014-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  13. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje Elisabeth; Boucherie, Richardus J.; Litvak, Nelli; Hans, Elias W.

    2011-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  14. Accelerating exact schedulability analysis for fixed-priority pre-emptive scheduling

    NARCIS (Netherlands)

    Hang, Y.; Jiale, Z.; Keskin, U.; Bril, R.J.

    2010-01-01

    The schedulability analysis for fixed-priority preemptive scheduling (FPPS) plays a significant role in the real-time systems domain. The so-called Hyperplanes Exact Test (HET) [1] is an example of an exact schedulability test for FPPS. In this paper, we aim at improving the efficiency of HET by

  15. Difference and ratio plots

    DEFF Research Database (Denmark)

    Svendsen, Anders Jørgen; Holmskov, U; Bro, Peter

    1995-01-01

    and systemic lupus erythematosus from another previously published study (Macanovic, M. and Lachmann, P.J. (1979) Clin. Exp. Immunol. 38, 274) are also represented using ratio plots. Our observations indicate that analysis by regression analysis may often be misleading....... hitherto unnoted differences between controls and patients with either rheumatoid arthritis or systemic lupus erythematosus. For this we use simple, but unconventional, graphic representations of the data, based on difference plots and ratio plots. Differences between patients with Burkitt's lymphoma...

  16. A dynamic approach to vehicle scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

    2001-01-01

    textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

  17. State Teacher Salary Schedules. Policy Analysis

    Science.gov (United States)

    Griffith, Michael

    2016-01-01

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

  18. Evolutionary Scheduler for the Deep Space Network

    Science.gov (United States)

    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.

  19. Decay-usage scheduling in multiprocessors

    NARCIS (Netherlands)

    Epema, D.H.J.

    1998-01-01

    Decay-usage scheduling is a priority-aging time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this article we deal with

  20. 5 CFR 950.801 - Campaign schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...

  1. 46 CFR 525.2 - Terminal schedules.

    Science.gov (United States)

    2010-10-01

    ... domestic law and international conventions and agreements adopted by the United States; such terminal... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule that...

  2. 21 CFR 1308.13 - Schedule III.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and... opposite it. (b) Stimulants. Unless specifically excepted or unless listed in another schedule, any... a stimulant effect on the central nervous sxstem, including its salts, isomers (whether optical...

  3. Management Matters. Changing to Flexible Scheduling

    Science.gov (United States)

    Pappas, Marjorie L.

    2005-01-01

    Elementary school library media specialists state that one of the most frustrating issues they face is the fixed schedules in their library media centers. Beyond the cost effectiveness issue, the fixed schedule severely limits using the resources of the library media center for inquiry learning and collaborative teaching experiences between the…

  4. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

    Mao, X.; Ter Mors, A.W.; Roos, N.; Witteveen, C.

    2006-01-01

    The planning and scheduling of the deicing and anti-icing activities is an important and challenging part of airport departure planning. Deicing planning has to be done in a highly dynamic environment involving several autonomous and self-interested parties. Traditional centralized scheduling

  5. Robust scheduling in an uncertain environment

    NARCIS (Netherlands)

    Wilson, M.

    2016-01-01

    This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway industry companies. The focus therefore lies on scheduling of maintenance operations on rolling stock

  6. Scheduling EURO-k Conferences

    DEFF Research Database (Denmark)

    Stidsen, Thomas Jacob Riis; Pisinger, David; Vigo, Daniele

    2017-01-01

    , areas are assigned to buildings, making sure that related research areas are located close to each other. Next, the goal is to allocate each stream to only one room, and to ensure that the stream consists of a sequence of consecutive time slots. Finally, we optimize the assignment of room sizes. We...

  7. Final Report

    Energy Technology Data Exchange (ETDEWEB)

    Stinis, Panos [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

    2016-08-07

    This is the final report for the work conducted at the University of Minnesota (during the period 12/01/12-09/18/14) by PI Panos Stinis as part of the "Collaboratory on Mathematics for Mesoscopic Modeling of Materials" (CM4). CM4 is a multi-institution DOE-funded project whose aim is to conduct basic and applied research in the emerging field of mesoscopic modeling of materials.

  8. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction and Schedule After nearly seven months of concentrated effort, the installation of services on YB0 moved off the CMS critical path in late November. In line with v36 planning provisions, the additional time needed to finish this challeng¬ing task was accommodated by reducing sequential dependencies between assembly tasks, putting more tasks (especially heavy logistic movements) in parallel with activities on, or within, the central wheel. Thus the lowering of wheels YB-1 and YB -2 and of disk YE-3 is already complete, the latter made possible, in the shadow of YB0 work, by inverting the order of the 3 endcap disks in the surface building. Weather conditions permitting, the Tracker will be transported to point 5 during CMS week for insertion in EB before CERN closes. The lowering of the last two disks will take place mid- and end-of January, respectively. Thus central beampipe installation can be confidently planned to start in February as foreseen, allowing closure of CMS in time for CRA...

  9. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Despite the holiday season affecting available manpower, many key internal milestones have been passed over the summer, thanks to the dedication and commitment of the team at point 5. In particular, the installation on, and within, YB0 has progressed steadily through several potentially difficult phases. The v36 planning contingency of lowering YB-1 and YB-1 wheels on schedule in October, before Tracker installation, will be executed in order to give more time to complete YB0 services work, whilst still being consistent with completion of heavy lowering by the end of 2007. Safety In the underground areas the peak level of activity and parallel work has been reached and this will continue for the coming months. Utmost vigilance is required of everybody working underground and this must be maintained. However, it is encouraging to note that the compliance with safety rules is, in general, good. More and more work will be carried out from scaffolding and mobile access platforms. (cherry-picke...

  10. Scheduling mammograms for asymptomatic women

    International Nuclear Information System (INIS)

    Gohagan, J.K.; Darby, W.P.; Spitznagel, E.L.; Tome, A.E.

    1988-01-01

    A decision theoretic model was used to investigate the relative importance of risk level, radiation hazard, mammographic accuracy, and cost in mammographic screening decision. The model uses woman-specific medical and family history facts and clinic-specific information regarding mammographic accuracy and practice to profile both woman and clinic, and to formulate periodic screening recommendations. Model parameters were varied extensively to investigate the sensitivity of screening schedules to input values. Multivariate risk was estimated within the program using published data from the Breast Cancer Detection Demonstration Project 5-year follow-up study. Radiation hazard estimates were developed from published radiation physics and radioepidemiologic risk data. Benchmark values for mammographic sensitivity and specificity under screening conditions were calculated from Breast Cancer Detection Demonstration Project data. Procedural costs used in the analysis were varied around values reflecting conditions at the Washington University Medical Center. Mortality advantages of early versus late breast cancer detection were accounted for using Health Insurance Plan of New York case survival rates. Results are compared with published screening policies to provide insight into implicit assumptions behind those policies. This analysis emphasizes the importance of accounting for variations in clinical accuracy under screening circumstances, in costs, in radiation exposure, and in woman-specific risk when recommending mammographic screening

  11. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Since the lowering of YB0 in February, less spectacular but nonetheless crucial progress has been made along the critical path to CMS completion. The YB0 has been aligned with the beamline to a fraction of a mm, and the HCAL has been fully installed. Cabling scaffolding for YB0 services has been built and one half (-z end) of the ECAL barrel has been installed. The YB0 services installation has begun, with two of the major technical challenges delaying bulk installation, namely PP1 detailed design, manufacture and installation plus Tracker cooling pipe insulation, now apparently solved. Significant difficulties in detailed design, integration and procurement of cable ducts remain. Despite this, the design of the +end is close to complete, and Tracker power cable installation on two sectors of the +end is well advanced. A new master schedule, v36.0, is being prepared to account for the updated actual situation at point 5 and for the revised LHC machine planning. Safety The enormous amount of...

  12. Scheduling nursing personnel on a microcomputer.

    Science.gov (United States)

    Liao, C J; Kao, C Y

    1997-01-01

    Suggests that with the shortage of nursing personnel, hospital administrators have to pay more attention to the needs of nurses to retain and recruit them. Also asserts that improving nurses' schedules is one of the most economic ways for the hospital administration to create a better working environment for nurses. Develops an algorithm for scheduling nursing personnel. Contrary to the current hospital approach, which schedules nurses on a person-by-person basis, the proposed algorithm constructs schedules on a day-by-day basis. The algorithm has inherent flexibility in handling a variety of possible constraints and goals, similar to other non-cyclical approaches. But, unlike most other non-cyclical approaches, it can also generate a quality schedule in a short time on a microcomputer. The algorithm was coded in C language and run on a microcomputer. The developed software is currently implemented at a leading hospital in Taiwan. The response to the initial implementation is quite promising.

  13. NASA Instrument Cost/Schedule Model

    Science.gov (United States)

    Habib-Agahi, Hamid; Mrozinski, Joe; Fox, George

    2011-01-01

    NASA's Office of Independent Program and Cost Evaluation (IPCE) has established a number of initiatives to improve its cost and schedule estimating capabilities. 12One of these initiatives has resulted in the JPL developed NASA Instrument Cost Model. NICM is a cost and schedule estimator that contains: A system level cost estimation tool; a subsystem level cost estimation tool; a database of cost and technical parameters of over 140 previously flown remote sensing and in-situ instruments; a schedule estimator; a set of rules to estimate cost and schedule by life cycle phases (B/C/D); and a novel tool for developing joint probability distributions for cost and schedule risk (Joint Confidence Level (JCL)). This paper describes the development and use of NICM, including the data normalization processes, data mining methods (cluster analysis, principal components analysis, regression analysis and bootstrap cross validation), the estimating equations themselves and a demonstration of the NICM tool suite.

  14. Routine environmental monitoring schedule, calendar year 1997

    Energy Technology Data Exchange (ETDEWEB)

    Markes, B.M., Westinghouse Hanford

    1996-12-10

    This document provides the Environmental Restorations Contractor (ERC) and the Project Hanford Management Contractor.(PHMC) a schedule in accordance with the WHC-CM-7-5, Environmental Compliance` and BHI- EE-02, Environmental Requirements, of monitoring and sampling routines for the Near-Field Monitoring (NFM) program during calendar year (CY) 1997. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near- Field Monitoring and may depend on the site history, radiological status, use, and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1998. The outside perimeter road surveys of 200 East and West Area and the rail survey from the 300 Area to Columbia Center will be performed in the year 2000 per agreement with Department of Energy. Richland Field Office. This schedule does not discuss staffing needs, nor does it list the monitoring equipment to be used in completing specific routines. Personnel performing routines to meet this schedule shall communicate any need for assistance in completing these routines to Radiological Control management and Near-Field Monitoring. After each routine survey is completed, a copy of the survey record, maps, and data sheets will be forwarded to Near-Field Monitoring. These routine surveys will not be considered complete until this documentation is received. At the end of each month, the ERC and PHMC radiological control organizations shall forward a copy of the Routine

  15. Integrated Fractional Load and Packet Scheduling for OFDMA Systems

    DEFF Research Database (Denmark)

    Monghal, Guillaume Damien; Kumar, S.; Pedersen, Klaus I.

    2009-01-01

    This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic....... This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality...

  16. Multi-objective group scheduling optimization integrated with preventive maintenance

    Science.gov (United States)

    Liao, Wenzhu; Zhang, Xiufang; Jiang, Min

    2017-11-01

    This article proposes a single-machine-based integration model to meet the requirements of production scheduling and preventive maintenance in group production. To describe the production for identical/similar and different jobs, this integrated model considers the learning and forgetting effects. Based on machine degradation, the deterioration effect is also considered. Moreover, perfect maintenance and minimal repair are adopted in this integrated model. The multi-objective of minimizing total completion time and maintenance cost is taken to meet the dual requirements of delivery date and cost. Finally, a genetic algorithm is developed to solve this optimization model, and the computation results demonstrate that this integrated model is effective and reliable.

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

    Science.gov (United States)

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

    2016-08-01

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

  18. Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals

    Directory of Open Access Journals (Sweden)

    Michael Short

    2017-07-01

    Full Text Available Embedded systems consist of one or more processing units which are completely encapsulated by the devices under their control, and they often have stringent timing constraints associated with their functional specification. Previous research has considered the performance of different types of task scheduling algorithm and developed associated timing analysis techniques for such systems. Although preemptive scheduling techniques have traditionally been favored, rapid increases in processor speeds combined with improved insights into the behavior of non-preemptive scheduling techniques have seen an increased interest in their use for real-time applications such as multimedia, automation and control. However when non-preemptive scheduling techniques are employed there is a potential lack of error confinement should any timing errors occur in individual software tasks. In this paper, the focus is upon adding fault tolerance in systems using non-preemptive deadline-driven scheduling. Schedulability conditions are derived for fault-tolerant periodic and sporadic task sets experiencing bounded error arrivals under non-preemptive deadline scheduling. A timing analysis algorithm is presented based upon these conditions and its run-time properties are studied. Computational experiments show it to be highly efficient in terms of run-time complexity and competitive ratio when compared to previous approaches.

  19. Optimization of Multiperiod Mixed Train Schedule on High-Speed Railway

    Directory of Open Access Journals (Sweden)

    Wenliang Zhou

    2015-01-01

    Full Text Available For providing passengers with periodic operation trains and making trains’ time distribution better fit that of passengers, the multiperiod mixed train schedule is first proposed in this paper. It makes each type of train having same origin, destination, route, and stop stations operate based on a periodic basis and allows different types of train to have various operation periods. Then a model of optimizing multiperiod mixed train schedule is built to minimize passengers generalized travel costs with the constraints of trains of same type operating periodically, safe interval requirements of trains’ departure, and arrival times, and so forth. And its heuristic algorithm is designed to optimize the multiperiod mixed train schedule beginning with generating an initial solution by scheduling all types of train type by type and then repeatedly improving their periodic schedules until the objective value cannot be reduced or the iteration number reaches its maximum. Finally, example results illustrate that the proposed model and algorithm can effectively gain a better multiperiod mixed train schedule. However, its passengers deferred times and advanced times are a little higher than these of an aperiodic train schedule.

  20. A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

    Science.gov (United States)

    Xie, Zhiqiang; Shao, Xia; Xin, Yu

    2016-01-01

    To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

  1. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

    Purcell, W.J.; Martin, E.M.; Shivley, J.M.

    1982-01-01

    The construction schedule for the Clinch River Breeder Reactor Plant and its evolution are described. The initial schedule basis, changes necessitated by the evaluation of the overall plant design, and constructability improvements that have been effected to assure adherence to the schedule are presented. The schedule structure and hierarchy are discussed, as are tools used to define, develop, and evaluate the schedule

  2. Planning and scheduling for petroleum refineries using mathematical programming

    Directory of Open Access Journals (Sweden)

    Joly M.

    2002-01-01

    Full Text Available The objective of this paper is the development and solution of nonlinear and mixed-integer (MIP optimization models for real-world planning and scheduling problems in petroleum refineries. Firstly, we present a nonlinear planning model that represents a general refinery topology and allows implementation of nonlinear process models as well as blending relations. The optimization model is able to define new operating points, thus increasing the production of the more valuable products and simultaneously satisfying all specification constraints. The second part addresses scheduling problems in oil refineries, which are formulated as MIP optimization models and rely on both continuous and discrete time representations. Three practical applications closely related to the current refinery scenario are presented. The first one addresses the problem of crude oil inventory management of a refinery that receives several types of crude oil delivered exclusively by a single oil pipeline. Subsequently, two optimization models intended to define the optimal production policy, inventory control and distribution are proposed and solved for the fuel oil and asphalt plant. Finally, the planning model of Moro et al. (1998 is extended in order to sequence decisions at the scheduling level in the liquefied petroleum gas (LPG area for maximization of the production of petrochemical-grade propane and product delivery.

  3. Sort-Mid tasks scheduling algorithm in grid computing

    Directory of Open Access Journals (Sweden)

    Naglaa M. Reda

    2015-11-01

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

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

    Science.gov (United States)

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

    2015-11-01

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

  5. Illicit online marketing of lorcaserin before DEA scheduling.

    Science.gov (United States)

    Liang, Bryan A; Mackey, Tim K; Archer-Hayes, Ashley N; Shinn, Linda M

    2013-05-01

    Antiobesity drugs have been marketed illicitly by "no prescription" online pharmacies after approval and scheduling by the drug enforcement agency. We assess whether antiobesity drug Belviq® (lorcaserin HCl) was available from illicit online vendors before DEA-scheduling when sales are unauthorized. Online searches of "buy Belviq no prescription" examining first five result pages marketing the drug. Searches were performed from 11/5/2012-12/8/2012, prior to DEA scheduing. Belviq® is actively marketed by "no prescription" online vendors despite official unavailability and prescription requirements. Approaches included direct-to-consumer advertising using descriptive website URLs; linking to illicit marketers; and directing customers to other weight-loss websites for additional marketing. Finally, large quantities were marketed by business-to-business vendors. Illicit online "no prescription" pharmacies are marketing unauthorized, suspect antiobesity drugs before DEA scheduling and permitted marketing. Regulators must legally intercede to ensure patient safety, and providers must educate patients about online-sourcing risks. Copyright © 2013 The Obesity Society.

  6. Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

    Directory of Open Access Journals (Sweden)

    Maocai Wang

    2014-01-01

    Full Text Available Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

  7. Gain Scheduling for the Orion Launch Abort Vehicle Controller

    Science.gov (United States)

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

    2011-01-01

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

  8. Schedule-Aware Workflow Management Systems

    Science.gov (United States)

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

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

  9. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

    MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

  10. Scheduling nurses’ shifts at PGI Cikini Hospital

    Science.gov (United States)

    Nainggolan, J. C. T.; Kusumastuti, R. D.

    2018-03-01

    Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.

  11. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

    Morgan, D.L.; Srite, B.E.

    1986-01-01

    1 - Description of problem or function: PROMSYS is a computer system designed to automate the scheduling of routine maintenance and inspection of plant equipment. This 'programmed maintenance' provides the detailed planning and accomplishment of lubrication, inspection, and similar repetitive maintenance activities which can be scheduled at specified predetermined intervals throughout the year. The equipment items included are the typical pumps, blowers, motors, compressors, automotive equipment, refrigeration units, filtering systems, machine shop equipment, cranes, elevators, motor-generator sets, and electrical switchgear found throughout industry, as well as cell ventilation, shielding, containment, and material handling equipment unique to nuclear research and development facilities. Four related programs are used to produce sorted schedule lists, delinquent work lists, and optional master lists. Five additional programs are used to create and maintain records of all scheduled and unscheduled maintenance history. 2 - Method of solution: Service specifications and frequency are established and stored. The computer program reviews schedules weekly and prints, on schedule cards, instructions for service that is due the following week. The basic output from the computer program comes in two forms: programmed-maintenance schedule cards and programmed-maintenance data sheets. The data sheets can be issued in numerical building, route, and location number sequence as equipment lists, grouped for work assigned to a particular foreman as the foreman's equipment list, or grouped by work charged to a particular work order as the work-order list. Data sheets grouped by equipment classification are called the equipment classification list

  12. Behavioral effects of microwave reinforcement schedules and variations in microwave intensity on albino rats

    Energy Technology Data Exchange (ETDEWEB)

    Vitulli, W.F.; Lambert, J.K.; Brown, S.W.; Quinn, J.M.

    1987-12-01

    The objective of this exploratory investigation was to determine the interactive effects of fixed-ratio scheduling of microwave reinforcement in tandem with changes in microwave intensity. Nine albino rats were conditioned to regulate their thermal environment with microwave radiation while living in a Skinner (operant conditioning) Box in which the ambient temperature was about 27.13 degrees F at the beginning of the session. Each rat obtained a 6-sec. exposure of microwave radiation on a fixed-ratio schedule of MW reinforcement, the values of which varied from FR-1 to FR-30. Intensities of MW radiation were 62.5 W, 125 W, 250 W, and 437.5 W. Sessions lasted for 8 to 9 hr. over an approximate 13-mo. period. The effects of the intensity of microwave reinforcement varied as a function of the ratio value of the schedule used. Continuous reinforcement (FR-1) produced the lowest over-all rates, whereas FR-15, and FR-25 produced the highest over-all rates. Relatively higher thermal-behavior rates occurred under 62.5 W than under any of the other MW intensities for FR-1, FR-15, and FR-25, whereas FR-10 and FR-30 ratios produced intermediate rates of thermal responding which were constant for all values of MW intensity. These data are explained in terms of interactive effects between the local satiation or deprivation properties of the MW intensity and the ratio requirements of the schedule of MW reinforcement.

  13. Robust optimization for load scheduling of a smart home with photovoltaic system

    International Nuclear Information System (INIS)

    Wang, Chengshan; Zhou, Yue; Jiao, Bingqi; Wang, Yamin; Liu, Wenjian; Wang, Dan

    2015-01-01

    Highlights: • Robust household load scheduling is presented for smart homes with PV system. • A robust counterpart is formulated to deal with PV output uncertainty. • The robust counterpart is finally transformed to a quadratic programming problem. • Load schedules with different robustness can be made by the proposed method. • Feed-in tariff and PV output would affect the significance of the proposed method. - Abstract: In this paper, a robust approach is developed to tackle the uncertainty of PV power output for load scheduling of smart homes integrated with household PV system. Specifically, a robust formulation is proposed and further transformed to an equivalent quadratic programming problem. Day-ahead load schedules with different robustness can be generated by solving the proposed robust formulation with different predefined parameters. The validity and advantage of the proposed approach has been verified by simulation results. Also, the effects of feed-in tariff and PV output have been evaluated

  14. Human Performance-Aware Scheduling and Routing of a Multi-Skilled Workforce

    Directory of Open Access Journals (Sweden)

    Maikel L. van Eck

    2017-10-01

    Full Text Available Planning human activities within business processes often happens based on the same methods and algorithms as are used in the area of manufacturing systems. However, human behaviour is quite different from machine behaviour. Their performance depends on a number of factors, including workload, stress, personal preferences, etc. In this article we describe an approach for scheduling activities of people that takes into account business rules and dynamic human performance in order to optimise the schedule. We formally describe the scheduling problem we address and discuss how it can be constructed from inputs in the form of business process models and performance measurements. Finally, we discuss and evaluate an implementation for our planning approach to show the impact of considering dynamic human performance in scheduling.

  15. Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

    Directory of Open Access Journals (Sweden)

    Wenming Cheng

    2012-01-01

    Full Text Available In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

  16. Bridging the Gap Between Planning and Scheduling

    Science.gov (United States)

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

    2000-01-01

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

  17. The rectilinear Steiner ratio

    Directory of Open Access Journals (Sweden)

    PO de Wet

    2005-06-01

    Full Text Available The rectilinear Steiner ratio was shown to be 3/2 by Hwang [Hwang FK, 1976, On Steiner minimal trees with rectilinear distance, SIAM Journal on Applied Mathematics, 30, pp. 104– 114.]. We use continuity and introduce restricted point sets to obtain an alternative, short and self-contained proof of this result.

  18. Kubernetes as a batch scheduler

    OpenAIRE

    Souza, Clenimar; Brito Da Rocha, Ricardo

    2017-01-01

    This project aims at executing a CERN batch use case using Kubernetes, in order to figure out what are the advantages and disadvantages, as well as the functionality that can be replicated or is missing. The reference for the batch system is the CERN Batch System, which uses HTCondor. Another goal of this project is to evaluate the current status of federated resources in Kubernetes, in comparison to the single-cluster API resources. Finally, the last goal of this project is to implement buil...

  19. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Jarillo-Herrero, Pablo [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

    2017-02-07

    This is the final report of our research program on electronic transport experiments on Topological Insulator (TI) devices, funded by the DOE Office of Basic Energy Sciences. TI-based electronic devices are attractive as platforms for spintronic applications, and for detection of emergent properties such as Majorana excitations , electron-hole condensates , and the topological magneto-electric effect . Most theoretical proposals envision geometries consisting of a planar TI device integrated with materials of distinctly different physical phases (such as ferromagnets and superconductors). Experimental realization of physics tied to the surface states is a challenge due to the ubiquitous presence of bulk carriers in most TI compounds as well as degradation during device fabrication.

  20. From non-preemptive to preemptive scheduling using synchronization synthesis.

    Science.gov (United States)

    Černý, Pavol; Clarke, Edmund M; Henzinger, Thomas A; Radhakrishna, Arjun; Ryzhyk, Leonid; Samanta, Roopsha; Tarrach, Thorsten

    2017-01-01

    We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.

  1. Escalonamento cooperativo interorganizacional Cooperative inter-organizational scheduling

    Directory of Open Access Journals (Sweden)

    Ricardo J. Rabelo

    2000-12-01

    Full Text Available Este trabalho tem como objetivo essencial apresentar uma abordagem para uma ágil coordenação e supervisão das ordens de produção da empresa, dando uma nova dimensão à atividade de "escalonamento" (scheduling, não apenas numa perspectiva intra-organizacional, mas também interorganizacional, contemplando toda a cadeia produtiva. Apresenta os fundamentos de um protótipo sendo desenvolvido, baseado nos paradigmas de negociação multiagente e de sistemas de suporte à decisão. Aspectos relacionados com a modelagem e integração da informação requerida nos vários níveis do CIM são abordados. Ao final, uma série de considerações são feitas, quer em relação aos resultados atingidos com o protótipo atual, quer para com as várias dificuldades - e desafios - existentes para a realização de um escalonamento cooperativo interorganizacional.This work aims at presenting an approach for agile scheduling coordination and supervision of distributed production orders, giving rise to a new dimension of the scheduling activity, not only under the intra-organizational perspective, but also the inter-organizational, comprising the whole productive chain. It generally presents a prototype being developed, based on the paradigms of multi-agent negotiation and decision support systems. Aspects related with the information modeling and integration in the several levels of CIM are tackled. At the end, a series of considerations is made, pointing out the results reached with the current prototype, and the several difficulties - and challenges - existent for the accomplishment of cooperative inter-organizational scheduling.

  2. An optimal dynamic interval preventive maintenance scheduling for series systems

    International Nuclear Information System (INIS)

    Gao, Yicong; Feng, Yixiong; Zhang, Zixian; Tan, Jianrong

    2015-01-01

    This paper studies preventive maintenance (PM) with dynamic interval for a multi-component system. Instead of equal interval, the time of PM period in the proposed dynamic interval model is not a fixed constant, which varies from interval-down to interval-up. It is helpful to reduce the outage loss on frequent repair parts and avoid lack of maintenance of the equipment by controlling the equipment maintenance frequency, when compared to a periodic PM scheme. According to the definition of dynamic interval, the reliability of system is analyzed from the failure mechanisms of its components and the different effects of non-periodic PM actions on the reliability of the components. Following the proposed model of reliability, a novel framework for solving the non-periodical PM schedule with dynamic interval based on the multi-objective genetic algorithm is proposed. The framework denotes the strategies include updating strategy, deleting strategy, inserting strategy and moving strategy, which is set to correct the invalid population individuals of the algorithm. The values of the dynamic interval and the selections of PM action for the components on every PM stage are determined by achieving a certain level of system availability with the minimum total PM-related cost. Finally, a typical rotary table system of NC machine tool is used as an example to describe the proposed method. - Highlights: • A non-periodic preventive maintenance scheduling model is proposed. • A framework for solving the non-periodical PM schedule problem is developed. • The interval of non-periodic PM is flexible and schedule can be better adjusted. • Dynamic interval leads to more efficient solutions than fixed interval does

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

    Science.gov (United States)

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

    2009-04-01

    TEAM protocols with the logistical scheduling needs of each TEAM Site. For example, each TEAM protocol defines when data must be collected (e.g. time of day, number of times per year, during which seasons, etc) as well as where data must be collected (from which sampling units, which trees, etc). Each TEAM Site has a limited number of resources and must create plans that will both satisfy the requirements of the protocols as well as be logistically feasible for their TEAM Site. With 15 TEAM Sites (and many more coming soon) the schedules of each TEAM Site must be communicated to the Network Office to ensure data are being collected as scheduled and to address the many problems when working in difficult environments like Tropical Forests. The Sampling Schedule provides built-in proposal and approval functionality to ensure that the TEAM Sites are and the Network office are in sync as well as provides the capability to modify schedules when needed. The Data Management Framework The Data Management framework is a three-tier data ingestion, edit and review application for protocols defined in the TEAM network. The data ingestion framework provides online web forms for field personnel to submit and edit data collected at TEAM Sites. These web forms will be accessible from the TEAM content management site. Once the data is securely uploaded, cured, processed and approved, it will be made publicly available for consumption by the scientific community. The Data Management framework, when combined with the Sampling Scheduler provides a closed loop Data Scheduling and Management infrastructure. All information starting from data collection plan, tools to input, modify and curate data, review and run QA/QC tests, as well as verify data are collected as planed are included. Finally, TEAM Network data are available for download via the Data Query and Download Application. This application utilizes a Google Maps custom interface to search, visualize, and download TEAM Network data

  4. Efficient Load Scheduling Method For Power Management

    Directory of Open Access Journals (Sweden)

    Vijo M Joy

    2015-08-01

    Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.

  5. Quantify Risk to Manage Cost and Schedule

    National Research Council Canada - National Science Library

    Raymond, Fred

    1999-01-01

    Too many projects suffer from unachievable budget and schedule goals, caused by unrealistic estimates and the failure to quantify and communicate the uncertainty of these estimates to managers and sponsoring executives...

  6. Alternative Work Schedules Increase Employee Satisfaction.

    Science.gov (United States)

    Turney, John R.; Cohen, Stanley L.

    1983-01-01

    Facets of alternative work schedules (AWS) are discussed: importance of employee control, possible negative consequences, AWS handbook, time monitoring systems, and treatment of exceptions. AWS' effect on productivity and motivation is examined. (SK)

  7. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

    Alrifai, Mohammad; Balke, Wolf-Tilo; Dolog, Peter

    2007-01-01

    . In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service......For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...... schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others...

  8. Schedule Sales Query Report Generation System

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  9. Knowledge-based scheduling of arrival aircraft

    Science.gov (United States)

    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.

  10. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

  11. Congruent Validity of the Rathus Assertiveness Schedule.

    Science.gov (United States)

    Harris, Thomas L.; Brown, Nina W.

    1979-01-01

    The validity of the Rathus Assertiveness Schedule (RAS) was investigated by correlating it with the six Class I scales of the California Psychological Inventory on a sample of undergraduate students. Results supported the validity of the RAS. (JKS)

  12. Cure Schedule for Stycast 2651/Catalyst 11.

    Energy Technology Data Exchange (ETDEWEB)

    Kropka, Jamie Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); McCoy, John D. [New Mexico Inst. of Mining and Technology, Socorro, NM (United States)

    2017-11-01

    The Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, Tg, exceeding cure temperature).

  13. Job shop scheduling by local search

    NARCIS (Netherlands)

    Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

    1992-01-01

    We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

  14. Scheduling job shop - A case study

    Science.gov (United States)

    Abas, M.; Abbas, A.; Khan, W. A.

    2016-08-01

    The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.

  15. Job scheduling in a heterogenous grid environment

    Energy Technology Data Exchange (ETDEWEB)

    Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

    2004-02-11

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

  16. The School Schedule--Servant or Mistress?

    Science.gov (United States)

    Holmes, Mark

    1984-01-01

    Pointing out that time is a dimension of school wealth, the author explores its use in school schedules. Administrators need to be aware of the relationship between time allocation and learning consequences. (MD)

  17. Economic and psychological burden of scheduled surgery ...

    African Journals Online (AJOL)

    Background: Cancellation of scheduled surgery creates a financial burden for hospitals, caregivers and ..... costs and disregard some of the aspects mentioned in the ..... cancellation of elective surgical procedures in a Spanish general.

  18. Onboard Autonomous Scheduling Intelligence System, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Scheduling the daily activities of the crew on a human space mission is currently a cumbersome job performed by a large team of operations experts on the ground....

  19. Home Appliance Load Scheduling with SEMIAH

    DEFF Research Database (Denmark)

    Jacobsen, Rune Hylsberg; Ghasem Azar, Armin; Zhang, Qi

    2015-01-01

    The European research project SEMIAH aims at designing a scalable infrastructure for residential demand response. This paper presents the progress towards a centralized load scheduling algorithm for controlling home appliances taking power grid constraints and satisfaction of consumers into account....

  20. 76 FR 18262 - January 2011 Pay Schedules

    Science.gov (United States)

    2011-04-01

    ... an OPM memorandum, CPM 2009-27. (See http://www.opm.gov/oca/compmemo/index.asp .) Executive Order... Schedule ($165,300 in 2011, the same level as in 2010). On December 27, 2010, OPM issued a memorandum (CPM...

  1. Heuristic Approach for Balancing Shift Schedules

    International Nuclear Information System (INIS)

    Kim, Dae Ho; Yun, Young Su; Lee, Yong Hee

    2005-01-01

    In this paper, a heuristic approach for balancing shift schedules is proposed. For the shift schedules, various constraints which have usually been considered in realworld industry are used, and the objective is to minimize the differences of the workloads in each workgroup. The constraints and objective function are implemented in the proposed heuristic approach. Using a simple instance, the efficiency of the proposed heuristic approach is proved

  2. Algorithms for classical and modern scheduling problems

    OpenAIRE

    Ott, Sebastian

    2016-01-01

    Subject of this thesis is the design and the analysis of algorithms for scheduling problems. In the first part, we focus on energy-efficient scheduling, where one seeks to minimize the energy needed for processing certain jobs via dynamic adjustments of the processing speed (speed scaling). We consider variations and extensions of the standard model introduced by Yao, Demers, and Shenker in 1995 [79], including the addition of a sleep state, the avoidance of preemption, and variable speed lim...

  3. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

    This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit

  4. Lift scheduling organization : Lift Concept for Lemminkainen

    OpenAIRE

    Mingalimov, Iurii

    2015-01-01

    The purpose of the work was to make a simple schedule for the main contractors and clients to check and control workflow connected with lifts. It gathers works with electricity, construction, engineering networks, installing equipment and commissioning works. The schedule was carried out during working on the building site Aino in Saint Petersburg in Lemminkӓinen. The duration of work was 5 months. The lift concept in Lemminkӓinen is very well controlled in comparison with other buil...

  5. Job schedul in Grid batch farms

    International Nuclear Information System (INIS)

    Gellrich, Andreas

    2014-01-01

    We present here a study for a scheduler which cooperates with the queueing system TORQUE and is tailored to the needs of a HEP-dominated large Grid site with around 10000 jobs slots. Triggered by severe scaling problems of MAUI, a scheduler, referred to as MYSCHED, was developed and put into operation. We discuss conceptional aspects as well as experiences after almost two years of running.

  6. Transformer ratio enhancement experiment

    International Nuclear Information System (INIS)

    Gai, W.; Power, J. G.; Kanareykin, A.; Neasheva, E.; Altmark, A.

    2004-01-01

    Recently, a multibunch scheme for efficient acceleration based on dielectric wakefield accelerator technology was outlined in J.G. Power, W. Gai, A. Kanareykin, X. Sun. PAC 2001 Proceedings, pp. 114-116, 2002. In this paper we present an experimental program for the design, development and demonstration of an Enhanced Transformer Ratio Dielectric Wakefield Accelerator (ETR-DWA). The principal goal is to increase the transformer ratio R, the parameter that characterizes the energy transfer efficiency from the accelerating structure to the accelerated electron beam. We present here an experimental design of a 13.625 GHz dielectric loaded accelerating structure, a laser multisplitter producing a ramped bunch train, and simulations of the bunch train parameters required. Experimental results of the accelerating structure bench testing and ramped pulsed train generation with the laser multisplitter are shown as well. Using beam dynamic simulations, we also obtain the focusing FODO lattice parameters

  7. Intake to Production Ratio

    DEFF Research Database (Denmark)

    Nazaroff, William; Weschler, Charles J.; Little, John C.

    2012-01-01

    BACKGROUND: Limited data are available to assess human exposure to thousands of chemicals currently in commerce. Information that relates human intake of a chemical to its production and use can help inform understanding of mechanisms and pathways that control exposure and support efforts...... to protect public health.OBJECTIVES: We introduce the intake-to-production ratio (IPR) as an economy-wide quantitative indicator of the extent to which chemical production results in human exposure.METHODS: The IPR was evaluated as the ratio of two terms: aggregate rate of chemical uptake in a human......(n-butyl) phthalate, 1,040 ppm for para-dichlorobenzene, 6,800 ppm for di(isobutyl) phthalate, 7,700 ppm for diethyl phthalate, and 8,000-24,000 ppm (range) for triclosan.CONCLUSION: The IPR is well suited as an aggregate metric of exposure intensity for characterizing population-level exposure to synthesized...

  8. Prescribed Travel Schedules for Fatigue Management

    Science.gov (United States)

    Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

    2011-01-01

    The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

  9. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resou...... indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc.......We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...

  10. Staffing, overtime, and shift scheduling project

    International Nuclear Information System (INIS)

    Lewis, P.M.

    1989-01-01

    Recent events at the Peach Bottom nuclear power plant have demonstrated the need to establish a quantifiable basis for assessing the safety significance of long work hours on nuclear power plant operators. The incidents at TMI-2, Chernobyl, and Bhopal, which all occurred during the late evening/night shift, further highlight the importance of the relationship between shift scheduling and performance. The objective of this project is to estimate, using statistical analysis on data from the nuclear industry, the effects on safety of staffing levels, overtime, and shift scheduling for operators and maintenance personnel. Regarding staffing levels, the Nuclear Regulatory Commission (NRC) currently has no explicit regulation concerning the minimum acceptable levels of staffing in a plant that has an operating license. The NRC has no systematic method for collecting data on the number of licensed operators on the operating crews. In 1982 the NRC recommended that plants write into their technical specifications a model policy on overtime. Currently, 77 nuclear power plant units have the model policy or a modification of it written into their technical specifications; 33 units have no policy on overtime. The model policy sets limits on overtime for safety related personnel, although these limits can be exceeded with plant manger approval. The US nuclear power industry has three types of shift schedules: (1) forward-rotating 8-hour/day shift schedules, (2) backward-rotating 8-hour/day schedules, and (3) 12-hour/day schedules

  11. Interactive Dynamic Mission Scheduling for ASCA

    Science.gov (United States)

    Antunes, A.; Nagase, F.; Isobe, T.

    The Japanese X-ray astronomy satellite ASCA (Advanced Satellite for Cosmology and Astrophysics) mission requires scheduling for each 6-month observation phase, further broken down into weekly schedules at a few minutes resolution. Two tools, SPIKE and NEEDLE, written in Lisp and C, use artificial intelligence (AI) techniques combined with a graphic user interface for fast creation and alteration of mission schedules. These programs consider viewing and satellite attitude constraints as well as observer-requested criteria and present an optimized set of solutions for review by the planner. Six-month schedules at 1 day resolution are created for an oversubscribed set of targets by the SPIKE software, originally written for HST and presently being adapted for EUVE, XTE and AXAF. The NEEDLE code creates weekly schedules at 1 min resolution using in-house orbital routines and creates output for processing by the command generation software. Schedule creation on both the long- and short-term scale is rapid, less than 1 day for long-term, and one hour for short-term.

  12. Self-scheduling with Microsoft Excel.

    Science.gov (United States)

    Irvin, S A; Brown, H N

    1999-01-01

    Excessive time was being spent by the emergency department (ED) staff, head nurse, and unit secretary on a complex 6-week manual self-scheduling system. This issue, plus inevitable errors and staff dissatisfaction, resulted in a manager-lead initiative to automate elements of the scheduling process using Microsoft Excel. The implementation of this initiative included: common coding of all 8-hour and 12-hour shifts, with each 4-hour period represented by a cell; the creation of a 6-week master schedule using the "count-if" function of Excel based on current staffing guidelines; staff time-off requests then entered by the department secretary; the head nurse, with staff input, then fine-tuned the schedule to provide even unit coverage. Outcomes of these changes included an increase in staff satisfaction, time saved by the head nurse, and staff work time saved because there was less arguing about the schedule. Ultimately, the automated self-scheduling method was expanded to the entire 700-bed hospital.

  13. Final Report

    Energy Technology Data Exchange (ETDEWEB)

    Webb, Robert C. [Texas A& M University; Kamon, Teruki [Texas A& M University; Toback, David [Texas A& M University; Safonov, Alexei [Texas A& M University; Dutta, Bhaskar [Texas A& M University; Dimitri, Nanopoulos [Texas A& M University; Pope, Christopher [Texas A& M University; White, James [Texas A& M University

    2013-11-18

    Overview The High Energy Physics Group at Texas A&M University is submitting this final report for our grant number DE-FG02-95ER40917. This grant has supported our wide range of research activities for over a decade. The reports contained here summarize the latest work done by our research team. Task A (Collider Physics Program): CMS & CDF Profs. T. Kamon, A. Safonov, and D. Toback co-lead the Texas A&M (TAMU) collider program focusing on CDF and CMS experiments. Task D: Particle Physics Theory Our particle physics theory task is the combined effort of Profs. B. Dutta, D. Nanopoulos, and C. Pope. Task E (Underground Physics): LUX & NEXT Profs. R. Webb and J. White(deceased) lead the Xenon-based underground research program consisting of two main thrusts: the first, participation in the LUX two-phase xenon dark matter search experiment and the second, detector R&D primarily aimed at developing future detectors for underground physics (e.g. NEXT and LZ).

  14. Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains

    KAUST Repository

    Hossain, Md Jahangir; Alouini, Mohamed-Slim; Bhargava, Vijay K.

    2010-01-01

    -user opportunistic scheduling (HTS) scheme based on our earlier proposed TBS scheme. This HTS scheme selects the first user based on the largest absolute CNR value among all the users while the second user is selected based on the ratios of the absolute CNRs

  15. The impact of sex ratio and economic status on local birth rates

    OpenAIRE

    Chipman, A.; Morrison, E.

    2013-01-01

    Human mating and reproductive behaviour can vary depending on various mechanisms, including the local sex ratio. Previous research shows that as sex ratios become female-biased, women from economically deprived areas are less likely to delay reproductive opportunities to wait for a high-investing mate but instead begin their reproductive careers sooner. Here, we show that the local sex ratio also has an impact on female fertility schedules. At young ages, a female-biased ratio is associated w...

  16. Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns

    Science.gov (United States)

    Majerowicz, Walt; Shinn, Stephen A.

    2016-01-01

    This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.

  17. Integrating Preventive Maintenance Scheduling As Probability Machine Failure And Batch Production Scheduling

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-06-01

    Full Text Available This paper discusses integrated model of batch production scheduling and machine maintenance scheduling. Batch production scheduling uses minimize total actual flow time criteria and machine maintenance scheduling uses the probability of machine failure based on Weibull distribution. The model assumed no nonconforming parts in a planning horizon. The model shows an increase in the number of the batch (length of production run up to a certain limit will minimize the total actual flow time. Meanwhile, an increase in the length of production run will implicate an increase in the number of PM. An example was given to show how the model and algorithm work.

  18. 21 CFR 1314.155 - Suspension pending final order.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Suspension pending final order. 1314.155 Section 1314.155 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE RETAIL SALE OF SCHEDULED LISTED CHEMICAL PRODUCTS Order to Show Cause § 1314.155 Suspension pending final order. (a) The...

  19. The Reference Return Ratio

    DEFF Research Database (Denmark)

    Nicolaisen, Jeppe; Faber Frandsen, Tove

    2008-01-01

    The paper introduces a new journal impact measure called The Reference Return Ratio (3R). Unlike the traditional Journal Impact Factor (JIF), which is based on calculations of publications and citations, the new measure is based on calculations of bibliographic investments (references) and returns...... (citations). A comparative study of the two measures shows a strong relationship between the 3R and the JIF. Yet, the 3R appears to correct for citation habits, citation dynamics, and composition of document types - problems that typically are raised against the JIF. In addition, contrary to traditional...

  20. FINAL REPORT

    Energy Technology Data Exchange (ETDEWEB)

    PETER, GARY F. [UNIVERSITY OF FLORIDA

    2014-07-16

    Excellent progress was made in standardizing three complementary methods: Magnetic resonance imaging, x-ray micro CT, and MALDI imaging linear ion trap mass spectroscopy to image biomass and chemical, anatomical and functional changes that occur during pretreatment and hydrolysis. Magnetic resonance microscopy provides excellent images with as low as 5 uM resolution with hydrated biomass samples. We visualized dramatic changes in signal associated with the hydrolysis of the carbohydrates by strong acids. Quantitative diffusion approaches were used to probe more subtle structural changes in biomass. Diffusion tensor calculations reflect diffusion anisotropy and fractional anisotropy maps clearly show the longer range diffusion within the vessels compared to within the fiber cells. The diffusion is increased along the cell walls of the vessels. Suggesting that further research with NMR imaging should be pursued. X-ray CT provides excellent images at as low as 3.5 uM resolution from dried biomass. Small increases in surface area, and decreases in local density have been quantified in with wood after mild pretreatments; these changes are expected to be underestimates of the hydrated wood, due to the ~12% shrinkage that occurs upon drying untreated wood. MALDI-MS spectra show high ion intensities at most mass to charge ratios in untreated and pretreated woody material. MALDI-MSn is required to improve specificity and reduce background for imaging. MALDI-TOF is not specific enough for carbohydrate identification. Using MALDI-LIT/MSn we can readily identify oligomeric glucans and xylans and their fragmentation patterns as well as those of the glucuronic acid side chains of birch 4-O-methyl glucuronxylan. Imaging of glucan and xylan oligomers show that many contain isobaric ions with different distributions, indicating again that MSn is needed for accurate imaging of lignocellulosic materials. We are now starting to integrate the three imaging methods by using the same set

  1. Tau hadronic branching ratios

    CERN Document Server

    Buskulic, Damir; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Lees, J P; Lucotte, A; Minard, M N; Odier, P; Pietrzyk, B; Ariztizabal, F; Chmeissani, M; Crespo, J M; Efthymiopoulos, I; Fernández, E; Fernández-Bosman, M; Gaitan, V; Martínez, M; Orteu, S; Pacheco, A; Padilla, C; Palla, Fabrizio; Pascual, A; Perlas, J A; Sánchez, F; Teubert, F; Colaleo, A; Creanza, D; De Palma, M; Farilla, A; Gelao, G; Girone, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Marinelli, N; Natali, S; Nuzzo, S; Ranieri, A; Raso, G; Romano, F; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Bonvicini, G; Cattaneo, M; Comas, P; Coyle, P; Drevermann, H; Engelhardt, A; Forty, Roger W; Frank, M; Hagelberg, R; Harvey, J; Jacobsen, R; Janot, P; Jost, B; Kneringer, E; Knobloch, J; Lehraus, Ivan; Markou, C; Martin, E B; Mato, P; Minten, Adolf G; Miquel, R; Oest, T; Palazzi, P; Pater, J R; Pusztaszeri, J F; Ranjard, F; Rensing, P E; Rolandi, Luigi; Schlatter, W D; Schmelling, M; Schneider, O; Tejessy, W; Tomalin, I R; Venturi, A; Wachsmuth, H W; Wiedenmann, W; Wildish, T; Witzeling, W; Wotschack, J; Ajaltouni, Ziad J; Bardadin-Otwinowska, Maria; Barrès, A; Boyer, C; Falvard, A; Gay, P; Guicheney, C; Henrard, P; Jousset, J; Michel, B; Monteil, S; Pallin, D; Perret, P; Podlyski, F; Proriol, J; Rossignol, J M; Saadi, F; Fearnley, Tom; Hansen, J B; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Kyriakis, A; Simopoulou, Errietta; Siotis, I; Vayaki, Anna; Zachariadou, K; Blondel, A; Bonneaud, G R; Brient, J C; Bourdon, P; Passalacqua, L; Rougé, A; Rumpf, M; Tanaka, R; Valassi, Andrea; Verderi, M; Videau, H L; Candlin, D J; Parsons, M I; Focardi, E; Parrini, G; Corden, M; Delfino, M C; Georgiopoulos, C H; Jaffe, D E; Antonelli, A; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Felici, G; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Pepé-Altarelli, M; Dorris, S J; Halley, A W; ten Have, I; Knowles, I G; Lynch, J G; Morton, W T; O'Shea, V; Raine, C; Reeves, P; Scarr, J M; Smith, K; Smith, M G; Thompson, A S; Thomson, F; Thorn, S; Turnbull, R M; Becker, U; Braun, O; Geweniger, C; Graefe, G; Hanke, P; Hepp, V; Kluge, E E; Putzer, A; Rensch, B; Schmidt, M; Sommer, J; Stenzel, H; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Colling, D J; Dornan, Peter J; Konstantinidis, N P; Moneta, L; Moutoussi, A; Nash, J; San Martin, G; Sedgbeer, J K; Stacey, A M; Dissertori, G; Girtler, P; Kuhn, D; Rudolph, G; Bowdery, C K; Brodbeck, T J; Colrain, P; Crawford, G; Finch, A J; Foster, F; Hughes, G; Sloan, Terence; Whelan, E P; Williams, M I; Galla, A; Greene, A M; Kleinknecht, K; Quast, G; Raab, J; Renk, B; Sander, H G; Wanke, R; Van Gemmeren, P; Zeitnitz, C; Aubert, Jean-Jacques; Bencheikh, A M; Benchouk, C; Bonissent, A; Bujosa, G; Calvet, D; Carr, J; Diaconu, C A; Etienne, F; Thulasidas, M; Nicod, D; Payre, P; Rousseau, D; Talby, M; Abt, I; Assmann, R W; Bauer, C; Blum, Walter; Brown, D; Dietl, H; Dydak, Friedrich; Ganis, G; Gotzhein, C; Jakobs, K; Kroha, H; Lütjens, G; Lutz, Gerhard; Männer, W; Moser, H G; Richter, R H; Rosado-Schlosser, A; Schael, S; Settles, Ronald; Seywerd, H C J; Saint-Denis, R; Wolf, G; Alemany, R; Boucrot, J; Callot, O; Cordier, A; Courault, F; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacquet, M; Kim, D W; Le Diberder, F R; Lefrançois, J; Lutz, A M; Musolino, G; Nikolic, I A; Park, H J; Park, I C; Schune, M H; Simion, S; Veillet, J J; Videau, I; Abbaneo, D; Azzurri, P; Bagliesi, G; Batignani, G; Bettarini, S; Bozzi, C; Calderini, G; Carpinelli, M; Ciocci, M A; Ciulli, V; Dell'Orso, R; Fantechi, R; Ferrante, I; Foà, L; Forti, F; Giassi, A; Giorgi, M A; Gregorio, A; Ligabue, F; Lusiani, A; Marrocchesi, P S; Messineo, A; Rizzo, G; Sanguinetti, G; Sciabà, A; Spagnolo, P; Steinberger, Jack; Tenchini, Roberto; Tonelli, G; Triggiani, G; Vannini, C; Verdini, P G; Walsh, J; Betteridge, A P; Blair, G A; Bryant, L M; Cerutti, F; Gao, Y; Green, M G; Johnson, D L; Medcalf, T; Mir, L M; Perrodo, P; Strong, J A; Bertin, V; Botterill, David R; Clifft, R W; Edgecock, T R; Haywood, S; Edwards, M; Maley, P; Norton, P R; Thompson, J C; Bloch-Devaux, B; Colas, P; Emery, S; Kozanecki, Witold; Lançon, E; Lemaire, M C; Locci, E; Marx, B; Pérez, P; Rander, J; Renardy, J F; Roussarie, A; Schuller, J P; Schwindling, J; Trabelsi, A; Vallage, B; Johnson, R P; Kim, H Y; Litke, A M; McNeil, M A; Taylor, G; Beddall, A; Booth, C N; Boswell, R; Cartwright, S L; Combley, F; Dawson, I; Köksal, A; Letho, M; Newton, W M; Rankin, C; Thompson, L F; Böhrer, A; Brandt, S; Cowan, G D; Feigl, E; Grupen, Claus; Lutters, G; Minguet-Rodríguez, J A; Rivera, F; Saraiva, P; Smolik, L; Stephan, F; Apollonio, M; Bosisio, L; Della Marina, R; Giannini, G; Gobbo, B; Ragusa, F; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Bellantoni, L; Elmer, P; Feng, Z; Ferguson, D P S; Gao, Y S; González, S; Grahl, J; Harton, J L; Hayes, O J; Hu, H; McNamara, P A; Nachtman, J M; Orejudos, W; Pan, Y B; Saadi, Y; Schmitt, M; Scott, I J; Sharma, V; Turk, J; Walsh, A M; Wu Sau Lan; Wu, X; Yamartino, J M; Zheng, M; Zobernig, G

    1996-01-01

    From 64492 selected \\tau-pair events, produced at the Z^0 resonance, the measurement of the tau decays into hadrons from a global analysis using 1991, 1992 and 1993 ALEPH data is presented. Special emphasis is given to the reconstruction of photons and \\pi^0's, and the removal of fake photons. A detailed study of the systematics entering the \\pi^0 reconstruction is also given. A complete and consistent set of tau hadronic branching ratios is presented for 18 exclusive modes. Most measurements are more precise than the present world average. The new level of precision reached allows a stringent test of \\tau-\\mu universality in hadronic decays, g_\\tau/g_\\mu \\ = \\ 1.0013 \\ \\pm \\ 0.0095, and the first measurement of the vector and axial-vector contributions to the non-strange hadronic \\tau decay width: R_{\\tau ,V} \\ = \\ 1.788 \\ \\pm \\ 0.025 and R_{\\tau ,A} \\ = \\ 1.694 \\ \\pm \\ 0.027. The ratio (R_{\\tau ,V} - R_{\\tau ,A}) / (R_{\\tau ,V} + R_{\\tau ,A}), equal to (2.7 \\pm 1.3) \\ \\%, is a measure of the importance of Q...

  2. Short term economic emission power scheduling of hydrothermal energy systems using improved water cycle algorithm

    International Nuclear Information System (INIS)

    Haroon, S.S.; Malik, T.N.

    2017-01-01

    Due to the increasing environmental concerns, the demand of clean and green energy and concern of atmospheric pollution is increasing. Hence, the power utilities are forced to limit their emissions within the prescribed limits. Therefore, the minimization of fuel cost as well as exhaust gas emissions is becoming an important and challenging task in the short-term scheduling of hydro-thermal energy systems. This paper proposes a novel algorithm known as WCA-ER (Water Cycle Algorithm with Evaporation Rate) to inspect the short term EEPSHES (Economic Emission Power Scheduling of Hydrothermal Energy Systems). WCA has its ancestries from the natural hydrologic cycle i.e. the raining process forms streams and these streams start flowing towards the rivers which finally flow towards the sea. The worth of WCA-ER has been tested on the standard economic emission power scheduling of hydrothermal energy test system consisting of four hydropower and three thermal plants. The problem has been investigated for the three case studies (i) ECS (Economic Cost Scheduling), (ii) ES (Economic Emission Scheduling) and (iii) ECES (Economic Cost and Emission Scheduling). The results obtained show that WCA-ER is superior to many other methods in the literature in bringing lower fuel cost and emissions. (author)

  3. Intelligent scheduling of execution for customized physical fitness and healthcare system.

    Science.gov (United States)

    Huang, Chung-Chi; Liu, Hsiao-Man; Huang, Chung-Lin

    2015-01-01

    Physical fitness and health of white collar business person is getting worse and worse in recent years. Therefore, it is necessary to develop a system which can enhance physical fitness and health for people. Although the exercise prescription can be generated after diagnosing for customized physical fitness and healthcare. It is hard to meet individual execution needs for general scheduling of physical fitness and healthcare system. So the main purpose of this research is to develop an intelligent scheduling of execution for customized physical fitness and healthcare system. The results of diagnosis and prescription for customized physical fitness and healthcare system will be generated by fuzzy logic Inference. Then the results of diagnosis and prescription for customized physical fitness and healthcare system will be scheduled and executed by intelligent computing. The scheduling of execution is generated by using genetic algorithm method. It will improve traditional scheduling of exercise prescription for physical fitness and healthcare. Finally, we will demonstrate the advantages of the intelligent scheduling of execution for customized physical fitness and healthcare system.

  4. Medicare program; revisions to payment policies under the Physician Fee Schedule, and other part B payment policies for CY 2008; delay of the date of applicability of the revised anti-markup provisions for certain services furnished in certain locations (Sec. 414.50). Final rule.

    Science.gov (United States)

    2008-01-03

    This final rule delays until January 1, 2009 the applicability of the anti-markup provisions in Sec. 414.50, as revised at 72 FR 66222, except with respect to the technical component of a purchased diagnostic test and with respect to any anatomic pathology diagnostic testing services furnished in space that: Is utilized by a physician group practice as a "centralized building" (as defined at Sec. 411.351 of this chapter) for purposes of complying with the physician self-referral rules; and does not qualify as a "same building" under Sec. 411.355(b)(2)(i) of this chapter.

  5. Multi-objective demand side scheduling considering the operational safety of appliances

    International Nuclear Information System (INIS)

    Du, Y.F.; Jiang, L.; Li, Y.Z.; Counsell, J.; Smith, J.S.

    2016-01-01

    Highlights: • Operational safety of appliances is introduced in multi-objective scheduling. • Relationships between operational safety and other objectives are investigated. • Adopted Pareto approach is compared with Weigh and Constraint approaches. • Decision making of Pareto approach is proposed for final appliances’ scheduling. - Abstract: The safe operation of appliances is of great concern to users. The safety risk increases when the appliances are in operation during periods when users are not at home or when they are asleep. In this paper, multi-objective demand side scheduling is investigated with consideration to the appliances’ operational safety together with the electricity cost and the operational delay. The formulation of appliances’ operational safety is proposed based on users’ at-home status and awake status. Then the relationships between the operational safety and the other two objectives are investigated through the approach of finding the Pareto-optimal front. Moreover, this approach is compared with the Weigh and Constraint approaches. As the Pareto-optimal front consists of a set of optimal solutions, this paper proposes a method to make the final scheduling decision based on the relationships among the multiple objectives. Simulation results demonstrate that the operational safety is improved with the sacrifice of the electricity cost and the operational delay, and that the approach of finding the Pareto-optimal front is effective in presenting comprehensive optimal solutions of the multi-objective demand side scheduling.

  6. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

    Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory

  7. Interoceanic canal excavation scheduling via computer simulation

    Energy Technology Data Exchange (ETDEWEB)

    Baldonado, Orlino C [Holmes and Narver, Inc., Los Angeles, CA (United States)

    1970-05-15

    The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

  8. Integrated network design and scheduling problems :

    Energy Technology Data Exchange (ETDEWEB)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  9. Maternal Nonstandard Work Schedules and Breastfeeding Behaviors.

    Science.gov (United States)

    Zilanawala, Afshin

    2017-06-01

    Objectives Although maternal employment rates have increased in the last decade in the UK, there is very little research investigating the linkages between maternal nonstandard work schedules (i.e., work schedules outside of the Monday through Friday, 9-5 schedule) and breastfeeding initiation and duration, especially given the wide literature citing the health advantages of breastfeeding for mothers and children. Methods This paper uses a population-based, UK cohort study, the Millennium Cohort Study (n = 17,397), to investigate the association between types of maternal nonstandard work (evening, night, away from home overnight, and weekends) and breastfeeding behaviors. Results In unadjusted models, exposure to evening shifts was associated with greater odds of breastfeeding initiation (OR 1.71, CI 1.50-1.94) and greater odds of short (OR 1.55, CI 1.32-1.81), intermediate (OR 2.01, CI 1.64-2.47), prolonged partial duration (OR 2.20, CI 1.78-2.72), and prolonged exclusive duration (OR 1.53, CI 1.29-1.82), compared with mothers who were unemployed and those who work other types of nonstandard shifts. Socioeconomic advantage of mothers working evening schedules largely explained the higher odds of breastfeeding initiation and duration. Conclusions Socioeconomic characteristics explain more breastfeeding behaviors among mothers working evening shifts. Policy interventions to increase breastfeeding initiation and duration should consider the timing of maternal work schedules.

  10. Realistic Scheduling Mechanism for Smart Homes

    Directory of Open Access Journals (Sweden)

    Danish Mahmood

    2016-03-01

    Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.

  11. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

    Bocewicz, G.; Nielsen, Izabela Ewa; Banaszak, Z.

    2013-01-01

    Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro......Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research...... is to provide a declarative model enabling to state a constraint satisfaction problem aimed at AGVs fleet scheduling subject to assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured...... orders, the main objective is to provide the declarative framework aimed at conditions allowing one to calculate the AGVs fleet schedule in online mode. An illustrative example of the relevant algebra-like driven step-by-stem cyclic scheduling is provided....

  12. Interoceanic canal excavation scheduling via computer simulation

    International Nuclear Information System (INIS)

    Baldonado, Orlino C.

    1970-01-01

    The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

  13. Peak power ratio generator

    Science.gov (United States)

    Moyer, R.D.

    A peak power ratio generator is described for measuring, in combination with a conventional power meter, the peak power level of extremely narrow pulses in the gigahertz radio frequency bands. The present invention in a preferred embodiment utilizes a tunnel diode and a back diode combination in a detector circuit as the only high speed elements. The high speed tunnel diode provides a bistable signal and serves as a memory device of the input pulses for the remaining, slower components. A hybrid digital and analog loop maintains the peak power level of a reference channel at a known amount. Thus, by measuring the average power levels of the reference signal and the source signal, the peak power level of the source signal can be determined.

  14. 78 FR 21818 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I

    Science.gov (United States)

    2013-04-12

    ..., methamphetamine, and MDMA, Schedule I and II substances. These effects included elevated body temperature... of reuptake of monoamines, and in vivo studies (microdialysis, locomotor activity, body temperature.... Yet another commenter claimed that Schedule I placement would ``cripple efforts at learning,'' make it...

  15. Parents' Family Time and Work Schedules: The Split-Shift Schedule in Spain

    NARCIS (Netherlands)

    Gracia, P.; Kalmijn, M.

    2016-01-01

    This study used data on couples from the 2003 Spanish Time Use Survey (N = 1,416) to analyze how work schedules are associated with family, couple, parent–child, and non-family leisure activities. Spain is clearly an interesting case for the institutionalized split-shift schedule, a long lunch break

  16. A master surgical scheduling approach for cyclic scheduling in operating room departments

    NARCIS (Netherlands)

    van Oostrum, Jeroen M.; van Houdenhoven, M.; Hurink, Johann L.; Hans, Elias W.; Wullink, Gerhard; Kazemier, G.

    This paper addresses the problem of operating room (OR) scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time-consuming, tedious, and complex task. The stochasticity of the durations of surgical procedures

  17. A model for generating master surgical schedules to allow cyclic scheduling in operating room departments

    NARCIS (Netherlands)

    van Oostrum, J.M.; van Houdenhoven, M.; Hurink, Johann L.; Hans, Elias W.; Wullink, Gerhard; Kazemier, G.

    2005-01-01

    This paper addresses the problem of operating room scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time consuming tedious and complex task. The stochasticity of the durations of surgical procedures complicates

  18. Final Report

    Energy Technology Data Exchange (ETDEWEB)

    David W. Mazyck; Angela Lindner; CY Wu, Rick Sheahan, Ashok Jain

    2007-06-30

    Nuchar granular activated carbon, perlite, Osmocote slow release ammonium nitrate pellets, and Agrasoke water crystals in a 4:2:1:1 ratio by volume. The biofilter was inoculated with a bacterial culture collected from a Florida pulp and paperboard plant. A non-inoculated biofilter column was also tested. Use of a biological inoculum enriched from biofilm in the pulp and paper process has the potential to enhance the performance of a GAC biofilter. During testing, packing material was removed from the inlet and oulet of the biofilters and analyzed for genetic diversity using molecular techniques. The biofilter inoculated with specifically-enhanced inoculum showed higher bacterial diversity for methylotrophs and all bacteria, as compared to a non-inoculated biofilter. Mixed methylotrophic cultures, selected as potential biofilter inocula, showed increased methanol removal with highest concentrations of nitrogen provided as nitrate.

  19. 14 CFR 399.81 - Unrealistic or deceptive scheduling.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Unrealistic or deceptive scheduling. 399.81... Unrealistic or deceptive scheduling. (a) It is the policy of the Board to consider unrealistic scheduling of... to the advertising of scheduled performance, it is the policy of the Board to regard as an unfair or...

  20. An introduction to optimal satellite range scheduling

    CERN Document Server

    Vázquez Álvarez, Antonio José

    2015-01-01

    The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, ...

  1. Optimal Scheduling of Domestic Appliances via MILP

    Directory of Open Access Journals (Sweden)

    Zdenek Bradac

    2014-12-01

    Full Text Available This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP formulation of the problem is presented. This model is verified by several problem instances. Realistic scenarios based on the real price tariffs commercially available in the Czech Republic are calculated. The results obtained by solving the optimization problem are compared with a simulation of the ripple control service currently used by many domestic consumers in the Czech Republic.

  2. Schedule and staffing of a nuclear power project

    International Nuclear Information System (INIS)

    Polliart, A.J.; Csik, B.

    1977-01-01

    Establishment of construction schedule: a) preliminary construction schedule; b) PERT (Program Evaluation Review Techniques) analytical method; c) identify key milestone target dates; d) inter-action by participants and contribution to support revised construction schedule. - Construction schedule control: a) ability to update and modify construction schedule; b) alternate plans to circumvent restraints (problems); c) critical path activity-controls; d) continuous review and report system. - Updating construction site reports to include: 1) progress, 2) accomplishments, 3) potential problems and alternate plans; b) progress reports on related support services; c) total assessment of participating groups on schedule; d) information required by management for decisions. - Typical causes for delays in project schedule. (orig.) [de

  3. Influence of intravenous self-administered psychomotor stimulants on performance of rhesus monkeys in a multiple schedule paradigm.

    Science.gov (United States)

    Hoffmeister, F

    1980-01-01

    Rhesus monkeys were trained to complete three multiple schedules. The schedules consisted of three components: a fixed interval (component 1), a variable interval (component 2), and a fixed ratio (component 3). During components 1 and 2, pressing lever 1 was always reinforced by food delivery. During component 3, pressing lever 2 resulted in either food delivery or intravenous infusions of saline solution, solutions of cocaine, of d-amphetamine, of phenmetrazine, or fenetylline. In schedule I, animals were presented with all three components independent of key-pressing behavior during components 1 and 2. In schedule II the availability of component 2 was dependent on completion of component 1. Component 3 was made available only on completion of component 2. Noncompletion of components 1 or 2 resulted in time-out of 15 and 10 min, respectively. Schedule III was identical with schedule II, except that in schedule III the completion of components was indicated only by a change in the lever lights. The influence of self-administered drugs on behavior in all three components was evaluated. Self-administration of psychomotor stimulants impaired the performance of animals and delayed completion of components 1 and 2 of schedules I, II, and III. The effects on behavior were similar with low drug intake in schedule III, moderate intake in schedule II, and high drug intake in schedule I. These effects were strong with self-administration of phenmetrazine, moderate with self-administration of cocaine and d-amphetamine, and weak with self-administration of fenetylline.

  4. Crane Scheduling for a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper; Clausen, Jens

    2002-01-01

    Odense Steel Shipyard produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. This paper considers the problem of scheduling two cranes that carry out the movements of plates...... into, around and out of the storage. The system is required to create a daily schedule for the cranes, but also handle possible disruptions during the execution of the plan. The problem is solved with a Simulated Annealing algorithm....

  5. Autonomous scheduling technology for Earth orbital missions

    Science.gov (United States)

    Srivastava, S.

    1982-01-01

    The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system.

  6. Scheduling projects with multiskill learning effect.

    Science.gov (United States)

    Zha, Hong; Zhang, Lianying

    2014-01-01

    We investigate the project scheduling problem with multiskill learning effect. A new model is proposed to deal with the problem, where both autonomous and induced learning are considered. In order to obtain the optimal solution, a genetic algorithm with specific encoding and decoding schemes is introduced. A numerical example is used to illustrate the proposed model. The computational results show that the learning effect cannot be neglected in project scheduling. By means of determining the level of induced learning, the project manager can balance the project makespan with total cost.

  7. Real-time systems scheduling 2 focuses

    CERN Document Server

    Chetto, Maryline

    2014-01-01

    Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc. Scheduling is a central problem for these computing/communication systems since it is responsible for software execution in a timely manner. This book, the second of two volumes on the subject, brings together knowledge on specific topics and discusses the recent advances for some of them.  It addresses foundations as well as the latest advances and findings in real-time scheduling, giving comprehensive references to important papers, but the chapters are short and not overloaded with co

  8. Optimal scheduling of coproduction with a storage

    International Nuclear Information System (INIS)

    Ravn, H.F.; Rygard, J.M.

    1993-02-01

    We consider the problem of optimal scheduling of a system with combined heat and heat (CHP) units and a heat storege. The purpose of the heat storage is to permit a partial decoupling of the variations in the demand for heat and electrical power. We formulate the problem of optimal scheduling as that of minimizing the total costs over the planning period. The heat demand from the district heating system and the ''shadow prices'' for the electrical power system are taken as externally given parameters. The resulting model is solved by dynamic programming. We describe implementation details and we give examples of result of the optimization. (au) (12 refs.)

  9. Long-term home care scheduling

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

    In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans spanning several days such that a high quality of service is maintained and the overall cost is kept as low as possible. A solution to the problem...... provides detailed information on visits and visit times for each employee on each of the covered days. We propose a branch-and-price algorithm for the long-term home care scheduling problem. The pricing problem generates one-day plans for an employee, and the master problem merges the plans with respect...

  10. Real-time systems scheduling fundamentals

    CERN Document Server

    Chetto, Maryline

    2014-01-01

    Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc.  Scheduling is a central problem for these computing/communication systems since responsible of software execution in a timely manner. This book provides state of knowledge in this domain with special emphasis on the key results obtained within the last decade. This book addresses foundations as well as the latest advances and findings in Real-Time Scheduling, giving all references to important papers. But nevertheless the chapters will be short and not overloaded with confusing details.

  11. The Liquidity Coverage Ratio: the need for further complementary ratios?

    OpenAIRE

    Ojo, Marianne

    2013-01-01

    This paper considers components of the Liquidity Coverage Ratio – as well as certain prevailing gaps which may necessitate the introduction of a complementary liquidity ratio. The definitions and objectives accorded to the Liquidity Coverage Ratio (LCR) and Net Stable Funding Ratio (NSFR) highlight the focus which is accorded to time horizons for funding bank operations. A ratio which would focus on the rate of liquidity transformations and which could also serve as a complementary metric gi...

  12. The spirit of St. Lucie: nuclear plant built on schedule

    International Nuclear Information System (INIS)

    Derrickson, W.B.

    1984-01-01

    Florida Power and Light Company currently has four nuclear units in operation with St. Lucie Unit 2 being the last to receive an operating license in June, 1983. It's sister Unit 1 received its license in 1976 and has, through 1982, compiled one of the best operating records in the United States. The full power license for St. Lucie Unit 2 was received from the Nuclear Regulatory Commission (NRC) on June 10, 1983, just six years after construction began. The industry average for construction of nuclear plants in this time period is about 10 years. The success of the St. Lucie Unit 2 project can be at least in part attributed to planning the work, accurate and timely reporting of results via valid indicators, well trained and skilled personnel, and most of all, teamwork. During the course of the project the plant was constantly on or near schedule and always ahead of industry averages. This was done despite issuance of numerous regulations by the NRC (TMI), a 1979 hurricane which did considerable damage to the Reactor Auxiliary Building, labor problems, and an NRC schedule review team that determined the best that could be done was to complete the plant a year later. The final price tag is about $1.42 billion, including ''allowance for funds used during construction''. In operation to date the post core loading test program has been completed in less than two months, enabling the plant to be put into commercial operation only two months after its original scheduled date of May 28, 1983exclamation

  13. Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

    Science.gov (United States)

    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.

  14. Energy Profit Ratio Compared

    International Nuclear Information System (INIS)

    Amano, Osamu

    2007-01-01

    We need more oil energy to take out oil under the ground. Limit resources make us consider other candidates of energy source instead of oil. Electricity shall be the main role more and more like electric vehicles and air conditioners so we should consider electricity generation ways. When we consider what kind of electric power generation is the best or suitable, we should not only power generation plant but whole process from mining to power generation. It is good way to use EPR, Energy Profit Ratio, to analysis which type is more efficient and which part is to do research and development when you see the input breakdown analysis. Electricity by the light water nuclear power plant, the hydrogen power plant and the geothermal power plant are better candidates from EPR analysis. Forecasting the world primly energy supply in 2050, it is said that the demand will be double of the demand in 2000 and the supply will not be able to satisfy the demand in 2050. We should save 30% of the demand and increase nuclear power plants 3.5 times more and recyclable energy like hydropower plants 3 times more. When the nuclear power plants are 3.5 times more then uranium peak will come and we will need breed uranium. I will analysis the EPR of FBR. Conclusion: A) the EPR of NPS in Japan is 17.4 and it is the best of all. B) Many countries will introduce new nuclear power plants rapidly may be 3.5 times in 2050. C) Uranium peak will happen around 2050. (author)

  15. Tramp ship routing and scheduling with voyage separation requirements

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    2017-01-01

    In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found in the s......In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found...... that our algorithm in general finds optimal solutions very quickly and performs much faster compared to an earlier a priori path generation method. Finally, we compare our method to an earlier adaptive large neighbourhood search heuristic and find that on similar-sized instances our approach generally uses...... less time to find the optimal solution than the adaptive large neighbourhood search method uses to find a heuristic solution....

  16. Adaptive Cost-Based Task Scheduling in Cloud Environment

    Directory of Open Access Journals (Sweden)

    Mohammed A. S. Mosleh

    2016-01-01

    Full Text Available Task execution in cloud computing requires obtaining stored data from remote data centers. Though this storage process reduces the memory constraints of the user’s computer, the time deadline is a serious concern. In this paper, Adaptive Cost-based Task Scheduling (ACTS is proposed to provide data access to the virtual machines (VMs within the deadline without increasing the cost. ACTS considers the data access completion time for selecting the cost effective path to access the data. To allocate data access paths, the data access completion time is computed by considering the mean and variance of the network service time and the arrival rate of network input/output requests. Then the task priority is assigned to the removed tasks based data access time. Finally, the cost of data paths are analyzed and allocated based on the task priority. Minimum cost path is allocated to the low priority tasks and fast access path are allocated to high priority tasks as to meet the time deadline. Thus efficient task scheduling can be achieved by using ACTS. The experimental results conducted in terms of execution time, computation cost, communication cost, bandwidth, and CPU utilization prove that the proposed algorithm provides better performance than the state-of-the-art methods.

  17. Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

    Directory of Open Access Journals (Sweden)

    S Sarathambekai

    2017-03-01

    Full Text Available Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

  18. Microgrid optimal scheduling considering impact of high penetration wind generation

    Science.gov (United States)

    Alanazi, Abdulaziz

    The objective of this thesis is to study the impact of high penetration wind energy in economic and reliable operation of microgrids. Wind power is variable, i.e., constantly changing, and nondispatchable, i.e., cannot be controlled by the microgrid controller. Thus an accurate forecasting of wind power is an essential task in order to study its impacts in microgrid operation. Two commonly used forecasting methods including Autoregressive Integrated Moving Average (ARIMA) and Artificial Neural Network (ANN) have been used in this thesis to improve the wind power forecasting. The forecasting error is calculated using a Mean Absolute Percentage Error (MAPE) and is improved using the ANN. The wind forecast is further used in the microgrid optimal scheduling problem. The microgrid optimal scheduling is performed by developing a viable model for security-constrained unit commitment (SCUC) based on mixed-integer linear programing (MILP) method. The proposed SCUC is solved for various wind penetration levels and the relationship between the total cost and the wind power penetration is found. In order to reduce microgrid power transfer fluctuations, an additional constraint is proposed and added to the SCUC formulation. The new constraint would control the time-based fluctuations. The impact of the constraint on microgrid SCUC results is tested and validated with numerical analysis. Finally, the applicability of proposed models is demonstrated through numerical simulations.

  19. Heuristic Method for Decision-Making in Common Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Edyta Kucharska

    2017-10-01

    Full Text Available The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM, which enables making collective decisions in successive process stages, not separately for individual objects or executors. Moreover, taking into account the limitations of the problem, it involves constructing only an acceptable solution and significantly reduces the amount of calculations. A general algorithm based on the presented method is composed of the following elements: preliminary analysis of the problem, techniques for the choice of decision at a given state, the pruning non-perspective trajectory, selection technique of the initial state for the trajectory final part, and the trajectory generation parameters modification. The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship between tasks is defined by the graph. The article also presents the results of computational experiments.

  20. A global quantification of "normal" sleep schedules using smartphone data.

    Science.gov (United States)

    Walch, Olivia J; Cochran, Amy; Forger, Daniel B

    2016-05-01

    The influence of the circadian clock on sleep scheduling has been studied extensively in the laboratory; however, the effects of society on sleep remain largely unquantified. We show how a smartphone app that we have developed, ENTRAIN, accurately collects data on sleep habits around the world. Through mathematical modeling and statistics, we find that social pressures weaken and/or conceal biological drives in the evening, leading individuals to delay their bedtime and shorten their sleep. A country's average bedtime, but not average wake time, predicts sleep duration. We further show that mathematical models based on controlled laboratory experiments predict qualitative trends in sunrise, sunset, and light level; however, these effects are attenuated in the real world around bedtime. Additionally, we find that women schedule more sleep than men and that users reporting that they are typically exposed to outdoor light go to sleep earlier and sleep more than those reporting indoor light. Finally, we find that age is the primary determinant of sleep timing, and that age plays an important role in the variability of population-level sleep habits. This work better defines and personalizes "normal" sleep, produces hypotheses for future testing in the laboratory, and suggests important ways to counteract the global sleep crisis.

  1. Schedule control in Ling Ao nuclear power project

    International Nuclear Information System (INIS)

    Xie Ahai

    2007-01-01

    Ling Ao Nuclear Power Station (LANP) is first one built up by self-reliance in China with power capacity 990x2 MWe. The results of quality control, schedule control and cost control are satisfactory. The commercial operation days of Unit 1 and Unit 2 were 28th May 2002 and 8th Jan. 2003 respectively, which were 48 days and 66 days in advance of the project schedule. This paper presents the practices of self-reliance schedule control system in LANP. The paper includes 10 sections: schedule control system; targets of schedule control; schedule control at early stage of project; construction schedule; scheduling practice; Point curves; schedule control of design and procurement; a good practice of construction schedule control on site; commissioning and startup schedule; schedule control culture. Three figures are attached. The main contents of the self-reliance schedule control system are as follows: to draw up reasonable schedules and targets; to setup management mechanism and procedures; to organize powerful project management team; to establish close monitoring system; to provide timely progress reports and statistics information. Five kinds of schedule control targets are introduced, i.e. bar-chart schedule; milesones; Point curves; interface management; hydraulic test schedule of auxiliary piping loops; EMR/EMC/EESR issuance schedules. Six levels of bar-chart schedules were adopted in LANP, but the bar-chart schedules were not satisfactory for complicated erection condition on site, even using six levels of schedules. So a kind of Point curves was developed and their advantages are explained. Scheduling method of three elements: activity, duration, logic, which was adopted in LANP, is introduced. The duration of each piping activities in LANP level 2 project schedule was calculated based on the relevant working Point quantities. The analysis and adjustment of Point curves are illustrated, i.e. balance of monthly quantities; possible production in the peakload

  2. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

    Risse, Thomas; Wombacher, Andreas; Surridge, Mike; Taylor, Steve; Aberer, Karl

    The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the

  3. Crane Scheduling on a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper

    2002-01-01

    OSS produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. Two gantry cranes carry out this task. The planning task is now to create a schedule of movements for the 2 cranes...

  4. Improved human performance through appropriate work scheduling

    International Nuclear Information System (INIS)

    Morisseau, D.S.; Lewis, P.M.; Persensky, J.J.

    1987-01-01

    The Nuclear Regulatory Commission (NRC) has had a policy, Generic Letter 82-12, on hours of work since 1982. The policy states that licensees should establish controls to prevent situations where fatigue could reduce the ability of operating personnel to perform their duties safely (USNRC 1982). While that policy does give guidance on hours of work and overtime, it does not address periods of longer than 7 days or work schedules other than the routine 8-hour day, 40-hour week. Recognizing that NRC policy could provide broader guidance for shift schedules and hours of overtime work, the Division of Human Factors Safety conducted a project with Pacific Northwest Laboratories (PNL) to help the NRC better understand the human factors principles and issues concerning hours of work so that the NRC could consider updating their policy as necessary. The results of this project are recommendations for guidelines and limits for periods of 14 days, 28 days, and 1 year to take into account the cumulative effects of fatigue. In addition, routine 12-hour shifts are addressed. This latter type of shift schedule has been widely adopted in the petroleum and chemical industries and several utilities operating nuclear power plants have adopted it as well. Since this is the case, it is important to consider including guidelines for implementing this type of schedule. This paper discusses the bases for the PNL recommendations which are currently being studied by the NRC

  5. ATD-2 Surface Scheduling and Metering Concept

    Science.gov (United States)

    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

  6. Irrigation scheduling using soil moisture sensors

    Science.gov (United States)

    Soil moisture sensors were evaluated and used for irrigation scheduling in humid region. Soil moisture sensors were installed in soil at depths of 15cm, 30cm, and 61cm belowground. Soil volumetric water content was automatically measured by the sensors in a time interval of an hour during the crop g...

  7. Quarterly report on program cost and schedule

    International Nuclear Information System (INIS)

    1989-07-01

    This report is intended to provide a summary of the cost and schedule performance for the Civilian Radioactive Waste Management Program. Performance data are presented for each of the major program elements. Also included in this report is the status of the Nuclear Waste Fund revenues and disbursements. This report includes project performance data reported through March 1989

  8. Schedule reconciliation tests for management prudency determination

    International Nuclear Information System (INIS)

    Howell, G.E.

    1986-01-01

    The prudency audit of a nuclear project involves engineering, construction, financial, and management dimensions. The audit must retrospectively evaluate the decisions and actions of management decision makers and then equitably allocate the cost impacts of those decisions and actions in a comprehensive and objective manner. In most situations, determination of the impact of schedule delays is a paramount issue. Manzi and Associates uses an approach to schedule reconciliation that focuses on the site-specific, as-built condition. The as-built schedule model is analyzed by a backward pass, or but-for methodology which focuses on the causes and impacts of identified delays. The objective is to demonstrate that but-for the identified delay, the project could have been built in the as-planned time frame. The but-for methodology has been used in many contract dispute cases and is currently being applied to schedule reconciliation on several nuclear plants. The potential for applying this methodology to both new construction and retrofit projects is great

  9. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

    time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

  10. Flexible Scheduling in Multimedia Kernels: An Overview

    NARCIS (Netherlands)

    Jansen, P.G.; Scholten, Johan; Laan, Rene; Chow, W.S.

    1999-01-01

    Current Hard Real-Time (HRT) kernels have their timely behaviour guaranteed on the cost of a rather restrictive use of the available resources. This makes current HRT scheduling techniques inadequate for use in a multimedia environment where we can make a considerable profit by a better and more

  11. Maximizing System Lifetime by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.; Bohnenkamp, H.C.; Katoen, Joost P.

    2009-01-01

    The use of mobile devices is limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend the lifetime. In these cases, scheduling the batteries over the load to exploit recovery properties usually extends the

  12. Cost-efficient scheduling of FAST observations

    Science.gov (United States)

    Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi

    2018-03-01

    A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.

  13. Approximating multi-objective scheduling problems

    NARCIS (Netherlands)

    Dabia, S.; Talbi, El-Ghazali; Woensel, van T.; Kok, de A.G.

    2013-01-01

    In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions that represent the interactions between the different objectives. Due to

  14. Scheduling with time-dependent execution times

    NARCIS (Netherlands)

    Woeginger, G.J.

    1995-01-01

    We consider systems of tasks where the task execution times are time-dependent and where all tasks have some common deadline. We describe how to compute in polynomial time a schedule that minimizes the number of late tasks. This answers a question raised in a recent paper by Ho, Leung and Wei.

  15. FLOWSHOP SCHEDULING USING A NETWORK APPROACH ...

    African Journals Online (AJOL)

    eobe

    time when the last job completes on the last machine. The objective ... more jobs in a permutation flow shop scheduling problem ... processing time of a job on a machine is zero, it ..... hybrid flow shops with sequence dependent setup times ...

  16. Advance Resource Provisioning in Bulk Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet

    2012-10-01

    Today?s scientific and business applications generate mas- sive data sets that need to be transferred to remote sites for sharing, processing, and long term storage. Because of increasing data volumes and enhancement in current net- work technology that provide on-demand high-speed data access between collaborating institutions, data handling and scheduling problems have reached a new scale. In this paper, we present a new data scheduling model with ad- vance resource provisioning, in which data movement operations are defined with earliest start and latest comple- tion times. We analyze time-dependent resource assign- ment problem, and propose a new methodology to improve the current systems by allowing researchers and higher-level meta-schedulers to use data-placement as-a-service, so they can plan ahead and submit transfer requests in advance. In general, scheduling with time and resource conflicts is NP-hard. We introduce an efficient algorithm to organize multiple requests on the fly, while satisfying users? time and resource constraints. We successfully tested our algorithm in a simple benchmark simulator that we have developed, and demonstrated its performance with initial test results.

  17. The Growing Diversity of Work Schedules.

    Science.gov (United States)

    Smith, Shirley J.

    1986-01-01

    The author highlights the predominance of the five-day, 40-hour workweek. Although finding little change in recent years in the proportion of workers on 40-hour schedules, Smith notes that there have been some changes in work patterns, with a still small but growing group of workers on "compressed" full-time weeks of less than five days.…

  18. Schedule and status of irradiation experiments

    International Nuclear Information System (INIS)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P.

    1998-01-01

    The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has four irradiation experiments in reactor, and five experiments in the design or construction stages. Postirradiation examination and testing is in progress on ten experiments

  19. 20 CFR 402.165 - Fee schedule.

    Science.gov (United States)

    2010-04-01

    ... requester for the services rendered. (i) Fee for copies of printed materials. When extra copies of printed... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Fee schedule. 402.165 Section 402.165 Employees' Benefits SOCIAL SECURITY ADMINISTRATION AVAILABILITY OF INFORMATION AND RECORDS TO THE PUBLIC...

  20. Project schedule and cost estimate report

    International Nuclear Information System (INIS)

    1988-03-01

    All cost tables represent obligation dollars, at both a constant FY 1987 level and an estimated escalation level, and are based on the FY 1989 DOE Congressional Budget submittal of December 1987. The cost tables display the total UMTRA Project estimated costs, which include both Federal and state funding. The Total Estimated Cost (TEC) for the UMTRA Project is approximately $992.5 million (in 1987 escalated dollars). Project schedules have been developed that provide for Project completion by September 1994, subject to Congressional approval extending DOE's authorization under Public Law 95-604. The report contains site-specific demographic data, conceptual design assumptions, preliminary cost estimates, and site schedules. A general project overview is also presented, which includes a discussion of the basis for the schedule and cost estimates, contingency assumptions, work breakdown structure, and potential project risks. The schedules and cost estimates will be revised as necessary to reflect appropriate decisions relating to relocation of certain tailings piles, or other special design considerations or circumstances (such as revised EPA groundwater standards), and changes in the Project mission. 27 figs', 97 tabs

  1. Adaptive resource allocation for efficient patient scheduling

    NARCIS (Netherlands)

    Vermeulen, Ivan B.; Bohte, Sander M.; Elkhuizen, Sylvia G.; Lameris, Han; Bakker, Piet J. M.; La Poutré, Han

    2009-01-01

    Efficient scheduling of patient appointments on expensive resources is a complex and dynamic task. A resource is typically used by several patient groups. To service these groups, resource capacity is often allocated per group, explicitly or implicitly. Importantly, due to fluctuations in demand,

  2. 21 CFR 1308.14 - Schedule IV.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule IV. 1308.14 Section 1308.14 Food and... isomers is possible: (1) Fenfluramine 1670 (e) Stimulants. Unless specifically excepted or unless listed... the following substances having a stimulant effect on the central nervous system, including its salts...

  3. 21 CFR 1308.12 - Schedule II.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule II. 1308.12 Section 1308.12 Food and... 9733 (26) Remifentanil 9739 (27) Sufentanil 9740 (28) Tapentadol 9780 (d) Stimulants. Unless... which contains any quantity of the following substances having a stimulant effect on the central nervous...

  4. 21 CFR 1308.11 - Schedule I.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule I. 1308.11 Section 1308.11 Food and Drugs...) Mecloqualone 2572 (3) Methaqualone 2565 (f) Stimulants. Unless specifically excepted or unless listed in... following substances having a stimulant effect on the central nervous system, including its salts, isomers...

  5. 21 CFR 1308.15 - Schedule V.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs... not less than 25 micrograms of atropine sulfate per dosage unit. (d) Stimulants. Unless specifically... which contains any quantity of the following substances having a stimulant effect on the central nervous...

  6. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria Eugenia; van Hillegersberg, Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This

  7. Irrigation scheduling with the neutron probe

    International Nuclear Information System (INIS)

    Travers, P.

    1987-01-01

    The operational theory of the neutron probe is briefly outlined and its application and uses discussed in relation to determination of soil compaction and irrigation scheduling. Graphic examples are given of alluvial soil moisture profiles and how this information can be used to improve trickle irrigation in vineyards. 3 refs., 7 figs

  8. Proportional green time scheduling for traffic lights

    NARCIS (Netherlands)

    P. Kovacs; Le, T. (Tung); R. Núñez Queija (Rudesindo); Vu, H. (Hai); N. Walton

    2016-01-01

    textabstractWe consider the decentralized scheduling of a large number of urban traffic lights. We investigate factors determining system performance, in particular, the length of the traffic light cycle and the proportion of green time allocated to each junction. We study the effect of the length

  9. DEVELOPMENT OF A MAINTENANCE SCHEDULING MODEL FOR ...

    African Journals Online (AJOL)

    ... of minor maintenance, for each machine within this time span. In order to minimize the total cost of repairs and production. A numerical application of this development model in a case study is presented. Key words: Maintenance, modeling, scheduling, optimization. [Global Jnl Engineering Res. Vol.1(2) 2002: 107-118] ...

  10. Cross layer scheduling algorithm for LTE Downlink

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Yan, Ying; Dittmann, Lars

    2012-01-01

    . This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions regarding the channel conditions and the size of transmission buffers and different QoS demands. The simulation results show that the new algorithm improves the resource...

  11. Scheduling drayage operations in synchromodal transport

    NARCIS (Netherlands)

    Rivera, Arturo E.Pérez; Mes, Martijn R.K.; Bektas, Tolga; Coniglio, Stefano; Martinez-Sykora, Antonio; Voss, Stefan

    2017-01-01

    We study the problem of scheduling drayage operations in synchromodal transport. Besides the usual decisions to time the pick-up and delivery of containers, and to route the vehicles that transport them, synchromodal transport includes the assignment of terminals for empty and loaded containers. The

  12. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

    This paper deals with the problem of simultaneously scheduling machines and a number of autonomous mobile robots in a flexible manufacturing system (FMS). Besides capability of transporting materials between machines, the considered mobile robots are different from other material handling devices...

  13. Flexible job shop scheduling problem in manufacturing

    OpenAIRE

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

    2013-01-01

    This paper addresses a real assembly cell: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (FJSSP).

  14. Implications of Nontraditional Work Schedules for Women

    Science.gov (United States)

    Polit, Denise F.

    1978-01-01

    Issues, evidence, and arguments relating to the effects of alternative working arrangements on the lives of women are examined. Forms of nontraditional schedules which are analyzed include the shortened work week, flexible working hours, and part-time employment. (Author/GC)

  15. Job shop scheduling by local search

    NARCIS (Netherlands)

    Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

    1994-01-01

    We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness

  16. Scheduling in Engineering, Project, and Production Management

    OpenAIRE

    Chien-Ho Ko

    2015-01-01

    This issue presents five papers selected from the 2013 (4th) International Conference on Engineering, Project, and Production Management (EPPM2013) held in Bangkok, Thailand. Three of the papers deal with scheduling problems faced in project and production management, while the remaining two focus on engineering management issues.

  17. Integrating job scheduling and constrained network routing

    DEFF Research Database (Denmark)

    Gamst, Mette

    2010-01-01

    This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...

  18. A Comparison of Software Schedule Estimators

    Science.gov (United States)

    1990-09-01

    SLIM ...................................... 33 SPQR /20 ................................... 35 System -4 .................................... 37 Previous...24 3. PRICE-S Outputs ..................................... 26 4. COCOMO Factors by Category ........................... 28 5. SPQR /20 Activities...actual schedules experienced on the projects. The models analyzed were REVIC, PRICE-S, System-4, SPQR /20, and SEER. ix A COMPARISON OF SOFTWARE

  19. LTE uplink scheduling - flow level analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; van den Berg, J.L.; Heijenk, G.; Litjens, R.; Sacchi, Claudio; Bellalta, Boris; Vinel, Alexey; Schlegel, Christian; Granelli, Fabrizio; Zhang, Yan

    Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

  20. LTE uplink scheduling - Flow level analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; Berg, J.L. van den; Heijenk, G.; Litjens, R.

    2011-01-01

    Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and