WorldWideScience

Sample records for chronomodulated treatment schedules

  1. Phase I study of intermittent and chronomodulated oral therapy with capecitabine in patients with advanced and/or metastatic cancer

    International Nuclear Information System (INIS)

    The combination of capecitabine and gemcitabine at Fixed Dose Rate (FDR) has been demonstrated to be well tolerated, with apparent efficacy in patients with advanced cancers. FDR gemcitabine infusion leads to enhanced intracellular accumulation of drug and possible augmented clinical effect. The goals of this phase I study were to determine the maximum-tolerated dose (MTD) of chronomodulated capecitabine in patients with advanced cancer and to describe the dose-limiting toxicities (DLT), the safety profile of this way of administration. Patients with advanced solid tumours who had failed to response to standard therapy or for whom no standard therapy was available were elegible for this study. Capecitabine was administered orally according to following schedule: 1/4 of dose at 8:00 a.m.; 1/4 of dose at 6:00 p.m. and 1/2 of dose at 11:00 p.m. each day for 14 consecutive days, followed by a 7-day rest period. All 27 patients enrolled onto the study were assessable for toxicity. The most common toxicities during the first two cycles of chemotherapy were fatigue, diarrhoea and hand foot syndrome (HFS). Only one out of the nine patients treated at capecitabine dose of 2,750 mg/m2 met protocol-specified DLT criteria (fatigue grade 4). However, at these doses the majority of cycles of therapy were delivered without dose reduction or delay. No other episodes of DLT were observed at the same dose steps and at the lower dose steps of capecitabine (1,500/1,750/2,000/2,250/2,500 mg/m2). The dose of 2,750 mg/m2 is recommended for further study. Tumor responses were observed in patients with metastatic breast and colorectal cancer. High doses of chronomodulated capecitabine can be administered with acceptable toxicity. The evidence of antitumor activity deserves further investigation in phase II combination chemotherapy studies

  2. 7 CFR 305.8 - Sulfuryl fluoride treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Sulfuryl fluoride treatment schedules. 305.8 Section 305.8 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH... fluoride treatment schedules. Treatment schedule Pressure Temperature ( °F) Dosage rate(lb/1000 cubic...

  3. 7 CFR 305.23 - Steam sterilization treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Steam sterilization treatment schedules. 305.23... Steam sterilization treatment schedules. Treatment schedule Temperature( °F) Pressure Exposure period (minutes) Directions T303-b-1 10 lbs 20 Use 28″ vacuum. Steam sterilization is not practical for...

  4. 7 CFR 305.28 - Kiln sterilization treatment schedule.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Kiln sterilization treatment schedule. 305.28 Section 305.28 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH... sterilization treatment schedule. T404-b-4 Dry bulb temperature( °F) Wet bulb depression( °F)...

  5. 7 CFR 305.22 - Hot water immersion treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Hot water immersion treatment schedules. 305.22... Hot water immersion treatment schedules. (a) T102-d. (1) Fruit must be grown and treated in Hawaii. (2) Fruit must be submerged at least 4 inches below the water's surface in a hot water immersion...

  6. An intelligent manufacturing system for heat treatment scheduling

    OpenAIRE

    Al-Kanhal, Tawfeeq

    2010-01-01

    This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University. This research is focused on the integration problem of process planning and scheduling in steel heat treatment operations environment using artificial intelligent techniques that are capable of dealing with such problems. This work addresses the issues involved in developing a suitable methodology for scheduling heat treatment operations of steel. Several intelligent algorithms have been...

  7. 7 CFR 305.25 - Dry heat treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... treating equipment in order to determine that all niger seed being treated reaches the target temperature... 7 Agriculture 5 2010-01-01 2010-01-01 false Dry heat treatment schedules. 305.25 Section 305.25... SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Heat Treatments § 305.25 Dry heat...

  8. 7 CFR 305.21 - Hot water dip treatment schedule for mangoes.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Hot water dip treatment schedule for mangoes. 305.21... Hot water dip treatment schedule for mangoes. Mangoes may be treated using schedule T102-a: (a) Fruit... the treatment. (c) Water in the treatment tank must be treated or changed regularly to...

  9. Formulation and optimization of chronomodulated press-coated tablet of carvedilol by Box–Behnken statistical design

    OpenAIRE

    Satwara, Rohan

    2012-01-01

    Rohan S Satwara, Parul K PatelDepartment of Pharmaceutics, Babaria Institute of Pharmacy, Vadodara, Gujarat, IndiaObjective: The primary objective of the present investigation was to formulate and optimize chronomodulated press-coated tablets to deliver the antihypertensive carvedilol at an effective quantity predawn, when a blood pressure spike is typically observed in most hypertensive patients.Experimental work: Preformulation studies and drug excipient compatibility studies were carried o...

  10. 7 CFR 305.10 - Treatment schedules for combination treatments.

    Science.gov (United States)

    2010-01-01

    ... HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Chemical Treatments § 305...) T203-p and T511-1, hot water and chemical dip for citrus (Rutacae) seeds for citrus canker. (1) If any... of 6.0 to 7.5. (4) Seed from regions where citrus canker occurs must be drained, dried, and...

  11. Treatment for Acquired Apraxia of Speech: Examination of Treatment Intensity and Practice Schedule

    Science.gov (United States)

    Wambaugh, Julie L.; Nessler, Christina; Cameron, Rosalea; Mauszycki, Shannon C.

    2013-01-01

    Purpose: The authors designed this investigation to extend the development of a treatment for acquired apraxia of speech (AOS)--sound production treatment (SPT)--by examining the effects of 2 treatment intensities and 2 schedules of practice. Method: The authors used a multiple baseline design across participants and behaviors with 4 speakers with…

  12. 7 CFR 305.9 - Aerosol spray for aircraft treatment schedule.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Aerosol spray for aircraft treatment schedule. 305.9... INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Chemical Treatments § 305.9 Aerosol spray for aircraft treatment schedule. (a) Military aircraft. Aerosol disinfection of U.S....

  13. 76 FR 3077 - Notice of Decision To Revise a Heat Treatment Schedule for Emerald Ash Borer

    Science.gov (United States)

    2011-01-19

    ...' susceptibility to the heat treatments as the wood moisture content would have decreased over this period... Animal and Plant Health Inspection Service Notice of Decision To Revise a Heat Treatment Schedule for... are advising the public of our decision to revise a heat treatment schedule for the emerald ash...

  14. Using Multiple Schedules during Functional Communication Training to Promote Rapid Transfer of Treatment Effects

    Science.gov (United States)

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

    2015-01-01

    Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and…

  15. Using a Progressive Ratio Schedule of Reinforcement as an Assessment Tool to Inform Treatment.

    Science.gov (United States)

    Wilson, Alyssa N; Gratz, Olivia H

    2016-09-01

    A handful of studies have examined the utility of progressive ratio schedules (PRs) of reinforcement in treatment development and treatment efficacy. The current case study explored the utility of PRs as an assessment tool to inform a differential reinforcement treatment package. A PRs assessment was used to identify the breaking point of a functional communicative response before and after treatment. The breaking point was used as the initial reinforcement schedule during treatment. Following treatment, the communicative response increased during a posttest PRs assessment, suggesting the efficacy of the treatment package. PMID:27622131

  16. An Integer Linear Programming Model for the Radiotherapy Treatment Scheduling Problem

    CERN Document Server

    Burke, Edmund K; Petrovic, Sanja

    2011-01-01

    Radiotherapy represents an important phase of treatment for a large number of cancer patients. It is essential that resources used to deliver this treatment are employed effectively. This paper presents a new integer linear programming model for real-world radiotherapy treatment scheduling and analyses the effectiveness of using this model on a daily basis in a hospital. Experiments are conducted varying the days on which schedules can be created. Results obtained using real-world data from the Nottingham University Hospitals NHS Trust, UK, are presented and show how the proposed model can be used with different policies in order to achieve good quality schedules.

  17. Development of time controlled chronomodulated tablet with swelling and rupturable layers: Optimization of factors influencing lag-time and drug release

    OpenAIRE

    Desai, Mayur; Jivani, Rishad R.; Patel, Laxman D; Jivani, Noordin P; Sonagara, Bhavin

    2012-01-01

    Introduction: A tablet system consisting of cores coated with two layers of swelling and rupturable coatings was prepared and evaluated as time controlled chronomodulated tablet. Materials and Methods: Cores containing Montelukast sodium as model drug were prepared by direct compression and then coated sequentially with an inner swelling layer containing a HPMC E 5 and an outer rupturable layer of Eudragit RL/RS (1:1). A three-factor, two-level, full factorial design was used to investigate t...

  18. Formulation and optimization of chronomodulated press-coated tablet of carvedilol by Box–Behnken statistical design

    Directory of Open Access Journals (Sweden)

    Satwara RS

    2012-08-01

    Full Text Available Rohan S Satwara, Parul K PatelDepartment of Pharmaceutics, Babaria Institute of Pharmacy, Vadodara, Gujarat, IndiaObjective: The primary objective of the present investigation was to formulate and optimize chronomodulated press-coated tablets to deliver the antihypertensive carvedilol at an effective quantity predawn, when a blood pressure spike is typically observed in most hypertensive patients.Experimental work: Preformulation studies and drug excipient compatibility studies were carried out for carvedilol and excipients. Core tablets (6 mm containing carvedilol and 10-mm press-coated tablets were prepared by direct compression. The Box–Behnken experimental design was applied to these press-coated tablets (F1–F15 formula with differing concentrations of rate-controlling polymers. Hydroxypropyl methyl cellulose K4M, ethyl cellulose, and K-carrageenan were used as rate-controlling polymers in the outer layer. These tablets were subjected to various precompression and postcompression tests. The optimized batch was derived both by statistically (using desirability function and graphically (using Design Expert® 8; Stat-Ease Inc. Tablets formulated using the optimized formulas were then evaluated for lag time and in vitro dissolution.Results and discussion: Results of preformulation studies were satisfactory. No interaction was observed between carvedilol and excipients by ultraviolet, Fourier transform infrared spectroscopy, and dynamic light scattering analysis. The results of precompression studies and postcompression studies were within limits. The varying lag time and percent cumulative carvedilol release after 8 h was optimized to obtain a formulation that offered a release profile with 6 h lag time, followed by complete carvedilol release after 8 h. The results showed no significant bias between predicted response and actual response for the optimized formula.Conclusion: Bedtime dosing of chronomodulated press-coated tablets may offer a

  19. Reinforcement schedule thinning following treatment with functional communication training.

    OpenAIRE

    Hanley, G P; Iwata, B A; Thompson, R H

    2001-01-01

    We evaluated four methods for increasing the practicality of functional communication training (FCT) by decreasing the frequency of reinforcement for alternative behavior. Three participants whose problem behaviors were maintained by positive reinforcement were treated successfully with FCT in which reinforcement for alternative behavior was initially delivered on fixed-ratio (FR) 1 schedules. One participant was then exposed to increasing delays to reinforcement under FR 1, a graduated fixed...

  20. 7 CFR 305.40 - Garbage treatment schedules for insect pests and pathogens.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Garbage treatment schedules for insect pests and pathogens. 305.40 Section 305.40 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Treatments for Garbage § 305.40 Garbage...

  1. Design of chronomodulated drug delivery system of valsartan: in vitro characterization

    Directory of Open Access Journals (Sweden)

    M Sokar

    2015-01-01

    Full Text Available The aim of the present study was to design and evaluate a chronomodulated time-clock pulsatile tablets of valsartan to release it after a certain lag time, independent of the gastrointestinal pH, in its absorption window to cope with the circadian rhythm of human body for blood pressure elevation. Core tablets were prepared by direct compression of a homogenous mixture of valsartan, Avicel PH101, croscarmellose sodium, magnesium stearate and Aerosil. The core tablets were then sprayed coated with a sealing layer formed of ethyl cellulose that was subsequently coated with a release-controlling layer. Three different aqueous dispersions namely; carnauba wax or beeswax or a mixture in a ratio of 2.5:1, respectively, were used to form five time-clock tablet formulations having the release controlling layer with different thickness {B5, B10, B20, BW5 and CW5}. Quality control testing were carried out to the core tablets. Differential scanning calorimetry was also performed to detect the possible drug excipient interaction in the core tablet formulation. The release was carried out, for the prepared time-clock tablet formulations, in 0.1 N hydrochloric acid for the first 2 h, followed by phosphate buffer (pH 6.8 for 4.5 h. The effect of pH on valsartan release was studied through a release study in 0.1 N hydrochloric acid for 6.5 h. Two phase dissolution study was performed to the selected time-clock tablet formulation to predict the drug permeation through the gastrointestinal tract. Stability study of the selected formula was performed at 25°/60% RH and at 40°/75% RH for 3 months. Results showed that a release-controlling layer composed of a mixture of carnauba wax and beeswax in a ratio of 2.5:1 showed a reasonable release lag time. The release lag time of the tablets increased with the increase of the coat thickness, thus B20>B10>B5 with corresponding lag time values of 4.5, 3 and 2.5 h, respectively. Selected B5 tablet formula exhibited a

  2. Chronomodulated drug delivery system of salbutamol sulphate for the treatment of nocturnal asthma

    Directory of Open Access Journals (Sweden)

    Qureshi J

    2008-01-01

    Full Text Available A time dependent pulsed release system consisting of an effervescent core surrounded by consecutive layers of swelling and rupturable polymers was prepared and evaluated. The cores containing salbutamol sulphate as bioactive agent were prepared by direct compression method using different ratios of microcrystalline cellulose and effervescent agent and then coated sequentially with an inner swelling layer containing a hydrocolloid, hydroxypropylmethylcellulose E5 and an outer rupturable layer having Eudragit RL/RS (1:1. The effects of various processing and formulative parameters on the performance of system were studied. The rupture and dissolution tests were studied using the USP paddle method at 50 rpm in 0.1 N HCl and phosphate buffer pH 6.8. The lag time of the drug release decreased by increasing the inner swelling layer and increased by increasing the rupturing layer level. All the results obtained in the present study suggest that osmotic pumping effect was involved which eventually lead to the drug release.

  3. Schedule of factors influencing access to psychiatric treatment in persons with schizophrenia: Validity and pilot testing

    Directory of Open Access Journals (Sweden)

    K Shanivaram Reddy

    2013-01-01

    Full Text Available Background : A substantial proportion of patients with severe mental disorders remain untreated in India. Qualitative research has highlighted the complex interplay of multiple factors that preclude schizophrenia patients in rural Indian settings from accessing treatment. Aims: (a To establish the face and content validities of an interview schedule titled "Schedule of Factors Influencing Access (SOFIAc to Psychiatric Treatment in Persons with Schizophrenia," which comprehensively assesses the factors that prevent schizophrenia patients from accessing psychiatric treatment. (b To assess the feasibility of its administration. Materials and Methods: SOFIAc contains 15 items. This schedule involves three phases of interviewing patients and family members. This was given to 12 experts. They used Likert scales (1=not at all satisfactory to 5=very much satisfactory to rate each item of the schedule. In addition, the experts rated (the same way as above the following five dimensions of the schedule (as a whole separately: A (comprehensiveness of the factors, B (scoring system, C (interviewing method, D (general instructions given to the raters, E (overall schedule. Later on, 10 persons with schizophrenia were interviewed with SOFIAc to test the feasibility of administration. Results: Thirteen items were rated as either satisfactory (score=4 or very much satisfactory (score=5 by all 12 experts; remaining two were rated as 4 or 5 by 11 experts. Regarding comprehensiveness of the factors, scoring methods and general instructions given to the interviewers, all provided scores >4; regarding the method of interviewing, 11 provided the score of >4; with regard to overall interview schedule, all experts provided scores >4. Pilot testing revealed that it took 60 min to administer SOFIAc. Conclusion: SOFIAc has satisfactory face and content validities. It is also feasible to administer SOFIAc.

  4. 7 CFR 305.27 - Forced hot air treatment schedules.

    Science.gov (United States)

    2010-01-01

    ..., and T103-d-2. (1)Temperature sensors must be inserted into the centers of the largest fruits. The number of sensors must be approved in advance by APHIS. Sensors must be physically placed in various... trays, bulk bins, or ventilated boxes) must be loaded into the treatment chamber, and sensors must...

  5. A randomized study comparing short-time infusion of oxaliplatin in combination with capecitabine XELOX(30) and chronomodulated XELOX(30) as first-line therapy in patients with advanced colorectal cancer

    DEFF Research Database (Denmark)

    Qvortrup, C; Jensen, Benny Vittrup; Fokstuen, T;

    2010-01-01

    Chronotherapy is one of the several approaches to increase efficacy and reduce toxicity of chemotherapy. In a phase II study in the second-line in patients with metastatic colorectal cancer (mCRC), we found that chronomodulated XELOX (XELOX(30Chron)) was a well-tolerated regimen with potentially ...

  6. Optimal treatment scheduling of ionizing radiation and sunitinib improves the antitumor activity and allows dose reduction

    International Nuclear Information System (INIS)

    The combination of radiotherapy with sunitinib is clinically hampered by rare but severe side effects and varying results with respect to clinical benefit. We studied different scheduling regimes and dose reduction in sunitinib and radiotherapy in preclinical tumor models to improve potential outcome of this combination treatment strategy. The chicken chorioallantoic membrane (CAM) was used as an angiogenesis in vivo model and as a xenograft model with human tumor cells (HT29 colorectal adenocarcinoma, OE19 esophageal adenocarcinoma). Treatment consisted of ionizing radiation (IR) and sunitinib as single therapy or in combination, using different dose-scheduling regimes. Sunitinib potentiated the inhibitory effect of IR (4 Gy) on angiogenesis. In addition, IR (4 Gy) and sunitinib (4 days of 32.5 mg/kg per day) inhibited tumor growth. Ionizing radiation induced tumor cell apoptosis and reduced proliferation, whereas sunitinib decreased tumor angiogenesis and reduced tumor cell proliferation. When IR was applied before sunitinib, this almost completely inhibited tumor growth, whereas concurrent IR was less effective and IR after sunitinib had no additional effect on tumor growth. Moreover, optimal scheduling allowed a 50% dose reduction in sunitinib while maintaining comparable antitumor effects. This study shows that the therapeutic efficacy of combination therapy improves when proper dose-scheduling is applied. More importantly, optimal treatment regimes permit dose reductions in the angiogenesis inhibitor, which will likely reduce the side effects of combination therapy in the clinical setting. Our study provides important leads to optimize combination treatment in the clinical setting

  7. Heuristic algorithm for planning and scheduling of forged pieces heat treatment

    Directory of Open Access Journals (Sweden)

    R. Lenort

    2012-04-01

    Full Text Available The paper presents a heuristic algorithm for planning and scheduling of forged pieces heat treatment which allows maximizing the capacity exploitation of the heat treatment process and the entire forging process. Five Focusing Steps continuous improvement process was selected as a methodological basis for the algorithm design. Its application was supported by simulation experiments performed on a dynamic computer model of the researched process. The experimental work has made it possible to elicit the general rules for planning and scheduling of the heat treatment process of forged pieces which reduce losses caused by equipment conversion and setup times, and which increase the throughput of this process. The HIPO diagram was used to design the algorithm.

  8. Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries

    Indian Academy of Sciences (India)

    M Mathirajan; V Chandru; A I Sivakumar

    2007-10-01

    This paper addresses a research problem of scheduling parallel, nonidentical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. We were led to this problem through a realworld application involving the scheduling of heat-treatment operations of steel casting. The scheduling of furnaces for heat-treatment of castings is of considerable interest as a large proportion of the total production time is the processing times of these operations. In view of the computational intractability of this type of problem, a few heuristic algorithms have been designed for maximizing the utilization of heat-treatment furnaces of steel casting manufacturing. Extensive computational experiments were carried out to compare the performance of the heuristics with the estimated optimal value (using the Weibull technique) and for relative effectiveness among the heuristics. Further, the computational experiments show that the heuristic algorithms proposed in this paper are capable of obtaining near (statistically estimated) optimal utilization of heat-treatment furnaces and are also capable of solving any large size real-life problems with a relatively low computational effort.

  9. Alcohol Withdrawal Syndrome: Symptom-Triggered versus Fixed-Schedule Treatment in an Outpatient Setting

    DEFF Research Database (Denmark)

    Elholm, B.; Larsen, Klaus; Hornnes, N.;

    2011-01-01

    Aims: To investigate whether, in the treatment with chlordiazepoxide for outpatient alcohol withdrawal, there are advantages of symptom-triggered self-medication over a fixed-schedule regimen. Methods: A randomized controlled trial in outpatient clinics for people suffering from alcohol dependence...... (AD) and alcohol-related problems; 165 adult patients in an outpatient setting in a specialized alcohol treatment unit were randomized 1:1 to either a symptom-triggered self-medication or tapered dose, using chlordiazepoxide. Alcohol withdrawal symptoms, amount of medication, duration of symptoms......, time to relapse and patient satisfaction were measured. Patients assessed their symptoms using the Short Alcohol Withdrawal Scale (SAWS). Patient satisfaction was monitored by the Diabetes Treatment Satisfaction Questionnaire. We used the Well-Being Index and the European addiction severity index...

  10. 75 FR 4227 - Phytosanitary Treatments; Location of and Process for Updating Treatment Schedules

    Science.gov (United States)

    2010-01-26

    ... proposed Sec. 305.8(a), which contains requirements for heat treatment facilities, is also headed... treatment facilities, operators of wood packing material treatment facilities, officials who monitor... resolved, we will publish a proposed rule soliciting public comment on the change. Heat Treatment...

  11. Etanercept, improved dosage schedules and combinations in the treatment of psoriasis: an update

    Directory of Open Access Journals (Sweden)

    Siegfried Segaert

    2009-08-01

    Full Text Available Siegfried SegaertDepartment of Dermatology, University Hospital Leuven, BelgiumAbstract: Etanercept, a subcutaneously administered fully human soluble tumor necrosis factor (TNF receptor, was initially approved for the treatment of psoriasis at a dose of 25 mg twice weekly in repeated 24-week cycles with the possibility to double the dose in the first 12 weeks of the first cycle. During intermittent treatment, patients retain their ability to respond to etanercept. Recently, a new dosing schedule of etanercept 50 mg once weekly was approved, based on a study in which PASI-75 (75% improvement of Psoriasis Area and Severity Index was achieved by 37% and 71% of patients at week 12 and 24. Another study demonstrated a PASI-75 of 57% and 69% in pediatric psoriasis patients receiving etanercept 0.8 mg/kg (up to 50 mg once weekly for 12 and 24 weeks respectively, resulting in European approval from age 8. Based on recent clinical trials, the antipsoriatic effect of etanercept can be markedly increased in combination with acitretin, methotrexate or UVB. The combination with acitretin appears attractive because of its non-immunosuppressive and chemopreventive properties. Etanercept–methotrexate combination therapy is well established in rheumatologic patients. From a long-term perspective, the combination of TNF-inhibitors with phototherapy (photocarcinogenesis or cyclosporine (carcinogenesis, infections warrants great caution however. Finally, combination with topical calcipotriol–betamethasone ointment may increase the speed of response to TNF-inhibitors in the first 4 weeks of treatment.Keywords: etanercept, psoriasis, dosing schedules, combination therapy

  12. PLK1-inhibition can cause radiosensitization or radioresistance dependent on the treatment schedule

    International Nuclear Information System (INIS)

    Background and purpose: PLK1-inhibitors are emerging as new potential anticancer agents. It is therefore important to explore the combined effects of PLK1-inhibitors with conventional therapies. Based on the functional roles of PLK1 in both mitosis and the G2 checkpoint, we hypothesized that the treatment schedule might influence the combined effects of PLK1-inhibiton and radiation. Materials and methods: Human osteosarcoma U2OS and colorectal cancer HT29 and SW620 cells were treated with the PLK1-inhibitor BI2536 before or after X-ray irradiation (0–6 Gy). Clonogenic assays, flow cytometry, immunofluorescence and mCherry-53BP1 time-lapse imaging were used to assay cell survival, cell cycle progression and DNA damage repair. Results: Treatment with the PLK1-inhibitor for 24 h before radiation caused cells to accumulate in G2/M and resulted in increased radiosensitivity. In contrast, the cytotoxic effects of the two treatments were less-than-additive when cells were treated with the PLK1-inhibitor for 24 h after radiation. This resistance was associated with a prolonged G2 checkpoint causing enhanced repair of the radiation-induced damage and decreased BI2536-mediated mitotic damage. Conclusions: PLK1-inhibitors need to be administrated several hours before radiation to achieve radiosensitization. If PLK1-inhibitors are given after radiation, cell killing is reduced due to the prolonged G2 checkpoint

  13. Effect of scheduled monitoring of liver function during anti-Tuberculosis treatment in a retrospective cohort in China

    OpenAIRE

    Wu Shanshan; Xia Yinyin; Lv Xiaozhen; Zhang Yuan; Tang Shaowen; Yang Zhirong; Tu Dehua; Deng Peiyuan; Cheng Shiming; Wang Xiaomeng; Yuan Yanli; Liu Feiying; Hu Daiyu; Zhan Siyan

    2012-01-01

    Abstract Background Data on effect of regular liver function monitoring during anti-TB treatment is limited in China. This study aimed to evaluate the effects of scheduled liver function monitoring on identification of asymptomatic liver damage and anti-TB treatment outcomes during anti-TB treatment. Methods A retrospective analysis was performed based on a national-level cohort study. A total of 273 patients developing liver dysfunction were divided into two groups, 111 patients who were dia...

  14. Online scheduling & project scheduling

    NARCIS (Netherlands)

    Paulus, Jacob Jan

    2009-01-01

    This thesis presents new and improved scheduling algorithms for a number of scheduling problems. The first part of the thesis deals with two online-list scheduling problems, both with the objective to minimize the makespan. In these problems, the jobs arrive one by one and the decision maker has to

  15. A telemedicine application to schedule temperature in an in vivo sensor network for cancer treatment.

    Science.gov (United States)

    Kamal, Rossi; Hong, Choong Seon; Lee, Seok-Geun

    2012-12-01

    Wireless communication has played a significant role in modern healthcare systems. However, the death toll from chronic diseases, such as cancer, continues to increase. Hyperthermia combined with radiotherapy and/or chemotherapy is a promising strategy for cancer treatment, and temperature control is critical for the success of this intervention. In vivo sensors are an emerging technology in healthcare. Thermal awareness has also received attention in in vivo sensor research. In this context, we have been motivated to use in vivo sensors to regulate the temperature changes in cancer cells during combined treatment. Limitations in existing in vivo thermal-aware routing algorithms motivated us to use the in vivo "lightweight rendezvous routing" approach. However, smartphone-driven telemedicine applications are proliferating to provide remote healthcare and collaborative consultation, required in combined therapies. In this context, we have proposed a telemedicine application where a smartphone not only regulates temperature scheduling in in vivo sensors, but also communicates with local or remote clinicians to maintain collaborative efforts for combined therapies against cancer. PMID:23234425

  16. Current status of high dose rate brachytherapy in cervical cancer in Korea and optimal treatment schedule

    Energy Technology Data Exchange (ETDEWEB)

    Huh, Seung Jae [College of Medicine, Sungkyunkwan Univ., Seoul (Korea, Republic of)

    1998-12-01

    Brachytherapy is an essential part of radiotherapy for uterine cervical cancer. The low dose rate (LDR) regimen has been the major technique of intracavitary therapy for cervical cancer. However, there has been an expansion in the last 20 years of high dose rate (HDR) machines using Ir-192 sources. Since 1979, HDR brachytherapy has been used for the treatment of uterine cervical cancer in Korea. The number of institutions employing HDR has been increasing, while the number of low dose rate system has been constant. In 1995, there was a total 27 HDR brachytherapy units installed and 1258 cases of patients with cervical cancer were treated with HDR. Most common regimens of HDR brachytherapy are total dose of 30-39 Gy at point A with 10-13 fractions in three fractions per week, 24-32 Gy with 6-8 fractions in two fractions per week, and 30-35 Gy with 6-7 fractions in two fractions per week. The average fractionation regimen of HDR brachytherapy is about 8 fractions of 4. 1 Gy each to point A. In Korea, treatment results for HDR brachytherapy are comparable with the LDR series and appears to be a safe and effective alternative to LDR therapy for the treatment of cervical carcinoma. Studies from the major centers report the five-year survival rate of cervical cancer as, 78-86% for Stage I, 68-85% for stage II, and 38-56% for Stage III. World-wide questionnaire study and Japanese questionnaire survey of multiple institutions showed no survival difference in any stages and dose-rate effect ratio (HDR/LDR) was calculated to be 0.54 to 0.58. However, the optimum treatment doses and fractionation schemes appropriate to generate clinical results comparable to conventional LDR schemes have yet to be standardized. In conclusion, HDR intracavitary radiotherapy is increasingly practiced in Korea and an effective treatment modality for cervical cancer. To determine the optimum radiotherapy dose and fractionation schedule, a nation-wide prospective study is necessary in Korea. In

  17. Thematic Research network for emergency and UnScheduled Treatment (TRUST: scoping the potential

    Directory of Open Access Journals (Sweden)

    Edwards Adrian

    2008-01-01

    Full Text Available Abstract Background To identify the benefits of a network in emergency and unscheduled care research, a six week scoping study was undertaken. Objectives were to: draw together stakeholders; identify and prioritise research topics; identify sites for recruitment to studies; and agree a research strategy for a network. Methods A workshop was held to discuss and agree a research strategy based on results from four activities: visits to established research centres in emergency and unscheduled care; a literature overview; interviews with stakeholders in a GP out-of-hours service; and an exploration of the potential for routine data to support research in emergency care. Results Participants attended the workshop from user groups, primary care, the ambulance service, social care, the national telephone based health helpline, the Welsh Assembly Government and the academic sector. Site visits identified opportunities for collaboration. Gaps in knowledge were identified concerning the effectiveness of alternative models of emergency care delivery. Interview data highlighted a lack of evidence related to the quality of out-of-hours provision of primary care. The All Wales Injury Surveillance System (AWISS was found to offer the potential to use routine data to support quantitative studies in emergency care. Three key issues emerged across all activities: working across boundaries; patient involvement; and triage. Conclusion The study included views from patient, provider, policy and academic perspectives and built the case for a research network in emergency care. Now funded, TRUST (Thematic Research network for emergency and UnScheduled Treatment will allow the development of research proposals, building of research teams and recruitment of sites and patients both in Wales and across the UK. It aims to address the imbalance between investment and research in this area and help support provision of 'the right care to the right people at the right time'.

  18. Influence of the treatment schedule on the physicians’ decisions to refer bone metastases patients for palliative radiotherapy: a questionnaire survey of physicians in various specialties

    Science.gov (United States)

    Saito, Tetsuo; Toya, Ryo; Semba, Akiko; Matsuyama, Tomohiko; Oya, Natsuo

    2016-01-01

    ABSTRACT We investigated whether the treatment schedule influences physicians’ decisions to refer their patients for radiotherapy. We presented a questionnaire to 104 physicians in various specialties at three hospitals. It included three hypothetical patients with uncomplicated painful bone metastasis: patients with an expected life span of one year (case 1), 6 months (case 2), and 2 months (case 3). The physicians were asked whether they would refer their patients for radiotherapy when a radiation oncologist presented three different treatment schedules: a short (8 Gy/1 fraction/1 day)-, a medium (20 Gy/5 fractions/1 week)-, and a long (30 Gy/10 fractions/2 weeks) schedule. We used Cochran’s Q-test to compare the percentage of physicians across the three schedules and a mixed-effect logistic model to identify predictors of the selection of only the one-day schedule. Of the 104 physicians, 68 (65%) responded. Of these, 37 (54%), 27 (40%), and 26 (38%) chose to refer patients for radiotherapy when the short-, medium-, and long schedules, respectively, were proposed in case 1 (p = 0.14). These numbers were 44 (65%), 29 (43%), and 15 (22%) for case 2 (p < 0.001), and 59 (87%), 12 (18%), and 1 (1%) for case 3 (p < 0.001). Hypothetical patient and the physicians’ years of practice and perspective regarding side effects were independently predictive of the selection of only the one-day schedule. In conclusion, the treatment schedule influenced the physicians’ decisions to refer patients for radiotherapy.

  19. Can we shorten the overall treatment time in postoperative brachytherapy of endometrial carcinoma? Comparison of two brachytherapy schedules

    International Nuclear Information System (INIS)

    Purpose: To analyze vaginal-cuff relapses (VCR) and toxicity of two brachytherapy (BT) schedules in postoperative endometrial carcinoma and to correlate vaginal toxicity with vaginal-surface-EQD2Gy3 dose (VS-EQD2Gy3). Methods/materials: 319 patients (p) I–IIIC-Figo-stage were treated with 2 BT schedules. One schedule included 166p (Group-1) to whom 3 fractions (Fr) of 4–6 Gy per week (w) of BT were administered after external beam radiotherapy (EBI) (125p) and 6Fr/2w of 4–6 Gy in exclusive-BT (41p). The second schedule included 153p (Group-2) with BT administered daily with 2Fr/w of 5–6 Gy after EBI (94p) and 5–6 Gy/4Fr/w in exclusive-BT (59p). Doses were prescribed at 5 mm from the vaginal surface. Toxicity was evaluated using RTOG scores for the rectum and bladder and objective LENT-SOMA scores for the vagina. Statistics: Chi-square, Fisher and Student’s-t tests. Results: Mean follow-up (months): Group-1: 66.55 (7.73–115.40), Group-2: 41.49 (3.13–87.90). VCR: Group-1: 3p (1.88%); Group-2: 2p (1.3%). No differences were found between the two schedules comparing rectal (p = 0.170), bladder (p = 0.125) and vagina (p = 0.680) late toxicities and comparing vagina EBI + BTp vs. exclusive-BTp (p = 0.667). Significant differences in VS-EQD23Gy were observed considering EBI + BT (Groups 1 + 2) vs. exclusive-BT (Groups 1 + 2) (p < 0.0001); nevertheless, no association was found between VS-EQD23Gy and vaginal complications. Conclusions: No differences were found between the two schedules. No association was found between vaginal toxicity and VS-EQD23Gy. Consequently, treatment with the least number of fractions is preferable

  20. Optimization of the heat treatment schedule for next european dipole (NED) powder in tube $Nb_{3}Sn$ strand

    CERN Document Server

    Boutboul, T; den Ouden, A; Pedrini, D; Volpini, G

    2009-01-01

    A Nb3Sn strand was successfully developed by the company SMI for Next European Dipole (NED) activity and on the basis of Powder-In-Tube (PIT) method. This strand, after the standard reaction recommended by the firm (84 h @ 675 oC), presents attractive performances as a critical current density in the non-copper part of ~ 2500 A/mm2 for 4.2 K and 12 T applied field, an effective filament diameter of ~ 50 μm and limited flux jumps at low magnetic fields. Heat treatment optimization studies are currently performed at CERN to try to optimize the strand electric abilities. For this purpose, various heat treatment schedules were already investigated with a plateau temperature as low as 625 oC. The preliminary results of these studies are summarized here.

  1. Behavioral Interventions in the Treatment of Pathological Gambling: A Review of Activity Scheduling and Desensitization

    Science.gov (United States)

    Dowling, Nicki; Jackson, Alun C.; Thomas, Shane A.

    2008-01-01

    Cognitive and behavioral interventions have been cautiously recommended as "best practice" in the treatment of pathological gambling. Behavioral interventions, using a range of techniques, have been the most commonly evaluated approach to the psychological treatment of pathological gambling. The recent literature evaluating behavioral treatments…

  2. Evaluation of heat treatment schedules for emerald ash borer (Coleoptera: Buprestidae).

    Science.gov (United States)

    Myers, Scott W; Fraser, Ivich; Mastro, Victor C

    2009-12-01

    The thermotolerance of the emerald ash borer, Agrilus planipennis Fairmaire (Coleoptera: Buprestidae), was evaluated by subjecting larvae and prepupae to a number of time-temperature regimes. Three independent experiments were conducted during 2006 and 2007 by heating emerald ash borer infested firewood in laboratory ovens. Heat treatments were established based on the internal wood temperature. Treatments ranged from 45 to 65 degrees C for 30 and 60 min, and the ability of larvae to pupate and emerge as adults was used to evaluate the success of each treatment. A fourth experiment was conducted to examine heat treatments on exposed prepupae removed from logs and subjected to ambient temperatures of 50, 55, and 60 degrees C for 15, 30, 45, and 60 min. Results from the firewood experiments were consistent in the first experiment. Emergence data showed emerald ash borer larvae were capable of surviving a temperatures-time combination up to 60 degrees C for 30 min in wood. The 65 degrees C for 30 min treatment was, however, effective in preventing emerald ash borer emergence on both dates. Conversely, in the second experiment using saturated steam heat, complete mortality was achieved at 50 and 55 degrees C for both 30 and 60 min. Results from the prepupae experiment showed emerald ash borer survivorship in temperature-time combinations up to 55 degrees C for 30 min, and at 50 degrees C for 60 min; 60 degrees C for 15 min and longer was effective in preventing pupation in exposed prepupae. Overall results suggest that emerald ash borer survival is variable depending on heating conditions, and an internal wood temperature of 60 degrees C for 60 min should be considered the minimum for safe treatment for firewood.

  3. Making molehills out of a mountain: experience with a new scheduling strategy to diminish workload variations in response to increased treatment demands

    Science.gov (United States)

    Waters, A.; Alizadeh, M.; Filion, C.; Ashbury, F.; Pun, J.; Chagnon, M.P.; Legrain, A.; Fortin, M.A.

    2016-01-01

    Purpose A new scheduling strategy was implemented. Before implementation, treatments and planning computed tomography (ct) imaging were both scheduled at the same time. Maximal wait times for treatment are defined by the Quebec Ministry of Health’s plan of action according to treatment aim and site. After implementation, patients requiring rapid treatment (priorities 0–3) continued to have their treatments scheduled at the same time as their planning ct; treatments for priority 4 (P4) patients were scheduled only after the treatment plan was approved. That approach aims to compensate for unexpected increases in planning workload by relocating less delay-sensitive cases to other time slots. We evaluated the impact on the patient experience, workload in various sectors, the care team’s perception of care delivery, access to care, and the department’s efficiency in terms of hours worked per treatment delivered. Methods Three periods were defined for analysis: the pre-transitional phase, for baseline evaluation; the transitional phase, during which there was an overlap in the way patients were being scheduled; and the post-transitional phase. Wait times were calculated from the date that patients were ready to treat to the date of their first treatment. Surveys were distributed to pre- and post-transitional phase patients. Care team members were asked to complete a survey evaluating their perception of how the change affected workload and patient care. Operational data were analyzed. Results We observed a 24% increase in the number of treatments delivered in the post-transitional phase. Before implementation, priority 0–3 patients waited a mean of 7.9 days to begin treatments (n = 241); afterward, they waited 6.3 days (n = 340, p = 0.006). Before implementation, P4 patients waited a mean 15.1 days (n = 233); after implementation, they waited 16.1 days (n = 368, p = 0.22). Surveys showed that patients felt that the time it took to inform them of treatment

  4. Ailing and treatment seeking behavior of schedule tribes of Madhya Pradesh, India

    Directory of Open Access Journals (Sweden)

    Sarda Prasad

    2014-01-01

    Full Text Available The highest percentages of tribes are living in North East region of India and in Madhya Pradesh in the central India. This study is based on the NSSO 60 th round data, with the two objectives - Tribal′s ailing and hospitalization pattern and treatment seeking behavior of ailing Madhya Pradesh and India. Result shows that around 7% of Indian tribes were ailing 15 days before the survey and about 10% of them were hospitalized during 365 days before the survey. Rural tribes were more ailing and went to hospital for treatment than urban tribes. Odds ratio show that rural, male, old-aged, educated up to primary, not in labor force, currently married, and Hindu tribes were more likely to be hospitalized in Madhya Pradesh. Odds ratio also depicts that the household that have no drainage, used water from tube well and hand pump were more likely to be ailing.

  5. Cancer treatment scheduling and dynamic heterogeneity in social dilemmas of tumour acidity and vasculature

    OpenAIRE

    Kaznatcheev, Artem; Velde, Robert Vander; Scott, Jacob G.; Basanta, David

    2016-01-01

    Background: Tumours are diverse ecosystems with persistent heterogeneity in various cancer hallmarks like self-sufficiency of growth factor production for angiogenesis and reprogramming of energy-metabolism for aerobic glycolysis. This heterogeneity has consequences for diagnosis, treatment, and disease progression. Methods: We introduce the double goods game to study the dynamics of these traits using evolutionary game theory. We model glycolytic acid production as a public good for all tumo...

  6. Ailing and treatment seeking behavior of schedule tribes of Madhya Pradesh, India

    OpenAIRE

    Sarda Prasad

    2014-01-01

    The highest percentages of tribes are living in North East region of India and in Madhya Pradesh in the central India. This study is based on the NSSO 60 th round data, with the two objectives - Tribal′s ailing and hospitalization pattern and treatment seeking behavior of ailing Madhya Pradesh and India. Result shows that around 7% of Indian tribes were ailing 15 days before the survey and about 10% of them were hospitalized during 365 days before the survey. Rural tribes were more ailing and...

  7. Effects of On-Demand Versus Fixed-Interval Schedules in the Treatment of Chronic Pain With Analgesic Compounds.

    Science.gov (United States)

    Berntzen, Dagfinn; Gotestam, K. Gunnar

    1987-01-01

    Compared the effects of fixed-interval and on-demand administration of analgesic medications in chronic pain patients. A fixed-interval analgesic schedule was found more effective than an on-demand schedule in reducing subjective pain and elevating mood. No differences were found between the two conditions on measures of physical activity.…

  8. The Use of Descriptive Analysis to Identify and Manipulate Schedules of Reinforcement in the Treatment of Food Refusal

    Science.gov (United States)

    Casey, Sean D.; Cooper-Brown, Linda J.; Wacker, David P.; Rankin, Barbara E.

    2006-01-01

    The feeding behaviors of a child diagnosed with failure to thrive were assessed using descriptive analysis methodology to identify the schedules of reinforcement provided by the child's parents. This analysis revealed that the child's appropriate feeding behaviors (i.e., bite acceptance, self-feeding) were on a lean schedule of positive…

  9. Record Schedules

    Data.gov (United States)

    Department of Homeland Security — A records schedule describes FAA records, identifies the records as either temporary or permanent, and provides specific, mandatory instructions for the disposition...

  10. Audit Schedule

    OpenAIRE

    Martinez Pinzon, Christian

    2014-01-01

    [CATALÀ] Audit Schedule és una aplicació web per a la gestió d'auditories al sector de l'aviació privada. Realitzada amb Salesforce per a l'empresa Puck Solutions S.L. [ANGLÈS] Audit Schedule is a web application for managing aduits of the private aviation sector. Performed with Salesforce for the Puck Solutions S.L. company.

  11. A Prospective Cohort Study to Compare Treatment Results Between 2 Fractionation Schedules of High-Dose-Rate Intracavitary Brachytherapy (HDR-ICBT) in Patients With Cervical Cancer

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Eng-Yen [Department of Radiation Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); School of Traditional Chinese Medicine, Chang Gung University College of Medicine, Taiwan (China); Sun, Li-Min [Department of Radiation Oncology, Zuoying Armed Forces General Hospital, Kaohsiung, Taiwan (China); Lin, Hao [Department of Gynecologic Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); Lan, Jen-Hong [Department of Radiation Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); Chanchien, Chan-Chao [Department of Gynecologic Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); Huang, Yu-Jie; Wang, Chang-Yu [Department of Radiation Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China); Wang, Chong-Jong, E-mail: cjw1010@adm.cgmh.org.tw [Department of Radiation Oncology, Kaohsiung Chang Gung Memorial Hospital, Chang Gung University College of Medicine, Kaohsiung, Taiwan (China)

    2013-01-01

    Purpose: To compare the treatment results of 2 fractionation schedules for high-dose-rate intracavitary brachytherapy (HDR-ICBT) in patients with cervical cancer. Methods and Materials: From June 2001 through January 2008, 267 patients with stage IB-IVA cervical cancer were enrolled in the study. All patients underwent 4-field pelvic irradiation and HDR-ICBT. The median central and parametrial doses were 39.6 Gy and 45 Gy, respectively. Patient underwent either 6 Gy Multiplication-Sign 4 (HDR-4) (n=144) or 4.5 Gy Multiplication-Sign 6 (HDR-6) (n=123) to point A of ICBT using {sup 192}Ir isotope twice weekly. The rates of overall survival, locoregional failure, distant metastasis, proctitis, cystitis, and enterocolitis were compared between HDR-4 and HDR-6. Results: There were no significant differences in the demographic data between HDR-4 and HDR-6 except for total treatment time. The 5-year proctitis rates were 23.0% and 21.5% in HDR-4 and HDR-6 (P=.399), respectively. The corresponding rates of grade 2-4 proctitis were 18.7% and 9.6% (P=.060). The corresponding rates of grades 3-4 proctitis were 5.2% and 1.3% (P=.231). Subgroup analysis revealed that HDR-4 significantly increased grade 2-4 proctitis in patients aged {>=}62 years old (P=.012) but not in patients aged <62 years (P=.976). The rates of overall survival, locoregional failure, distant metastasis, cystitis, and enterocolitis were not significantly different between HDR-4 and HDR-6 schedules. Conclusion: The small fraction size of HDR-ICBT is associated with grade 2 proctitis without compromise of prognosis in elderly patients. This schedule is suggested for patients who tolerate an additional 2 applications of HDR-ICBT.

  12. Optimization and Scheduling Toolbox

    OpenAIRE

    Kutil, Michal; Sucha, Premysl; Capek, Roman; Hanzalek, Zdenek

    2010-01-01

    This chapter presents the TORSCHE Scheduling Toolbox for Matlab covering: scheduling on monoprocessor/dedicated processors/parallel processors, open shop/flow shop/job shop scheduling, cyclic scheduling and real-time scheduling. The toolbox includes scheduling algorithms that have been used for various applications as scheduling of Digital Signal Processing algorithms on a hardware architecture with pipelined arithmetic units, scheduling the movements of hoists in a manufacturing environment...

  13. Integrated Control and Scheduling

    OpenAIRE

    Årzén, Karl-Erik; Bernhardsson, Bo; Eker, Johan; Cervin, Anton; Nilsson, Klas; Persson, Patrik; Sha, Lui

    1999-01-01

    The report gives a state-of-the-art survey of the field of integrated control and scheduling. Subtopics discussed are implementation and scheduling of periodic control loops, scheduling under overload, control and scheduling co-design, dynamic task adaptation, feedback scheduling, and scheduling of imprecise calculations. The report also presents the background, motivation, and research topics in the ARTES project Integrated Control and Scheduling.

  14. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

    This "how-to-do-it" manual on the intricacies of school scheduling offers both technical information and common sense advice about the process of secondary school scheduling. The first of six chapters provides an overview of scheduling; chapter 2 examines specific considerations for scheduling; chapter 3 surveys the scheduling models and their…

  15. List scheduling revisited

    OpenAIRE

    J. M. J. Schutten

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem. Furthermore, we prove that an alternative list scheduling algorithm, focusing on the completion times rather than the start times, yields also dominant list schedules for problems with sequence depe...

  16. Scheduling (Dagstuhl Seminar 13111)

    OpenAIRE

    Albers, Susanne; Boxma, Onno J.; Pruhs, Kirk

    2013-01-01

    This report documents the program and the outcomes of Dagstuhl Seminar 13111 "Scheduling". The primary objective of the seminar is to facilitate dialog and collaboration between researchers in two different mathematically-oriented scheduling research communities, the stochastic scheduling and queuing community, and the worst-case approximation scheduling community.

  17. List scheduling revisited

    NARCIS (Netherlands)

    Schutten, J.M.J.

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem. F

  18. Operating System Process Schedulers

    OpenAIRE

    ŠEKORANJA, MATEJ

    2016-01-01

    Process scheduling is one of the key tasks of every operating system. Proper implementation of a scheduler reflects itself in a system responsiveness, especially when processes require execution in real-time. Multimedia playback is one of these processes, also being one of the most common operating system tasks nowadays. In the beginning of this thesis, I present theoretical basics of scheduling: its goals, different scheduling types and basics algorithms. I cover scheduling in single-proces...

  19. Can diet combined with treatment scheduling achieve consistency of rectal filling in patients receiving radiotherapy to the prostate?

    International Nuclear Information System (INIS)

    Background and purpose: This pilot study investigates whether an individualized fluid and fibre prescription combined with a constant treatment can improve rectal filling consistency during radiotherapy. Methods and materials: Fibre, fluid intake and bowel function were assessed in 22 patients at a standard planning scan (SCT) and individualized dietary advice was prescribed to regularize bowel habit. Patients were requested to record frequency and type of bowel movements, fibre and fluid intake daily. Two subsequent CT scans were acquired at 7 (CCT1) and 10 days (CCT2) after SCT at a similar time. Rectal volume and gas were measured planning CT’s and ‘on treatment’ cone beam CT scans. We hypothesised that the difference in volume between CCT1 and CCT2 would be less than the difference between SCT and CCT1. Results: The mean (SD) change in volume between SCT to CCT1 and CCT1 to CCT2 was 5.68 cm3 (26.2) and −8.6 cm3 (40.1), respectively (p = 0.292). Of the 22 patients scanned 20 provided a complete record of dietary intake and bowel motion. The majority of patients either achieved or exceeded prescription. Change in rectal gas was the only correlation with change in rectal volume. Conclusion: Patient self reporting of bowel motion, fibre, fluid intake was achievable but consistency of rectal filling was not improved. Improved understanding of the aetiology and management of rectal gas is indicated.

  20. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

    We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with light...

  1. 45 CFR 96.137 - Payment schedule.

    Science.gov (United States)

    2010-10-01

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

  2. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun;

    2014-01-01

    This paper presents a compositional approach for schedula- bility analysis of hierarchical systems, which enables to prove more sys- tems schedulable by having richer and more detailed scheduling models. We use a lightweight method (statistical model checking) for design ex- ploration, easily...

  3. Dedicated heterogeneous node scheduling including backfill scheduling

    Science.gov (United States)

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

    2006-07-25

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

  4. Mature results of a randomized trial comparing two fractionation schedules of high dose rate endoluminal brachytherapy for the treatment of endobronchial tumors

    International Nuclear Information System (INIS)

    To determine the efficacy of high dose rate endobronchial brachytherapy (HDR-BT) for the treatment of centrally located lung tumors, two different fractionation schedules were compared regarding local tumor response, side effects and survival. Mature retrospective results with longer follow-up and more patients were analyzed. Initial results were published by Huber et al. in 1995. 142 patients with advanced, centrally located malignant tumors with preferential endoluminal growth were randomized to receive 4 fractions of 3.8 Gy (time interval: 1 week, n = 60, group I) or 2 fractions of 7.2 Gy (time interval: 3 weeks, n = 82, group II) endobronchial HDR-BT. Age, gender, tumor stage, Karnofsky Performance Score and histology were equally distributed between both groups. Local tumor response with 2 fractions of 7.2 Gy was significantly higher as compared to 4 fractions of 3.8 Gy (median 12 vs. 6 weeks; p ≤ 0.015). Median survival was similar in both groups (19 weeks in the 4 fractions group vs. 18 weeks in the 2 fractions group). Fatal hemoptysis was less frequent following irradiation with 2 × 7.2 Gy than with 4 × 3.8 Gy, although the difference did not achieve statistical significance (12.2% vs. 18.3%, respectively. p = 0,345). Patients presenting with squamous cell carcinoma were at higher risk of bleeding compared to other histology (21.9% vs. 9%, p = 0,035). Multivariate analysis with regard to overall survival, revealed histology (p = 0.02), Karnofsky Performance Score (p < 0.0001) and response to therapy (p < 0.0001) as significant prognostic factors. For patients showing complete response the median survival was 57 weeks, while for patients with progressive disease median survival time was 8 weeks, p < 0.0001. The KPS at the start of the treatment was significantly correlated with survival. Patients presenting with a KPS ≤ 60 at the start had a significantly (p = 0,032) shorter survival time (10 weeks) than patients with a KPS > 60 (29 weeks). Moreover

  5. Childhood Immunization Schedule

    Science.gov (United States)

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

  6. Reinforcement learning in scheduling

    Science.gov (United States)

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

    1994-01-01

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

  7. Scheduling in polling systems

    OpenAIRE

    Wierman, AC; Winands, EMM Erik; Boxma, OJ Onno

    2007-01-01

    We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive poll...

  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 w

  9. Scheduling PVM Tasks

    Institute of Scientific and Technical Information of China (English)

    鞠九滨; 王勇; 等

    1997-01-01

    This paper describes a PVM task scheduler designed and implemented by the authors.The scheduler supports selecting idle workstations,scheduling pool tasks and dynamically produced subtasks.It can improve resource utilization,reduce job response time and simplify programming.

  10. DSN Scheduling Engine

    Science.gov (United States)

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

    2008-01-01

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

  11. A comparative study of itraconazole in various dose schedules in the treatment of pulmonary aspergilloma in treated patients of pulmonary tuberculosis

    Directory of Open Access Journals (Sweden)

    Prahlad Rai Gupta

    2015-01-01

    Full Text Available Introduction: The optimal dose, duration, and efficacy of itraconazole in Indian patients of pulmonary aspergilloma (PA are not clearly defined. Therefore, a study was carried out, to resolve these issues in diagnosed cases of PA complicating old treated patients of pulmonary tuberculosis. Materials and Methods: The study patients randomly received itraconazole either in a fixed dose schedule of 200 mg (group I, 200 mg twice daily (group II or a variable dose schedule (group III, for 12 months. All the patients were followed up for the entire duration of the study for clinical, radiological, and immunological response. The side effects were recorded as and when reported by the patients and managed symptomatically. Results: A total of 60 patients were enrolled, 20, in each group. There were no intergroup differences with regard to age, sex, body weight, smoking status, alcohol intake, symptoms, Potassium hydroxide (KOH mount, fungal culture, pattern of radiological lesions or anti-aspergillus antibodies (anti-Asp-Ab titers. The radiological response was poor in group I patients, as compared to the other groups, at two months (P < 0.05. The dose of itraconazole was increased in five of the patients in group I due to poor response. A higher number of group II patients suffered side effects and the dose of itraconazole had to be decreased in three of these patients, but none of the patients on a variable dose schedule required a change in dose schedule. Conclusion: Thus, a weight-based variable dose schedule of itraconazole was found to be a more effective and safer modality in the management of PA than a fixed dose schedule.

  12. Flight Crew Scheduling

    OpenAIRE

    Graves, Glenn W.; Richard D. McBride; Ira Gershkoff; Diane Anderson; Deepa Mahidhara

    1993-01-01

    A new crew scheduling optimization system has been developed for United Airlines. The system was developed to permit quick response to schedule changes and to reduce crew scheduling costs. It was designed to work efficiently for both the medium sized problems (300 flights daily) and the very large problems (1,700 flights daily) that United must solve. The system has two main components, a generator and an optimizer. The generator creates pairings (candidate crew trips) which are fed as variab...

  13. A study of recompression treatment schedule for treating type Ⅰ decompression illness with medical hyperbaric chamber pressurized%应用医用空气加压氧舱治疗Ⅰ型减压病探讨

    Institute of Scientific and Technical Information of China (English)

    管亚东; 王震; 李东升; 方以群; 黄志强

    2011-01-01

    Objective To observe the therapic effects of the recompression treatment schedule D2 (breathing 100% oxygen at 0.12 MPa gauge pressure) on the type Ⅰ decompression illness (DCI) by hyperbaric chamber pressurized with air. Methods The recompression treatment schedule D2 was from the decompression treatment tables of in Germany BGI690. Seven cases on work site group (work site group) and five cases in hospital (hospital group) were treated using recompression treatment. All cases suffered from type I DCI after normal decompression procedures from working in compressed air in tunnel construction. These patients were treated with basic schedule D2 or extended schedule D2 according to the symptoms of the cases responded to recompression therapy. Results In the work site group, the pains of joints, arms and legs were released quickly, the therapic effects appeared at (8.1 ±8.1 )min, the cases were cured with a recompression therapy of basic schedule D2, the total mean time of treatment was (150 ±0.0) min. In the hospital group, the pains of joints, arms and legs disapeared slowly, the therapic effects appeared at (115.0 ±60.0) min, the cases were cured with a recompession therapy of extended schedule D2, the total mean time of treatment was (270.0±0.0) min, which was significantly longer than that in the work site group (P加压治疗表D2方案(0.12MPa表压、吸氧)治疗Ⅰ型减压病,观察其疗效.方法 现场加压治疗组患者7例,医院加压治疗组患者5例,均从事隧道工程压缩空气环境作业执行规定减压程序后患Ⅰ型减压病,根据加压治疗反应选用基本D2方案或延长D2方案.结果 现场加压治疗组患者肌肉关节痛消除快,平均加压治疗起效时间为(8.1±8.1)min,使用基本D2方案1次加压治疗治愈,平均加压治疗总时间为(150.0±0.0)min;医院加压治疗组患者肌肉关节痛消除慢,平均加压治疗起效时间为(115.0±60.0)min,使用延长D2方案1次加压治疗治愈,平

  14. Block Scheduling Revisited.

    Science.gov (United States)

    Queen, J. Allen

    2000-01-01

    Successful block scheduling depends on provision of initial and ongoing instructional training. Teaching strategies should vary and include cooperative learning, the case method, the socratic seminar, synectics, concept attainment, the inquiry method, and simulations. Recommendations for maximizing block scheduling are outlined. (Contains 52…

  15. Interval Scheduling: A Survey

    NARCIS (Netherlands)

    Kolen, A.W.J.; Lenstra, J.K.; Papadimitriou, C.H.; Spieksma, F.C.R.

    2007-01-01

    In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability o

  16. Surviving Block Scheduling.

    Science.gov (United States)

    Haley, Marjorie

    A discussion of block scheduling for second language instruction looks at the advantages and disadvantages and offers some suggestions for classroom management and course organization. It is argued that block scheduling may offer a potential solution to large classes, insufficient time for labs, too little individualized instruction; few…

  17. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

  19. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

    Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…

  20. Trimester Schedule. Research Brief

    Science.gov (United States)

    Education Partnerships, Inc., 2012

    2012-01-01

    Why do a trimester schedule? With the advent of block scheduling, many high schools conducted research on utilizing that plan in a trimester format. There appeared to be three issues that most schools faced: (1) How to provide substantive instructional time that was not fragmented?; (2) How does the school climate contribute positively to…

  1. DSN Resource Scheduling

    Science.gov (United States)

    Wang, Yeou-Fang; Baldwin, John

    2007-01-01

    TIGRAS is client-side software, which provides tracking-station equipment planning, allocation, and scheduling services to the DSMS (Deep Space Mission System). TIGRAS provides functions for schedulers to coordinate the DSN (Deep Space Network) antenna usage time and to resolve the resource usage conflicts among tracking passes, antenna calibrations, maintenance, and system testing activities. TIGRAS provides a fully integrated multi-pane graphical user interface for all scheduling operations. This is a great improvement over the legacy VAX VMS command line user interface. TIGRAS has the capability to handle all DSN resource scheduling aspects from long-range to real time. TIGRAS assists NASA mission operations for DSN tracking of station equipment resource request processes from long-range load forecasts (ten years or longer), to midrange, short-range, and real-time (less than one week) emergency tracking plan changes. TIGRAS can be operated by NASA mission operations worldwide to make schedule requests for the DSN station equipment.

  2. Disk Scheduling: Selection of Algorithm

    OpenAIRE

    Yashvir, S.; Prakash, Om

    2012-01-01

    The objective of this paper is to take some aspects of disk scheduling and scheduling algorithms. The disk scheduling is discussed with a sneak peak in general and selection of algorithm in particular.

  3. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

    Full Text Available This study examined the effects of a tri-schedule on the academic achievement of students in a high school. The tri-schedule consists of traditional, 4x4 block, and hybrid schedules running at the same time in the same high school. Effectiveness of the schedules was determined from the state mandated test of basic skills in reading, language, and mathematics. Students who were in a particular schedule their freshman year were tested at the beginning of their sophomore year. A statistical ANCOVA test was performed using the schedule types as independent variables and cognitive skill index and GPA as covariates. For reading and language, there was no statistically significant difference in test results. There was a statistical difference mathematics-computation. Block mathematics is an ideal format for obtaining more credits in mathematics, but the block format does little for mathematics achievement and conceptual understanding. The results have content specific implications for schools, administrations, and school boards who are considering block scheduling adoption.

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

  5. Quantitative analysis of performance on a progressive-ratio schedule: effects of reinforcer type, food deprivation and acute treatment with Δ⁹-tetrahydrocannabinol (THC).

    Science.gov (United States)

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

    2015-04-01

    Rats' performance on a progressive-ratio schedule maintained by sucrose (0.6M, 50 μl) and corn oil (100%, 25 μl) reinforcers was assessed using a model derived from Killeen's (1994) theory of schedule-controlled behaviour, 'Mathematical Principles of Reinforcement'. When the rats were maintained at 80% of their free-feeding body weights, the parameter expressing incentive value, a, was greater for the corn oil than for the sucrose reinforcer; the response-time parameter, δ, did not differ between the reinforcer types, but a parameter derived from the linear waiting principle (T0), indicated that the minimum post-reinforcement pause was longer for corn oil than for sucrose. When the rats were maintained under free-feeding conditions, a was reduced, indicating a reduction of incentive value, but δ was unaltered. Under the food-deprived condition, the CB1 cannabinoid receptor agonist Δ(9)-tetrahydrocannabinol (THC: 0.3, 1 and 3 mg kg(-1)) increased the value of a for sucrose but not for corn oil, suggesting a selective enhancement of the incentive value of sucrose; none of the other parameters was affected by THC. The results provide new information about the sensitivity of the model's parameters to deprivation and reinforcer quality, and suggest that THC selectively enhances the incentive value of sucrose. PMID:25637881

  6. The GBT Dynamic Scheduling System: An Update

    Science.gov (United States)

    Clark, M. H.; Balser, D. S.; Braatz, J.; Condon, J.; Creager, R. E.; McCarty, M. T.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2011-07-01

    The Robert C. Byrd Green Bank Telescope's (GBT) Dynamic Scheduling System (DSS), in production use since September 2009, was designed to maximize observing efficiency while maintaining the GBT's flexibility, improving data quality, and minimizing any undue adversity for the observers. Using observing criteria, observer availability and qualifications, three-dimensional weather forecasts, and telescope state, the DSS software is capable of optimally scheduling observers 24 to 48 hours in advance on a telescope having a wide-range of capabilities in a geographical location with variable weather patterns. Recent improvements for the GBT include an expanded frequency coverage (0.390-90 GHz), proper treatment of fully sampled array receivers, increasingly diverse observing criteria, the ability to account for atmospheric instability from clouds, and new tools for scheduling staff to control and interact with generated schedules and the underlying database.

  7. Agent Based Patient Scheduling Using Heuristic Algorithm

    Directory of Open Access Journals (Sweden)

    Juliet A Murali

    2010-01-01

    Full Text Available This paper describes about an agent based approach to patient scheduling using experience based learning. A heuristic algorithm is also used in the proposed framework. The evaluation on different learning techniques shows that the experience based learning (EBL gives better solution. The processing time decreases as the experience increases. The heuristic algorithm make use of EBL in calculating the processing time. The main objective of this patient scheduling system is to reduce the waiting time of patient in hospitals and to complete their treatment in minimum required time. The framework is implemented in JADE. In this approach the patients and resources are represented as patient agents (PA and resource agents (RA respectively. Even though mathematical model give optimal solution, the computational complexity increases for large size problems. Heuristic solution gives better solution for large size problems. The comparisons of the proposed framework with other scheduling rules shows that an agent based approach to patient scheduling using EBL is better.

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

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

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

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

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

  13. CERN confirms LHC schedule

    CERN Multimedia

    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.

  14. Business Service Scheduling

    OpenAIRE

    Jürgen Dorn

    2010-01-01

    The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operatio...

  15. Decentralized Ground Staff Scheduling

    OpenAIRE

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff 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 sta...

  16. Pushing schedule derivation method

    Energy Technology Data Exchange (ETDEWEB)

    Henriquez, B. [Compania Siderurgica Huachipato S.A., Talcahuano (Chile)

    1996-12-31

    The development of a Pushing Schedule Derivation Method has allowed the company to sustain the maximum production rate at CSH`s Coke Oven Battery, in spite of having single set oven machinery with a high failure index as well as a heat top tendency. The stated method provides for scheduled downtime of up to two hours for machinery maintenance purposes, periods of empty ovens for decarbonization and production loss recovery capability, while observing lower limits and uniformity of coking time.

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

  18. Effects on nurse retention. An experiment with scheduling.

    Science.gov (United States)

    Choi, T; Jameson, H; Brekke, M L; Podratz, R O; Mundahl, H

    1986-11-01

    Four randomly selected nursing groups were assigned to three experimental groups and one control group to test the relative impact of three experimental nursing schedules, using a before-after design. The three experimental treatments were straight shifts; regular schedule but with unlimited requests for changes; and individual station-designed schedules. Before treatment, score differences between the experimental and control groups were limited to one of 36 highly reliable scales specifically constructed and pretested to gauge effects of scheduling. This single difference was judged not to be significantly related to experimental outcomes. Because of a poor job market situation, retention was not affected significantly by any of the three treatments, but root causes of turnover were. Results of the experiment showed that individual station-designed schedules triggered the most changes that favor retention. In contrast, the other two treatments unexpectedly increased nurses' own sense of marketability and reduced teamwork among nurses. Reasons accounting for the results are discussed in the text.

  19. Static Scheduling Strategies for Heterogeneous Systems

    OpenAIRE

    Olivier Beaumont; Arnaud Legrand; Yves Robert

    2012-01-01

    In this paper, we consider static scheduling techniques for heterogeneous systems, such as clusters and grids. We successively deal with minimum makespan scheduling, divisible load scheduling and steady-state scheduling. Finally, we discuss the limitations of static scheduling approaches.

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

  1. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

    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

  2. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...... on the problems needed to be solved. The solution methods applied to the problems cover dynamic programming for multi constrained shortest paths, Branch-and-cut for liner shipping, Simulated annealing for transporting assisted passengers in airports, branch-cut-and-price for vehicle routing with time windows...

  3. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...... 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...... Heathrow Airport. This study shows that decentralization generally increases the number of staff needed compared to centralized planning. The case study also shows that there is a trade-off between the extra staff needed and the quality of the stand allocation. Furthermore, the robustness of solutions...

  4. Customer Appeasement Scheduling

    OpenAIRE

    Nikseresht, Mohammad R; Somayaji, Anil; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connec...

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

    Science.gov (United States)

    2010-07-22

    ... Internal Revenue Service Proposed Collection; Comment Request for Form 1065, Schedule C, Schedule D, Schedule K-1, Schedule L, Schedule M-1, Schedule M-2, and Schedule M-3 AGENCY: Internal Revenue Service...)). Currently, the IRS is soliciting comments concerning Form 1065 (U.S. Return of Partnership Income),...

  6. CMS multicore scheduling strategy

    Science.gov (United States)

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

    2014-06-01

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

  7. Schedulers are no Prophets

    NARCIS (Netherlands)

    Hartmanns, Arnd; Hermanns, Holger; Krčál, Jan

    2016-01-01

    Several formalisms for concurrent computation have been proposed in recent years that incorporate means to express stochastic continuous-time dynamics and non-determinism. In this setting, some obscure phenomena are known to exist, related to the fact that schedulers may yield too pessimistic verifi

  8. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

    The CERN Council held its 125th session under the chairmanship of Professor Maurice Bourquin. Highlights of the meeting included confirmation that the Large Hadron Collider (LHC) and its detectors are on schedule for a 2007 start-up, and that the LHC computing grid (LCG) project is about to reach a major milestone (1 page).

  9. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Calero Yzquierdo, Antonio [Madrid, CIEMAT; Hernandez, Jose [Madrid, CIEMAT; Holzman, Burt [Fermilab; Majewski, Krista [Fermilab; McCrea, Alison [UC, San Diego

    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.

  10. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

    Franses, Philip; Post, Gerhard; Burke, Edmund; De Causmaecker, Patrick

    2003-01-01

    We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We d

  11. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    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.

  12. Class Schedules--Computer Loaded or Student Self-Scheduled?

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

    In the two-step process of student scheduling, the initial phase of course selection is the most important. At Chesterton High School in Indiana, student self-scheduling is preferred over computer loading. (Author/MLF)

  13. Schedulability analysis for linear transactions under fixed priority hybrid scheduling

    Institute of Scientific and Technical Information of China (English)

    Zhi-gang GAO; Zhao-hui WU

    2008-01-01

    In hard real-time systems, schedulability analysis is not only one of the important means of guaranteeing the timelines of embedded software but also one of the fundamental theories of applying other new techniques, such as energy savings and fault tolerance. However, most of the existing schedulability analysis methods assume that schedulers use preemptive scheduling or non-preemptive scheduling. In this paper, we present a schedulability analysis method, i.e., the worst-case hybrid scheduling (WCHS) algorithm, which considers the influence of release jitters of transactions and extends schedulability analysis theory to timing analysis of linear transactions under fixed priority hybrid scheduling. To the best of our knowledge, this method is the first one on timing analysis of linear transactions under hybrid scheduling. An example is employed to demonstrate the use of this method. Experiments show that this method has lower computational complexity while keeping correctness, and that hybrid scheduling has little influence on the average worst-case response time (WCRT), but a negative impact on the schedulability of systems.

  14. The impact of system level factors on treatment timeliness: utilizing the Toyota Production System to implement direct intake scheduling in a semi-rural community mental health clinic.

    Science.gov (United States)

    Weaver, Addie; Greeno, Catherine G; Goughler, Donald H; Yarzebinski, Kathleen; Zimmerman, Tina; Anderson, Carol

    2013-07-01

    This study examined the effect of using the Toyota Production System (TPS) to change intake procedures on treatment timeliness within a semi-rural community mental health clinic. One hundred randomly selected cases opened the year before the change and 100 randomly selected cases opened the year after the change were reviewed. An analysis of covariance demonstrated that changing intake procedures significantly decreased the number of days consumers waited for appointments (F(1,160) = 4.9; p = .03) from an average of 11 to 8 days. The pattern of difference on treatment timeliness was significantly different between adult and child programs (F(1,160) = 4.2; p = .04), with children waiting an average of 4 days longer than adults for appointments. Findings suggest that small system level changes may elicit important changes and that TPS offers a valuable model to improve processes within community mental health settings. Results also indicate that different factors drive adult and children's treatment timeliness.

  15. Effects of acute and chronic aripiprazole treatment on choice between cocaine self-administration and food under a concurrent schedule of reinforcement in rats

    DEFF Research Database (Denmark)

    Thomsen, Morgane; Fink-Jensen, Anders; Woldbye, David;

    2008-01-01

    the hypothesis that aripiprazole, both as acute and as chronic treatment, would preferentially decrease cocaine self-administration while sparing behavior maintained by a natural reinforcer, resulting in a shift in the allocation of behavior from cocaine-taking towards the alternative reinforcer. MATERIALS...... performance in the choice procedure was assessed daily. RESULTS: An intermediate dose of aripiprazole decreased cocaine self-administration and shifted the cocaine choice curve to the right as an acute treatment. However, as a chronic treatment, aripiprazole failed to decrease cocaine self-administration...... or cocaine choice, despite a dose-dependent decrease in overall response rates and food-maintained behavior. CONCLUSIONS: Our results confirm and extend earlier findings and indicate that acute administration of aripiprazole can decrease cocaine self-administration. However, based on the present data...

  16. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... Immunization Schedules Recommended Child and Adolescent Immunization Schedules History of the Vaccine Schedule Children's Hospital of Philadelphia's Vaccine Education Center Get Email Updates To receive email updates ...

  17. CPU Scheduling Algorithms: A Survey

    OpenAIRE

    Imran Qureshi

    2014-01-01

    Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, ...

  18. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

    Full Text Available In this paper the authors propose modified proportional share scheduling algorithm considering the characteristics of continuous media such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and decreases the number of context switching. Proposed scheduling algorithm is evaluated using several numerical tests under various conditions, especially overloaded situation.

  19. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

    Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…

  20. RESCON: Educational project scheduling software

    OpenAIRE

    Deblaere, Filip; Demeulemeester, Erik; Herroelen, Willy

    2011-01-01

    In this article we discuss a freely downloadable educational software tool for illustrating project scheduling and project management concepts. The tool features exact and heuristic scheduling procedures and visualizes project networks, project schedules, resource profiles, activity slacks, and project duration distributions.

  1. Surprise Benefits of Arena Scheduling

    Science.gov (United States)

    Surloff, Andrew

    2008-01-01

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

  2. Scheduling a C-Section

    Science.gov (United States)

    ... Pregnancy > Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill in all fields. Please enter ... and develop before she’s born. Why can scheduling a c-section for non-medical reasons be a ...

  3. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been the predomin......The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... 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...

  4. Revisiting conjugate schedules.

    Science.gov (United States)

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

    2015-07-01

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

  5. Observation Scheduling System

    Science.gov (United States)

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

    2011-01-01

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

  6. Revisiting conjugate schedules.

    Science.gov (United States)

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

    2015-07-01

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

  7. 08071 Abstracts Collection -- Scheduling

    OpenAIRE

    Jane W. S. Liu; Rolf H. Möhring; Pruhs, Kirk

    2008-01-01

    From 10.02. to 15.02., the Dagstuhl Seminar 08071 ``Scheduling'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in gen...

  8. 10071 Abstracts Collection -- Scheduling

    OpenAIRE

    Albers, Susanne; Baruah, Sanjoy K; Rolf H. Möhring; Pruhs, Kirk

    2010-01-01

    From 14.02. to 19.02.2010, the Dagstuhl Seminar 10071 ``Scheduling '' was held in Schloss Dagstuhl-Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to ext...

  9. University employees work schedule

    OpenAIRE

    Basagoiti Alcázar, Javier

    2015-01-01

    The aim of this project is to create a website which is useful both employees and students of a university, so employees can add information, if they log in with username and password access, and students can view this information . Employees may modify and display information such as title, room, or their faculty (from a list defined by the administrator), and most importantly, their schedule, whether class, tutoring, free time, or any of tasks that the administrator define. There will be a ...

  10. Scheduled denoising autoencoders

    OpenAIRE

    Geras, Krzysztof J.; Sutton, Charles

    2014-01-01

    We present a representation learning method that learns features at multiple different levels of scale. Working within the unsupervised framework of denoising autoencoders, we observe that when the input is heavily corrupted during training, the network tends to learn coarse-grained features, whereas when the input is only slightly corrupted, the network tends to learn fine-grained features. This motivates the scheduled denoising autoencoder, which starts with a high level of noise that lower...

  11. Scheduled Denoising Autoencoders

    OpenAIRE

    Geras, Krzysztof; Sutton, Charles

    2015-01-01

    We present a representation learning method that learns features at multiple different levels of scale. Working within the unsupervised framework of denoising autoencoders, we observe that when the input is heavily corrupted during training, the network tends to learn coarse-grained features, whereas when the input is only slightly corrupted, the network tends to learn fine-grained features. This motivates the scheduled denoising autoencoder, which starts with a high level of noise that lower...

  12. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. 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 multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  13. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connection. We think that OS should become intelligent to distinguish between different processes and allocate resources, including CPU, to those processes which need them most. In this work, as a first step to make the OS aware of the current state of the system, we consider process dependencies and interprocess communications. We are developing a model, which considers the need to satisfy interactive users and other possible remote users or customers, by making scheduling decisions based on process dependencies and interproce...

  14. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    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. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

    Full Text Available This paper deals with the representation of scheduling results and it introduces a new tool for visualization and simulation in time scheduling called VISIS. The purpose of this tool is to provide an environment for visualization, e.g. in production line scheduling. The simulation also proposes a way to simulate the influence of a schedule on a user defined system, e.g. for designing filters in digital signal processing. VISIS arises from representing scheduling results using the well-known Gantt chart. The application is implemented in the Matlab programming environment using Simulink and the Virtual Reality toolbox. 

  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. Scheduled Intermittent Screening with Rapid Diagnostic Tests and Treatment with Dihydroartemisinin-Piperaquine versus Intermittent Preventive Therapy with Sulfadoxine-Pyrimethamine for Malaria in Pregnancy in Malawi: An Open-Label Randomized Controlled Trial

    Science.gov (United States)

    Madanitsa, Mwayiwawo; Kalilani, Linda; Mwapasa, Victor; van Eijk, Anna M.; Khairallah, Carole; Ali, Doreen; Pace, Cheryl; Smedley, James; Thwai, Kyaw-Lay; Levitt, Brandt; Kang’ombe, Arthur; Faragher, Brian; Taylor, Steve M.; Meshnick, Steve; ter Kuile, Feiko O.

    2016-01-01

    Background In Africa, most plasmodium infections during pregnancy remain asymptomatic, yet are associated with maternal anemia and low birthweight. WHO recommends intermittent preventive therapy in pregnancy with sulfadoxine-pyrimethamine (IPTp-SP). However, sulfadoxine-pyrimethamine (SP) efficacy is threatened by high-level parasite resistance. We conducted a trial to evaluate the efficacy and safety of scheduled intermittent screening with malaria rapid diagnostic tests (RDTs) and treatment of RDT-positive women with dihydroartemisinin-piperaquine (DP) as an alternative strategy to IPTp-SP. Methods and Findings This was an open-label, two-arm individually randomized superiority trial among HIV-seronegative women at three sites in Malawi with high SP resistance. The intervention consisted of three or four scheduled visits in the second and third trimester, 4 to 6 wk apart. Women in the IPTp-SP arm received SP at each visit. Women in the intermittent screening and treatment in pregnancy with DP (ISTp-DP) arm were screened for malaria at every visit and treated with DP if RDT-positive. The primary outcomes were adverse live birth outcome (composite of small for gestational age, low birthweight [<2,500 g], or preterm birth [<37 wk]) in paucigravidae (first or second pregnancy) and maternal or placental plasmodium infection at delivery in multigravidae (third pregnancy or higher). Analysis was by intention to treat. Between 21 July 2011 and 18 March 2013, 1,873 women were recruited (1,155 paucigravidae and 718 multigravidae). The prevalence of adverse live birth outcome was similar in the ISTp-DP (29.9%) and IPTp-SP (28.8%) arms (risk difference = 1.08% [95% CI −3.25% to 5.41%]; all women: relative risk [RR] = 1.04 [95% CI 0.90–1.20], p = 0.625; paucigravidae: RR = 1.10 [95% CI 0.92–1.31], p = 0.282; multigravidae: RR = 0.92 [95% CI 0.71–1.20], p = 0.543). The prevalence of malaria at delivery was higher in the ISTp-DP arm (48.7% versus 40.8%; risk difference

  18. Follicular development, plasma Inhibin‑A and Estradiol-17-beta concentrations in Buffalo cows during different treatment schedules for MOET programs

    Directory of Open Access Journals (Sweden)

    L. Todini

    2010-02-01

    Full Text Available Buffalo cows were submitted to three superovulatory treatments. T1 (n = 7: PRID for 10 days (d0-d9 plus decreasing doses of 500 IU FSH/LH (12 h-intervals d7‑d10; T2 (n = 8: PRID for 11 d (d0-d10 plus 2000 IU PMSG at d7; T3 (n = 9: PRID for 11 d plus 2000 IU PMSG at d7 and decreasing doses of 175 IU FSH/LH (12 h-intervals d10‑ d11. Overall plasma inhibin‑A (In-A concentrations correlated with large follicles (LF, diameter >6mm, R=0.83, P10 mm at d12- 13 (T1=5.0+/-1.4, T2=1.2+/-0.9, T3=8.3+/-2.3. In-A concentrations significantly rised at d11-13 of T1 and T3. In-A seems a good indicator of the follicular development during superovulation in buffalo cows, while E2 is not. Furthermore T3 was followed by better ovarian follicular responses.

  19. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

    There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days.These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.

  20. Clinical outcome of stereotactic body radiotherapy for primary and oligometastatic lung tumors: a single institutional study with almost uniform dose with different five treatment schedules

    International Nuclear Information System (INIS)

    To evaluate clinical outcomes of stereotactic body radiotherapy (SBRT) for localized primary and oligometastatic lung tumors by assessing efficacy and safety of 5 regimens of varying fraction size and number. One-hundred patients with primary lung cancer (n = 69) or oligometastatic lung tumors (n = 31), who underwent SBRT between May 2003 and August 2010, were included. The median age was 75 years (range, 45–88). Of them, 98 were judged to have medically inoperable disease, predominantly due to chronic illness or advanced age. SBRT was performed using 3 coplanar and 3 non-coplanar fixed beams with a standard linear accelerator. Fraction sizes were escalated by 1 Gy, and number of fractions given was decreased by 1 for every 20 included patients. Total target doses were between 50 and 56 Gy, administered as 5–9 fractions. The prescribed dose was defined at the isocenter, and median overall treatment duration was 10 days (range, 5–22). The median follow-up was 51.1 months for survivors. The 3-year local recurrence rates for primary lung cancer and oligometastasis was 6 % and 3 %, respectively. The 3-year local recurrence rates for tumor sizes ≤3 cm and >3 cm were 3 % and 14 %, respectively (p = 0.124). Additionally, other factors (fraction size, total target dose, and BED10) were not significant predictors of local control. Radiation pneumonia (≥ grade 2) was observed in 2 patients. Radiation-induced rib fractures were observed in 22 patients. Other late adverse events of greater than grade 2 were not observed. Within this dataset, we did not observe a dose response in BED10 values between 86.4 and 102.6 Gy. SBRT with doses between 50 and 56 Gy, administered over 5–9 fractions achieved acceptable tumor control without severe complications

  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

    In a modern society, manpower can be both a scarce and an expensive resource. Skilled personnel is usually in high demand and accounts for a significant part of total expenses in many companies. When the work is divided in shifts, a roster is compiled to allocate these to the employees. The roste......In a modern society, manpower can be both a scarce and an expensive resource. Skilled personnel is usually in high demand and accounts for a significant part of total expenses in many companies. When the work is divided in shifts, a roster is compiled to allocate these to the employees...... 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...... to scheduling problems with temporal dependencies between tasks. However, these problems appear in various contexts and with different properties. A group of the problems considered are related to vehicle routing problems, where transportation and time windows are important factors that must be accounted for...

  3. A Feedback Macro- Scheduler

    Institute of Scientific and Technical Information of China (English)

    SamuelT.Chanson; PromS.Sinha

    1989-01-01

    A multi-class macro-scheduler is described in this paper. The scheduler periodicaily determines the number of jobs from each class that should be activated to minircdze a weighted som of the mean system residence time without satvrating the .systern. The compatation is based on the estimated system workload in the next interval. Thus it is adaptive to workload variation. The service provided to each class (specifically, the mean response time) may be adjusted by changing the weight associated with the job class. The schere is based on. mathematical modelling. The solution is obtained through the use of queuing theory, operational analysis and optimization theory. Exponential smoothing techniqne is employed to reduce the error of estimating the value of the model pararneters. Simulation resuflts show the scheme to be both stable and robust. Performanee iutprovemeat over some of the eristing schemes (the 50%, L=S and the Knee criteria) is significant under some workloads. The overhead involved in its implementation is aoceptable and the errors due to some of the assumptions used in the formalation and solution of the model are discussed.

  4. Program cost and schedule baseline

    International Nuclear Information System (INIS)

    The overall purpose of cost and schedule baseline management is to ensure that the Civilian Radioactive Waste Management (OCRWM) Program's cost and schedule plan are controlled in an orderly, efficient, and documented manner. Baseline control of the Program's cost and schedule will result in changes that only take place with OCRWM senior management approval, by way of the change control process. The Program Management System (PMS) Manual describes how the Program Cost and Schedule Baseline (PCSB) is integrated into the OCRWM management system. This PCSB document identifies the components of Program cost and schedule that will be subject to change control by DOE-Headquarters and establishes their baseline values. This document also summarizes the management components of the cost and schedule baseline, including reporting, monitoring, and corrective action. Detailed PCSB reporting, monitoring, and corrective action procedures will be issued as an Office of Program Administration and Resource Management (OPARM) administrative procedure. 9 figs

  5. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

    The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.

  6. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Godskesen, Jens Christian; Hermanns, Holger;

    2015-01-01

    distribution equivalence is implied for partial information schedulers, and compositionality is preserved by distributed schedulers. The intersection of the two scheduler classes thus spans a coarser and still reasonable compositional theory of behavioral semantics.......Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popularity as the coarsest behavioral equivalence enjoying valuable properties like preservation of trace distribution equivalence and compositionality...

  7. Minimizing metastatic risk in radiotherapy fractionation schedules

    Science.gov (United States)

    Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin

    2015-11-01

    Metastasis is the process by which cells from a primary tumor disperse and form new tumors at distant anatomical locations. The treatment and prevention of metastatic cancer remains an extremely challenging problem. This work introduces a novel biologically motivated objective function to the radiation optimization community that takes into account metastatic risk instead of the status of the primary tumor. In this work, we consider the problem of developing fractionated irradiation schedules that minimize production of metastatic cancer cells while keeping normal tissue damage below an acceptable level. A dynamic programming framework is utilized to determine the optimal fractionation scheme. We evaluated our approach on a breast cancer case using the heart and the lung as organs-at-risk (OAR). For small tumor α /β values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger α /β values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the α /β values of the OARs, and the normal tissue sparing factors. Interestingly, in contrast to standard models, hypo-fractionated and semi-hypo-fractionated schedules (large initial doses with doses tapering off with time) were suggested even with large tumor α/β values. Numerical results indicate the potential for significant reduction in metastatic risk.

  8. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    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

  9. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995......, and consider how it should be normalised across individuals. The resulting discrete choice model is thus a combined model for mode and departure time choice. We use it to estimate the preference parameters of H and W and to compare the goodness-of-fit of the constant-exponential and constant...... convergence problems. However, the signs of the obtained parameter estimates are consistent with theory. We have no problems estimating the simpler constant-affine specification, where all parameter estimates have signs consistent with theory and low standard errors. Whether the models with the additivity...

  10. Scheduling Results for the THEMIS Observation Scheduling Tool

    Science.gov (United States)

    Mclaren, David; Rabideau, Gregg; Chien, Steve; Knight, Russell; Anwar, Sadaat; Mehall, Greg; Christensen, Philip

    2011-01-01

    We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.

  11. Design of microalloyed steel hot rolling schedule by torsion testing: average schedule vs. real schedule

    OpenAIRE

    Calvo Muñoz, Jessica; Collins, Laurie; Yue, S.

    2010-01-01

    The hot torsion simulator has been extensively used as a means to understand the microstructure evolution of different steel grades during hot rolling. The test is suitable to simulate ‘real’ industrial schedules as well as schedules designed to obtain information regarding the intrinsic properties of the materials. For example, it is common to apply ‘average’ schedules, in which deformation per pass, interpass time, strain rate and cooling rate are kept constant, to determine the...

  12. Visually Exploring Transportation Schedules.

    Science.gov (United States)

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

    2016-01-01

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

  13. Research on Heat Treatment Schedule of Leucite-reinforced Dental Glass Ceramics%白榴石增强的牙科玻璃陶瓷的热处理制度研究

    Institute of Scientific and Technical Information of China (English)

    李莺; 姜通; 郭瑞松

    2012-01-01

    本文研究了白榴石增强的牙科玻璃陶瓷的热处理制度对白榴石晶体的生成、玻璃陶瓷的耐腐蚀性和力学性能的影响,采用热分析、X射线衍射分析、力学性能表征及金相显微观察等方法对热处理后的牙科玻璃陶瓷进行测试和分析.热分析表明,玻璃陶瓷晶核的生成温度为760℃,晶核的成长温度为1010℃.试验采用阶梯式升温热处理制度,成功地在玻璃陶瓷中析出白榴石晶体,随着白榴石含量的增加,材料的力学性能也获得了提高,热处理后材料的三点弯曲强度为102.2 MPa,显微硬度为5.45 GPa,断裂韧性为2.41 MPa·m1/2,强度达到ISO6872牙科陶瓷材料的标准.%The effects of heat treatment schedule of leucite-reinforced dental glass ceramics on the formation of leucite crystals, corrosion resistance and mechanical properties were studied. The dental glass ceramics after heat treatment were analyzed by thermal analysis, X ray diffraction analysis, mechanical property characterization and metallographic examination. Thermal analysis showed that the temperature of nucleation and crystallization was about 760 ℃ and 1010 ℃ , respectively. Leucite crystals were successfully obtained from the glass by heat treatment with stepped heating system. The existence of leucite crystals improved the mechanical properties of the dental glass ceramics. The three-point bending strength was 102.2 MPa, microhardness reached 5.45 GPa and fracture toughness was 2. 41 MPa ·m1/2. The strength of leucited-reinforced dental glass ceramics met the ISO 6872 standard.

  14. Solve Your Scheduling Puzzle without a Computer.

    Science.gov (United States)

    Toy, Steve

    1982-01-01

    The small Lone Star school district in Otis (Colorado) developed a year-long process for creating its master course schedule. The scheduling process includes a needs assessment, a curriculum scheduling committee of teachers and students, a trial run of the schedule, and board approval of the master schedule. (RW)

  15. 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 Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.13 Schedule III. (a) Schedule III shall consist of the drugs and other substances,...

  16. 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 DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.15 Schedule V. (a) Schedule V shall consist of the drugs and other substances, by...

  17. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

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

  18. Multiuser Switched Diversity Scheduling Schemes

    CERN Document Server

    Shaqfeh, Mohammad; 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 sys...

  19. The GBT Dynamic Scheduling System: A New Scheduling Paradigm

    Science.gov (United States)

    O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

    2009-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

  20. A comparative evaluation of radiation schedules in keloids

    International Nuclear Information System (INIS)

    One hundred and fourteen keloid patients were given radiotherapy during 1972-1975 at the Postgraduate Institution for Medical Education and Research, Chandigarh. Depending upon the blanching or activity, the cases were graded into 4 grades and a schedule of fractionated irradiation was prepared upon the principle that the more active the blanching longer was the fraction. Data are analysed with respect to age, sex, site of keloids, treatment schedule and response, and size of keloid and response. 50 KV and 100-140 KV treatment plants were used. Results indicate that weekly fraction treatment shows the best response and smaller the size of lesion, better is the response. (M.G.B.)

  1. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

    The final edition (Nos 51-52/2011 and 1-2-3/2012) of the Bulletin this year will be published on Friday 16 December and will cover events at CERN from 19 December 2011 to 19 January 2012. Announcements for publication in this issue should reach the Communication Group or the Staff Association, as appropriate, by noon on Tuesday 13 December. Bulletin publication schedule for 2012 The table below lists the 2012 publication dates for the paper version of the Bulletin and the corresponding deadlines for the submission of announcements. Please note that all announcements must be submitted by 12.00 noon on Tuesdays at the latest.   Bulletin No. Week number Submission of announcements (before 12.00 midday) Bulletin Web version Bulletin Printed version 4-5   Tuesday 17 January Fridays 20 and 27 January Wednesday25 January 6-7   Tuesday 31 January Fridays 3 and 10 February Wednesday 8 February 8-9 Tuesday 14 February Fridays 17 and 24 february Wednesday 22 Februa...

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

  3. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

    de Snoo, C.; van Wezel, W.M.C.; Jorna, R.J.J.M.

    2011-01-01

    Planning and scheduling significantly influence organizational performance, but literature that pays attention to how organizations could or should organize and assess their planning processes is limited. We extend planning and scheduling theory with a categorization of scheduling performance criter

  4. When greediness fails: Examples from stochastic scheduling

    OpenAIRE

    Uetz, Marc

    2002-01-01

    The purpose of this paper is to present examples which show that deterministic and stochastic scheduling problems often have a surprisingly different behavior. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  5. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

    We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is $3-2\\sqrt{2}$ and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the chargin...

  6. A holonic approach to dynamic manufacturing scheduling

    OpenAIRE

    Francisco José de Oliveira Restivo; Paulo Leitão

    2008-01-01

    Manufacturing scheduling is a complex combinatorial problem, particularly in distributed and dynamic environments. This paper presents a holonic approach to manufacturing scheduling, where the scheduling functions are distributed by several entities, combining their calculation power and local optimization capability. In this scheduling and control approach, the objective is to achieve fast and dynamic re-scheduling using a scheduling mechanism that evolves dynamically to combine centralized ...

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

  8. Immunization Schedules for Preteens and Teens

    Science.gov (United States)

    ... Traveling Internationally? Recommended Child and Adolescent Immunization Schedules History of the Vaccine Schedule Children's Hospital of Philadelphia's Vaccine Education Center Get Email Updates To receive email updates ...

  9. Grid Patient Appointment Template Design to Improve Scheduling Effectiveness

    Directory of Open Access Journals (Sweden)

    Yu-Li Huang

    2015-01-01

    Full Text Available Current outpatient delivery systems have been problematic in their ability to effectively schedule appointments and grant patients access to care. A better appointment system has demonstrated improvement on these issues. The objective of this study is to develop a grid appointment system to further improve the scheduling flexibility by determining the minimum length of appointment slots that optimizes the total costs of patient waiting, physician idling, and overtime. This minimum length is used for the patient type requiring the least amount of treatment time such as return visit (RV, and multiplications of the minimum length are for patient types with longer treatment such as new patients (NP. The results indicated that the proposed grid system adjusts to demand changes at least 15% more cost-effective when grouping two RVs into an NP or dividing an NP into two RVs compared to the base-line scheduling approaches that build around the mean treatment time.

  10. Grid Patient Appointment Template Design to Improve Scheduling Effectiveness.

    Science.gov (United States)

    Huang, Yu-Li; Marcak, Justin

    2015-01-01

    Current outpatient delivery systems have been problematic in their ability to effectively schedule appointments and grant patients access to care. A better appointment system has demonstrated improvement on these issues. The objective of this study is to develop a grid appointment system to further improve the scheduling flexibility by determining the minimum length of appointment slots that optimizes the total costs of patient waiting, physician idling, and overtime. This minimum length is used for the patient type requiring the least amount of treatment time such as return visit (RV), and multiplications of the minimum length are for patient types with longer treatment such as new patients (NP). The results indicated that the proposed grid system adjusts to demand changes at least 15% more cost-effective when grouping two RVs into an NP or dividing an NP into two RVs compared to the base-line scheduling approaches that build around the mean treatment time.

  11. The GBT Dynamic Scheduling System

    Science.gov (United States)

    McCarty, M. T.; Balser, D. S.; Braatz, J.; Clark, M. H.; Condon, J.; Creager, R. E.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2012-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS), in use since September, 2009, was designed to maximize observing efficiency while preserving telescope flexibility and data quality without creating undue adversity for the observers. Using observing criteria; observer availability and qualifications for remote observing; three-dimensional weather forecasts; and telescope state, the DSS software optimally schedules observers 24 to 48 hours in advance for a telescope that has a wide-range of capabilities and a geographical location with variable weather patterns. The DSS project was closed October 28, 2011 and will now enter a continuing maintenance and enhancement phase. Recent improvements include a new resource calendar for incorporating telescope maintenance activities, a sensitivity calculator that leverages the scheduling algorithms to facilitate consistent tools for proposal preparation, improved support for monitoring observations, scheduling of high frequency continuum and spectral line observations for both sparse and fully sampled array receivers, and additional session parameters for observations having special requirements.

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

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

  14. Scheduling Spitzer: The SIRPASS Story

    Science.gov (United States)

    Mittman, David S.; Hawkins, Robert

    2013-01-01

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

  15. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

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

  16. Smart schedules streamline distribution maintenance

    OpenAIRE

    CREEMERS, Tom; Ros, LLuís; Riera, Jordi; Roca, Josep; Ferrarons, Carles

    1998-01-01

    The scheduling and coordination of maintenance tasks and resource dispatching, with the aim of guaranteeing service to all customers, forms an essential part of the planning engineer's tasks. Least cost solutions are key. This article features a novel application called PLANETS, based on a constraint-logic programming paradigm, for scheduling maintenance activities on large distribution networks. Examples are included from system tests performed on subsets of the distribution network of Empre...

  17. Solving Public Transit Scheduling Problems

    OpenAIRE

    Mesquita, Marta; Moz, Margarida; Paias, Ana; Paixão, José; Pato, Margarida Vaz; Respício, Ana

    2008-01-01

    Operational planning within public transit companies has been extensively tackled but still remains a challenging area for operations research models and techniques. This phase of the planning process comprises vehicle scheduling, crew scheduling and rostering problems. In this paper, a new integer mathematical formulation to describe the integrated vehicle-crew-rostering problem is presented. The method proposed to solve this multi-objective problem is a sequential algorithm considered withi...

  18. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    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 with...... these displays using their mobile devices by either constructing custom video playlists or adding on-screen content to their personal schedule....

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

  20. Distributed Greedy Scheduling for Multihop Wireless Networks

    OpenAIRE

    Sunny, Albert; Kuri, Joy

    2010-01-01

    We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic.

  1. 14 CFR 1214.109 - Scheduling.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Scheduling. 1214.109 Section 1214.109... Space Shuttle Flights of Payloads for Non-U.S. Government, Reimbursable Customers § 1214.109 Scheduling... scheduling. NASA will attempt to schedule a payload reflight at the earliest opportunity, but normally...

  2. 40 CFR 142.55 - Final schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 22 2010-07-01 2010-07-01 false Final schedule. 142.55 Section 142.55... schedule. (a) Within 30 days after the termination of the public hearing pursuant to § 142.54, the... schedule as necessary and prescribe the final schedule for compliance and interim measures for the...

  3. 12 CFR 229.12 - Availability schedule.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 3 2010-01-01 2010-01-01 false Availability schedule. 229.12 Section 229.12... Availability Policies § 229.12 Availability schedule. (a) Effective date. The availability schedule contained...)(1)(vii). (e) Extension of schedule for certain deposits in Alaska, Hawaii, Puerto Rico, and the...

  4. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  5. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

  6. An integrated approach to process planning and scheduling using genetic algorithms

    OpenAIRE

    Husbands, Philip

    1995-01-01

    This thesis presents a new integrated approach to process planning aad job-shop scheduling. The relationship between planning and scheduling is reassessed and the line between the two tasks is made significantly more blurred than in the usual treatment. Scheduling is traditionally seen as the task of finding an optimal way of interleaving a number of fixed plans which are to be executed concurrently and which must share resources. The implicit assumption is that once planning has finished ...

  7. Support system for process flow scheduling

    OpenAIRE

    Salomone, Enrique; Chiotti, Omar Juan Alfredo; Lerch, Juan

    2001-01-01

    Process flow scheduling is a concept that refers to the scheduling of flow shop process plants, whose scheduling calculations are guided by the process structure. In a wide variety of high-volume process industries, the process flow scheduling concept implies an integrated structure for planning and scheduling. This integrated vision of the planning function and the very particular characteristics of the process industry production environment challenge the application of the most traditio...

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

  9. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    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

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

    Science.gov (United States)

    2013-04-12

    ... Schedule I of the CSA pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). 76 FR 65371... Schedule I of the CSA. 77 FR 63766. This action finalizes the scheduling action proposed in the October 17... Substances: Placement of Methylone into Schedule I'' on October 17, 2012. 77 FR 63766. This NPRM...

  11. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Ravn, Anders P.;

    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 ...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.......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...

  12. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

    We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system's different demands.

  13. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

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

  15. [Fee schedules and cost containment].

    Science.gov (United States)

    Herrmann, François R; Perneger, Thomas

    2009-11-11

    Medical fee schedules are controversial. In this paper we examine the reasons that justify the imposition of fee schedules in the presence of a socially financed health insurance system, and examine the ways of constructing a medical fee schedule. The weakness of fee-for-service tariffs is that they do not allow a control of health care costs if the volume of services is unchecked. Current solutions to this problem--audit of doctors' average cost per case, freeze on new medical practices, or the insurers' discretion in choosing the doctors they reimburse--have multiple drawbacks. Alternatives to fee-for-service payment--such as flat fees, or payment based on the quality of medical services--are discussed.

  16. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption and....... 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....

  17. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

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

  18. A Comparison of Dense-to-Lean and Fixed Lean Schedules of Alternative Reinforcement and Extinction

    Science.gov (United States)

    Hagopian, Louis P.; Toole, Lisa M.; Long, Ethan S.; Bowman, Lynn G.; Lieving, Gregory A.

    2004-01-01

    Behavior-reduction interventions typically employ dense schedules of alternative reinforcement in conjunction with operant extinction for problem behavior. After problem behavior is reduced in the initial treatment stages, schedule thinning is routinely conducted to make the intervention more practical in natural environments. In the current…

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

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

  1. MULTI-SHOP SCHEDULING PROBLEM

    Institute of Scientific and Technical Information of China (English)

    HU Yanhai; YAN Junqi; MA Bengzhe; YE Feifan; ZHANG Jie

    2007-01-01

    A new concept of multi-shop (M) is put forward which contains all basic shops including open shop (O), job shop (J), flow shop (F) and hybrid flow shop (H) so that these basic shop can be scheduled together. Several algorithms including ant colony optimization (ACO), most work remaining (MWR), least work remaining (LWR), longest processing time (LPT) and shortest processing time (SPT) are used for scheduling the M. Numerical experiments of the M adopting data of some car and reC series benchmark instances are tested. The results show that the ACO algorithm has better performance for scheduling the M than the other algorithms, if minimizing the makespan ( C*max ) is taken as the objective function. As a comparison, the separate shops contained in the M are also scheduled by the ACO algorithm for the same objective function, when the completing time of the jobs in the previous shop is taken as the ready time of these jobs in the following shop. The results show that the Mhas the advantage of shortening the makespan upon separate shops.

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

  3. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

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

  4. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption and le...

  5. Non-clairvoyant Scheduling Games

    CERN Document Server

    Cohen, Johanne; Thang, Nguyen Kim

    2011-01-01

    In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of each player is the completion time of its own job. In the game, players may follow selfish strategies to optimize their cost and therefore their behaviors do not necessarily lead the game to an equilibrium. Even in the case there is an equilibrium, its makespan might be much larger than the social optimum, and this inefficiency is measured by the price of anarchy -- the worst ratio between the makespan of an equilibrium and the optimum. Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled. Typically these policies define the schedule according to the processing times as announced by the jobs. One could wonder if there are policies that do not require this knowledge, and still provide a good price of anarchy. This would make the...

  6. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, Marijn R.; Haverkort, Boudewijn R.; Schmitt, Jens B.

    2012-01-01

    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

  7. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, Marijn R.; Haverkort, Boudewijn R.

    2011-01-01

    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 t

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

  9. Autonomous grid scheduling using probabilistic job runtime scheduling

    OpenAIRE

    Lazarević, A.

    2008-01-01

    Computational Grids are evolving into a global, service-oriented architecture – a universal platform for delivering future computational services to a range of applications of varying complexity and resource requirements. The thesis focuses on developing a new scheduling model for general-purpose, utility clusters based on the concept of user requested job completion deadlines. In such a system, a user would be able to request each job to finish by a certain deadline, and po...

  10. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear......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...... scheduling methods, have proven to be well suited for projects of a repetitive nature, such as building projects. As the repetitive or linear scheduling methods may include locations or places, they are also referred to by the comprehensive term of location-based scheduling (LBS), which is the concept...

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

  12. Slide Rule For Calculating Curing Schedules

    Science.gov (United States)

    Heater, Don

    1995-01-01

    Special-purpose slide rule devised for calculating schedules for storing and curing adhesives, sealants, and other materials characterized by known curing times and shelf lives. Prevents mistakes commonly made in determining storage and curing schedules.

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

  14. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

    This paper provides a classification of real scheduling problems. Various ways have been examined and described on the problem. Scheduling problem faces a tremendous challenges and difficulties in order to meet the preferences of the consumer. Dealing with scheduling problem is complicated, inefficient and time-consuming. This study aims to develop a mathematical model for scheduling the operating theatre during peak and off peak time. Scheduling problem is a well known optimization problem and the goal is to find the best possible optimal solution. In this paper, we used integer linear programming technique for scheduling problem in a high level of synthesis. In addition, time and resource constrained scheduling was used. An optimal result was fully obtained by using the software GLPK/AMPL. This model can be adopted to solve other scheduling problems, such as the Lecture Theatre, Cinemas and Work Shift.

  15. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

    In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.

  16. Dynamic scheduling. State of the art report.

    OpenAIRE

    Kocjan, Waldemar

    2002-01-01

    Most of the research literature concerning scheduling concentrates on the static problems, i.e. problems where all input data is known and does not vary over the time. However, the real world scheduling problems are very seldom static. Events like machine failures or work overloads are, in some situations, impossible to predict. Dynamic scheduling is a research field which take into consideration uncertainty and dynamic changes in the scheduling problem. This paper gives...

  17. 16 CFR 1203.13 - Test schedule.

    Science.gov (United States)

    2010-01-01

    ... 16 Commercial Practices 2 2010-01-01 2010-01-01 false Test schedule. 1203.13 Section 1203.13... STANDARD FOR BICYCLE HELMETS The Standard § 1203.13 Test schedule. (a) Helmet sample 1 of the set of eight... accordance with § 1203.17. Table 1203.13 summarizes the test schedule. Table 1203.13—Test Schedule §...

  18. Stimulus generalization of schedule-induced polydipsia

    OpenAIRE

    Hamm, Robert J.; Porter, Joseph H.; Kaempf, George L.

    1981-01-01

    Five rats were exposed to an intradimensional discrimination by associating two tones of different frequency with the components of a multiple random-time 30-sec, extinction schedule of food presentation. After schedule-induced polydipsia developed and the intermittent schedule of food presentation established stable differential licking rates during the stimuli associated with the multiple schedule, a stimulus generalization test was conducted. When generalization testing was conducted by pr...

  19. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Scheduled airlines. 122.63 Section 122.63 Customs... AIR COMMERCE REGULATIONS Clearance of Aircraft and Permission To Depart § 122.63 Scheduled airlines... scheduled airlines covered by this subpart. (a) Clearance at other than airport of final departure....

  20. 49 CFR 665.21 - Scheduling.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 7 2010-10-01 2010-10-01 false Scheduling. 665.21 Section 665.21 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL TRANSIT ADMINISTRATION, DEPARTMENT OF TRANSPORTATION BUS TESTING Operations § 665.21 Scheduling. (a) To schedule a bus for testing, a...

  1. 21 CFR 1308.49 - Emergency scheduling.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Emergency scheduling. 1308.49 Section 1308.49 Food... Hearings § 1308.49 Emergency scheduling. Pursuant to 21 U.S.C. 811(h) and without regard to the... the end of one year from the effective date of the order scheduling the substance, except that...

  2. Practical scheduling of computer vision functions

    OpenAIRE

    Chan-Hon-Tong, Adrien; Herbin, Stéphane

    2016-01-01

    Practical scheduler in computer vision context could boost the development of robotic platform embedding large variety of computer vision functions (like image classifier). In this paper, we make a step toward such scheduler. More precisely, we offer a scheduling framework for image classification whose relevancy is clearly established by experimentation on real life computer vision dataset and scenarios.

  3. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

    Megow, N.; Uetz, M.J.; Vredeveld, T.

    2006-01-01

    We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that job

  4. 42 CFR 412.610 - Assessment schedule.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 2 2010-10-01 2010-10-01 false Assessment schedule. 412.610 Section 412.610 Public... Hospitals and Rehabilitation Units § 412.610 Assessment schedule. (a) General. For each Medicare Part A fee... is in accordance with the assessment schedule specified in paragraph (c) of this section....

  5. 29 CFR 1952.351 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.351 Section 1952.351 Labor... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Arizona § 1952.351 Developmental schedule. The Arizona State plan is developmental. The following is the developmental schedule as provided...

  6. 42 CFR 441.58 - Periodicity schedule.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Periodicity schedule. 441.58 Section 441.58 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED... schedule. The agency must implement a periodicity schedule for screening services that— (a)...

  7. 29 CFR 1952.91 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.91 Section 1952.91 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. The South Carolina plan is developmental. The following is the schedule of the...

  8. 10 CFR 2.1026 - Schedule.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false Schedule. 2.1026 Section 2.1026 Energy NUCLEAR REGULATORY... Geologic Repository § 2.1026 Schedule. (a) Subject to paragraphs (b) and (c) of this section, the Presiding Officer shall adhere to the schedule set forth in appendix D of this part. (b)(1) Pursuant to § 2.307,...

  9. 40 CFR 63.1102 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 10 2010-07-01 2010-07-01 false Compliance schedule. 63.1102 Section... Technology Standards § 63.1102 Compliance schedule. (a) General requirements. Affected sources, as defined in... according to the schedule in paragraph (a)(1) or (2) of this section, as appropriate. Proposal and...

  10. 28 CFR 802.10 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Fee schedule. 802.10 Section 802.10... DISCLOSURE OF RECORDS Freedom of Information Act § 802.10 Fee schedule. (a) The fees described in this section conform to the Office of Management and Budget Uniform Freedom of Information Act Fee Schedule...

  11. 29 CFR 1952.161 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.161 Section 1952.161 Labor... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Iowa § 1952.161 Developmental schedule. The Iowa State plan is developmental. The following is the developmental schedule as amended...

  12. 29 CFR 1952.101 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.101 Section 1952.101 Labor... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Oregon § 1952.101 Developmental schedule. The Oregon plan is developmental. The schedule of developmental steps as described in the plan...

  13. 49 CFR 7.43 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 1 2010-10-01 2010-10-01 false Fee schedule. 7.43 Section 7.43 Transportation Office of the Secretary of Transportation PUBLIC AVAILABILITY OF INFORMATION Fees § 7.43 Fee schedule...-Collar Pay Schedule or equivalent grades, as follows: When performed by employees: GS-1 through...

  14. 76 FR 54408 - Regulatory Review Schedule

    Science.gov (United States)

    2011-09-01

    ... Regulatory Review Schedule in the Federal Register setting out consultation schedules and review processes. (76 FR 18457, April 4, 2011). The Commission's regulatory review process established a tribal... National Indian Gaming Commission 25 CFR Chapter III Regulatory Review Schedule AGENCY: National...

  15. 14 CFR 415.121 - Launch schedule.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Launch schedule. 415.121 Section 415.121... From a Non-Federal Launch Site § 415.121 Launch schedule. An applicant's safety review document must contain a generic launch processing schedule that identifies each review, rehearsal, and safety...

  16. 29 CFR 1952.111 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.111 Section 1952.111 Labor... (CONTINUED) APPROVED STATE PLANS FOR ENFORCEMENT OF STATE STANDARDS Utah § 1952.111 Developmental schedule. The Utah plan is developmental. The following is the schedule of developmental steps provided by...

  17. 42 CFR 457.525 - Public schedule.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Public schedule. 457.525 Section 457.525 Public... Requirements: Enrollee Financial Responsibilities § 457.525 Public schedule. (a) The State must make available to the groups in paragraph (b) of this section a public schedule that contains the...

  18. 29 CFR 1952.231 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.231 Section 1952.231 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. The Kentucky state plan is developmental. The following is the developmental schedule as...

  19. 76 FR 57683 - Regulatory Review Schedule

    Science.gov (United States)

    2011-09-16

    ... Regulatory Review Schedule in the Federal Register setting out consultation schedules and review processes. (76 FR 18457, April 4, 2011). The Commission's regulatory review process established a Tribal... National Indian Gaming Commission 25 CFR Chapter III Regulatory Review Schedule AGENCY: National...

  20. 40 CFR 63.1401 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 11 2010-07-01 2010-07-01 true Compliance schedule. 63.1401 Section 63... schedule. (a) New affected sources that commence construction or reconstruction after December 14, 1998... required according to the schedule specified in paragraph (e)(2)(i) or (ii) of this section, as...

  1. 6 CFR 27.210 - Submissions schedule.

    Science.gov (United States)

    2010-01-01

    ... 6 Domestic Security 1 2010-01-01 2010-01-01 false Submissions schedule. 27.210 Section 27.210... STANDARDS Chemical Facility Security Program § 27.210 Submissions schedule. (a) Initial Submission. The... Schedule for Covered Facilities. The timeframes in this subsection also apply to covered facilities...

  2. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... Proposed FOIA Fee Schedule, 77 FR 32433. No comments were received in response to that notice, and the... Schedule Update went into effect on July 29, 2011. 76 FR 43819. Board Action Accordingly, the Board issues... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety...

  3. 76 FR 26967 - Regulatory Review Schedule

    Science.gov (United States)

    2011-05-10

    ... National Indian Gaming Commission 25 CFR Chapter III Regulatory Review Schedule AGENCY: National Indian... consultation meetings and reviewing all comments, NIGC published a Notice of Regulatory Review Schedule setting out detailed consultation schedules and review processes. NIGC divided the regulations to be...

  4. A Hybrid Task Scheduling Algorithm in Grid

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yan-mei; CAO Huai-hu; YU Zhen-wei

    2006-01-01

    Task scheduling in Grid has been proved to be NP- complete problem. In this paper, to solve this problem, a Hybrid Task Scheduling Algorithm in Grid (HTS) has been presented, which joint the advantages of Ant Colony and Genetic Algorithm.Compared with the related work, the result shows that the HTS algorithm significantly surpasses the previous approaches in schedule length ratio and speedup.

  5. 76 FR 33181 - Regulatory Review Schedule

    Science.gov (United States)

    2011-06-08

    ... processes. (76 FR 18457, April 4, 2011). The Commission's regulatory review process establishes a detailed... National Indian Gaming Commission 25 CFR Chapter III Regulatory Review Schedule AGENCY: National Indian... Regulatory Review Schedule setting out detailed consultation schedules and review processes. NIGC divided...

  6. 29 CFR 1952.151 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.151 Section 1952.151 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. The North Carolina Plan is developmental. The following is the schedule of the...

  7. 29 CFR 1952.123 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.123 Section 1952.123 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. The Washington State plan is developmental. The following is the developmental schedule...

  8. 29 CFR 1952.221 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.221 Section 1952.221 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. The Tennessee state plan is developmental. The following is the developmental schedule...

  9. 7 CFR 58.440 - Make schedule.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 3 2010-01-01 2010-01-01 false Make schedule. 58.440 Section 58.440 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Standards... Procedures § 58.440 Make schedule. A uniform schedule should be established and followed as closely...

  10. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

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

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

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 3 2010-07-01 2010-07-01 false Scheduling of intermittent or reduced schedule leave. 825.203 Section 825.203 Labor Regulations Relating to Labor (Continued) WAGE AND HOUR DIVISION, DEPARTMENT... Family and Medical Leave Act § 825.203 Scheduling of intermittent or reduced schedule leave....

  13. Operational schedule 2011 & potential performance

    CERN Document Server

    Meddahi, M

    2011-01-01

    The assumed LHC beam parameters for 2011 are summarised. The overview of the 2011 schedule is presented and including hardware commissioning, beams re-commissioning, re-validation, scrubbing, technical stops, MD, ions and special physics run requests. A strategy for stepping up in intensity is proposed and potential issues are described together with possible actions. Finally, the potential peak and integrated luminosity are given.

  14. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    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

  15. Dynamic Scheduling on Grid Environments

    OpenAIRE

    Bertogna, Mario Leandro

    2010-01-01

    The work carried out in the thesis describes efficient virtual environments management. One of the main contributions is a middleware scheduling optimization based on Grid environments. Being the overall goal to get an optimal resource selection plus a coordinate task execution optimization. In particular, the research was related with the interaction between non trivial quality service and tasks distribution issues in meta-organizations. While linking allocation and policies belonging to vir...

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

  17. Dwell scheduling algorithm for multifunction phased array radars based on the scheduling gain

    Institute of Scientific and Technical Information of China (English)

    Cheng Ting; He Zishu; Tang Ting

    2008-01-01

    A real-time dwell scheduling model, which takes the time and energy constraints into account is founded from the viewpoint of scheduling gain. Scheduling design is turned into a nonlinear programming procedure. The real-time dwell scheduling algorithm based on the scheduling gain is presented with the help of two heuristic rules. The simulation results demonstrate that compared with the conventional adaptive scheduling method, the algorithm proposed not only increases the scheduling gain and the time utility but also decreases the task drop rate.

  18. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  19. Scheduler Design Criteria: Requirements and Considerations

    Science.gov (United States)

    Lee, Hanbong

    2016-01-01

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

  20. Application of workflow technology for workshop scheduling

    Institute of Scientific and Technical Information of China (English)

    ZHOU Wan-kun; ZHU Jian-ying

    2005-01-01

    This paper attempts to solve the complexity of scheduling problems and meet the requirement of the ever-changing manufacturing environment. In this paper, a new Workflow-Based Scheduling System (WBSS) is proposed. The integration of Workflow Management System (WfMS) and rule-based scheduler provides us an effective way of generating a task-sheet according to the states of system and the scheduled objects. First, the definition of workflow model for scheduling is proposed, and following are the architecture and mechanism of the proposed WBSS. At last, an application is given to show how the established system works.

  1. The In Vitro Fertilization Scheduler at the University of North Carolina and Its Satellite Clinics

    OpenAIRE

    Cahill, Laurie; Bailey, Linda

    1988-01-01

    To facilitate scheduling of in vitro fertilization and gamete intrafallopian tube transfer (IVF-GIFT) patients, we developed a program (the IVF Scheduler) which uses the starting date of the last menstrual period, the number of days between starting dates of the last two menstrual periods (cycle length), and the month of requested treatment to calculate the date on which IVF-GIFT treatment should begin. Since cycle length is variable for each patient this calculation is performed for each of ...

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

  3. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

    Full Text Available The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this paper we present an extended set of simplified scheduling constraints which allows easy scheduling of underwater acoustic communication. We also present two algorithms for scheduling communications, i.e. a centralized scheduling approach and a distributed scheduling approach. The centralized approach achieves the highest throughput while the distributed approach aims to minimize the computation and communication overhead. We further show how the centralized scheduling approach can be extended with transmission dependencies to reduce the end-to-end delay of packets. We evaluate the performance of the centralized and distributed scheduling approaches using simulation. The centralized approach outperforms the distributed approach in terms of throughput, however we also show the distributed approach has significant benefits in terms of communication and computational overhead required to setup the schedule. We propose a novel way of estimating the performance of scheduling approaches using the ratio of modulation time and propagation delay. We show the performance is largely dictated by this ratio, although the number of links to be scheduled also has a minor impact on the performance.

  4. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    and unsystematic sharing of knowledge within and between projects. Thus, the reuse of scheduling data and experiences are inadequate, preventing continuous improvements of the overall schedules. Besides, the overall scheduling process suffers from lack of information, caused by uncoordinated and unsynchronized...... overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview...... overall scheduling, which in turn, can secure a better starting point of the LPS. The study points to the necessity of involving subcontractors and manufactures in the earliest phases of the project in order to create project specific information for the overall schedule. In addition, the design process...

  5. Routine environmental monitoring schedule, calendar year 1995

    Energy Technology Data Exchange (ETDEWEB)

    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.

  6. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... 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...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

  7. Intermittent High-Dose Scheduling of AZD8835, a Novel Selective Inhibitor of PI3Kα and PI3Kδ, Demonstrates Treatment Strategies for PIK3CA-Dependent Breast Cancers.

    Science.gov (United States)

    Hudson, Kevin; Hancox, Urs J; Trigwell, Cath; McEwen, Robert; Polanska, Urszula M; Nikolaou, Myria; Morentin Gutierrez, Pablo; Avivar-Valderas, Alvaro; Delpuech, Oona; Dudley, Phillippa; Hanson, Lyndsey; Ellston, Rebecca; Jones, Alys; Cumberbatch, Marie; Cosulich, Sabina C; Ward, Lara; Cruzalegui, Francisco; Green, Stephen

    2016-05-01

    The PIK3CA gene, encoding the p110α catalytic unit of PI3Kα, is one of the most frequently mutated oncogenes in human cancer. Hence, PI3Kα is a target subject to intensive efforts in identifying inhibitors and evaluating their therapeutic potential. Here, we report studies with a novel PI3K inhibitor, AZD8835, currently in phase I clinical evaluation. AZD8835 is a potent inhibitor of PI3Kα and PI3Kδ with selectivity versus PI3Kβ, PI3Kγ, and other kinases that preferentially inhibited growth in cells with mutant PIK3CA status, such as in estrogen receptor-positive (ER(+)) breast cancer cell lines BT474, MCF7, and T47D (sub-μmol/L GI50s). Consistent with this, AZD8835 demonstrated antitumor efficacy in corresponding breast cancer xenograft models when dosed continuously. In addition, an alternative approach of intermittent high-dose scheduling (IHDS) was explored given our observations that higher exposures achieved greater pathway inhibition and induced apoptosis. Indeed, using IHDS, monotherapy AZD8835 was able to induce tumor xenograft regression. Furthermore, AZD8835 IHDS in combination with other targeted therapeutic agents further enhanced antitumor activity (up to 92% regression). Combination partners were prioritized on the basis of our mechanistic insights demonstrating signaling pathway cross-talk, with a focus on targeting interdependent ER and/or CDK4/6 pathways or alternatively a node (mTOR) in the PI3K-pathway, approaches with demonstrated clinical benefit in ER(+) breast cancer patients. In summary, AZD8835 IHDS delivers strong antitumor efficacy in a range of combination settings and provides a promising alternative to continuous dosing to optimize the therapeutic index in patients. Such schedules merit clinical evaluation. Mol Cancer Ther; 15(5); 877-89. ©2016 AACR. PMID:26839307

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

    International Nuclear Information System (INIS)

    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)

  9. Radiobiological modeling of interplay between accelerated repopulation and altered fractionation schedules in head and neck cancer

    Directory of Open Access Journals (Sweden)

    Marcu Loredana

    2009-01-01

    Full Text Available Head and neck cancer represents a challenge for radiation oncologists due to accelerated repopulation of cancer cells during treatment. This study aims to simulate, using Monte Carlo methods, the response of a virtual head and neck tumor to both conventional and altered fractionation schedules in radiotherapy when accelerated repopulation is considered. Although clinical trials are indispensable for evaluation of novel therapeutic techniques, they are time-consuming processes which involve many complex and variable factors for success. Models can overcome some of the limitations encountered by trials as they are able to simulate in less complex environment tumor cell kinetics and dynamics, interaction processes between cells and ionizing radiation and their outcome. Conventional, hyperfractionated and accelerated treatment schedules have been implemented in a previously developed tumor growth model which also incorporates tumor repopulation during treatment. This study focuses on the influence of three main treatment-related parameters, dose per fraction, inter fraction interval and length of treatment gap and gap timing based on RTOG trial data on head and neck cancer, on tumor control. The model has shown that conventionally fractionated radiotherapy is not able to eradicate the stem population of the tumor. Therefore, new techniques such as hyperfractionated/ accelerated radiotherapy schedules should be employed. Furthermore, the correct selection of schedule-related parameters (dose per fraction, time between fractions, treatment gap scheduling is crucial in overcoming accelerated repopulation. Modeling of treatment regimens and their input parameters can offer better understanding of the radiobiological interactions and also treatment outcome.

  10. Radiobiological modeling of interplay between accelerated repopulation and altered fractionation schedules in head and neck cancer.

    Science.gov (United States)

    Marcu, Loredana G; Bezak, Eva

    2009-10-01

    Head and neck cancer represents a challenge for radiation oncologists due to accelerated repopulation of cancer cells during treatment. This study aims to simulate, using Monte Carlo methods, the response of a virtual head and neck tumor to both conventional and altered fractionation schedules in radiotherapy when accelerated repopulation is considered. Although clinical trials are indispensable for evaluation of novel therapeutic techniques, they are time-consuming processes which involve many complex and variable factors for success. Models can overcome some of the limitations encountered by trials as they are able to simulate in less complex environment tumor cell kinetics and dynamics, interaction processes between cells and ionizing radiation and their outcome. Conventional, hyperfractionated and accelerated treatment schedules have been implemented in a previously developed tumor growth model which also incorporates tumor repopulation during treatment. This study focuses on the influence of three main treatment-related parameters, dose per fraction, inter fraction interval and length of treatment gap and gap timing based on RTOG trial data on head and neck cancer, on tumor control. The model has shown that conventionally fractionated radiotherapy is not able to eradicate the stem population of the tumor. Therefore, new techniques such as hyperfractionated/ accelerated radiotherapy schedules should be employed. Furthermore, the correct selection of schedule-related parameters (dose per fraction, time between fractions, treatment gap scheduling) is crucial in overcoming accelerated repopulation. Modeling of treatment regimens and their input parameters can offer better understanding of the radiobiological interactions and also treatment outcome.

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

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

  13. Fair Scheduling in Networks Through Packet Election

    CERN Document Server

    Jagabathula, Srikanth

    2008-01-01

    We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of service. Existing work on fairness for constrained networks concentrates on flow based fairness. As a main result, we describe a notion of packet based fairness by establishing an analogy with the ranked election problem: packets are voters, schedules are candidates and each packet ranks the schedules based on its priorities. We then obtain a scheduling algorithm that achieves the described notion of fairness by drawing upon ...

  14. Improved health-related quality of life of patients with metastatic renal cell carcinoma treated with a 2 weeks on and 1 week off schedule of sunitinib.

    Science.gov (United States)

    Miyake, Hideaki; Harada, Ken-ichi; Miyazaki, Akira; Fujisawa, Masato

    2015-03-01

    The objective of this study was to investigate the significance of changes from the standard dosing schedule of sunitinib, which is 4 weeks of treatment and 2 weeks off (schedule 4/2), to an alternative schedule with 2 weeks of treatment and 1 week off (schedule 2/1), after encountering dose-limiting toxicity in 45 consecutive Japanese patients with metastatic renal cell carcinoma (mRCC). Despite a definitively improved relative dose intensity of sunitinib by changing from schedule 4/2 to 2/1, this difference was not significant. Adverse events (AEs) occurred in all patients on both schedules 4/2 and 2/1; however, the proportion of patients experiencing AEs ≥ grade 3 on schedule 2/1 was significantly lower than that on schedule 4/2. Quality of life (QOL) analysis using SF-36 revealed that all eight scores during schedule 2/1 were more favorable than those during schedule 4/2, and there were significant differences in 2 of the 8 scores between these two schedules. Furthermore, multivariate analyses, which were performed to evaluate the contribution of several AEs on schedule 2/1 to the improvement of each score in SF-36, revealed that fatigue had independent impacts on two scores, despite the lack of an independent association between any scores and the remaining AEs examined. These findings suggest that schedule 2/1 is the optimal dosing schedule of sunitinib against mRCC that balances efficacy and toxicity, since treatment on schedule 2/1 resulted in a markedly improved QOL compared with that on schedule 4/2 by relieving the profile of sunitinib-related AEs.

  15. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    OpenAIRE

    Ladislav Rosocha; Silvia Vernerova; Robert Verner

    2015-01-01

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

  16. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    OpenAIRE

    Ladislav Rosocha; Silvia Vernerova; Robert Verner

    2015-01-01

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

  17. Faster annealing schedules for quantum annealing

    OpenAIRE

    Morita, Satoshi

    2007-01-01

    New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional to the square of the annealing time, is shown to be determined only by the information at the initi...

  18. Resupply Scheduler Program Using Integer Optimization

    Science.gov (United States)

    Viterna, L. A.; Reed, D. M.

    1994-01-01

    Resupply Scheduling Modeler (RSM) fully menu-driven computer program using integer programming techniques to determine optimum schedule for replacing components on or before ends of fixed replacement periods. Written to analyze electrical power system on Space Station Freedom, also used to model resupply of almost any system subject to user-defined constraints on resources. Lifetimes of components, assembly schedules, and other constraints taken into account. Written in APL2(R).

  19. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    OpenAIRE

    Mr. P.Mathiyalagan; U.R. Dhepthie; S.N. Sivanandam

    2010-01-01

    Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedu...

  20. Scheduling under non-reversible energy sources

    OpenAIRE

    Ngueveu, Sandra Ulrich; Artigues, Christian; Lopez, Pierre

    2016-01-01

    In this paper, we address a preemptive scheduling problem involving multiple non-reversible energy sources. To the classical scheduling issue, an additional decision level is added regarding the selection of the energy source used to satisfy the total power demand of tasks processed at each instant. Different non-reversible energy sources are available, with different characteristics in terms of efficiency and power range. The objective is to identify the best combination between scheduling a...

  1. Solving Project Scheduling Problems by Minimum Cut

    OpenAIRE

    Moehring, Rolf; Uetz, Marc; Stork, Frederik; Schulz, Andreas S.

    2002-01-01

    In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimiza...

  2. Annual Scheduling of Atlantic Fleet Surface Combatants

    OpenAIRE

    Gerald G. Brown; Goodman, Clark E., Jr.; Wood, R. Kevin

    1990-01-01

    Operations Research, 38, pp. 249-259. Employment scheduling is the process whereby U. S. Navy ships, submarines, aircraft and other units are assigned to major operations, exercises, maintenance periods, inspections and other events; the employment schedule directly influencesfleet combat readiness. Currently, this process is largely manual requiring several full-time scheduling officers and additional personnel at various levels of management. We introduce an optimization model t...

  3. Scheduled Caste Women: Problems And Challenges

    OpenAIRE

    Vijayakumar Murthy; Jaikishan Thakur

    2013-01-01

    The paper analyzed the Caste system based on Varnas during the ancient India. It also examined the demerits of caste attached to the present scheduled castes in general and scheduled caste women in particular. The scheduled caste women are disadvantaged by their caste and gender and as such they are subject to exploitation and discrimination by their family members, by their caste people and by forward castes. Hence, there is increase in exploitation, discrimination and violence against the s...

  4. Combining robustness and recovery for airline schedules

    OpenAIRE

    Eggenberg, Niklaus

    2009-01-01

    In this thesis, we address different aspects of the airline scheduling problem. The main difficulty in this field lies in the combinatorial complexity of the problems. Furthermore, as airline schedules are often faced with perturbations called disruptions (bad weather conditions, technical failures, congestion, crew illness…), planning for better performance under uncertainty is an additional dimension to the complexity of the problem. Our main focus is to develop better schedules that are le...

  5. Efficient generation of rotating workforce schedules

    OpenAIRE

    Musliu, Nysret; Gaertner, Johannes; Slany, Wolfgang

    2000-01-01

    Generating high-quality schedules for a rotating workforce is a critical task in all settings where a certain staffing level must be guaranteed beyond the capacity of single employees, such as for instance in industrial plants, hospitals, or airline companies. Results from ergonomics \\cite{BEST91} indicate that rotating workforce schedules have a profound impact on the health and social life of employees as well as on their performance at work. Moreover, rotating workforce schedules must sati...

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

  8. Optimization of radiation dosing schedules for proneural glioblastoma.

    Science.gov (United States)

    Badri, H; Pitter, K; Holland, E C; Michor, F; Leder, K

    2016-04-01

    Glioblastomas are the most aggressive primary brain tumor. Despite treatment with surgery, radiation and chemotherapy, these tumors remain uncurable and few significant increases in survival have been observed over the last half-century. We recently employed a combined theoretical and experimental approach to predict the effectiveness of radiation administration schedules, identifying two schedules that led to superior survival in a mouse model of the disease (Leder et al., Cell 156(3):603-616, 2014). Here we extended this approach to consider fractionated schedules to best minimize toxicity arising in early- and late-responding tissues. To this end, we decomposed the problem into two separate solvable optimization tasks: (i) optimization of the amount of radiation per dose, and (ii) optimization of the amount of time that passes between radiation doses. To ensure clinical applicability, we then considered the impact of clinical operating hours by incorporating time constraints consistent with operational schedules of the radiology clinic. We found that there was no significant loss incurred by restricting dosage to an 8:00 a.m. to 5:00 p.m. window. Our flexible approach is also applicable to other tumor types treated with radiotherapy. PMID:26094055

  9. AVLIS production plant project schedule and milestones

    International Nuclear Information System (INIS)

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

  10. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

    Full Text Available We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

  11. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

    In the view of staff shortages and the huge inventory of products in the current market, we put forward a personnel scheduling model in the target of closing to the delivery date considering the parallelism. Then we designed a scheduling algorithm based on genetic algorithm and proposed a flexible parallel decoding method which take full use of the personal capacity. Case study results indicate that the flexible personnel scheduling considering the order-shop scheduling, machine automatic capabilities and personnel flexible in the target of closing to the delivery date optimize the allocation of human resources, then maximize the efficiency.

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

  13. Implementing Short Term Scheduler and Preemptive Algorithm in Grid Computing Scheduling

    Directory of Open Access Journals (Sweden)

    CH.V.T. E.V Laxmi

    2013-01-01

    Full Text Available Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks and there is need of finding faster and cheaper solutions to solve computational problems. The deployment of Grid systems involves the efficient management of heterogeneous, geographically distributed and dynamically available resources. However, the effectiveness of a Grid environment is largely dependent on the effectiveness and efficiency of its schedulers, which act as localized resource brokers. This article provides a brief overview on grid computing and Scheduling processes, important factors considered in resource management and Scheduling, comparison of different Scheduling processes and future outlook of its resource management and Scheduling in Grid systemsby implementing short term scheduling. This paper investigates the use of short term scheduling mechanism in grid computing and implementing the Shortest Remaining Time First (SRTF algorithm for the selection of jobs from the job pool.

  14. Tratamento de um problema de escalonamento considerando datas de entrega, turnos de produção e trocas de ferramentas via Busca Tabu Scheduling problem treatment considering due dates, production turns and toll switching constraints using Tabu Search

    Directory of Open Access Journals (Sweden)

    Antonio Gabriel Rodrigues

    2008-01-01

    Full Text Available Neste trabalho é abordado o Problema de Escalonamento em um Job Shop aplicado a um Sistema de Manufatura Flexível (SMF, sendo consideradas restrições de datas de entrega, turnos de produção e trocas de ferramentas. O SMF considerado é composto de uma máquina versátil, um sistema de transporte e manuseio de materiais e um sistema computacional. O problema é representado por uma função objetivo f, na qual é possível definir três políticas de minimização: (i tempo de atraso, (ii tempo de parada para a troca de ferramentas e (iii tempo de trocas de ferramentas. A aplicação das políticas é feita pela definição de pesos às variáveis de decisão de f. A busca pelo escalonamento que minimiza f é feita utilizando a técnica de Busca Tabu (BT. Foram realizados experimentos onde é observado o impacto de cinco regras de geração de soluções iniciais no desempenho da Busca Tabu. Também foram realizados experimentos nos quais se verifica o comportamento da busca frente à escolha das políticas de minimização. Nestes experimentos notou-se o conflito entre a política de minimização de atraso e as de minimização de trocas de ferramentas e de paradas para trocas de ferramentas. O aumento dos parâmetros da BT, nbmax (número máximo de iterações sem encontrar melhora no resultado global da busca e tamanho da Lista Tabu, melhora o desempenho da busca para encontrar melhores resultados na minimização do atraso.In this paper is studied the Job Shop Scheduling Problem applied to a Flexible Manufacturing System (FMS environment, considering due dates, production turns and tool switching constraints. The FMS is composed by a versatile machine, a system for transport, handling and storage of materials and a computational system. This problem is represented through an objective function f, in which is possible to define three minimization policies: (i tardiness time, (ii stop time and (iii switching tools time. The

  15. An agent based manufacturing scheduling module for Advanced Planning and Scheduling

    OpenAIRE

    Attri, Hitesh

    2005-01-01

    A software agents based manufacturing scheduling module for Advanced Planning and Scheduling (APS) is presented. The problem considered is scheduling of jobs with multiple operations, distinct operation processing times, arrival times, and due dates in a job shop environment. Sequence dependent setups are also considered. The additional constraints of material and resource availability are also taken into consideration. The scheduling is to be considered in integration with production plannin...

  16. EFFICIENT SCHEDULING STRATEGY USING COMMUNICATION AWARE SCHEDULING FOR PARALLEL JOBS IN CLUSTERS

    OpenAIRE

    A.Neela Madheswari; R. S. D. Wahida Banu

    2013-01-01

    In the area of Computer Science, Parallel job scheduling is an important field of research. Finding a best suitable processor on the high performance or cluster computing for user submitted jobs plays animportant role in measuring system performance. A new scheduling technique called communication aware scheduling is devised and is capable of handling serial jobs, parallel jobs, mixed jobs and dynamic jobs.This work focuses the comparison of communication aware scheduling with the available p...

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

    OpenAIRE

    Hayes, Steven C.; Brownstein, Aaron J.; Haas, Joseph R.; Greenway, David E

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

  18. The following schedule of reinforcement as a fundamental determinant of steady state contrast in multiple schedules

    OpenAIRE

    Williams, Ben A.

    1981-01-01

    Two experiments investigated whether steady-state interactions in multiple schedules depend exclusively on the following schedule of reinforcement. Experiment 1 used a four-component multiple schedule in which two components were associated with the same constant schedule of reinforcement, and where rate of reinforcement was varied in the component that followed one of these. Contrast effects were reliable only in the component that preceded the point of reinforcement variation, although some...

  19. The delivery commitment schedule process

    Energy Technology Data Exchange (ETDEWEB)

    Vance, S.A. (Pacific Northwest Lab., Richland, WA (United States))

    1991-01-01

    The Standard Contract for the Disposal of Spent Nuclear Fuel (SNF) and/or High-Level Radioactive Waste (HLW) (herein referred to as the Contract) tasked the U.S. Department of Energy (DOE) with the development of a transportation system adequate to service both utilities and the waste management system (WMS). Due to the nature of the Contract, this development must take place prior to the utilities' final determination of the specific SNF that they will deliver during each allocation period. The Delivery Commitment Schedule (DCS) process is designed to initiate the identification of the SNF that will be delivered at a given time in order to aid in the development of the transportation system.

  20. The delivery commitment schedule process

    Energy Technology Data Exchange (ETDEWEB)

    Vance, S.A.

    1991-07-01

    The Standard Contract for the Disposal of Spent Nuclear Fuel (SNF) and/or High-Level Radioactive Waste (HLW) (herein referred to as the Contract'') tasked the Department of Energy with the development of a transportation system adequate to service both utilities and the waste management system (WMS). Due to the nature of the Contract, this development must take place prior to the utilities' final determination of the specific SNF that they will deliver during each allocation period. The Delivery Commitment Schedule (DCS) process is designed to initiate the identification of the SNF that will be delivered at a given time in order to aid in the development of the transportation system. This paper highlights the aspects of the DCS process that will be beneficial to the development of the transportation system. 4 refs.

  1. CASSIUS: The Cassini Uplink Scheduler

    Science.gov (United States)

    Bellinger, Earl

    2012-01-01

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

  2. Dosing Schedules for Pneumococcal Conjugate Vaccine

    Science.gov (United States)

    2014-01-01

    Since second generation pneumococcal conjugate vaccines (PCVs) targeting 10 and 13 serotypes became available in 2010, the number of national policy makers considering these vaccines has steadily increased. An important consideration for a national immunization program is the timing and number of doses—the schedule—that will best prevent disease in the population. Data on disease epidemiology and the efficacy or effectiveness of PCV schedules are typically considered when choosing a schedule. Practical concerns, such as the existing vaccine schedule, and vaccine program performance are also important. In low-income countries, pneumococcal disease and deaths typically peak well before the end of the first year of life, making a schedule that provides PCV doses early in life (eg, a 6-, 10- and 14-week schedule) potentially the best option. In other settings, a schedule including a booster dose may address disease that peaks in the second year of life or may be seen to enhance a schedule already in place. A large and growing body of evidence from immunogenicity studies, as well as clinical trials and observational studies of carriage, pneumonia and invasive disease, has been systematically reviewed; these data indicate that schedules of 3 or 4 doses all work well, and that the differences between these regimens are subtle, especially in a mature program in which coverage is high and indirect (herd) effects help enhance protection provided directly by a vaccine schedule. The recent World Health Organization policy statement on PCVs endorsed a schedule of 3 primary doses without a booster or, as a new alternative, 2 primary doses with a booster dose. While 1 schedule may be preferred in a particular setting based on local epidemiology or practical considerations, achieving high coverage with 3 doses is likely more important than the specific timing of doses. PMID:24336059

  3. 17 CFR Schedule A to Part 286 - Schedule A to Part 286

    Science.gov (United States)

    2010-04-01

    ... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Schedule A to Part 286 A Schedule A to Part 286 Commodity and Securities Exchanges SECURITIES AND EXCHANGE COMMISSION (CONTINUED) Schedule A to Part 285 GENERAL RULES AND REGULATIONS PURSUANT TO SECTION 11(a) OF THE...

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

  5. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Classification schedules. 2..., DEPARTMENT OF COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Classification § 2.85 Classification schedules. (a) International classification system. Section 6.1 of this chapter sets forth the...

  6. Patient Scheduling with a Personal Touch

    OpenAIRE

    Durst, Stephen

    1989-01-01

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

  7. On the Road to Improved Scheduling

    DEFF Research Database (Denmark)

    Lindhard, Søren Munch; Wandahl, Søren

    2013-01-01

    Scheduling in onsite construction is based on commitments. Unmet commitments result in non-completions which leads to waste. Moreover, it is important that commitments are realistic to avoid both positive and negative variation in duration. Negative variation is destructive to plans and schedules...

  8. Dishabituation Produces Interactions during Multiple Schedules

    Science.gov (United States)

    McSweeney, Frances K.; Kowal, Benjamin P.; Murphy, Eric S.; Isava, Duane M.

    2004-01-01

    McSweeney and Weatherly (1998) argued that differential habituation to the reinforcer contributes to the behavioral interactions observed during multiple schedules. The present experiment confirmed that introducing dishabituators into one component of a multiple schedule increases response rate in the other, constant, component. During baseline,…

  9. NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    XIE Zhiqiang; YE Guangjie; ZHANG Dali; TAN Guangyu

    2008-01-01

    Considering the complex constraint between operations in nonstandard job shop scheduling problem (NJSSP), critical path of job manufacturing tree is determined according to priority scheduling function constructed. Operations are divided into dependent operations and independent operations with the idea of subsection, and corresponding scheduling strategy is put forward according to operation characteristic in the segment and the complementarities of identical function machines. Forward greedy rule is adopted mainly for dependent operations to make operations arranged in the right position of machine selected, then each operation can be processed as early as possible, and the total processing time of job can be shortened as much as possible. For independent operations optimum scheduling rule is adopted mainly, the inserting position of operations will be determined according to the gap that the processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal gap. Experiments show, under the same conditions, the result that operations are scheduled according to the object function constructed, and the scheduling strategy adopted is better than the result that operations are scheduled according to efficiency scheduling algorithm.

  10. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc

    2016-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the processing times of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated

  11. 5 CFR 293.511 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Retention schedule. 293.511 Section 293.511 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS PERSONNEL RECORDS Employee Medical File System Records § 293.511 Retention schedule. (a) Temporary EMFS records...

  12. Scheduling Algorithm for Complex Product Development

    Institute of Scientific and Technical Information of China (English)

    LIUMin; ZHANGLong; WUCheng

    2004-01-01

    This paper describes the Complex product development project scheduling problem (CPDPSP) with a great number of activities, complicated resource, precedence and calendar constraints. By the conversion of precedence constraint relations, the CPDPSP is simplified. Then, according to the predictive control principle, we propose a new scheduling algorithm Based on prediction (BoP-procedure). In order to get the problem characteristics coming from resource status and precedence constraints of the scheduling problem at the scheduling time, a sub-project is constructed on the basis of a sub-AoN (Activity on node) graph of the project. Then, we use the modified GDH-procedure to solve the sub-project scheduling problem and to obtain the maximum feasible active subset for determining the activity group which satisfies resource, precedence and calendar constraints and has the highest scheduling priority at the scheduling time. Additionaily, we make a great number of numerical computations and compare the performance of BoP-procedure algorithm with those of other scheduling algorithms. Computation results show that the BoP-procedure algorithm is more suitable for the CPDPSP. At last, we discuss briefly future research work in the CPDPSP.

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

  14. Scheduling Sanity in the Elementary Schools.

    Science.gov (United States)

    Curatilo, Joseph S.

    1983-01-01

    Use of the music block schedule for elementary band, chorus, and orchestra programs has many advantages. For example, it eliminates the need to pull students from class and abates classroom teacher and music teacher friction. Solutions to other problems often encountered in scheduling are also discussed. (RM)

  15. Downlink Scheduling in Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Anwar Hossain

    2015-06-01

    Full Text Available This is an investigated research article on resource block scheduling of Long Term Evolution (LTE. LTE is one of the evolutions of the Universal Mobile Telecommunication System (UMTS. It provides internet access to mobile users through smart phone, laptop and other android devices. LTE offers a high speed data and multimedia services. It supports data rates up to 100 Mbps in the downlink and 50 Mbps in the uplink transmission. Our research investigation was aim to the downlink scheduling. We have considered The Best CQI scheduling algorithm and the Round Robin scheduling algorithm. The implementation, analysis and comparison of these scheduling algorithms have been performed through MATLAB simulator. We have analyzed the impact of the scheduling schemes on the throughput and the fairness of both scheduling schemes. Here we have proposed a new scheduling algorithm that achieves a compromise between the throughput and the fairness. Orthogonal Frequency Division Multiplexing (OFDM has been adopted as the downlink transmission scheme. We have considered the impact of the channel delay on the throughput. In addition, MIMO transceiver systems have been implemented to increase the throughput

  16. Scheduling in high performance buffered crossbar switches

    NARCIS (Netherlands)

    Mhamdi, L.

    2007-01-01

    High performance routers are the basic building blocks of the Internet. Most high performance routers built today use crossbars and a centralized scheduler. Due to their high scheduling complexity, crossbar-based routers are not scalable and cannot keep pace with the explosive growth of the Internet

  17. Shaping Academic Task Engagement with Percentile Schedules

    Science.gov (United States)

    Athens, Elizabeth S.; Vollmer, Timothy R.; St. Peter Pipkin, Claire C.

    2007-01-01

    The purpose of this study was to examine the use of percentile schedules as a method of quantifying the shaping procedure in an educational setting. We compared duration of task engagement during baseline measurements for 4 students to duration of task engagement during a percentile schedule. As a secondary purpose, we examined the influence on…

  18. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... Schedule, 76 FR 28194. In response to the notice, one comment was received regarding excessive fees. The... was published in the Federal Register and went into effect on June 15, 2010, 75 FR 39629. Board Action... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety...

  19. 40 CFR 155.25 - Schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 23 2010-07-01 2010-07-01 false Schedule. 155.25 Section 155.25 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) PESTICIDE PROGRAMS REGISTRATION STANDARDS AND REGISTRATION REVIEW Docketing and Public Participation Procedures § 155.25 Schedule. EPA...

  20. 21 CFR 1308.14 - Schedule IV.

    Science.gov (United States)

    2010-04-01

    ... § 1308.14, see the List of CFR Sections Affected, which appears in the Finding Aids section of the... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule IV. 1308.14 Section 1308.14 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED...

  1. 29 CFR 1952.261 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... legislation. (e) Promulgation of 29 CFR part 1904 as a State regulation, including any amendments to part 1904... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.261 Section 1952.261 Labor... schedule. (a) Enactment of the Michigan Occupational Safety and Health Act by December 1973....

  2. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.173 Section 1952.173 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Within 1 year following plan approval, legislation will be enacted authorizing...

  3. 29 CFR 1952.211 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.211 Section 1952.211 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Occupational health study accepted and implementation begun July, 1973; (b) Compliance...

  4. 21 CFR 1308.12 - Schedule II.

    Science.gov (United States)

    2010-04-01

    ... (PCC) 8603 Editorial Note: For Federal Register citations affecting § 1308.12, see the List of CFR... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule II. 1308.12 Section 1308.12 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED...

  5. 40 CFR 63.521 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 9 2010-07-01 2010-07-01 false Compliance schedule. 63.521 Section 63.521 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED... Compliance schedule. (a) Owners or operators of existing affected BLR and WSR sources shall comply with...

  6. 49 CFR 224.107 - Implementation schedule.

    Science.gov (United States)

    2010-10-01

    ... brake test as prescribed by 49 CFR 232.305. (ii) A freight rolling stock owner may elect not to follow... 49 Transportation 4 2010-10-01 2010-10-01 false Implementation schedule. 224.107 Section 224.107... Maintenance of Retroreflective Material § 224.107 Implementation schedule. (a) Railroad freight cars....

  7. 7 CFR 3011.6 - Fee schedule.

    Science.gov (United States)

    2010-01-01

    ... for a schedule of reasonable standard charges for document search and duplication. See 7 CFR 1.2(b). Fees to be charged are set forth in 7 CFR part 1, subpart A, Appendix A. ... 7 Agriculture 15 2010-01-01 2010-01-01 false Fee schedule. 3011.6 Section 3011.6...

  8. 29 CFR 1952.201 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.201 Section 1952.201 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Retraining of present occupational safety and health personnel during March-May 1973;...

  9. 49 CFR 10.75 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 1 2010-10-01 2010-10-01 false Fee schedule. 10.75 Section 10.75 Transportation Office of the Secretary of Transportation MAINTENANCE OF AND ACCESS TO RECORDS PERTAINING TO INDIVIDUALS Fees § 10.75 Fee schedule. (a) Copies of documents by photocopy or similar method: Each page not...

  10. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ..., 2010 the Board published for comment in the Federal Register its Proposed FOIA Fee Schedule, 75 FR... Federal Register and went into effect on May 1, 2009, 74 FR 20934. Board Action Accordingly, the Board... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment...

  11. Hybrid optimal scheduling for intermittent androgen suppression of prostate cancer

    Science.gov (United States)

    Hirata, Yoshito; di Bernardo, Mario; Bruchovsky, Nicholas; Aihara, Kazuyuki

    2010-12-01

    We propose a method for achieving an optimal protocol of intermittent androgen suppression for the treatment of prostate cancer. Since the model that reproduces the dynamical behavior of the surrogate tumor marker, prostate specific antigen, is piecewise linear, we can obtain an analytical solution for the model. Based on this, we derive conditions for either stopping or delaying recurrent disease. The solution also provides a design principle for the most favorable schedule of treatment that minimizes the rate of expansion of the malignant cell population.

  12. Dosimetric evaluation of the correction by the presence of the treatment table in the scheduler Eclipse; Evaluacion de la correccion dosimetrica por la presencia de la mesa de tratamiento en el planificador Eclipse

    Energy Technology Data Exchange (ETDEWEB)

    Diaz Pascual, V.; Vazquez Galinanes, A.; Sanz Freire, C. J.; Collado Chamorro, P.; Gomez Amez, J.; Martinez Sanchez, S.; Ossola Lentati, G. A.

    2011-07-01

    Radiotherapy planners modeled with great precision the physical characteristics of the patient and the radiation beams that cross it, however it is common for these calculations obviate the presence of elements such as immobilizer and the actual treatment table. Although at present the immobilizer are reasonably radio-transparent to accept such an approach, the support structures can have an appreciable influence on dosimetry. Not usually considered in the calculation, not being included in the CT images. This work uses the modeling of the treatment table in the planner to estimate their influence dosimetry.

  13. Performance analysis of active schedules in identical parallel machine

    Institute of Scientific and Technical Information of China (English)

    Changjun WANG; Yugeng XI

    2007-01-01

    Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs' dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

  14. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

    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

  15. Dynamic Scheduling of Flexible Job Shops

    Institute of Scientific and Technical Information of China (English)

    SHAHID Ikramullah Butt; SUN Hou-fang

    2007-01-01

    Aim of this research is to minimize makespan in the flexible job shop environment by the use of genetic algorithms and scheduling rules.Software is developed using genetic algorithms and scheduling rules based on certain constraints such as non-preemption of jobs,recirculation,set up times,non-breakdown of machines etc.Purpose of the software is to develop a schedule for flexible job shop environment,which is a special case of job shop scheduling problem.Scheduling algorithm used in the software is verified and tested by using MT10 as benchmark problem,presented in the flexible job shop environment at the end.LEKIN(R) software results are also compared with results of the developed software by the use of MT10 benchmark problem to show that the latter is a practical software and can be used successfully at BIT Training Workshop.

  16. Scheduling multicore workload on shared multipurpose clusters

    Science.gov (United States)

    Templon, J. A.; Acosta-Silva, C.; Flix Molina, J.; Forti, A. C.; Pérez-Calero Yzquierdo, A.; Starink, R.

    2015-12-01

    With the advent of workloads containing explicit requests for multiple cores in a single grid job, grid sites faced a new set of challenges in workload scheduling. The most common batch schedulers deployed at HEP computing sites do a poor job at multicore scheduling when using only the native capabilities of those schedulers. This paper describes how efficient multicore scheduling was achieved at the sites the authors represent, by implementing dynamically-sized multicore partitions via a minimalistic addition to the Torque/Maui batch system already in use at those sites. The paper further includes example results from use of the system in production, as well as measurements on the dependence of performance (especially the ramp-up in throughput for multicore jobs) on node size and job size.

  17. A Study on Scheduling in Grid Environment

    Directory of Open Access Journals (Sweden)

    Dr.K.Vivekanandan,

    2011-02-01

    Full Text Available Grid Computing is a high performance computing environment that allows sharing of geographically distributed resources across multiple administrative domains and used to solve large scale computational demands. In the grid environment, users can access the resources transparently without knowing where they are physically located. To achieve the promising potentials of computational grids, job scheduling is an important issue to be considered. Scheduling is very complica ted due to the unique characteristics of the grids. This paper gives a classification of scheduling algorithms in distributed computing and the algorithms that are applicable to grid environment. It also studies performance of various scheduling algorithms and the softwares that support scheduling in real grid environment as well as simulated environment.

  18. The EUVE proposal database and scheduling system

    Science.gov (United States)

    Christian, C.; Olson, E.; Jelinsky, P.; Samuel, M.

    1992-01-01

    The proposal database and scheduling system for the Extreme Ultraviolet Explorer will be described. The proposal database has been implemented to take input for approved observations selected by the EUVE Peer Review Panel and output target information suitable for the scheduling system to digest. The scheduling system is a hybrid of the SPIKE program and EUVE software which checks spacecraft constraints, produces a proposed schedule and selects spacecraft orientations with optimal configurations for acquiring star trackers, etc. This system has been used to schedule the In Orbit Calibration activities that took place this summer, following the EUVE launch in early June 1992. The implemented strategy has implications for the selection of approved targets, which have impacted the Peer Review process. In addition, it will be discussed how the proposal database, founded on Sybase, controls the processing of EUVE Guest Observer data.

  19. Scheduler Vulnerabilities and Attacks in Cloud Computing

    CERN Document Server

    Zhou, Fangfei; Desnoyers, Peter; Sundaram, Ravi

    2011-01-01

    In hardware virtualization a hypervisor provides multiple Virtual Machines (VMs) on a single physical system, each executing a separate operating system instance. The hypervisor schedules execution of these VMs much as the scheduler in an operating system does, balancing factors such as fairness and I/O performance. As in an operating system, the scheduler may be vulnerable to malicious behavior on the part of users seeking to deny service to others or maximize their own resource usage. Recently, publically available cloud computing services such as Amazon EC2 have used virtualization to provide customers with virtual machines running on the provider's hardware, typically charging by wall clock time rather than resources consumed. Under this business model, manipulation of the scheduler may allow theft of service at the expense of other customers, rather than merely reallocating resources within the same administrative domain. We describe a flaw in the Xen scheduler allowing virtual machines to consume almost...

  20. 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. PMID:10167872

  1. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

    Alessandri, Jérôme; Cançado, Carlos R X

    2015-12-01

    The generalized matching equation provides a good description of response allocation in concurrent schedules of positive reinforcement in nonhumans as well as in humans. The present experiment was conducted to further investigate the allocation of responding under concurrent schedules of negative reinforcement (i.e., timeouts from pressing a force cell) in humans. Each of three participants was exposed to different reinforcement ratios (9:1, 1:1 and 1:9) in the terminal links of a concurrent-chains schedule of negative reinforcement. The allocation of responding under this schedule was well described by the generalized matching equation, for each participant. These results replicate previous findings obtained with nonhumans and humans under concurrent schedules of positive reinforcement. In addition, they extend the results reported by Alessandri and Rivière (2013) showing that human behavior maintained by timeouts from an effortful response is sensitive to changes in relative reinforcement ratios as well as relative delays of reinforcement. PMID:26518610

  2. Improved utilization and responsiveness with gang scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Feitelson, D.G., [Institute of Computer Science, The Hebrew University of Jerusalem (IsraelL); Jette, M.A. [Lawrence Livermore National Lab., CA (United States)

    1996-10-01

    Most commercial multicomputers use space-slicing schemes in which each scheduling decision has an unknown impact on the future: should a job be scheduled, risking that it will block other larger jobs later, or should the processors be left idle for now in anticipation of future arrivals? This dilemma is solved by using gang scheduling, because then the impact of each decision is limited to its time slice, and future arrivals can be accommodated in other time slices. This added flexibility is shown to improve overall system utilization and responsiveness. Empirical evidence from using gang scheduling on a Cray T3D installed at Lawrence Livermore National Lab corroborates these results, and shows conclusively that gang scheduling can be very effective with current technology. 29 refs., 10 figs., 6 tabs.

  3. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

    Alessandri, Jérôme; Cançado, Carlos R X

    2015-12-01

    The generalized matching equation provides a good description of response allocation in concurrent schedules of positive reinforcement in nonhumans as well as in humans. The present experiment was conducted to further investigate the allocation of responding under concurrent schedules of negative reinforcement (i.e., timeouts from pressing a force cell) in humans. Each of three participants was exposed to different reinforcement ratios (9:1, 1:1 and 1:9) in the terminal links of a concurrent-chains schedule of negative reinforcement. The allocation of responding under this schedule was well described by the generalized matching equation, for each participant. These results replicate previous findings obtained with nonhumans and humans under concurrent schedules of positive reinforcement. In addition, they extend the results reported by Alessandri and Rivière (2013) showing that human behavior maintained by timeouts from an effortful response is sensitive to changes in relative reinforcement ratios as well as relative delays of reinforcement.

  4. Garbage Collection Scheduling of Aperiodic Tasks

    Institute of Scientific and Technical Information of China (English)

    Ning Zhang; Guang-Ze Xiong

    2009-01-01

    In the previous work of garbage collection (GC) models, scheduling analysis was given based on an assumption that there were no aperiodic mutator tasks. However, it is not true in practical real-time systems. The GC algorithm which can schedule aperiodic tasks is proposed, and the variance of live memory is analyzed. In this algorithm, active tasks are deferred to be processed by GC until the states of tasks become inactive, and the saved sporadic server time can be used to schedule aperiodic tasks. Scheduling the sample task sets demonstrates that this algorithm in this paper can schedule aperiodic tasks and decrease GC work. Thus, the GC algorithm proposed is more flexible and portable.

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

  6. Approximation algorithm for multiprocessor parallel job scheduling

    Institute of Scientific and Technical Information of China (English)

    陈松乔; 黄金贵; 陈建二

    2002-01-01

    Pk|fix|Cmax problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k≥3. This paper focuses on the case of k=3. Some new observations and new techniques for P3|fix|Cmax problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P3|fix|Cmax problem, and improves the previous best ratio of 7/6 by M.X.Goemans.

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

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

  9. Scheduling mammograms for asymptomatic women

    International Nuclear Information System (INIS)

    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

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

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

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

  13. A computer-checked verification of Milner's scheduler

    OpenAIRE

    Korver, H.; Springintveld, J.

    1993-01-01

    We present an equational verification of Milner's scheduler, which we checked by computer.To our knowledge this is the first time that the scheduler is proof-checked for a general number n of scheduled processes.

  14. 77 FR 10529 - Federal Acquisition Regulation; Information Collection; Delivery Schedules

    Science.gov (United States)

    2012-02-22

    ... Regulation; Information Collection; Delivery Schedules AGENCY: Department of Defense (DOD), General Services... requirement concerning delivery schedules. Public comments are particularly invited on: Whether this...- 0043, Delivery Schedules by any of the following methods: Regulations.gov :...

  15. Prediction of responsiveness or non-responsiveness to treatment of acute Kawasaki disease using 1 gram per kilogram of immunoglobulin--an effective and cost-saving schedule of therapy.

    Science.gov (United States)

    Ichihashi, Ko; Shiraishi, Hirohiko; Momoi, Mariko

    2009-06-01

    Standard treatment of acute Kawasaki disease involves giving 2 grams per kilogram of immunoglobulin intravenously along with aspirin. More than half of the patients with acute Kawasaki disease, nonetheless, can be cured by giving only 1 gram per kilogram of immunoglobulin, thus reducing this aspect of the cost of treatment by half. Our purpose was to predict those patients with acute Kawasaki disease who would respond to treatment with 1 gram per kilogram of immunoglobulin given intravenously on the basis of their clinical profiles and laboratory findings prior to the initial treatment. We performed a retrospective review of the clinical records of consecutive patients with acute Kawasaki disease treated in our hospital with intravenous immunoglobulin from January, 2001, to December, 2005.During this period, we treated in this fashion 98 patients with acute Kawasaki disease. 65% of these needing immunoglobulin therapy were cured by giving 1 gram per kilogram. The neutrophil count and the percentage of white blood cells representing neutrophils, along with aspirate aminotransferase, alanine aminotransferase, bilirubin and C reactive protein, were all significantly lower, and sodium was significantly higher, in those responding to 1 gram per kilogram of immunoglobulin when compared to those who did not respond. The days of illness at the first intravenous treatment was later in those responding than in those failing to respond. We generated a score for prediction, assigning a point for each of C reactive protein equal to or greater than 10 mg/dl, sodium equal to or lower than 133 meq/l, alanine aminotransferase equal to or greater than 110 IU/l, and 2 points for the percentage of white blood cells representing neutrophils equal to or greater than 70%. Using a cut-off point of a score less than 2, we were able to identify those responding with 60% sensitivity, and 91% specificity.Thus, we are now able to predict those patients with acute Kawasaki disease who will

  16. Observing of chain-schedule stimuli.

    Science.gov (United States)

    Slezak, Jonathan M; Anderson, Karen G

    2014-06-01

    A classical-conditioning account of the processes maintaining behavior under chained schedules entails a backward transmission of conditioned-reinforcement effects. Assessing this process in traditional chain schedules is limited because the response maintained by stimulus onset accompanied by each link in a chain schedule may also be maintained by the primary reinforcer. In the present experiment, an observing response was used to measure the conditioned-reinforcing effects of stimuli associated with a three-link chain variable-time (VT) food schedule, and resistance-to-change tests (extinction and prefeeding) were implemented to examine if a backward transmission of reinforcement effects occur. Four pigeons served as subjects. Observing was maintained by the production of stimuli correlated with links of a three-link chain VT schedule with the middle-link stimulus maintaining the highest rate of observing, followed by the initial-link stimulus and the terminal-link stimulus maintaining the lowest observing rate. Results from resistance-to-change tests of extinction and prefeeding were not supportive of a backward transmission of reinforcement effects and in general, the pattern of resistance-to-change was forward. Based on past and current research, it appears that a backward pattern of relative rate decreases in responses maintained by stimuli correlated with a chain schedule due to disruption (i.e., extinction and prefeeding) is not a ubiquitous process that is evident within different chain-schedule arrangements.

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

  18. STATUS OF SCHEDULE TRIBES IN ANDHRA PRADESH

    Directory of Open Access Journals (Sweden)

    Dr. P. Subramanyachary

    2013-01-01

    Full Text Available Schedule Tribes (ST’s are Indian population groups that are explicitly recognized by the constitution of India order 1950. The order lists 744 tribes across 22 states in its first schedule. In Andhra Pradesh 33 types of Schedule Tribes are living in 8 districts. ST’s are 6.6% are in total population of Andhra Pradesh. They have rich heritage along with their innocent life style. As they are living in hill areas and forests they have some peculiar characters like indications of primitive traits, distinctive culture, and shyness of contact with other communities, geographical isolation, backwardness etc. So, for their development central and state governments are implementing different programmes and schemes since 1951. After the Ministry of Tribal affairs were constituted in 1999, there is more focus on development of Schedule Tribes in Indian society especially in Andhra Pradesh. The persisting problems like low literacy and high drop-outs, inadequate health services, lack of nutrition food, extreme poverty, and ineffective implementation of schemes etc are putting them away from economic development. Hence, there should be more commitment by both central and state government and local bodies to develop Schedule Tribes in the society. As literacy is 37% NGO’s and other voluntary organizations have to play key role to bring awareness among schedule tribes regarding programs and scheme for their development. Awareness and participation of Schedule Tribes in the implementation of policies leads to prosperity of ST community in the state as well as country.

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

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

  1. NRC comprehensive records disposition schedule. Revision 3

    International Nuclear Information System (INIS)

    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)

  2. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

    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

  3. Use of Data Mining in Scheduler Optimization

    CERN Document Server

    Anderson, George; Nelwamondo, Fulufhelo V

    2010-01-01

    The operating system's role in a computer system is to manage the various resources. One of these resources is the Central Processing Unit. It is managed by a component of the operating system called the CPU scheduler. Schedulers are optimized for typical workloads expected to run on the platform. However, a single scheduler may not be appropriate for all workloads. That is, a scheduler may schedule a workload such that the completion time is minimized, but when another type of workload is run on the platform, scheduling and therefore completion time will not be optimal; a different scheduling algorithm, or a different set of parameters, may work better. Several approaches to solving this problem have been proposed. The objective of this survey is to summarize the approaches based on data mining, which are available in the literature. In addition to solutions that can be directly utilized for solving this problem, we are interested in data mining research in related areas that have potential for use in operat...

  4. Enhanced ANT Colony algorithm for Grid Scheduling

    Directory of Open Access Journals (Sweden)

    D.Maruthanayagam

    2010-11-01

    Full Text Available Grid computing is to make multiple machines that may be in different physical locations, behave like they are one large virtual machine. Grid scheduling environment is a arranging the machines in the course of find it fast called the Ant algorithm. The find for resource in the collection of geographically distributed heterogeneous computing systems and making scheduling decisions, taking into consideration eminence of service. Allocation of resources to a large number of jobs in a grid computing environment presents more difficulty than in network computational environments. Resource and job will have been allocating by resource discovery and filtering, composed of the selection of resources and idea specific scheduling and job submission. This algorithm is evaluated using the simulated execution times for a grid environment. Before starting the grid scheduling, the expected execution time for each task on each machine must be estimated and represented by an Expected Time calculation. The proposed scheduler allocates adopt the system environment freely at runtime. This resource optimally and adaptively in the scalable, dynamic and distribute controlled environment. Conclude of this propose depending upon the performance of the grid systems. Key words: Grid Computing, Job Scheduling, Heuristic Algorithm, Load Balancing, scheduling algorithm simulation, ant algorithm

  5. Mixed-Integer Formulations for Constellation Scheduling

    Science.gov (United States)

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

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

  6. Optimal radiotherapy dose schedules under parametric uncertainty

    Science.gov (United States)

    Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

    2016-01-01

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

  7. Knowledge-Based Approaches for Scheduling Problems: A Survey

    OpenAIRE

    Noronha, SJ; Sarma, VVS

    1991-01-01

    Scheduling is the process of devising or designing a procedure for a particular objective, specifying the sequence or time for each item in the procedure. Typical scheduling problems are railway time-tabling, project scheduling, production scheduling, and scheduling computer systems as in flexible manufacturing systems and multiprocessor scheduling. Further, there are a number of related problems belonging to the larger class of planning problems, such as the early stage of project management...

  8. A control-theoretical methodology for the scheduling problem

    OpenAIRE

    Furia, Carlo A.; Leva, Alberto; Maggio, Martina; Spoletini, Paola

    2010-01-01

    This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to design a scheduling algorithm that meets specific requirements. Unlike most approaches to feedback scheduling, where a controller integrates a "basic" scheduling algorithm and dynamically tunes its parameters and hence its performances, our methodology essentially reduces the design of a scheduling algorithm to the syn...

  9. On the Fairness of Probabilistic Schedulers for Population Protocols

    OpenAIRE

    Chatzigiannakis, Ioannis; Dolev, Shlomi; Fekete, Sándor; Michail, Othon; Spirakis, Paul

    2010-01-01

    We propose a novel, generic definition of emph{probabilistic schedulers} for population protocols. We design two new schedulers, the emph{State Scheduler} and the emph{Transition Function Scheduler}. Both possess the significant capability of being emph{protocol-aware}, i.e. they can assign transition probabilities based on information concerning the underlying protocol. We prove that the proposed schedulers, and also the emph{Random Scheduler} that was defined by Angluin et al. cite{AADFP04}...

  10. Recent reinforcement-schedule research and applied behavior analysis

    OpenAIRE

    Lattal, Kennon A.; Neef, Nancy A.

    1996-01-01

    Reinforcement schedules are considered in relation to applied behavior analysis by examining several recent laboratory experiments with humans and other animals. The experiments are drawn from three areas of contemporary schedule research: behavioral history effects on schedule performance, the role of instructions in schedule performance of humans, and dynamic schedules of reinforcement. All of the experiments are discussed in relation to the role of behavioral history in current schedule pe...

  11. Schedule Uncertainty Control: A Literature Review

    Science.gov (United States)

    Jun-yan, Liu

    Risk control on project schedule is one of the focus problems in the academic circle and the practical area all the time. Lots of research about risk control on project schedule have been fulfilled and many achievements have appeared in recent several decades. The literature on the techniques of schedule uncertainty control was reviewed. A summary analysis on those chievements is presented such as CPM, PERT, MC, BBN, and so on and in light of that summary analysis a deep discussion in terms of advantages and disadvantages of existing research has been analyzed, so that researchers can continue to refine their research.

  12. Concurrent Scheduling of Event-B Models

    CERN Document Server

    Boström, Pontus; Sere, Kaisa; Waldén, Marina; 10.4204/EPTCS.55.11

    2011-01-01

    Event-B is a refinement-based formal method that has been shown to be useful in developing concurrent and distributed programs. Large models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. We explore how schedules can be designed so that their application results in a correctness-preserving refinement step. For practical application, two patterns for schedule introduction are provided, together with their associated proof obligations. We demonstrate our method by applying it on the dining philosophers problem.

  13. On the complexity of adjacent resource scheduling

    OpenAIRE

    Duin, C.W.; Sluis, van, P.

    2004-01-01

    We study the problem of scheduling resource(s) for jobs in an adjacent manner (ARS). The problem relates to fixed interval scheduling on the one hand, and to the problem of two-dimensional strip packing on the other hand. Further, there is a close relation with multiprocessor scheduling. A distinguishing characteristic is the constraint of resource-adjacency. As an application of ARS, consider an airport where passengers check in for their flight, joining lines before one or more desks; at th...

  14. EMG reactivity and oral habits among facial pain patients in a scheduled-waiting competitive task.

    Science.gov (United States)

    Nicholson, R A; Lakatos, C A; Gramling, S E

    1999-12-01

    For individuals with temporomandibular disorder (TMD) it has been theorized that stressful events trigger oral habits (e.g., teeth grinding), thereby increasing masticatory muscle tension and subsequent pain. Recent research involving adjunctive behaviors found an increase in masseter surface EMG (sEMG) and oral habits when students with TMD symptomatology were placed on a fixed-time reinforcement schedule. The current study used a treatment-seeking community sample with TMD symptomatology in a competitive task designed to be a more naturalistic Fixed Time task. The experiment consisted of Adaptation, Free-Play, Scheduled-Play, and Recovery phases. During the Scheduled-Play phase participants played, and waited to play, an electronic poker game. Results indicated that masseter muscle tension in the Scheduled-Play phase was significantly higher (p oral habits and overall affect were significantly higher (p's oral habits may lead to TMD symptomatology.

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

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

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

  18. NASA Deep Space Network Operations Scheduling

    Science.gov (United States)

    Enari, D. M.

    The functioning of the Deep Space Network Operations Scheduling, Jet Propulsion Laboratory, CA is reviewed. The primary objectives of the Operations Scheduling are: to schedule the worldwide global allocation of ground communications, tracking facilities, and equipment; and to provide deep space telecommunications for command, tracking, telemetry, and control in support of flight mission operations and tests. Elements of the earth set are Deep Space Stations (DSS) which provide the telecommunications link between the earth and spacecraft; NASA Communications Network; Network Data Processing Area; Network Operations Control Area which provides operational direction to the DSS; Mission Control and Computing systems; and Mission Support areas which provide flight control of the spacecraft. Elements of the space set include mission priorities and requirements which determine the spacecraft queue for allocating network resources. Scheduling is discussed in terms of long-range (3 years), mid-range (8 weeks), and short-range (2 weeks).

  19. Intelligent Feedback Scheduling of Control Tasks

    Directory of Open Access Journals (Sweden)

    Fatin I. Telchy

    2014-12-01

    Full Text Available an efficient feedback scheduling scheme based on the proposed Feed Forward Neural Network (FFNN scheme is employed to improve the overall control performance while minimizing the overhead of feedback scheduling which exposed using the optimal solutions obtained offline by mathematical optimization methods. The previously described FFNN is employed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. The proposed intelligent scheduler will be examined with different optimization algorithms. An inverted pendulum cost function is used in these experiments. Then, simulation of three inverted pendulums as intelligent Real Time System (RTS is described in details. Numerical simulation results demonstrates that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling

  20. A Cyclical Nurse Schedule Using Goal Programming

    Directory of Open Access Journals (Sweden)

    Ruzzakiah Jenal

    2011-11-01

    Full Text Available Scheduling is a very tedious task in organizations where duty is around the clock. Constructing timetable for nurses in hospital is one of the challenging jobs for the head nurse or nurse manager. It requires a lot of time to spend for generating a good and fair timetable. Thus, in this study, we propose a cyclical nurse scheduling model using a 0-1 goal programming that would help the head nurse or nurse manager to have less effort on building new schedules periodically. The proposed model satisfies the stated hospital’s policies and the nurses’ preferences. The result obtained from this model gives an optimal solution where all goals are achieved. The model also provides an unbiased way of scheduling the nurses and thus leads to an overall higher satisfaction and fairness to the nurses and the hospital management.

  1. Parallel Machine Scheduling with Special Jobs

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS (first come, first served), SWSC (special window for special customers), and FFFS (first fit, first served) algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 and FFFS has a competitive ratio of , and these bounds are tight.

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

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

  4. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2000-01-27

    This document contains the CY2000 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section includes sampling locations, sample types, and analyses to be performed.

  5. RESOURCE SCHEDULING IN CLOUD ENVIRONMET: A SURVEY

    Directory of Open Access Journals (Sweden)

    Neeraj Mangla

    2016-06-01

    Full Text Available Cloud Computing offers the avant-garde services at a stretch that are too attractive for any cloud user to ignore. With its growing application and popularization, IT companies are rapidly deploying distributed data centers globally, posing numerous challenges in terms of scheduling of resources under different administrative domains. This perspective brings out certain vital factors for efficient scheduling of resources providing a wide genre of characteristics, diversity in context of level of service agreements and that too with user-contingent elasticity. In this paper, a comprehensive survey of research related to various aspects of cloud resource scheduling is provided. A comparative analysis of various resource scheduling techniques focusing on key performance parameters like Energy efficiency, Virtual Machine allocation and migration, Cost-effectiveness and Service-Level Agreement is also presented.

  6. Onboard Autonomous Scheduling Intelligence System Project

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

  7. Effect of Uncertainty on Deterministic Runway Scheduling

    Science.gov (United States)

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

    2012-01-01

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

  8. Oversubscribed Mission Scheduler Conflict Resolution System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The allocation and scheduling of limited communication assets to an increasing number of satellites and other spacecraft remains a complex and challenging problem....

  9. Physician Fee Schedule Carrier Specific Files

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Centers for Medicare and Medicaid Services (CMS) has condensed all 56 Physician Fee Schedule (PFS) carrier specific pricing files into one zip file. It is...

  10. Hybrid Multiprocessor Real-Time Scheduling Approach

    Directory of Open Access Journals (Sweden)

    Ali A Safaei

    2011-03-01

    Full Text Available Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system's requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can NOT guarantee to provide an optimal schedule. The global approach can provide this guarantee by holding some preconditions and considerable overheads. In this paper, an intermediate hybrid multiprocessor real-time scheduling approach is proposed in which optimality will be reached via the minimum overheads for underlying system. Presenting and analyzing different feasible paradigms for combination of the two existing approaches, the proposed hybrid approach satisfies the two major goals of this combination: optimality and lightweightness. Experimental results show that the hybrid approach outperforms the two existing ones.

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

  12. A Truthful Mechanism for Offline Ad Slot Scheduling

    CERN Document Server

    Feldman, Jon; Nikolova, Evdokia; Pal, Martin

    2008-01-01

    We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not be assigned to more than one slot for a particular search. We give a truthful mechanism under the utility model where bidders try to maximize their clicks, subject to their personal constraints. In addition, we show that the revenue-maximizing mechanism is not truthful, but has a Nash equilibrium whose outcome is identical to our mechanism. As far as we can tell, this is the first treatment of sponsored search that directly incorporates both multiple slots and budget constraints into an analysis of incentives. Our mechanism employs a descending-price auction that maintains a solution to a certain machine scheduling problem whose job lengths depend on the price, and hence is variable over the auction. The price stops when the set of bidders that can afford that price pack exa...

  13. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    GANTT, D.A.

    2000-01-12

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FETF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This revision reflects the 19 Oct 1999 baseline.

  14. DMP Packet Scheduling For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Pallavi Sawale

    2015-01-01

    Full Text Available Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the packet which will enter last will leave at last. But in FCFS scheduling of real time data packets coming to the node have to wait for a long time period.In non pre emptive priority scheduling algorithm there is starvation of real time data packets because once the processor enters the running state, it will not allow remove until it is completed, so there is starvation of real time data packets. In pre emptive scheduling, starvation of non real time data packets, due to continuous arrival of real time data. Therefore the data packets are to be schedule in multilevel queue. But the multilevel queue scheduling scheme is not suitable for dynamic inputs, and hence the scheme is designed for dynamically change in the inputs. The Dynamic Multilevel Priority (DMP packet scheduling is the scheme for dynamically changes in the inputs. In this scheme each node except the last level of the virtual hierarchy in the zone based topology of wireless sensor network has three levels of priority queues. Real time data packets are placed into highest priority queue and can preempt the data packets in the other queues. Non real time data packets are placed into other two queues based on threshold of their estimated processing time. The leaf node have two queues, one for real time data packet and another for non real time data packet since they do not receive data from other nodes and thus reduces end to end delay. This scheme reduces the average waiting time and end-to –end delay of data packets.

  15. Heuristic Based Task Scheduling In Grid

    Directory of Open Access Journals (Sweden)

    Manpreet Singh

    2012-09-01

    Full Text Available Grid computing is concerned with coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Efficient scheduling of complex applications in a grid environment reveals several challenges due to its high heterogeneity, dynamic behavior and space shared utilization. Objectives of scheduling algorithms are increase in system throughput, efficiency and reduction in task completion time. The main focus of this paper is to highlight the merits of resource and task selection technique based on certain heuristics.

  16. The Lock Scheduling Problem (Het sluisplanningsprobleem)

    OpenAIRE

    Verstichel, Jannes

    2013-01-01

    The present thesis introduces the lock scheduling problem and promising decompositions into sub problems. Several combinatorial optimization methods have been developed for the lock scheduling problem. Single and parallel chamber locks and lock operations in both an inland and mixed-traffic setting are considered, and a mathematical model precisely describing the problem is presented.Three interrelated sub problems can be discerned: ship placement, chamber assignment and lockage operation sch...

  17. Planning and Scheduling of Airline Operations

    OpenAIRE

    İlkay ORHAN; Muzaffer KAPANOĞLU; T. Hikmet KARAKOÇ

    2010-01-01

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

  18. Production scheduling model in aluminium foundry:

    OpenAIRE

    Lovrić, Tadija; Majdandžić, Niko; Matičević, Gordana

    2008-01-01

    There are numerous methods and strategies for production management which are successfully implemented in the metal industry and in the automobile and machine tools industry in particular. However, little research has been published regarding scheduling foundry operations. Therefore, the main goal ofthis paper is to develop a new mathematical model for scheduling foundry operations based on the MRP II (Manufacturing Resource Planning), JIT (Just inTime) and OPT (Optimized Production Technolog...

  19. Job Shop Scheduling Problem: an Overview

    OpenAIRE

    Arisha, Amr; Young, Paul; El Baradie, Mohie

    2001-01-01

    The Job-shop scheduling is one of the most important industrial activities, especially in manufacturing planning. The problem complexity has increased along with the increase in the complexity of operations and product-mix. To solve this problem, numerous approaches have been developed incorporating discrete event simulation methodology. The scope and the purpose of this paper is to present a survey which covers most of the solving techniques of Job Shop Scheduling (JSS) problem. A classifica...

  20. A Flexible Nurse Scheduling Support System

    OpenAIRE

    Ozkarahan, Irem

    1987-01-01

    Scheduling nursing personnel in hospitals is very complex because of the variety of conflicting interests and objectives. Also, demand varies 24-hour a day 7-day a week, is skill specific and hard to forecast. In the face of this complexity, the present nurse scheduling models have met with little success. In this paper, we propose a more flexible decision support system that will satisfy the interests of both hospitals and nurses through alternative models that attempt to accommodate flexibl...

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

  2. Coordinating, Scheduling, Processing and Analyzing IYA09

    Science.gov (United States)

    Gipson, John; Behrend, Dirk; Gordon, David; Himwich, Ed; MacMillan, Dan; Titus, Mike; Corey, Brian

    2010-01-01

    The IVS scheduled a special astrometric VLBI session for the International Year of Astronomy 2009 (IYA09) commemorating 400 years of optical astronomy and 40 years of VLBI. The IYA09 session is the most ambitious geodetic session to date in terms of network size, number of sources, and number of observations. We describe the process of designing, coordinating, scheduling, pre-session station checkout, correlating, and analyzing this session.

  3. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    BOWEN, W.W.

    1999-11-08

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FFTF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This document reflects the 1 Oct 1999 baseline.

  4. An evaluation of a test scheduling solution

    OpenAIRE

    Kelly, Timothy James

    1993-01-01

    As recognized in the software engineering process, software testing during development is an aspect that must be improved to accurately predict and reduce probabilities of future software failures. A possible method of improving software reliability is to concentrate on the scheduling of the test process to reduce costs and increase coverage. Software test scheduling is the process of sequencing the test procedures to manage costs and maximize verification and validation of the system being e...

  5. Scheduling of interstate road and railway investments

    OpenAIRE

    Rothengatter, W.

    1986-01-01

    If investment activities are restricted by binding budget constraints, it may be even more important to find a good time schedule for investments rather than to determine the optimal investment program for a future time period. The problem of scheduling investments for interstate road and railway investments can be formulated as a mixed-integer programming model. But this model is so large, that it is hopeless to try to solve problems of practical relevance. For this reason two ways of simpli...

  6. JWST planning and scheduling operations and concepts

    Science.gov (United States)

    Kinzel, Wayne M.

    2010-07-01

    The James Webb Space Telescope (JWST) will be a large infrared space observatory in orbit about the Sun-Earth second Lagrange Point. This paper provides an overview of the expected operational requirements imposed by the observatory's basic science activities (imaging, spectroscopy, coronography) and the operational issues associated with interleaving periodic engineering activities (Wave Front Sensing & Control activities, Momentum Unloads, and orbit Station Keeping) with the science observations. The planning and scheduling operations must maximize the overall science integration time while meeting the mission and observer specified constraints. The "Observation," "Visit," and Observation Template constructs are explained in the context of providing an interface to the Observer that provides the ability to specify complex observations, such as mosaics and cluster targets, while also minimizing specification errors and allowing planning and scheduling flexibility of the observations. The expected nominal planning and scheduling process including the creation and maintenance of the Long Range Plan (~1.25 year duration), the Short Term Schedules (~ three weeks), and the on-board Observation Plan (< 10 days) is described. The event-driven on-board operations of JWST and how the planning and scheduling process monitors and reacts to the onboard execution of the Observation Plan are described. Finally, the methods employed to allow for robust interfacing of scheduled real-time operations (for example, Station Keeping) with the Observation Plan and unplanned, but expected, modifications to the Observation Plan (for example, Target of Opportunity) are described.

  7. Force dynamics in fixed-ratio schedules.

    Science.gov (United States)

    Pinkston, Jonathan W; McBee, Lindsey N

    2014-03-01

    Fixed-ratio schedules are widely used in behavioral research. Although fixed-ratio schedules often conjure up relationships to work and effort, little is known about effort-related measures in these schedules. Early research had shown that force and effort of operant behavior vary systematically during the execution of ratio schedules, and the goal of the present study was to revisit early research on force dynamics in fixed-ratio schedules. Four rats earned sucrose by pressing an isometric force transducer. Presses produced sucrose after ten or twenty responses. In general, the force of responses increased then decreased systematically across the ratio. The possibility that decreases in force during ratio execution was due to a trade-off with the differential reinforcement of short inter-response times (IRT) was investigated in an additional condition where sucrose was made available according to a tandem fixed-ratio 19 inter-response (IRT)> t schedule. The tandem IRT requirement did not eliminate decreasing trends in force across the ratio; unexpectedly, the tandem requirement did eliminate increases in force early in the ratio, which may reflect sequence-level organization operating in the control of force dynamics. PMID:24315798

  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. Chandra mission scheduling on-orbit experience

    Science.gov (United States)

    Bucher, Sabina; Williams, Brent; Pendexter, Misty; Balke, David

    2008-07-01

    Scheduling observatory time to maximize both day-to-day science target integration time and the lifetime of the observatory is a formidable challenge. Furthermore, it is not a static problem. Of course, every schedule brings a new set of observations, but the boundaries of the problem change as well. As spacecraft ages, its capabilities may degrade. As in-flight experience grows, capabilities may expand. As observing programs are completed, the needs and expectations of the science community may evolve. Changes such as these impact the rules by which a mission scheduled. In eight years on orbit, the Chandra X-Ray Observatory Mission Planning process has adapted to meet the challenge of maximizing day-to-day and mission lifetime science return, despite a consistently evolving set of scheduling constraints. The success of the planning team has been achieved, not through the use of complex algorithms and optimization routines, but through processes and home grown tools that help individuals make smart short term and long term Mission Planning decisions. This paper walks through the processes and tools used to plan and produce mission schedules for the Chandra X-Ray Observatory. Nominal planning and scheduling, target of opportunity response, and recovery from on-board autonomous safing actions are all addressed. Evolution of tools and processes, best practices, and lessons learned are highlighted along the way.

  10. Adversarial Scheduling in Evolutionary Game Dynamics

    CERN Document Server

    Istrate, Gabriel; Ravi, S S

    2008-01-01

    Consider a system in which players at nodes of an underlying graph G repeatedly play Prisoner's Dilemma against their neighbors. The players adapt their strategies based on the past behavior of their opponents by applying the so-called win-stay lose-shift strategy. This dynamics has been studied in (Kittock 94), (Dyer et al. 2002), (Mossel and Roch, 2006). With random scheduling, starting from any initial configuration with high probability the system reaches the unique fixed point in which all players cooperate. This paper investigates the validity of this result under various classes of adversarial schedulers. Our results can be sumarized as follows: 1. An adversarial scheduler that can select both participants to the game can preclude the system from reaching the unique fixed point on most graph topologies. 2. A nonadaptive scheduler that is only allowed to choose one of the participants is no more powerful than a random scheduler. With this restriction even an adaptive scheduler is not significantly more ...

  11. Stochastic Modeling of Airlines' Scheduled Services Revenue

    Science.gov (United States)

    Hamed, M. M.

    1999-01-01

    Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers are able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

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

    Science.gov (United States)

    Moore, J. E.

    1975-01-01

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

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

  14. The Effect of Different Dosing Schedules of Intravitreal Sirolimus, a Mammalian Target of Rapamycin (mTOR) Inhibitor, in the Treatment of Non-Infectious Uveitis (An American Ophthalmological Society Thesis)

    Science.gov (United States)

    Nguyen, Quan Dong; Sadiq, Mohammad Ali; Soliman, Mohamed Kamel; Agarwal, Aniruddha; Do, Diana V.; Sepah, Yasir J.

    2016-01-01

    Purpose: To determine if two different doses of intravitreal sirolimus, an mTOR inhibitor, can decrease inflammation and is safe in eyes with non-infectious posterior, intermediate, or panuveitis in the Sirolimus as a Therapeutic Approach UVEitis: Protocol-2 (SAVE-2) Study. Methods: SAVE-2 is a prospective randomized, phase II, open-label interventional clinical trial conducted at 4 clinical centers in the United States. Eligible subjects were randomized into one of two treatments. Group 1 received 440µg of intravitreal sirolimus in study eyes on days 0, 30, 60, 90, 120, and 150; group 2 received 880µg of intravitreal sirolimus on days 0, 60, and 120. Fellow eyes were also eligible to receive sirolimus (of opposite dose to that of study eye). Primary endpoint of the study was at month 6 (M6). Results: 24 subjects have been randomized in SAVE-2 and are included in the analysis. Vitreous haze decreased by ≥2 steps in 63.6% and 50% of patients in groups 1 and 2, respectively at M6 (p=0.695). Mean change in best-corrected visual acuity for subjects was +3.66 and −2.91 ETDRS letters in group 1 and 2, respectively. Among subjects with macular edema at baseline (n=13), the mean change in foveal thickness was −89.42µm in group 1 and +81.5µm in group 2 at M6. Conclusions: Both low and high doses of intravitreal sirolimus were found to decrease vitreous haze in eyes with non-infectious uveitis. Low dose (440µg) sirolimus administered monthly may be more efficacious in reducing uveitic macular edema than high dose (880µg) administered every 2 months.

  15. Routine environmental monitoring schedule, calendar year 1998

    International Nuclear Information System (INIS)

    This document provides the Environmental Restorations Contractor (ERC) and the Project Hanford Management Contractor (PHMC) a schedule in accordance with the HNF-PRO-454, Inactive Waste Sites' HNF-PRO-455, Solid Waste 3 Management4 and BHI-EE-02, Environmental Requirements, of monitoring and sampling, routines for the near-facility environmental monitoring program during calendar year (CY) 1998. 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 Environmental Monitoring and Investigations. The survey frequencies for particular sites are determined by the technical judgment of Environmental Monitoring and investigations 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 1999. 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 1332 assistance in completing these routines to Radiological Control management and Environmental Monitoring and Investigations. After each routine survey is completed, a copy of the survey record, maps, and data sheets will be forwarded to Environmental Monitoring and Investigations. These routine surveys will not be considered complete until this

  16. Automated Scheduling of Science Activities for Titan Encounters by Cassini

    Science.gov (United States)

    Ray, Trina L.; Knight, Russel L.; Mohr, Dave

    2014-01-01

    In an effort to demonstrate the efficacy of automated planning and scheduling techniques for large missions, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] and CLASP (Compressed Large-scale Activity Scheduling and Planning) [2] to the domain of scheduling high-level science goals into conflict-free operations plans for Titan encounters by the Cassini spacecraft.

  17. 12 CFR 509.31 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Scheduling and prehearing conferences. 509.31... Scheduling and prehearing conferences. (a) Scheduling conference. Within 30 days of service of the notice or... prior to the hearing or to confer by telephone for the purpose of scheduling the course and conduct...

  18. 12 CFR 908.53 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 7 2010-01-01 2010-01-01 false Scheduling and prehearing conferences. 908.53....53 Scheduling and prehearing conferences. (a) Scheduling conference. Within thirty (30) days of... specified time and place prior to the hearing or to confer by telephone for the purpose of scheduling...

  19. Block Scheduling: Center for School Success Promising Practices Series

    Science.gov (United States)

    Imbimbo, Josephine; Gilkes, Alwyn

    2009-01-01

    This publication focuses on block scheduling. Alternative scheduling models--usually called "block scheduling" because they involve blocks of time for student learning--restructure the school day. Schools may adopt block scheduling to create more productive and personal relationships among teachers and students, to design challenging curricula…

  20. 12 CFR 747.31 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 6 2010-01-01 2010-01-01 false Scheduling and prehearing conferences. 747.31... of Practice and Procedure § 747.31 Scheduling and prehearing conferences. (a) Scheduling conference... purpose of scheduling the recourse and conduct of the proceeding. This meeting or telephone conference...

  1. 12 CFR 1780.33 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 7 2010-01-01 2010-01-01 false Scheduling and prehearing conferences. 1780.33... Proceedings § 1780.33 Scheduling and prehearing conferences. (a) Scheduling conference. Within 30 days of... time and place prior to the hearing or to confer by telephone for the purpose of scheduling the...

  2. Genetic Algorithm-Based Optimization Used in Rolling Schedule

    Institute of Scientific and Technical Information of China (English)

    YANG Jing-ming; CHE Hai-jun; DOU Fu-ping; ZHOU Tao

    2008-01-01

    A genetic algorithm-based optimization was used for 1 370 mm tandem cold rolling schedule, in which the press rates were coded and operated. The superiority individual is reserved in every generation. Analysis and comparison of optimized schedule with the existing schedule were offered. It is seen that the performance of the optimal rolling schedule is satisfactory and promising.

  3. Fractionation schedules for cancers of the head and neck

    International Nuclear Information System (INIS)

    Purpose/Objective: This refresher course reviews current research activity and treatment results in the field of radiation therapy fractionation. The presentation emphasizes worldwide studies of altered fractionation, highlighting head and neck cancer as the primary teaching model. Basic radiobiological principles guiding the development of altered fractionation regimens, and advancing the understanding of fractionation effects on normal and tumor tissue are reviewed. A 'standard' prescription of 2 Gy x 35 fractions = 70 Gy may not provide the optimal balance between primary tumor control and late normal tissue effects for all patients with squamous cell carcinoma of the head and neck. The last decade has witnessed the treatment of thousands of head and neck cancer patients with curative radiotherapy using altered fractination schedules designed to improve overall treatment results. Although the number of different fractionation regimens currently being investigated continues to increase, the common guiding principles behind their design are relatively simple. Common fractionation terminology (i.e., accelerated hyperfractionation) will be reviewed, as well as a brief summary of radiobiological concepts pertaining to tumor potential doubling time, tumor proliferation kinetics, overall treatment time and fraction size-dependence of acute and late tissue effects. Several well known head and neck fractionation schedules from around the world (Manchester Christie Hospital-United Kingdom, Princess Margaret Hospital-Canada, Massachusetts General Hospital-USA, MD Anderson Hospital-USA, University of Florida-USA, Mount Vernon Hospital CHART-United Kingdom, RTOG and EORTC trials-USA and Europe) will be summarized with regard to design-rationale, treatment technique and results. The design of several current cooperative group trials investigating altered head and neck fractionation will be presented, as well as concepts prompting the pilot evaluation of several brand new

  4. A heuristic approach to incremental and reactive scheduling

    Science.gov (United States)

    Odubiyi, Jide B.; Zoch, David R.

    1989-01-01

    An heuristic approach to incremental and reactive scheduling is described. Incremental scheduling is the process of modifying an existing schedule if the initial schedule does not meet its stated initial goals. Reactive scheduling occurs in near real-time in response to changes in available resources or the occurrence of targets of opportunity. Only minor changes are made during both incremental and reactive scheduling because a goal of re-scheduling procedures is to minimally impact the schedule. The described heuristic search techniques, which are employed by the Request Oriented Scheduling Engine (ROSE), a prototype generic scheduler, efficiently approximate the cost of reaching a goal from a given state and effective mechanisms for controlling search.

  5. Assessment of the Correlation between Appointment Scheduling and Patient Satisfaction in a Pediatric Dental Setup

    Science.gov (United States)

    Katre, Amar N.

    2014-01-01

    Introduction. The practice of modern pediatric dentistry requires delivery of quality care in combination with adherence to excellent business as well as time management principles. A definite appointment schedule should be presented to the parents on the first or second appointment. More importantly, the prescribed schedule should be followed to the best of the professional abilities of the pediatric dentist. Aims. The aim of the study was to assess the co-relation between appointment scheduling and patient satisfaction in a pediatric dental setup with the objective of understanding the parameters related to appointment scheduling to increase patient satisfaction. Method. A total of 40 patients, who visited the Department of Pediatric and Preventive Dentistry, YMT Dental College & Hospital, for dental treatment were selected on a random basis. A questionnaire with a set of 6 questions with a rating scale of 1–5 to assess the patient satisfaction related to appointment scheduling was prepared. Results. A significant number of the patients were happy with the existing appointment scheduling system barring a few exceptions. PMID:25610464

  6. Assessment of the Correlation between Appointment Scheduling and Patient Satisfaction in a Pediatric Dental Setup

    Directory of Open Access Journals (Sweden)

    Amar N. Katre

    2014-01-01

    Full Text Available Introduction. The practice of modern pediatric dentistry requires delivery of quality care in combination with adherence to excellent business as well as time management principles. A definite appointment schedule should be presented to the parents on the first or second appointment. More importantly, the prescribed schedule should be followed to the best of the professional abilities of the pediatric dentist. Aims. The aim of the study was to assess the co-relation between appointment scheduling and patient satisfaction in a pediatric dental setup with the objective of understanding the parameters related to appointment scheduling to increase patient satisfaction. Method. A total of 40 patients, who visited the Department of Pediatric and Preventive Dentistry, YMT Dental College & Hospital, for dental treatment were selected on a random basis. A questionnaire with a set of 6 questions with a rating scale of 1–5 to assess the patient satisfaction related to appointment scheduling was prepared. Results. A significant number of the patients were happy with the existing appointment scheduling system barring a few exceptions.

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

  8. 77 FR 63766 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I

    Science.gov (United States)

    2012-10-17

    ... with two other synthetic cathinones (4-methyl-N-methylcathinone (mephedrone) and 3,4- methylenedioxypyrovalerone (MDPV)) into Schedule I pursuant to the temporary scheduling provisions of the CSA (76 FR 55616... FR 65371) amending 21 CFR 1308.11(g) to temporarily place these three synthetic cathinones...

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

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-01-01

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

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

  11. Group Elevator Peak Scheduling Based on Robust Optimization Model

    OpenAIRE

    Zhang, J.; Zong, Q.

    2013-01-01

    Scheduling of Elevator Group Control System (EGCS) is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization) method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is re...

  12. An Exploration of Activity Scheduling and Rescheduling Processes

    OpenAIRE

    Chen, Quizi

    2001-01-01

    The objective of this research is to examine processes of activity scheduling and rescheduling by experiments. Activity scheduling processes were examined by using a combination of mail surveys and telephone interviews. It was found that individuals’ schedules are hardly complete. Scheduled activities take place less than 50% of all executed activities. The incompleteness suggests that activity scheduling and execution are a concurrent process and the distiction between is vague. Activities w...

  13. Survey on Scheduling Technologies of P2P Media Streaming

    OpenAIRE

    Guangxue Yue; Nanqing Wei; Jiansheng Liu; Xiaofeng Xiong; Linquan Xie

    2011-01-01

    P2P streaming media applications grows rapidly. Scheduling technologies are the key of streaming research. After review the history of distribution systems. We studied the main data distribution topology and P2P streaming scheduling technologies. Compared current scheduling algorithms. Finally made a conclusion and forecasted scheduling in the mesh-tree distribution structure, heterogeous network, alone with security in scheduling will be the hotspots in the near future.

  14. A multi-agent system with application in project scheduling

    OpenAIRE

    Constanța Nicoleta BODEA; Ileana Ruxandra BADEA; Radu-Ioan MOGOȘ

    2011-01-01

    The new economic and social dynamics increase project complexity and makes scheduling problems more difficult, therefore scheduling requires more versatile solutions as Multi Agent Systems (MAS). In this paper the authors analyze the implementation of a Multi-Agent System (MAS) considering two scheduling problems: TCPSP (Time-Constrained Project Scheduling), and RCPSP (Resource-Constrained Project Scheduling). The authors propose an improved BDI (Beliefs, Desires, and Intentions) model and pr...

  15. CONTRIBUTIONS TO MULTI-AGENT SYSTEMS IMPLEMENTATION FOR PROJECT SCHEDULING

    OpenAIRE

    Constanta Nicoleta BODEA; Ileana Ruxandra BADEA

    2010-01-01

    Increasing project complexity makes scheduling problems more difficult to solve and requires more versatile algorithms. Two different approaches for the project scheduling optimization could be considered: TCPSP (Time-Constrained Project Scheduling), and RCPSP (Resource-Constrained Project Scheduling). In this paper we study thepossibility to apply Multi-Agent Systems (MAS) for these scheduling problems regarding different fitness functions. Wesearch for strengths and weaknesses of MAS as a p...

  16. Fair channel-dependent scheduling in CDMA systems

    OpenAIRE

    Bruin, de, W.; Heijenk, Geert; El Zarki, Magda; Zan, Jasmine Lei

    2003-01-01

    In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.

  17. Project scheduling under uncertainty: survey and research potentials.

    OpenAIRE

    Herroelen, Willy; Leus, Roel

    2005-01-01

    The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, which is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochasti...

  18. Project scheduling under undertainty – survey and research potentials.

    OpenAIRE

    Herroelen, Willy; Leus, Roel

    2002-01-01

    The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic...

  19. Scheduling Future Water Supply Investments Under Uncertainty

    Science.gov (United States)

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

    2014-12-01

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

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

  1. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

    Full Text Available Purpose: In order to better serve the transport demand of urban area by rail, target at the Ur-ban Rail Train Stop Schedule problem.Design/methodology/approach: Bi-level mathematical programming model and game relation was used.Findings: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed when game relation between train Stop Schedule and passenger transfer choice is considered.Research limitations/implications: The research is still in progress. Practical implications: ChongQing urban rail line 2 was taken as an example, the practical application of the model has proved its feasibility and efficiency.Originality/value: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed. The upper level model is Stop Schedule targeting at the optimal profit from the operators side. The lower level model is passenger routing aims to minimize total travel time. According to its features, the bi-level model is integrated in order to be directly solvable by optimizing software.

  2. Communication contention in APN list scheduling algorithm

    Institute of Scientific and Technical Information of China (English)

    TANG XiaoYong; LI KenLi; PADUA Divid

    2009-01-01

    Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. This paper investigates the Incorporation of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network. In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application.

  3. A flexible nurse scheduling support system.

    Science.gov (United States)

    Ozkarahan, I

    1989-01-01

    Salaries paid to nursing personnel constitute the largest chunk of a hospital's budget. Therefore, this human resource must be utilized efficiently. Hospitals provide continuous service without the exception of holidays and personal preferences. This causes the nurses' discontent in shift scheduling. And the consequence of this discontent is the nurse shortage. This and the pressures on hospitals to limit costs increase the importance of the nurse scheduling problem. Scheduling nursing personnel in hospitals is very complex due to the variety of conflicting interests or objectives between hospitals and nurses. Also, the demand, which varies widely 24-h a day 7-day a week is skill specific and hard to forecast. In the face of this complexity, the present nurse scheduling models have met with little success. In this paper, we propose a more flexible decision support system that will satisfy the interests of both hospitals and nurses through alternative models that attempt to accommodate flexible work patterns as it integrates time of the day (TOD) and day of the week (DOW) scheduling problems. PMID:2582748

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

  5. Mixed waste focus area integrated master schedule (current as of May 6, 1996)

    International Nuclear Information System (INIS)

    The mission of the Mixed Waste Characterization, Treatment, and Disposal Focus Area (MWFA) is to provide acceptable treatment systems, developed in partnership with users and with the participation of stakeholders, tribal governments, and regulators, that are capable of treating the Department of Energy's (DOE's) mixed wastes. In support of this mission, the MWTA produced the Mixed Waste Focus Area Integrated Technical Baseline Report, Phase I Volume 1, January 16, 1996, which identified a prioritized list of 30 national mixed waste technology deficiencies. The MWFA is targeting funding toward technology development projects that address the current list of deficiencies. A clear connection between the technology development projects and the EM-30 and EM-40 treatment systems that they support is essential for optimizing the MWFA efforts. The purpose of the Integrated Master Schedule (IMS) is to establish and document these connections and to ensure that all technology development activities performed by the MWFA are developed for timely use in those treatment systems. The IMS is a list of treatment systems from the Site Treatment Plans (STPs)/Consent Orders that have been assigned technology development needs with associated time-driven schedules, Technology deficiencies and associated technology development (TD) needs have been identified for each treatment system based on the physical, chemical, and radiological characteristics of the waste targeted for the treatment system. The schedule, the technology development activities, and the treatment system have been verified through the operations contact from the EM-30 organization at the site

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

    Science.gov (United States)

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

    2005-01-01

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

  7. Deterministic Real-time Thread Scheduling

    CERN Document Server

    Yun, Heechul; Sha, Lui

    2011-01-01

    Race condition is a timing sensitive problem. A significant source of timing variation comes from nondeterministic hardware interactions such as cache misses. While data race detectors and model checkers can check races, the enormous state space of complex software makes it difficult to identify all of the races and those residual implementation errors still remain a big challenge. In this paper, we propose deterministic real-time scheduling methods to address scheduling nondeterminism in uniprocessor systems. The main idea is to use timing insensitive deterministic events, e.g, an instruction counter, in conjunction with a real-time clock to schedule threads. By introducing the concept of Worst Case Executable Instructions (WCEI), we guarantee both determinism and real-time performance.

  8. An Algebra of Synchronous Scheduling Interfaces

    CERN Document Server

    Mendler, Michael

    2011-01-01

    In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.

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

  10. On Wireless Link Scheduling and Flow Control

    CERN Document Server

    Gore, Ashutosh Deepak

    2008-01-01

    This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise Ratio (SINR) at the receiver exceeds the communication threshold. The thesis also discusses the complementary problem of flow control. (1) We consider various problems on centralized link scheduling in Spatial Time Division Multiple Access (STDMA) wireless mesh networks. We motivate the use of spatial reuse as performance metric and provide an explicit characterization of spatial reuse. We propose link scheduling algorithms based on certain graph models (communication graph, SINR graph) of the network. Our algorithms achieve higher spatial reuse than that of existing algorithms, with only a slight increase in computational complexity. (2) We investigate random access algorithms in wireless networks. We assume that the receiver is capable of power-based capture and propose a s...

  11. A CLASS OF GENERALIZED MULTIPROCESSOR SCHEDULING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    YANG Xiaoguang

    2000-01-01

    The paper discusses a class of generalized multiprocessor scheduling problems which is to arrange some independent jobs on almost identical processors. Different from the classical multiprocessor scheduling, each job may only be processed by some processors,not all. In this paper, we first prove that the problems of minimization makespan and minimization total weighted completion time can be solved by the polynomial algorithms if all processing time are unit time. Then for arbitrary processing time, we try to analyze the worst performance of list schedule (LS) method and longest processing time(LPT) method when there are only two machines involved. We show that the bounds for LS and LPT are exactly two.

  12. Scheduling Support for Transactional Memory Contention Management

    DEFF Research Database (Denmark)

    Maldonado, Walther; Marler, Patrick; Felber, Pascal;

    2010-01-01

    different strategies for efficient communication between the kernel and the user-level TM library. To the best of our knowledge, our work is the first to investigate kernel-level support for TM contention management. We have introduced kernel-level TM scheduling support into both the Linux and Solaris......Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on >multiple cores when the data access pattern behaves "well," i.e., when few conflicts are induced. In contrast, data patterns with frequent write......-management has been proposed for increasing TM efficiency under high-contention [2, 5, 19]. However, only user-level schedulers have been considered. In this work, we propose, implement and evaluate several novel kernel-level scheduling support mechanisms for TM contention management. We also investigate...

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

  14. An Algebra of Synchronous Scheduling Interfaces

    Directory of Open Access Journals (Sweden)

    Michael Mendler

    2011-01-01

    Full Text Available In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle. The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.

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

  16. Dispatch Scheduling to Maximize Exoplanet Detection

    Science.gov (United States)

    Johnson, Samson; McCrady, Nate; MINERVA

    2016-01-01

    MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.

  17. Effects of 4X4 Block Scheduling

    Directory of Open Access Journals (Sweden)

    R. Brian Cobb

    1999-02-01

    Full Text Available The effects of a 4 X 4 block scheduling program in a middle school on a variety of student measures were investigated. These measures included standardized achievement tests in mathematics, reading, and writing, cumulative and semester grades in middle school and high school, attendance rates, and enrollment rates in advanced high school courses (in mathematics only. The block scheduling program had been in effect for four years allowing analyses of current middle and high school students who had experienced a minimum of one and one-half years of block scheduling while in middle school. The primary research design was a post-test only, matched pairs design. Students were matched on school characteristics, gender, ethnicity, grade level, and 5th grade standardized reading scores. Results were relatively consistent with the extant literature and generally positive.

  18. Load scheduling for decentralized CHP plants

    DEFF Research Database (Denmark)

    Nielsen, Henrik Aalborg, orlov 31.07.2008; Madsen, Henrik; Nielsen, Torben Skov

    This report considers load scheduling for decentralized combined heat and power plants where the revenue from selling power to the transmission company and the fuel cost may be time-varying. These plants produce both heat and power with a fixed ratio between these outputs. A heat storage facility...... is used to be able to deviate from this restriction. The load scheduling must be performed with only approximate knowledge about the future. At present in Denmark this uncertainty is only associated with the heat demand, but in the future revenues of produced energy and the fuel costs might also...... for items (ii) and (iii). For item (i). The approach taken in this report is explicitly to describe how the total revenue from running the plant depends on the schedule for the heat and power producing units of the plant. Hereafter optimization theory, in this case dynamic programming, is applied to find...

  19. CRI planning and scheduling for space

    Science.gov (United States)

    Aarup, Mads

    1994-01-01

    Computer Resources International (CRI) has many years of experience in developing space planning and scheduling systems for the European Space Agency. Activities range from AIT/AIV planning over mission planning to research in on-board autonomy using advanced planning and scheduling technologies in conjunction with model based diagnostics. This article presents four projects carried out for ESA by CRI with various subcontractors: (1) DI, Distributed Intelligence for Ground/Space Systems is an on-going research project; (2) GMPT, Generic Mission Planning Toolset, a feasibility study concluded in 1993; (3) OPTIMUM-AIV, Open Planning Tool for AIV, development of a knowledge based AIV planning and scheduling tool ended in 1992; and (4) PlanERS-1, development of an AI and knowledge-based mission planning prototype for the ERS-1 earth observation spacecraft ended in 1991.

  20. Scheduling Operations for Massive Heterogeneous Clusters

    Science.gov (United States)

    Humphrey, John; Spagnoli, Kyle

    2013-01-01

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

  1. Treatment of primary syphilis.

    Science.gov (United States)

    Elliott, W C

    1976-12-01

    Reports in the English language of the treatment of primary syphilis are reviewed. Except for benzathine penicillin, the efficacy of the currently recommended dosage schedules are documented only by Schroeter et al. Although these investigators reported generally acceptable failure rates, further study is necessary to determine: (1) if differences in efficacy exist among regimes; (2) if the current schedules are equally effective in both primary and secondary syphilis; and (3) if increased dosages reduce failure rates. PMID:1010777

  2. Linear Time Algorithms for Parallel Machine Scheduling

    Institute of Scientific and Technical Information of China (English)

    Zhi Yi TAN; Yong HE

    2007-01-01

    This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems.The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio.Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.

  3. Optimal scheduling of coproduction with a storage

    International Nuclear Information System (INIS)

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

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

  5. Workshop Scheduling in the MRO Context

    Science.gov (United States)

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

    2010-09-01

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

  6. Scheduling of Development Projects with Uncertain Iterations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper studies the scheduling of design projects in concurrent development process with uncertain num ber of feedback revisions. An optimization based methodology that combines heuristic algorithm, artificial intelligence (fuzzy, genetic algorithm) and scheduling theory is developed. In the algorithm, weighting values of some key factors are defined by genetic algorithm. In addition, fuzzy logic is used to decide the ability coefficients of different roles taken by designers. Moreover, the process of pre-release and feedback revision is realized. Simulation example is a fraction of practical development project, and satisfied results are obtained.

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

  9. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru;

    2008-01-01

    We present an approach to the analysis and optimisation of heterogeneous multiprocessor 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 organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, 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 also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system...

  10. Sharp utilization thresholds for some real-time scheduling problems

    CERN Document Server

    Gopalakrishnan, Sathish

    2009-01-01

    Scheduling policies for real-time systems exhibit threshold behavior that is related to the utilization of the task set they schedule, and in some cases this threshold is sharp. For the rate monotonic scheduling policy, we show that periodic workload with utilization less than a threshold $U_{RM}^{*}$ can be scheduled almost surely and that all workload with utilization greater than $U_{RM}^{*}$ is almost surely not schedulable. We study such sharp threshold behavior in the context of processor scheduling using static task priorities, not only for periodic real-time tasks but for aperiodic real-time tasks as well. The notion of a utilization threshold provides a simple schedulability test for most real-time applications. These results improve our understanding of scheduling policies and provide an interesting characterization of the typical behavior of policies. The threshold is sharp (small deviations around the threshold cause schedulability, as a property, to appear or disappear) for most policies; this is...

  11. Online Scheduling in Manufacturing A Cumulative Delay Approach

    CERN Document Server

    Suwa, Haruhiko

    2013-01-01

    Online scheduling is recognized as the crucial decision-making process of production control at a phase of “being in production" according to the released shop floor schedule. Online scheduling can be also considered as one of key enablers to realize prompt capable-to-promise as well as available-to-promise to customers along with reducing production lead times under recent globalized competitive markets. Online Scheduling in Manufacturing introduces new approaches to online scheduling based on a concept of cumulative delay. The cumulative delay is regarded as consolidated information of uncertainties under a dynamic environment in manufacturing and can be collected constantly without much effort at any points in time during a schedule execution. In this approach, the cumulative delay of the schedule has the important role of a criterion for making a decision whether or not a schedule revision is carried out. The cumulative delay approach to trigger schedule revisions has the following capabilities for the ...

  12. Automated scheduling and planning from theory to practice

    CERN Document Server

    Ozcan, Ender; Urquhart, Neil

    2013-01-01

      Solving scheduling problems has long presented a challenge for computer scientists and operations researchers. The field continues to expand as researchers and practitioners examine ever more challenging problems and develop automated methods capable of solving them. This book provides 11 case studies in automated scheduling, submitted by leading researchers from across the world. Each case study examines a challenging real-world problem by analysing the problem in detail before investigating how the problem may be solved using state of the art techniques.The areas covered include aircraft scheduling, microprocessor instruction scheduling, sports fixture scheduling, exam scheduling, personnel scheduling and production scheduling.  Problem solving methodologies covered include exact as well as (meta)heuristic approaches, such as local search techniques, linear programming, genetic algorithms and ant colony optimisation.The field of automated scheduling has the potential to impact many aspects of our lives...

  13. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

    Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

  14. Timely and efficient planning of treatments through intelligent scheduling

    OpenAIRE

    Braaksma, Aleida

    2015-01-01

    When people experience health problems, this often leads to a period of concern and stress. Both for patients’ physical and mental well-being, it is essential that healthcare processes are organized in the best possible way. This thesis aims to support hospitals in realizing excellent quality of patient service, whilst utilizing resources efficiently. By developing methodologies based on techniques from operations research, also known as mathematical decision theory, the research presented pr...

  15. 7 CFR 305.6 - Methyl bromide fumigation treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... to air temperature within the chamber. Fruit taken from a cooling room may have to be prewarmed... pure, type “Q” (for quarantine use only) methyl bromide per 1,000 cubic feet of chamber space. Dosage.... Water temperature in the volatilizer must never fall below 65.6 °C (150 °F) at any time during...

  16. 78 FR 79465 - International Drug Scheduling; Convention on Psychotropic Substances; Single Convention on...

    Science.gov (United States)

    2013-12-30

    ... the substance (Def. 2) in your country: Addiction programme Emergency room Overdose deaths enrolment...) Trafficking (Yes/No) Diversion (Yes/No) Internet market (Yes/No) Other (please specify): --Please provide any... treatment of moderate to severe acute pain. ] Tapentadol is controlled in Schedule II under the CSA in...

  17. Evaluation of Fixed Momentary DRO Schedules under Signaled and Unsignaled Arrangements

    Science.gov (United States)

    Hammond, Jennifer L.; Iwata, Brian A.; Fritz, Jennifer N.; Dempsey, Carrie M.

    2011-01-01

    Fixed momentary schedules of differential reinforcement of other behavior (FM DRO) generally have been ineffective as treatment for problem behavior. Because most early research on FM DRO included presentation of a signal at the end of the DRO interval, it is unclear whether the limited effects of FM DRO were due to (a) the momentary response…

  18. Analyzing Job Aware Scheduling Algorithm in Hadoop for Heterogeneous Cluster

    Directory of Open Access Journals (Sweden)

    Mayuri A Mehta

    2015-12-01

    Full Text Available A scheduling algorithm is required to efficiently manage cluster resources in a Hadoop cluster, thereby to increase resource utilization and to reduce response time. The job aware scheduling algorithm schedules non-local map tasks of jobs based on job execution time, earliest deadline first or workload of the job. In this paper, we present the performance evaluation of the job aware scheduling algorithm using MapReduce WordCount benchmark. The experimental results are compared with matchmaking scheduling algorithm. The results show that the job aware scheduling algorithm reduces average waiting time and memory wastage considerably as compared to matchmaking algorithm.

  19. Decision support system for vehicle scheduling

    Directory of Open Access Journals (Sweden)

    C. Gaindric

    1999-08-01

    Full Text Available A decision support system (DSS is described to form schedules of traffic from a central warehouse to a set of consumers by cyclic routes. The system may be used by dispatchers at transportation enterprises. The system structure, short description of modules, and algorithms solving the originating problems are presented.

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

  1. Group scheduling problems in directional sensor networks

    Science.gov (United States)

    Singh, Alok; Rossi, André

    2015-12-01

    This article addresses the problem of scheduling a set of groups of directional sensors arising as a result of applying an exact or a heuristic approach for solving a problem involving directional sensors. The problem seeks a schedule for these groups that minimizes the total energy consumed in switching from one group to the next group in the schedule. In practice, when switching from a group to the next one, active sensors in the new group have to rotate in order to face their working direction. These rotations consume energy, and the problem is to schedule the groups so as to minimize the total amount of energy consumed by all the sensor rotations, knowing the initial angular positions of all the sensors. In this article, it is assumed that energy consumption is proportional to the angular movement for all the sensors. Another problem version is also investigated that seeks to minimize the total time during which the sensor network cannot cover all the targets because active sensors are rotating. Both problems are proved to be ?-hard, and a lower bound for the first problem is presented. A greedy heuristic and a genetic algorithm are also proposed for addressing the problem of minimizing total rotation in the general case. Finally, a local search is also proposed to improve the solutions obtained through a genetic algorithm.

  2. LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

    Directory of Open Access Journals (Sweden)

    Prakhar Ojha

    2015-11-01

    Full Text Available 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 to utilize CPU resources for a fixed quantum of time (termed as timeslice for preemption and is then preempted for another waiting process. Each of these 'process preemption' leads to considerable overhead of CPU cycles which are valuable resource for runtime execution. In this work we try to utilize the historical performances of a scheduler and predict the nature of current running process, thereby trying to reduce the number of preemptions. We propose a machine-learning module to predict a better performing timeslice which is calculated based on static knowledge base and adaptive reinforcement learning based suggestive module. Results for an "adaptive timeslice parameter" for preemption show good saving on CPU cycles and efficient throughput time

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

  4. 40 CFR 52.626 - Compliance schedules.

    Science.gov (United States)

    2010-07-01

    ... Subpart N of this chapter. The regulations cited are air pollution control regulations of the State....626 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) APPROVAL AND PROMULGATION OF IMPLEMENTATION PLANS Hawaii § 52.626 Compliance schedules. (a) (b)...

  5. Scheduling constrained tools using heuristic techniques

    Science.gov (United States)

    Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani

    2015-12-01

    One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.

  6. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

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

    2001-01-01

    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 B

  7. Physician Fee Schedule National Payment Amount File

    Data.gov (United States)

    U.S. Department of Health & Human Services — The significant size of the Physician Fee Schedule Payment Amount File-National requires that database programs (e.g., Access, dBase, FoxPro, etc.) be used to read...

  8. 44 CFR 72.3 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Fee schedule. 72.3 Section 72.3 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND... initial fee, if necessary, will be published as a notice in the Federal Register. (b) For requests...

  9. 40 CFR 52.1335 - Compliance schedules.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 4 2010-07-01 2010-07-01 false Compliance schedules. 52.1335 Section 52.1335 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED... Effective date Final compliance date Pilot Knob Pelleting Co Pilot Knob, MO V(10 CSR 10-3.050) Oct. 19,...

  10. Effects of industrialization on working schedules.

    Science.gov (United States)

    Kogi, K

    1976-12-01

    Recent increase in industrialization has resulted in attention being drawn to diversity of working schedules and their interrelation with content of work. The results of joint research revealed that adaptation to industrial jobs is made difficult because of urban conditions and modern work-control systems, such as workers in flexible-working-time systems who apparently favored regular daily working cycles. Long overtime work in smaller undertakings and the spread of shift systems are two important features of industrial work schedules, each being dominant among skilled and non-skilled jobs. Another important facet is the problem of intra-shift work-rest schedules significant for machine operations and vigilance tasks. It is suggested that phases of work that become intolerable are correlated with unnatural work rhythms. More emphasis should thus be laid on both phase-shifted work and non-self-governing work, the key factor being the relevance of attained data to real work in the whole course of schedules of work and rest.

  11. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

    Kleunen, van Wouter; Meratnia, Nirvana; Havinga, Paul J.M.

    2013-01-01

    The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this p

  12. Execution Time Estimation for Workflow Scheduling

    NARCIS (Netherlands)

    Chirkin, A.M.; Belloum, A..S.Z.; Kovalchuk, S.V.; Makkes, M.X.

    2014-01-01

    Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the randomness of the workflow components and th

  13. 5 CFR 293.404 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Performance File System Records § 293.404 Retention schedule. (a)(1) Except as provided... in this system, including transfer with the employee who changes positions, shall be as agencies... performance-related documents five years old or less shall be forwarded in the Employee Performance File...

  14. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P. [Oak Ridge National Lab., TN (United States)

    1998-09-01

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

  15. 5 CFR 1631.14 - Fee schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Fee schedule. 1631.14 Section 1631.14 Administrative Personnel FEDERAL RETIREMENT THRIFT INVESTMENT BOARD AVAILABILITY OF RECORDS Production or... fee for reproducing copies of records over 81/2 × 14 inches, or whose physical characteristics do...

  16. Scheduling in Engineering, Project, and Production Management

    Directory of Open Access Journals (Sweden)

    Chien-Ho Ko

    2015-01-01

    Full Text Available 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. Adaptive resource allocation for efficient patient scheduling

    NARCIS (Netherlands)

    I.B. Vermeulen; S.M. Bohte; S.G. Elkhuizen; H. Lameris; P.J.M. Bakker; H. La Poutre

    2009-01-01

    Objective: 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

  18. Stochastic online scheduling on parallel machines

    NARCIS (Netherlands)

    Megow, N.; Uetz, M.J.; Vredeveld, T.; Persiano, G.; Solis-Oba, R.

    2005-01-01

    We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic model where jobs with their processing time distributions are known beforehand, we assume that jobs appear one by one, a

  19. Hybrid Meta-Heuristics for Robust Scheduling

    NARCIS (Netherlands)

    M. Surico (Michele); U. Kaymak (Uzay); D. Naso (David); R. Dekker (Rommert)

    2006-01-01

    textabstractThe production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer spe

  20. Evaluation of Scheduling Methods for Multiple Runways

    Science.gov (United States)

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

    1996-01-01

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