WorldWideScience

Sample records for chronomodulated treatment schedules

  1. Tumor growth rate determines the timing of optimal chronomodulated treatment schedules.

    Directory of Open Access Journals (Sweden)

    Samuel Bernard

    2010-03-01

    Full Text Available In host and cancer tissues, drug metabolism and susceptibility to drugs vary in a circadian (24 h manner. In particular, the efficacy of a cell cycle specific (CCS cytotoxic agent is affected by the daily modulation of cell cycle activity in the target tissues. Anti-cancer chronotherapy, in which treatments are administered at a particular time each day, aims at exploiting these biological rhythms to reduce toxicity and improve efficacy of the treatment. The circadian status, which is the timing of physiological and behavioral activity relative to daily environmental cues, largely determines the best timing of treatments. However, the influence of variations in tumor kinetics has not been considered in determining appropriate treatment schedules. We used a simple model for cell populations under chronomodulated treatment to identify which biological parameters are important for the successful design of a chronotherapy strategy. We show that the duration of the phase of the cell cycle targeted by the treatment and the cell proliferation rate are crucial in determining the best times to administer CCS drugs. Thus, optimal treatment times depend not only on the circadian status of the patient but also on the cell cycle kinetics of the tumor. Then, we developed a theoretical analysis of treatment outcome (TATO to relate the circadian status and cell cycle kinetic parameters to the treatment outcomes. We show that the best and the worst CCS drug administration schedules are those with 24 h intervals, implying that 24 h chronomodulated treatments can be ineffective or even harmful if administered at wrong circadian times. We show that for certain tumors, administration times at intervals different from 24 h may reduce these risks without compromising overall efficacy.

  2. [Modeling 5-FU clearance during a chronomodulated infusion].

    Science.gov (United States)

    Kwiatkowski, F; Chevalier, V; Chevrier, R; Richard, D; Cure, H; Chollet, P

    2003-06-01

    Drugs pharmacokinetic control is a usual practice in case of flat continuous infusions. It enables among others, to modulate delivered doses when drug concentrations in blood appear too high. With chronotherapy, this possibility becomes more difficult because of sinusoidal outflows of infusion. We propose here a method that enables this follow-up, established through the study of 21 metastatic colorectal cancer patients, treated with a chronomodulated infusion of high dose 5-fluoro-uracil (5-FU) and folinic acid. This pharmacokinetic follow-up permitted the modelisation of 5-FU clearance and the calculation of an index, which was, in our study, correlated to the treatment response and also to main encountered toxicities.

  3. Synergistic Effect of Combination Topotecan and Chronomodulated Radiation Therapy on Xenografted Human Nasopharyngeal Carcinoma

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, YanLing; Chen, Xin; Ren, PeiRong; Su, Zhou; Cao, HongYing; Zhou, Jie; Zou, XiaoYan; Fu, ShaoZhi; Lin, Sheng; Fan, Juan; Yang, Bo; Sun, XiaoYang [Department of Oncology, Affiliated Hospital of Luzhou Medical College, Luzhou (China); Zhou, Yan; Chen, Yue [Department of Medical Imaging, Luzhou Medical College, Luzhou (China); Yang, LingLin, E-mail: yanglinglin2003@tom.com [Department of Oncology, Affiliated Hospital of Luzhou Medical College, Luzhou (China); Wu, JingBo, E-mail: wjb6147@163.com [Department of Oncology, Affiliated Hospital of Luzhou Medical College, Luzhou (China)

    2013-10-01

    Purpose: To investigate the in vivo chronomodulated radiosensitizing effect of topotecan (TPT) on human nasopharyngeal carcinoma (NPC) and its possible mechanisms. Methods and Materials: Xenografted BALB/c (nu/nu) NPC mice were synchronized with an alternation of 12 hours of light from 0 to 12 hours after light onset (HALO) and 12 hours of darkness to establish a unified biological rhythm. Chronomodulated radiosensitization of TPT was investigated by analysis of tumor regrowth delay (TGD), pimonidazole hydrochloride, histone H2AX phosphorylation, (γ-H2AX) topoisomerase I (Top I), cell cycle, and apoptosis after treatment with (1) TPT (10 mg/kg) alone; (2) radiation therapy alone (RT); and (3) TPT+RT at 3, 9, 15, and 21 HALO. The tumor-loaded mice without any treatment were used as controls. Results: The TPT+RT combination was more effective than TPT or RT as single agents. The TPT+RT combination at 15 HALO was best (TGD = 58.0 ± 3.6 days), and TPT+RT at 3 HALO was worst (TGD = 35.0 ± 1.5 days) among the 4 TPT+RT groups (P<.05). Immunohistochemistry analysis revealed a significantly increased histone H2AX phosphorylation expression and decreased pimonidazole hydrochloride expression in the TPT+RT group at the same time point. The results suggested that the level of tumor hypoxia and DNA damage varied in a time-dependent manner. The expression of Top I in the TPT+RT group was also significantly different from the control tumors at 15 HALO (P<.05). Cell apoptosis index was increased and the proportion of cells in S phase was decreased (P<.05) with the highest value in 15 HALO and the lowest in 3 HALO. Conclusions: This study suggested that TPT combined with chronoradiotherapy could enhance the radiosensitivity of xenografted NPC. The TPT+RT group at 15 HALO had the best therapeutic effect. The chronomodulated radiosensitization mechanisms of TPT might be related to circadian rhythm of tumor hypoxia, cell cycle redistribution, DNA damage, and expression of Top I.

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

    Directory of Open Access Journals (Sweden)

    Gasparro Simona

    2006-02-01

    Full Text Available Abstract Background 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. Methods 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. Results 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. Conclusion 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.

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

  7. 7 CFR 305.7 - Phosphine treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Phosphine treatment schedules. 305.7 Section 305.7 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Chemical Treatments § 305.7...

  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. Noncontingent reinforcement: a further examination of schedule effects during treatment.

    Science.gov (United States)

    Wallace, Michele D; Iwata, Brian A; Hanley, Gregory P; Thompson, Rachel H; Roscoe, Eileen M

    2012-01-01

    We conducted 2 studies to determine whether dense and thin NCR schedules exert different influences over behavior and whether these influences change as dense schedules are thinned. In Study 1, we observed that thin as well as dense NCR schedules effectively decreased problem behavior exhibited by 3 individuals. In Study 2, we compared the effects of 2 NCR schedules in multielement designs, one with and the other without an extinction (EXT) component, while both schedules were thinned. Problem behavior remained low as the NCR schedule with EXT was thinned, but either (a) did not decrease initially or (b) subsequently increased as the NCR schedule without EXT was thinned. These results suggest that dense schedules of NCR decrease behavior by altering its motivating operation but that extinction occurs as the NCR schedule is thinned. The benefits and limitations of using dense or thin NCR schedules are discussed.

  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. 75 FR 4227 - Phytosanitary Treatments; Location of and Process for Updating Treatment Schedules

    Science.gov (United States)

    2010-01-26

    ... harmonize and combine the requirements for performing irradiation treatment for imported articles, articles... schedules. Finally, we are harmonizing and combining the requirements for performing irradiation treatment for imported articles, articles moved interstate from Hawaii and U.S. territories, and articles...

  12. 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... Garbage § 305.40 Garbage treatment schedules for insect pests and pathogens. (a) T415-a, heat...

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

    Science.gov (United States)

    2011-01-19

    ... Emerald Ash Borer AGENCY: Animal and Plant Health Inspection Service, USDA. ACTION: Notice. SUMMARY: We are advising the public of our decision to revise a heat treatment schedule for the emerald ash borer... revised treatment schedule will be sufficient to treat emerald ash borer. DATES: Effective Date:...

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

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

    OpenAIRE

    Desai, Mayur; Rishad R. Jivani; 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...

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

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

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

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

  1. 7 CFR 305.42 - Miscellaneous treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... fruit must be rinsed with a pressure shower to rinse the fruit free of residue (detergent and dead... removal plus malathion-carbaryl chemical dip T201-p-2 (§ 305.10(d)) for alternative treatment; or (3)...

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

    Science.gov (United States)

    2010-01-01

    ... least three of the largest mangoes must be probed at the seed's surface. Sensors must be inserted into...) The treatment must be concluded once the temperature at the seed's surface reaches 118 °F. (d)...

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

  4. Behavioral treatment of depression: A meta-analysis of activity scheduling.

    NARCIS (Netherlands)

    Cuijpers, P.; Straten, van A.; Warmerdam, E.H.

    2007-01-01

    Activity scheduling is a behavioral treatment of depression in which patients learn to monitor their mood and daily activities, and how to increase the number of pleasant activities and to increase positive interactions with their environment. We conducted a meta-analysis of randomized effect studie

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

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

  7. Prophylactic treatment with a potent corticosteroid cream ameliorates radiodermatitis, independent of radiation schedule

    DEFF Research Database (Denmark)

    Ulff, Eva; Maroti, Marianne; Serup, Jörgen;

    2016-01-01

    schedules as well as for anatomical sites, skin type, breast size and BMI. Patients treated the irradiated area during the radiation period and two weeks following cessation of radiation. RESULTS: Patients receiving hypofraction RT developed less skin reactions than those treated with conventional RT...... in patients with breast cancer receiving adjuvant radiotherapy (RT) after surgery. In total, 202 patients were randomized to betamethasone-17-valerate cream or Essex® cream, a moisturizer. Treatment was assessed by RTOG clinical scoring. Patients' symptoms were recorded. The analyses were stratified for RT....... Treatment with a potent steroid resulted in clinically and statistically significantly less skin reactions (p

  8. 78 FR 68021 - Notice of Affirmation of Addition of a Treatment Schedule for Methyl Bromide Fumigation of...

    Science.gov (United States)

    2013-11-13

    ... species, Ceratitis capitata (Mediterranean fruit fly) and Anastrepha fraterculus (South American fruit fly... bromide treatment schedule to mitigate risk from C. capitata and A. fraterculus, as described in the...

  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

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

  10. Long-term results of two schedules of radioiodine treatment for toxic multinodular goitre

    Energy Technology Data Exchange (ETDEWEB)

    Huysmans, D.A.K.C. (Dept. of Nuclear Medicine, Univ. Hospital Nijmegen St. Radboud (Netherlands)); Hermus, A.R.M.M. (Dept. of Medicine, Div. of Endocrinology, Univ. Hospital Nijmegen St. Radboud (Netherlands)); Corstens, F.H.M. (Dept. of Nuclear Medicine, Univ. Hospital Nijmegen St. Radboud (Netherlands)); Kloppenborg, P.W.C. (Dept. of Medicine, Div. of Endocrinology, Univ. Hospital Nijmegen St. Radboud (Netherlands))

    1993-11-01

    The long-term effects of two schedules of radioiodine therapy in patients with toxic multinodular goitre were evaluated. Forty-five patients (group A) were treated with low doses and 58 patients (group B) with calculated doses adjusted for thyroid weight (1.85-3.70 MBq/g) and radioactive iodine uptake. Follow-up (mean[+-]SEM) was 4.3[+-]0.2 years and 5.2[+-]0.3 years, respectively (P0.1). At the end of follow-up, hyperthyroidism was succesfully reversed in 73% (group A) and 88% (group B). In each group, hypothyroidism was present in 7%. The total dose per gram of thyroid tissue was not significantly different in groups A and B (2.1[+-]0.2 vs 2.7[+-]0.2 MBq/g). However, for patients treated with calculated doses the number of [sup 131]I administrations was significantly lower (1.3[+-]0.1) than for patients treated with low doses (2.2[+-]0.2), and the percentage of patients who were adequately treated with a single dose was more than twice as high (66% in group B versus 27% in group A). Euthyroidism was reached within a significantly shorter time after treatment with calculated doses (media time 0.6 years in group BVS 1.5 years in group A; life table analysis). It is concluded that radioiodine is an effective treatment for toxic multinodular goitre with a low risk of post-treatment hypothyroidism and that calculated (higher) doses appear to be preferable to low doses. (orig.)

  11. Improving liveweight gain of lambs infected by multidrug-resistant nematodes using a FECRT-based schedule of treatments.

    Science.gov (United States)

    Pivoto, Felipe Lamberti; Machado, Fabricio Amadori; Anezi-Junior, Paulo Afonso; Weber, Augusto; Cezar, Alfredo Skrebsky; Sangioni, Luis Antonio; Vogel, Fernanda Silveira Flores

    2014-06-01

    The aim of this study was to compare the liveweight gain of lambs, infected by multidrug-resistant nematodes, treated by conventional schemes of helminth control or using a schedule based on fecal egg count reduction test (FECRT). The flock was selected after a FECRT (experiment 1) which revealed a parasite population resistant to benzimidazoles, imidazothiazoles, macrocyclic lactones (ivermectin), salicylanilides, nitrophenols, and organophosphates. Despite the parasite resistance to ivermectin (an avermectin), the moxidectin (a milbemycin) was effective against the gastrointestinal nematodes (PR > 90%). In experiment 2, 48 suckling lambs were distributed in four randomized blocks (G1, G2, G3, and G4) by previous body weighings. G1 was kept as untreated control; G2 was treated following a FECRT-based schedule with drugs chosen based on fecal analysis (first drench with moxidectin, second drench with a combination of moxidectin and levamisole, and third drench with praziquantel, an anti-cestode drug); G3 and G4 received three drenches with ivermectin or disophenol, respectively. Body weighings and fecal analysis of these lambs were performed every 2 weeks over a 98-day period. An effective control of gastrointestinal nematodes was obtained with two nematicidal drenches following the FECRT-based schedule of treatments. On the other hand, eggs per gram of feces (EPG) counts were no different among untreated control, G3, and G4. Lambs treated using the FECRT-based schedule had the greatest liveweight gain among the groups tested. Additionally, liveweight gain was no different among the groups G3, G4, and G1. The FECRT-based schedule of anthelmintic treatments was beneficial regarding productivity and sustainability of helminth control in lambs infected by multidrug-resistant nematodes.

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

  13. Changes of respiratory system mechanics in ventilated lungs of preterm infants with two different schedules of surfactant treatment.

    Science.gov (United States)

    de Winter, J P; Merth, I T; van Bel, F; Egberts, J; Brand, R; Quanjer, P H

    1994-05-01

    We investigated the time course of changes in the static respiratory system compliance and resistance in relationship to surfactant administration by means of single-breath and multiple-occlusion techniques. The study comprised 12 infants receiving a high-dose schedule (200 mg/kg, maximum 600 mg/kg) and 13 infants receiving a low-dose schedule (100 mg/kg, maximum 300 mg/kg) of porcine surfactant. Eight healthy preterm infants served as a comparison group. Respiratory mechanics were studied before and at 1.5, 8, and 72 h after surfactant administration. Results were related to changes in gas transfer, including an estimate of venous admixture. Static compliance improved after surfactant instillation, and changes were similar in the two treatment groups during the first eight h (0.8 In.(hour + 1) mL.kPa-1). The compliance values remained below the values of the healthy comparison group during the whole study period, but resistance remained at the same level. There was a considerable delay in changes of respiratory mechanics in relationship to the rapid fall of the venous admixture, from 27 to 19%, and the rapid increase of the transcutaneous oxygen pressure/fraction of inspired oxygen ratio from 13 to 27 kPa within the hour. There were no clues that short-term changes in compliance were masked by breathing at a higher and flatter portion of the pressure-volume curve. Both treatment schedules resulted in a similar improvement of compliance within 72 h and the two groups benefited similarly in terms of venous admixture.

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

  15. The effects of fixed-time reinforcement schedules on problem behavior of children with emotional and behavioral disorders in a day-treatment classroom setting.

    Science.gov (United States)

    Rasmussen, Karina; O'Neill, Robert E

    2006-01-01

    The current study assessed the effects of fixed-time reinforcement schedules on problem behavior of students with emotional-behavioral disorders in a clinical day-treatment classroom setting. Three elementary-aged students with a variety of emotional and behavioral problems participated in the study. Initial functional assessments indicated that social attention was the maintaining reinforcer for their verbally disruptive behavior. Baseline phases were alternated with phases in which attention was provided on fixed-time schedules in the context of an ABAB design. The results indicated that the provision of attention on fixed-time schedules substantially reduced the participants' rate of verbal disruptions. These decreases were maintained during initial thinning of the schedules. The results provide one of the first examples that such an intervention can be successfully implemented in a classroom setting.

  16. Development of phytosanitary cold treatments for oranges infested with Bactrocera invadens and Bactrocera zonata (Diptera: Tephritidae) by comparison with existing cold treatment schedules for Ceratitis capitata (Diptera: Tephritidae).

    Science.gov (United States)

    Hallman, Guy J; Myers, Scott W; El-Wakkad, Mokhtar F; Tadrous, Meshil D; Jessup, Andrew J

    2013-08-01

    Phytosanitary cold treatments were tested for Bactrocera invadens Drew, Tsuruta, and White and Bactrocera zonata (Saunders) using comparisons with Ceratitis capitata (Wiedemann). Oranges were infested by puncturing holes in the peel and allowing tephritids to oviposit in the holes. The treatments were initiated when the larvae reached late third instar because previous research had shown that stage to be the most cold tolerant for all three species. Results show that B. invadens is not more cold tolerant than C. capitata and B. zonata at 1.0 +/- 0.1 degrees C and lend support to the use of C. capitata cold treatment schedules for B. invadens. It cannot be concluded that B. zonata is not more cold tolerant than C. capitata.

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

  18. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

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

    2004-07-01

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

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

  20. Combination therapy for Cushing's disease: effectiveness of two schedules of treatment: should we start with cabergoline or ketoconazole?

    Science.gov (United States)

    Barbot, M; Albiger, N; Ceccato, F; Zilio, M; Frigo, A C; Denaro, L; Mantero, F; Scaroni, C

    2014-04-01

    Cushing's disease (CD) is associated with increased morbidity and mortality. Until now, no medical treatment has been shown to be totally satisfactory when administrated alone. This study aimed to assess the effectiveness of cabergoline with added ketoconazole and of the same combination in reverse, using urinary free cortisol (UFC) and late night salivary cortisol (LNSC) levels as biochemical markers of the treatments' efficacy in CD patients. A prospective analysis conducted on 14 patients (f/m = 12/2; median age 52, range 33-70 years) divided into two groups: 6 patients initially treated with cabergoline for 4-6 months (rising from 0.5-1 mg/week up to 3.0 mg/week), after which ketoconazole was added (group A); and 8 patients first took ketoconazole alone for 4-6 months (rising from 200 mg/day to 600 mg/day), then cabergoline was added (group B). Patients were compared with 14 age-matched patients in prolonged remission after effective neurosurgery for CD. The combination therapy led to UFC normalization in 79 % of patients with no differences between the groups; only one patient failed to respond at all. Neither drug succeeded in controlling the disease when taken alone. LNSC dropped when compared to baseline levels, but not to a significant degree (p = 0.06), and it remained significantly higher than in controls (p = 0.0006). Associating cabergoline with ketoconazole may represent an effective second-line treatment, achieving a satisfactory reduction in UFC levels and clinical improvement. Although the combined treatment lowered patients' LNSC levels, they remained higher than normal, indicating a persistent subclinical hypercortisolism; the implications of this condition need to be considered. No differences emerged between the two treatment schedules.

  1. Chemotherapy drug scheduling for the induction treatment of patients with acute myeloid leukemia.

    Science.gov (United States)

    Pefani, E; Panoskaltsis, N; Mantalaris, A; Georgiadis, M C; Pistikopoulos, E N

    2014-07-01

    Leukemia is an immediately life-threatening cancer wherein immature blood cells are overproduced, accumulate in the bone marrow (BM) and blood and causes immune and blood system failure. Treatment with chemotherapy can be intensive or nonintensive and can also be life-threatening since only relatively few patient-specific and leukemia-specific factors are considered in current protocols. We have already presented a mathematical model for one intensive chemotherapy cycle with intravenous (i.v.) daunorubicin (DNR), and cytarabine (Ara-C). This model is now extended to nonintensive subcutaneous (SC) Ara-C and for a standard intensive chemotherapy course (four cycles), consistent with clinical practice. Model parameters mainly consist of physiological patient data, indicators of tumor burden and characteristics of cell cycle kinetics. A sensitivity analysis problem is solved and cell cycle parameters are identified to control treatment outcome. Simulation results using published cell cycle data from two acute myeloid leukemia patients are presented for a course of standard treatment using intensive and nonintensive protocols. The aim of remission-induction therapy is to debulk the tumor and achieve normal BM function; by treatment completion, the total leukemic population should be reduced to at most 10(9) cells, at which point BM hypoplasia is achieved. The normal cell number should be higher than that of the leukemic, and a 3-log reduction is the maximum permissible level of population reduction. This optimization problem is formulated and solved for the two patient case studies. The results clearly present the benefits from the use of optimization as an advisory tool for treatment design.

  2. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

    Personnel scheduling can become a particularly difficult optimisation problem due to human factors. And yet: people working in healthcare, transportation and other round the clock service regimes perform their duties based on a schedule that was often manually constructed. The unrewarding manual scheduling task deserves more attention from the timetabling community so as to support computation of fair and good quality results. The present abstract touches upon a set of particular characterist...

  3. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1999. Thesis (Master's) -- Bilkent University, 1999. Includes bibliographical references. Distributed Scheduling (DS) is a new paradigm that enables the local decisionmakers make their own schedules by considering local objectives and constraints within the boundaries and the overall objective of the whole system. Local schedules from different parts of the system are...

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

  5. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

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

  6. Treatment of adult lymphoblastic leukaemia using cyclical chemotherapy with three combinations of four drugs (COAP, POMP, TRAP schedule).

    Science.gov (United States)

    Proctor, S J; Finney, R; Walker, W; Thompson, R B

    1981-01-01

    Seventeen adult patients with previously untreated acute lymphoblastic leukaemia (ALL) were entered into a schedule of chemotherapy in which 3 combinations, each of 4 drugs, were administered in a predetermined cyclical rotation in combination with cranial irradiation and intrathecal injections of methotrexate. Of the 17 patients, 16 completed induction therapy and 15 (94%) entered remission. The only patient with T-ALL died before receiving any therapy. The median survival for all patients (17) was 22 months. Meningeal leukaemia did not occur during the haematological remission phase although 3 patients developed this complication following relapse. The authors conclude that the addition of cyclophosphamide and cytosine arabinoside to vincristine/prednisone provides excellent remission induction but the aggressive maintenance schedule employed has not led to significant long-term survival.

  7. 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...... AND METHODS: Rats were trained to self-administer intravenous cocaine in a concurrent choice procedure, with a palatable food as the competing reinforcer, under a fixed ratio (FR) 1 FR 5 chain schedule. Aripiprazole was then administered as continuous infusion by osmotic minipumps for 5 days, during which...... 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...

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

  9. Twelve-hour brain lithium concentration in lithium maintenance treatment of manic-depressive disorder: daily versus alternate-day dosing schedule

    DEFF Research Database (Denmark)

    Jensen, H.V.; Plenge, P; Stensgaard, A

    1996-01-01

    The 12-h brain lithium concentration was measured by lithium-7 magnetic resonance spectroscopy in ten manic-depressive patients receiving daily or alternate-day lithium carbonate treatment. The median dose of lithium carbonate was 800 mg in the daily treatment group and 1200 mg in the alternate......-day group. Median 12-h serum lithium concentration in the two groups was 0.86 mmol l-1 and 0.55 mmol l-1, respectively, while the corresponding concentration in brain was 0.67 mmol l-1 and 0.52 mmol l-1, respectively. The 12-h brain lithium concentration was independent of lithium dosing schedule (multiple...... linear regression), but correlated significantly with the 12-h serum lithium concentration (P = 0.003; B = 0.53, 95% c.l. 0.24-0.82; beta = 0.83). Thus at identical 12-h serum lithium concentrations the 12-h brain lithium concentration is similar with both treatment regimes. As the risk of manic...

  10. Correlation of Computerized Tomography density patterns of lymph nodes with treatment results and outcome in head and neck cancer patients treated by 2 different chemoradiotherapy schedules

    Directory of Open Access Journals (Sweden)

    Sweta Jaju

    2014-01-01

    Full Text Available Aims/Background: Tumor necrosis is visualized on CT scan as non enhancing hypodense area. Necrotic areas contain less oxygen and results in poor response of chemo-radiotherapy. Literature review (1 has shown that for hypodense lesions in head and neck cancer the complete response rate is lower than the isodense lesions. Locally advanced head and neck cancer require the addition of surgery but after a radical dose of radiation that is, 7000 cGy, surgery become difficult but there is no tool initially that can be used for selection of patients after delivery of 4500 cGy, that is the dose after which surgery can be performed without much difficulty. The hypothesis is that, hypodense lymph nodes even when they are small will show less response to various schedules of chemoradiotherapy so hypodensity of lymph nodes can be used as a tool to select patient, who will go for surgery after initial 4500 cGy of radiotherapy. Surgery is usually performed 2 to 3 weeks after radiotherapy, so primary can be treated to full dose while the skin in region of lymph nodes radiation field will recover from acute radiation reaction. Correlation of C T density patterns of lymph nodes in head and neck cancer patients with treatment results when two different chemoradiotherapy schedules are used is studied. Materials and Methods: Eighty three patients with locally advanced head and neck cancer were treated with two schedules of concurrent chemoradiotherapy prospectively from August 2010 to July 2011. CT Scans of the entire neck region including primary were performed. An iodine based contrast material (150 ml was injected intravenously starting with a bolus of 50ml (3ml/s, followed by a slow (1ml/s infusion of the remaining dose. The total tumor volume of the primary and involved neck nodes was calculated as a cuboid volume using maximum dimension in each plane: Vc= (a x b x c. Nodal density was graded. Results and Conclusion: No statistically significant association

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

  12. Assessment of the effects of dalteparin on coagulation variables and determination of a treatment schedule for use in cats.

    Science.gov (United States)

    Schönig, Jette C; Mischke, Reinhard H

    2016-07-01

    OBJECTIVE To determine a treatment protocol for SC administration of dalteparin to cats on the basis of currently available detailed pharmacokinetic data and to assess the effect of SC administration of dalteparin to cats on coagulation variables such as activated partial thromboplastin time (aPTT), thrombin time, and results for thromboelastometry, compared with effects on anti-activated coagulation factor X (anti-Xa) activity. ANIMALS 6 healthy domestic shorthair cats. PROCEDURES Cats received 14 injections of dalteparin (75 anti-Xa U/kg, SC) at 6-hour intervals. Blood samples were collected before and 2 hours after the first and second injections on days 1, 2, and 4. Anti-Xa activity was measured by use of a chromogenic substrate assay, aPTT and thrombin time were measured by use of an automated coagulometer, and viscoelastic measurements were obtained with thromboelastrometry. RESULTS 2 hours after the second injection, the target peak anti-Xa activity range of 0.5 to 1.0 U/mL was achieved in all cats, whereas median trough values remained below this range. Peak anti-Xa activity had only minimal effects on coagulation variables; the maximum median ratio for aPTT (in relationship to the value before the first dalteparin injection) was 1.23. CONCLUSIONS AND CLINICAL RELEVANCE Results of this study indicated that this treatment protocol resulted in reproducible anti-Xa activity in cats that was mostly within the targeted peak range of anti-Xa activity recommended for humans. Treatment in accordance with this protocol may not require routine coagulation monitoring of cats, but this must be confirmed in feline patients.

  13. Development of phytosanitary cold treatments for oranges infested with Bactrocera invadens and B. zonata (Diptera: Tephritidae) by comparison...existing cold treatment schedules for Ceratitis capitata (Diptera: Tephritidae)

    Science.gov (United States)

    Phytosanitary cold treatments are attempted for Bactrocera invadens Drew, Tsuruta, and White and Bactrocera zonata (Saunders) by comparison with Ceratitis capitata (Wiedemann). Oranges were infested by puncturing holes in the peel and allowing tephritids to oviposit in the holes. The treatments were...

  14. 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...... assuring high confidence in the correctness of the model. A satisfactory design can be proved schedulable using the computation costly method (symbolic model checking). In order to analyze a hierar- chical scheduling system compositionally, we introduce the notion of a stochastic supplier modeling...... the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  15. Immunization Schedules for Adults

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  16. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  17. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

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

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

  19. Alternative Work Schedules Increase Employee Satisfaction.

    Science.gov (United States)

    Turney, John R.; Cohen, Stanley L.

    1983-01-01

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

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

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

  2. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... 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...

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

  4. Scheduling for Responsive Grids

    CERN Document Server

    Germain-Renaud, C; Moscicki,JT; Texier, R

    2008-01-01

    Grids are facing the challenge of seamless integration of the Grid power into everyday use. One critical component for this integration is responsiveness, the capacity to support on-demand computing and interactivity. Grid scheduling is involved at two levels in order to provide responsiveness: the policy level and the implementation level. The main contributions of this paper are as follows. First, we present a detailed analysis of the performance of the EGEE Grid with respect to responsiveness. Second, we examine two user-level schedulers located between the general scheduling layer and the application layer. These are the DIANE (distributed analysis environment) framework, a general-purpose overlay system, and a specialized, embedded scheduler for gPTM3D, an interactive medical image analysis application. Finally, we define and demonstrate a virtualization scheme, which achieves guaranteed turnaround time, schedulability analysis, and provides the basis for differentiated services. Both methods target a br...

  5. 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次加压治疗治愈,平

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

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

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

  9. Schedule of voucher delivery influences initiation of cocaine abstinence.

    Science.gov (United States)

    Kirby, K C; Marlowe, D B; Festinger, D S; Lamb, R J; Platt, J J

    1998-10-01

    This study examined whether voucher delivery arrangements affect treatment outcome. First, 90 cocaine-dependent adults were randomly assigned to behavioral counseling or counseling plus vouchers for cocaine-free urine samples. The value of each voucher was low at the beginning but increased as the patient progressed (Voucher Schedule 1). Voucher Schedule 1 produced no improvements relative to counseling only. Next, 23 patients received vouchers on either Voucher Schedule 1 or Voucher Schedule 2. Voucher Schedule 2 began with high voucher values, but requirements for earning vouchers increased as the patient progressed. Average durations of cocaine abstinence were 6.9 weeks on Voucher Schedule 2 versus 2.0 weeks on Voucher Schedule 1 (p = .02). This confirms that vouchers can assist in initiating abstinence and that voucher delivery arrangements are critical.

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

  11. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

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

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

  13. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

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

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

  16. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

    Given a set J of jobs, where each job j is associated with release date r j , deadline d j and processing time p j , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length p j between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any given time. This is one of the basic settings in the resource-minimization job scheduling, and the classical randomized rounding technique of Raghavan and Thompson provides an O(logn/loglogn)-approximation for it. This result has been recently improved to an O(sqrt{log n})-approximation, and moreover an efficient algorithm for scheduling all jobs on O((OPT)^2) machines has been shown. We build on this prior work to obtain a constant factor approximation algorithm for the problem.

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

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

  19. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

    The schedule for the installation of the PAR slurry loop experiment in the South Facility of the ORR has been reviewed and revised. The design, fabrications and Installation is approximately two weeks behind schedule at this time due to many factors; however, indications are that this time can be made up. Design is estimated to be 75% complete, fabrication 32% complete and installation 12% complete.

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

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

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

  3. Experience of nursing scheduling in the Ebola treatment center observation ward%援利埃博拉诊疗中心留观病区护理排班的经验与体会

    Institute of Scientific and Technical Information of China (English)

    王丽慧; 李宁; 邹德莉; 卢天舒

    2016-01-01

    目的:探讨适合埃博拉诊疗中心留观病区特点,降低护理人员感染风险的调配排班方法,以期为其他执行类似任务的护理同仁提供借鉴。方法采用分班次固定小组的排班方法,固定工作时间,明确并细化护理工作内容。结果共收治埃博拉疑似、可能患者65例,其中5例确诊为埃博拉病毒病,护理人员无一例感染。结论在烈性传染病护理工作中,合理的人员编配和排班方法,可以使护理人员有饱满的精力和体力投入工作,确保“零感染”目标的实现。%Objective To investigate the characteristics of the diagnosis and treatment center for Ebola observing ward and reduce infection risk according to allocation scheduling method of nursing staff. To provide reference for other similar tasks. Methods We used the method of grouping fixed group scheduling method and fixed working hours to identify and refine the content of nursing work. Results A total of 65 cases of suspected Ebola including 5 cases diagnosed as EVD patients were cured. No case of infection occurred in nursing staff. Conclusions During the infectious disease nursing work, reasonable personnel allocation and scheduling method can make the nursing staff work with full energy and strength and ensure the realization of"zero infection"targets.

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

  5. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  6. Childhood Vaccine Schedule

    Science.gov (United States)

    Skip Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... as pneumonia, blood infections, and bacterial meningitis Rotavirus vaccine (three ... in babies and young children 4 Months DTaP, Hib, IPV, PCV, RV 6 ...

  7. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

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

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

  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. Model Migration Schedules

    OpenAIRE

    1981-01-01

    This report draws on the fundamental regularity exhibited by age profiles of migration all over the world to develop a system of hypothetical model schedules that can be used in multiregional population analyses carried out in countries that lack adequate migration data.

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

  12. Flexible Software for Flexible Scheduling

    Science.gov (United States)

    Economou, Frossie; Jenness, Tim; Tilanus, Remo P. J.; Hirst, Paul; Adamson, Andy J.; Rippa, Mathew; Delorey, Kynan K.; Isaak, Kate G.

    The JAC Observation Management Project (OMP) provides software for the James Clerk Maxwell (JCMT) and the United Kingdom Infrared (UKIRT) telescopes that manages the life-cycle of flexibly scheduled observations. Its aim is to increase observatory efficiency under flexible (queue) scheduled observing, without depriving the principal investigator (PI) of the flexibility associated with classical scheduling.

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

  14. Comparison of three rapamycin dosing schedules in A/J Tsc2+/- mice and improved survival with angiogenesis inhibitor or asparaginase treatment in mice with subcutaneous tuberous sclerosis related tumors

    Directory of Open Access Journals (Sweden)

    Dabora Sandra L

    2010-02-01

    Full Text Available Abstract Background Tuberous Sclerosis Complex (TSC is an autosomal dominant tumor disorder characterized by the growth of hamartomas in various organs including the kidney, brain, skin, lungs, and heart. Rapamycin has been shown to reduce the size of kidney angiomyolipomas associated with TSC; however, tumor regression is incomplete and kidney angiomyolipomas regrow after cessation of treatment. Mouse models of TSC2 related tumors are useful for evaluating new approaches to drug therapy for TSC. Methods In cohorts of Tsc2+/- mice, we compared kidney cystadenoma severity in A/J and C57BL/6 mouse strains at both 9 and 12 months of age. We also investigated age related kidney tumor progression and compared three different rapamycin treatment schedules in cohorts of A/J Tsc2+/- mice. In addition, we used nude mice bearing Tsc2-/- subcutaneous tumors to evaluate the therapeutic utility of sunitinib, bevacizumab, vincristine, and asparaginase. Results TSC related kidney disease severity is 5-10 fold higher in A/J Tsc2+/- mice compared with C57BL/6 Tsc2+/- mice. Similar to kidney angiomyolipomas associated with TSC, the severity of kidney cystadenomas increases with age in A/J Tsc2+/- mice. When rapamycin dosing schedules were compared in A/J Tsc2+/- cohorts, we observed a 66% reduction in kidney tumor burden in mice treated daily for 4 weeks, an 82% reduction in mice treated daily for 4 weeks followed by weekly for 8 weeks, and an 81% reduction in mice treated weekly for 12 weeks. In the Tsc2-/- subcutaneous tumor mouse model, vincristine is not effective, but angiogenesis inhibitors (sunitinib and bevacizumab and asparaginase are effective as single agents. However, these drugs are not as effective as rapamycin in that they increased median survival only by 24-27%, while rapamycin increased median survival by 173%. Conclusions Our results indicate that the A/J Tsc2+/- mouse model is an improved, higher through-put mouse model for future TSC

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

  16. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

    Bartal, Y. [Tel-Aviv Univ. (Israel); Leonardi, S.; Marchetti-Spaccamela, A. [Universita di Roma (Italy); Sgall, J. [Mathematical Inst., Zitna (Czechoslovakia)] [and others

    1996-12-31

    We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds, in particular for m = 2 we give an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.

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

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

  19. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

    Full Text Available 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, and Priority scheduling algorithm.

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

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

  2. One-year treatment with different dosing schedules of fluticasone propionate in childhood asthma - Effects on hyperresponsiveness, lung function, and height

    NARCIS (Netherlands)

    Visser, MJ; Postma, DS; Arends, LR; De Vries, TW; Duiverman, EJ; Brand, PLP

    2001-01-01

    Dose-dependent effects of inhaled corticosteroids have been described. Although it has been advised to start treatment with inhaled corticosteroids with a high dose tapering off subsequently (stepdown approach), no clinical studies have assessed this strategy. We compared two different dosage schedu

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

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

  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. 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....... The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction...... among the employees, sophisticated scheduling methods are required. When approaching the day of operation, the detail level of the planning becomes finer. With a given allocation of shifts to employees, the focus is turned to tasks scheduling within those shifts. The objective is to assign as much work...

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

  8. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

    package DON Department of the Navy F&R Fix and Relax GAMS General Algebraic Modeling System LCS Littoral Combat Ship LCSRON Littoral Combat Ship...but that can be acceptable depending on the scheduler needs. F&R produces superior long-term schedules when compared to a similar-length RH schedule...LEFT BLANK 29 IV. MODEL IMPLEMENTATION LCSS is implemented with the General Algebraic Modeling System (GAMS) using the GAMS/CPLEX (GAMS, 2014

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

  10. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

    Full Text Available Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93–97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.

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

  12. Scheduling the powering tests

    CERN Document Server

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

    2008-01-01

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

  13. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

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

  15. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

    When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two...

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

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

  19. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  20. Bulletin publication schedule

    CERN Document Server

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

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

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

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

  4. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

    Any sports league needs a schedule of play, and such a schedule can be important, as it may influence the outcome of the sports competition itself and since it may have an impact on the interests of all parties involved. As in many other sports leagues and countries, the interest for Belgian soccer has increased over the last years. This paper describes our experiences in scheduling the highest Belgian soccer league. We describe how we automated and improved the way in which the calendar is ...

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

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

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

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

  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. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  12. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  13. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

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

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

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

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

  18. Batch Scheduling a Fresh Approach

    Science.gov (United States)

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

    1994-01-01

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

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

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

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

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

  3. Feature-based telescope scheduler

    Science.gov (United States)

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

    2016-07-01

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

  4. Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

    In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at the transmitter for pages of information. Multiple requests may be for the same page. When a page is transmitted, all requests for that page receive the transmission simulteneously. The speed the transmitter sends data at can be dynamically scaled to conserve energy. We consider the problem of minimizing flow time plus energy, the most popular scheduling metric considered in the standard scheduling model when the scheduler is energy aware. We will assume that the power consumed is modeled by an arbitrary convex function. For this problem there is a $\\Omega(n)$ lower bound. Due to the lower bound, we consider the resource augmentation model of Gupta \\etal \\cite{GuptaKP10}. Using resource augmentation, we give a scalable algorithm. Our result also gives a scalable non-clairvoyant algorithm for minimizing weighted flow time plus energ...

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

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

  7. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

    In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on ...

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

  9. A scheduling model for astronomy

    Science.gov (United States)

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

    2016-04-01

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

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

  11. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  12. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

    This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a

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

  14. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  15. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... 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...... 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...

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

  17. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

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

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

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

  20. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

    training syllabus . 14. SUBJECT TERMS Scheduling, optimization, flight training, Advance Strike Training, pilot 15. NUMBER OF...SKEDSOs that can help them increase throughput of students in the advanced strike training syllabus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii...instructor pilots with student naval aviators to achieve syllabus events. The schedule is built manually each day by squadron scheduling officers (SKEDSOs

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

  2. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

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

    2012-01-01

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

  3. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

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

  4. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations..., the Board's General Manager will update the FOIA Fee Schedule once every 12 months. The previous...

  5. Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

    NARCIS (Netherlands)

    Heemstra de Groot, Sonia M.; Herrmann, Otto E.

    1990-01-01

    A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality crite

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

    Science.gov (United States)

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

    2008-01-01

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

  7. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-10-01

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

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

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

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

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

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

  13. Reactive Scheduling in Multipurpose Batch Plants

    Science.gov (United States)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

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

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

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

  16. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

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

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

  17. Scheduling of an aircraft fleet

    Science.gov (United States)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

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

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

  19. Greedy Maximal Scheduling in Wireless Networks

    CERN Document Server

    Li, Qiao

    2010-01-01

    In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.

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

  1. Minimally disruptive schedule repair for MCM missions

    Science.gov (United States)

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

    2015-05-01

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

  2. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

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

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

  4. Steps Toward Optimal Competitive Scheduling

    Science.gov (United States)

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

    2006-01-01

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

  5. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  6. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

    Full Text Available In this study, we present a literature review, classification schemes and analysis of methodology for scheduling problems on Batch Processing machine (BP with both processing time and job size constraints which is also regarded as Two-Dimensional (TD scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, with details of the basic algorithms and other significant results.

  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. Analisis Performansi Algoritma Penjadwalan Log Rule dan Frame Level Schedule Skenario Multicell Pada Layer Mac LTE

    Directory of Open Access Journals (Sweden)

    Ridwan

    2016-03-01

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

  9. Effects of practice schedules on speech motor learning.

    Science.gov (United States)

    Wong, Andus W-K; Whitehill, Tara L; Ma, Estella P-M; Masters, Rich

    2013-10-01

    The aim of this study was to evaluate the effects of various practice schedules on learning a novel speech task. Forty healthy Cantonese speakers were asked to learn to produce a Cantonese phrase with two target utterance durations (2500 and 3500 milliseconds). They were randomly assigned to one of four learning conditions, each completing a different practice schedule, namely Blocked only, Random only, Blocked-then-Random, and Random-then-Blocked. Two retention tests (one immediate and one delayed) and a transfer test were administered. The four groups of participants showed different patterns of learning, but achieved comparable levels of performance at the end of the acquisition phase. However, participants in the Blocked only condition were less able to differentiate the two target durations than those in the Random only condition during retention. Furthermore, participants who received both blocked and random practice were less adversely affected by the secondary task during the transfer test than those who received either blocked or random practice alone. These findings suggest that mixed practice schedules are more effective than either blocked or random practice, especially in transferring the acquired speech motor skills to a cognitively demanding situation. The results have clinical implications regarding optimal practice schedules for treatment intervention.

  10. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available 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 schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  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. An Efficient SJRR CPU Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Saeeda Bibi

    2010-05-01

    Full Text Available CPU Scheduling is a vital discipline which helps us gain deep insight into the complex set of policies and mechanisms used to govern the order in which tasks are executed by the processor. This article proposes an efficient Shortest Job Round Robin (SJRR CPU Scheduling algorithm having better average waiting time (AWT and average turnaround time (ATT as compared to other CPU Scheduling techniques. The primary objective of this algorithm is to optimize system performance according to the criteria deemed most important by system designers. Included in this work, is a simulation that compares the proposed algorithms with some well known practices to CPU scheduling.

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

  14. The influence of hierarchical group scheduling emergency mode on critically ill pa-tients' treatment effect%分层成组排班急救模式对急危重症患者救治效果的影响

    Institute of Scientific and Technical Information of China (English)

    何冰

    2016-01-01

    目的:探讨分层成组排班急救模式与传统急救模式对急危重症患者的救治效果差异,寻求更有效的急救模式。方法选择我院急诊科2013年2月至2015年2月96例急危重症患者作为实验组,对患者实施分层成组排班急救模式救治;另选择我院急诊科2010年2月至2012年2月96例急危重症患者作为对照组,对患者实施传统急救救治。对两组研究对象的有效救治时间、救治效果、护理满意度、心理状态进行对比和分析。结果实验组患者有效救治总有效率为92.7%,护理满意率93.8%;对照组患者有效救治总有效率为83.3%,护理满意率79.2%,两组比较差异均具有统计学意义( P<0.05)。抢救后,实验组患者焦虑和抑郁评分均低于对照组,差异有统计学意义( P<0.05)。结论急危重症患者实施分层成组排班急救模式可以有利于提高救治效果,降低不良反应发生率,改善患者心理状态,提高护理满意度。%Objective To explore the differences of the treatment effect between hierarchical group scheduling emergency mode and traditional mode of emergency for critically ill patients to seek more effective emergency mode. Methods A total of 96 cases of critically ill patients in the emergency department of our hospital from February 2013 to February 2015 were selected as the experimental group. The patients of the experimental group implemented hi-erarchical grouping scheduling emergency treatment mode; another 96 cases of critically ill patients in the emergency department of our hospital from February 2010 to February 2012 were chosen as the control group and all the patients were given traditional emergency treatment. The effective treatment time, treatment effect, nursing satisfaction degree and psychological status of the two groups were compared and analyzed. Results The total efficiency rate of the effective treatment for the patients of the experimental group was

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

  16. 76 FR 17617 - Changes to Treatments for Citrus Fruit From Australia

    Science.gov (United States)

    2011-03-30

    ... treatment schedules to the Plant Protection and Quarantine Treatment Manual for certain species of citrus... \\2\\ to amend the regulations by adding new treatment schedules for sweet cherries and certain species... Treatment Manual to include the new treatment schedules for certain species of citrus fruit from...

  17. 10 CFR 51.15 - Time schedules.

    Science.gov (United States)

    2010-01-01

    ... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... 10 Energy 2 2010-01-01 2010-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... NEPA review in accordance with any time schedule established under this section. (b) As specified in...

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

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

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

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

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

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

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

  5. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

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

    2006-01-01

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

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

  7. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

    Slomp, J.; Gaalman, G.J.C.; Ahmad, M.M.; Sullivan, W.G.; Migliore, H.; Randhawa, S.

    1998-01-01

    The existence of a well-designed scheduling procedure is a major condition for an effective integration of a flexible manufacturing cell (FMC) in the material flow of a firm. This paper shows the presence and relative importance of three parameter types in the scheduling of operations on a flexible

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

  9. 5 CFR 293.511 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Medical File System Records § 293.511 Retention schedule. (a) Temporary EMFS records must... accordance with General Records Schedule (GRS) 1, item 21, issued by the National Archives and Records Administration (NARA). (b) Occupational Medical Records considered to be long-term records must be maintained...

  10. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

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

    2016-11-01

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

  11. On green routing and scheduling problem

    CERN Document Server

    Touati, Nora

    2012-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  12. On green routing and scheduling problem

    OpenAIRE

    Touati, Nora; Jost, Vincent

    2011-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

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

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

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

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

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

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

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

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

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

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

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

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

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

  6. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

    Full Text Available We present a design of a complete and practical scheduler for the 3GPP Long Term Evolution (LTE downlink by integrating recent results on resource allocation, fast computational algorithms, and scheduling. Our scheduler has low computational complexity. We define the computational architecture and describe the exact computations that need to be done at each time step (1 milliseconds. Our computational framework is very general, and can be used to implement a wide variety of scheduling rules. For LTE, we provide quantitative performance results for our scheduler for full buffer, streaming video (with loose delay constraints, and live video (with tight delay constraints. Simulations are performed by selectively abstracting the PHY layer, accurately modeling the MAC layer, and following established network evaluation methods. The numerical results demonstrate that queue- and channel-aware QoS schedulers can and should be used in an LTE downlink to offer QoS to a diverse mix of traffic, including delay-sensitive flows. Through these results and via theoretical analysis, we illustrate the various design tradeoffs that need to be made in the selection of a specific queue-and-channel-aware scheduling policy. Moreover, the numerical results show that in many scenarios strict prioritization across traffic classes is suboptimal.

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

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

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

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

  11. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

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

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

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

  15. Multiprocessor Scheduling Using Parallel Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nourah Al-Angari

    2012-07-01

    Full Text Available Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance. The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.

  16. NEWS OF THE NATIONAL IMMUNIZATION SCHEDULE

    Directory of Open Access Journals (Sweden)

    O. V. Shamsheva

    2014-01-01

    Full Text Available The article presents the changes Immunization Schedule Russia introduced in 2014. In new Schedule now is the vaccination against pneumococcal disease for all children of 2 months with revaccination at 4 and 15 months old; excluded from the Schedule second revaccination against tuberculosis. At risk groups to be vaccinated against the flu, entered pregnant women and persons subject to military conscription. Recommendations on use of vaccines containing relevant antigens for the Russian Federation, to provide maximum effectiveness of immunization and vaccines that do not contain preservatives in children under 1 year of age. Offered to create a council of experts in the field of vaccinology and vaccine prevention

  17. Proposed Schedule for Fenton Hill Experiments

    Energy Technology Data Exchange (ETDEWEB)

    Albright, James N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Brown, Donald W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    1990-10-22

    To help in planning Fenton Hill experimental operations in concert with preparations for the Long-Term Flow Test (LTFT) next summer, the following schedule is proposed. This schedule fits some of the realities of the next few months, including the Laboratory closure during the Holidays, the seismic monitoring tests in Roswell, and the difficulties of operating during the winter months. Whenever possible, cyclic pumping operations during the colder months will be scheduled so that the pump will be on during the late evening and early morning hours to prevent freezeup.

  18. Scheduling and Subcontracting under Parallel Machines

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; TANG Guo-chun

    2012-01-01

    In this paper,we study a model on joint decisions of scheduling and subcontracting,in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.

  19. New schedulability analysis for WiDom

    OpenAIRE

    Vahabi, Maryam; Andersson, Björn

    2010-01-01

    WiDom is a wireless prioritized medium access control (MAC) protocol which offers a very large number of priority levels. Hence, it brings the potential for employing non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom with lower overhead (we call it: WiDo...

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

  1. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

    This paper deals with the problem of simultaneously scheduling machines and a number of autonomous mobile robots in a flexible manufacturing system (FMS). Besides capability of transporting materials between machines, the considered mobile robots are different from other material handling devices...... in terms of their advanced ability to perform tasks at machines by using their manipulation arms. The mobile robots thus have to be scheduled in relation to scheduling of machines so as to increase the efficiency of the overall system. The performance criterion is to minimize time required to complete all...

  2. Bridging the Gap Between Planning and Scheduling

    Science.gov (United States)

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

    2000-01-01

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

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

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

  5. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ...) Inservice training plans for enforcement personnel will be developed within 18 months of plan approval. (f... Inspection Scheduling System will be fully implemented and in operation March 31, 1975....

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

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

  8. Individualized Project Physics in a Modular Schedule.

    Science.gov (United States)

    Cange, Francis

    1985-01-01

    Project Physics is taught at Gibault High School (Waterloo, IL) using a modular schedule and learning activity packets. A description of the course, instructional strategies used, and the learning activity packets is provided. (JN)

  9. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

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

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

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

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

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

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

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

  16. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...... instances with 1,000 jobs and 1,000 machines covering 24 hours of scheduling activity on a Grid network. The algorithm is also compared to simulations of a real-life Grid, and results show that the solution quality significantly increases when solving the problem to optimality. The promising results...

  17. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1990-01-01

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

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

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

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

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

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

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

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

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

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

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

  8. Self-Healing Distributed Scheduling Platform

    OpenAIRE

    Frincu M.E.; Villegas N.M.; Petcu D.; Muller H.A.; Rouvoy R.

    2011-01-01

    International audience; Distributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behaviour of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behaviour of distributed scheduling platforms and to achieve business and user objectives. In this paper we propose a self-adaptive distributed scheduling platf...

  9. Revised data taking schedule with ion beams

    CERN Document Server

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

    2009-01-01

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

  10. Critical Machine Based Scheduling -A Review

    Science.gov (United States)

    Vivek, P.; Saravanan, R.; Chandrasekaran, M.; Pugazhenthi, R.

    2017-03-01

    This article aims to identify the natural occurrence of the critical machines in scheduling. The exciting scheduling in the real time manufacturing environment is focused on considering equal weight-age of all the machines, but very few researchers were considered the real time constraint(s) like processor/ machine/ workstation availability, etc.,. This article explores the gap between the theory and practices by identifying the critical machine in scheduling and helps the researcher to find the suitable problem in their case study environment. Through the literature survey, it is evident that, in scheduling the occurrence of the critical machine is in nature. The critical machine is found in various names and gives a various range of weight-age based on the particular manufacturing environment and it plays a vital role in scheduling which includes one or more circumstances of occurrence in the production environment. Very few researchers were reported that in manufacturing environment, the critical machine occurrence is in nature, but most of the researchers were focused to optimize the manufacturing environment by only reducing the cycle time. In real-time manufacturing environment, the scheduling of critical machine(s) was keenly monitored and some weight-age was considered.

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

  12. Optimal Schedules in Multitask Motor Learning.

    Science.gov (United States)

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

    2016-04-01

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

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

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

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

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

  17. 5 CFR 610.121 - Establishment of work schedules.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Establishment of work schedules. 610.121 Section 610.121 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS HOURS OF DUTY Weekly and Daily Scheduling of Work Work Schedules § 610.121 Establishment of work schedules....

  18. Store-Forward and its implications for Proportional Scheduling

    NARCIS (Netherlands)

    Walton, N.S.

    2014-01-01

    The Proportional Scheduler was recently proposed as a scheduling algorithm for multi-hop switch networks. For these networks, the BackPressure scheduler is the classical benchmark. For networks with fixed routing, the Proportional Scheduler is maximum stable, myopic and, furthermore, will alleviate

  19. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  20. 77 FR 33980 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2012-06-08

    ... NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear... the SUPPLEMENTARY INFORMATION to the Board's proposed FOIA Fee Schedule Update published in the... update the FOIA Fee Schedule once every 12 months. Previous Fee Schedule Updates were published in...

  1. Personnel and patient scheduling in the high demanded hospital services: a case study in the physiotherapy service.

    Science.gov (United States)

    Ogulata, S Noyan; Koyuncu, Melik; Karaskas, Esra

    2008-06-01

    High demand but limited staffs within some services of a hospital require a proper scheduling of staff and patients. In this study, a hierarchical mathematical model is proposed to generate weekly staff scheduling. Due to computational difficulty of this scheduling problem, the entire model is broken down into manageable three hierarchical stages: (1) selection of patients, (2) assignment of patients to the staff, (3) scheduling of patients throughout a day. The developed models were tested on the data collected in College of Medicine Research Hospital at Cukurova University using GAMS and MPL optimization packages. From the results of the case study, the presented hierarchical model provided a schedule that ensures to maximize the number of selected patients, to balance the workload of physiotherapist, and to minimize waiting time of patients in their treatment day.

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

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

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

    Science.gov (United States)

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

    2001-09-01

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

  5. A scheduling framework applied to digital publishing workflows

    Science.gov (United States)

    Lozano, Wilson; Rivera, Wilson

    2006-02-01

    This paper presents the advances in developing a dynamic scheduling technique suitable for automating digital publishing workflows. Traditionally scheduling in digital publishing has been limited to timing criteria. The proposed scheduling strategy takes into account contingency and priority fluctuations. The new scheduling algorithm, referred to as QB-MUF, gives high priority to jobs with low probability of failing according to artifact recognition and workflow modeling critera. The experimental results show the suitability and efficiency of the scheduling strategy.

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

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

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

    NARCIS (Netherlands)

    Oostrum, van J.M.; Houdenhoven, van M.; Hurink, J.L.; Hans, E.W.; Wullink, G.; Kazemier, G.

    2005-01-01

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

  9. 78 FR 26701 - Schedules of Controlled Substances: Placement of Lorcaserin Into Schedule IV

    Science.gov (United States)

    2013-05-08

    ... may lead to limited physical or psychological dependence relative to drugs in Schedule III. On the... psychological dependence relative to the drugs or other substances in Schedule III. This finding is based on the... significant additional manpower, capital investment, or recordkeeping burdens. The only additional...

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

  12. 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-d...... questions whether schedules of non-economic damages, as well as other limitations on compensations to medical malpractice victims, are an effective way to improve the payoff of health care providers.......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...

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

  14. SDRAM bus schedule of HDTV video decoder

    Science.gov (United States)

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

    2001-12-01

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

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

  16. Hybrid Scheduling Model for Independent Grid Tasks

    Directory of Open Access Journals (Sweden)

    J. Shanthini

    2015-01-01

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

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

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

  19. Distributed job scheduling in MetaCentrum

    Science.gov (United States)

    Tóth, Šimon; Ruda, Miroslav

    2015-05-01

    MetaCentrum - The Czech National Grid provides access to various resources across the Czech Republic. The utilized resource management and scheduling system is based on a heavily modified version of the Torque Batch System. This open source resource manager is maintained in a local fork and was extended to facilitate the requirements of such a large installation. This paper provides an overview of unique features deployed in MetaCentrum. Notably, we describe our distributed setup that encompasses several standalone independent servers while still maintaining full cooperative scheduling across the grid. We also present the benefits of our virtualized infrastructure that enables our schedulers to dynamically request ondemand virtual machines, that are then used to facilitate the varied requirements of users in our system, as well as enabling support for user requested virtual clusters that can be further interconnected using a private VLAN.

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

  1. Scheduling jobs that arrive over time

    Energy Technology Data Exchange (ETDEWEB)

    Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Stein, C. [Dartmouth Coll., Hanover, NH (United States); Wein, J. [Polytechnic Univ., Brooklyn, NY (United States). Dept. of Computer Science

    1995-04-06

    A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time. We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.

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

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

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

  5. Scheduling support for transactional memory contention management

    DEFF Research Database (Denmark)

    Maldonado, Walther; Marler, Patrick; Felber, Pascal

    2010-01-01

    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...... kernels. Our experimental evaluation demonstrates that lightweight kernel-level scheduling support significantly reduces the number of aborts while improving transaction throughput on various workloads....

  6. 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...... be uncertain and dependent on time. It is suggested to use a combination of background knowledge of the operator and computer tools to solve the scheduling problem. More specificly it is suggested that the plant is equipped with (i) an automatic on-line system for forecasting the heat demand, (ii......) an interactive decision support tool by which optimal schedules can be found given the forecasts or user-defined modifications of the forecasts, and (iii) an automatic on-line system for monitoring when conditions have changed so that rescheduling is appropriate. In this report the focus is on methods applicable...

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

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

  9. Research on schedulers for astronomical observatories

    Science.gov (United States)

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

    2012-09-01

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

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

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

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

  13. Scheduling projects with multiskill learning effect.

    Science.gov (United States)

    Zha, Hong; Zhang, Lianying

    2014-01-01

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

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

  15. Real-time systems scheduling fundamentals

    CERN Document Server

    Chetto, Maryline

    2014-01-01

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

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

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

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

  19. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

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

    2008-01-01

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

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

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

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

  3. Study/Services Installation/Implementation Schedule Analysis

    Science.gov (United States)

    1989-11-16

    Scheduled Morbach AB, GE 078 8 08-19-91 08-28-91 Scheduled RheinMain (MAC) 170 8 09-03-91 09-12-91 Scheduled Templehof (MAC) 171 8 09-17-91 09-26-91...94 Scheduled Sembach AB, GE 378 3 01-20-94 01-24-94 Scheduled RheinMain (MAC) 388 3 01-27-94 01-31-94 Scheduled Templehof (MAC) 389 3 02-03-94 02-07

  4. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria-Eugenia; Hillegersberg, van Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This partn

  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. Crane Scheduling on a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper

    2002-01-01

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

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

  8. 29 CFR 1952.371 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... inspectors and voluntary compliance personnel will be developed within 6 months of plan approval. (j) The... both safety and health personnel will be reviewed and revised to accurately reflect job functions..., 1977. (m) An inspection scheduling system will be developed for the health program within 6 months...

  9. Reinventing Crew Scheduling at Netherlands Railways

    NARCIS (Netherlands)

    M. Fischetti (Matteo); L.G. Kroon (Leo); G. Timmer (Gerrit); M.J.C.M. Vromans (Michiel); E.J.W. Abbink (Erwin)

    2004-01-01

    textabstractIn this paper we describe the successful application of a sophisticated Operations Research model and the corresponding solution techniques for scheduling the 6,500+ drivers and conductors of the Dutch railway operator NS Reizigers (Netherlands Railways). In 2001 the drivers and conducto

  10. Scheduling parallel jobs with linear speedup

    NARCIS (Netherlands)

    Grigoriev, A.; Uetz, M.J.; Erlebach, T.; Persiano, P.

    2006-01-01

    We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of $k$ units of that resource can be allocated to the jobs at any time, and the more

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

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

  13. Advance Resource Provisioning in Bulk Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet

    2012-10-01

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

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

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

  16. Cross layer scheduling algorithm for LTE Downlink

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Yan, Ying; Dittmann, Lars

    2012-01-01

    . This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions regarding the channel conditions and the size of transmission buffers and different QoS demands. The simulation results show that the new algorithm improves the resource...

  17. 29 CFR 4901.32 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... this section. (b) Charges for duplication of records. Charges applicable under this subpart for... of duplication. (c) Other charges. The scheduled fees, set forth in paragraphs (a) and (b) of this section, for furnishing records made available for inspection and duplication represent the direct...

  18. 76 FR 10233 - Schedule of Water Charges

    Science.gov (United States)

    2011-02-24

    ... COMMISSION 18 CFR Part 420 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Final...--Water Supply Charges. Accordingly, the Commission's water charging rates for consumptive use and non.... FOR FURTHER INFORMATION CONTACT: For questions about the water charging program, please contact...

  19. Scheduling sport tournaments using constraint logic programming

    NARCIS (Netherlands)

    Schaerf, A.

    1997-01-01

    We tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally define the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The first step is the creation of a tournament pattern and is based on known

  20. 78 FR 37246 - January 2013 Pay Schedules

    Science.gov (United States)

    2013-06-20

    ...: Tameka Gillis, Pay and Leave, Employee Services, U.S. Office of Personnel Management; (202) 606-2858; FAX... or ST employees covered by a certified SL/ST performance appraisal system and $165,300 (level III of the Executive Schedule) for SL or ST employees covered by an SL/ST performance appraisal system...

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

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

  3. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

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

    2013-01-01

    Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro...

  4. From schedule push to reality pull

    NARCIS (Netherlands)

    Reep, Frans van der

    2009-01-01

    The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to s

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

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

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

  7. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

    OpenAIRE

    Gennady A. Berketov

    2015-01-01

    The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed ...

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

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

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

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

  12. 76 FR 46856 - Mail Classification Schedule Change

    Science.gov (United States)

    2011-08-03

    ... Mail Classification Schedule Change AGENCY: Postal Regulatory Commission. ACTION: Notice. SUMMARY: The Commission is noticing a recently-filed Postal Service request regarding classification changes to Priority... classification changes pursuant to 39 CFR 3020.90 and 3020.91 concerning Priority Mail packaging.\\1\\ \\1\\...

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

  14. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1997-04-01

    To provide an updated summary of the status of irradiation experiments for the neutron-interactive materials program. The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has two irradiation experiments in reactor; and 8 experiments in the planning or design stages. Postirradiation examination and testing is in progress on 18 experiments.

  15. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

  17. 42 CFR 447.76 - Public schedule.

    Science.gov (United States)

    2010-10-01

    ...) Current premiums, enrollment fees, or similar fees. (2) Current cost sharing charges. (3) The aggregate limit on premiums and cost sharing or just cost sharing. (4) Mechanisms for making payments for required... Cost Sharing Under Section 1916a § 447.76 Public schedule. (a) The State must make available to...

  18. Parental Work Schedules and Adolescent Risky Behaviors

    Science.gov (United States)

    Han, Wen-Jui; Miller, Daniel P.; Waldfogel, Jane

    2010-01-01

    Using a large contemporary data set (the National Longitudinal Survey of Youth-Child Supplement), the authors examined the effects of parental work schedules on adolescent risky behaviors at age 13 or 14 and the mechanisms that might explain them. Structural equation modeling suggests mothers who worked more often at night spent significantly less…

  19. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

    The Large Synoptic Survey Telescope (LSST) will be a highly robotic facility, demanding a very high efficiency during its operation. To achieve this, the LSST Scheduler has been envisioned as an autonomous software component of the Observatory Control System (OCS), that selects the sequence of targets in real time. The Scheduler will drive the survey using optimization of a dynamic cost function of more than 200 parameters. Multiple science programs produce thousands of candidate targets for each observation, and multiple telemetry measurements are received to evaluate the external and the internal conditions of the observatory. The design of the LSST Scheduler started early in the project supported by Model Based Systems Engineering, detailed prototyping and scientific validation of the survey capabilities required. In order to build such a critical component, an agile development path in incremental releases is presented, integrated to the development plan of the Operations Simulator (OpSim) to allow constant testing, integration and validation in a simulated OCS environment. The final product is a Scheduler that is also capable of running 2000 times faster than real time in simulation mode for survey studies and scientific validation during commissioning and operations.

  20. Artificial intelligence for the CTA Observatory scheduler

    Science.gov (United States)

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

    2014-08-01

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

  1. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    Directory of Open Access Journals (Sweden)

    Aftab Hameed Memon

    2011-07-01

    Full Text Available Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class, G6 (B class and G5 (C class were used in investigation. Data was analyzed by Statistical package SPSS to find the means and rank. Average index method was adapted to for the level of features of resource scheduling implementation and barrier to resource-driven scheduling. It is significant 59.65% firms are implementing resource-driven scheduling as partial. Also methods of project scheduling and resource options adopted were investigated. A Significant majority of construction firms (approximately 65% adopt Microsoft project for scheduling. Study showed that the features of resource scheduling are being implemented at Medium Level. Lack of understanding / awareness of concepts, lack of genuine commitment, lack of coordination of key personnel and Lack of coordination of constructors consultants were found major factors that affect resource-driven scheduling. While, expensive to prepare is most contributing factor, no enforcement on schedules from authority, difficult to prepare and hurdles by personnel/authorities were found as major constraints in implementing resource driven scheduling.

  2. Scheduling lessons learned from the Autonomous Power System

    Science.gov (United States)

    Ringer, Mark J.

    1992-01-01

    The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.

  3. An Analysis of Shuttle Crew Scheduling Violations

    Science.gov (United States)

    Bristol, Douglas

    2012-01-01

    From the early years of the Space Shuttle program, National Aeronautics and Space Administration (NASA) Shuttle crews have had a timeline of activities to guide them through their time on-orbit. Planners used scheduling constraints to build timelines that ensured the health and safety of the crews. If a constraint could not be met it resulted in a violation. Other agencies of the federal government also have scheduling constraints to ensure the safety of personnel and the public. This project examined the history of Space Shuttle scheduling constraints, constraints from Federal agencies and branches of the military and how these constraints may be used as a guide for future NASA and private spacecraft. This was conducted by reviewing rules and violations with regard to human aerospace scheduling constraints, environmental, political, social and technological factors, operating environment and relevant human factors. This study includes a statistical analysis of Shuttle Extra Vehicular Activity (EVA) related violations to determine if these were a significant producer of constraint violations. It was hypothesized that the number of SCSC violations caused by EVA activities were a significant contributor to the total number of violations for Shuttle/ISS missions. Data was taken from NASA data archives at the Johnson Space Center from Space Shuttle/ISS missions prior to the STS-107 accident. The results of the analysis rejected the null hypothesis and found that EVA violations were a significant contributor to the total number of violations. This analysis could help NASA and commercial space companies understand the main source of constraint violations and allow them to create constraint rules that ensure the safe operation of future human private and exploration missions. Additional studies could be performed to evaluate other variables that could have influenced the scheduling violations that were analyzed.

  4. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

    Broadcasts and timelines are the primary mechanism of information exchange in online social platforms today. Services like Facebook, Twitter and Instagram have enabled ordinary people to reach large audiences spanning cultures and countries, while their massive popularity has created increasingly competitive marketplaces of attention. Timing broadcasts to capture the attention of such geographically diverse audiences has sparked interest from many startups and social marketing gurus. However, formal study is lacking on both the timing and frequency problems. In this thesis, we introduce, motivate and solve the broadcast scheduling problem of specifying the timing and frequency of publishing content to maximise the attention received. We validate and quantify three interacting behavioural phenomena to parametrise social platform users: information overload, bursty circadian rhythms and monotony aversion, which is defined here for the first time. Our analysis of the influence of monotony refutes the common assumption that posts on social network timelines are consumed piecemeal independently. Instead, we reveal that posts are consumed in chunks, which has important consequences for any future work considering human behaviour over social network timelines. Our quantification of monotony aversion is also novel, and has applications to problems in various domains such as recommender list diversification, user satiation and variety-seeking consumer behaviour. Having studied the underlying behavioural phenomena, we link schedules, timelines, attention and behaviour by formalising a timeline information exchange process. Our formulation gives rise to a natural objective function that quantifies the expected collective attention an arrangement of posts on a timeline will receive. We apply this formulation as a case-study on real-data from Twitter, where we estimate behavioural parameters, calculate the attention potential for different scheduling strategies and, using the

  5. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-07-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis.

  6. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-06-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis

  7. Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The optimality of a fuzzy logic alternative to the usual treatment of uncertainties in a scheduling system using fuzzy numbers is examined formally. Processing times and due dates are fuzzified and presented by fuzzy numbers. With introducing the necessity measure, we compare fuzzy completion times of jobs with fuzzy due dates to decide whether jobs are tardy. The object is to minimize the numbers of tardy jobs.The efficient solution method for this problem is proposed. And deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.

  8. Optimal investment and scheduling of distributed energy resources with uncertainty in electric vehicles driving schedules

    Energy Technology Data Exchange (ETDEWEB)

    Cardoso, Goncalo [Technical Univ. of Lisbon (Portugal); Stadler, Michael [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Center for Energy and Innovation Technologies (Austria); Bozchalui, Mohammed C. [NEC Laboratories American Inc., Irving, TX (United States); Sharma, Ratnesh [NEC Laboratories American Inc., Irving, TX (United States); Marnay, Chris [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Barbosa-Povoa, Ana [Technical Univ. of Lisbon (Portugal); Ferrao, Paulo [Technical Univ. of Lisbon (Portugal)

    2013-12-06

    The large scale penetration of electric vehicles (EVs) will introduce technical challenges to the distribution grid, but also carries the potential for vehicle-to-grid services. Namely, if available in large enough numbers, EVs can be used as a distributed energy resource (DER) and their presence can influence optimal DER investment and scheduling decisions in microgrids. In this work, a novel EV fleet aggregator model is introduced in a stochastic formulation of DER-CAM [1], an optimization tool used to address DER investment and scheduling problems. This is used to assess the impact of EV interconnections on optimal DER solutions considering uncertainty in EV driving schedules. Optimization results indicate that EVs can have a significant impact on DER investments, particularly if considering short payback periods. Furthermore, results suggest that uncertainty in driving schedules carries little significance to total energy costs, which is corroborated by results obtained using the stochastic formulation of the problem.

  9. Evaluation of sap flow and trunk diameter sensors for irrigation scheduling in early maturing peach trees.

    Science.gov (United States)

    Conejero, W; Alarcón, J J; García-Orellana, Y; Nicolás, E; Torrecillas, A

    2007-12-01

    Five-year-old early maturing peach trees (Prunus persica (L.) Batsch cv. Flordastar grafted on GF-677 peach rootstock) were subjected to three irrigation treatments from March 18 to November 10, 2006. Control plants (T0 treatment) which received irrigation in excess of their crop water requirements (1089.7 mm) were compared with plants watered according to sap flow (SF; T1 treatment) or maximum daily trunk shrinkage (MDS; T2 treatment) measurements, so as to maintain SF and MDS signal intensities (control SF/SF in T1 and MDS in T2/control MDS, respectively) close to unity. When SF or MDS signal intensity on at least two of three consecutive days was at or below unity, irrigation was reduced by 10%. When the MDS signal intensity on at least two of three consecutive days exceeded unity, irrigation was increased by 10%. During the experiment, estimated crop evapotranspiration was 704.9 mm, and the cumulative amounts of applied water in the T1 and T2 treatments were 463.2 and 654.5 mm, respectively. The MDS-signal-intensity-driven irrigation schedule was more suitable than the SF-signal-intensity-driven irrigation schedule because it was more sensitive and reliable in detecting changes in plant water status, preventing the development of detectable plant water stress. Moreover, it had no effect on fruit size. We conclude that peach tree irrigation scheduling can be based on MDS measurements alone. Changes in the irrigation protocol assayed were proposed to reduce MDS signal intensity deviations above unity, for example, by increasing the irrigation scheduling frequency or the amount of water applied, or both. Irrigation schedules based on maintaining MDS signal intensities close to unity could be applied when local crop factor values are unavailable.

  10. Computerized Staffing and Scheduling of PRN Nursing Personnel

    OpenAIRE

    Veranth, Martha M; Cheson, Christine

    1984-01-01

    A computerized system developed at LDS Hospital in Salt Lake City, Utah for staffing and scheduling PRN nursing personnel is described. Pre- and post-implementation staffing and scheduling activities are compared.

  11. 41 CFR 51-8.12 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... rate includes the cost of operating the central processing unit (CPU), and the computer operator's... MATERIALS § 51-8.12 Fee schedule. (a) This schedule sets forth fees to be charged for processing...

  12. Algorithms for Assembly-Type Flowshop Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    An assembly-type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.

  13. A PSL Ontology-based Shop Floor Dynamical Scheduler Design

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-da; XU He; PENG Gao-liang; LIU Wen-jian; Khalil Alipour

    2008-01-01

    Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical scheduler is presented in this paper.The workflow and function modules of the scheduler are discussed in detail.A multi-step adaptive scheduling strategy and a process specification language,which is an ontology-based representation of process plan,are utilized in the proposed scheduler.The scheduler acquires the dispatching rule from the knowledge base and uses the build in on-line simulator to evaluate the obtained rule.These technologies enable the scheduler to improve its fine-tune ability and effectively transfer process information into other heterogeneous information systems in a shop floor.The effectiveness of the suggested structure will be demonstrated via its application in the scheduling system of a manufacturing enterprise.

  14. Self-controlled KR schedules: does repetition order matter?

    Science.gov (United States)

    Patterson, Jae T; Carter, Michael J; Hansen, Steve

    2013-08-01

    The impact of an experimenter-defined repetition schedule on the utility of a self-controlled KR context during motor skill acquisition was examined. Participants were required to learn three novel spatial-temporal tasks in either a random or blocked repetition schedule with or without the opportunity to control their KR. Results from the retention period showed that participants provided control over their KR schedule in a random repetition schedule demonstrated superior learning. However, performance measures from the transfer test showed that, independent of repetition schedule, learners provided the opportunity to control their KR schedule demonstrated superior transfer performance compared to their yoked counterparts. The dissociated impact of repetition schedule and self-controlled KR schedules on retention and transfer is discussed.

  15. 75 FR 72838 - Notice of Tribal Consultations; Schedule Update

    Science.gov (United States)

    2010-11-26

    ... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF THE INTERIOR National Indian Gaming Commission Notice of Tribal Consultations; Schedule Update AGENCY: National Indian Gaming Commission, Department of Interior. ACTION: Notice of tribal consultations; schedule...

  16. Mathematical programming and financial objectives for scheduling projects

    CERN Document Server

    Kimms, Alf

    2001-01-01

    Mathematical Programming and Financial Objectives for Scheduling Projects focuses on decision problems where the performance is measured in terms of money. As the title suggests, special attention is paid to financial objectives and the relationship of financial objectives to project schedules and scheduling. In addition, how schedules relate to other decisions is treated in detail. The book demonstrates that scheduling must be combined with project selection and financing, and that scheduling helps to give an answer to the planning issue of the amount of resources required for a project. The author makes clear the relevance of scheduling to cutting budget costs. The book is divided into six parts. The first part gives a brief introduction to project management. Part two examines scheduling projects in order to maximize their net present value. Part three considers capital rationing. Many decisions on selecting or rejecting a project cannot be made in isolation and multiple projects must be taken fully into a...

  17. Dynamic scheduling with due dates and time windows: an application to chemotherapy patient appointment booking.

    Science.gov (United States)

    Gocgun, Yasin; Puterman, Martin L

    2014-03-01

    We study a scheduling problem in which arriving patients require appointments at specific future days within a treatment specific time window. This research is motivated by a study of chemotherapy scheduling practices at the British Columbia Cancer Agency (Canada). We formulate this problem as a Markov Decision Process (MDP). Since the resulting MDPs are intractable to exact methods, we employ linear-programming-based Approximate Dynamic Programming (ADP) to obtain approximate solutions. Using simulation, we compare the performance of the resulting ADP policies to practical and easy-to-use heuristic decision rules under diverse scenarios. The results indicate that ADP is promising in several scenarios, and that a specific easy-to-use heuristic performs well in the idealized chemotherapy scheduling setting we study.

  18. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    OpenAIRE

    Aftab Hameed Memon; Rosli Mohammad Zin

    2011-01-01

    Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class), G6 (B c...

  19. Quality-aware scheduling for key-value data stores

    CERN Document Server

    Xu, Chen

    2015-01-01

    This book comprehensively illustrates quality-ware scheduling in key-value stores. In addition, it provides scheduling strategies and a prototype framework of quality-aware scheduler as well as a demonstration of online applications. The book offers a rich blend of theory and practice which is suitable for students, researchers and practitioners interested in distributed systems, NoSQL key-value stores and scheduling.

  20. Probability distribution fitting of schedule overruns in construction projects

    OpenAIRE

    P E D Love; C-P Sing; WANG, X; Edwards, D.J.; H Odeyinka

    2013-01-01

    The probability of schedule overruns for construction and engineering projects can be ascertained using a ‘best fit’ probability distribution from an empirical distribution. The statistical characteristics of schedule overruns occurring in 276 Australian construction and engineering projects were analysed. Skewness and kurtosis values revealed that schedule overruns are non-Gaussian. Theoretical probability distributions were then fitted to the schedule overrun data; including the Kolmogorov–...

  1. Contingency and stimulus change in chained schedules of reinforcement

    OpenAIRE

    Catania, A. Charles; Yohalem, Rona; Silverman, Philip J.

    1980-01-01

    Higher rates of pecking were maintained by pigeons in the middle component of three-component chained fixed-interval schedules than in that component of corresponding multiple schedules (two extinction components followed by a fixed-interval component). This rate difference did not occur in equivalent tandem and mixed schedules, in which a single stimulus was correlated with the three components. The higher rates in components of chained schedules demonstrate a reinforcing effect of the stimu...

  2. STUDY ON SHIFT SCHEDULE AND SIMULATION OF AUTOMATIC TRANSMISSION

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    From the point of view of saving energy, a new shift schedule and auto-controlling strategy for automatic transmission are proposed. In order to verify this shift schedule,a simulation program using a software package of Matlab/Simulink is developed. The simulation results show the shift schedule is correct. This shift schedule has enriched the theory of vehicle automatic maneuvering and will improve the efficiency of hydrodynanic drive system of the vehicle.

  3. Water requirement and irrigation schedule for tomato in northern guinea savanna zone, Nigeria

    Directory of Open Access Journals (Sweden)

    Ibraheem Alhassan

    2015-06-01

    Full Text Available Assessment of water requirement and irrigation schedule for tomato with the support of FAO-CROPWAT simulation model was carried out for Yola, Nigeria with the aim of planning irrigation schedules for tomato and develop recommendations for improve irrigation practices. The climatic data for 2012/2013 and soil properties of the study area were input into the program. Tomato crop properties were updated by the FAO data and three irrigation intervals were tested (7 and 10 days irrigation intervals and irrigation schedule of 10 days interval during initial and development stage and 6 days interval at mid and late season stages of tomato crop. The simulated results analysis for tomato according to the irrigation schedule showed that highest yield reduction of 16.2% was recorded with 10 days irrigation interval treatment and the least of 0.4% with irrigation interval of 10 days at first two growth stages and 6 days at last two stages. FAO-CROPWAT 8.0 can be used in planning proper irrigation schedule for tomato in Yola, Nigeria.

  4. Research on Energy-Saving Production Scheduling Based on a Clustering Algorithm for a Forging Enterprise

    Directory of Open Access Journals (Sweden)

    Yifei Tong

    2016-02-01

    Full Text Available Energy efficiency is a buzzword of the 21st century. With the ever growing need for energy efficient and low-carbon production, it is a big challenge for high energy-consumption enterprises to reduce their energy consumption. To this aim, a forging enterprise, DVR (the abbreviation of a forging enterprise, is researched. Firstly, an investigation into the production processes of DVR is given as well as an analysis of forging production. Then, the energy-saving forging scheduling is decomposed into two sub-problems. One is for cutting and machining scheduling, which is similar to traditional machining scheduling. The other one is for forging and heat treatment scheduling. Thirdly, former forging production scheduling is presented and solved based on an improved genetic algorithm. Fourthly, the latter is discussed in detail, followed by proposed dynamic clustering and stacking combination optimization. The proposed stacking optimization requires making the gross weight of forgings as close to the maximum batch capacity as possible. The above research can help reduce the heating times, and increase furnace utilization with high energy efficiency and low carbon emissions.

  5. Project scheduling and staffing with a multi-skilled workforce

    OpenAIRE

    Maenhout, Broos; Vanhoucke, Mario

    2011-01-01

    When scheduling projects assumptions are made with respect to the personnel resource availability. In personnel scheduling problems assumptions are made with respect to the staffing requirements. We explore how to integrate these two scheduling problems for making strategic project staffing decisions. More precisely, we determine the number of personnel and required skill mix to complete a project.

  6. 33 CFR 401.58 - Pleasure craft scheduling.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Pleasure craft scheduling. 401.58... scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in... transit by contacting the lock personnel using the direct-line phone and make the lockage fee payment...

  7. Effects of modeling versus instructions on sensitivity to reinforcement schedules.

    OpenAIRE

    Neef, Nancy A.; Marckel, Julie; Ferreri, Summer; Jung, Sunhwa; Nist, Lindsay; Armstrong, Nancy

    2004-01-01

    This study examined the effects of modeling versus instructions on the choices of 3 typically developing children and 3 children with attention deficit hyperactivity disorder (ADHD) whose academic responding showed insensitivity to reinforcement schedules. During baseline, students chose between successively presented pairs of mathematics problems associated with different variable-interval schedules of reinforcement. After responding proved insensitive to the schedules, sessions were precede...

  8. 48 CFR 52.236-15 - Schedules for Construction Contracts.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Schedules for Construction....236-15 Schedules for Construction Contracts. As prescribed in 36.515, insert the following clause: Schedules for Construction Contracts (APR 1984) (a) The Contractor shall, within five days after the...

  9. 48 CFR 436.575 - Maximum workweek-construction schedule.

    Science.gov (United States)

    2010-10-01

    ...-construction schedule. 436.575 Section 436.575 Federal Acquisition Regulations System DEPARTMENT OF AGRICULTURE... Maximum workweek-construction schedule. The contracting officer shall insert the clause at 452.236-75, Maximum Workweek-Construction Schedule, if the clause at FAR 52.236-15 is used and the contractor's...

  10. Play Ball!--The Scheduling of Sports Officials.

    Science.gov (United States)

    Evans, James R.; And Others

    1984-01-01

    Discusses use of the computer to solve the specific scheduling problems in assigning umpires to American League baseball games and assigning crews of officials to Atlantic Coast Conference football and basketball games. Scheduling variables that complicate the process and make manual scheduling almost impossible are described. (MBR)

  11. Distributing Flexibility to Enhance Robustness in Task Scheduling Problems

    NARCIS (Netherlands)

    Wilmer, D.; Klos, T.B.; Wilson, M.

    2013-01-01

    Temporal scheduling problems occur naturally in many diverse application domains such as manufacturing, transportation, health and education. A scheduling problem arises if we have a set of temporal events (or variables) and some constraints on those events, and we have to find a schedule, which is

  12. 20 CFR 614.12 - Schedules of remuneration.

    Science.gov (United States)

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Schedules of remuneration. 614.12 Section 614... COMPENSATION FOR EX-SERVICEMEMBERS Administration of UCX Program § 614.12 Schedules of remuneration. (a... Defense, a Schedule of Remuneration specifying the pay and allowances for each pay grade of members of...

  13. 40 CFR 300.905 - NCP Product Schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 27 2010-07-01 2010-07-01 false NCP Product Schedule. 300.905 Section... PLAN Use of Dispersants and Other Chemicals § 300.905 NCP Product Schedule. (a) Oil Discharges. (1) EPA..., called the NCP Product Schedule, may be obtained from the Emergency Response Division (5202-G),...

  14. 24 CFR 982.517 - Utility allowance schedule.

    Science.gov (United States)

    2010-04-01

    ... reasonable accommodation in accordance with 24 CFR part 8 to make the program accessible to and usable by the... 24 Housing and Urban Development 4 2010-04-01 2010-04-01 false Utility allowance schedule. 982.517... Payment § 982.517 Utility allowance schedule. (a) Maintaining schedule. (1) The PHA must maintain...

  15. Solving project scheduling problems by minimum cut computations

    NARCIS (Netherlands)

    Möhring, R.H.; Schulz, A.S.; Stork, F.; Uetz, M.J.

    2003-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 manufactur

  16. 41 CFR 101-5.104-4 - Scheduling feasibility studies.

    Science.gov (United States)

    2010-07-01

    ... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and buildings... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Scheduling...

  17. 76 FR 28194 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2011-05-16

    ... SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety... (FOIA) Fee Schedule Update and solicits comments from interested organizations and individual members of... regulations, the Board's General Manager will update the FOIA Fee Schedule once every 12 months. Previous...

  18. 77 FR 32433 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2012-06-01

    ... NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear... Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from interested organizations...) of the Board's regulations, the Board's General Manager will update the FOIA Fee Schedule once...

  19. 75 FR 27228 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2010-05-14

    ... SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety... (FOIA) Fee Schedule Update and solicits comments from interested organizations and individual members of... regulations, the Board's General Manager will update the FOIA Fee Schedule once every 12 months. Previous...

  20. Optimizing Flight Schedules by an Automated Decision Support System

    Science.gov (United States)

    2014-03-01

    As a result of this, constructing the solution model in a language which is easy to enhance is critical. VBA is a powerful language for easy and quick...Flight Schedule Model ...............................................................................................45 Manual Assignments by...Scheduling Model .............................................................................62 Contribution of scheduling model to air force(s

  1. Managerial implications and suitability of a master surgical scheduling approach

    NARCIS (Netherlands)

    J.M. van Oostrum (Jeroen); E. Bredenhoff (Eelco); E.W. Hans (Erwin)

    2008-01-01

    textabstractMaster surgical scheduling can improve manageability and efficiency of operating room departments. This approach cyclically executes a master surgical schedule of surgery types. These surgery types need to be constructed with low variability to be efficient. Each surgery type is schedule

  2. Helping Children Understand Routines and Classroom Schedules. What Works Briefs.

    Science.gov (United States)

    Ostrosky, M. M.; Jung, E. Y.; Hemmeter, M. L.; Thomas, D.

    Studies have documented that schedules and routines influence children's emotional, cognitive, and social development. Predictable and consistent schedules in preschool classrooms help children feel secure and comfortable. Also, schedules and routines help children understand the expectations of the environment and reduce the frequency of behavior…

  3. User interface issues in supporting human-computer integrated scheduling

    Science.gov (United States)

    Cooper, Lynne P.; Biefeld, Eric W.

    1991-09-01

    The topics are presented in view graph form and include the following: characteristics of Operations Mission Planner (OMP) schedule domain; OMP architecture; definition of a schedule; user interface dimensions; functional distribution; types of users; interpreting user interaction; dynamic overlays; reactive scheduling; and transitioning the interface.

  4. 40 CFR 798.6500 - Schedule-controlled operant behavior.

    Science.gov (United States)

    2010-07-01

    ... modify some class of behavior by reinforcement or punishment. (3) Schedule of reinforcement. A schedule of reinforcement specifies the relation between behavioral responses and the delivery of reinforcers... under schedules of reinforcement. Operant behavior tests may be used to evaluate many other aspects...

  5. Acuity-based nurse assignment and patient scheduling in oncology clinics.

    Science.gov (United States)

    Liang, Bohui; Turkcan, Ayten

    2016-09-01

    The oncology clinics use different nursing care delivery models to provide chemotherapy treatment to cancer patients. Functional and primary care delivery models are the most commonly used methods in the clinics. In functional care delivery model, patients are scheduled for a chemotherapy appointment without considering availabilities of individual nurses, and nurses are assigned to patients according to patient acuities, nursing skill, and patient mix on a given day after the appointment schedule is determined. Patients might be treated by different nurses on different days of their treatment. In primary care delivery model, each patient is assigned to a primary nurse, and the patients are scheduled to be seen by the same nurse every time they come to the clinic for treatment. However, these clinics might experience high variability in daily nurse workload due to treatment protocols that should be followed strictly. In that case, part-time nurses can be utilized to share the excess workload of the primary nurses. The aim of this study is to develop optimization methods to reduce the time spent for nurse assignment and patient scheduling in oncology clinics that use different nursing care delivery models. For the functional delivery model, a multiobjective optimization model with the objectives of minimizing patient waiting times and nurse overtime is proposed to solve the nurse assignment problem. For the primary care delivery model, another multiobjective optimization model with the objectives of minimizing total overtime and total excess workload is proposed to solve the patient scheduling problem. Spreadsheet-based optimization tools are developed for easy implementation. Computational results show that the proposed models provide multiple nondominated solutions, which can be used to determine the optimal staffing levels.

  6. Improved Squeaky Wheel Optimisation for Driver Scheduling

    CERN Document Server

    Aickelin, Uwe; Li, Jingpeng

    2008-01-01

    This paper presents a technique called Improved Squeaky Wheel Optimisation for driver scheduling problems. It improves the original Squeaky Wheel Optimisations effectiveness and execution speed by incorporating two additional steps of Selection and Mutation which implement evolution within a single solution. In the ISWO, a cycle of Analysis-Selection-Mutation-Prioritization-Construction continues until stopping conditions are reached. The Analysis step first computes the fitness of a current solution to identify troublesome components. The Selection step then discards these troublesome components probabilistically by using the fitness measure, and the Mutation step follows to further discard a small number of components at random. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Prioritization step to first produce priorities that determine an order by which the following Construction step then schedul...

  7. The Dynamical Kernel Scheduler - Part 1

    CERN Document Server

    Adelmann, Andreas; Suter, Andreas

    2015-01-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software using these hardware accelerators introduces additional challenges for the developer such as exposing additional parallelism, dealing with different hardware designs and using multiple development frameworks in order to use devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between host application and different hardware accelerators. DKS handles the communication between the host and device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated in OPAL (Object-or...

  8. Real-Time Scheduling via Reinforcement Learning

    CERN Document Server

    Glaubius, Robert; Gill, Christopher; Smart, William D

    2012-01-01

    Cyber-physical systems, such as mobile robots, must respond adaptively to dynamic operating conditions. Effective operation of these systems requires that sensing and actu- ation tasks are performed in a timely manner. Additionally, execution of mission specific tasks such as imaging a room must be bal- anced against the need to perform more gen- eral tasks such as obstacle avoidance. This problem has been addressed by maintaining relative utilization of shared resources among tasks near a user-specified target level. Pro- ducing optimal scheduling strategies requires complete prior knowledge of task behavior, which is unlikely to be available in practice. Instead, suitable scheduling strategies must be learned online through interaction with the system. We consider the sample com- plexity of reinforcement learning in this do- main, and demonstrate that while the prob- lem state space is countably infinite, we may leverage the problem's structure to guarantee efficient learning.

  9. A Network Simulation Tool for Task Scheduling

    Directory of Open Access Journals (Sweden)

    Ondřej Votava

    2012-01-01

    Full Text Available Distributed computing may be looked at from many points of view. Task scheduling is the viewpoint, where a distributed application can be described as a Directed Acyclic Graph and every node of the graph is executed independently. There are, however, data dependencies and the nodes have to be executed in a specified order. Hence the parallelism of the execution is limited. The scheduling problem is difficult and therefore heuristics are used. However, many inaccuracies are caused by the model used for the system, in which the heuristics are being tested. In this paper we present a tool for simulating the execution of the distributed application on a “real” computer network, and try to tell how the executionis influenced compared to the model.

  10. Present and future hydropower scheduling in Statkraft

    Science.gov (United States)

    Bruland, O.

    2012-12-01

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

  11. Power Efficient Hierarchical Scheduling for DSP Transformations

    Directory of Open Access Journals (Sweden)

    P. K. Merakos

    2002-01-01

    Full Text Available In this paper, the problem of scheduling the computation of partial products in transformational Digital Signal Processing (DSP algorithms, aiming at the minimization of the switching activity in data and address buses, is addressed. The problem is stated as a hierarchical scheduling problem. Two different optimization algorithms, which are based on the Travelling Salesman Problem (TSP, are defined. The proposed optimization algorithms are independent on the target architecture and can be adapted to take into account it. Experimental results obtained from the application of the proposed algorithms in various widely used DSP transformations, like Discrete Cosine Transform (DCT and Discrete Fourier Transform (DFT, show that significant switching activity savings in data and address buses can be achieved, resulting in corresponding power savings. In addition, the differences between the two proposed methods are underlined, providing envisage for their suitable selection for implementation, in particular transformational algorithms and architectures.

  12. Trust level of Clouds by Scheduling

    Directory of Open Access Journals (Sweden)

    Deva Sinha K.

    2015-11-01

    Full Text Available Cloud computing is a virtual storage which is used to store the data and information in secure manner. This project which gives a trustworthy to the cloud user from Admin without knowing the infrastructure and its properties of cloud. Cloud scheduled safety-critical data processing needs are beginning to push back strongly against using cloud computing, users will find that cloud scheduling will be maintained by the user to store their data on the cloud to create trust them . We have overcome this problem; a trusted cloud computing platform (TCCP proposed design. TCCP guarantees the implementation of the guest virtual machines to provide a closed box execution environment as a Service (IaaS providers such as Amazon EC2 allowing infrastructure. To protect a data in a secured way, while cloud user uploading a data it will get encrypted which means non readable format and when cloud user downloading a data it will get decrypted.

  13. Trust level of Clouds by Scheduling

    Directory of Open Access Journals (Sweden)

    Deva Sinha K

    2014-03-01

    Full Text Available Cloud computing is a virtual storage which is used to store the data and information in secure manner. This project which gives a trustworthy to the cloud user from Admin without knowing the infrastructure and its properties of cloud. Cloud scheduled safety-critical data processing needs are beginning to push back strongly against using cloud computing, users will find that cloud scheduling will be maintained by the user to store their data on the cloud to create trust them . We have overcome this problem; a trusted cloud computing platform (TCCP proposed design. TCCP guarantees the implementation of the guest virtual machines to provide a closed box execution environment as a Service (IaaS providers such as Amazon EC2 allowing infrastructure. To protect a data in a secured way, while cloud user uploading a data it will get encrypted which means non readable format and when cloud user downloading a data it will get decrypted.

  14. Scheduling of resource-constrained projects

    CERN Document Server

    Klein, Robert

    2000-01-01

    Project management has become a widespread instrument enabling organizations to efficiently master the challenges of steadily shortening product life cycles, global markets and decreasing profit margins. With projects increasing in size and complexity, their planning and control represents one of the most crucial management tasks. This is especially true for scheduling, which is concerned with establishing execution dates for the sub-activities to be performed in order to complete the project. The ability to manage projects where resources must be allocated between concurrent projects or even sub-activities of a single project requires the use of commercial project management software packages. However, the results yielded by the solution procedures included are often rather unsatisfactory. Scheduling of Resource-Constrained Projects develops more efficient procedures, which can easily be integrated into software packages by incorporated programming languages, and thus should be of great interest for practiti...

  15. Optimal feedback scheduling of model predictive controllers

    Institute of Scientific and Technical Information of China (English)

    Pingfang ZHOU; Jianying XIE; Xiaolong DENG

    2006-01-01

    Model predictive control (MPC) could not be reliably applied to real-time control systems because its computation time is not well defined. Implemented as anytime algorithm, MPC task allows computation time to be traded for control performance, thus obtaining the predictability in time. Optimal feedback scheduling (FS-CBS) of a set of MPC tasks is presented to maximize the global control performance subject to limited processor time. Each MPC task is assigned with a constant bandwidth server (CBS), whose reserved processor time is adjusted dynamically. The constraints in the FSCBS guarantee scheduler of the total task set and stability of each component. The FS-CBS is shown robust against the variation of execution time of MPC tasks at runtime. Simulation results illustrate its effectiveness.

  16. Multiprocessor scheduling for real-time systems

    CERN Document Server

    Baruah, Sanjoy; Buttazzo, Giorgio

    2015-01-01

    This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems.  The authors derive new, abstract models of real-time tasks that capture accurately the salient features of real application systems that are to be implemented on multiprocessor platforms, and identify rules for mapping application systems onto the most appropriate models.  New run-time multiprocessor scheduling algorithms are presented, which are demonstrably better than those currently used, both in terms of run-time efficiency and tractability of off-line analysis.  Readers will benefit from a new design and analysis framework for multiprocessor real-time systems, which will translate into a significantly enhanced ability to provide formally verified, safety-critical real-time systems at a significantly lower cost.

  17. Software Schedules Missions, Aids Project Management

    Science.gov (United States)

    2008-01-01

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

  18. Message Scheduling and Forwarding in Congested DTNs

    KAUST Repository

    Elwhishi, Ahmed

    2012-08-19

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

  19. Bicriteria Scheduling on Single Machine with Outsourcing

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; QIN Li-zhen; TANG Guo-chun

    2015-01-01

    Scheduling with outsourcing is studied in this paper. It is assumed that both manufacturer and subcontractor have a single machine to process n jobs. The manufacturer needs to determine simultaneously a set of outsourced jobs and the schedule of the jobs in-house such that two criterias, i.e., outsourcing cost and production cost, are minimized. The production cost is measured by the number of tardy jobs or the total tardiness of jobs in-house, and the outsourcing cost is proportional to the total processing time of jobs outsourced. Two kinds of problems with different criterias are considered. We analyze the computational complexity and provide pseudo-polynomial time optimization algorithms for the NP-hard version of the problems.

  20. Mining truck scheduling with stochastic maintenance cost

    Institute of Scientific and Technical Information of China (English)

    Erkan TOPAL; Salih RAMAZAN

    2012-01-01

    Open pit mining operations utilize large scale and expensive equipment.For the mines implementing shovel and truck operation system,trucks constitute a large portion of these equipment and are used for hauling the mined materials.In order to have sustainable and viable operation,these equipment need to be utilized efficiently with minimum operating cost.Maintenance cost is a significant proportion of the overall operating costs.The maintenance cost of a truck changes non-linearly depending on the type,age and truck types.A new approach based on stochastic integer programming (SIP) techniques is used for annually scheduling a fixed fleet of mining trucks in a given operation,over the life of mine (multi-year time horizon) to minimize maintenance cost.The maintenance cost data in mining usually has uncertainty caused from the variability of the operational conditions at mines.To estimate the cost,usually historic data from different operations for new mines,and/or the historic data at the operating mines are used.However,maintenance cost varies depending on road conditions,age of equipment and many other local conditions at an operation.Traditional models aim to estimate the maintenance cost as a deterministic single value and financial evaluations are based on the estimated value.However,it does not provide a confidence on the estimate.The proposed model in this study assumes the truck maintenance cost is a stochastic parameter due to the significant level of uncertainty in the data and schedules the available fleet to meet the annual production targets.The scheduling has been performed by applying both the proposed stochastic and deterministic approaches.The approach provides a distribution for the maintenance cost of the optimized equipment schedule minimizing the cost.

  1. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2002-01-16

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs. The document contains the CY 2002 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project.

  2. Altering Flight Schedules for Increased Fuel Efficiency

    Science.gov (United States)

    2015-06-19

    schedules to reduce flying during the hottest times of the day and/or the hottest months of the year. The analysis used Microsoft Excel 2010...flap index used for final approach and landing. As stated earlier, the ability to answer important fuel questions (i.e. whether to fly during a...atmospheric pressure, wind direction and speed, precipitation , and sky condition for the time in question. From the Weather Underground homepage, enter

  3. Scheduling Activity in an Agent Architecture

    OpenAIRE

    Soto, Ignacio

    2000-01-01

    Agents for applications in dynamic environments require artificial intelligence techniques to solve problems to achieve their objectives. For example, they must develop plans of actions to carry out missions in their environment, in other words, to achieve some state in the world. But also, the agents must fulfill real-time requirements that arise because the characteristics of the applications and the dynamism of the environment. In this paper we analyze the use of a schedule of activity in ...

  4. CHILDHOOD PSYCHOPATHOLOGY MEAUSREMENT SCHEDULE: DEVELOPMENT AND STANDARDIZATION*

    OpenAIRE

    Malhotra, Savita; Varma, V.K.; Verma, S.K.; Malhotra, Anil

    1988-01-01

    SUMMARY Development and standardization of an instrument Childhood Psychopathology Measurement Schedule (CPMS) to assess psychopathology in children is reported. CPMS is standardized on Indian population and is applicable to children of both sexes in the age range of 4-14 years. It measures overall psychopathology in the form of a total scores and also the type of psychopathology in the form of eight factorially derived syndromes which have satisfactory reliability and validity. CPMS is propo...

  5. Schedulers with load-store queue awareness

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-01-24

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  6. Schedulers with load-store queue awareness

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-02-07

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  7. Monterey Bay Aquarium Volunteer Guide Scheduling Analysis

    Science.gov (United States)

    2014-12-01

    you for inspiring me to do my best in school and to pursue projects that improve my community. Bard Mansager, thank you for letting me pursue a...to be relieved on time and improves the guest experience. This thesis will seek to develop guide schedules that minimize the time spent transiting...sea otter exhibit 13 kelp touch pool 4 30 boiler / cannery row exhibit 14 touch pool 3 31 shale reef/wharf 15 tentacles 32 jellies experience 16

  8. The Home Care Crew Scheduling Problem

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Justesen, Tor

    In the Home Care Crew Scheduling Problem (HCCSP) a staff of caretakers has to be assigned a number of visits, such that the total number of assigned visits is maximised. The visits have different locations and positions in time, and travelling time and time windows must be respected. The challenge...... clustering of the visits based on the problem structure. The algorithm is tested on real-life problem instances and we obtain solutions that are better than current practice in all cases....

  9. Estimating demand schedules in hedonic analysis

    DEFF Research Database (Denmark)

    Panduro, Toke Emil; Jensen, Cathrine Ulla; Lundhede, Thomas;

    The hedonic pricing method has been used extensively to obtain implicit prices for availability of urban green space, but few hedonic studies have obtained households’ preference parameters. We estimate willingness to pay functions for park availability in Copenhagen using an approach that places...... an alternative path for estimation of demand schedules for public goods using hedonic data. The findings also stress the importance of paying attention to how public goods are defined when undertaking welfare economic policy analyses....

  10. Scheduling and Outsourcing with Multiple Customers

    Institute of Scientific and Technical Information of China (English)

    FENG Yan-ling; ZHANG Yu-zhong; JIA Guo-zhu

    2015-01-01

    In this paper, we study a new scheduling and outsourcing model with multiple customers in which jobs can be processed by either in-house machine or outsourcing machine. All processed jobs have to be delivered in batches to their respective customers and each shipment incurs a delivery cost as well as a fixed amount of time. We discuss three commonly used ob jective functions, analyze their complexity and solve them by dynamic programming algorithms.

  11. 5 CFR 532.261 - Special wage schedules for leader and supervisory schedules for leader and supervisory wage...

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Special wage schedules for leader and supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... RATE SYSTEMS Prevailing Rate Determinations § 532.261 Special wage schedules for leader and...

  12. Optimizing the Steel Plate Storage Yard Crane Scheduling Problem Using a Two Stage Planning/Scheduling Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    This paper presents the Steel Plate Storage Yard Crane Scheduling Problem. The task is to generate a schedule for two gantry cranes sharing tracks. The schedule must comply with a number of constraints and at the same time be cost efficient. We propose some ideas for a two stage planning...

  13. Prioritizing sleep for healthy work schedules

    Directory of Open Access Journals (Sweden)

    Takahashi Masaya

    2012-03-01

    Full Text Available Abstract Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work. Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules.

  14. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    LE Bisping

    2000-01-27

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted 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 design is described in the Operations Office, Environmental Monitoring Plan, United States Department of Energy, Richland DOE/RL-91-50, Rev.2, U.S. Department of Energy, Richland, Washington. This document contains the CY 2000 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. In some cases, samples are scheduled on a rotating basis and may not be collected in 2000 in which case the anticipated year for collection is provided. In addition, a map showing approximate sampling locations is included for each media scheduled for collection.

  15. Hanford site environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1998-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1 {open_quotes}General Environmental Protection Program,{close_quotes} and DOE Order 5400.5, {open_quotes}Radiation Protection of the Public and the Environment.{close_quotes} The sampling methods are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 2, U.S. Department of Energy, Richland, Washington. This document contains the 1998 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section of this document describes the planned sampling schedule for a specific media (air, surface water, biota, soil and vegetation, sediment, and external radiation). Each section includes the sample location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be planned for 1998 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing sample locations.

  16. Dynamic Task Scheduling on Multicore Automotive ECUs

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringen t govt. regulations for safety and fuel emissions a nd motivated towards adding more advanced features and sophisticated applications to the existing electro nic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even m ore sophistication in vehicle electronics system. All t hese, directly make the vehicle software system mor e complex and computationally more intensive. In turn , this demands very high computational capability o f the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigoro us ECUs like, power train, image processing and infotainment. To achieve greater performance from t hese multicore processors, parallelized ECU softwar e needs to be efficiently scheduled by the underlayin g operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, w e propose a dynamic task scheduler for multicore engi ne control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static pr iority scheduling suggested by Automotive Open Syst ems Architecture (AUTOSAR.

  17. Semi-Online Scheduling with Machine Cost

    Institute of Scientific and Technical Information of China (English)

    何勇; 蔡圣义

    2002-01-01

    For most scheduling problems the set of machines is fixed initially and remainsunchanged for the duration of the problem. Recently Imreh and Nogaproposed to add theconcept of machine cost to scheduling problems and considered the so-called List Model problem.An online algorithm with a competitive ratio 1.618 was given while the lower bound is 4/3. Inthis paper, two different semi-online versions of this problem are studied. In the first case, it isassumed that the processing time of the largest job is known a priori. A semi-online algorithmis presented with the competitive ratio at most 1.5309 while the lower bound is 4/3. In thesecond case, it is assumed that the total processing time of all jobs is known in advance. Asemi-online algorithm is presented with the competitive ratio at most 1.414 while the lowerbound is 1.161. It is shown that the additional partial available information about the jobsleads to the possibility of constructing a schedule with a smaller competitive ratio than that ofonline algorithms.

  18. MESA: Mercator scheduler and archive system

    Science.gov (United States)

    Merges, Florian; Prins, Saskia; Pessemier, Wim; Raskin, Gert; Perez Padilla, Jesus; Van Winckel, Hans; Aerts, Conny

    2012-09-01

    We have developed an observing scheduling and archive system for the 1.2 meter Mercator Telescope. The goal was to optimize the specific niche of this modern small telescope in observational astrophysics: the building-up of long-term time series of photometric or high-resolution spectroscopic data with appropriate sampling for any given scientific program. This system allows PIs to easily submit their technical requirements and keep track of the progress of the observing programmes. The scheduling system provides the observer with an optimal schedule for the night which takes into account the current observing conditions as well as the priorities and requirements of the programmes in the queue. The observer can conveniently plan an observing night but also quickly adapt it to changing conditions. The archiving system automatically processes new files as they are created, including reduced data. It extracts the metadata and performs the normalization. A user can query, inspect and retrieve observing data. The progress of individual programmes, including timeline and reduced data plots can be seen at any time. Our MESA project is based on free and open source software (FOSS) using the Python programming language. The system is fully integrated with the Mercator Observing Control System1 (MOCS).

  19. Batch Delivery Scheduling with Multiple Decentralized Manufacturers

    Directory of Open Access Journals (Sweden)

    Shi Li

    2014-01-01

    Full Text Available This paper addresses an integrated decision on production scheduling and delivery operations, which is one of the most important issues in supply chain scheduling. We study a model in which a set of jobs ordered by only one customer and a set of decentralized manufacturers located at different locations are considered. Specifically, each job must be assigned to one of the decentralized manufacturers to process on its single machine facility. Then, the job is delivered to the customer directly in batch without intermediate inventory. The objective is to find a joint schedule of production and distribution to optimize the customer service level and delivery cost. In our work, we discuss this problem considering two different situations in terms of the customer service level. In the first one, the customer service is measured by the maximum arrival time, while the customer service is measured by the total arrival time in the second one. For each situation, we develop a dynamic programming algorithm to solve, respectively. Moreover, we identify a special case for the latter situation by introducing its corresponding solutions.

  20. Genetic Algorithms for Satellite Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Fatos Xhafa

    2012-01-01

    Full Text Available Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.

  1. A microeconomic scheduler for parallel computers

    Science.gov (United States)

    Stoica, Ion; Abdel-Wahab, Hussein; Pothen, Alex

    1995-01-01

    We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

  2. OUTLOOK ON VARIOUS SCHEDULING APPROACHES IN HADOOP

    Directory of Open Access Journals (Sweden)

    P. Amuthabala

    2016-02-01

    Full Text Available MapReduce is used for processing and generating sets large data .A open source framework of MapReduce is Hadoop [1]. MapReduce and Hadoop represent a good alternative for efficient large scale data processing and advanced analytics in an enterprise. In Heterogeneous computing, map or schedule a processor to a single core or different type of processors to a single core or a processor to many cores or many processors to many cores. So the usage of heterogeneous multi-core processors for the efficient performance in map reduce environments is increasing. Therefore the single heterogeneous multi-core processors consists of small and big cores where small cores provide power efficient and big-cores provide high-performance , which includes Inductive Logic Programming and Multilayer Perception to be extracted dynamically. This paper addresses various scheduling approaches that helps in improving the performance in heterogeneous environment. The outcome of this paper shows that traditional approaches used in Hadoop suffers from various issues. This paper will encourage in addressing those issues and discusses various scheduling approaches which helps in big data analysis.

  3. DYNAMIC TASK SCHEDULING ON MULTICORE AUTOMOTIVE ECUS

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringent govt. regulations for safety and fuel emissions and motivated towards adding more advanced features and sophisticated applications to the existing electronic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even more sophistication in vehicle electronics system. All these, directly make the vehicle software system more complex and computationally more intensive. In turn, this demands very high computational capability of the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigorous ECUs like, power train, image processing and infotainment. To achieve greater performance from these multicore processors, parallelized ECU software needs to be efficiently scheduled by the underlaying operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, we propose a dynamic task scheduler for multicore engine control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static priority scheduling suggested by Automotive Open Systems Architecture (AUTOSAR

  4. Ant Colony Optimisation for Backward Production Scheduling

    Directory of Open Access Journals (Sweden)

    Leandro Pereira dos Santos

    2012-01-01

    Full Text Available The main objective of a production scheduling system is to assign tasks (orders or jobs to resources and sequence them as efficiently and economically (optimised as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.

  5. Effect of pulse irrigation scheduling with hybrid station controller on fruit yield and quality of Nagpur mandarin (citrus reticulate blanco

    Directory of Open Access Journals (Sweden)

    Parameshwar Sidramappa Shirgure

    2013-01-01

    Full Text Available The hybrid station controller based automatic pulse irrigation scheduling field experiment was conducted on 10-12 years old bearing Nagpur mandarin (Citrus reticulata Blanco at National Research Center for Citrus, Nagpur during 2008-2011. The objective was to study the automatic daily irrigation scheduling as well as alternate day based on time schedule and potential evapo-transpiration through the drip irrigation. The treatments were consisted of Automatic daily irrigation daily with 60 minute interval three times (I1; Automatic irrigation daily with 90 minute interval two times (I2; Automatic irrigation at alternate day with 120 minute three times (I3; and Automatic irrigation at alternate day with 180 minute two times (I4 with six replications in Randomized Block Design. The automatic hybrid station controller E-6 (Rain Bird, USA was used for micro-irrigation schedule setting the time for each treatment based on the water need of the plant and average open pan evaporation. The various scheduling treatment timings were programmed in A, B and C programs of the hybrid station controller. The sustainable production of Nagpur mandarin is possible with drip irrigation using automatic scheduling daily or on alternate days.  The water use in October varied from 65.0-72.4 liters/day/plant and during May-June it was 133.0 - 147.7 liters/day/plant. Drip irrigation was scheduled to maintain automatically the soil moisture status above 25% (wet basis during fruit growing period. The leaf nutrient status was high with automatic alternate day drip irrigation schedule. The canopy temperature was positively influenced with automatic drip irrigation schedules.  The Nagpur mandarin fruit yield was highest (30.91 tones/ha with irrigation on alternate day 120 minutes three times, followed by irrigation scheduled with 90 minutes interval two times daily (30.11 tones/ha. Fruit weight (154.7 g, TSS (10.22 0Brix and juice percent (40.77% was found with automatic

  6. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

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

    operations. Therefore, route and schedule decisions a_ect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning...... in the routing and scheduling phase and present a mixed integer programming formulation for the integrated problem of optimally routing, scheduling and bunkering a tramp fleet. Aside from the integration of bunker, this model also extends standard tramp formulations by using load dependent costs, speed...

  7. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

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

    , route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...... and scheduling phase and present a mixed integer programming formulation for the integrated problem of optimally routing, scheduling and bunkering a tramp fleet. Aside from the integration of bunker, this model also extends standard tramp formulations by using load dependent costs, speed and bunker consumption...

  8. Tramp ship routing and scheduling with integrated bunker optimization

    DEFF Research Database (Denmark)

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

    2014-01-01

    , route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...... and scheduling phase and present a mixed integer programming formulation for the integrated problem of optimally routing, scheduling and bunkering a tramp fleet. Aside from the integration of bunker, this model also extends standard tramp formulations by using load dependent costs, speed and bunker consumption...

  9. New Proactive Time Buffer Heuristics for Robust Project Scheduling

    Science.gov (United States)

    Elshaer, Raafat; Yamamoto, Hidehiko

    Robust scheduling is aiming at constructing proactive schedules capable of dealing with multiple disruptions during project execution. Insertion a time buffer, before an activity start time, is a method to improve the robustness (stability) of a baseline schedule. In this paper, we introduce new heuristics for inserting time buffers in a given baseline schedule while the project due date is predefined and stochastic activity duration is considered. Computational results obtained from a set of benchmark projects show that the proposed heuristics capable of generating proactive schedules with acceptable quality and solution robustness.

  10. Geographic Information Systems in Evaluation and Visualization of Construction Schedule

    CERN Document Server

    Bansal, V K

    2008-01-01

    Commercially available scheduling tools such as Primavera and Microsoft Project fail to provide information pertaining to the spatial aspects of construction project. A methodology using geographical information systems (GIS) is developed to represent spatial aspects of the construction progress graphically by synchronizing it with construction schedule. The spatial aspects are depicted by 3D model developed in AutoCAD and construction schedule is generated using Microsoft Excel. Spatial and scheduling information are linked together into the GIS environment (ArcGIS). The GIS-based system developed in this study may help in better understanding the schedule along with its spatial aspects.

  11. Concept of Indoor 3D-Route UAV Scheduling System

    DEFF Research Database (Denmark)

    Khosiawan, Yohanes; Nielsen, Izabela Ewa; Do, Ngoc Ang Dung

    2016-01-01

    The objective of the proposed concept is to develop a methodology to support Unmanned Aerial Vehicles (UAVs) operation with a path planning and scheduling system in 3D environments. The proposed 3D path-planning and scheduling allows the system to schedule UAVs routing to perform tasks in 3D indoor...... environment. On top of that, the multi-source productive best-first-search concept also supports efficient real-time scheduling in response to uncertain events. Without human intervention, the proposed work provides an automatic scheduling system for UAV routing problem in 3D indoor environment....

  12. Concept of Indoor 3D-Route UAV Scheduling System

    DEFF Research Database (Denmark)

    Khosiawan, Yohanes; Nielsen, Izabela Ewa; Do, Ngoc Ang Dung;

    2016-01-01

    environment. On top of that, the multi-source productive best-first-search concept also supports efficient real-time scheduling in response to uncertain events. Without human intervention, the proposed work provides an automatic scheduling system for UAV routing problem in 3D indoor environment.......The objective of the proposed concept is to develop a methodology to support Unmanned Aerial Vehicles (UAVs) operation with a path planning and scheduling system in 3D environments. The proposed 3D path-planning and scheduling allows the system to schedule UAVs routing to perform tasks in 3D indoor...

  13. INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2015-02-01

    Full Text Available The specificity of the yard work requires the particularly careful treatment of the issues of scheduling and budgeting in the production planning processes. The article presents the method of analysis of the assembly sequence taking into account the duration of individual activities and the demand for resources. A method of the critical path and resource budgeting were used. Modelling of the assembly was performed using the acyclic graphs. It has been shown that the assembly sequences can have very different feasible budget regions. The proposed model is applied to the assembly processes of large-scale welded structures, including the hulls of ships. The presented computational examples have a simulation character. They show the usefulness of the model and the possibility to use it in a variety of analyses.

  14. MidSFN Local Scheduling AlgorithmMidSFN Local Scheduling Algorithm for Heterogeneous Grid Environment

    Directory of Open Access Journals (Sweden)

    Dr.G.Sumathi

    2012-05-01

    Full Text Available A grid is a heterogeneous computing and communication system that allows a group of nodes to compass a task. The process of assigning the jobs or subtasks to the nodes present in the heterogeneous grid is known as scheduling. The type of scheduling in which the subtasks are assigned to the nodes is known as Local Scheduling.A significant research problem is how to assign resources to the subtasks and order the execution of the subtasks that are matched to maximize performance criterion of a local grid system. This procedure of scheduling is called mapping or resource allocation. MidSFN adverts to Medium Subtask Fastest Node algorithm which classifies the subtasks into three tier categories, High, Middle and Low based on their priority. In MidSFN algorithm priority is assigned based on the new parameters Computational Complexity and Processing Power. The value for processing power is assigned based on the Performance Factor. The value of the Performance Factor is the product of the number of operations per cycle per processor and the number of instructions processed per second. In MidSFN algorithm the subtask of medium computational complexity and resources exhibiting medium processing power are assigned with a high priority. The subtasks are then mapped to respective processors based on the assigned priority for execution. Compared to other local scheduling algorithms, MidSFN algorithm shows efficient load balancing and better computation with effective usage of resources. The effectiveness of this algorithm is evaluated through simulation results.

  15. Quantifying and understanding reproductive allocation schedules in plants.

    Science.gov (United States)

    Wenk, Elizabeth Hedi; Falster, Daniel S

    2015-12-01

    A plant's reproductive allocation (RA) schedule describes the fraction of surplus energy allocated to reproduction as it increases in size. While theorists use RA schedules as the connection between life history and energy allocation, little is known about RA schedules in real vegetation. Here we review what is known about RA schedules for perennial plants using studies either directly quantifying RA or that collected data from which the shape of an RA schedule can be inferred. We also briefly review theoretical models describing factors by which variation in RA may arise. We identified 34 studies from which aspects of an RA schedule could be inferred. Within those, RA schedules varied considerably across species: some species abruptly shift all resources from growth to reproduction; most others gradually shift resources into reproduction, but under a variety of graded schedules. Available data indicate the maximum fraction of energy allocated to production ranges from 0.1 to 1 and that shorter lived species tend to have higher initial RA and increase their RA more quickly than do longer-lived species. Overall, our findings indicate, little data exist about RA schedules in perennial plants. Available data suggest a wide range of schedules across species. Collection of more data on RA schedules would enable a tighter integration between observation and a variety of models predicting optimal energy allocation, plant growth rates, and biogeochemical cycles.

  16. Feedback Scheduling of Priority-Driven Control Networks

    CERN Document Server

    Xia, Feng; Tian, Yu-Chu

    2008-01-01

    With traditional open-loop scheduling of network resources, the quality-of-control (QoC) of networked control systems (NCSs) may degrade significantly in the presence of limited bandwidth and variable workload. The goal of this work is to maximize the overall QoC of NCSs through dynamically allocating available network bandwidth. Based on codesign of control and scheduling, an integrated feedback scheduler is developed to enable flexible QoC management in dynamic environments. It encompasses a cascaded feedback scheduling module for sampling period adjustment and a direct feedback scheduling module for priority modification. The inherent characteristics of priority-driven control networks make it feasible to implement the proposed feedback scheduler in real-world systems. Extensive simulations show that the proposed approach leads to significant QoC improvement over the traditional open-loop scheduling scheme under both underloaded and overloaded network conditions.

  17. Earth Observation Satellites Scheduling Based on Decomposition Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Feng Yao

    2010-11-01

    Full Text Available A decomposition-based optimization algorithm was proposed for solving Earth Observation Satellites scheduling problem. The problem was decomposed into task assignment main problem and single satellite scheduling sub-problem. In task assignment phase, the tasks were allocated to the satellites, and each satellite would schedule the task respectively in single satellite scheduling phase. We adopted an adaptive ant colony optimization algorithm to search the optimal task assignment scheme. Adaptive parameter adjusting strategy and pheromone trail smoothing strategy were introduced to balance the exploration and the exploitation of search process. A heuristic algorithm and a very fast simulated annealing algorithm were proposed to solve the single satellite scheduling problem. The task assignment scheme was valued by integrating the observation scheduling result of multiple satellites. The result was responded to the ant colony optimization algorithm, which can guide the search process of ant colony optimization. Computation results showed that the approach was effective to the satellites observation scheduling problem.

  18. The robust schedule - A link to improved workflow

    DEFF Research Database (Denmark)

    Lindhard, Søren; Wandahl, Søren

    2012-01-01

    In today’s construction, there is a paramount focus on time, and on the scheduling and control of time. Everything is organized with respect to time. The construction project has to be completed within a fixed and often tight deadline. Otherwise a daily penalty often has to be paid. This pin......-down the contractors, and force them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In attempt to improve productivity three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have been...... analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule to tight. A too tight schedule is inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors interacting and dependable...

  19. Comparative Study of Static Task Scheduling Algorithms for Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Miss. Kalpana A. Manudhane

    2013-03-01

    Full Text Available On the distributed or parallel heterogeneous computing systems, an application is usually decomposed into several interdependent sets of co-operating subtasks and assigned to a set of available processors for execution. Task scheduling is in general NP-compete problem. Static task scheduling algorithms are categorized as Heuristic based and Guided random search based scheduling algorithms. Heuristic algorithms guaranteed to find near optimal solution in less than polynomial time. Heuristic based list scheduling algorithms are Heterogeneous Earliest Finish Time (HEFT and Critical-Path-On- -Processor (CPOP. Whereas, Guided random search based scheduling algorithms have shown robust performance on verity of schedulingproblems. Typical examples are Multiple Priority Queueing Genetic Algorithm (MPQGA, Tabu Search(TS, Ant Colony System (ACS. This paper gives comparative study of all these static task scheduling algorithms and compares them on the basis of average makespan, schedule length ratio (SLR and speedup and running time of algorithm.

  20. Application-adaptive resource scheduling in a computational grid

    Institute of Scientific and Technical Information of China (English)

    LUAN Cui-ju; SONG Guang-hua; ZHENG Yao

    2006-01-01

    Selecting appropriate resources for running a job efficiently is one of the common objectives in a computational grid.Resource scheduling should consider the specific characteristics of the application, and decide the metrics to be used accordingly.This paper presents a distributed resource scheduling framework mainly consisting of a job scheduler and a local scheduler. In order to meet the requirements of different applications, we adopt HGSA, a Heuristic-based Greedy Scheduling Algorithm, to schedule jobs in the grid, where the heuristic knowledge is the metric weights of the computing resources and the metric workload impact factors. The metric weight is used to control the effect of the metric on the application. For different applications, only metric weights and the metric workload impact factors need to be changed, while the scheduling algorithm remains the same.Experimental results are presented to demonstrate the adaptability of the HGSA.

  1. Optimization Algorithms in School Scheduling Programs: Study, Analysis and Results

    Directory of Open Access Journals (Sweden)

    Lina PUPEIKIENE

    2009-04-01

    Full Text Available To create good and optimal school schedule is very important and practical task. Currently in Lithuania schools are using two programs for making the school schedule at the moment. But none of these programs is very effective. Optimization Department of Lithuanian Institute of Mathematics and Informatics (IMI has created ``School schedule optimization program''. It has three optimization algorithms for making best school schedule. A user can choose not only few optimization options and get few optimal schedules, but some subjective and objectives parameters. The making of initial data file is advanced in this program. XML format is used for creating initial data file and getting all optimal results files. The purpose of this study is to analyze used optimization algorithms used in ``School schedule optimization program'' and to compare results with two most popular commercial school scheduling programs in Lithuania.

  2. A TQCS-based Scheduling Approach for Manufacturing Grid

    Institute of Scientific and Technical Information of China (English)

    LIU Li-lan; YU Tao; CAO Hong-wu; SHI Zhan-bei

    2004-01-01

    With Open Grid Service Architecture (OGSA) as system framework, and Globus Toolkit3.0 (GT3) as developing tools, Manufacturing Grid (MG) is proposed in this research to realize resource sharing and collaborative working among manufacturing resources, and task scheduling is one of the most critical components in this system. Nevertheless, the Globus Resource Allocation Manager (GRAM) does not provide scheduling system by default, and traditional performance-guided or economy-guided schedulers cannot satisfy our needs in MG. So, in this paper, a TQCS (Time, Quality, Cost, Service)-based scheduling approach is presented and the corresponding scheduler (Manufacturing Grid Task Scheduler, MGTS) is implemented with the functions of Global Process Planning (GPP) analyzing, resource discovery, resource selection, AHP (Analytic Hierarchy Process)-based resource mapping, and fault-tolerant handling. Furthermore, the application architecture is depicted at the end of the paper to illustrate the utilization of our scheduler.

  3. CARMENES instrument control system and operational scheduler

    Science.gov (United States)

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

    2014-07-01

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

  4. [Intrathecal methotrexate in breast cancer meningeal carcinomatosis - Experience with a new administration schedule].

    Science.gov (United States)

    Cochereau, Delphine; Da Costa, Sabrina; Le Maignan, Christine; Gauthier, Hélène; Cochereau, Jérôme; Espié, Marc; Giacchetti, Sylvie; Teixeira, Luis

    2016-05-01

    Methotrexate represents the standard intrathecal treatment of breast cancer meningeal carcinomatosis. However, its optimal schedule remains undefined. The aim of the present study was to evaluate results obtained with the methotrexate schedule used in Saint-Louis hospital (Paris). Patients followed in Saint-Louis hospital for breast cancer and who received intrathecal methotrexate were included in this retrospective monocentric study. Intrathecal treatment received contained methotrexate 12 mg/day (days: 1-5) and then 15 mg/week until progression or toxicity. Between 2003 and 2015, 41 patients were included. Primitive tumours were RH+/HER2-, HER2+ and triple-negative in respectively 66%, 14%, 5% and 15% of patients, 22% of them had meningeal carcinomatosis as metastatic disease initial manifestation. Objective response rate was 54%, median overall survival was 4.0 mois [CI 95%: 3-7.3] and 1-year survival rate was 15.2% (11.4%, 50% et 0% in RH+/HER2-, HER2+ and triple-negative subgroups; HR=0.45 [0.21-0.97] between HER2+ and RH+/HER2-). In univariate analysis, prognostic factors were brain involvement (p=0.049), initial cerebrospinal fluid protein level (p=0.0002) and concomitant systemic treatment received (p=0.049). This intrathecal methotrexate schedule demonstrates a similar median overall survival as the one obtained with a dose-dense schedule and an improved quality of life. Nevertheless, as the objective response and 1-year survival rates are slightly inferior, a dose-dense schedule remains still preferred in HER2+ patients or in those harboring a mainly meningeal progression.

  5. 75 FR 52305 - Notice of Availability of a Treatment Evaluation Document

    Science.gov (United States)

    2010-08-25

    ... determined that it is necessary to revise treatment schedule T314-a, which provides a heat treatment schedule... treatment for various wood pests (rather than just emerald ash borer); we would redesignate this treatment... Animal and Plant Health Inspection Service Notice of Availability of a Treatment Evaluation...

  6. Optimal scheduling of logistical support for an emergency roadway repair work schedule

    Science.gov (United States)

    Yan, S.; Lin, C. K.; Chen, S. Y.

    2012-09-01

    The completion of every disaster rescue task performed by repair work teams relies on the in-time supply of materials to the rescue workers. Up to now, logistical support planning for emergency repair work in Taiwan has been done manually, which is neither effective nor efficient. To remedy the problem, this study presents a logistical support scheduling model for the given emergency repair work schedule. The objective is to minimize the short-term operating cost subject to time constraints and other related operating constraints. This model is formulated as an integer multiple-commodity network flow problem which is characterized as NP-hard. A heuristic algorithm, based on the problem decomposition and variable fixing techniques, is also proposed to efficiently solve this problem. Computational tests are performed using data from Taiwan's 1999 Chi-Chi earthquake. The results show that the model and the solution algorithm would be useful for the logistical support scheduling.

  7. Intermittent Metronomic Drug Schedule Is Essential for Activating Antitumor Innate Immunity and Tumor Xenograft Regression

    Directory of Open Access Journals (Sweden)

    Chong-Sheng Chen

    2014-01-01

    Full Text Available Metronomic chemotherapy using cyclophosphamide (CPA is widely associated with antiangiogenesis; however, recent studies implicate other immune-based mechanisms, including antitumor innate immunity, which can induce major tumor regression in implanted brain tumor models. This study demonstrates the critical importance of drug schedule: CPA induced a potent antitumor innate immune response and tumor regression when administered intermittently on a 6-day repeating metronomic schedule but not with the same total exposure to activated CPA administered on an every 3-day schedule or using a daily oral regimen that serves as the basis for many clinical trials of metronomic chemotherapy. Notably, the more frequent metronomic CPA schedules abrogated the antitumor innate immune and therapeutic responses. Further, the innate immune response and antitumor activity both displayed an unusually steep dose-response curve and were not accompanied by antiangiogenesis. The strong recruitment of innate immune cells by the 6-day repeating CPA schedule was not sustained, and tumor regression was abolished, by a moderate (25% reduction in CPA dose. Moreover, an ~20% increase in CPA dose eliminated the partial tumor regression and weak innate immune cell recruitment seen in a subset of the every 6-day treated tumors. Thus, metronomic drug treatment must be at a sufficiently high dose but also sufficiently well spaced in time to induce strong sustained antitumor immune cell recruitment. Many current clinical metronomic chemotherapeutic protocols employ oral daily low-dose schedules that do not meet these requirements, suggesting that they may benefit from optimization designed to maximize antitumor immune responses.

  8. LiveGantt: Interactively Visualizing a Large Manufacturing Schedule.

    Science.gov (United States)

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

    2014-12-01

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

  9. Enhanced Software for Scheduling Space-Shuttle Processing

    Science.gov (United States)

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

    2004-01-01

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

  10. Data analysis with the DIANA meta-scheduling approach

    CERN Document Server

    Anjum, A; Willers, I

    2008-01-01

    The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of t...

  11. Conception of Self-Construction Production Scheduling System

    Science.gov (United States)

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

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

  12. Integrating job scheduling and constrained network routing

    DEFF Research Database (Denmark)

    Gamst, Mette

    2010-01-01

    This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...... of geographically distributed resources connected through an optical network work together for solving large problems. A number of heuristics are proposed along with an exact solution approach based on Dantzig-Wolfe decomposition. The latter has some performance difficulties while the heuristics solve all instances...

  13. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  14. Belle II Physics Prospects, Status and Schedule

    Science.gov (United States)

    Bennett, J.

    2016-11-01

    The second generation B-factory at the SuperKEKB facility in Tsukuba, Japan is beginning to take shape. The highly anticipated Belle II experiment will have a rich physics program at the intensity frontier, in complement to existing experiments in the energy frontier. Accelerator commissioning has been making good progress, as has the construction and installation of the Belle II detector. An overview of the physics prospects at Belle II, as well as the status and schedule of the experiment, is presented.

  15. Stochastic Scheduling and Planning Using Reinforcement Learning

    Science.gov (United States)

    2007-11-02

    reinforcement learning (RL) methods to large-scale optimization problems relevant to Air Force operations planning, scheduling, and maintenance. The objectives of this project were to: (1) investigate the utility of RL on large-scale logistics problems; (2) extend existing RL theory and practice to enhance the ease of application and the performance of RL on these problems; and (3) explore new problem formulations in order to take maximal advantage of RL methods. A method using RL to modify local search cost functions was developed and shown to yield significant

  16. Packet scheduling for OFDMA based relay networks

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The combination of relay networks with orthogonal frequency division multiple access (OFDMA) has been proposed as a promising solution for the next generation wireless system. Considering different traffic classes and user quality of service (QoS), three efficient scheduling algorithms are introduced in such networks. The round-robin (RR) algorithm in relay networks serves as a performance benchmark. Numerical results show that the proposed algorithms achieve significant improvement on system throughput and decrease system packet loss rate, compared with the RR and absence of relaying system (traditional network). Furthermore, comparisons have been carried out among the three proposed algorithms.

  17. New propant schedule in hydralic fracturing

    Energy Technology Data Exchange (ETDEWEB)

    Wang, H.; Fan, C.

    1981-01-01

    A new proppant schedule is suggested to obtain maximum propping surface area and maximum fracture conductivity near the borehole. The small and middle size sands are suspended in the fracturing fluids under fracturing condition to prop the total fracture surface area created by fracturing. The coarse sands pumped into fracture later deposit in the fracture at the dynamic width near the borehole during fracturing and reach the equilibrium height in the time interval of pumping coarse sands. Thus, fracture conductivity near the borehole is increased. Computer calculation of the sand program, the corresponding fluid program and pumping rates are presented also.

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

    Science.gov (United States)

    2013-04-12

    ...'' with regard to post-traumatic stress disorder (PTSD), Schedule I placement ``implicitly undermines... large majority of these exposures were by intentional abuse, misuse, or suspected suicide. Most of these... in the use of serotonin releasing agents to treat anxiety disorders. In addition, the...

  19. Scheduling and order acceptance for the customised stochastic lot scheduling problem

    NARCIS (Netherlands)

    van Foreest, Nicky D.; Wijngaard, Jacob; van der Vaart, Taco

    2010-01-01

    This paper develops and analyses several customer order acceptance policies to achieve high bottleneck utilisation for the customised stochastic lot scheduling problem (CSLSP) with large setups and strict order due dates. To compare the policies, simulation is used as the main tool, due to the compl

  20. Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling

    Institute of Scientific and Technical Information of China (English)

    Chen Yao; Li Qiao; Li Zheng; Xiong Huagang

    2014-01-01

    Safety-critical avionics systems which become more complex and tend to integrate multiple functionalities with different levels of criticality for better cost and power efficiency are subject to certifications at various levels of rigorousness. In order to simultaneously guarantee tem-poral constraints at all different levels of assurance mandated by different criticalities, novel sched-uling techniques are in need. In this paper, a mixed-criticality sporadic task model with multiple virtual deadlines is built and a certification-cognizant dynamic scheduling approach referred as ear-liest virtual-deadline first with mixed-criticality (EVDF-MC) is considered, which exploits different relative deadlines of tasks in different criticality modes. As for the corresponding schedulability analysis problem, a sufficient and efficient schedulability test is proposed on the basis of demand-bound functions derived in the mixed-criticality scenario. In addition, a modified simulated annealing (MSA)-based heuristic approach is established for virtual deadlines assignment. Experi-ments performing simulations with randomly generated tasks indicate that the proposed approach is computationally efficient and competes well against the existing approaches.

  1. A set of simplified scheduling constraints for underwater acoustic MAC scheduling

    NARCIS (Netherlands)

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

    2010-01-01

    Abstract—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 have significant impacts on throughput, energy consumption, and reliability

  2. Schedules of controlled substances: temporary placement of three synthetic phenethylamines into Schedule I. Final order.

    Science.gov (United States)

    2013-11-15

    The Deputy Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic phenethylamines into the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are 2-(4-iodo-2,5-dimethoxyphenyl)-N-(2-methoxybenzyl)ethanamine (25I-NBOMe; 2C-I-NBOMe; 25I; Cimbi-5), 2-(4-chloro-2,5-dimethoxyphenyl)-N-(2-methoxybenzyl)ethanamine (25C-NBOMe; 2C-C-NBOMe; 25C; Cimbi-82), and 2-(4-bromo-2,5-dimethoxyphenyl)-N-(2-methoxybenzyl)ethanamine (25B-NBOMe; 2C-B-NBOMe; 25B; Cimbi-36) [hereinafter 25I-NBOMe, 25C-NBOMe, and 25B-NBOMe]. This action is based on a finding by the Deputy Administrator that the placement of these synthetic phenethylamines and their optical, positional, and geometric isomers, salts and salts of isomers in schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, dispense, import, export, engage in research, conduct instructional activities, and possess), or propose to handle these synthetic phenethylamines.

  3. 77 FR 64032 - Schedules of Controlled Substances: Extension of Temporary Placement of Methylone Into Schedule I...

    Science.gov (United States)

    2012-10-18

    ... Federal Register (76 FR 65371) amending 21 CFR 1308.11(g) to temporarily place three synthetic cathinones, namely mephedrone (4-methyl-N-methylcathinone), MDPV (3,4- methylenedioxypyrovalerone) and methylone... completed, whichever occurs first. \\3\\ Section 1152 of FDASIA controlled mephedrone and MDPV as Schedule...

  4. Accounting for Cache Related Pre-emption Delays in Hierarchical Scheduling with Local EDF Scheduler

    NARCIS (Netherlands)

    Lunniss, W.; Altmeyer, S.; Davis, R.I.

    2014-01-01

    Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy application

  5. Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling

    Directory of Open Access Journals (Sweden)

    Chen Yao

    2014-08-01

    Full Text Available Safety-critical avionics systems which become more complex and tend to integrate multiple functionalities with different levels of criticality for better cost and power efficiency are subject to certifications at various levels of rigorousness. In order to simultaneously guarantee temporal constraints at all different levels of assurance mandated by different criticalities, novel scheduling techniques are in need. In this paper, a mixed-criticality sporadic task model with multiple virtual deadlines is built and a certification-cognizant dynamic scheduling approach referred as earliest virtual-deadline first with mixed-criticality (EVDF-MC is considered, which exploits different relative deadlines of tasks in different criticality modes. As for the corresponding schedulability analysis problem, a sufficient and efficient schedulability test is proposed on the basis of demand-bound functions derived in the mixed-criticality scenario. In addition, a modified simulated annealing (MSA-based heuristic approach is established for virtual deadlines assignment. Experiments performing simulations with randomly generated tasks indicate that the proposed approach is computationally efficient and competes well against the existing approaches.

  6. New packet scheduling algorithm in wireless CDMA data networks

    Science.gov (United States)

    Wang, Yu; Gao, Zhuo; Li, Shaoqian; Li, Lemin

    2002-08-01

    The future 3G/4G wireless communication systems will provide internet access for mobile users. Packet scheduling algorithms are essential for QoS of diversified data traffics and efficient utilization of radio spectrum.This paper firstly presents a new packet scheduling algorithm DSTTF under the assumption of continuous transmission rates and scheduling intervals for CDMA data networks . Then considering the constraints of discrete transmission rates and fixed scheduling intervals imposed by the practical system, P-DSTTF, a modified version of DSTTF, is brought forward. Both scheduling algorithms take into consideration of channel condition, packet size and traffic delay bounds. The extensive simulation results demonstrate that the proposed scheduling algorithms are superior to some typical ones in current research. In addition, both static and dynamic wireless channel model of multi-level link capacity are established. These channel models sketch better the characterizations of wireless channel than two state Markov model widely adopted by the current literature.

  7. The robust schedule - a link to improved workflow

    DEFF Research Database (Denmark)

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

    2012-01-01

    In today’s construction, there is a paramount focus on time, and on the scheduling and control of time. Everything is organized with respect to time. The construction project has to be completed within a fixed and often tight deadline. Otherwise a daily penalty often has to be paid. This pins down...... the contractors, and forces them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In an attempt to improve productivity, three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have...... been analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule too tight as it becomes inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors’ interacting and dependent...

  8. A-MMLQ Algorithm for Multi-level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Manupriya Hasija

    2013-07-01

    Full Text Available This being the era of advancement in computing domain, the emphasis is on better resource scheduling. Scheduling is not confined to dealing multiple tasks by a single processor. It’s a dawn with multiprocessing and multitasking. Although multiprocessor systems impose several overheads but still make the concept amazingly interesting. The scheduling field has taken a whirlwind after the notion of multiprocessing. Many of the uniprocessor algorithms do fit well under the multiprocessor systems but, still necessitating a further development aiming solely on multiprocessor scheduling. This paper thus sketches a new idea to modify and extend the well-known multi-level queue scheduling, taking into account the arrival time/ arrival sequence to conceptualize an innovative scheduling algorithm.

  9. Where do we stand with fuzzy project scheduling?

    CERN Document Server

    Bonnal, Pierre; Lacoste, Germain

    2004-01-01

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

  10. A reduced feedback proportional fair multiuser scheduling scheme

    KAUST Repository

    Shaqfeh, Mohammad

    2011-12-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. A 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 propose a novel proportional fair multiuser switched-diversity scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the per-user feedback thresholds. We demonstrate by numerical examples that our reduced feedback proportional fair scheduler operates within 0.3 bits/sec/Hz from the achievable rates by the conventional full feedback proportional fair scheduler in Rayleigh fading conditions. © 2011 IEEE.

  11. Healthcare Scheduling by Data Mining: Literature Review and Future Directions

    Directory of Open Access Journals (Sweden)

    Maria M. Rinder

    2012-01-01

    Full Text Available This article presents a systematic literature review of the application of industrial engineering methods in healthcare scheduling, with a focus on the role of patient behavior in scheduling. Nine articles that used mathematical programming, data mining, genetic algorithms, and local searches for optimum schedules were obtained from an extensive search of literature. These methods are new approaches to solve the problems in healthcare scheduling. Some are adapted from areas such as manufacturing and transportation. Key findings from these studies include reduced time for scheduling, capability of solving more complex problems, and incorporation of more variables and constraints simultaneously than traditional scheduling methods. However, none of these methods modeled no-show and walk-ins patient behavior. Future research should include more variables related to patient and/or environment.

  12. An Improved Ant Algorithm for Grid Task Scheduling Strategy

    Science.gov (United States)

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

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

  13. Distributed Research Project Scheduling Based on Multi-Agent Methods

    Directory of Open Access Journals (Sweden)

    Constanta Nicoleta Bodea

    2011-01-01

    Full Text Available Different project planning and scheduling approaches have been developed. The Operational Research (OR provides two major planning techniques: CPM (Critical Path Method and PERT (Program Evaluation and Review Technique. Due to projects complexity and difficulty to use classical methods, new approaches were developed. Artificial Intelligence (AI initially promoted the automatic planner concept, but model-based planning and scheduling methods emerged later on. The paper adresses the project scheduling optimization problem, when projects are seen as Complex Adaptive Systems (CAS. Taken into consideration two different approaches for project scheduling optimization: TCPSP (Time- Constrained Project Scheduling and RCPSP (Resource-Constrained Project Scheduling, the paper focuses on a multiagent implementation in MATLAB for TCSP. Using the research project as a case study, the paper includes a comparison between two multi-agent methods: Genetic Algorithm (GA and Ant Colony Algorithm (ACO.

  14. Explicit Learning: an Effort towards Human Scheduling Algorithms

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem.

  15. Solving University Scheduling Problem Using Hybrid Approach

    Directory of Open Access Journals (Sweden)

    Aftab Ahmed Shaikh

    2011-10-01

    Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

  16. Santa Claus Schedules Jobs on Unrelated Machines

    CERN Document Server

    Svensson, Ola

    2010-01-01

    One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines, i.e., job j requires time p_{ij} if processed on machine i. More than two decades after its introduction it is still the algorithm of choice even in the restricted model where processing times are of the form p_{ij} in {p_j, \\infty}. This problem, also known as the restricted assignment problem, is NP-hard to approximate within a factor less than 1.5 which is also the best known lower bound for the general version. Our main result is a polynomial time algorithm that estimates the optimal makespan of the restricted assignment problem within a factor 33/17 + \\epsilon \\approx 1.9412 + \\epsilon, where \\epsilon > 0 is an arbitrary small constant. The result is obtained by upper bounding the integrality gap of a certain strong linear program, known as configuration LP, that was previously successfully used for the related Santa...

  17. SHIFT SCHEDULING FOR A MAINTENANCE WORKSHOP.

    Directory of Open Access Journals (Sweden)

    M. Sinclair

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: A big passenger transport company experienced problems with the utilization of their maintenance crews. Large amounts of overtime were logged, while at the same time a lot of idle time was experienced. This paper describes the development on a microcomputer of a Decision Support System (DSS to improve their shift scheduling. Central to the DSS is a heuristic algorithm which generates shift schedules. This algorithm is easy .to understand and provides good results, while it solves the real life problem rapidly on a microcomputer.

    AFRIKAANSE OPSOMMING: 'n Groot passasiersvervoermaatokappy het probleme ondervind met die benutting van hulle onderhoudspersoneel. Baie oortyd is gewerk en terselfdertyd is baie ledige tyd opgeteken. Hierdie artikel beskryf die ontwikkeling op 'n mikrorekenaar van 'n Besluitnemingsondersteuningstelsel (BOS om hulle skofteskedulering te verbeter. Die belangrikste element van die BOS is 'n heuristiese algoritme wat skofteskedules genereer. Hierdie algoritme is maklik om te verstaan en genereer goeie skedules. Terselfdertyd los dit die maatskappy se probleem vinnig op 'n mikrorekenaar op.

  18. Throughput Optimal Scheduling with Feedback Cost Reduction

    CERN Document Server

    Karaca, Mehmet; Ercetin, Ozgur; Alpcan, Tansu; Boche, Holger

    2012-01-01

    It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. We adopt a channel probing model where $\\beta$ fraction of time slot is consumed for acquiring the channel state information (CSI) of a single channel. In this work, we design a joint scheduling and channel probing algorithm named SDF by considering the overhead of obtaining the channel state information. We analytically prove that when the number of users in the network is greater than 3, then SDF algorithm can achieve $1+\\epsilon$ of the full rate region achieved when all users are probed. We also demonstrate numerically in a realistic simulation setting that this rate region can be achieved by probing only less than 50% of all channels in a CDM...

  19. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    LE Bisping

    1999-02-12

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted 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 are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL-91-50, Rev.2, U.S. Department of Energy, Richland, Washington. This document contains the CY1999 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section includes the sampling location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be collected in 1999 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing approximate sampling locations.

  20. Intelligent Scheduling for Underground Mobile Mining Equipment.

    Directory of Open Access Journals (Sweden)

    Zhen Song

    Full Text Available Many studies have been carried out and many commercial software applications have been developed to improve the performances of surface mining operations, especially for the loader-trucks cycle of surface mining. However, there have been quite few studies aiming to improve the mining process of underground mines. In underground mines, mobile mining equipment is mostly scheduled instinctively, without theoretical support for these decisions. Furthermore, in case of unexpected events, it is hard for miners to rapidly find solutions to reschedule and to adapt the changes. This investigation first introduces the motivation, the technical background, and then the objective of the study. A decision support instrument (i.e. schedule optimizer for mobile mining equipment is proposed and described to address this issue. The method and related algorithms which are used in this instrument are presented and discussed. The proposed method was tested by using a real case of Kittilä mine located in Finland. The result suggests that the proposed method can considerably improve the working efficiency and reduce the working time of the underground mine.