WorldWideScience

Sample records for chronomodulated treatment schedules

  1. Retrospective analysis of chronomodulated chemotherapy versus conventional chemotherapy with paclitaxel, carboplatin, and 5-fluorouracil in patients with recurrent and/or metastatic head and neck squamous cell carcinoma

    Directory of Open Access Journals (Sweden)

    Chen D

    2013-10-01

    Full Text Available Dan Chen, Jue Cheng, Kai Yang, Yue Ma, Fang Yang Department of Oral and Maxillofacial Surgery, The First Affiliated Hospital of Chongqing Medical University, Chongqing, People's Republic of China Background: Chronomodulated chemotherapy has emerged as a new therapy as a result of recent studies focusing on the biological clock. It has been demonstrated that combination chronomodulated chemotherapy of platinum-based drugs and 5-fluorouracil (5-Fu can significantly improve efficacy and reduce the incidence of adverse events in patients with metastatic colorectal cancer, as compared with conventional chemotherapy. However, the results may be different in different tumors. Recurrent and metastatic head and neck squamous cell carcinoma (HNSCC is very difficult to treat, with an extremely unfavorable prognosis. So far, no report is available on chronomodulated chemotherapy for HNSCC. Methods: Retrospective analyses were made on 49 patients with local recurrent and/or metastatic HNSCC who underwent palliative treatments with paclitaxel, carboplatin, and 5-Fu. The patients were divided into a chronomodulated chemotherapy group (28 patients and a conventional chemotherapy group (21 patients according to their administration times. The two groups were compared for tumor objective response rate, overall survival (OS, progression-free survival (PFS, and the incidence of adverse events. Results: The tumor objective response rate and patients' OS were significantly higher and longer in the chronomodulated chemotherapy group than in the conventional chemotherapy group (71.43% versus 42.86%, respectively, P0.05. The global incidence of adverse events in the chronomodulated chemotherapy group was significantly lower than that in the conventional chemotherapy group (46.43% versus 76.19%, P<0.05, with significantly lower incidence of grade 3–4 adverse events (7.14% versus 33.33%, P<0.05. Conclusion: Chronomodulated chemotherapy with paclitaxel, carboplatin, and

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

  3. 7 CFR 305.23 - Steam sterilization treatment schedules.

    Science.gov (United States)

    2010-01-01

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

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

    International Nuclear Information System (INIS)

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

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

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

  7. An intelligent manufacturing system for heat treatment scheduling

    OpenAIRE

    Al-Kanhal, Tawfeeq

    2010-01-01

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

  8. 7 CFR 305.25 - Dry heat treatment schedules.

    Science.gov (United States)

    2010-01-01

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

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

    OpenAIRE

    M Sokar; A Hanafy; Elkamel, A.; El-Gamal, S.

    2015-01-01

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

  10. Design of Chronomodulated Drug Delivery System of Valsartan: In Vitro Characterization

    OpenAIRE

    M Sokar; A Hanafy; Elkamel, A.; El-Gamal, S.

    2015-01-01

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

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

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

  13. 40 CFR 141.713 - Schedule for compliance with Cryptosporidium treatment requirements.

    Science.gov (United States)

    2010-07-01

    ... Treatment for Cryptosporidium Treatment Technique Requirements § 141.713 Schedule for compliance with... treatment compliance dates. Cryptosporidium Treatment Compliance Dates Table Systems that serve . . . Must... 40 Protection of Environment 22 2010-07-01 2010-07-01 false Schedule for compliance...

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

    Science.gov (United States)

    2010-01-01

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

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

    OpenAIRE

    Satwara, Rohan

    2012-01-01

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

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

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

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

    Science.gov (United States)

    2010-01-01

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

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

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

    OpenAIRE

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

    2012-01-01

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

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

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

    Science.gov (United States)

    2011-01-19

    ... accordance with Sec. 305.3(a)(1), we published a notice \\2\\ in the Federal Register on August 25, 2010 (75 FR... 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...

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

    International Nuclear Information System (INIS)

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

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

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

    DEFF Research Database (Denmark)

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

    2011-01-01

    Aims: To investigate whether, in the treatment with chlordiazepoxide for outpatient alcohol withdrawal, there are advantages of symptom-triggered self-medication over a fixed-schedule regimen. Methods: A randomized controlled trial in outpatient clinics for people suffering from alcohol dependence...... (AD) and alcohol-related problems; 165 adult patients in an outpatient setting in a specialized alcohol treatment unit were randomized 1:1 to either a symptom-triggered self-medication or tapered dose, using chlordiazepoxide. Alcohol withdrawal symptoms, amount of medication, duration of symptoms...... the 1-year follow-up. Results: We found no differences in the quantity of medication consumed, time to relapse, well being or treatment satisfaction. Conclusion: Symptom-triggered self-medication was as safe as fixed-schedule medication in treating outpatients with AD and mild to moderate symptoms of...

  6. Design of Chronomodulated Drug Delivery System of Valsartan: In Vitro Characterization.

    Science.gov (United States)

    Sokar, M; Hanafy, A; Elkamel, A; El-Gamal, S

    2015-01-01

    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 reasonable lag time

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

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

    Indian Academy of Sciences (India)

    M Mathirajan; V Chandru; A I Sivakumar

    2007-10-01

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

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

  10. OPTIMISATION OF CHRONOMODULATED DOSAGE FORM FOR ASTHMA USING FULL FACTORIAL DESIGN

    Directory of Open Access Journals (Sweden)

    SARDA R.R

    2015-06-01

    Full Text Available Chronotherapy is growing treatment method in various diseases. Various diseases like asthma, hypertension, and arthritis show circadian variation, that demand time scheduled drug release for effective drug action. In Asthma like diseases which follow circadian rhythms, it is necessary to modulate the drug release in synchrony with the circadian rhythm of nocturnal asthma. Different polymers like Ethyl cellulose 10, 20, 45 cps, Compritol, Sodium alginate, Sodium CMC and LH-21 were tried. The combination of Eudragit RSPO and HPMC K4M was selected for the study based on lag time and release characteristics. On the basis of the trial batches and their evaluation parameters, concentrations of the polymers were decided and the 23 full factorial design was applied for the formulation of tablets. Lag time prior to drug release and cumulative percentage drug release at 3hrs and 6hrs were selected as responses. Results revealed that both, the coating composition and coating level, are significant factors affecting drug release profile.

  11. Radiation therapy for painful bone metastases. Aiming at optimal treatment schedules

    Energy Technology Data Exchange (ETDEWEB)

    Murakami, Ryuji; Saito, Ryuichi; Miyazaki, Toshiyuki [Kumamoto Red Cross Hospital (Japan); Takahashi, Mutsumasa

    2001-06-01

    The purpose of this study is to evaluate the pain relief obtained by radiation therapy for painful bone metastases, with a special regard to general condition. Between June 1998 and May 2000, 54 patients with 86 painful bone metastases were treated with radiation therapy whose effects could be evaluated for a minimum period of 6 months or until death. Treatment schedules were 3 Gy/fraction/day (30-36 Gy/10-12 fractions) in usual cases (61 lesions), 4-8 Gy/fraction/day (8-20 Gy/1-5 fractions) in patients with a poor general condition (9 lesions), and 2 Gy/fraction/day (40-50 Gy/20-25 fractions) in lesions with a large radiation field (16 lesions). Complete pain relief without medication (CR) was achieved in 40 lesions (47%). Significant predictors for CR were primary site (p=0.0003), performance status (p=0.0060), pain score (p=00190), narcotic score (p<0.0001), and prognosis (p<0.0001), but no difference was found in CR among treatment schedules. No evidence of severe radiation-induced complication was seen. General condition (performance status and prognosis) has an influence on pain relief. Compared with the daily 2 Gy protocol, the daily 3 Gy protocol has the advantage of shorter treatment time. The treatment schedule should be assessed in patients with a large radiation field and/or poor general condition. Especially for the patients with poor general condition, combined pain medication should be considered. (author)

  12. Methods to model and predict the ViewRay treatment deliveries to aid patient scheduling and treatment planning.

    Science.gov (United States)

    Liu, Shi; Wu, Yu; Wooten, H Omar; Green, Olga; Archer, Brent; Li, Harold; Yang, Deshan

    2016-01-01

    A software tool is developed, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance image-guided radiation therapy (MR-IGRT) delivery system. This tool is necessary for managing patient treatment scheduling in our clinic. The predicted treatment delivery time and the assessment of plan complexities could also be useful to aid treatment planning. A patient's total treatment delivery time, not including time required for localization, is modeled as the sum of four components: 1) the treatment initialization time; 2) the total beam-on time; 3) the gantry rotation time; and 4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected dose rate. To predict the remain-ing components, we retrospectively analyzed the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, linear regression is applied to predict the gantry rotation time. The MLC motion time is calculated using the leaves delay modeling method and the leaf motion speed. A quantitative analysis was performed to understand the correlation between the total treatment time and the plan complexity. The proposed algorithm is able to predict the ViewRay treatment delivery time with the average prediction error 0.22min or 1.82%, and the maximal prediction error 0.89 min or 7.88%. The analysis has shown the correlation between the plan modulation (PM) factor and the total treatment delivery time, as well as the treatment delivery duty cycle. A possibility has been identified to significantly reduce MLC motion time by optimizing the positions of closed MLC pairs. The accuracy of

  13. Combined modality treatment in fractionated schedules on the RIF-1 tumour

    International Nuclear Information System (INIS)

    A series of experiments was started to test several fractionation schedules of combined radiation and drug treatment. In combination with X-irradiation the following drugs were tested: actinomycin-D, adriamycin, 1,3-bis(2-chloroethyl)-1-nitrosourea (BCNU), bleomycin, Cis-diamminedichloro Platinum II (Cis-Pt) and cyclophosphamide. The endpoint was tumour growth delay, i.e., the number of days required for each tumour in the treated group to grow to 4x its volume on the day of treatment, diminished by the mean value for the untreated control group. The expected value for the combination was calculated by simple addition of the values for each modality alone, since both showed a linear dose-effect relationship. (Auth.)

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

    Directory of Open Access Journals (Sweden)

    Siegfried Segaert

    2009-08-01

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

  15. Literature analysis of high dose rate brachytherapy fractionation schedules in the treatment of cervical cancer: is there an optimal fractionation schedule?

    International Nuclear Information System (INIS)

    Purpose: A literature review and analysis was performed to determine whether or not efficacious high dose rate (HDR) brachytherapy fractionation schedules exist for the treatment of cervical cancer. Methods and Materials: English language publications from peer reviewed journals were assessed to calculate the total contribution of dose to Point A from both the external and intracavitary portions of radiation for each stage of cervical cancer. Using the linear quadratic formula, the biologically effective dose to the tumor, using an α/β = 10, was calculated to Point A (Gy10) in order to determine a dose response relationship for local control and survival. Significant complications were assessed by calculating the dose to the late-responding tissues at Point A using an α/β = 3 (Gy3) as a surrogate for normal tissue tolerance, since few publications list the actual bladder and rectal doses. Results: For all stages combined, the median external beam fractionation schedule to Point A was 40 Gy in 20 fractions, while the median HDR fractionation schedule was 28 Gy in 4 fractions. For stages IB, IIB, and IIIB the median biologically effective dose to Point A (Gy10) was 96, 96 and 100 Gy10s, respectively. No correlation was identified between Point A BED (Gy10s) to either survival or pelvic control. A dose response relationship could also not be identified when correlating Point A Gy3s to complications. Conclusion: A dose response relationship could not be identified for either tumor control nor late tissue complications. These findings do not necessarily question the validity of the linear quadratic model, as much as they question the quality of the current HDR brachytherapy literature as it is currently presented and reported. Most of the HDR publications report inadequate details of the dose fractionation schedules. Only a minority of publications report significant complications using the actuarial method. In the future, all HDR publications for the treatment of

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

    International Nuclear Information System (INIS)

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

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

    OpenAIRE

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

    2012-01-01

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

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

    Science.gov (United States)

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

    2012-12-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-12-01

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

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

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

    Science.gov (United States)

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

    2016-01-01

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

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

    International Nuclear Information System (INIS)

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

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

    OpenAIRE

    Siegfried Segaert

    2009-01-01

    Siegfried SegaertDepartment of Dermatology, University Hospital Leuven, BelgiumAbstract: Etanercept, a subcutaneously administered fully human soluble tumor necrosis factor (TNF) receptor, was initially approved for the treatment of psoriasis at a dose of 25 mg twice weekly in repeated 24-week cycles with the possibility to double the dose in the first 12 weeks of the first cycle. During intermittent treatment, patients retain their ability to respond to etanercept. Recently, a new dosing sch...

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

    Science.gov (United States)

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

    2016-01-01

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

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

    OpenAIRE

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

    2016-01-01

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

  6. Project scheduling

    International Nuclear Information System (INIS)

    Starting with commercial service of Dresden Unit 1 in 1960, Commonwealth Edison Company has assumed a major role in the commercial development of nuclear power. Seven units are now in operation and eight additional units are scheduled for service through the mid-1980's. To manage this large volume of construction, a project oriented management information system has been developed. The major elements of this system include a Budget and Cost Reporting System, a Field Cost Reporting System, and a Project Scheduling System. The paper deals with the Scheduling System. In spite of the traditional resistance to change, the scheduling system is on the road to acceptance. Using three distinct levels of scheduling detail, schedule information is obtained from all key departments and processed through the computer and an electrostatic plotter. Schedule reports are carefully designed for specific management levels

  7. Effect of treatment in fractionated schedules with the combination of x-irradiation and six cytotoxic drugs on the RIF-1 tumor and normal mouse skin

    International Nuclear Information System (INIS)

    RIF-1 tumors, implanted syngeneically in the gastrocnemius muscles of the right hind legs of C3H/Km mice, were treated either with X ray alone, drug alone, or drug and X ray combined. The drugs tested were bleomycin, BCNU, cis-diamminedichloro platinum, adriamycin, cyclophosphamide, and actinomycin-D. All drugs were administered either in the maximum tolerated dose or a dose that causes minimal tumor growth delay. Both drugs and X rays were administered either as a single dose or in five daily fractions. In addition to the single modality controls, seven different schedules of combined modalities were tested. Tumors were measured periodically after treatment in order that the day at which each tumor reached 4 times its initial cross-sectional area, i.e., its size at the time of treatment, could be determined. The effect of treatment on tumors was based upon excess growth delay (GD), i.e., T400% (treated)-T400% (untreated control). Treatment effects for the same combined modality schedules were also determined for normal skin, using the early skin reaction as an endpoint. Dose effect factors (DEF) were computed for all combined modality schedules and were based upon calculated radiation dose equivalents. We also calculated supra-additivity ratios, SR/sub I/ and SR/sub II/, therapeutic gain factors and adjusted therapeutic gain factors. The only drugs to produce significant supra-additivity with X rays were cis-Pt and cyclo

  8. Audit Schedule

    OpenAIRE

    Martinez Pinzon, Christian

    2014-01-01

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

  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; Mellerup, E.T.; Thomsen, C; Aggernæs, H; Henriksen, O

    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...... 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-depressive...... relapse during alternate-day lithium treatment is in our experience 3-fold greater than with daily treatment (atsimilar mean 12-h serum lithium concentration), the findings suggest that the difference in the prophylactic efficacy of the two dosing schedules is unrelated to differences in the 12-h brain...

  10. Chronomodulated press-coated pulsatile therapeutic system for aceclofenac: optimization of factors influencing drug release and lag time

    Directory of Open Access Journals (Sweden)

    et al

    2011-02-01

    Full Text Available Sumit Patil1, Swati Pund2, Amita Joshi2, Chamanlal J Shishoo2, Aliasgar Shahiwala11Department of Pharmaceutics, National Institute of Pharmaceutical Education and Research (NIPER, Ahmedabad, India; 2Department of Pharmaceutics, BV Patel PERD Centre, Ahmedabad, IndiaBackground: The objective of this study was to develop and evaluate a press-coated pulsatile drug delivery system intended for treatment of early morning stiffness and symptomatic relief from pain in patients with rheumatoid arthritis.Methods: The formulation involved press coating of a rupturable coat around a rapidly disintegrating core tablet of aceclofenac. A three-factor, two-level, full factorial design was used to investigate the influence of amount of glyceryl behenate, amount of sodium chloride in the coating composition, and the coating level on the responses, ie, lag time to release and amount of aceclofenac released in 450 minutes.Results: Glyceryl behenate and the coating level had a significant influence on lag time, while sodium chloride helped in the rupture of the coat by acting as a channeling agent. After the coat was ruptured, the core tablet showed a rapid release of aceclofenac due to the presence of Ac-Di-Sol®. Graphical analysis of effects by Lenth's method and Bayesian analysis of coefficients enabled identification of variables active on the selected responses. The optimized formulation comprised 20% w/w glyceryl behenate and 2.2% w/w sodium chloride with a 650 mg coating level, and showed a desired lag time of 358.23 minutes, which mimics the fluctuating symptoms of rheumatoid arthritis, followed by rapid release of aceclofenac.Keywords: chronotherapy, pulsatile delivery, rupturable coat, aceclofenac 

  11. Online scheduling

    Czech Academy of Sciences Publication Activity Database

    Pruhs, K.; Torng, E.; Sgall, Jiří

    Boca Raton: CRC Press, 2004, s. 1-41 R&D Projects: GA MŠk ME 103; GA MŠk ME 476; GA ČR GA201/01/1195; GA MŠk LN00A056; GA AV ČR IAA1019901 Institutional research plan: CEZ:AV0Z1019905 Keywords : online algorithms * scheduling Subject RIV: BA - General Mathematics

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-01-01

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

  13. Optimization and Scheduling Toolbox

    OpenAIRE

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

    2010-01-01

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

  14. Integrated Control and Scheduling

    OpenAIRE

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

    1999-01-01

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

  15. Alternative schedules or integration strategies to maximise treatment duration with sunitinib in patients with gastrointestinal stromal tumours

    OpenAIRE

    Saponara, Maristella; Lolli, Cristian; Nannini, Margherita; Di Scioscio, Valerio; SERRA, CARLA; Mandrioli, Anna; PALLOTTI, MARIA CATERINA; Biasco, Guido; Pantaleo, Maria Abbondanza

    2014-01-01

    Gastrointestinal stromal tumours (GISTs) are the most common mesenchymal tumour of the gastrointestinal tract. The advent of targeted kinase-inhibitors has revolutionised treatment strategies and clinical outcomes for patients with advanced GIST. In the majority of countries, sunitinib is the only approved second-line treatment option for advanced GIST patients, who are resistant or intolerant to imatinib. However, sunitinib is associated with various adverse events, which often result in a r...

  16. Widening the Schedulability Hierarchical Scheduling Systems

    OpenAIRE

    Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun; Larsen, Kim Guldstrand; Mikučionis, Marius; Nyman, Ulrik; Skou, Arne

    2015-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 computationcostly method (symbolic model checking). In order to analyze a hierar-chical sche...

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

    International Nuclear Information System (INIS)

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

  18. Scheduling (Dagstuhl Seminar 13111)

    OpenAIRE

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

    2013-01-01

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

  19. Operating System Process Schedulers

    OpenAIRE

    ŠEKORANJA, MATEJ

    2016-01-01

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

  20. Evolution of the National All Schedules Prescription Electronic Reporting Act (NASPER): a public law for balancing treatment of pain and drug abuse and diversion.

    Science.gov (United States)

    Manchikanti, Laxmaiah; Whitfield, Ed; Pallone, Frank

    2005-10-01

    In the United States, physicians are faced with two opposing dilemmas in the treatment of pain - the potential for drug abuse and diversion, and the possible undertreatment of pain. While controlled prescription drugs such as narcotic analgesics, anxiolytics, antidepressants, stimulants, and sedative-hypnotics, play a legitimate role in managing chronic pain and other conditions, the illicit use of prescribed medicines is increasing at epidemic proportions. Diversion and abuse of prescription drugs is costly in terms of addiction, overdose, death, and related criminal activities, but chronic pain carries significant economic, social, and health impact as well. The American Society of Interventional Pain Physicians (ASIPP), as the introducing organization, was joined by several physician and nurse practitioner organizations in support of the National All Schedules Prescription Electronic Reporting (NASPER) Act of 2005, legislation that not only will give physicians an information tool to aid in prescribing controlled substances but also will help identify illicit use and abuse. NASPER is the law that provides for the establishment of a controlled substances monitoring program in each state. The concept for NASPER originated with ASIPP and was modeled after the highly successful Kentucky All Schedules Prescription Electronic Reporting Program (KASPER). Legislation was introduced in the United States House of Representatives during three different Congresses, the 107th, 108th, and 109th, by Reps. Edward Whitfield (R-KY) and Frank Pallone (D-NJ). It was first introduced in the United States Senate in the 107th Congress by Sen. Tim Hutchinson (R-AK), and in the 108th and 109th by Sens. Jeff Sessions (R-AL) and Dick Durbin (D-IL), with multiple cosponsors in both chambers. NASPER passed the House on July 27, 2005, by voice vote and passed the Senate by unanimous consent on July 29, 2005. President George W. Bush signed NASPER on August 11, 2005, and it became Public Law

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

  2. 45 CFR 96.137 - Payment schedule.

    Science.gov (United States)

    2010-10-01

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

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

    International Nuclear Information System (INIS)

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

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

  5. Dedicated heterogeneous node scheduling including backfill scheduling

    Science.gov (United States)

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

    2006-07-25

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

  6. Childhood Immunization Schedule

    Science.gov (United States)

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

  7. Scheduling in polling systems

    OpenAIRE

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

    2007-01-01

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

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

  9. Scheduling PVM Tasks

    Institute of Scientific and Technical Information of China (English)

    鞠九滨; 王勇; 等

    1997-01-01

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

  10. Prediction of nonresponsiveness to medium-dose intravenous immunoglobulin (1 g/kg) treatment: an effective and safe schedule of acute treatment for Kawasaki disease

    Science.gov (United States)

    Moon, Kyung Pil; Kim, Beom Joon; Lee, Kyu Jin; Oh, Jin Hee; Han, Ji Whan; Lee, Kyung Yil

    2016-01-01

    Purpose Medium-dose (1 g/kg) intravenous immunoglobulin (IVIG) is effective in the majority of patients with Kawasaki disease (KD) but some patients who do not respond to medium-dose IVIG are at high risk for the development of coronary artery lesions (CALs). The purpose of this study was to identify the clinical predictors associated with unresponsiveness to medium-dose IVIG and the development of CALs. Methods A retrospective study was performed in 91 children with KD who were treated with medium-dose IVIG at our institution from January 2004 to December 2013. We classified the patients into responders (group 1; n=68) and nonresponders (group 2; n=23). We compared demographic, laboratory, and echocardiographic data between the 2 groups. Results Multivariate logistic regression analysis identified 6 variables as predictors for resistance to medium-dose IVIG. We generated a predictive scoring system assigning 1 point each for percentage of neutrophils ≥65%, C-reactive protein≥100 mg/L, aspartate aminotransferase≥100 IU/L, and alanine aminotransferase≥100 IU/L, as well as 2 points for less than 5 days of illness, and serum sodium level≤136 mmol/L. Using a cutoff point of ≥4 with this scoring system, we could predict nonresponsiveness to medium-dose IVIG with 74% sensitivity and 71% specificity. Conclusion If a patient has a low-risk score in this system, medium-dose IVIG can be recommended as the initial treatment. Through this process, we can minimize the adverse effects of high-dose IVIG and incidence of CALs.

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

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

  13. Automated telescope scheduling

    Science.gov (United States)

    Johnston, Mark D.

    1988-08-01

    With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art artificial intelligence software technology. What is especially interesting is that this effort has already yielded software that is well suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.

  14. Combinatory CPU Scheduling Algorithm

    OpenAIRE

    Saeeda Bibi; Farooque Azam*; Yasir Chaudhry

    2010-01-01

    Central Processing Unit (CPU) plays a significant role in computer system by transferring its control among different processes. As CPU is a central component, hence it must be used efficiently. Operating system performs an essential task that is known as CPU scheduling for efficient utilization of CPU. CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In this paper, a new CPU scheduling algorithm called Combinatory is proposed that combine...

  15. Flight Crew Scheduling

    OpenAIRE

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

    1993-01-01

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

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

  17. Block Scheduling Revisited.

    Science.gov (United States)

    Queen, J. Allen

    2000-01-01

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

  18. Range Scheduling Aid (RSA)

    Science.gov (United States)

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

    1991-01-01

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

  19. Trimester Schedule. Research Brief

    Science.gov (United States)

    Education Partnerships, Inc., 2012

    2012-01-01

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

  20. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

    Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily distribu...

  1. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

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

  2. DSN Resource Scheduling

    Science.gov (United States)

    Wang, Yeou-Fang; Baldwin, John

    2007-01-01

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

  3. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

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

  4. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

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

  5. Disk Scheduling: Selection of Algorithm

    OpenAIRE

    Yashvir, S.; Prakash, Om

    2012-01-01

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

  6. Fuzzy Priority CPU Scheduling Algorithm

    OpenAIRE

    Bashir Alam; M.N. Doja; R. Biswas; Mansaf Alam

    2011-01-01

    There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU scheduling algorithm has been proposed. This proposed algorithm improves the priority based CPU scheduling algorithm as obvious from simul...

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

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

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

  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. Physician Fee Schedule Search

    Data.gov (United States)

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

  12. Childhood Vaccine Schedule

    Science.gov (United States)

    ... Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... please turn Javascript on. When to Vaccinate What Vaccine Why Birth (or any age if not previously ...

  13. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

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

  14. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...... scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... 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...

  15. 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...... on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...

  16. Agent Based Patient Scheduling Using Heuristic Algorithm

    Directory of Open Access Journals (Sweden)

    Juliet A Murali

    2010-01-01

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

  17. Introduction to Scheduling

    CERN Document Server

    Robert, Yves

    2009-01-01

    Reviewing classical methods, realistic models, and algorithms, this book offers a through introduction to scheduling. Coverage includes fundamental concepts and basic methods, recent research, and applications with a special focus on distributed systems and computational grids. Other topics include online scheduling, stochastic task-resource systems, and platform models. Examples, theorems, and pedagogical proofs create an interactive learning format. Though rigorous, the book provides enough background to be self-contained and fully accessible to computer scientists, mathematicians, and resea

  18. Business Service Scheduling

    OpenAIRE

    Jürgen Dorn

    2010-01-01

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

  19. Decentralized Ground Staff Scheduling

    OpenAIRE

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the sta...

  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. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

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

  2. 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. Static Scheduling Strategies for Heterogeneous Systems

    OpenAIRE

    Olivier Beaumont; Arnaud Legrand; Yves Robert

    2012-01-01

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

  4. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    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...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care...

  5. Scheduling with genetic algorithms

    Science.gov (United States)

    Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

    1994-01-01

    In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

  6. Customer Appeasement Scheduling

    OpenAIRE

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

    2010-01-01

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

  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...... performance in the choice procedure was assessed daily. RESULTS: An intermediate dose of aripiprazole decreased cocaine self-administration and shifted the cocaine choice curve to the right as an acute treatment. However, as a chronic treatment, aripiprazole failed to decrease cocaine self-administration...... or cocaine choice, despite a dose-dependent decrease in overall response rates and food-maintained behavior. CONCLUSIONS: Our results confirm and extend earlier findings and indicate that acute administration of aripiprazole can decrease cocaine self-administration. However, based on the present data...

  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

    Science.gov (United States)

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

    2014-06-01

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

  10. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

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

  12. Schedulers are no Prophets

    NARCIS (Netherlands)

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

    2016-01-01

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

  13. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

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

  14. "Creative" Work Schedules.

    Science.gov (United States)

    Blai, Boris

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

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

    Science.gov (United States)

    2010-07-22

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

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

    Institute of Scientific and Technical Information of China (English)

    Zhi-gang GAO; Zhao-hui WU

    2008-01-01

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

  17. CPU Scheduling Algorithms: A Survey

    OpenAIRE

    Imran Qureshi

    2014-01-01

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

  18. Immunization Schedules for Infants and Children

    Science.gov (United States)

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

  19. Observation Scheduling System

    Science.gov (United States)

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

    2011-01-01

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

  20. RESCON: Educational project scheduling software

    OpenAIRE

    Deblaere, Filip; Demeulemeester, Erik; Herroelen, Willy

    2011-01-01

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

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

  2. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

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

  3. Surprise Benefits of Arena Scheduling

    Science.gov (United States)

    Surloff, Andrew

    2008-01-01

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

  4. Scheduling a C-Section

    Science.gov (United States)

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

  5. RT Level Test Scheduling

    OpenAIRE

    J. Blatný; Z. Kotásek; J. Hlavička

    2012-01-01

    The paper describes a new model of exploiting parallelism in testing of VLSI circuits. A circuit at the register transfer level is denoted as an RTL circuit. The model utilizes the concept of TACG (Test Application Conflict Graph). For the testing process the resource utilization model is defined and used for the TACG construction.  Different conflicts that must be taken into account during an RTL circuit test scheduling are presented. The problem of concurrent test application is transf...

  6. University employees work schedule

    OpenAIRE

    Basagoiti Alcázar, Javier

    2015-01-01

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

  7. Scheduled denoising autoencoders

    OpenAIRE

    Geras, Krzysztof J.; Sutton, Charles

    2014-01-01

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

  8. Scheduled Denoising Autoencoders

    OpenAIRE

    Geras, Krzysztof; Sutton, Charles

    2015-01-01

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

  9. 08071 Abstracts Collection -- Scheduling

    OpenAIRE

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

    2008-01-01

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

  10. 10071 Abstracts Collection -- Scheduling

    OpenAIRE

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

    2010-01-01

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

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

  12. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

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

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

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

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

    International Nuclear Information System (INIS)

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

  16. Airport Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Clausen, Tommy

    Modern airports are centers of transportation that service a large number of aircraft and passengers every day. To facilitate this large volume of transportation, airports are subject to many logistical and decision problems that must continuously be solved to make sure each flight and passenger...... ownership. As airports are in competition to attract airline routes, efficient and reliable ground handling operations are imperative for the viability and continued growth of both airports and airlines. The increasing liberalization of the ground handling market prompts ground handling operators to...... planning, to highly detailed scheduling problems arising in the highly dynamic environment of airports....

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

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

  19. A Feedback Macro- Scheduler

    Institute of Scientific and Technical Information of China (English)

    SamuelT.Chanson; PromS.Sinha

    1989-01-01

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

  20. Program cost and schedule baseline

    International Nuclear Information System (INIS)

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

  1. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

    the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for...... Predictable Java programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way....

  2. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

  4. Minimizing metastatic risk in radiotherapy fractionation schedules.

    Science.gov (United States)

    Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin

    2015-11-21

    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 [Formula: see text] values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger [Formula: see text] values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the [Formula: see text] 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. PMID:26509743

  5. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

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

  6. Scheduling Results for the THEMIS Observation Scheduling Tool

    Science.gov (United States)

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

    2011-01-01

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

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

    OpenAIRE

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

    2010-01-01

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

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

    Institute of Scientific and Technical Information of China (English)

    李莺; 姜通; 郭瑞松

    2012-01-01

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

  9. Angioblastic effect and toxicity of chronoradiotherapy of rectal cancer and cervical cancer

    International Nuclear Information System (INIS)

    The main content of the article presents an analysis of chronomodulated radio chemotherapy for malignant tumors of the pelvis, and demonstrates the practical value and the potential of these studies on the basis of personal, more than a decade, experience in using the chronomodulated mode in treatment of rectal cancer and cervical cancer. A conclusion was reached that chronomodulated radiochemotherapy is a modern, effective method of complex treatment of malignant tumors of the pelvis, which significantly improves the treatment results, allow-ing to increase the antitumoral effect on the tumor and reduce toxicity in all stages of the disease

  10. Scheduling participants of Assessment Centres

    DEFF Research Database (Denmark)

    Lysgaard, Jens; Løber, Janni

    assessors. The scheduling problem amounts to determining the allocation of participants to groups in each round. We have developed a model and solution approach for this particular scheduling problem, which may be viewed as a rather extensive generalization of the Social Golfer Problem....

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

  12. 21 CFR 1308.13 - Schedule III.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.13 Schedule III. (a) Schedule III shall consist of the drugs and other substances,...

  13. 21 CFR 1308.15 - Schedule V.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.15 Schedule V. (a) Schedule V shall consist of the drugs and other substances, by...

  14. A comparative evaluation of radiation schedules in keloids

    International Nuclear Information System (INIS)

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

  15. Asynchronous Distributed Searchlight Scheduling

    CERN Document Server

    Obermeyer, Karl J; Bullo, Francesco

    2011-01-01

    This paper develops and compares two simple asynchronous distributed searchlight scheduling algorithms for multiple robotic agents in nonconvex polygonal environments. A searchlight is a ray emitted by an agent which cannot penetrate the boundary of the environment. A point is detected by a searchlight if and only if the point is on the ray at some instant. Targets are points which can move continuously with unbounded speed. The objective of the proposed algorithms is for the agents to coordinate the slewing (rotation about a point) of their searchlights in a distributed manner, i.e., using only local sensing and limited communication, such that any target will necessarily be detected in finite time. The first algorithm we develop, called the DOWSS (Distributed One Way Sweep Strategy), is a distributed version of a known algorithm described originally in 1990 by Sugihara et al \\cite{KS-IS-MY:90}, but it can be very slow in clearing the entire environment because only one searchlight may slew at a time. In an ...

  16. AP1000 construction schedule

    International Nuclear Information System (INIS)

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

  17. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  18. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

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

  20. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

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

    2011-01-01

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

  1. When greediness fails: Examples from stochastic scheduling

    OpenAIRE

    Uetz, Marc

    2002-01-01

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

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

  3. A holonic approach to dynamic manufacturing scheduling

    OpenAIRE

    Francisco José de Oliveira Restivo; Paulo Leitão

    2008-01-01

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

  4. Immunization Schedules for Preteens and Teens

    Science.gov (United States)

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

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

  6. Scheduling Spitzer: The SIRPASS Story

    Science.gov (United States)

    Mittman, David S.; Hawkins, Robert

    2013-01-01

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

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

  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. Smart schedules streamline distribution maintenance

    OpenAIRE

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

    1998-01-01

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

  10. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact with...... these displays using their mobile devices by either constructing custom video playlists or adding on-screen content to their personal schedule....

  11. Solving Public Transit Scheduling Problems

    OpenAIRE

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

    2008-01-01

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

  12. 77 FR 64848 - Proposed Collection; Comment Request for Form 1120S, Schedule D, Schedule K-1, and Schedule M-3

    Science.gov (United States)

    2012-10-23

    ... Internal Revenue Service Proposed Collection; Comment Request for Form 1120S, Schedule D, Schedule K-1, and Schedule M-3 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and request for comments... Form 1120S, U.S. Income Tax Return for an S Corporation, Schedule D (Form 1120S), Capital Gains...

  13. Flexible Scheduling to Fit the Firefighters.

    Science.gov (United States)

    Cox, Clarice Robinson

    Three flexible scheduling plans were tried in order that firefighters could take regular college courses despite their 24 hours on the 24 off work schedule. Plan one scheduled the firefighters into a regular Monday-Wednesday-Friday class which they attended every other week, making up missed material outside of class. Plan two scheduled special…

  14. Distributed Greedy Scheduling for Multihop Wireless Networks

    OpenAIRE

    Sunny, Albert; Kuri, Joy

    2010-01-01

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

  15. 40 CFR 142.55 - Final schedule.

    Science.gov (United States)

    2010-07-01

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

  16. 17 CFR 257.2 - Schedule.

    Science.gov (United States)

    2010-04-01

    ... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Schedule. 257.2 Section 257.2... COMPANIES § 257.2 Schedule. Schedule of Records Retention Periods Description of records Retention period...) Schedules for recurring journal entries 6 years after settlement. Destroy when superseded if not a part of...

  17. 12 CFR 229.12 - Availability schedule.

    Science.gov (United States)

    2010-01-01

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

  18. 14 CFR 1214.109 - Scheduling.

    Science.gov (United States)

    2010-01-01

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

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

  20. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

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

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

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

    OpenAIRE

    Husbands, Philip

    1995-01-01

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

  3. Support system for process flow scheduling

    OpenAIRE

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

    2001-01-01

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

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

    Science.gov (United States)

    2013-04-12

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

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

  6. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

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

  7. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

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

  8. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

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

  9. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption and....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

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

  11. Enhanced Memetic Algorithm for Task Scheduling

    Science.gov (United States)

    Padmavathi, S.; Shalinie, S. Mercy; Someshwar, B. C.; Sasikumar, T.

    Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelization. Due to the NP-hardness of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. This paper proposes a Memetic algorithm with Tabu search and Simulated Annealing as local search for solving Task scheduling problem considering communication contention. This problem consists of finding a schedule for a general task graph to be executed on a cluster of workstations and hence the schedule length can be minimized. Our approach combines local search (by self experience) and global search (by neighboring experience) possessing high search efficiency. The proposed approach is compared with existing list scheduling heuristics. The numerical results clearly indicate that our proposed approach produces solutions which are closer to optimality and/or better quality than the existing list scheduling heuristics.

  12. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest 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

  13. MULTI-SHOP SCHEDULING PROBLEM

    Institute of Scientific and Technical Information of China (English)

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

    2007-01-01

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

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

  15. Non-clairvoyant Scheduling Games

    CERN Document Server

    Cohen, Johanne; Thang, Nguyen Kim

    2011-01-01

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

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

  17. Flexible Schedules and Shift Work.

    Science.gov (United States)

    Beers, Thomas M.

    2000-01-01

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

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

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

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

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

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

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

  4. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  5. Slide Rule For Calculating Curing Schedules

    Science.gov (United States)

    Heater, Don

    1995-01-01

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

  6. Automated Scheduling for NASA's Deep Space Network

    OpenAIRE

    Johnston, Mark D.; Jet Propulsion Laboratory, California Institute of Technology; Tran, Daniel; Jet Propulsion Laboratory, California Institute of Technology; Arroyo, Belinda; Jet Propulsion Laboratory, California Institute of Technology; Sorensen, Sugi; Jet Propulsion Laboratory, California Institute of Technology; Tay, Peter; Jet Propulsion Laboratory, California Institute of Technology; Carruth, Butch; Innovative Productivity Solutions, Inc.; Coffman, Adam; Innovative Productivity Solutions, Inc.; Wallace, Mike; Innovative Productivity Solutions, Inc.

    2014-01-01

    This article describes the DSN scheduling wngine (DSE) component of a new scheduling system being deployed for NASA's deep space network. The DSE provides core automation functionality for scheduling the network, including the interpretation of scheduling requirements expressed by users, their elaboration into tracking passes, and the resolution of conflicts and constraint violations. The DSE incorporates both systematic search and repair-based algorithms, used for different phases and purpos...

  7. DAS: Intelligent Scheduling Systems for Shipbuilding

    OpenAIRE

    Lee, Jae Kyu; Lee, Kyoung Jun; Hong, June Seok; Kim, Wooju; Kim, Eun Young; Choi, Soo Yeoul; Kim, Ho Dong; Yang, Ok Ryul; Choi, Hyung Rim

    1995-01-01

    Daewoo Shipbuilding Company, one of the largest shipbuilders in the world, has experienced great deal of trouble with the planning and scheduling of its production process. To solve the problems, from 1991 to 1993, Korea Advanced Institute of Science and Technology (KAIST) and Daewoo jointly conducted the Daewoo Shipbuilding Scheduling (das) Project. To integrate the scheduling expert systems for shipbuilding, we used a hierarchical scheduling architecture. To automate the dynamic spatial lay...

  8. Hitting Families of Schedules for Asynchronous Programs

    OpenAIRE

    Chistikov, Dmitry; Majumdar, Rupak; Niksic, Filip

    2016-01-01

    Asynchronous programming is a ubiquitous idiom for concurrent programming, where sequential units of code, called events, are scheduled and run atomically by a scheduler. While running, an event can post additional events for future execution by the scheduler. Asynchronous programs can have subtle bugs due to the non-deterministic scheduling of events, and a lot of recent research has focused on systematic testing of these programs. Empirically, many bugs in asynchronous programs have small b...

  9. 16 CFR 1203.13 - Test schedule.

    Science.gov (United States)

    2010-01-01

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

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

  11. Stimulus generalization of schedule-induced polydipsia

    OpenAIRE

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

    1981-01-01

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

  12. Dynamic scheduling. State of the art report.

    OpenAIRE

    Kocjan, Waldemar

    2002-01-01

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

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

  14. Distributed Scheduling Extension on Hadoop

    Science.gov (United States)

    Dadan, Zeng; Xieqin, Wang; Ningkang, Jiang

    Distributed computing splits a large-scale job into multiple tasks and deals with them on clusters. Cluster resource allocation is the key point to restrict the efficiency of distributed computing platform. Hadoop is the current most popular open-source distributed platform. However, the existing scheduling strategies in Hadoop are kind of simple and cannot meet the needs such as sharing the cluster for multi-user, ensuring a concept of guaranteed capacity for each job, as well as providing good performance for interactive jobs. This paper researches the existing scheduling strategies, analyses the inadequacy and adds three new features in Hadoop which can raise the weight of job temporarily, grab cluster resources by higher-priority jobs and support the computing resources share among multi-user. Experiments show they can help in providing better performance for interactive jobs, as well as more fairly share of computing time among users.

  15. 40 CFR 141.702 - Sampling schedules.

    Science.gov (United States)

    2010-07-01

    ... Monitoring Requirements § 141.702 Sampling schedules. (a) Systems required to conduct source water monitoring under § 141.701 must submit a sampling schedule that specifies the calendar dates when the system will...) Systems must submit sampling schedules for the second round of source water monitoring § 141.701(b) to...

  16. Practical scheduling of computer vision functions

    OpenAIRE

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

    2016-01-01

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

  17. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  18. 42 CFR 412.610 - Assessment schedule.

    Science.gov (United States)

    2010-10-01

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

  19. 10 CFR 30.71 - Schedule B.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false Schedule B. 30.71 Section 30.71 Energy NUCLEAR REGULATORY COMMISSION RULES OF GENERAL APPLICABILITY TO DOMESTIC LICENSING OF BYPRODUCT MATERIAL Schedules § 30.71 Schedule B. Byproduct material Microcuries Antimony 122 (Sb 122) 100 Antimony 124 (Sb 124) 10 Antimony...

  20. 42 CFR 447.76 - Public schedule.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Public schedule. 447.76 Section 447.76 Public... Cost Sharing Under Section 1916a § 447.76 Public schedule. (a) The State must make available to the groups in paragraph (b) of this section a public schedule that contains the following information:...

  1. 29 CFR 1952.351 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  2. 42 CFR 441.58 - Periodicity schedule.

    Science.gov (United States)

    2010-10-01

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

  3. 29 CFR 1952.91 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  4. 44 CFR 5.46 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Fee schedule. 5.46 Section 5... SECURITY GENERAL PRODUCTION OR DISCLOSURE OF INFORMATION Fees § 5.46 Fee schedule. (a) Manual searches for... schedule programs, such as but not limited to the Government Printing Office or the National...

  5. 10 CFR 2.1026 - Schedule.

    Science.gov (United States)

    2010-01-01

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

  6. 40 CFR 63.1102 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

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

  7. 28 CFR 802.10 - Fee schedule.

    Science.gov (United States)

    2010-07-01

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

  8. 29 CFR 1952.161 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  9. 29 CFR 1952.101 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  10. 49 CFR 7.43 - Fee schedule.

    Science.gov (United States)

    2010-10-01

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

  11. 76 FR 54408 - Regulatory Review Schedule

    Science.gov (United States)

    2011-09-01

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

  12. 14 CFR 415.121 - Launch schedule.

    Science.gov (United States)

    2010-01-01

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

  13. 29 CFR 1952.111 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  14. 42 CFR 457.525 - Public schedule.

    Science.gov (United States)

    2010-10-01

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

  15. 29 CFR 1952.231 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  16. 76 FR 57683 - Regulatory Review Schedule

    Science.gov (United States)

    2011-09-16

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

  17. 40 CFR 63.1401 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

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

  18. 10 CFR 33.100 - Schedule A.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false Schedule A. 33.100 Section 33.100 Energy NUCLEAR REGULATORY COMMISSION SPECIFIC DOMESTIC LICENSES OF BROAD SCOPE FOR BYPRODUCT MATERIAL Schedules § 33.100 Schedule A. Byproduct material Col. I curies Col. II curies Antimony-122 1 0.01 Antimony-124 1 .01...

  19. 6 CFR 27.210 - Submissions schedule.

    Science.gov (United States)

    2010-01-01

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

  20. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

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

  1. 76 FR 26967 - Regulatory Review Schedule

    Science.gov (United States)

    2011-05-10

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

  2. A Hybrid Task Scheduling Algorithm in Grid

    Institute of Scientific and Technical Information of China (English)

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

    2006-01-01

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

  3. 76 FR 33181 - Regulatory Review Schedule

    Science.gov (United States)

    2011-06-08

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

  4. 29 CFR 1952.151 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  5. 29 CFR 1952.123 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  6. 29 CFR 1952.221 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  7. 7 CFR 58.440 - Make schedule.

    Science.gov (United States)

    2010-01-01

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

  8. 49 CFR 665.21 - Scheduling.

    Science.gov (United States)

    2010-10-01

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

  9. 21 CFR 1308.49 - Emergency scheduling.

    Science.gov (United States)

    2010-04-01

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

  10. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

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

  11. Operational schedule 2011 & potential performance

    CERN Document Server

    Meddahi, M

    2011-01-01

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

  12. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

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

  13. Broadcast scheduling for mobile advertising

    OpenAIRE

    De Reyck, B; Degraeve, Z.

    2003-01-01

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

  14. Open problems in throughput scheduling

    Czech Academy of Sciences Publication Activity Database

    Sgall, Jiří

    Berlin : Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 2-11 ISBN 978-3-642-33089-6. - (Lecture Notes in Computer Science. 7501). [20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012] R&D Projects: GA AV ČR IAA100190902 Keywords : problem complexity * scheduling Subject RIV: BA - General Mathematics http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_2

  15. Preemptive scheduling in overloaded systems

    Czech Academy of Sciences Publication Activity Database

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

    Berlin: SpringerVerlag, 2002, s. 800-811. [International Colloquium on Automata, Languages , and Programming /29./. Malaga (ES), 08.07.2002-13.07.2002] R&D Projects: GA MŠk LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠk ME 476 Keywords : scheduling * online algorithms * benefit Subject RIV: BA - General Mathematics

  16. Dynamic Scheduling on Grid Environments

    OpenAIRE

    Bertogna, Mario Leandro

    2010-01-01

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

  17. 49 CFR Schedule C to Subpart B of... - Schedule C to Subpart B of Part 1139

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 8 2010-10-01 2010-10-01 false Schedule C to Subpart B of Part 1139 C Schedule C... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. C Schedule C to Subpart B of Part 1139 Attachment 1 Schedule C Part I—Condensed Income Statement () Greyhound Lines, Inc.()Trailways combined()...

  18. 49 CFR Schedule D to Subpart B of... - Schedule D to Subpart B of Part 1139

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 8 2010-10-01 2010-10-01 false Schedule D to Subpart B of Part 1139 D Schedule D... REVENUE PROCEEDINGS Intercity Bus Industry Pt. 1139, Subpt. B, Sch. D Schedule D to Subpart B of Part 1139... operations See explanatory 1 Show average of beginning and end-of-year figures. Explanatory—Schedule D...

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

    Science.gov (United States)

    2010-07-01

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

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

    Science.gov (United States)

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

    2016-05-01

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

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

    Directory of Open Access Journals (Sweden)

    A.Neela Madheswari

    2013-09-01

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

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

    Institute of Scientific and Technical Information of China (English)

    Cheng Ting; He Zishu; Tang Ting

    2008-01-01

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

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

  4. Application of workflow technology for workshop scheduling

    Institute of Scientific and Technical Information of China (English)

    ZHOU Wan-kun; ZHU Jian-ying

    2005-01-01

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

  5. Scheduler Design Criteria: Requirements and Considerations

    Science.gov (United States)

    Lee, Hanbong

    2016-01-01

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

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

    OpenAIRE

    Cahill, Laurie; Bailey, Linda

    1988-01-01

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

  7. Schedule-induced defecation by rats during ratio and interval schedules of food reinforcement.

    OpenAIRE

    Wylie, A M; Layng, M P; Meyer, K A

    1993-01-01

    Lever pressing in rats was maintained by continuous and intermittent schedules of food while defecation was monitored. In Experiment 1, reinforcement densities were matched across variable-ratio and variable-interval schedules for three pairs of rats. Defecation occurred in all 3 rats on the variable-ratio schedule and in all 3 rats on the yoked variable-interval schedule. In Experiment 2, fixed-ratio and fixed-interval schedules with similar reinforcement densities maintained lever pressing....

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

    OpenAIRE

    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 criteria (number of hardware resources, latency, register life time) at the same time that a rate-optimal solution is guaranteed. An algorithm based on this approach is introduced. It can schedule cycli...

  9. EOS distributed planning and scheduling prototype

    Science.gov (United States)

    Hull, Larry G.; Peters, Stephen F.; Davis, Randy

    Some of the more significant lessons learned during the development of the Earth Observing System (EOS) Distributed Planning and Scheduling Prototype are presented. The need for a central scheduler is not demonstrated. A mapping of scheduling and conflict-resolution responsibility across the nodes of the EOS distributed scheduling system is developed and shown to be both feasible and appropriate. Complex instrument scheduling is mostly accomplished at the ICC/IST (instrument control center/instrumental support terminal) with 'slidable' flexibility for slews and some kinds of calibrations resolved at the EOS Operations Center (EOC). All nodes have full visibility interinstrument contention for resource and environmental rights, e.g., vibration, thermal, and electromagnetic. The EOC assigns, by activity, initial action responsibility for conflict resolution to a node which is party to the conflict. Most interinstrument conflicts are resolved by the ICCs and ISTs during an intermediate scheduling phase while the EOC is negotiating a TDRS schedule with the NCC.

  10. Routine environmental monitoring schedule, calendar year 1995

    International Nuclear Information System (INIS)

    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

  11. Scheduled Caste Women: Problems And Challenges

    Directory of Open Access Journals (Sweden)

    Vijayakumar Murthy

    2013-12-01

    Full Text Available The paper analyzed the Caste system based on Varnas during the ancient India. It also examined the demerits of caste attached to the present scheduled castes in general and scheduled caste women in particular. The scheduled caste women are disadvantaged by their caste and gender and as such they are subject to exploitation and discrimination by their family members, by their caste people and by forward castes. Hence, there is increase in exploitation, discrimination and violence against the scheduled caste women. The female feticide, illiteracy, gender inequality, Devadasi, Jogini practice, Nude Service to Deity, different types of violence, dowry, child marriage, etc are few of the problems faced by scheduled caste women in present society. Statistics of the violence acts against the scheduled caste women is discussed in the paper and there is need to strictly enforce the legislations passed to protect the violence against scheduled caste women. For this purpose, there is need of enquiry from lady police officials.

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

    International Nuclear Information System (INIS)

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

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

  14. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    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

  15. Schedule optimization study implementation plan

    International Nuclear Information System (INIS)

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

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

    Directory of Open Access Journals (Sweden)

    Marcu Loredana

    2009-01-01

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

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

  18. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

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

  19. Dynamic Proportional Share Scheduling in Hadoop

    Science.gov (United States)

    Sandholm, Thomas; Lai, Kevin

    We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mechanism allows the scheduler to make more efficient decisions about which jobs and users to prioritize and gives users the tool to optimize and customize their allocations to fit the importance and requirements of their jobs. Additionally, it gives users the incentive to scale back their jobs when demand is high, since the cost of running on a slot is then also more expensive. We envision our scheduler to be used by deadline or budget optimizing agents on behalf of users. We describe the design and implementation of the DP scheduler and experimental results. We show that our scheduler enforces service levels more accurately and also scales to more users with distinct service levels than existing schedulers.

  20. Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru; Peng, Zebo

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

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

  2. Phase I dose-escalation and pharmacokinetic study of ispinesib, a kinesin spindle protein inhibitor, administered on days 1 and 15 of a 28-day schedule in patients with no prior treatment for advanced breast cancer.

    Science.gov (United States)

    Gomez, Henry L; Philco, Manuel; Pimentel, Patricia; Kiyan, Miriam; Monsalvo, Maria Laura; Conlan, Maureen G; Saikali, Khalil G; Chen, Michael M; Seroogy, Joseph J; Wolff, Andrew A; Escandon, Rafael D

    2012-03-01

    The objective of the study was to evaluate the safety, pharmacokinetics, and antitumor activity of ispinesib, a kinesin spindle protein inhibitor. Patients with locally advanced or metastatic breast cancer who had received only prior neoadjuvant or adjuvant chemotherapy were treated with escalating doses of ispinesib administered as a 1-h infusion on days 1 and 15 every 28 days until toxicity or progression of disease. Doses were escalated until dose-limiting toxicity was observed in two out of six patients during cycle 1. A total of 16 patients were treated at three dose levels: 10 mg/m (n=3), 12 mg/m (n=6), and 14 mg/m (n=7). Forty-four percent of the patients had locally advanced disease and 56% had metastatic disease; 50% were estrogen receptor positive, 44% were progesterone receptor positive, 25% human epidermal growth factor 2 were positive, and 31% triple (estrogen receptor, progesterone receptor, human epidermal growth factor 2) negative. Sixty-nine percent of patients were chemo-naive. The maximum tolerated dose was 12 mg/m and dose-limiting toxicity was grade 3 increased aspartate aminotransferase and alanine aminotransferase. The most common toxicities included neutropenia (88%; 38% grade 3 and 44% grade 4), increased alanine aminotransferase (56%), anemia (38%), increased aspartate aminotransferase (31%), and diarrhea (31%). No neuropathy, mucositis, or alopecia was reported. Among the 15 patients evaluable for antitumor activity, there were three partial responses, one confirmed by the response evaluation criteria in solid tumors (7% response rate). Nine patients (60%) had stable disease lasting at least 42 days, with four (27%) lasting for at least 90 days. Disease stabilization (partial responses+stable disease) was observed in 11 (73.3%) patients. In conclusion, ispinesib was well tolerated when administered on days 1 and 15 every 28 days. Limited activity was observed with this schedule in patients with previously untreated advanced breast cancer

  3. Distributed Implementation of SIGNAL: Scheduling & Graph Clustering

    OpenAIRE

    Maffeis, Olivier; Le Guernic, Paul

    1994-01-01

    This paper introduces the scheduling strategy and some key tools which have been designed for the distributed implementation of Signal, a real-time synchronous dataflow language. First, we motivate a scheduling strategy with respect to the reactivity and time-predictability requirements bound to real-time computing. Then, several key tools to implement this scheduling strategy are described. These tools are acting on the concept of Synchronous-Flow Dependence Graph (SFD Graph) which defines a...

  4. Scheduled Caste Women: Problems And Challenges

    OpenAIRE

    Vijayakumar Murthy; Jaikishan Thakur

    2013-01-01

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

  5. Integrated Control and Real-Time Scheduling

    OpenAIRE

    Cervin, Anton

    2003-01-01

    The topic of the thesis is codesign of flexible real-time control systems. Integrating control theory and real-time scheduling theory, it is possible to achieve higher resource utilization and better control performance. The integration requires new tools for analysis, design, and implementation. The problem of scheduling the individual parts of a control algorithm is studied. It is shown how subtask scheduling can reduce the input-output latency in a set of control tasks. Deadline ass...

  6. Scheduling under non-reversible energy sources

    OpenAIRE

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

    2016-01-01

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

  7. Faster annealing schedules for quantum annealing

    OpenAIRE

    Morita, Satoshi

    2007-01-01

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

  8. Resupply Scheduler Program Using Integer Optimization

    Science.gov (United States)

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

    1994-01-01

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

  9. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    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

  10. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    OpenAIRE

    Ladislav Rosocha; Silvia Vernerova; Robert Verner

    2015-01-01

    Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem. Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a...

  11. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    OpenAIRE

    Ladislav Rosocha; Silvia Vernerova; Robert Verner

    2015-01-01

    Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a ...

  12. An Efficient SJRR CPU Scheduling Algorithm

    OpenAIRE

    Saeeda Bibi; Farooque Azam*; Sameera Amjad; Wasi Haider Butt; Hina Gull; Rashid Ahmed

    2010-01-01

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

  13. Combining robustness and recovery for airline schedules

    OpenAIRE

    Eggenberg, Niklaus

    2009-01-01

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

  14. Stochastic Scheduling of Heavy-tailed Jobs

    OpenAIRE

    Im, Sungjin; Moseley, Benjamin; Pruhs, Kirk

    2015-01-01

    We revisit the classical stochastic scheduling problem of nonpreemptively scheduling n jobs so as to minimize total completion time on m identical machines, P mid mid mathbb{E} sum C_j in the standard 3-field scheduling notation. Previously it was only known how to obtain reasonable approximation if jobs sizes have low variability. However, distributions commonly arising in practice have high variability, and the upper bounds on the approximation ratio for the previous algorithms for such di...

  15. Conjoint schedules of timeout deletion in pigeons.

    OpenAIRE

    Hackenberg, T D

    1992-01-01

    This experiment attempted to bring behavior under joint control of two distinct contingencies, one that provided food and a second that extended the periods during which that food was available. Pigeons' responses on each of two keys were reinforced according to a single random-interval schedule of food presentation except during signaled timeout periods during which the schedule was temporarily disabled. By means of a conjoint schedule, responses on the initially less preferred key not only ...

  16. Efficient generation of rotating workforce schedules

    OpenAIRE

    Musliu, Nysret; Gaertner, Johannes; Slany, Wolfgang

    2000-01-01

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

  17. Solving Project Scheduling Problems by Minimum Cut

    OpenAIRE

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

    2002-01-01

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

  18. Annual Scheduling of Atlantic Fleet Surface Combatants

    OpenAIRE

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

    1990-01-01

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

  19. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    OpenAIRE

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

    2010-01-01

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

  20. A hybrid job-shop scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  1. Scheduler Vulnerabilities and Attacks in Cloud Computing

    OpenAIRE

    Zhou, Fangfei; Goel, Manish; 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. Recen...

  2. Optimization of radiation dosing schedules for proneural glioblastoma.

    Science.gov (United States)

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

    2016-04-01

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

  3. AVLIS production plant project schedule and milestones

    International Nuclear Information System (INIS)

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

  4. Scheduling By Using Fuzzy Logic in Manufacturing

    Directory of Open Access Journals (Sweden)

    Miss. Ashwini. A. Mate

    2014-07-01

    Full Text Available This paper represents the scheduling process in furniture manufacturing unit. It gives the fuzzy logic application in flexible manufacturing system. Flexible manufacturing systems are production system in furniture manufacturing unit. FMS consist of same multipurpose numerically controlled machines. Here in this project the scheduling has been done in FMS by using fuzzy logic tool in Matlab software. The fuzzy logic based scheduling model in this paper will deals with the job and best alternative route selection with multi-criteria of machine. Here two criteria for job and sequencing and routing with rules. This model is applicable to the scheduling of any manufacturing industry.

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

  6. The delivery commitment schedule process

    Energy Technology Data Exchange (ETDEWEB)

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

    1991-01-01

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

  7. The delivery commitment schedule process

    Energy Technology Data Exchange (ETDEWEB)

    Vance, S.A.

    1991-07-01

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

  8. CASSIUS: The Cassini Uplink Scheduler

    Science.gov (United States)

    Bellinger, Earl

    2012-01-01

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

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

    OpenAIRE

    Oostrum, van, I.E.A.; Houdenhoven, van, Mark; 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 the construction of operating room schedules. In addition, unbalanced scheduling of the operating room department often causes demand fluctuation at succeeding departments such as wards and the inte...

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

    OpenAIRE

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

    1986-01-01

    Schedule sensitivity has usually been examined either through a multiple schedule or through changes in schedules after steady-state responding has been established. This study compared the effects of these two procedures when various instructions were given. Fifty-five college students responded in two 32-min sessions under a multiple fixed-ratio 18/differential-reinforcement-of-low-rate 6-s schedule, followed by one session of extinction. Some subjects received no instructions regarding the...

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

    OpenAIRE

    Williams, Ben A.

    1981-01-01

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

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

    OpenAIRE

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

    2013-01-01

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

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

    OpenAIRE

    Attri, Hitesh

    2005-01-01

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

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

    Science.gov (United States)

    2010-04-01

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

  15. Scheduling Sanity in the Elementary Schools.

    Science.gov (United States)

    Curatilo, Joseph S.

    1983-01-01

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

  16. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    since the real contribution of the method is a new performance measure, other implementations could be based on tabu search, simulated annealing or other powerful “blind” optimisation heuristics. The other method for stochastic scheduling uses the idea of coevolution to create schedules with a...

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

  18. Clustering and scheduling maintenance tasks over time

    OpenAIRE

    Kreuger, Per

    2008-01-01

    We report results on a maintenance scheduling problem. The problem consists of allocating maintenance task instances to and scheduling the performances of a suitable number of maintenance packages. The number of maintenance packages is not fixed, nor is, in general, the dates or durations of their performances. A constraint programming (CP) model and solver for the problem is presented together with preliminary computational results.

  19. Optimal online-list batch scheduling

    OpenAIRE

    Paulus, JJ Jacob Jan; Ye, Deshi; Zhang, G.

    2008-01-01

    We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

  20. 46 CFR 525.2 - Terminal schedules.

    Science.gov (United States)

    2010-10-01

    ... domestic law and international conventions and agreements adopted by the United States; such terminal... terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule that... paragraph (b)(2) of this section, this part does not apply to bulk cargo, forest products, recycled...

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

  2. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

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

  3. 40 CFR 155.25 - Schedule.

    Science.gov (United States)

    2010-07-01

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

  4. 21 CFR 1308.14 - Schedule IV.

    Science.gov (United States)

    2010-04-01

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

  5. 36 CFR 902.82 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Fee schedule. 902.82 Section 902.82 Parks, Forests, and Public Property PENNSYLVANIA AVENUE DEVELOPMENT CORPORATION FREEDOM OF INFORMATION ACT Fees § 902.82 Fee schedule. (a) Definitions. For purposes of this section— (1) A...

  6. 29 CFR 1952.261 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  7. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  8. 29 CFR 1952.211 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  9. 21 CFR 1308.12 - Schedule II.

    Science.gov (United States)

    2010-04-01

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

  10. 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... PROCESSING MAP CHANGES § 72.3 Fee schedule. (a) For requests for CLOMRs, LOMRs, and PMRs based on...

  11. 40 CFR 63.521 - Compliance schedule.

    Science.gov (United States)

    2010-07-01

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

  12. Scheduling Algorithm for Complex Product Development

    Institute of Scientific and Technical Information of China (English)

    LIUMin; ZHANGLong; WUCheng

    2004-01-01

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

  13. 49 CFR 224.107 - Implementation schedule.

    Science.gov (United States)

    2010-10-01

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

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

  15. 7 CFR 3011.6 - Fee schedule.

    Science.gov (United States)

    2010-01-01

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

  16. 29 CFR 1952.201 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

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

  17. 49 CFR 10.75 - Fee schedule.

    Science.gov (United States)

    2010-10-01

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

  18. 45 CFR 5.43 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Fee schedule. 5.43 Section 5.43 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION FREEDOM OF INFORMATION REGULATIONS Fees § 5.43 Fee schedule. HHS charges the following fees: (a) Manual searching for or reviewing of...

  19. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

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

  20. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Preferential scheduling. 700.14 Section 700.14 Commerce and Foreign Trade Regulations Relating to Commerce and Foreign Trade (Continued... DEFENSE PRIORITIES AND ALLOCATIONS SYSTEM Industrial Priorities § 700.14 Preferential scheduling. (a)...

  1. Quarterly report on program cost and schedule

    International Nuclear Information System (INIS)

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

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

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

    Science.gov (United States)

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

    2010-12-01

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

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

  5. The EUVE proposal database and scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  6. Improved utilization and responsiveness with gang scheduling

    Energy Technology Data Exchange (ETDEWEB)

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

    1996-10-01

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

  7. Feedback Scheduling: An Event-Driven Paradigm

    CERN Document Server

    Xia, Feng; Sun, Youxian

    2008-01-01

    Embedded computing systems today increasingly feature resource constraints and workload variability, which lead to uncertainty in resource availability. This raises great challenges to software design and programming in multitasking environments. In this paper, the emerging methodology of feedback scheduling is introduced to address these challenges. As a closed-loop approach to resource management, feedback scheduling promises to enhance the flexibility and resource efficiency of various software programs through dynamically distributing available resources among concurrent tasks based on feedback information about the actual usage of the resources. With emphasis on the behavioral design of feedback schedulers, we describe a general framework of feedback scheduling in the context of real-time control applications. A simple yet illustrative feedback scheduling algorithm is given. From a programming perspective, we describe how to modify the implementation of control tasks to facilitate the application of feed...

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

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

  10. NASA Instrument Cost/Schedule Model

    Science.gov (United States)

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

    2011-01-01

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

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

  12. Scheduling nursing personnel on a microcomputer.

    Science.gov (United States)

    Liao, C J; Kao, C Y

    1997-01-01

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

  13. Timeline-Based Space Operations Scheduling with External Constraints

    Science.gov (United States)

    Chien, Steve; Tran, Daniel; Rabideau, Gregg; Schaffer, Steve; Mandl, Daniel; Frye, Stuart

    2010-01-01

    We describe a timeline-based scheduling algorithm developed for mission operations of the EO-1 earth observing satellite. We first describe the range of operational constraints for operations focusing on maneuver and thermal constraints that cannot be modeled in typical planner/schedulers. We then describe a greedy heuristic scheduling algorithm and compare its performance to both the prior scheduling algorithm - documenting an over 50% increase in scenes scheduled with estimated value of millions of dollars US. We also compare to a relaxed optimal scheduler showing that the greedy scheduler produces schedules with scene count within 15% of an upper bound on optimal schedules.

  14. Faculty Salary Schedules in Colleges and Universities, 1970-71.

    Science.gov (United States)

    National Education Association, Washington, DC. Research Div.

    This report concerning salary schedules at institutions of higher education describes the contents of the schedules, policies regarding schedule structure, minimum and maximum salaries, and increments. A listing of colleges and universities with their scheduled minimum and maximum salaries, and 4 examples of schedules are also included. (HS)

  15. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

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

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

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

  18. Scheduling mammograms for asymptomatic women

    International Nuclear Information System (INIS)

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

  19. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Document Server

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

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

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

  2. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

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

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

  4. NRC comprehensive records disposition schedule. Revision 3

    International Nuclear Information System (INIS)

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

  5. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

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

  6. Schedule-Aware Workflow Management Systems

    Science.gov (United States)

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

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

  7. NRC comprehensive records disposition schedule. Revision 3

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

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

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

  9. Mixed-Integer Formulations for Constellation Scheduling

    Science.gov (United States)

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

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

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

    OpenAIRE

    Korver, H.; Springintveld, J.

    1993-01-01

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

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

    Science.gov (United States)

    2012-02-22

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

  12. On the complexity of adjacent resource scheduling

    OpenAIRE

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

    2004-01-01

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

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

  14. Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment.

    OpenAIRE

    Tian, Wendi; Demeulemeester, Erik

    2012-01-01

    The Critical Chain Scheduling and Buffer Management (CC/BM) methodology, proposed by Goldratt (1997), introduced the concepts of feeding buffers, project buffers and resource buffers as well as the roadrunner mentality. This last concept, in which activities are started as soon as possible, was introduced in order to speed up projects by taking advantage of predecessors finishing early. Later on, the railway scheduling concept of never starting activities earlier than planned was introduced a...

  15. On the Fairness of Probabilistic Schedulers for Population Protocols

    OpenAIRE

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

    2010-01-01

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

  16. Recent reinforcement-schedule research and applied behavior analysis

    OpenAIRE

    Lattal, Kennon A.; Neef, Nancy A.

    1996-01-01

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

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

    OpenAIRE

    Noronha, SJ; Sarma, VVS

    1991-01-01

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

  18. A control-theoretical methodology for the scheduling problem

    OpenAIRE

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

    2010-01-01

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

  19. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  20. On the Road to Improved Scheduling

    DEFF Research Database (Denmark)

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

    2013-01-01

    Scheduling in onsite construction is based on commitments. Unmet commitments result in non-completions which leads to waste. Moreover, it is important that commitments are realistic to avoid both positive and negative variation in duration. Negative variation is destructive to plans and schedules...... total, 5424 activities have been registered whereof 1450 activities ended up as non-completions. Thus, 27% of the scheduled activities did not finish on schedule. Both positive and negative variation can be minimized by improving the quality of the commitments. Moreover, positive variation can be...... exploited by: (a) ensuring that the crew finishing an activity too early can continue their work and (b) ensuring that any connecting activity can start as fast as possible....

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

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

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

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

  5. Courts, Scheduled Damages, and Medical Malpractice Insurance

    DEFF Research Database (Denmark)

    Bertoli, Paola; Grembi, Veronica

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

  6. Onboard Autonomous Scheduling Intelligence System Project

    Data.gov (United States)

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

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

  8. 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......, interior point stabilization is used to decrease the number of columns generated in the branch-and-price algorithm. The algorithm is experimentally evaluated on job scheduling instances for a Grid network. The Dantzig- Wolfe algorithm with stabilization is clearly superior, being able to solve large...

  9. The Composition of the Master Schedule

    Science.gov (United States)

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

    2010-01-01

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

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

  11. Hybrid Multiprocessor Real-Time Scheduling Approach

    Directory of Open Access Journals (Sweden)

    Ali A Safaei

    2011-03-01

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

  12. A Cyclical Nurse Schedule Using Goal Programming

    Directory of Open Access Journals (Sweden)

    Ruzzakiah Jenal

    2011-11-01

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

  13. Effect of Uncertainty on Deterministic Runway Scheduling

    Science.gov (United States)

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

    2012-01-01

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

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

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

    OpenAIRE

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

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

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

    Science.gov (United States)

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

    2016-01-01

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

  17. Self-Healing Distributed Scheduling Platform

    OpenAIRE

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

    2011-01-01

    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 platform composed of multiple...

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

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

  20. Android-based sports competition scheduling system

    OpenAIRE

    Ma, Teng

    2015-01-01

    This report is about building a mobile-based single round-robin sports scheduling system with heuristic methods. Based on the current meta-heuristic methods in sports scheduling, this work did further researches on applying the current algorithms to a mobile platform while guarantee the quality and efficiency. Besides, a new system with the ability to deal with all the possible situations in practical use is proposed. Moreover, a simple user interface is built for the application.

  1. Advanced Opportunistic Multiuser Scheduling for Wireless Communications

    OpenAIRE

    Nguyen, PhuongBang

    2015-01-01

    This dissertation addresses key aspects of opportunistic multiuser scheduling, one of the main components of next generation wireless networks responsible for achieving maximum spectrum efficiency and superior user experience. The main topics include the exploitation of multiuser diversity and spatial frequency reuse while maintaining user fairness, the design and analysis of fair scheduling policies that can provide optimal performance, the utilization of historical channel data in scheduli...

  2. A Comparative Study of CPU Scheduling Algorithms

    OpenAIRE

    Goel, Neetu; Garg, R.B.

    2013-01-01

    Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to mak...

  3. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    BOWEN, W.W.

    1999-11-08

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

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

  5. Locomotive and Wagon Scheduling in Freight Transport

    OpenAIRE

    Fügenschuh, Armin; Homfeld, Henning; Huck, Andreas; Martin, Alexander

    2006-01-01

    We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account, such as cyclic departures of the trains, time windows on starting and arrival times, network-load dependend travel times, and a transfer of wagons between trains. The ...

  6. Instructions for Temporal Annotation of Scheduling Dialogs

    OpenAIRE

    O'Hara, Tom; Wiebe, Janyce; Payne, Karen

    1997-01-01

    Human annotation of natural language facilitates standardized evaluation of natural language processing systems and supports automated feature extraction. This document consists of instructions for annotating the temporal information in scheduling dialogs, dialogs in which the participants schedule a meeting with one another. Task-oriented dialogs, such as these are, would arise in many useful applications, for instance, automated information providers and automated phone operators. Explicit ...

  7. Job schedul in Grid batch farms

    Science.gov (United States)

    Gellrich, Andreas

    2014-06-01

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

  8. Real-Time Scheduling for Software Prototyping

    OpenAIRE

    Luqi; Shing, M

    1996-01-01

    This paper presents several real-time scheduling algorithms developed to support rapid prototyping of embedded systems using the Computer Aided Prototyping System (CAPS). The CAPS tools are based on the Prototyping System Description Language (PSDL), which is a high-level language designed specifically to support the conceptual modeling of real-time embedded systems. This paper describes the scheduling algorithms used in CAPS along with the associated timing constraint and hardwar...

  9. A Flexible Nurse Scheduling Support System

    OpenAIRE

    Ozkarahan, Irem

    1987-01-01

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

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

  11. The Lock Scheduling Problem (Het sluisplanningsprobleem)

    OpenAIRE

    Verstichel, Jannes

    2013-01-01

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

  12. Planning and Scheduling of Airline Operations

    OpenAIRE

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

    2010-01-01

    The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: f...

  13. Production scheduling model in aluminium foundry:

    OpenAIRE

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

    2008-01-01

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

  14. Job Shop Scheduling Problem: an Overview

    OpenAIRE

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

    2001-01-01

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

  15. DMP Packet Scheduling For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Pallavi Sawale

    2015-01-01

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

  16. Menus of Linear Income Tax Schedules

    OpenAIRE

    Alberto Alesina; Philippe Weil

    1992-01-01

    Relative to traditional piecewise linear income taxation schemes, it is possible to increase government revenues by offering to consumers a menu of linear income tax schedules. In the resulting Pareto-superior equilibrium, consumers sort themselves out according to their (unobservable) productivity level, with high productivity agents choosing the tax schedules with low marginal tax rate and high intercept. This scheme extracts from the economy an unexploited source of revenue which, in contr...

  17. Assessing Animals’ Preferences: Concurrent Schedules of Reinforcement

    OpenAIRE

    Sumpter, Catherine E.; Foster, Mary T.; Temple, William

    2002-01-01

    Three methods of assessing animals’ preferences are outlined: free-access, two-choice (e.g., T maze), and concurrent-schedules. While all give indications of relative preference between the choices, freeaccess and discrete-trial procedures tend to give exclusive preference and so do not indicate the degree of preference. Concurrent schedules give at least ordinal measures of the degree of preference. Data from cows, hens, and brushtail possums are used to illustrate the use of concurrent sche...

  18. Scheduling of interstate road and railway investments

    OpenAIRE

    Rothengatter, W.

    1986-01-01

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

  19. An evaluation of a test scheduling solution

    OpenAIRE

    Kelly, Timothy James

    1993-01-01

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

  20. Improving Local Search for Fuzzy Scheduling Problems

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The integration of fuzzy set theory and fuzzy logic into scheduling is a rather new aspect with growing importance for manufacturing applications, resulting in various unsolved aspects. In the current paper, we investigate an improved local search technique for fuzzy scheduling problems with fitness plateaus, using a multi criteria formulation of the problem. We especially address the problem of changing job priorities over time as studied at the Sherwood Press Ltd, a Nottingham based printing company, who is a collaborator on the project.

  1. Continuous intravenous infusion of ampicillin and gentamicin during parenteral nutrition to 36 newborn infants using a dosage schedule

    DEFF Research Database (Denmark)

    Colding, H; Møller, S; Andersen, G E

    1984-01-01

    Ampicillin and gentamicin were given continuously i.v. to 36 newborn infants using a dosage schedule and the results were compared with those obtained in an earlier study including 88 infants who received individually calculated dosages. With the dosage schedule the variation in the serum...... concentrations of antibiotics was smaller in the same child throughout the treatment course, but greater between the infants. The 95% limits for the serum concentrations of antibiotics were, however, nearly the same in the two treatment groups, and the use of a dosage schedule is therefore recommended. Serum...

  2. JWST planning and scheduling operations and concepts

    Science.gov (United States)

    Kinzel, Wayne M.

    2010-07-01

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

  3. Operant schedule transformations and human behavioral momentum.

    Science.gov (United States)

    Plaud, J J; Gaither, G A; Lawrence, J B

    1997-09-01

    Behavioral momentum, which can be defined as the persistence of behavior under altered environmental contingencies, is derived from Newtonian physics and operant psychology, and has relevance to behavior therapy in terms of shaping strong behaviors and ensuring effective relapse prevention strategies. The present study investigated whether changing operant schedule contingencies affects how humans respond to different stimuli when reinforcement density is systematically manipulated. Fifteen subjects participated in a computer study, in which each of two keys in a baseline condition was associated with the same schedule of reinforcement, multiple variable interval schedules, the only difference being that one reinforcer was ten times larger than the other. After six sessions, the contingency schedule changed to either an extinction condition, a variable time schedule, or a changed variable interval schedule to assess how 'subjects' responses persisted when reinforcement contingencies were systematically changed. Results of this study were found to be consistent with the general predictions of behavioral momentum. Subjects not only biased responding in favor of the more densely reinforcing key, but when contingencies changed, subjects showed continued biased responding. Implications for behavioral momentum for behavior modification and behavior therapy are discussed, and it is concluded that behavioral momentum has significant implications for designing new and comprehensive behavior change programs. PMID:9327296

  4. 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. PMID:26890347

  5. Adversarial Scheduling in Evolutionary Game Dynamics

    CERN Document Server

    Istrate, Gabriel; Ravi, S S

    2008-01-01

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

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

  7. Chandra mission scheduling on-orbit experience

    Science.gov (United States)

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

    2008-07-01

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

  8. Stimulus control of schedule-induced activity in pigeons during multiple schedules

    OpenAIRE

    Buzzard, Janis H.; Hake, Don F.

    1984-01-01

    Stimulus control of schedule-induced general activity was demonstrated with pigeons using multiple schedules of response-independent food delivery. In Experiment 1, the introduction of food during a multiple variable-time 30-second variable-time 30-second schedule produced a tenfold increase in activity above the no-food baseline. Each pigeon developed stable differential activity rates during the components (correlated with red and green lights) of a multiple variable-time 30-second extincti...

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

  10. Routine environmental monitoring schedule, calendar year 1998

    International Nuclear Information System (INIS)

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

  11. Fractionation schedules for cancers of the head and neck

    International Nuclear Information System (INIS)

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

  12. Tasks Scheduling using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    A. P. Shanthi

    2012-01-01

    Full Text Available Problem statement: Efficient scheduling of the tasks to heterogeneous processors for any application is critical in order to achieve high performance. Finding a feasible schedule for a given task set to a set of heterogeneous processors without exceeding the capacity of the processors, in general, is NP-Hard. Even if there are many conventional approaches available, people have been looking at unconventional approaches for solving this problem. This study uses a paradigm using Ant Colony Optimisation (ACO for arriving at a schedule. Approach: An attempt is made to arrive at a feasible schedule of a task set on heterogeneous processors ensuring load balancing across the processors. The heterogeneity of the processors is modelled by assuming different utilisation times for the same task on different processors. ACO, a bio-inspired computing paradigm, is used for generating the schedule. Results: For a given instance of the problem, ten runs are conducted based on an ACO algorithm and the average wait time of all tasks is computed. Also the average utilisation of each processor is calculated. For the same instance, the two parameters: average wait time of tasks and utilisation of processors are computed using the First Come First Served (FCFS. The results are tabulated and compared and it is found that ACO performs better than the FCFS with respect to the wait time. Although the processor utilisation is more for some processors using FCFS algorithm, it is found that the load is better balanced among the processors in ACO. There is a marginal increase in the time for arriving at a schedule in ACO compared to FCFS algorithm. Conclusion: This approach to the tasks assignment problem using ACO performs better with respect to the two parameters used compared to the FCFS algorithm but the time taken to come up with the schedule using ACO is slightly more than that of FCFS.

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

    Science.gov (United States)

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

    2014-01-01

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

  14. Genetic Algorithm-Based Optimization Used in Rolling Schedule

    Institute of Scientific and Technical Information of China (English)

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

    2008-01-01

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

  15. 41 CFR 51-8.12 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... 41 Public Contracts and Property Management 1 2010-07-01 2010-07-01 true Fee schedule. 51-8.12... MATERIALS § 51-8.12 Fee schedule. (a) This schedule sets forth fees to be charged for processing requests... schedule may be charged a party requesting records under FOIA. (b) Subject to the criteria set forth...

  16. 12 CFR 509.31 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

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

  17. 12 CFR 908.53 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

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

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

    Science.gov (United States)

    Imbimbo, Josephine; Gilkes, Alwyn

    2009-01-01

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

  19. 12 CFR 747.31 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

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

  20. 12 CFR 1780.33 - Scheduling and prehearing conferences.

    Science.gov (United States)

    2010-01-01

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

  1. System/360 Computer Assisted Network Scheduling (CANS) System

    Science.gov (United States)

    Brewer, A. C.

    1972-01-01

    Computer assisted scheduling techniques that produce conflict-free and efficient schedules have been developed and implemented to meet needs of the Manned Space Flight Network. CANS system provides effective management of resources in complex scheduling environment. System is automated resource scheduling, controlling, planning, information storage and retrieval tool.

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

  3. A heuristic approach to incremental and reactive scheduling

    Science.gov (United States)

    Odubiyi, Jide B.; Zoch, David R.

    1989-01-01

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

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

    Science.gov (United States)

    2012-10-17

    ...- methylenedioxypyrovalerone (MDPV)) into Schedule I pursuant to the temporary scheduling provisions of the CSA (76 FR 55616... FR 65371) amending 21 CFR 1308.11(g) to temporarily place these three synthetic cathinones into... potential hazards associated with these products. 7. Its Psychic or Physiological Dependence...

  5. Quay crane scheduling with dual cycling

    Science.gov (United States)

    Wang, Dandan; Li, Xiaoping

    2015-10-01

    In this article, the dual cycling quay crane scheduling problem (D-QCSP) with hatches is addressed to minimize the operation cycles of quay cranes. The problem is decomposed into two sub-problems: the intra-group stage (sequencing stacks within each hatch) and the inter-group stage (scheduling all hatches). A new stack sequencing method is constructed for stacks of each hatch, which is modelled as a two-machine non-permutation flow shop scheduling problem. By removing inner gaps using left-shifting, the adapted hatch scheduling sub-problem is modelled as a two-machine grouped flow shop scheduling problem, which contains more precise processing times. A composite heuristic is proposed for the D-QCSP. Based on the derived lower bound, the heuristic is compared with the best existing heuristics on a large number of instances. Experimental results illustrate that the proposal outperforms the existing methods on all instances and dual cycling needs many fewer quay crane operating cycles than single cycling.

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1996-05-01

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

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

    International Nuclear Information System (INIS)

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

  11. Vehicle Scheduling with Network Flow Models

    Directory of Open Access Journals (Sweden)

    Gustavo P. Silva

    2010-04-01

    Full Text Available

    Este trabalho retrata a primeira fase de uma pesquisa de doutorado voltada para a utilização de modelos de fluxo em redes para programação de veículos (de ônibus, em particular. A utilização de modelos deste tipo ainda e muito pouco explorada na literatura, principalmente pela dificuldade imposta pelo grande numero de variáveis resultante. Neste trabalho são apresentadas formulações para tratamento do problema de programação de veículos associados a um único depósito (ou garagem como problema de fluxo em redes, incluindo duas técnicas para reduzir o numero de arcos na rede criada e, conseqüentemente, o numero de variáveis a tratar. Uma destas técnicas de redução de arcos foi implementada e o problema de fluxo resultante foi direcionado para ser resolvido, nesta fase da pesquisa, por uma versão disponível do algoritmo Simplex para redes. Problemas teste baseados em dados reais da cidade de Reading, UK, foram resolvidos com a utilização da formulação de fluxo em redes adotada, e os resultados comparados com aqueles obtidos pelo método heurístico BOOST, o qual tem sido largamente testado e comercializado pela School of Computer Studies da Universidade de Leeds, UK. Os resultados alcançados demonstram a possibilidade de tratamento de problemas reais com a técnica de redução de arcos.

    ABSTRACT

    This paper presents the successful results of a first phase of a doctoral research addressed to solving vehicle (bus, in particular scheduling problems through network flow formulations. Network flow modeling for this kind of problem is a promising, but not a well explored approach, mainly because of the large number of variables related to number of arcs of real case networks. The paper presents and discusses some network flow formulations for the single depot bus vehicle scheduling problem, along with two techniques of arc reduction. One of these arc reduction techniques has been implemented and the underlying

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

  13. 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. PMID:11599637

  14. Solution and quality robust project scheduling: a methodological framework.

    OpenAIRE

    Herroelen, Willy; Leus, Roel

    2003-01-01

    The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic environment. During execution, however, projects may be the subject of considerable uncertainty, which may lead to numerous schedule disruptions. Predictive-reactive scheduling refers to the process where a baseline schedule is developed prio...

  15. Dynamic scheduling for complex engineer-to-order products

    OpenAIRE

    Hicks, Christian; Song, Dongping; Earl, Christopher

    2007-01-01

    Abstract This paper considers dynamic production scheduling for manufacturing systems producing products with deep and complex product structures and complicated process routings. It is assumed that manufacturing and assembly processing times are deterministic. Dynamic scheduling problems may be either incremental, where the schedule for incoming orders does not affect the schedule for existing orders, or regenerative where a new schedule is produced for both new and existing order...

  16. Group Elevator Peak Scheduling Based on Robust Optimization Model

    OpenAIRE

    Zhang, J.; Zong, Q.

    2013-01-01

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

  17. Scheduling of Dependent Tasks Application using Random Search Technique

    OpenAIRE

    vegda, Deepak. c.; Prajapati, Harshad B.

    2013-01-01

    Since beginning of Grid computing, scheduling of dependent tasks application has attracted attention of researchers due to NP-Complete nature of the problem. In Grid environment, scheduling is deciding about assignment of tasks to available resources. Scheduling in Grid is challenging when the tasks have dependencies and resources are heterogeneous. The main objective in scheduling of dependent tasks is minimizing make-span. Due to NP-complete nature of scheduling problem, exact solutions can...

  18. Range Chart-Guided Iterative Data-Flow-Graph Scheduling

    OpenAIRE

    Heemstra de Groot, Sonia M.; Gerez, Sabih H.; Herrmann, Otto E.

    1992-01-01

    An alternative method for the scheduling of iterative data-flow graphs is described. The method is based on the scheduling-range chart, which contains the information on the range within which each operation in the graph can be scheduled. The scheduling range is determined by considering the intraiteration and interiteration precedence relations. The goal is to find an optimal position within the scheduling range of each operation in such a way that some quality criteria (number of hardware r...

  19. Survey on Scheduling Technologies of P2P Media Streaming

    OpenAIRE

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

    2011-01-01

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

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

    OpenAIRE

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

    2011-01-01

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

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

    OpenAIRE

    Constanta Nicoleta BODEA; Ileana Ruxandra BADEA

    2010-01-01

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

  2. Fair channel-dependent scheduling in CDMA systems

    OpenAIRE

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

    2003-01-01

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

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

    OpenAIRE

    Herroelen, Willy; Leus, Roel

    2005-01-01

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

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

    OpenAIRE

    Herroelen, Willy; Leus, Roel

    2002-01-01

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

  5. An Exploration of Activity Scheduling and Rescheduling Processes

    OpenAIRE

    Chen, Quizi

    2001-01-01

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

  6. Some studies on pre-planned controlled soil moisture irrigation scheduling of field crops

    International Nuclear Information System (INIS)

    The study aimed at improving the conventional irrigation management practices to enhance yield and water use efficiency for pre-planned irrigation scheduling of wheat and cotton crops. Five field experiments were conducted during 1990-1994. A 3-year study of moisture deficit irrigations (MDI) to wheat V-85205 was continued with the same irrigation schedule(s) for two years. The third year irrigation schedule(s) were modified on the basis of the preceding year's results. The 3-year study indicated that the crop was most sensitive to moisture deficit at tillering stage and least sensitive at flowering stage. In the fourth experiment, genetic diversity of wheat to moisture deficit was investigated. Three pre-selected wheat genotypes; Sarsabz, LU-26S and Pasban-90 were imposed to moisture deficit at different stages. The genotypes showed different response to moisture deficit. Comparable yields to respective conventional irrigation schedule (1111) were obtained by MDI schedules (1011), (1110) and (1101) for Sarsaba, LU-26S and Pasban-90, respectively. The fifth experiment was conducted on the genetic diversity of cotton to moisture deficit. Two pre-selected cotton genotypes NIAB-86 and FH-682 were imposed to moisture deficit at vegetative, generative or maturity stages. NIAB-86 yielded 7% more seed cotton at MDI (110) and FH-682 yielded 9% excess over conventional irrigation treatments saving 150 mm of irrigation water. Thus, saving of 75 and 150 mm of irrigation water were achieved by applying improved irrigation schedule without undergoing any significant yield loss. (author). 12 refs, 5 figs, 5 tabs

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

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

  9. Experiments with a decision-theoretic scheduler

    Science.gov (United States)

    Hansson, Othar; Holt, Gerhard; Mayer, Andrew

    1992-01-01

    This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

  10. On Wireless Link Scheduling and Flow Control

    CERN Document Server

    Gore, Ashutosh Deepak

    2008-01-01

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

  11. Vague Logic Approach to Disk Scheduling

    Directory of Open Access Journals (Sweden)

    Priya Hooda

    2014-11-01

    Full Text Available Vague sets theory separates the evidences in favour and against of an element in a set which provides better mechanism to handle impreciseness and uncertainty. This research paper aims to handle the incompleteness and impreciseness of data associated with the disk access requests. Here, we propose a new disk scheduling algorithm, Vague Disk Scheduling (VDS Algorithm, based on vague logic. The proposed framework includes Vague-Fuzzification Technique, Priority Expression, and VDS Algorithm. The Vague-Fuzzification Technique is applied to the input data of each disk access request and generates a priority for each request in the queue. Based on the priority allotted the requests are serviced. Finally work is evaluated on different datasets and finally compared with Fuzzy Disk Scheduling (FDS Algorithm. The results prove that VDS algorithm performs better than FDS Algorithm.

  12. An Algebra of Synchronous Scheduling Interfaces

    Directory of Open Access Journals (Sweden)

    Michael Mendler

    2011-01-01

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

  13. Crane Scheduling for a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper; Clausen, Jens

    2002-01-01

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

  14. Novel Scheduling Algorithms for LTE Downlink Transmission

    Directory of Open Access Journals (Sweden)

    D. Talevski

    2012-06-01

    Full Text Available Long Term Evolution (LTE is the new standard specified by 3GPP on the way towards the fourth generation mobile network. The LTE introduces enhanced data link mechanisms to support successful implementation of new data services across the network. The incorporated scheduling mechanisms can significantly contribute to this goal. In this paper novel scheduling algorithms are presented and compared to the Max C/I Downlink scheduler for LTE, which is characterized by high data rates at cell level, but poor fairness. The newly developed algorithms allow fair distribution of available resources. Simulation results presented in the paper show that the implementation of these newly developed algorithms enables improvement of the overall system capacity and user level performances.

  15. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM-based sched......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...... should be prioritized and coordinated with each craft, a process library should be introduced to promote transfer of knowledge and continuous improvements, and information flow between design and scheduling processes must change from push to pull....

  16. Load scheduling for decentralized CHP plants

    DEFF Research Database (Denmark)

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

    This report considers load scheduling for decentralized combined heat and power plants where the revenue from selling power to the transmission company and the fuel cost may be time-varying. These plants produce both heat and power with a fixed ratio between these outputs. A heat storage facility...... is used to be able to deviate from this restriction. The load scheduling must be performed with only approximate knowledge about the future. At present in Denmark this uncertainty is only associated with the heat demand, but in the future revenues of produced energy and the fuel costs might also 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...

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

  18. An Algebra of Synchronous Scheduling Interfaces

    CERN Document Server

    Mendler, Michael

    2011-01-01

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

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

  20. Scheduling Earth Observing Satellites with Evolutionary Algorithms

    Science.gov (United States)

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

    2003-01-01

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

  1. Treatment of primary syphilis.

    Science.gov (United States)

    Elliott, W C

    1976-12-01

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

  2. Timely and efficient planning of treatments through intelligent scheduling

    OpenAIRE

    Braaksma, Aleida

    2015-01-01

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

  3. Scheduling Operations for Massive Heterogeneous Clusters

    Science.gov (United States)

    Humphrey, John; Spagnoli, Kyle

    2013-01-01

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

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

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

  6. Quay crane scheduling for an indented berth

    Science.gov (United States)

    Lee, Der-Horng; Chen, Jiang Hang; Cao, Jin Xin

    2011-09-01

    This article explores the quay crane scheduling problem at an indented berth. The indented berth is known as an innovative implementation in the container terminals to tackle the challenge from the emergence of more and more mega-containerships. A mixed integer programming model by considering the non-crossing and safety distance constraints is formulated. A Tabu search heuristic is developed to solve the proposed problem. The computational results from this research indicate that the designed Tabu search is an effective method to handle the quay crane scheduling problem at an indented berth.

  7. Optimal scheduling of coproduction with a storage

    International Nuclear Information System (INIS)

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

  8. Optimal Robot Scheduling for Web Search Engines

    OpenAIRE

    Coffman, E.G.; Liu, Zhen; Richard R. Weber

    1997-01-01

    A robot is deployed by a Web search engine in order to maintain the currency of its data base of Web pages. This paper studies robot scheduling policies that minimize the fractions $r_i$ of time pages spend out-of-date, assuming independent Poisson page-change processes, and a general distribution for the page access time $X$. We show that, if $X$ is decreased in the increasing-convex ordering sense, then $r_i$ is decreased for all $i$ under any scheduling policy, and that, in order to minimi...

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

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

  11. Schedule control in Ling Ao nuclear power project

    International Nuclear Information System (INIS)

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

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

    CERN Document Server

    Gopalakrishnan, Sathish

    2009-01-01

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

  13. Dynamic Task Scheduling Algorithm based on Ant Colony Scheme

    Directory of Open Access Journals (Sweden)

    Kamolov Nizomiddin Baxodirjonovich

    2015-08-01

    Full Text Available Many scientific applications running in Cloud Computing system are workflow applications that contains large number of tasks and in which tasks are connected by precedence relations. Efficient scheduling the workflow tasks become a challenging issue in Cloud Computing environments because the scheduling decides performance of the applications. Unfortunately, finding the optimal scheduling is known as NP-hard. Ant Colony Optimization algorithm can be applied to design efficient scheduling algorithms. Previous scheduling algorithms that use Ant Colony mechanism lack rapid adaptivity. This paper proposes a task scheduling algorithm that uses a modified Ant Colony Optimization. The modified version uses probability in order for ants to decide target machine. The proposed task scheduling algorithm is implemented in WorkflowSim in order to measure performance. The experimental results show that the proposed scheduling algorithm reduce average makespan to about 6.4% compared to a scheduling algorithm that uses basic Ant Colony Optimization scheme.

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

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

  16. Data and Job Aware Community Scheduler Framework for Grid Scheduling Problems

    Directory of Open Access Journals (Sweden)

    G. Kalpana

    2014-12-01

    Full Text Available Grid technologies have brought the promise of flawless combination of distributed heterogeneous resources. Scheduling in Grid computing is the hot topic of research and challenging to manage task, job in efficient manner. For instance, tasks are assumed to include all data needed for its computation or tasks are just the processes and data is assumed to be available in Grid nodes. All the existing works doesn’t focus on the data aware scheduling framework and it is almost impossible to make an optimal or approximate optimal scheduling for the end-to-end workflow with considering the intermediate data movement in grid computing environment. In order to solve this problem in this study a novel Community Scheduler Framework (CSF approach is proposed for solving the job and data aware scheduling problem together and it can be integrated to grid host environment. The system is able to find data-affinity hosts for user requested jobs and to adjust the data replicas dynamically according to the job load. The proposed work reviews the policies for scheduling of grid jobs in the context of data and task aware-intensive applications. Proposed data and task aware CSF Meta scheduler framework makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As the experimental results show that, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms. The experimentation of the proposed Meta scheduler work is implemented with the help of grid simulation toolkit.

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

  18. Radiation-induced lesions of the brachial plexus correlated to the dose-time-fraction schedule

    International Nuclear Information System (INIS)

    Radiation induced brachial plexus lesions were correlated to the dose-time-fraction schedule. Ellis' formula was used and the mathematical treatments were made according to Kirk et coll. (1971). It was found that the frequency of lesions increases very rapidly for small increases of CRE over a certain level. (author)

  19. Quarterly report on program cost and schedule

    International Nuclear Information System (INIS)

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

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