Advertisement scheduling on commercial radio station using genetics algorithm

Science.gov (United States)

Purnamawati, S.; Nababan, E. B.; Tsani, B.; Taqyuddin, R.; Rahmat, R. F.

2018-03-01

On the commercial radio station, the advertising schedule is done manually, which resulted in ineffectiveness of ads schedule. Playback time consists of two types such as prime time and regular time. Radio Ads scheduling will be discussed in this research is based on ad playback schedule between 5am until 12am which rules every 15 minutes. It provides 3 slots ads with playback duration per ads maximum is 1 minute. If the radio broadcast time per day is 12 hours, then the maximum number of ads per day which can be aired is 76 ads. The other is the enactment of rules of prime time, namely the hours where the common people (listeners) have the greatest opportunity to listen to the radio, namely between the hours and hours of 4 am - 8 am, 6 pm - 10 pm. The number of screenings of the same ads on one day are limited to prime time ie 5 times, while for regular time is 8 times. Radio scheduling process is done using genetic algorithms which are composed of processes initialization chromosomes, selection, crossover and mutation. Study on chromosome 3 genes, each chromosome will be evaluated based on the value of fitness calculated based on the number of infractions that occurred on each individual chromosome. Where rule 1 is the number of screenings per ads must not be more than 5 times per day and rule 2 is there should never be two or more scheduling ads delivered on the same day and time. After fitness value of each chromosome is acquired, then the do the selection, crossover and mutation. From this research result, the optimal advertising schedule with schedule a whole day and ads data playback time ads with this level of accuracy: the average percentage was 83.79%.

Using mean duration and variation of procedure times to plan a list of surgical operations to fit into the scheduled list time.

Science.gov (United States)

Pandit, Jaideep J; Tavare, Aniket

2011-07-01

It is important that a surgical list is planned to utilise as much of the scheduled time as possible while not over-running, because this can lead to cancellation of operations. We wished to assess whether, theoretically, the known duration of individual operations could be used quantitatively to predict the likely duration of the operating list. In a university hospital setting, we first assessed the extent to which the current ad-hoc method of operating list planning was able to match the scheduled operating list times for 153 consecutive historical lists. Using receiver operating curve analysis, we assessed the ability of an alternative method to predict operating list duration for the same operating lists. This method uses a simple formula: the sum of individual operation times and a pooled standard deviation of these times. We used the operating list duration estimated from this formula to generate a probability that the operating list would finish within its scheduled time. Finally, we applied the simple formula prospectively to 150 operating lists, 'shadowing' the current ad-hoc method, to confirm the predictive ability of the formula. The ad-hoc method was very poor at planning: 50% of historical operating lists were under-booked and 37% over-booked. In contrast, the simple formula predicted the correct outcome (under-run or over-run) for 76% of these operating lists. The calculated probability that a planned series of operations will over-run or under-run was found useful in developing an algorithm to adjust the planned cases optimally. In the prospective series, 65% of operating lists were over-booked and 10% were under-booked. The formula predicted the correct outcome for 84% of operating lists. A simple quantitative method of estimating operating list duration for a series of operations leads to an algorithm (readily created on an Excel spreadsheet, http://links.lww.com/EJA/A19) that can potentially improve operating list planning.

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

NARCIS (Netherlands)

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

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

Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

Directory of Open Access Journals (Sweden)

Peng Liu

2017-01-01

Full Text Available A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due date. The objective is to maximize the multiplication of their rational positive cooperative profits. A division of those jobs should be negotiated to yield a reasonable cooperative profit allocation scheme acceptable to them. We propose the sufficient and necessary conditions for the problems to have positive integer solution.

Maternal Nonstandard Work Schedules and Breastfeeding Behaviors.

Science.gov (United States)

Zilanawala, Afshin

2017-06-01

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

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

NARCIS (Netherlands)

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

2005-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Diagnostic of annual cycle and effects of the ENSO about the maximum intensity of duration rains between 1 and 24 hours at the Andes of Colombia

International Nuclear Information System (INIS)

Poveda, German; Mesa, Oscar; Toro, Vladimir; Agudelo, Paula; Alvarez, Juan F; Arias, Paola; Moreno, Hernan; Salazar, Luis; Vieira, Sara

2002-01-01

We study the distribution of maximum rainfall events during the annual cycle, for storms ranging from 1 to 24-hour in duration; by using information over 51 rain gauges locate at the Colombian Andes. Also, the effects of both phases of ENSO (El Nino and La Nina) are quantified. We found that maximum rainfall intensity events occur during the rainy periods of march-may and September-November. There is a strong similarity between the annual cycle of mean total rainfall and that of the maximum intensities of rainfall over the tropical Andes. This result is quite consistent throughout the three ranges of the Colombian Andes. At inter annual timescales, we found that both phases of ENSO are associated with disturbances of maximum rainfall events; since during La Nina there are more intense precipitation events than during El Nino, overall, for durations longer than 3 hours, rainfall intensity gets reduced by one order of magnitude with respect to shorter durations (1-3 hours). The most extreme recorded rainfall events are apparently not associated with the annual and inter annual large scales forcing and appear to be randomly generated by the important role of the land surface atmosphere in the genesis and dynamics of intense storm over central Colombia

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

Science.gov (United States)

Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

20 CFR 10.806 - How are the maximum fees defined?

Science.gov (United States)

2010-04-01

... AMENDED Information for Medical Providers Medical Fee Schedule § 10.806 How are the maximum fees defined? For professional medical services, the Director shall maintain a schedule of maximum allowable fees.../Current Procedural Terminology (HCPCS/CPT) code which represents the relative skill, effort, risk and time...

Sleep duration as a mediator between an alternating day and night shift work schedule and metabolic syndrome among female hospital employees.

Science.gov (United States)

Korsiak, Jill; Tranmer, Joan; Day, Andrew; Aronson, Kristan J

2018-02-01

The main objective was to determine whether sleep duration on work shifts mediates the relationship between a current alternating day and night shift work schedule and metabolic syndrome among female hospital employees. The secondary objective was to assess whether cumulative lifetime shift work exposure was associated with metabolic syndrome. In this cross-sectional study of 294 female hospital employees, sleep duration was measured with the ActiGraph GT3X+. Shift work status was determined through self-report. Investigation of the total, direct and indirect effects between shift work, sleep duration on work shifts and metabolic syndrome was conducted using regression path analysis. Logistic regression was used to determine the association between cumulative shift work exposure and metabolic syndrome. Shift work is strongly associated with metabolic syndrome (OR Total =2.72, 95% CI 1.38 to 5.36), and the relationship is attenuated when work shift sleep duration is added to the model (OR Direct =1.18, 95% CI 0.49 to 2.89). Sleep duration is an important intermediate between shift work and metabolic syndrome (OR Indirect =2.25, 95% CI 1.27 to 4.26). Cumulative shift work exposure is not associated with metabolic syndrome in this population. Sleep duration mediates the association between a current alternating day-night shift work pattern and metabolic syndrome. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

Directory of Open Access Journals (Sweden)

Ahmad Zeraatkar Moghaddam

2012-01-01

Full Text Available This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which delivering goods to customers entails cost. Under such situation, keeping completed jobs to deliver in batches may result in reducing delivery costs. In literature review of batch scheduling, minimizing the maximum lateness is known as NP-Hard problem; therefore the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In order to solve the proposed model, a Simulation annealing meta-heuristic is used, where the parameters are calibrated by Taguchi approach and the results are compared to the global optimal values generated by Lingo 10 software. Furthermore, in order to check the efficiency of proposed method to solve larger scales of problem, a lower bound is generated. The results are also analyzed based on the effective factors of the problem. Computational study validates the efficiency and the accuracy of the presented model.

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1992-03-01

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

Comparison of annual maximum series and partial duration series methods for modeling extreme hydrologic events

DEFF Research Database (Denmark)

Madsen, Henrik; Rasmussen, Peter F.; Rosbjerg, Dan

1997-01-01

Two different models for analyzing extreme hydrologic events, based on, respectively, partial duration series (PDS) and annual maximum series (AMS), are compared. The PDS model assumes a generalized Pareto distribution for modeling threshold exceedances corresponding to a generalized extreme value......). In the case of ML estimation, the PDS model provides the most efficient T-year event estimator. In the cases of MOM and PWM estimation, the PDS model is generally preferable for negative shape parameters, whereas the AMS model yields the most efficient estimator for positive shape parameters. A comparison...... of the considered methods reveals that in general, one should use the PDS model with MOM estimation for negative shape parameters, the PDS model with exponentially distributed exceedances if the shape parameter is close to zero, the AMS model with MOM estimation for moderately positive shape parameters, and the PDS...

The Reinforcing Effects of Houselight Illumination during Chained Schedules of Food Presentation

Science.gov (United States)

Allen, Ron; Kupfer, Jeff; Malagodi, E. F.

2008-01-01

Pigeons' keypecking was maintained under two- and three-component chained schedules of food presentation. The component schedules were all fixed-interval schedules of either 1- or 2-min duration. Across conditions the presence of houselight illumination within each component schedule was manipulated. For each pigeon, first-component response rates…

Modeling Change in Project Duration and Completion

DEFF Research Database (Denmark)

Wiltshire, Travis; Butner, Jonathan E.; Pirtle, Zachary

2017-01-01

In complex work domains and organizations, understanding scheduleing dynamics can ensure objectives are reached and delays are mitigated. In the current paper, we examine the scheduling dynamics for NASA’s Exploration Flight Test 1 (EFT-1) activities. For this examination, we specifically modeled...... simultaneous change in percent complete and estimated duration for a given project as they were included in monthly reports over time. In short, we utilized latent change score mixture modeling to extract the attractor dynamics within the scheduling data. We found three primarily patterns: an attractor at low...

Maternal Nonstandard Work Schedules and Child Cognitive Outcomes

Science.gov (United States)

Han, Wen-Jui

2005-01-01

This paper examined associations between mothers' work schedules and children's cognitive outcomes in the first 3 years of life for approximately 900 children from the National Institute of Child Health and Human Development Study of Early Child Care. Both the timing and duration of maternal nonstandard work schedules were examined. Although…

Maximum permissible voltage of YBCO coated conductors

Energy Technology Data Exchange (ETDEWEB)

Wen, J.; Lin, B.; Sheng, J.; Xu, J.; Jin, Z. [Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai (China); Hong, Z., E-mail: zhiyong.hong@sjtu.edu.cn [Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai (China); Wang, D.; Zhou, H.; Shen, X.; Shen, C. [Qingpu Power Supply Company, State Grid Shanghai Municipal Electric Power Company, Shanghai (China)

2014-06-15

Highlights: • We examine three kinds of tapes’ maximum permissible voltage. • We examine the relationship between quenching duration and maximum permissible voltage. • Continuous I{sub c} degradations under repetitive quenching where tapes reaching maximum permissible voltage. • The relationship between maximum permissible voltage and resistance, temperature. - Abstract: Superconducting fault current limiter (SFCL) could reduce short circuit currents in electrical power system. One of the most important thing in developing SFCL is to find out the maximum permissible voltage of each limiting element. The maximum permissible voltage is defined as the maximum voltage per unit length at which the YBCO coated conductors (CC) do not suffer from critical current (I{sub c}) degradation or burnout. In this research, the time of quenching process is changed and voltage is raised until the I{sub c} degradation or burnout happens. YBCO coated conductors test in the experiment are from American superconductor (AMSC) and Shanghai Jiao Tong University (SJTU). Along with the quenching duration increasing, the maximum permissible voltage of CC decreases. When quenching duration is 100 ms, the maximum permissible of SJTU CC, 12 mm AMSC CC and 4 mm AMSC CC are 0.72 V/cm, 0.52 V/cm and 1.2 V/cm respectively. Based on the results of samples, the whole length of CCs used in the design of a SFCL can be determined.

Selection and scheduling of jobs with time-dependent duration

African Journals Online (AJOL)

†Department of Logistics, University of Stellenbosch, Private Bag X1, ... station must apply to occupy the test station and sometimes may even choose ... are considered where the job duration and cost are dependent on the time and sequence.

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

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

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

Evolutionary Scheduler for the Deep Space Network

Science.gov (United States)

Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert

2010-01-01

A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

Duration of protection against hepatitis A for the current two-dose vaccine compared to a three-dose vaccine schedule in children

Science.gov (United States)

Raczniak, Gregory A.; Thomas, Timothy K.; Bulkow, Lisa R.; Negus, Susan E.; Zanis, Carolyn L.; Bruce, Michael G.; Spradling, Philip R.; Teshale, Eyasu H.; McMahon, Brian J.

2015-01-01

Background Hepatitis A is mostly a self-limiting disease but causes substantial economic burden. Consequently, United States Advisory Committee for Immunization Practices recommends inactivated hepatitis A vaccination for all children beginning at age 1 year and for high risk adults. The hepatitis A vaccine is highly effective but the duration of protection is unknown. Methods We examined the proportion of children with protective hepatitis A antibody levels (anti-HAV ≥20 mIU/mL) as well as the geometric mean concentration (GMC) of anti-HAV in a cross sectional convenience sample of individuals aged 12–24 years, who had been vaccinated with a two-dose schedule in childhood, with the initial dose at least 5 years ago. We compared a subset of data from persons vaccinated with two-doses (720 EL.U.) at age 3–6 years with a demographically similar prospective cohort that received a three-dose (360 EL.U.) schedule and have been followed for 17 years. Results No significant differences were observed when comparing GMC between the two cohorts at 10 (P = 0.467), 12 (P = 0.496), and 14 (P = 0.175) years post-immunization. For the three-dose cohort, protective antibody levels remain for 17 years and have leveled-off over the past 7 years. Conclusion The two- and three-dose schedules provide similar protection >14 years after vaccination, indicating a booster dose is not needed at this time. Plateauing anti-HAV GMC levels suggest protective antibody levels may persist long-term. PMID:23470239

The algorithm for duration acceleration of repetitive projects considering the learning effect

Science.gov (United States)

Chen, Hongtao; Wang, Keke; Du, Yang; Wang, Liwan

2018-03-01

Repetitive project optimization problem is common in project scheduling. Repetitive Scheduling Method (RSM) has many irreplaceable advantages in the field of repetitive projects. As the same or similar work is repeated, the proficiency of workers will be correspondingly low to high, and workers will gain experience and improve the efficiency of operations. This is learning effect. Learning effect is one of the important factors affecting the optimization results in repetitive project scheduling. This paper analyzes the influence of the learning effect on the controlling path in RSM from two aspects: one is that the learning effect changes the controlling path, the other is that the learning effect doesn't change the controlling path. This paper proposes corresponding methods to accelerate duration for different types of critical activities and proposes the algorithm for duration acceleration based on the learning effect in RSM. And the paper chooses graphical method to identity activities' types and considers the impacts of the learning effect on duration. The method meets the requirement of duration while ensuring the lowest acceleration cost. A concrete bridge construction project is given to verify the effectiveness of the method. The results of this study will help project managers understand the impacts of the learning effect on repetitive projects, and use the learning effect to optimize project scheduling.

Duration-frequency relationships of heavy rainfall in Santa Catarina, Brazil

Directory of Open Access Journals (Sweden)

Álvaro José Back

2012-06-01

Full Text Available The purpose of this study was to adjust equations that establish relationships between rainfall events with different duration and data from weather stations in the state of Santa Catarina, Brazil. In this study, the relationships between different duration heavy rainfalls from 13 weather stations of Santa Catarina were analyzed. From series of maximum annual rainfalls, and using the Gumbel-Chow distribution, the maximum rainfall for durations between 5 min and 24 h were estimated considering return periods from 2 to 100 years. The data fit to the Gumbel-Chow model was verified by the Kolmogorov-Smirnov test at 5 % significance. The coefficients of Bell's equation were adjusted to estimate the relationship between rainfall duration t (min and the return period T (y in relation to the maximum rainfall with a duration of 1 hour and a 10 year return period. Likewise, the coefficients of Bell's equation were adjusted based on the maximum rainfall with a duration of 1 day and a 10 year return period. The results showed that these relationships are viable to estimate short-duration rainfall events at locations where there are no rainfall records.

NRC comprehensive records disposition schedule. Revision 3

International Nuclear Information System (INIS)

1998-02-01

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

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

Investigations of timing during the schedule and reinforcement intervals with wheel-running reinforcement.

Science.gov (United States)

Belke, Terry W; Christie-Fougere, Melissa M

2006-11-01

Across two experiments, a peak procedure was used to assess the timing of the onset and offset of an opportunity to run as a reinforcer. The first experiment investigated the effect of reinforcer duration on temporal discrimination of the onset of the reinforcement interval. Three male Wistar rats were exposed to fixed-interval (FI) 30-s schedules of wheel-running reinforcement and the duration of the opportunity to run was varied across values of 15, 30, and 60s. Each session consisted of 50 reinforcers and 10 probe trials. Results showed that as reinforcer duration increased, the percentage of postreinforcement pauses longer than the 30-s schedule interval increased. On probe trials, peak response rates occurred near the time of reinforcer delivery and peak times varied with reinforcer duration. In a second experiment, seven female Long-Evans rats were exposed to FI 30-s schedules leading to 30-s opportunities to run. Timing of the onset and offset of the reinforcement period was assessed by probe trials during the schedule interval and during the reinforcement interval in separate conditions. The results provided evidence of timing of the onset, but not the offset of the wheel-running reinforcement period. Further research is required to assess if timing occurs during a wheel-running reinforcement period.

PLAN-IT - Scheduling assistant for solar system exploration

International Nuclear Information System (INIS)

Dias, W. C.; Henricks, J. A.; Wong, J. C.; California Institute of Technology, Pasadena)

1987-01-01

A frame-based expert scheduling system shell, PLAN-IT, is developed for spacecraft scheduling in the Request Integration Phase, using the Comet Rendezvous Asteroid Flyby (CRAF) mission as a development base. Basic, structured, and expert scheduling techniques are reviewed. Data elements such as activity representation and resource conflict representation are discussed. Resource constraints include minimum and maximum separation times between activities, percentage of time pointed at specific targets, and separation time between targeted intervals of a given activity. The different scheduling technique categories and the rationale for their selection are also considered. 13 references

Multiprocessor Global Scheduling on Frame-Based DVFS Systems

OpenAIRE

Berten, Vandy; Goossens, Joël

2008-01-01

International audience; In this work, we are interested in multiprocessor energy efficient systems where task durations are not known in advance but are known stochastically. More precisely we consider global scheduling algorithms for frame-based multiprocessor stochastic DVFS (Dynamic Voltage and Frequency Scaling) systems. Moreover we consider processors with a discrete set of available frequencies. We provide a global scheduling algorithm, and formally show that no deadline will ever be mi...

Lift scheduling organization : Lift Concept for Lemminkainen

OpenAIRE

Mingalimov, Iurii

2015-01-01

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

SU-F-19A-08: Optimal Time Release Schedule of In-Situ Drug Release During Permanent Prostate Brachytherapy

International Nuclear Information System (INIS)

Cormack, R; Ngwa, W; Makrigiorgos, G; Tangutoori, S; Rajiv, K; Sridhar, S

2014-01-01

Purpose: Permanent prostate brachytherapy spacers can be used to deliver sustained doses of radiosentitizing drug directly to the target, in order to enhance the radiation effect. Implantable nanoplatforms for chemo-radiation therapy (INCeRTs) have a maximum drug capacity and can be engineered to control the drug release schedule. The optimal schedule for sensitization during continuous low dose rate irradiation is unknown. This work studies the optimal release schedule of drug for both traditional sensitizers, and those that work by suppressing DNA repair processes. Methods: Six brachytherapy treatment plans were used to model the anatomy, implant geometry and calculate the spatial distribution of radiation dose and drug concentrations for a range of drug diffusion parameters. Three state partial differential equations (cells healthy, damaged or dead) modeled the effect of continuous radiation (radiosensitivities α,β) and cellular repair (time tr) on a cell population. Radiosensitization was modeled as concentration dependent change in α,β or tr which with variable duration under the constraint of fixed total drug release. Average cell kill was used to measure effectiveness. Sensitization by means of both enhanced damage and reduced repair were studied. Results: Optimal release duration is dependent on the concentration of radiosensitizer compared to the saturation concentration (csat) above which additional sensitization does not occur. Long duration drug release when enhancing α or β maximizes cell death when drug concentrations are generally over csat. Short term release is optimal for concentrations below saturation. Sensitization by suppressing repair has a similar though less distinct trend that is more affected by the radiation dose distribution. Conclusion: Models of sustained local radiosensitization show potential to increase the effectiveness of radiation in permanent prostate brachytherapy. INCeRTs with high drug capacity produce the greatest

A new variable interval schedule with constant hazard rate and finite time range.

Science.gov (United States)

Bugallo, Mehdi; Machado, Armando; Vasconcelos, Marco

2018-05-27

We propose a new variable interval (VI) schedule that achieves constant probability of reinforcement in time while using a bounded range of intervals. By sampling each trial duration from a uniform distribution ranging from 0 to 2 T seconds, and then applying a reinforcement rule that depends linearly on trial duration, the schedule alternates reinforced and unreinforced trials, each less than 2 T seconds, while preserving a constant hazard function. © 2018 Society for the Experimental Analysis of Behavior.

P wave dispersion and maximum P wave duration are independently associated with rapid renal function decline.

Science.gov (United States)

Su, Ho-Ming; Tsai, Wei-Chung; Lin, Tsung-Hsien; Hsu, Po-Chao; Lee, Wen-Hsien; Lin, Ming-Yen; Chen, Szu-Chia; Lee, Chee-Siong; Voon, Wen-Chol; Lai, Wen-Ter; Sheu, Sheng-Hsiung

2012-01-01

The P wave parameters measured by 12-lead electrocardiogram (ECG) are commonly used as noninvasive tools to assess for left atrial enlargement. There are limited studies to evaluate whether P wave parameters are independently associated with decline in renal function. Accordingly, the aim of this study is to assess whether P wave parameters are independently associated with progression to renal end point of ≥25% decline in estimated glomerular filtration rate (eGFR). This longitudinal study included 166 patients. The renal end point was defined as ≥25% decline in eGFR. We measured two ECG P wave parameters corrected by heart rate, i.e. corrected P wave dispersion (PWdisperC) and corrected P wave maximum duration (PWdurMaxC). Heart function and structure were measured from echocardiography. Clinical data, P wave parameters, and echocardiographic measurements were compared and analyzed. Forty-three patients (25.9%) reached renal end point. Kaplan-Meier curves for renal end point-free survival showed PWdisperC > median (63.0 ms) (log-rank P = 0.004) and PWdurMaxC > median (117.9 ms) (log-rank Pfunction decline.

Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

Directory of Open Access Journals (Sweden)

Supriya Kinger

2014-01-01

Full Text Available Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

Prediction based proactive thermal virtual machine scheduling in green clouds.

Science.gov (United States)

Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

2014-01-01

Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

Science.gov (United States)

Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

2014-01-01

Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated. PMID:24737962

Some effects of overall rate of earning reinforcers on run lengths and visit durations.

Science.gov (United States)

Macdonall, James S

2006-07-01

In a concurrent schedule, responding at each alternative is controlled by a pair of schedules that arrange reinforcers for staying at that alternative and reinforcers for switching to the other alternative. Each pair of schedules operates only while at the associated alternative. When only one pair of stay and switch schedules is presented, the rates of earning reinforcers for staying divided by the rates of earning reinforcers for switching controls the mean number responses in a visit and the mean duration of visits. The purpose of the present experiment was to see whether the sum of the rates of earning stay and switch reinforcers changed the way that run length and visit duration were affected by the ratio of the rates of stay to switch reinforcers. Rats were exposed to pairs of stay and switch schedules that varied both the ratio of the rates of earning stay and switch reinforcers and the sum of the rates of earning stay and switch reinforcers. Run lengths and visit durations were joint functions of the ratio of the rates of earning stay and switch reinforcers and the sum of the rates of earning stay and switch reinforcers. These results shows that the effect of the ratio of the sum of the rates of earning stay and switch reinforcers results from processes operating at the alternative, rather than from processes operating at both alternatives.

Cognitive Assessment in Long-Duration Space Flight

Science.gov (United States)

Kane, Robert; Seaton, Kimberly; Sipes, Walter

2011-01-01

This slide presentation reviews the development and use of a tool for assessing spaceflight cognitive ability in astronauts. This tool. the Spaceflight Cognitive Assessment Tool for Windows (WinSCAT) has been used to provide ISS flight surgeons with an objective clinical tool to monitor the astronauts cognitive status during long-duration space flight and allow immediate feedback to the astronaut. Its use is medically required for all long-duration missions and it contains a battery of five cognitive assessment subtests that are scheduled monthly and compared against the individual preflight baseline.

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

Science.gov (United States)

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

Scheduling with target start times

NARCIS (Netherlands)

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

1997-01-01

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

Sort-Mid tasks scheduling algorithm in grid computing.

Science.gov (United States)

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

2015-11-01

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

Modelling altered fractionation schedules

International Nuclear Information System (INIS)

Fowler, J.F.

1993-01-01

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

Uma proposta de solução para o problema da construção de escalas de motoristas e cobradores de ônibus por meio do algoritmo do matching de peso máximo A proposed solution for bus driver and fare collector scheduling problems using the maximum weight matching algorithm

Directory of Open Access Journals (Sweden)

Paulo Henrique Siqueira

2004-08-01

idle hours, thereby minimizing the operational costs of public transportation companies. In the first phase of this study, assuming that the timetables are already divided into long and short duration schedules, the short schedules can be combined to make up an employee's workday. This combination is done by the maximum weight Matching Algorithm, in which the scales are represented by vertices on a graph and the maximum weight is attributed to combinations of scales that do not lead to overtime or idle hours. In the second phase, a weekend schedule is assigned for every weekly work schedule. Based on these two phases, the weekly work schedules of bus drivers and bus fare collectors can be arranged at a minimal cost. The third and final phase of this study consisted of assigning a weekly work schedule to each bus driver and collector, considering his/her preferences. The maximum weight Matching Algorithm was also used in this phase. This method was applied in three public transportation companies in Curitiba, state of Paraná, which had until then used old heuristic algorithms based solely on managerial experience.

Optimization of operating schedule of machines in granite industry using evolutionary algorithms

International Nuclear Information System (INIS)

Loganthurai, P.; Rajasekaran, V.; Gnanambal, K.

2014-01-01

Highlights: • Operating time of machines in granite industries was studied. • Operating time has been optimized using evolutionary algorithms such as PSO, DE. • The maximum demand has been reduced. • Hence the electricity cost of the industry and feeder stress have been reduced. - Abstract: Electrical energy consumption cost plays an important role in the production cost of any industry. The electrical energy consumption cost is calculated as two part tariff, the first part is maximum demand cost and the second part is energy consumption cost or unit cost (kW h). The maximum demand cost can be reduced without affecting the production. This paper focuses on the reduction of maximum demand by proper operating schedule of major equipments. For this analysis, various granite industries are considered. The major equipments in granite industries are cutting machine, polishing machine and compressor. To reduce the maximum demand, the operating time of polishing machine is rescheduled by optimization techniques such as Differential Evolution (DE) and particle swarm optimization (PSO). The maximum demand costs are calculated before and after rescheduling. The results show that if the machines are optimally operated, the cost is reduced. Both DE and PSO algorithms reduce the maximum demand cost at the same rate for all the granite industries. However, the optimum scheduling obtained by DE reduces the feeder power flow than the PSO scheduling

Increasing operating room productivity by duration categories and a newsvendor model.

Science.gov (United States)

Lehtonen, Juha-Matti; Torkki, Paulus; Peltokorpi, Antti; Moilanen, Teemu

2013-01-01

Previous studies approach surgery scheduling mainly from the mathematical modeling perspective which is often hard to apply in a practical environment. The aim of this study is to develop a practical scheduling system that considers the advantages of both surgery categorization and newsvendor model to surgery scheduling. The research was carried out in a Finnish orthopaedic specialist centre that performs only joint replacement surgery. Four surgery categorization scenarios were defined and their productivity analyzed by simulation and newsvendor model. Detailed analyses of surgery durations and the use of more accurate case categories and their combinations in scheduling improved OR productivity 11.3 percent when compared to the base case. Planning to have one OR team to work longer led to remarkable decrease in scheduling inefficiency. In surgical services, productivity and cost-efficiency can be improved by utilizing historical data in case scheduling and by increasing flexibility in personnel management. The study increases the understanding of practical scheduling methods used to improve efficiency in surgical services.

‘It is time to prepare the next patient’ real-time prediction of procedure duration in laparoscopic cholecystectomies

NARCIS (Netherlands)

Geudon, A.C.P.; Paalvast, M.S.M.; Meeuwsen, F.C.; Tax, D.M.J.; van Dijke, A.P.; Wauben, L.S.G.L.; van der Elst, M; Dankelman, J.; van den Dobbelsteen, J.J.

2016-01-01

Operating Room (OR) scheduling is crucial to allow efficient use of ORs. Currently, the predicted durations of surgical procedures are unreliable and the OR schedulers have to follow the progress of the procedures in order to update the daily planning accordingly. The OR schedulers often acquire

Sort-Mid tasks scheduling algorithm in grid computing

Directory of Open Access Journals (Sweden)

Naglaa M. Reda

2015-11-01

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

Working multiple jobs over a day or a week: Short-term effects on sleep duration.

Science.gov (United States)

Marucci-Wellman, Helen R; Lombardi, David A; Willetts, Joanna L

Approximately 10% of the employed population in the United States works in multiple jobs. They are more likely to work long hours and in nonstandard work schedules, factors known to impact sleep duration and quality, and increase the risk of injury. In this study we used multivariate regression models to compare the duration of sleep in a 24-hour period between workers working in multiple jobs (MJHs) with single job holders (SJHs) controlling for other work schedule and demographic factors. We used data from the Bureau of Labor Statistics US American Time Use Survey (ATUS) pooled over a 9-year period (2003-2011). We found that MJHs had significantly reduced sleep duration compared with SJHs due to a number of independent factors, such as working longer hours and more often late at night. Male MJHs, working in their primary job or more than one job on the diary day, also had significantly shorter sleep durations (up to 40 minutes less on a weekend day) than male SJHs, even after controlling for all other factors. Therefore, duration of work hours, time of day working and duration of travel for work may not be the only factors to consider when understanding if male MJHs are able to fit in enough recuperative rest from their busy schedule. Work at night had the greatest impact on sleep duration for females, reducing sleep time by almost an hour compared with females who did not work at night. We also hypothesize that the high frequency or fragmentation of non-leisure activities (e.g. work and travel for work) throughout the day and between jobs may have an additional impact on the duration and quality of sleep for MJHs.

Techniques for establishing schedules with wheel running as reinforcement in rats.

Science.gov (United States)

Iversen, I H

1993-07-01

In three experiments, access to wheel running was contingent on lever pressing. In each experiment, the duration of access to running was reduced gradually to 4, 5, or 6 s, and the schedule parameters were expanded gradually. The sessions lasted 2 hr. In Experiment 1, a fixed-ratio 20 schedule controlled a typical break-and-run pattern of lever pressing that was maintained throughout the session for 3 rats. In Experiment 2, a fixed-interval schedule of 6 min maintained lever pressing throughout the session for 3 rats, and for 1 rat, the rate of lever pressing was positively accelerated between reinforcements. In Experiment 3, a variable-ratio schedule of 20 or 35 was in effect and maintained lever pressing at a very stable pace throughout the session for 2 of 3 rats; for 1 rat, lever pressing was maintained at an irregular rate. When the session duration was extended to successive 24-hr periods, with food and water accessible in Experiment 3, lever pressing settled into a periodic pattern occurring at a high rate at approximately the same time each day. In each experiment, the rats that developed the highest local rates of running during wheel access also maintained the most stable and highest rates of lever pressing.

OL-DEC-MDP Model for Multiagent Online Scheduling with a Time-Dependent Probability of Success

Directory of Open Access Journals (Sweden)

Cheng Zhu

2014-01-01

Full Text Available Focusing on the on-line multiagent scheduling problem, this paper considers the time-dependent probability of success and processing duration and proposes an OL-DEC-MDP (opportunity loss-decentralized Markov Decision Processes model to include opportunity loss into scheduling decision to improve overall performance. The success probability of job processing as well as the process duration is dependent on the time at which the processing is started. The probability of completing the assigned job by an agent would be higher when the process is started earlier, but the opportunity loss could also be high due to the longer engaging duration. As a result, OL-DEC-MDP model introduces a reward function considering the opportunity loss, which is estimated based on the prediction of the upcoming jobs by a sampling method on the job arrival. Heuristic strategies are introduced in computing the best starting time for an incoming job by each agent, and an incoming job will always be scheduled to the agent with the highest reward among all agents with their best starting policies. The simulation experiments show that the OL-DEC-MDP model will improve the overall scheduling performance compared with models not considering opportunity loss in heavy-loading environment.

Developing Project Duration Models in Software Engineering

Institute of Scientific and Technical Information of China (English)

Pierre Bourque; Serge Oligny; Alain Abran; Bertrand Fournier

2007-01-01

Based on the empirical analysis of data contained in the International Software Benchmarking Standards Group(ISBSG) repository, this paper presents software engineering project duration models based on project effort. Duration models are built for the entire dataset and for subsets of projects developed for personal computer, mid-range and mainframeplatforms. Duration models are also constructed for projects requiring fewer than 400 person-hours of effort and for projectsre quiring more than 400 person-hours of effort. The usefulness of adding the maximum number of assigned resources as asecond independent variable to explain duration is also analyzed. The opportunity to build duration models directly fromproject functional size in function points is investigated as well.

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

NARCIS (Netherlands)

Liao, F.

2016-01-01

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies

Cost-efficient scheduling of FAST observations

Science.gov (United States)

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

2018-03-01

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

Negotiating on location, timing, duration, and participant in agent-mediated joint activity-travel scheduling

NARCIS (Netherlands)

Ma, Huiye; Ronald, N.A.; Arentze, T.A.; Timmermans, H.J.P.

2013-01-01

Agent-based simulation has become an important modeling approach in activity-travel analysis. Social activities account for a large amount of travel and have an important effect on activity-travel scheduling. Participants in joint activities usually have various options regarding location,

An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility

Directory of Open Access Journals (Sweden)

Lianfei Yu

2017-01-01

Full Text Available Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.

Master schedule for CY-1981 Hanford environmental surveillance routine program

International Nuclear Information System (INIS)

Blumer, P.J.; Sula, M.J.; Eddy, P.A.

1980-12-01

The current schedule of data collection for the routine environmental surveillance program at the Hanford Site is provided. Questions about specific entries should be referred to the authors since modifications to the schedule are made during the year and special areas of study, usually of short duration, are not scheduled. The environmental surveillance program objectives are to evaluate the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in Manual Chapter 0513, and to monitor Hanford operations for compliance with applicable environmental criteria given in Manual Chapter 0524 and Washington State Water Quality Standards. Air quality data obtained in a separate program are also reported. The collection schedule for potable water is shown but it is not part of the routine environmental surveillance program. Schedules are presented for the following subjects: air, Columbia River, sanitary water, surface water, ground water, foodstuffs, wildlife, soil and vegetation, external radiation measurement, portable instrument surveys, and surveillance of waste disposal sites

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.

2018-03-01

The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.

Sleep schedules and school performance in Indigenous Australian children.

Science.gov (United States)

Blunden, Sarah; Magee, Chris; Attard, Kelly; Clarkson, Larissa; Caputi, Peter; Skinner, Timothy

2018-04-01

Sleep duration and sleep schedule variability have been related to negative health and well-being outcomes in children, but little is known about Australian Indigenous children. Data for children aged 7-9 years came from the Australian Longitudinal Study of Indigenous Children and the National Assessment Program-Literacy and Numeracy (NAPLAN). Latent class analysis determined sleep classes taking into account sleep duration, bedtimes, waketimes, and variability in bedtimes from weekdays to weekends. Regression models tested whether the sleep classes were cross-sectionally associated with grade 3 NAPLAN scores. Latent change score modeling then examined whether the sleep classes predicted changes in NAPLAN performance from grades 3 to 5. Five sleep schedule classes were identified: normative sleep, early risers, long sleep, variable sleep, and short sleep. Overall, long sleepers performed best, with those with reduced sleep (short sleepers and early risers) performing the worse on grammar, numeracy, and writing performance. Latent change score results also showed that long sleepers performed best in spelling and writing and short sleepers and typical sleepers performed the worst over time. In this sample of Australian Indigenous children, short sleep was associated with poorer school performance compared with long sleep, with this performance worsening over time for some performance indicators. Other sleep schedules (eg, early wake times and variable sleep) also had some relationships with school performance. As sleep scheduling is modifiable, this offers opportunity for improvement in sleep and thus performance outcomes for these and potentially all children. Copyright © 2018 National Sleep Foundation. Published by Elsevier Inc. All rights reserved.

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

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

2013-01-01

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

Development of Milestone Schedules for Selected Logistics Support Directorate Programs. Appendix A. Part 2. Task Summaries.

Science.gov (United States)

1987-09-15

LOGISTIC SUPPORT (ILS) COST ESTIMATE SCODE NUMBER: NONE -ESPONSIBILITY: ROY & ILS ’,!,RATION: 22.00 WORK DAYS A-221 * .9 ..- 9 * PAGE: .LSMTEST SCHEDULE: CE...0/ TIPO SCHEDULE: DV CONDUCT A PERFORMANCE DEMONSTRATION PRIOR TO TECHNICAL TEST CODE NUMBER: NONE (TT) I AND USER TEST (UT) I. RESPONSIBILITY...RESPONSIBILITY: BELVOIR LAB DURATION: 20.00 WORK DAYS ENG DE I SCHEDULE: DV ENGINEERING DESIGN INITIATED. CODE NUMBER: NONE RESPONSIBILITY: BELVOIR LAB

A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

DEFF Research Database (Denmark)

Wen, Min; Krapper, Emil; Larsen, Jesper

2011-01-01

in their fresh meat supply logistics system. The problem consists of a 1‐week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, and a break rule......The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Crown....... The objective is to minimize the total delivery cost that is a weighted sum of two kinds of delivery costs. A multilevel variable neighborhood search heuristic is proposed for the problem. In a preprocessing step, the problem size is reduced through an aggregation procedure. Thereafter, the aggregated weekly...

A Review Of Fault Tolerant Scheduling In Multicore Systems

Directory of Open Access Journals (Sweden)

Shefali Malhotra

2015-05-01

Full Text Available Abstract In this paper we have discussed about various fault tolerant task scheduling algorithm for multi core system based on hardware and software. Hardware based algorithm which is blend of Triple Modulo Redundancy and Double Modulo Redundancy in which Agricultural Vulnerability Factor is considered while deciding the scheduling other than EDF and LLF scheduling algorithms. In most of the real time system the dominant part is shared memory.Low overhead software based fault tolerance approach can be implemented at user-space level so that it does not require any changes at application level. Here redundant multi-threaded processes are used. Using those processes we can detect soft errors and recover from them. This method gives low overhead fast error detection and recovery mechanism. The overhead incurred by this method ranges from 0 to 18 for selected benchmarks. Hybrid Scheduling Method is another scheduling approach for real time systems. Dynamic fault tolerant scheduling gives high feasibility rate whereas task criticality is used to select the type of fault recovery method in order to tolerate the maximum number of faults.

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

KAUST Repository

Douik, Ahmed

2017-09-07

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

ELIMINATION OF THE DISADVANTAGES OF SCHEDULING-NETWORK PLANNING BY APPLYING THE MATRIX OF KEY PROJECT EVENTS

OpenAIRE

Morozenko Andrey Aleksandrovich; Krasovskiy Dmitriy Viktorovich

2017-01-01

The article discusses the current disadvantages of the scheduling-network planning in the management of the terms of investment-construction project. Problems associated with the construction of the schedule and the definitions of the duration of the construction project are being studied. The problems of project management for the management apparatus are shown, which consists in the absence of mechanisms for prompt response to deviations in the parameters of the scheduling-network diagram. ...

Vehicle scheduling schemes for commercial and emergency logistics integration.

Science.gov (United States)

Li, Xiaohui; Tan, Qingmei

2013-01-01

In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

Probabilistic maximum-value wind prediction for offshore environments

DEFF Research Database (Denmark)

Staid, Andrea; Pinson, Pierre; Guikema, Seth D.

2015-01-01

statistical models to predict the full distribution of the maximum-value wind speeds in a 3 h interval. We take a detailed look at the performance of linear models, generalized additive models and multivariate adaptive regression splines models using meteorological covariates such as gust speed, wind speed......, convective available potential energy, Charnock, mean sea-level pressure and temperature, as given by the European Center for Medium-Range Weather Forecasts forecasts. The models are trained to predict the mean value of maximum wind speed, and the residuals from training the models are used to develop...... the full probabilistic distribution of maximum wind speed. Knowledge of the maximum wind speed for an offshore location within a given period can inform decision-making regarding turbine operations, planned maintenance operations and power grid scheduling in order to improve safety and reliability...

An Experimental Study of Scheduling and Duration of "Tier 2" First-Grade Reading Intervention

Science.gov (United States)

Denton, Carolyn A.; Cirino, Paul T.; Barth, Amy E.; Romain, Melissa; Vaughn, Sharon; Wexler, Jade; Francis, David J.; Fletcher, Jack M.

2011-01-01

This study compared the effects on reading outcomes of delivering supplemental, small-group intervention to first-grade students at risk for reading difficulties randomly assigned to one of three different treatment schedules: extended (4 sessions per week, 16 weeks; n = 66), concentrated (4 sessions per week, 8 weeks; n = 64), or distributed (2…

The influence of the operating schedule of the Greek Research Reactor on the radiological consequences of the reactor

International Nuclear Information System (INIS)

Kollas, J.G.

1986-04-01

The sensitivity of the radiological consequences of the Greek Research Reactor to the operating schedule of the reactor is assessed in this report. The consequences are due to the occurrence of a postulated accident, a 20% core melt loss of coolant accident. Three different operating schedules are considered: (a) the present 8 hrs/day, 5 days/wk schedule, (b) a 16 hrs/day, 5 days/wk schedule, and (c) a continuous operation schedule. The results of the analysis indicate that there is a direct relation between consequences and duration of operation. (author)

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

Directory of Open Access Journals (Sweden)

Zhou Erming

2017-01-01

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

Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

Science.gov (United States)

Muhamad Badri, Huda; Deros, Baba Md; Syahri, M.; Saleh, Chairul; Fitria, Aninda

2016-02-01

The learning curve shows the relationship between time and the cumulative number of units produced which using the mathematical description on the performance of workers in performing repetitive works. The problems of this study is level differences in the labors performance before and after the break which affects the company's production scheduling. The study was conducted in the garment industry, which the aims is to predict the company production scheduling using the learning curve and forgetting curve. By implementing the learning curve and forgetting curve, this paper contributes in improving the labors performance that is in line with the increase in maximum output 3 hours productive before the break are 15 unit product with learning curve percentage in the company is 93.24%. Meanwhile, the forgetting curve improving maximum output 3 hours productive after the break are 11 unit product with the percentage of forgetting curve in the company is 92.96%. Then, the obtained 26 units product on the productive hours one working day is used as the basic for production scheduling.

Multidrug resistance circumvention by a new triazinoaminopiperidine derivative S9788 in vitro: definition of the optimal schedule and comparison with verapamil.

Science.gov (United States)

Julia, A. M.; Roché, H.; Berlion, M.; Lucas, C.; Milano, G.; Robert, J.; Bizzari, J. P.; Canal, P.

1994-01-01

The current work was undertaken to investigate the importance of exposure sequence and duration in achieving the maximum reversal action of S9788 on doxorubicin (DOX) cytotoxicity against cells that exhibit the (MDR) multidrug resistance phenotype: the MCF7/DOX cell line. Accumulation and release of DOX were examined in this cell line. The reversal effect was compared with that obtained with verapamil. S9788 activity was schedule dependent: when comparing incubation with S9788 before or after treatment with DOX, the best reversal factor was obtained in the case of a post-treatment incubation (65.6 +/- 7.7 vs 20.8 +/- 7.0). S9788 was a more potent modulating agent than verapamil, whatever the schedule of exposure of the cells to the reversal agent. The reversal of resistance after short-term DOX exposures was caused not only by prolonged cellular accumulation of DOX, but also by its prolonged retention after transfer of cells to DOX-free medium. A relationship was noted between cellular exposure to DOX and the cytotoxic effect, and so the reversal of resistance induced by S9788 appears to be directly linked to the level of cell exposure to DOX. This work provided a rationale for improving the schedule of administration of S9788 in clinical trials. PMID:8180016

Multi-Time Scale Coordinated Scheduling Strategy with Distributed Power Flow Controllers for Minimizing Wind Power Spillage

Directory of Open Access Journals (Sweden)

Yi Tang

2017-11-01

Full Text Available The inherent variability and randomness of large-scale wind power integration have brought great challenges to power flow control and dispatch. The distributed power flow controller (DPFC has the higher flexibility and capacity in power flow control in the system with wind generation. This paper proposes a multi-time scale coordinated scheduling model with DPFC to minimize wind power spillage. Configuration of DPFCs is initially determined by stochastic method. Afterward, two sequential procedures containing day-head and real-time scales are applied for determining maximum schedulable wind sources, optimal outputs of generating units and operation setting of DPFCs. The generating plan is obtained initially in day-ahead scheduling stage and modified in real-time scheduling model, while considering the uncertainty of wind power and fast operation of DPFC. Numerical simulation results in IEEE-RTS79 system illustrate that wind power is maximum scheduled with the optimal deployment and operation of DPFC, which confirms the applicability and effectiveness of the proposed method.

Statistical analysis of random duration times

International Nuclear Information System (INIS)

Engelhardt, M.E.

1996-04-01

This report presents basic statistical methods for analyzing data obtained by observing random time durations. It gives nonparametric estimates of the cumulative distribution function, reliability function and cumulative hazard function. These results can be applied with either complete or censored data. Several models which are commonly used with time data are discussed, and methods for model checking and goodness-of-fit tests are discussed. Maximum likelihood estimates and confidence limits are given for the various models considered. Some results for situations where repeated durations such as repairable systems are also discussed

Work schedule influence on sleep habits in elementary and high school teachers according to chronotype

Directory of Open Access Journals (Sweden)

Jane Carla de Souza

2014-09-01

Full Text Available The influence of work schedule on sleep habits and quality, and daytime sleepiness according to individual preferences in sleep schedules was assessed in 131 elementary and high school teachers through questionnaires. Teachers who initiate classes around 7:00 hr wake up earlier and show more frequency of poor sleep quality than those who start classes in the afternoon. Between them, those who have a preference for intermediate or later hours for sleep are more irregular in their wake up schedules and increase their sleep duration on the weekend compared to those with earlier sleep preferences. On the other hand, working only in the afternoon seems to provide better sleep/awake conditions for teachers, because they keep the same sleep duration during the week and on the weekend, and they are diagnosed with less daytime sleepiness. Therefore, the discussion of school start times, originally proposed for adolescents, needs to be magnified to teachers, contributing to improvement of sleep habits and life quality in school environments.

Optimization of Multiperiod Mixed Train Schedule on High-Speed Railway

Directory of Open Access Journals (Sweden)

Wenliang Zhou

2015-01-01

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

Cross-layer optimized rate adaptation and scheduling for multiple-user wireless video streaming

NARCIS (Netherlands)

Ozcelebi, T.; Sunay, M.O.; Tekalp, A.M.; Civanlar, M.R.

2007-01-01

We present a cross-layer optimized video rate adaptation and user scheduling scheme for multi-user wireless video streaming aiming for maximum quality of service (QoS) for each user,, maximum system video throughput, and QoS fairness among users. These objectives are jointly optimized using a

Analysis of the Swift Gamma-Ray Bursts duration

International Nuclear Information System (INIS)

Horvath, I.; Veres, P.; Balazs, L. G.; Kelemen, J.; Bagoly, Z.; Tusnady, G.

2008-01-01

Two classes of gamma-ray bursts have been identified in the BATSE catalogs characterized by durations shorter and longer than about 2 seconds. There are, however, some indications for the existence of a third type of burst. Swift satellite detectors have different spectral sensitivity than pre-Swift ones for gamma-ray bursts. Therefore it is worth to reanalyze the durations and their distribution and also the classification of GRBs. Using The First BAT Catalog the maximum likelihood estimation was used to analyzed the duration distribution of GRBs. The three log-normal fit is significantly (99.54% probability) better than the two for the duration distribution. Monte-Carlo simulations also confirm this probability (99.2%).

Null Space Based Preemptive Scheduling For Joint URLLC and eMBB Traffic in 5G Networks

DEFF Research Database (Denmark)

Abdul-Mawgood Ali Ali Esswie, Ali; Pedersen, Klaus

2018-01-01

In this paper, we propose a null-space-based preemptive scheduling framework for cross-objective optimization to always guarantee robust URLLC performance, while extracting the maximum possible eMBB capacity. The proposed scheduler perpetually grants incoming URLLC traffic a higher priority for i...

Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

KAUST Repository

Zafar, Ammar

2012-09-16

In this paper, we propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal priority weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum rate scheduler and the proportional fair scheduler. We demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

ELIMINATION OF THE DISADVANTAGES OF SCHEDULING-NETWORK PLANNING BY APPLYING THE MATRIX OF KEY PROJECT EVENTS

Directory of Open Access Journals (Sweden)

Morozenko Andrey Aleksandrovich

2017-07-01

Full Text Available The article discusses the current disadvantages of the scheduling-network planning in the management of the terms of investment-construction project. Problems associated with the construction of the schedule and the definitions of the duration of the construction project are being studied. The problems of project management for the management apparatus are shown, which consists in the absence of mechanisms for prompt response to deviations in the parameters of the scheduling-network diagram. A new approach to planning the implementation of an investment-construction project based on a matrix of key events and a rejection of the current practice of determining the duration based on inauthentic regulatory data. An algorithm for determining the key events of the project is presented. For increase the reliability of the organizational structure, the load factor of the functional block in the process of achieving the key event is proposed. Recommendations for improving the interaction of the participants in the investment-construction project are given.

A preliminary analysis of the reactor-based plutonium disposition alternative deployment schedules

International Nuclear Information System (INIS)

Zurn, R.M.

1997-09-01

This paper discusses the preliminary analysis of the implementation schedules of the reactor-based plutonium disposition alternatives. These schedule analyses are a part of a larger process to examine the nine decision criteria used to determine the most appropriate method of disposing of U.S. surplus weapons plutonium. The preliminary analysis indicates that the mission durations for the reactor-based alternatives range from eleven years to eighteen years and the initial mission fuel assemblies containing surplus weapons-usable plutonium could be loaded into the reactors between nine and fourteen years after the Record of Decision

Rats do not respond differently in the presence of stimuli signaling wheel-running reinforcers of different durations.

Science.gov (United States)

Belke, Terry W

2007-05-01

Rats were exposed to a fixed interval 30 s schedule that produced opportunities to run of equal or unequal durations to assess the effect of differences in duration on responding. Each duration was signaled by a different stimulus. Wheel-running reinforcer duration pairs were 30 s 30 s, 50 s 10 s, and 55 s 5 s. An analysis of median postreinforcement pause duration and mean local lever-pressing rates broken down by previous reinforcer duration and duration of signaled upcoming reinforcer showed that postreinforcement pause duration was affected by the duration of the previous reinforcer but not by the stimulus signaling the duration of the upcoming reinforcer. Local lever-pressing rates were not affected by either previous or upcoming reinforcer duration. In general, the results are consistent with indifference between these durations obtained using a concurrent choice procedure.

Integrated Cost and Schedule using Monte Carlo Simulation of a CPM Model - 12419

Energy Technology Data Exchange (ETDEWEB)

Hulett, David T. [Hulett and Associates, LLC (United States); Nosbisch, Michael R. [Project Time and Cost, Inc. (United States)

2012-07-01

This discussion of the recommended practice (RP) 57R-09 of AACE International defines the integrated analysis of schedule and cost risk to estimate the appropriate level of cost and schedule contingency reserve on projects. The main contribution of this RP is to include the impact of schedule risk on cost risk and hence on the need for cost contingency reserves. Additional benefits include the prioritizing of the risks to cost, some of which are risks to schedule, so that risk mitigation may be conducted in a cost-effective way, scatter diagrams of time-cost pairs for developing joint targets of time and cost, and probabilistic cash flow which shows cash flow at different levels of certainty. Integrating cost and schedule risk into one analysis based on the project schedule loaded with costed resources from the cost estimate provides both: (1) more accurate cost estimates than if the schedule risk were ignored or incorporated only partially, and (2) illustrates the importance of schedule risk to cost risk when the durations of activities using labor-type (time-dependent) resources are risky. Many activities such as detailed engineering, construction or software development are mainly conducted by people who need to be paid even if their work takes longer than scheduled. Level-of-effort resources, such as the project management team, are extreme examples of time-dependent resources, since if the project duration exceeds its planned duration the cost of these resources will increase over their budgeted amount. The integrated cost-schedule risk analysis is based on: - A high quality CPM schedule with logic tight enough so that it will provide the correct dates and critical paths during simulation automatically without manual intervention. - A contingency-free estimate of project costs that is loaded on the activities of the schedule. - Resolves inconsistencies between cost estimate and schedule that often creep into those documents as project execution proceeds

Constraint optimization model of a scheduling problem for a robotic arm in automatic systems

DEFF Research Database (Denmark)

Kristiansen, Ewa; Smith, Stephen F.; Kristiansen, Morten

2014-01-01

are characteristics of the painting process application itself. Unlike spot-welding, painting tasks require movement of the entire robot arm. In addition to minimizing intertask duration, the scheduler must strive to maximize painting quality and the problem is formulated as a multi-objective optimization problem....... The scheduling model is implemented as a stand-alone module using constraint programming, and integrated with a larger automatic system. The results of a number of simulation experiments with simple parts are reported, both to characterize the functionality of the scheduler and to illustrate the operation...... of the entire software system for automatic generation of robot programs for painting....

Second unit scheduling concerns on a dual-unit nuclear project

International Nuclear Information System (INIS)

Block, H.R.; Mazzini, R.A.

1978-01-01

This paper explores the planning and scheduling problems of Unit 2 of the Susquehanna steam electric station. The causes of these problems and methods to avoid or mitigate their consequences are discussed. The Susquehanna steam electric station has two boiling water reactors rated at 1,100 MW each. Topics considered include cost factors, structures, equipment, engineering and home office, construction services, completion data phasing, work sequencing, structural dependences, and segregation. Substatial cost and schedule benefits can result if two nuclear units are designed and constructed as one integral station, and if maximum sharing of facilities and services between the units occurs. It is concluded that the cost benefits of highly integrated dual unit construction outweigh the schedule and logistical problems caused by that approach

Are behaviors at one alternative in concurrent schedules independent of contingencies at the other alternative?

Science.gov (United States)

MacDonall, James S

2017-09-01

Some have reported changing the schedule at one alternative of a concurrent schedule changed responding at the other alternative (Catania, 1969), which seems odd because no contingencies were changed there. When concurrent schedules are programmed using two schedules, one associated with each alternative that operate continuously, changing the schedule at one alternative also changes the switch schedule at the other alternative. Thus, changes in responding at the constant alternative could be due to the change in the switch schedule. To assess this possibility, six rats were exposed to a series of conditions that alternated between pairs of interval schedules at both alternatives and a pair of interval schedules at one, constant, alternative and a pair of extinction schedules at the other alternative. Comparing run lengths, visit durations and response rates at the constant alternative in the alternating conditions did not show consistent increases and decreases when a strict criterion for changes was used. Using a less stringent definition (any change in mean values) showed changes. The stay/switch analysis suggests it may be inaccurate to apply behavioral contrast to procedures that change from concurrent variable-interval variable-interval schedules to concurrent variable-interval extinction schedules because the contingencies in neither alternative are constant. © 2017 Society for the Experimental Analysis of Behavior.

Erosivity under two durations of maximum rain intensities in Pelotas/RS = Erosividade sob duas durações de intensidades máximas da chuva em Pelotas - RS

Directory of Open Access Journals (Sweden)

Jacira Porto dos Santos

2012-04-01

Full Text Available In the Universal Equation of Soil Loss (USLE, erosivity is the factor related to rain and express its potential to cause soil erosion, being necessary to know its kinetic energy and the maximum intensities of rain in duration of 30 min. Thus, the aim of this study was to verify and quantify the impact of the rain duration, considering 15 and 30 min, on the USLE erosivity factor. To achieve this, 863 rain gauge records were used, duiring the period of 1983 to 1998 in the city of Pelotas, RS, obtained from the Agrometeorological Station - Covenant EMBRAPA/UFPel, INMET (31o51´S; 52o21´O and altitude of 13,2 m. With the records, it was estimated the erosivity values from the maximum intensities of rain during the period evaluated. The average annual values of erosivity was 2551,3 MJ ha-1 h-1 ano-1 and 1406,1 MJ ha-1 h-1 ano-1, for the average intensities of 6,40 mm h-1 and 3,74 mm h-1, in durations of 15 and 30 min, respectively. The results of this study have shown that the percentage of erosive rainfalls in relation to the total precipitation was of 91.0%, and that the erosivity was influenced by the duration of the maximum intensity of rain.= Na Equação Universal de Perdas de Solo (EUPS a erosividade é o fator relacionado à chuva e expressa o seu potencial em provocar a erosão do solo, sendo necessário que se conheça a energia cinética da mesma e as máximas intensidades da chuva na duração de 30 min. Objetivou-se com este trabalho verificar e quantificar o impacto da duração da chuva, considerando 15 e 30 min, sobre o fator erosividade da EUPS. Para tanto foram utilizados 863 registros pluviográficos de chuva, no período de 1983 a 1998 da localidade de Pelotas, RS, obtidos na Estação Agroclimatológica – Convênio EMBRAPA/UFPel, INMET (31o51´S;52o21´O e altitude de 13,2 m. Com os registros foram estimados os valores de erosividade a partir de intensidades máximas de chuva nas durações consideradas. Os valores m

Multiple time-scale optimization scheduling for islanded microgrids including PV, wind turbine, diesel generator and batteries

DEFF Research Database (Denmark)

Xiao, Zhao xia; Nan, Jiakai; Guerrero, Josep M.

2017-01-01

A multiple time-scale optimization scheduling including day ahead and short time for an islanded microgrid is presented. In this paper, the microgrid under study includes photovoltaics (PV), wind turbine (WT), diesel generator (DG), batteries, and shiftable loads. The study considers the maximum...... efficiency operation area for the diesel engine and the cost of the battery charge/discharge cycle losses. The day-ahead generation scheduling takes into account the minimum operational cost and the maximum load satisfaction as the objective function. Short-term optimal dispatch is based on minimizing...

An Efficient Algorithm for the Maximum Distance Problem

Directory of Open Access Journals (Sweden)

Gabrielle Assunta Grün

2001-12-01

Full Text Available Efficient algorithms for temporal reasoning are essential in knowledge-based systems. This is central in many areas of Artificial Intelligence including scheduling, planning, plan recognition, and natural language understanding. As such, scalability is a crucial consideration in temporal reasoning. While reasoning in the interval algebra is NP-complete, reasoning in the less expressive point algebra is tractable. In this paper, we explore an extension to the work of Gerevini and Schubert which is based on the point algebra. In their seminal framework, temporal relations are expressed as a directed acyclic graph partitioned into chains and supported by a metagraph data structure, where time points or events are represented by vertices, and directed edges are labelled with < or ≤. They are interested in fast algorithms for determining the strongest relation between two events. They begin by developing fast algorithms for the case where all points lie on a chain. In this paper, we are interested in a generalization of this, namely we consider the problem of finding the maximum ``distance'' between two vertices in a chain ; this problem arises in real world applications such as in process control and crew scheduling. We describe an O(n time preprocessing algorithm for the maximum distance problem on chains. It allows queries for the maximum number of < edges between two vertices to be answered in O(1 time. This matches the performance of the algorithm of Gerevini and Schubert for determining the strongest relation holding between two vertices in a chain.

Updating Linear Schedules with Lowest Cost: a Linear Programming Model

Science.gov (United States)

Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

2017-10-01

Many civil engineering projects involve sets of tasks repeated in a predefined sequence in a number of work areas along a particular route. A useful graphical representation of schedules of such projects is time-distance diagrams that clearly show what process is conducted at a particular point of time and in particular location. With repetitive tasks, the quality of project performance is conditioned by the ability of the planner to optimize workflow by synchronizing the works and resources, which usually means that resources are planned to be continuously utilized. However, construction processes are prone to risks, and a fully synchronized schedule may expire if a disturbance (bad weather, machine failure etc.) affects even one task. In such cases, works need to be rescheduled, and another optimal schedule should be built for the changed circumstances. This typically means that, to meet the fixed completion date, durations of operations have to be reduced. A number of measures are possible to achieve such reduction: working overtime, employing more resources or relocating resources from less to more critical tasks, but they all come at a considerable cost and affect the whole project. The paper investigates the problem of selecting the measures that reduce durations of tasks of a linear project so that the cost of these measures is kept to the minimum and proposes an algorithm that could be applied to find optimal solutions as the need to reschedule arises. Considering that civil engineering projects, such as road building, usually involve less process types than construction projects, the complexity of scheduling problems is lower, and precise optimization algorithms can be applied. Therefore, the authors put forward a linear programming model of the problem and illustrate its principle of operation with an example.

Intercell scheduling: A negotiation approach using multi-agent coalitions

Science.gov (United States)

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

2016-10-01

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

One Improvement Method of Reducing Duration Directly to Solve Time-Cost Tradeoff Problem

Science.gov (United States)

Jian-xun, Qi; Dedong, Sun

Time and cost are two of the most important factors for project plan and schedule management, and specially, time-cost tradeoff problem is one classical problem in project scheduling, which is also a difficult problem. Methods of solving the problem mainly contain method of network flow and method of mending the minimal cost. Thereinto, for the method of mending the minimal cost is intuitionistic, convenient and lesser computation, these advantages make the method being used widely in practice. But disadvantage of the method is that the result of each step is optimal but the terminal result maybe not optimal. In this paper, firstly, method of confirming the maximal effective quantity of reducing duration is designed; secondly, on the basis of above method and the method of mending the minimal cost, the main method of reducing duration directly is designed to solve time-cost tradeoff problem, and by analyzing validity of the method, the method could obtain more optimal result for the problem.

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

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

1998-01-01

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

Road transport of farm animals: effects of journey duration on animal welfare

DEFF Research Database (Denmark)

Nielsen, Birte Lindstrøm; Dybkjær, Lise; Herskin, Mette S

2011-01-01

Transport of farm animals gives rise to concern about their welfare. Specific attention has been given to the duration of animal transport, and maximum journey durations are used in legislation that seek to minimise any negative impact of transport on animal welfare. This paper reviews the relati...

Maximum total organic carbon limit for DWPF melter feed

International Nuclear Information System (INIS)

Choi, A.S.

1995-01-01

DWPF recently decided to control the potential flammability of melter off-gas by limiting the total carbon content in the melter feed and maintaining adequate conditions for combustion in the melter plenum. With this new strategy, all the LFL analyzers and associated interlocks and alarms were removed from both the primary and backup melter off-gas systems. Subsequently, D. Iverson of DWPF- T ampersand E requested that SRTC determine the maximum allowable total organic carbon (TOC) content in the melter feed which can be implemented as part of the Process Requirements for melter feed preparation (PR-S04). The maximum TOC limit thus determined in this study was about 24,000 ppm on an aqueous slurry basis. At the TOC levels below this, the peak concentration of combustible components in the quenched off-gas will not exceed 60 percent of the LFL during off-gas surges of magnitudes up to three times nominal, provided that the melter plenum temperature and the air purge rate to the BUFC are monitored and controlled above 650 degrees C and 220 lb/hr, respectively. Appropriate interlocks should discontinue the feeding when one or both of these conditions are not met. Both the magnitude and duration of an off-gas surge have a major impact on the maximum TOC limit, since they directly affect the melter plenum temperature and combustion. Although the data obtained during recent DWPF melter startup tests showed that the peak magnitude of a surge can be greater than three times nominal, the observed duration was considerably shorter, on the order of several seconds. The long surge duration assumed in this study has a greater impact on the plenum temperature than the peak magnitude, thus making the maximum TOC estimate conservative. Two models were used to make the necessary calculations to determine the TOC limit

Improved irrigation scheduling for pear-jujube trees based on trunk ...

African Journals Online (AJOL)

A suitable indicator for scheduling pear-jujube (Ziziphus jujuba Mill.) irrigation in China was developed based on trunk diameter fluctuations (TDF). Parameters derived from TDF responses to variations in soil matrix potential (Ψsoil) were compared under deficit and well irrigation. Maximum daily shrinkage (MDS) increased ...

Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

Science.gov (United States)

Alvarado, Michelle; Ntaimo, Lewis

2018-03-01

Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness

Directory of Open Access Journals (Sweden)

Rui Zhang

2013-04-01

Full Text Available A decomposition-based optimization algorithm is proposed for solving large job shop scheduling problems with the objective of minimizing the maximum lateness. First, we use the constraint propagation theory to derive the orientation of a portion of disjunctive arcs. Then we use a simulated annealing algorithm to find a decomposition policy which satisfies the maximum number of oriented disjunctive arcs. Subsequently, each subproblem (corresponding to a subset of operations as determined by the decomposition policy is successively solved with a simulated annealing algorithm, which leads to a feasible solution to the original job shop scheduling problem. Computational experiments are carried out for adapted benchmark problems, and the results show the proposed algorithm is effective and efficient in terms of solution quality and time performance.

Comparing fixed-amount and progressive-amount DRO Schedules for tic suppression in youth with chronic tic disorders.

Science.gov (United States)

Capriotti, Matthew R; Turkel, Jennifer E; Johnson, Rachel A; Espil, Flint M; Woods, Douglas W

2017-01-01

Chronic tic disorders (CTDs) involve motor and/or vocal tics that often cause substantial distress and impairment. Differential reinforcement of other behavior (DRO) schedules of reinforcement produce robust, but incomplete, reductions in tic frequency in youth with CTDs; however, a more robust reduction may be needed to affect durable clinical change. Standard, fixed-amount DRO schedules have not commonly yielded such reductions, so we evaluated a novel, progressive-amount DRO schedule, based on its ability to facilitate sustained abstinence from functionally similar behaviors. Five youth with CTDs were exposed to periods of baseline, fixed-amount DRO (DRO-F), and progressive-amount DRO (DRO-P). Both DRO schedules produced decreases in tic rate and increases in intertic interval duration, but no systematic differences were seen between the two schedules on any dimension of tic occurrence. The DRO-F schedule was generally preferred to the DRO-P schedule. Possible procedural improvements and other future directions are discussed. © 2016 Society for the Experimental Analysis of Behavior.

Refinery scheduling

Energy Technology Data Exchange (ETDEWEB)

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

2004-07-01

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

Power scheduling in islanded-mode microgrids using fuel cell vehicles

NARCIS (Netherlands)

Alavi, Farid; Van De Wouw, Nathan; De Schutter, Bart

2018-01-01

We consider power scheduling in a microgrid operated in the islanded mode. It is assumed that at any time all the renewable energy sources are generating the maximum achievable electrical power based on the weather conditions and the power balance of the microgrid is exclusively done by a fleet of

Scheduling language and algorithm development study. Volume 2: Use of the basic language and module library

Science.gov (United States)

Chamberlain, R. A.; Cornick, D. E.; Flater, J. F.; Odoherty, R. J.; Peterson, F. M.; Ramsey, H. R.; Willoughby, J. K.

1974-01-01

The capabilities of the specified scheduling language and the program module library are outlined. The summary is written with the potential user in mind and, therefore, provides maximum insight on how the capabilities will be helpful in writing scheduling programs. Simple examples and illustrations are provided to assist the potential user in applying the capabilities of his problem.

Urbanization effect on trends in sunshine duration in China

Directory of Open Access Journals (Sweden)

Y. Wang

2017-07-01

Full Text Available There is an ongoing debate on whether the observed decadal variations in surface solar radiation, known as dimming and brightening periods, are a large-scale or solely local phenomenon. We investigated this issue using long-term sunshine duration records from China, which experienced a rapid increase in urbanization during the past decades. Over the period 1960–2013, 172 pairs of urban and nearby rural stations were analyzed. Urban and rural sunshine duration trends show similar spatial patterns during a dimming phase (1960–1989 and a subsequent period during which trends were leveling off (1990–2013. This indicates that rather than local effects, the trends in sunshine duration are on more of a national or regional scale in China. Nevertheless, in the dimming phase, the declining rate of sunshine duration in rural areas is around two-thirds of that in urban areas. The ratio of rural to urban dimming generally increases from a minimum of 0.39 to a maximum of 0.87 with increasing indices of urbanization calculated based on the year 2013. It reaches a maximum when the urbanization level exceeds 50 %, the urban population exceeds 20 million, or the population density becomes higher than 250 person km−2. After the transition into the leveling-off period, sunshine duration trends are no longer significantly affected by urbanization. Meanwhile, the number of laws and regulations related to air pollution and investment in pollution treatment have been increasing in China.

Preliminary flood-duration frequency estimates using naturalized streamflow records for the Willamette River Basin, Oregon

Science.gov (United States)

Lind, Greg D.; Stonewall, Adam J.

2018-02-13

In this study, “naturalized” daily streamflow records, created by the U.S. Army Corps of Engineers and the Bureau of Reclamation, were used to compute 1-, 3-, 7-, 10-, 15-, 30-, and 60-day annual maximum streamflow durations, which are running averages of daily streamflow for the number of days in each duration. Once the annual maximum durations were computed, the floodduration frequencies could be estimated. The estimated flood-duration frequencies correspond to the 50-, 20-, 10-, 4-, 2-, 1-, 0.5-, and 0.2-percent probabilities of their occurring or being exceeded each year. For this report, the focus was on the Willamette River Basin in Oregon, which is a subbasin of the Columbia River Basin. This study is part of a larger one encompassing the entire Columbia Basin.

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

Science.gov (United States)

Tang, Dunbing; Dai, Min

2015-09-01

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

Patients' preference for radiotherapy fractionation schedule in the palliation of symptomatic unresectable lung cancer

International Nuclear Information System (INIS)

Tang, J. I.; Lu, J. J.; Wong, L. C.

2008-01-01

Full text: The palliative radiotherapeutic management of unresectable non-small-cell lung cancer is controversial, with various fractionation (F x) schedules available. We aimed to determine patient's choice of F x schedule after involvement in a decision-making process using a decision board. A decision board outlining the various advantages and disadvantages apparent in the Medical Research Council study of F x schedules (17 Gy in two fractions vs 39 Gy in 13 fractions) was discussed with patients who met Medical Research Council eligibility criteria. Patients were then asked to indicate their preferred F x schedules, reasons and their level of satisfaction with being involved in the decision making process. Radiation oncologists (R O ) could prescribe radiotherapy schedules irrespective of patients' preferences. Of 92 patients enrolled, 55% chose the longer schedule. English-speaking patients were significantly more likely to choose the longer schedule (P 0.02, 95% confidence interval: 1.2-7.6). Longer F x was chosen because of longer survival (90%) and better local control (12%). Shorter F x was chosen for shorter overall treatment duration (80%), cost (61%) and better symptom control (20%). In all, 56% of patients choosing the shorter schedule had their treatment altered by the treating R O , whereas only 4% of patients choosing longer F x had their treatment altered (P O 's own biases.

The use of patient factors to improve the prediction of operative duration using laparoscopic cholecystectomy.

Science.gov (United States)

Thiels, Cornelius A; Yu, Denny; Abdelrahman, Amro M; Habermann, Elizabeth B; Hallbeck, Susan; Pasupathy, Kalyan S; Bingener, Juliane

2017-01-01

Reliable prediction of operative duration is essential for improving patient and care team satisfaction, optimizing resource utilization and reducing cost. Current operative scheduling systems are unreliable and contribute to costly over- and underestimation of operative time. We hypothesized that the inclusion of patient-specific factors would improve the accuracy in predicting operative duration. We reviewed all elective laparoscopic cholecystectomies performed at a single institution between 01/2007 and 06/2013. Concurrent procedures were excluded. Univariate analysis evaluated the effect of age, gender, BMI, ASA, laboratory values, smoking, and comorbidities on operative duration. Multivariable linear regression models were constructed using the significant factors (p historical surgeon-specific and procedure-specific operative duration. External validation was done using the ACS-NSQIP database (n = 11,842). A total of 1801 laparoscopic cholecystectomy patients met inclusion criteria. Female sex was associated with reduced operative duration (-7.5 min, p < 0.001 vs. male sex) while increasing BMI (+5.1 min BMI 25-29.9, +6.9 min BMI 30-34.9, +10.4 min BMI 35-39.9, +17.0 min BMI 40 + , all p < 0.05 vs. normal BMI), increasing ASA (+7.4 min ASA III, +38.3 min ASA IV, all p < 0.01 vs. ASA I), and elevated liver function tests (+7.9 min, p < 0.01 vs. normal) were predictive of increased operative duration on univariate analysis. A model was then constructed using these predictive factors. The traditional surgical scheduling system was poorly predictive of actual operative duration (R 2  = 0.001) compared to the patient factors model (R 2  = 0.08). The model remained predictive on external validation (R 2  = 0.14).The addition of surgeon as a variable in the institutional model further improved predictive ability of the model (R 2  = 0.18). The use of routinely available pre-operative patient factors improves the prediction of operative

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

Science.gov (United States)

Tian, Xingke; Yuan, Shengrui

2018-04-01

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

Adaptation to an Illusory Duration: Nothing Like the Real Thing?

Directory of Open Access Journals (Sweden)

John Hotchkiss

2012-05-01

Full Text Available Recent work has shown that adapting to a visual or auditory stimulus of a particular duration leads to a repulsive distortion of the perceived duration of a subsequently presented test stimulus. This distortion seems to be modality-specific and manifests itself as an expansion or contraction of perceived duration dependent upon whether the test stimulus is longer or shorter than the adapted duration. It has been shown (Berger et al 2003, Journal of Vision 3, 406–412 that perceived events can be as effective as actual events in inducing improvements in performance. In light of this, we investigated whether an illusory visual duration was capable of inducing a duration after-effect in a visual test stimulus that was actually no different in duration from the adaptor. Pairing a visual stimulus with a concurrent auditory stimulus of subtly longer or shorter duration expands or contracts the duration of the visual stimulus. We mapped out this effect and then chose two auditory durations (one long, one short that produced the maximum distortion in the perceived duration of the visual stimulus. After adapting to this bimodal stimulus, our participants were asked to reproduce a visual duration. Group data showed that participants, on average, reproduced the physical duration of the visual test stimulus accurately; in other words, there was no consistent effect of adaptation to an illusory duration.

Responsive versus scheduled feeding for preterm infants.

Science.gov (United States)

Watson, Julie; McGuire, William

2015-10-13

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

Laser-driven short-duration heating angioplasty: dilatation performance in cadaver atherosclerotic femoral arteries

Science.gov (United States)

Shimazaki, Natsumi; Naruse, Sho; Arai, Tsunenori; Imanishi, Nobuaki; Aiso, Sadakazu

2013-03-01

The purpose of this study was to investigate the artery dilatation performance of the short-duration heating balloon catheter in cadaver stenotic arteries. We designed a prototype short-duration heating balloon catheter that can heat artery media to around 60 °C in 15-25 s by a combination of laser-driven heat generation and continuous fluid irrigation in the balloon. We performed ex vivo short-duration heating dilatation in the cadaver atherosclerotic femoral arteries (initial percent diameter stenosis was 36-98%), with the maximum balloon temperature of 65+/-5 °C, laser irradiation duration of 25 s, and balloon dilatation pressure of 3.5 atm. The artery lumen configurations before and after the dilatations were assessed with a commercial IVUS system. After the short-duration heating dilatations, the percent diameter stenosis was reduced below 30% without any artery tears or dissections. We estimated that the artery media temperature was raised to around 60 °C in which plaque thickness was below 0.8 mm by a thermal conduction calculation. The estimated maximum temperature in artery adventitia and surrounding tissue was up to 45 °C. We found that the short-duration heating balloon could sufficiently dilate the cadaver stenotic arteries, without thermal injury in artery adventitia and surroundings.

Do Projects really end late? On the shortcomings of the classical scheduling techniques

Directory of Open Access Journals (Sweden)

Pablo Ballesteros-Pérez

2018-03-01

Full Text Available Many engineering projects fail to meet their planned completion dates in real practice. This a recurrent topic in the project management literature, with poor planning and controlling practices frequently cited among the most significant causes of delays. Unfortunately, hardly any attention has been paid to the fact that the classical scheduling techniques: Gantt chart, Critical Path Method (CPM, and Program Evaluation and Review Technique (PERT, may not be as fit for purpose as they seem. Arguably, because of their relative simplicity, these techniques are still almost the only ones taught nowadays in most introductory courses to scheduling in many engineering and management degrees. However, by utterly ignoring or inappropriately dealing with activity duration variability, these techniques provide optimistic completion dates, while suffering from other shortcomings. Through a series of simple case studies that can be developed with a few participants and common dice, a systematic critique of the classical scheduling techniques is offered. Discussion of the case studies results illustrate why limiting the contents of scheduling education and teaching can be detrimental, as the aforementioned classical scheduling techniques cannot not provide project managers with sufficient resources to effectively plan and control real projects.

Strong motion duration and earthquake magnitude relationships

International Nuclear Information System (INIS)

Salmon, M.W.; Short, S.A.; Kennedy, R.P.

1992-06-01

Earthquake duration is the total time of ground shaking from the arrival of seismic waves until the return to ambient conditions. Much of this time is at relatively low shaking levels which have little effect on seismic structural response and on earthquake damage potential. As a result, a parameter termed ''strong motion duration'' has been defined by a number of investigators to be used for the purpose of evaluating seismic response and assessing the potential for structural damage due to earthquakes. This report presents methods for determining strong motion duration and a time history envelope function appropriate for various evaluation purposes, for earthquake magnitude and distance, and for site soil properties. There are numerous definitions of strong motion duration. For most of these definitions, empirical studies have been completed which relate duration to earthquake magnitude and distance and to site soil properties. Each of these definitions recognizes that only the portion of an earthquake record which has sufficiently high acceleration amplitude, energy content, or some other parameters significantly affects seismic response. Studies have been performed which indicate that the portion of an earthquake record in which the power (average rate of energy input) is maximum correlates most closely with potential damage to stiff nuclear power plant structures. Hence, this report will concentrate on energy based strong motion duration definitions

An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT

Science.gov (United States)

Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

2016-01-01

In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process. PMID:27827909

An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT.

Science.gov (United States)

Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

2016-11-04

In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process.

Dispersion durations of P-wave and QT interval in children treated with a ketogenic diet.

Science.gov (United States)

Doksöz, Önder; Güzel, Orkide; Yılmaz, Ünsal; Işgüder, Rana; Çeleğen, Kübra; Meşe, Timur

2014-04-01

Limited data are available on the effects of a ketogenic diet on dispersion duration of P-wave and QT-interval measures in children. We searched for the changes in these measures with serial electrocardiograms in patients treated with a ketogenic diet. Twenty-five drug-resistant patients with epilepsy treated with a ketogenic diet were enrolled in this study. Electrocardiography was performed in all patients before the beginning and at the sixth month after implementation of the ketogenic diet. Heart rate, maximum and minimum P-wave duration, P-wave dispersion, and maximum and minimum corrected QT interval and QT dispersion were manually measured from the 12-lead surface electrocardiogram. Minimum and maximum corrected QT and QT dispersion measurements showed nonsignificant increase at month 6 compared with baseline values. Other previously mentioned electrocardiogram parameters also showed no significant changes. A ketogenic diet of 6 months' duration has no significant effect on electrocardiogram parameters in children. Further studies with larger samples and longer duration of follow-up are needed to clarify the effects of ketogenic diet on P-wave dispersion and corrected QT and QT dispersion. Copyright © 2014 Elsevier Inc. All rights reserved.

Decision Model for Planning and Scheduling of Seafood Product Considering Traceability

Science.gov (United States)

Agustin; Mawengkang, Herman; Mathelinea, Devy

2018-01-01

Due to the global challenges, it is necessary for an industrial company to integrate production scheduling and distribution planning, in order to be more efficient and to get more economics advantages. This paper presents seafood production planning and scheduling of a seafood manufacture company which produces simultaneously multi kind of seafood products, located at Aceh Province, Indonesia. The perishability nature of fish highly restricts its storage duration and delivery conditions. Traceability is a tracking requirement to check whether the quality of the product is satisfied. The production and distribution planning problem aims to meet customer demand subject to traceability of the seafood product and other restrictions. The problem is modeled as a mixed integer linear program, and then it is solved using neighborhood search approach.

Maximum Hours Legislation and Female Employment in the 1920s: A Reasse ssment

OpenAIRE

Claudia Goldin

1986-01-01

The causes and consequences of state maximum hours laws for female workers, passed from the mid-1800s to the 1920s, are explored and are found to differ from a recent reinterpretation. Although maximum hours legislation reduced scheduled hours in 1920, the impact was minimal and it operated equally for men. Legislation affecting only women was symptomatic of a general desire by labor for lower hours, and these lower hours were achieved in the tight, and otherwise special, World War I labor ma...

Scheduling elective surgeries: the tradeoff among bed capacity, waiting patients and operating room utilization using goal programming.

Science.gov (United States)

Li, Xiangyong; Rafaliya, N; Baki, M Fazle; Chaouch, Ben A

2017-03-01

Scheduling of surgeries in the operating rooms under limited competing resources such as surgical and nursing staff, anesthesiologist, medical equipment, and recovery beds in surgical wards is a complicated process. A well-designed schedule should be concerned with the welfare of the entire system by allocating the available resources in an efficient and effective manner. In this paper, we develop an integer linear programming model in a manner useful for multiple goals for optimally scheduling elective surgeries based on the availability of surgeons and operating rooms over a time horizon. In particular, the model is concerned with the minimization of the following important goals: (1) the anticipated number of patients waiting for service; (2) the underutilization of operating room time; (3) the maximum expected number of patients in the recovery unit; and (4) the expected range (the difference between maximum and minimum expected number) of patients in the recovery unit. We develop two goal programming (GP) models: lexicographic GP model and weighted GP model. The lexicographic GP model schedules operating rooms when various preemptive priority levels are given to these four goals. A numerical study is conducted to illustrate the optimal master-surgery schedule obtained from the models. The numerical results demonstrate that when the available number of surgeons and operating rooms is known without error over the planning horizon, the proposed models can produce good schedules and priority levels and preference weights of four goals affect the resulting schedules. The results quantify the tradeoffs that must take place as the preemptive-weights of the four goals are changed.

Effect of Load Duration on Timber Structures in Denmark

DEFF Research Database (Denmark)

Sørensen, John Dalsgaard; Stang, Birgitte Friis Dela; Svensson, Staffan

2003-01-01

. The parameters in these models are fitted by the Maximum Likelihood Method using data relevant for Danish structural timber and the statistical uncertainty is quantified. The reliability is evaluated using representative shortand long-term limit states, and the load duration factor kmod is estimated using......Load duration effects are estimated on basis of simulation of realizations of wind, snow and imposed loads in accordance with the load models in the Danish structural codes. Three damage accumulation models are considered, namely Gerhards model, Barret & Foschi's model and Foschi & Yao's model...

Effect of current on the maximum possible reward.

Science.gov (United States)

Gallistel, C R; Leon, M; Waraczynski, M; Hanau, M S

1991-12-01

Using a 2-lever choice paradigm with concurrent variable interval schedules of reward, it was found that when pulse frequency is increased, the preference-determining rewarding effect of 0.5-s trains of brief cathodal pulses delivered to the medial forebrain bundle of the rat saturates (stops increasing) at values ranging from 200 to 631 pulses/s (pps). Raising the current lowered the saturation frequency, which confirms earlier, more extensive findings showing that the rewarding effect of short trains saturates at pulse frequencies that vary from less than 100 pps to more than 800 pps, depending on the current. It was also found that the maximum possible reward--the magnitude of the reward at or beyond the saturation pulse frequency--increases with increasing current. Thus, increasing the current reduces the saturation frequency but increases the subjective magnitude of the maximum possible reward.

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

Science.gov (United States)

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

1986-09-01

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

Flexible resource management and its effect on project cost and duration

Science.gov (United States)

Pinha, Denis C.; Ahluwalia, Rashpal S.

2018-06-01

In practice, most projects result in cost overruns and schedule slippage due to poor resource management. This paper presents an approach that aims at reducing project duration and costs by empowering project managers to assess different scenarios. The proposed approach addresses combinatorial modes for tasks, multi-skilled resources, and multiple calendars for resources. A case study reported in the literature is presented to demonstrate the capabilities of this method. As for practical implications, this approach enhances the decision-making process which results in improved solutions in terms of total project duration and cost. From an academic viewpoint, this paper adds empirical evidence to enrich the existing literature, as it highlights relevant issues to model properly the complexity of real-life projects.

Single-machine scheduling with release dates, due dates and family setup times

NARCIS (Netherlands)

Schutten, Johannes M.J.; van de Velde, S.L.; van de Velde, S.L.; Zijm, Willem H.M.

1996-01-01

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

Short term scheduling of multiple grid-parallel PEM fuel cells for microgrid applications

Energy Technology Data Exchange (ETDEWEB)

El-Sharkh, M.Y.; Rahman, A.; Alam, M.S. [Dept. of Electrical and Computer Engineering, University of South Alabama, Mobile, AL 36688 (United States)

2010-10-15

This paper presents a short term scheduling scheme for multiple grid-parallel PEM fuel cell power plants (FCPPs) connected to supply electrical and thermal energy to a microgrid community. As in the case of regular power plants, short term scheduling of FCPP is also a cost-based optimization problem that includes the cost of operation, thermal power recovery, and the power trade with the local utility grid. Due to the ability of the microgrid community to trade power with the local grid, the power balance constraint is not applicable, other constraints like the real power operating limits of the FCPP, and minimum up and down time are therefore used. To solve the short term scheduling problem of the FCPPs, a hybrid technique based on evolutionary programming (EP) and hill climbing technique (HC) is used. The EP is used to estimate the optimal schedule and the output power from each FCPP. The HC technique is used to monitor the feasibility of the solution during the search process. The short term scheduling problem is used to estimate the schedule and the electrical and thermal power output of five FCPPs supplying a maximum power of 300 kW. (author)

Energy-driven scheduling algorithm for nanosatellite energy harvesting maximization

Science.gov (United States)

Slongo, L. K.; Martínez, S. V.; Eiterer, B. V. B.; Pereira, T. G.; Bezerra, E. A.; Paiva, K. V.

2018-06-01

The number of tasks that a satellite may execute in orbit is strongly related to the amount of energy its Electrical Power System (EPS) is able to harvest and to store. The manner the stored energy is distributed within the satellite has also a great impact on the CubeSat's overall efficiency. Most CubeSat's EPS do not prioritize energy constraints in their formulation. Unlike that, this work proposes an innovative energy-driven scheduling algorithm based on energy harvesting maximization policy. The energy harvesting circuit is mathematically modeled and the solar panel I-V curves are presented for different temperature and irradiance levels. Considering the models and simulations, the scheduling algorithm is designed to keep solar panels working close to their maximum power point by triggering tasks in the appropriate form. Tasks execution affects battery voltage, which is coupled to the solar panels through a protection circuit. A software based Perturb and Observe strategy allows defining the tasks to be triggered. The scheduling algorithm is tested in FloripaSat, which is an 1U CubeSat. A test apparatus is proposed to emulate solar irradiance variation, considering the satellite movement around the Earth. Tests have been conducted to show that the scheduling algorithm improves the CubeSat energy harvesting capability by 4.48% in a three orbit experiment and up to 8.46% in a single orbit cycle in comparison with the CubeSat operating without the scheduling algorithm.

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

Science.gov (United States)

2017-05-03

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

HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.

Science.gov (United States)

Darmoni, S J; Fajner, A; Mahé, N; Leforestier, A; Vondracek, M; Stelian, O; Baldenweck, M

1995-01-01

Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

Directory of Open Access Journals (Sweden)

Denis Pinha

2016-11-01

Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.

Solving University Scheduling Problem Using Hybrid Approach

Directory of Open Access Journals (Sweden)

Aftab Ahmed Shaikh

2011-10-01

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

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

A unique, fast-forwards rotating schedule with 12-h long shifts prevents chronic sleep debt.

Science.gov (United States)

Fischer, Dorothee; Vetter, Céline; Oberlinner, Christoph; Wegener, Sven; Roenneberg, Till

2016-01-01

Sleep debt--together with circadian misalignment--is considered a central factor for adverse health outcomes associated with shift work. Here, we describe in detail sleep-wake behavior in a fast-forward rotating 12-h shift schedule, which involves at least 24 hours off after each shift and thus allows examining the role of immediate recovery after shift-specific sleep debt. Thirty-five participants at two chemical plants in Germany were chronotyped using the Munich ChronoType Questionnaire for Shift-Workers (MCTQ(Shift)) and wore actimeters throughout the two-week study period. From these actimetry recordings, we computed sleep and nap duration, social jetlag (a measure of circadian misalignment), and the daily timing of activity and sleep (center of gravity and mid-sleep, respectively). We observed that the long off-work periods between each shift create a fast alternation between shortened (mean ± standard deviation, 5h 17min ± 56min) and extended (8h 25min ± 72min) sleep episodes resulting in immanent reductions of sleep debt. Additionally, extensive napping of early chronotypes (up to 3 hours before the night shift) statistically compensated short sleep durations after the night shift. Partial rank correlations showed chronotype-dependent patterns of sleep and activity that were similar to those previously described in 8-h schedules; however, sleep before the day shift did not differ between chronotypes. Our findings indicate that schedules preventing a build-up of chronic sleep debt may reduce detrimental effects of shift work irrespective of shift duration. Prospective studies are needed to further elucidate the relationship between sleep, the circadian system, and health and safety hazards.

Factors associated with sleep duration in Brazilian high school students.

Science.gov (United States)

Gomes Felden, Érico Pereira; Barbosa, Diego Grasel; Junior, Geraldo Jose Ferrari; Santos, Manoella De Oliveira; Pelegrini, Andreia; Silva, Diego Augusto Santos

2017-01-01

The aim of this study was to investigate the factors associated with short sleep duration on southern Brazilian high school students. Our study was comprised of 1,132 adolescents aged 14 to 19 years, enrolled in public high schools in São José, Brazil. The students answered a questionnaire about working (work and workload), health perception, smoking, school schedule, sleep (duration and daytime sleepiness), and socio-demographics data. The results showed that more than two thirds of adolescent workers had short sleep duration (76.7%), and those with a higher workload (more than 20 hours) had a shorter sleep duration (7.07 hours) compared to non-workers (7.83 hours). In the analysis of factors associated with short sleep duration, adolescents who worked (OR = 2.12, 95% CI 1.53 to 2.95) were more likely to have short sleep duration compared to those who did not work. In addition, older adolescents (17-19 years) and students with poor sleep quality were 40% and 55% more likely to have short sleep duration compared to younger adolescents (14-16 years) and students with good sleep quality, respectively. Adolescents with daytime sleepiness were more likely to have short sleep duration (OR = 1.49, 95% CI 1.06 to 2.07) compared to those without excessive daytime sleepiness. In addition students of the morning shift (OR = 6.02, 95% CI 4.23 to 8.57) and evening shift (OR = 2.16, 95% CI 1.45 to 3.22) were more likely to have short sleep duration compared to adolescents of the afternoon shift. Thereby adolescents who are workers, older, attended morning and evening classes and have excessive daytime sleepiness showed risk factors for short sleep duration. In this sense, it is pointed out the importance of raising awareness of these risk factors for short sleep duration of students from public schools from São José, located in southern Brazil.

Single-machine scheduling with release dates, due dates, and family setup times

NARCIS (Netherlands)

J.M.J. Schutten (Marco); S.L. van de Velde (Steef); W.H.M. Zijm

1996-01-01

textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

Optimal methodology for a machining process scheduling in spot electricity markets

International Nuclear Information System (INIS)

Yusta, J.M.; Torres, F.; Khodr, H.M.

2010-01-01

Electricity spot markets have introduced hourly variations in the price of electricity. These variations allow the increase of the energy efficiency by the appropriate scheduling and adaptation of the industrial production to the hourly cost of electricity in order to obtain the maximum profit for the industry. In this article a mathematical optimization model simulates costs and the electricity demand of a machining process. The resultant problem is solved using the generalized reduced gradient approach, to find the optimum production schedule that maximizes the industry profit considering the hourly variations of the price of electricity in the spot market. Different price scenarios are studied to analyze the impact of the spot market prices for electricity on the optimal scheduling of the machining process and on the industry profit. The convenience of the application of the proposed model is shown especially in cases of very high electricity prices.

Time while waiting: patients' experiences of scheduled surgery.

Science.gov (United States)

Carr, Tracey; Teucher, Ulrich C; Casson, Alan G

2014-12-01

Research on patients' experiences of wait time for scheduled surgery has centered predominantly on the relative tolerability of perceived wait time and impacts on quality of life. We explored patients' experiences of time while waiting for three types of surgery with varied wait times--hip or knee replacement, shoulder surgery, and cardiac surgery. Thirty-two patients were recruited by their surgeons. We asked participants about their perceptions of time while waiting in two separate interviews. Using interpretative phenomenological analysis (IPA), we discovered connections between participant suffering, meaningfulness of time, and agency over the waiting period and the lived duration of time experience. Our findings reveal that chronological duration is not necessarily the most relevant consideration in determining the quality of waiting experience. Those findings helped us create a conceptual framework for lived wait time. We suggest that clinicians and policy makers consider the complexity of wait time experience to enhance preoperative patient care. © The Author(s) 2014.

Integrating planning and scheduling in an oil refinery with a rolling horizon approach

NARCIS (Netherlands)

Zondervan, E.; Kaland, M.; van Elzakker, M.A.H.; Fransoo, J.C.; Meuldijk, J.; Klemes, J.J.; Varbanov, P.S.; Liew, P.Y.

2014-01-01

Decisions in an oil refinery are made at three levels: planning, scheduling and control. Existing facilities have to be operated close to their maximum capacity, while continuously responding to cost fluctuations. In many of the currently reported planning models each decision level has its own

Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

International Nuclear Information System (INIS)

Kim, Woojoong; Ryu, Dongsoo; Jung, Youngsoo

2014-01-01

Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation

Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

Energy Technology Data Exchange (ETDEWEB)

Kim, Woojoong, E-mail: minidung@nate.com [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Ryu, Dongsoo, E-mail: energyboy@khnp.co.kr [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Jung, Youngsoo, E-mail: yjung97@mju.ac.kr [College of Architecture, Myongji University, Yongin 449-728 (Korea, Republic of)

2014-04-01

Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation.

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.

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.

Axillary brachial plexus block duration with mepivacaine in patients with chronic renal failure. Case-control study.

Science.gov (United States)

Mojica, V; Nieuwveld, D; Herrera, A E; Mestres, G; López, A M; Sala-Blanch, X

2017-04-01

Regional anaesthesia is commonly preferred for arteriovenous fistula (AVF) creation. Previous studies suggest a shorter block duration in patients with chronic renal failure, maybe because of the changes in regional blood flow. The aim of our study was to evaluate the duration of the axillary block with 1.5% mepivacaine in patients with chronic renal failure scheduled for AVF compared with healthy controls. Patients scheduled for AVF creation for the first time (GIRC) were included. They were compared with patients without renal failure (GC), with similar anthropometric characteristics. Ultrasound-guided axillary blocks with 20mL of 1.5% mepivacaine were performed on all patients. We evaluated onset time, humeral artery diameter and blood flow before and after the block, as well as the block duration. Twenty-three patients (GIRC: 12 and GC: 11) were included. No differences between groups were observed in block duration (GIRC: 227±43min vs GC: 229±27min; P=.781), or in onset time (GIRC: 13±5min vs GC: 12.2±3min; P=.477). The humeral blood flow before and after block was significantly lower in the GIRC (pre-block: GIRC: 52±21ml/min GC: 100±62ml/min; P=.034 and p ost block: GIRC: 130±57ml/min and GC: 274±182ml/min; P=.010). There was no significant correlation between the duration of the block and the preblock humeral blood flow (Spearman Rho: 0.106; P=.657) or the postblock humeral blood flow (Spearman Rho: 0.267; P=.254). The duration of the axillary block with 1.5% mepivacaine in patients with chronic renal failure was similar to that of the control patients. The duration of axillary brachial plexus block seems not to be related to changes in regional blood flow. Copyright © 2016 Sociedad Española de Anestesiología, Reanimación y Terapéutica del Dolor. Publicado por Elsevier España, S.L.U. All rights reserved.

NASA scheduling technologies

Science.gov (United States)

Adair, Jerry R.

1994-01-01

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

Project Robust Scheduling Based on the Scattered Buffer Technology

Directory of Open Access Journals (Sweden)

Nansheng Pang

2018-04-01

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

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

Science.gov (United States)

2010-07-22

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

A new continuous-time formulation for scheduling crude oil operations

International Nuclear Information System (INIS)

Reddy, P. Chandra Prakash; Karimi, I.A.; Srinivasan, R.

2004-01-01

In today's competitive business climate characterized by uncertain oil markets, responding effectively and speedily to market forces, while maintaining reliable operations, is crucial to a refinery's bottom line. Optimal crude oil scheduling enables cost reduction by using cheaper crudes intelligently, minimizing crude changeovers, and avoiding ship demurrage. So far, only discrete-time formulations have stood up to the challenge of this important, nonlinear problem. A continuous-time formulation would portend numerous advantages, however, existing work in this area has just begun to scratch the surface. In this paper, we present the first complete continuous-time mixed integer linear programming (MILP) formulation for the short-term scheduling of operations in a refinery that receives crude from very large crude carriers via a high-volume single buoy mooring pipeline. This novel formulation accounts for real-world operational practices. We use an iterative algorithm to eliminate the crude composition discrepancy that has proven to be the Achilles heel for existing formulations. While it does not guarantee global optimality, the algorithm needs only MILP solutions and obtains excellent maximum-profit schedules for industrial problems with up to 7 days of scheduling horizon. We also report the first comparison of discrete- vs. continuous-time formulations for this complex problem. (Author)

Coordinated scheduling for the downlink of cloud radio-access networks

KAUST Repository

Douik, Ahmed S.

2015-09-11

This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

Science.gov (United States)

Richards, Stephen F.

1991-01-01

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Reliability-Based Modeling of Moisture and Load-Duration Effects

DEFF Research Database (Denmark)

Sørensen, John Dalsgaard; Svensson, Staffan

2005-01-01

Load duration effects with respect to reduction of load bearing capacity are very important for structural timber. This paper describes how the load duration effects combined with moisture content and variations c an be determined on basis of simulation of realizations of the time varying load...... and moisture processes. Permanent and snow load sand moisture variations are considered and stochastic models are formulated in accordance with the load models in the Danish structural codes. A damage accumulation model based on fracture mechanics that accounts for both load duration and moisture effects...... is derived. The parameters in the model are fitted to data relevant for Nordic structural timber using the Maximum Likelihood method. The probability of failure as function of time is estimated for representative limit states based on: a) short term strength and b) long term damage accumulation...

Scaling in the distribution of intertrade durations of Chinese stocks

Science.gov (United States)

Jiang, Zhi-Qiang; Chen, Wei; Zhou, Wei-Xing

2008-10-01

The distribution of intertrade durations, defined as the waiting times between two consecutive transactions, is investigated based upon the limit order book data of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in the whole year 2003. A scaling pattern is observed in the distributions of intertrade durations, where the empirical density functions of the normalized intertrade durations of all 23 stocks collapse onto a single curve. The scaling pattern is also observed in the intertrade duration distributions for filled and partially filled trades and in the conditional distributions. The ensemble distributions for all stocks are modeled by the Weibull and the Tsallis q-exponential distributions. Maximum likelihood estimation shows that the Weibull distribution outperforms the q-exponential for not-too-large intertrade durations which account for more than 98.5% of the data. Alternatively, nonlinear least-squares estimation selects the q-exponential as a better model, in which the optimization is conducted on the distance between empirical and theoretical values of the logarithmic probability densities. The distribution of intertrade durations is Weibull followed by a power-law tail with an asymptotic tail exponent close to 3.

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

NARCIS (Netherlands)

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

2010-01-01

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

Master schedule for CY-1979 Hanford environmental surveillance routine program

International Nuclear Information System (INIS)

Blumer, P.J.; Houston, J.R.; Eddy, P.A.

1978-12-01

The current schedule of data collection for the routine environmental surveillance program at the Hanford Site, as conducted by the Environmental Evaluation Section of Battelle, Pacific Northwest Laboratory for the Department of Energy (DOE), is given. Modifications to the schedule are made during the year and special areas of study, usually of short duration, are not scheduled. The environmental surveillance program objectives are to evaluate the levels of radioactive and nonradioactive pollutants in the Hanford environs, and to monitor Hanford operations for compliance with applicable environmental criteria and Washington State Water Quality Standards. Air quality data are obtained in a separate program administered by the Hanford Environmental Health Foundation. The collection schedule for potable water is shown but it is not part of the routine environmental surveillance program. Water quality data for Hanford Site potable water systems are published each year by the Hanford Environmental Health Foundation. The data collected are available in routine reports issued by the Environmental Evaluations staff. Groundwater data and evaluation are reported in the series, ''Radiological Status of the Groundwater Beneath the Hanford Project for...,'' the latest issue being PNL-2624 for CY-1977. Data from locations within the plant boundaries are presented in the annual ''Environmental Status of the Hanford Site for...'' report series, the most recent report being PNL-2677 for 1977. Data from offsite locations are presented in the annual ''Environmental Surveillance at Hanford for...'' series of reports, the latest being PNL-2614 for 1977

The influence of stimulus phase duration on discomfort and electrically induced torque of quadriceps femoris

Directory of Open Access Journals (Sweden)

Richard E. Liebano

2013-10-01

Full Text Available BACKGROUND: Although a number of studies have compared the influence of different electrical pulse parameters on maximum electrically induced torque (MEIT and discomfort, the role of phase duration has been poorly investigated. OBJECTIVE: To examine the variation in muscle torque and discomfort produced when electrically stimulating quadriceps femoris using pulsed current with three different phase durations in order to establish whether there are any advantages or disadvantages in varying the phase duration over the range examined. METHOD: This is a two repeated-measures, within-subject study conducted in a research laboratory. The study was divided into 2 parts with 19 healthy young adults in each part.In part 1, MEIT was determined for each phase duration (400, 700, and 1000 µs, using a biphasic pulsed current at a frequency of 50 Hz. In part 2, stimulus amplitude was increased until the contractions reached 40% of maximum voluntary isometric contraction (MVIC and the associated discomfort produced by each phase duration was measured. RESULTS: In part 1 of the study, we found that the average MEITs generated with each phase duration (400, 700, and 1000 µs were 55.0, 56.3, and 58.0% of MVIC respectively, but the differences were not statistically significant (p=.45. In part 2, we found a statistically significant increase in discomfort over the same range of phase durations. The results indicate that, for a given level of torque production, discomfort increases with increasing phase duration (p=.008. CONCLUSIONS: Greater muscle torque cannot be produced by increasing the stimulus phase duration over the range examined. Greater discomfort is produced by increasing the stimulus phase duration.

Unifying practice schedules in the timescales of motor learning and performance.

Science.gov (United States)

Verhoeven, F Martijn; Newell, Karl M

2018-06-01

In this article, we elaborate from a multiple time scales model of motor learning to examine the independent and integrated effects of massed and distributed practice schedules within- and between-sessions on the persistent (learning) and transient (warm-up, fatigue) processes of performance change. The timescales framework reveals the influence of practice distribution on four learning-related processes: the persistent processes of learning and forgetting, and the transient processes of warm-up decrement and fatigue. The superposition of the different processes of practice leads to a unified set of effects for massed and distributed practice within- and between-sessions in learning motor tasks. This analysis of the interaction between the duration of the interval of practice trials or sessions and parameters of the introduced time scale model captures the unified influence of the between trial and session scheduling of practice on learning and performance. It provides a starting point for new theoretically based hypotheses, and the scheduling of practice that minimizes the negative effects of warm-up decrement, fatigue and forgetting while exploiting the positive effects of learning and retention. Copyright © 2018 Elsevier B.V. All rights reserved.

Web Publishing Schedule

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Yifei Tong

2016-02-01

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

Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation

Directory of Open Access Journals (Sweden)

Atif Shahzad

2016-02-01

Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.

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

Directory of Open Access Journals (Sweden)

Prahlad Rai Gupta

2015-01-01

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

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.

Statistics of the first passage time of Brownian motion conditioned by maximum value or area

International Nuclear Information System (INIS)

Kearney, Michael J; Majumdar, Satya N

2014-01-01

We derive the moments of the first passage time for Brownian motion conditioned by either the maximum value or the area swept out by the motion. These quantities are the natural counterparts to the moments of the maximum value and area of Brownian excursions of fixed duration, which we also derive for completeness within the same mathematical framework. Various applications are indicated. (paper)

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

Science.gov (United States)

2010-07-01

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

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

Gain-scheduled {{\\mathscr{H}}}_{\\infty } buckling control of a circular beam-column subject to time-varying axial loads

Science.gov (United States)

Schaeffner, Maximilian; Platz, Roland

2018-06-01

For slender beam-columns loaded by axial compressive forces, active buckling control provides a possibility to increase the maximum bearable axial load above that of a purely passive structure. In this paper, an approach for gain-scheduled {{\\mathscr{H}}}∞ buckling control of a slender beam-column with circular cross-section subject to time-varying axial loads is investigated experimentally. Piezo-elastic supports with integrated piezoelectric stack actuators at the beam-column ends allow an active stabilization in arbitrary lateral directions. The axial loads on the beam-column influence its lateral dynamic behavior and, eventually, cause the beam-column to buckle. A reduced modal model of the beam-column subject to axial loads including the dynamics of the electrical components is set up and calibrated with experimental data. Particularly, the linear parameter-varying open-loop plant is used to design a model-based gain-scheduled {{\\mathscr{H}}}∞ buckling control that is implemented in an experimental test setup. The beam-column is loaded by ramp- and step-shaped time-varying axial compressive loads that result in a lateral deformation of the beam-column due to imperfections, such as predeformation, eccentric loading or clamping moments. The lateral deformations and the maximum bearable loads of the beam-column are analyzed and compared for the beam-column with and without gain-scheduled {{\\mathscr{H}}}∞ buckling control or, respectively, active and passive configuration. With the proposed gain-scheduled {{\\mathscr{H}}}∞ buckling control it is possible to increase the maximum bearable load of the active beam-column by 19% for ramp-shaped axial loads and to significantly reduce the beam-column deformations for step-shaped axial loads compared to the passive structure.

Reliability-Based Calibration of Load Duration Factors for Timber Structures

DEFF Research Database (Denmark)

Sørensen, John Dalsgaard; Svensson, Staffan; Stang, Birgitte Friis Dela

2005-01-01

John Dalsgaard Sørensen, Staffan Svensson, Birgitte Dela Stang : Reliability-Based Calibration of Load Duration Factors for Timber Structures     Abstract :   The load bearing capacity of timber structures decrease with time depending on the type of load and timber. Based on representative limit...... states and stochastic models for timber structures, load duration factors are calibrated using probabilistic methods. Load duration e.ects are estimated on basis of simulation of realizations of wind, snow and imposed loads in accordance with the load models in the Danish structural codes. Three damage...... accumulation models are considered, namely Gerhards model, Barrett and Foschi _ s model and Foschi and Yao _ s model. The parameters in these models are .tted by the Maximum Likelihood Method using data relevant for Danish structural timber and the statistical uncertainty is quanti .ed. The reliability...

Changes in children's sleep duration on food intake, weight, and leptin.

Science.gov (United States)

Hart, Chantelle N; Carskadon, Mary A; Considine, Robert V; Fava, Joseph L; Lawton, Jessica; Raynor, Hollie A; Jelalian, Elissa; Owens, Judith; Wing, Rena

2013-12-01

To examine the effect of experimental changes in children's sleep duration on self-reported food intake, food reinforcement, appetite-regulating hormones, and measured weight. Using a within-subjects, counterbalanced, crossover design, 37 children, 8 to 11 years of age (27% overweight/obese) completed a 3-week study. Children slept their typical amount at home for 1 week and were then randomized to either increase or decrease their time in bed by 1.5 hours per night for 1 week, completing the alternate schedule on the third week. Primary outcomes were dietary intake as assessed by 24-hour dietary recalls, food reinforcement (ie, points earned for a food reward), and fasting leptin and ghrelin. The secondary outcome was child weight. Participants achieved a 2 hour, 21 minute difference in the actigraph defined sleep period time between the increase and decrease sleep conditions (P fasting morning leptin values (P food reinforcement or in fasting ghrelin. Compared with decreased sleep, increased sleep duration in school-age children resulted in lower reported food intake, lower fasting leptin levels, and lower weight. The potential role of sleep duration in pediatric obesity prevention and treatment warrants further study.

How Changes in Unemployment Benefit Duration Affect the Inflow Into Unemployment

NARCIS (Netherlands)

van Ours, J.C.; Tuit, S.

2010-01-01

We study how changes in the maximum benefit duration affec the inow into unemployment in the Netherlands. Until August 2003, workers who became un- employed after age 57.5 were entitled to unemployment benefits until the age of 65, after which they would receive old age pensions. This characteristic

Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks

KAUST Repository

Douik, Ahmed

2016-03-28

In the context of resource allocation in cloud- radio access networks, recent studies assume either signal-level or scheduling-level coordination. This paper, instead, considers a hybrid level of coordination for the scheduling problem in the downlink of a multi-cloud radio- access network, so as to benefit from both scheduling policies. Consider a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and therefore allows joint signal processing between them. Across the multiple clouds, however, only scheduling-level coordination is permitted, as it requires a lower level of backhaul communication. The frame structure of every BS is composed of various time/frequency blocks, called power- zones (PZs), and kept at fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled, at most, to a single cloud, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs\\' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The scheduling problem is, then, shown to be equivalent to a maximum- weight independent set problem in the constructed graph, in which each vertex symbolizes an association of cloud, user, BS and PZ, with a weight representing the utility of that association. Simulation results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

Applying mathematical models to predict resident physician performance and alertness on traditional and novel work schedules.

Science.gov (United States)

Klerman, Elizabeth B; Beckett, Scott A; Landrigan, Christopher P

2016-09-13

In 2011 the U.S. Accreditation Council for Graduate Medical Education began limiting first year resident physicians (interns) to shifts of ≤16 consecutive hours. Controversy persists regarding the effectiveness of this policy for reducing errors and accidents while promoting education and patient care. Using a mathematical model of the effects of circadian rhythms and length of time awake on objective performance and subjective alertness, we quantitatively compared predictions for traditional intern schedules to those that limit work to ≤ 16 consecutive hours. We simulated two traditional schedules and three novel schedules using the mathematical model. The traditional schedules had extended duration work shifts (≥24 h) with overnight work shifts every second shift (including every third night, Q3) or every third shift (including every fourth night, Q4) night; the novel schedules had two different cross-cover (XC) night team schedules (XC-V1 and XC-V2) and a Rapid Cycle Rotation (RCR) schedule. Predicted objective performance and subjective alertness for each work shift were computed for each individual's schedule within a team and then combined for the team as a whole. Our primary outcome was the amount of time within a work shift during which a team's model-predicted objective performance and subjective alertness were lower than that expected after 16 or 24 h of continuous wake in an otherwise rested individual. The model predicted fewer hours with poor performance and alertness, especially during night-time work hours, for all three novel schedules than for either the traditional Q3 or Q4 schedules. Three proposed schedules that eliminate extended shifts may improve performance and alertness compared with traditional Q3 or Q4 schedules. Predicted times of worse performance and alertness were at night, which is also a time when supervision of trainees is lower. Mathematical modeling provides a quantitative comparison approach with potential to aid

A new intuitionistic fuzzy rule-based decision-making system for an operating system process scheduler.

Science.gov (United States)

Butt, Muhammad Arif; Akram, Muhammad

2016-01-01

We present a new intuitionistic fuzzy rule-based decision-making system based on intuitionistic fuzzy sets for a process scheduler of a batch operating system. Our proposed intuitionistic fuzzy scheduling algorithm, inputs the nice value and burst time of all available processes in the ready queue, intuitionistically fuzzify the input values, triggers appropriate rules of our intuitionistic fuzzy inference engine and finally calculates the dynamic priority (dp) of all the processes in the ready queue. Once the dp of every process is calculated the ready queue is sorted in decreasing order of dp of every process. The process with maximum dp value is sent to the central processing unit for execution. Finally, we show complete working of our algorithm on two different data sets and give comparisons with some standard non-preemptive process schedulers.

Flood Frequency Analysis For Partial Duration Series In Ganjiang River Basin

Science.gov (United States)

zhangli, Sun; xiufang, Zhu; yaozhong, Pan

2016-04-01

Accurate estimation of flood frequency is key to effective, nationwide flood damage abatement programs. The partial duration series (PDS) method is widely used in hydrologic studies because it considers all events above a certain threshold level as compared to the annual maximum series (AMS) method, which considers only the annual maximum value. However, the PDS has a drawback in that it is difficult to define the thresholds and maintain an independent and identical distribution of the partial duration time series; this drawback is discussed in this paper. The Ganjiang River is the seventh largest tributary of the Yangtze River, the longest river in China. The Ganjiang River covers a drainage area of 81,258 km2 at the Wanzhou hydrologic station as the basin outlet. In this work, 56 years of daily flow data (1954-2009) from the Wanzhou station were used to analyze flood frequency, and the Pearson-III model was employed as the hydrologic probability distribution. Generally, three tasks were accomplished: (1) the threshold of PDS by percentile rank of daily runoff was obtained; (2) trend analysis of the flow series was conducted using PDS; and (3) flood frequency analysis was conducted for partial duration flow series. The results showed a slight upward trend of the annual runoff in the Ganjiang River basin. The maximum flow with a 0.01 exceedance probability (corresponding to a 100-year flood peak under stationary conditions) was 20,000 m3/s, while that with a 0.1 exceedance probability was 15,000 m3/s. These results will serve as a guide to hydrological engineering planning, design, and management for policymakers and decision makers associated with hydrology.

Rework Impacts Evaluation Through System Dynamics Approach in Overlapped Product Development Schedule

Directory of Open Access Journals (Sweden)

Lino Guimarães Marujo

2009-07-01

Full Text Available This work aims to explore a novel framework to analyze the planning concepts in product development projects employing techniques to reduce the lead-time of activities, such as overlapping of a pair of each. With the System Dynamics methodology a model to evaluate the rework fraction needed to accommodate the deviations proportional to the overlapping grade of the activities. A numerical example is provided to demonstrate the validity of the model. Although problems encountered during the project management are dynamic, they have been treated on a static basis, what has as result, chronic schedules delays, overruns and cost overspent persist in follow the managers’ (reactions. In this work, we have addressed this known problem by introducing and reviewing some characteristics of the concept of rework in overlapped schedules. This consists in observe and capture the relations feedbacks among the original planned project schedule, the overlapping strategy and the inherent uncertainty in a work being done with poor information. To realize this concept, we have faced with many behaviors patterns (e.g. rework, new duration, non-conformity, and analyze the output behavior pattern, produced by the proposed model.

Prioritizing and scheduling Portsmouth Gaseous Diffusion Plant safeguards upgrades

International Nuclear Information System (INIS)

Edmunds, T.; Saleh, R.; Zevanove, S.

1992-02-01

As part of the Site Safeguards and Security Plan (SSSP), facilities are required to develop a Resource Plan (RP). The Resource Plan provides documentation and justification for the facility's planned upgrades, including the schedule, priority, and cost estimates for the safeguards and security upgrades. Portsmouth Gaseous Diffusion Plant (PORTS) management has identified and obtained funding approval for a number of safeguards and security upgrades, including line-item construction projects. These upgrade projects were selected to address a variety of concerns identified in the PORTS vulnerability assessments and other reviews performed in support of the SSSP process. However, budgeting and scheduling constraints do not make it possible to simultaneously begin implementation of all of the upgrade projects. A formal methodology and analysis are needed to explicitly address the trade-offs between competing safeguards objectives, and to prioritize and schedule the upgrade projects to ensure that the maximum benefit can be realized in the shortest possible time frame. The purpose of this report is to describe the methodology developed to support these upgrade project scheduling decisions. The report also presents the results obtained from applying the methodology to a set of the upgrade projects selected by PORTS S ampersand S management. Data for the analysis are based on discussions with personnel familiar with the PORTS safeguards and security needs, the requirements for implementing these upgrades, and upgrade funding limitations. The analysis results presented here assume continued highly enriched uranium (HEU) operations at PORTS. However, the methodology developed is readily adaptable for the evaluation of other operational scenarios and other resource allocation issues relevant to PORTS

A manpower scheduling heuristic for aircraft maintenance application

Science.gov (United States)

Sze, San-Nah; Sze, Jeeu-Fong; Chiew, Kang-Leng

2012-09-01

This research studies a manpower scheduling for aircraft maintenance, focusing on in-flight food loading operation. A group of loading teams with flexible shifts is required to deliver and upload packaged meals from the ground kitchen to aircrafts in multiple trips. All aircrafts must be served within predefined time windows. The scheduling process takes into account of various constraints such as meal break allocation, multi-trip traveling and food exposure time limit. Considering the aircrafts movement and predefined maximum working hours for each loading team, the main objective of this study is to form an efficient roster by assigning a minimum number of loading teams to the aircrafts. We proposed an insertion based heuristic to generate the solutions in a short period of time for large instances. This proposed algorithm is implemented in various stages for constructing trips due to the presence of numerous constraints. The robustness and efficiency of the algorithm is demonstrated in computational results. The results show that the insertion heuristic more efficiently outperforms the company's current practice.

DAILY SCHEDULING OF SMALL HYDRO POWER PLANTS DISPATCH WITH MODIFIED PARTICLES SWARM OPTIMIZATION

Directory of Open Access Journals (Sweden)

Sinvaldo Rodrigues Moreno

2015-04-01

Full Text Available This paper presents a new approach for short-term hydro power scheduling of reservoirs using an algorithm-based Particle Swarm Optimization (PSO. PSO is a population-based algorithm designed to find good solutions to optimization problems, its characteristics have encouraged its adoption to tackle a variety of problems in different fields. In this paper the authors consider an optimization problem related to a daily scheduling of small hydro power dispatch. The goal is construct a feasible solution that maximize the cascade electricity production, following the environmental constraints and water balance. The paper proposes an improved Particle Swarm Optimization (PSO algorithm, which takes advantage of simplicity and facility of implementation. The algorithm was successfully applied to the optimization of the daily schedule strategies of small hydro power plants, considering maximum water utilization and all constraints related to simultaneous water uses. Extensive computational tests and comparisons with other heuristics methods showed the effectiveness of the proposed approach.

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

A Study of the Pelagic Larval Duration of Acropora humilis, Coral Recruitment and Connectivity in the Saudi Arabian Red Sea

KAUST Repository

Khalil, Maha

2011-01-01

Combined knowledge of the pelagic larval duration of coral species and coral recruitment patterns can provide evidence of inter-reef connectivity and indicate a reef’s ability to recover. We attempted to determine the maximum pelagic larval duration

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

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.

On the maximum drawdown during speculative bubbles

Science.gov (United States)

Rotundo, Giulia; Navarra, Mauro

2007-08-01

A taxonomy of large financial crashes proposed in the literature locates the burst of speculative bubbles due to endogenous causes in the framework of extreme stock market crashes, defined as falls of market prices that are outlier with respect to the bulk of drawdown price movement distribution. This paper goes on deeper in the analysis providing a further characterization of the rising part of such selected bubbles through the examination of drawdown and maximum drawdown movement of indices prices. The analysis of drawdown duration is also performed and it is the core of the risk measure estimated here.

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

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

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

Science.gov (United States)

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

2018-06-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Principal Investigator: Dr. Abdella Battou

2009-05-22

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

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

Associations Among Work and Family Health Climate, Health Behaviors, Work Schedule, and Body Weight.

Science.gov (United States)

Buden, Jennifer C; Dugan, Alicia G; Faghri, Pouran D; Huedo-Medina, Tania B; Namazi, Sara; Cherniack, Martin G

2017-06-01

Correctional employees exhibit elevated obesity rates. This study examines interrelations among health behaviors, health climate, body mass index (BMI), and work schedule. Using survey results from correctional supervisors (n = 157), mediation and moderated-mediation analyses were performed to examine how health behaviors explain relationships between obesity, work health climate (WHC) and family health climate (FHC), and work schedule. Over 85% of the sample was overweight/obese (mean BMI = 30.20). Higher WHC and FHC were associated with lower BMI, mediated by nutrition, and physical activity. The interaction effect between health behavior and work schedule revealed a protective effect on BMI. Overtime shift work may share a relationship with BMI. Findings may have implications for reexamining organizational policies on maximum weekly overtime in corrections. They provide direction for targeted obesity interventions that encourage a supportive FHC and promote healthy behaviors among supervisors working overtime.

Associations among Work and Family Health Climate, Health Behaviors, Work Schedule and Body Weight

Science.gov (United States)

Buden, Jennifer C.; Dugan, Alicia G.; Faghri, Pouran D.; Huedo-Medina, Tania B.; Namazi, Sara; Cherniack, Martin G.

2017-01-01

Objectives Correctional employees exhibit elevated obesity rates. This study examines interrelations among health behaviors, health climate, BMI, and work schedule. Methods Using survey results from correctional supervisors (n=157), mediation and moderated-mediation analyses were performed to examine how health behaviors explain relationships between obesity, work health climate (WHC) and family health climate (FHC), and work schedule. Results Over 85% of the sample was overweight/obese (mean BMI=30.20). Higher WHC and FHC were associated with lower BMI, mediated by nutrition and physical activity. The interaction effect between health behavior and work schedule revealed a protective effect on BMI. Overtime shiftwork may share a relationship with BMI. Conclusions Findings may have implications for reexamining organizational policies on maximum weekly overtime in corrections. They provide direction for targeted obesity interventions that encourage a supportive FHC and promote healthy behaviors among supervisors working overtime. PMID:28471768

Influence of earthquake strong motion duration on nonlinear structural response

International Nuclear Information System (INIS)

Meskouris, K.

1983-01-01

The effects of motion duration on nonlinear structural response of high-rise, moment resisting frames are studied by subjecting shear beam models of a 10- and a 5-story frame to a series of synthetic accelerograms, all matching the same NEWMARK/HALL design spectrum. Two different hysteretic laws are used for the story springs, and calculations are carried out for target ductility values of 2 and 4. Maximum ductilities reached and energy-based damage indicators (maximum seismically input energy, hysteretically dissipated energy) are evaluated and correlated with the motion characteristics. A reasonable extrapolative determination of structural response characteristics based on these indicators seems possible. (orig.)

On pulse duration of self-terminating lasers

International Nuclear Information System (INIS)

Bokhan, P A

2011-01-01

The problem of the maximum pulse duration τ max of self-terminating lasers is considered. It is shown that the duration depends on the transition probability in the laser channel, on the decay rate of the resonant state in all other channels, and on the excitation rate of the metastable state. As a result, τ max is found to be significantly shorter than previously estimated. The criteria for converting the 'self-terminating' lasing to quasi-cw lasing are determined. It is shown that in the case of nonselective depopulation of the metastable state, for example in capillary lasers or in a fast flow of the active medium gas, it is impossible to obtain continuous lasing. Some concrete examples are considered. It is established that in several studies of barium vapour lasers (λ = 1.5 μm) and nitrogen lasers (λ = 337 nm), collisional lasing is obtained by increasing the relaxation rate of the metastable state in collisions with working particles (barium atoms and nitrogen molecules). (lasers)

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

Science.gov (United States)

Bradshaw, C M; Killeen, P R

2012-08-01

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

Validation of probabilistic methodology for generating actual inhabitants' behavior schedules for accurate prediction of maximum energy requirements

Energy Technology Data Exchange (ETDEWEB)

Tanimoto, Jun; Hagishima, Aya; Sagara, Hiroki [Interdisciplinary Graduate School of Engineering Sciences, Kyushu University 6-1, Kasuga-koen, Kasuga-shi, Fukuoka 816-8580 (Japan)

2008-07-01

A data set of myriad and time-varying inhabitant-behavior schedules with a 15 min time resolution, generated by the authors in a previous study, is validated through a comparison analysis. We show three comparisons. The first and second compare the estimated demand with a time series of actual utility demand. The comparisons indicate that the generated data and its algorithm, described by the authors, have an appropriate robustness. Another comparison between the estimate and the annual averaged daily water demand of a residential area, consisting of 9327 residences, also shows an acceptable consistency. (author)

The operational flight and multi-crew scheduling problem

Directory of Open Access Journals (Sweden)

Stojković Mirela

2005-01-01

Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.

Magnetohydrodynamics MHD Engineering Test Facility ETF 200 MWe power plant. Conceptual Design Engineering Report CDER. Volume 3: Costs and schedules

Science.gov (United States)

1981-01-01

The estimated plant capital cost for a coal fired 200 MWE electric generating plant with open cycle magnetohydrodynamics is divided into principal accounts based on Federal Energy Regulatory Commision account structure. Each principal account is defined and its estimated cost subdivided into identifiable and major equipment systems. The cost data sources for compiling the estimates, cost parameters, allotments, assumptions, and contingencies, are discussed. Uncertainties associated with developing the costs are quantified to show the confidence level acquired. Guidelines established in preparing the estimated costs are included. Based on an overall milestone schedule related to conventional power plant scheduling experience and starting procurement of MHD components during the preliminary design phase there is a 6 1/2-year construction period. The duration of the project from start to commercial operation is 79 months. The engineering phase of the project is 4 1/2 years; the construction duration following the start of the man power block is 37 months.

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

The analysis of the possibility of using 10-minute rainfall series to determine the maximum rainfall amount with 5 minutes duration

Science.gov (United States)

Kaźmierczak, Bartosz; Wartalska, Katarzyna; Wdowikowski, Marcin; Kotowski, Andrzej

2017-11-01

Modern scientific research in the area of heavy rainfall analysis regarding to the sewerage design indicates the need to develop and use probabilistic rain models. One of the issues that remains to be resolved is the length of the shortest amount of rain to be analyzed. It is commonly believed that the best time is 5 minutes, while the least rain duration measured by the national services is often 10 or even 15 minutes. Main aim of this paper is to present the difference between probabilistic rainfall models results given from rainfall time series including and excluding 5 minutes rainfall duration. Analysis were made for long-time period from 1961-2010 on polish meteorological station Legnica. To develop best fitted to measurement rainfall data probabilistic model 4 probabilistic distributions were used. Results clearly indicates that models including 5 minutes rainfall duration remains more appropriate to use.

Responding for sucrose and wheel-running reinforcement: effects of sucrose concentration and wheel-running reinforcer duration.

Science.gov (United States)

Belke, Terry W; Hancock, Stephanie D

2003-03-01

Six male albino rats were placed in running wheels and exposed to a fixed-interval 30-s schedule of lever pressing that produced either a drop of sucrose solution or the opportunity to run for a fixed duration as reinforcers. Each reinforcer type was signaled by a different stimulus. In Experiment 1, the duration of running was held constant at 15 s while the concentration of sucrose solution was varied across values of 0, 2.5. 5, 10, and 15%. As concentration decreased, postreinforcement pause duration increased and local rates decreased in the presence of the stimulus signaling sucrose. Consequently, the difference between responding in the presence of stimuli signaling wheel-running and sucrose reinforcers diminished, and at 2.5%, response functions for the two reinforcers were similar. In Experiment 2, the concentration of sucrose solution was held constant at 15% while the duration of the opportunity to run was first varied across values of 15, 45, and 90 s then subsequently across values of 5, 10, and 15 s. As run duration increased, postreinforcement pause duration in the presence of the wheel-running stimulus increased and local rates increased then decreased. In summary, inhibitory aftereffects of previous reinforcers occurred when both sucrose concentration and run duration varied; changes in responding were attributable to changes in the excitatory value of the stimuli signaling the two reinforcers.

Introducing a methodology for estimating duration of surgery in health services research.

Science.gov (United States)

Redelmeier, Donald A; Thiruchelvam, Deva; Daneman, Nick

2008-09-01

The duration of surgery is an indicator for the quality, risks, and efficiency of surgical procedures. We introduce a new methodology for assessing the duration of surgery based on anesthesiology billing records, along with reviewing its fundamental logic and limitations. The validity of the methodology was assessed through a population-based cohort of patients (n=480,986) undergoing elective operations in 246 Ontario hospitals with 1,084 anesthesiologists between April 1, 1992 and March 31, 2002 (10 years). The weaknesses of the methodology relate to missing data, self-serving exaggerations by providers, imprecisions from clinical diversity, upper limits due to accounting regulations, fluctuations from updates over the years, national differences in reimbursement schedules, and the general failings of claims base analyses. The strengths of the methodology are in providing data that match clinical experiences, correspond to chart review, are consistent over time, can detect differences where differences would be anticipated, and might have implications for examining patient outcomes after long surgical times. We suggest that an understanding and application of large studies of surgical duration may help scientists explore selected questions concerning postoperative complications.

Scheduling with Time Lags

NARCIS (Netherlands)

X. Zhang (Xiandong)

2010-01-01

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

Evaluation of empirical relationships between extreme rainfall and daily maximum temperature in Australia

Science.gov (United States)

Herath, Sujeewa Malwila; Sarukkalige, Ranjan; Nguyen, Van Thanh Van

2018-01-01

Understanding the relationships between extreme daily and sub-daily rainfall events and their governing factors is important in order to analyse the properties of extreme rainfall events in a changing climate. Atmospheric temperature is one of the dominant climate variables which has a strong relationship with extreme rainfall events. In this study, a temperature-rainfall binning technique is used to evaluate the dependency of extreme rainfall on daily maximum temperature. The Clausius-Clapeyron (C-C) relation was found to describe the relationship between daily maximum temperature and a range of rainfall durations from 6 min up to 24 h for seven Australian weather stations, the stations being located in Adelaide, Brisbane, Canberra, Darwin, Melbourne, Perth and Sydney. The analysis shows that the rainfall - temperature scaling varies with location, temperature and rainfall duration. The Darwin Airport station shows a negative scaling relationship, while the other six stations show a positive relationship. To identify the trend in scaling relationship over time the same analysis is conducted using data covering 10 year periods. Results indicate that the dependency of extreme rainfall on temperature also varies with the analysis period. Further, this dependency shows an increasing trend for more extreme short duration rainfall and a decreasing trend for average long duration rainfall events at most stations. Seasonal variations of the scale changing trends were analysed by categorizing the summer and autumn seasons in one group and the winter and spring seasons in another group. Most of 99th percentile of 6 min, 1 h and 24 h rain durations at Perth, Melbourne and Sydney stations show increasing trend for both groups while Adelaide and Darwin show decreasing trend. Furthermore, majority of scaling trend of 50th percentile are decreasing for both groups.

Parallel Machine Scheduling with Batch Delivery to Two Customers

Directory of Open Access Journals (Sweden)

Xueling Zhong

2015-01-01

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

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.

A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times

Science.gov (United States)

Moreno-Camacho, Carlos A.; Montoya-Torres, Jairo R.; Vélez-Gallego, Mario C.

2018-06-01

Only a few studies in the available scientific literature address the problem of having a group of workers that do not share identical levels of productivity during the planning horizon. This study considers a workforce scheduling problem in which the actual processing time is a function of the scheduling sequence to represent the decline in workers' performance, evaluating two classical performance measures separately: makespan and maximum tardiness. Several mathematical models are compared with each other to highlight the advantages of each approach. The mathematical models are tested with randomly generated instances available from a public e-library.

Schedule Analytics

Science.gov (United States)

2016-04-30

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

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

Directory of Open Access Journals (Sweden)

Aniket Nagle

2014-10-01

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

From non-preemptive to preemptive scheduling using synchronization synthesis.

Science.gov (United States)

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

2017-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2003-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2000-01-01

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

Uplink Cross-Layer Scheduling with Differential QoS Requirements in OFDMA Systems

Directory of Open Access Journals (Sweden)

Chen Wei

2010-01-01

Full Text Available Fair and efficient scheduling is a key issue in cross-layer design for wireless communication systems, such as 3GPP LTE and WiMAX. However, few works have considered the multiaccess of the traffic with differential QoS requirements in wireless systems. In this paper, we will consider an OFDMA-based wireless system with four types of traffic associated with differential QoS requirements, namely, minimum reserved rate, maximum sustainable rate, maximum latency, and tolerant jitter. Given these QoS requirements, the traffic scheduling will be formulated into a cross-layer optimization problem, which is convex fortunately. By separating the power allocation through the waterfilling algorithm in each user, this problem will further reduce to a kind of continuous quadratic knapsack problem in the base station which yields low complexity. It is then demonstrated that the proposed cross-layer method cannot only guarantee the application layer QoS requirements, but also minimizes the integrated residual workload in the MAC layer. To further enhance the ability of QoS assurance in heavily loaded scenario, a call admission control scheme will also be proposed. The simulation results show that the QoS requirements for the four types of traffic are guaranteed effectively by the proposed algorithms.

Double Girder Bridge Crane with Double Cycling: Scheduling Strategy and Performance Evaluation

Directory of Open Access Journals (Sweden)

Dandan Wang

2014-01-01

Full Text Available This paper introduces a novel quay crane design, double girder bridge crane (DGBC. DGBC is capable of handling containers of two adjacent bays simultaneously, avoiding crane collisions, saving travelling and reposition cost, and eventually improving terminal efficiency. This problem is formulated as a resource-constrained project scheduling with objective to minimize the maximum completion time. A two-stage heuristic algorithm is proposed in which an operating sequences on each bay is obtained by double cycling, and the integrated timetable for both bays is constructed by solving resource conflicts using the proposed minimum cost strategy. We examine effectiveness and performance of applying DGBC with double cycling. A case study is presented to illustrate how DGBC works with the two-stage method. Three extreme cases with respective conflict types are investigated to develop the performance bounds of DGBC with double cycling. The results show that DGBC can significantly improve terminal productivity, and outperforms single girder crane in both makespan and the lift operation percentage. The highest DGBC efficiency does not require maximum double cycles in two bay schedules; rather the integrated timetable for two bays is the main contribution to the DGBC performance as it yields better cooperation between two spreaders and the driver.

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

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

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

KAUST Repository

Celik, Abdulkadir

2016-09-12

In this paper, we consider heterogeneous cognitive radio networks (CRNs) comprising primary channels (PCs) with heterogeneous characteristics and secondary users (SUs) with various sensing and reporting qualities for different PCs. We first define the opportunity as the achievable total data rate and its cost as the energy consumption caused from sensing, reporting, and channel switching operations and formulate a joint spectrum discovery and energy efficiency objective to minimize the energy spent per unit of data rate. Then, a mixed integer nonlinear programming problem is formulated to determine: 1) the optimal subset of PCs to be scheduled for sensing; 2) the SU assignment set for each scheduled PC; and 3) sensing durations and detection thresholds of each SU on PCs it is assigned to sense. Thereafter, an equivalent convex framework is developed for specific instances of the above combinatorial problem. For comparison, optimal detection and sensing thresholds are also derived analytically under the homogeneity assumption. Based on these, a prioritized ordering heuristic is developed to order channels under the spectrum, energy, and spectrum-energy limited regimes. After that, a scheduling and assignment heuristic is proposed and is shown to perform very close to the exhaustive optimal solution. Finally, the behavior of the CRN is numerically analyzed under these regimes with respect to different numbers of SUs, PCs, and sensing qualities.

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Science.gov (United States)

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Ad libitum or demand/semi-demand feeding versus scheduled interval feeding for preterm infants.

Science.gov (United States)

McCormick, Felicia M; Tosh, Karen; McGuire, William

2010-02-17

Scheduled interval feeding of prescribed enteral volumes is current standard practice for preterm infants. However, feeding preterm infants in response to their hunger and satiation cues (ad libitum or demand/semi demand) rather than at scheduled intervals might help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. To assess the effect of a policy of feeding preterm infants on an ad libitum or demand/semi-demand basis versus feeding prescribed volumes at scheduled intervals on growth rates and the time to hospital discharge. We used the standard search strategy of the Cochrane Neonatal Review Group. This included searches of the Cochrane Central Register of Controlled Trials (CENTRAL, The Cochrane Library, Issue 4, 2009), MEDLINE (1966 to Oct 2009), EMBASE (1980 to Oct 2009), CINAHL (1982 to Oct 2009), conference proceedings, and previous reviews. Randomised or quasi-randomised controlled trials (including cluster randomised trials) that compared a policy of feeding preterm infants on an ad libitum or demand/semi-demand basis versus feeding at scheduled intervals. We used the standard methods of the Cochrane Neonatal Review Group with separate evaluation of trial quality and data extraction by two review authors. We found eight randomised controlled trials that compared ad libitum or demand/semi-demand regimens with scheduled interval regimes in preterm infants in the transition phase from intragastric tube to oral feeding. The trials were generally small and of variable methodological quality. The duration of the intervention and the duration of data collection and follow-up in most of the trials was not likely to have allowed detection of measurable effects on growth. Three trials reported that feeding preterm infants using an ad libitum or demand/semi-demand feeding regimen allowed earlier discharge from hospital (by about two to four days) but other trials did not confirm this

The accelerated hepatitis B virus vaccination schedule among hemodialysis patients, does it work? A randomized controlled trial.

Science.gov (United States)

Imam, Mahmoud Hamada

2017-12-01

Hemodialysis patients possess particular attributes which increase the susceptibility to hepatitis B virus (HBV) infections. HBV vaccination significantly decreased the number of new HBV-infected patients. However, the conventional vaccination schedule requires a 6-months duration. This study aimed to examine the efficacy the accelerated vaccination schedule among hemodialysis patients. In this study, 202 consecutive hemodialysis patients at New Jeddah hospital were enrolled. The inclusion criteria were: (1) age was above 18 years, (2) all patients had undetectable HBV surface antigen and antibody. Exclusion criteria included: (1) patient had a positive serum HBV surface antigen and antibody using enzyme-linked immunosorbent assay; (2) patient received a previous course of HBV vaccine, (3) patient who was pregnant. Patients were sequentially randomized to receive either Hepatitis B recombinant DNA vaccine (conventional schedule) or to receive combined hepatitis A and B vaccine injection (accelerated schedule). Testing for HBV surface antibodies was done one and three months after completion of the dosage schedule. The primary outcome was the proportion of seroprotection (defined by serum HBV surface antibodies ≥ 10 mIU/ml). Adverse reactions were evaluated regarding both fever and post-injection pain scale. Patients' age ranged from 18 to 71 years.After 1 and 3 months of completion of the vaccination schedule, there was no statistical difference in the proportion of seroprotected patients among both groups. Accelerated vaccination schedule using combined hepatitis A and B vaccine may be beneficial for HBV seroprotection among hemodialysis patients.

Effects of reinforcer magnitude on responding under differential-reinforcement-of-low-rate schedules of rats and pigeons.

Science.gov (United States)

Doughty, Adam H; Richards, Jerry B

2002-07-01

Experiment I investigated the effects of reinforcer magnitude on differential-reinforcement-of-low-rate (DRL) schedule performance in three phases. In Phase 1, two groups of rats (n = 6 and 5) responded under a DRI. 72-s schedule with reinforcer magnitudes of either 30 or 300 microl of water. After acquisition, the water amounts were reversed for each rat. In Phase 2, the effects of the same reinforcer magnitudes on DRL 18-s schedule performance were examined across conditions. In Phase 3, each rat responded unider a DR1. 18-s schedule in which the water amotnts alternated between 30 and 300 microl daily. Throughout each phase of Experiment 1, the larger reinforcer magnitude resulted in higher response rates and lower reinforcement rates. The peak of the interresponse-time distributions was at a lower value tinder the larger reinforcer magnitude. In Experiment 2, 3 pigeons responded under a DRL 20-s schedule in which reinforcer magnitude (1-s or 6-s access to grain) varied iron session to session. Higher response rates and lower reinforcement rates occurred tinder the longer hopper duration. These results demonstrate that larger reinforcer magnitudes engender less efficient DRL schedule performance in both rats and pigeons, and when reinforcer magnitude was held constant between sessions or was varied daily. The present results are consistent with previous research demonstrating a decrease in efficiency as a function of increased reinforcer magnituide tinder procedures that require a period of time without a specified response. These findings also support the claim that DRI. schedule performance is not governed solely by a timing process.

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.

The current duration design for estimating the time to pregnancy distribution

DEFF Research Database (Denmark)

Gasbarra, Dario; Arjas, Elja; Vehtari, Aki

2015-01-01

This paper was inspired by the studies of Niels Keiding and co-authors on estimating the waiting time-to-pregnancy (TTP) distribution, and in particular on using the current duration design in that context. In this design, a cross-sectional sample of women is collected from those who are currently...... attempting to become pregnant, and then by recording from each the time she has been attempting. Our aim here is to study the identifiability and the estimation of the waiting time distribution on the basis of current duration data. The main difficulty in this stems from the fact that very short waiting...... times are only rarely selected into the sample of current durations, and this renders their estimation unstable. We introduce here a Bayesian method for this estimation problem, prove its asymptotic consistency, and compare the method to some variants of the non-parametric maximum likelihood estimators...

Stage, tumor growth rate and optimal dose fractionation schedules in the treatment of squamous cell carcinoma of the head and neck

International Nuclear Information System (INIS)

Sugawara, Tadashi; Morita, Mamoru; Aihara, Toshinori; Tanaka, Osamu

1983-01-01

In 77 patients with cancer of the head and neck, 45 patients received radiotherapy alone, while 32 patients with T 1 or T 2 glottic cancer received combined therapy with laryngomicrosurgery performed prior to or during the course of irradiation. These T 1 and T 2 groups were separately analyzed from other T 1 and T 2 groups as T sub(LMS). Local recurrence rates were compared concerning overall time and fraction size in following three subgroups, i.e., T sub(LMS), Tsub(1+2), and Tsub(3+4). No significant correlation was detected between total dose converted to partial tolerance (PT) and local control in all subgroups except for Tsub(3+4), in which local recurrence rate was rather higher in high PT range. Local control was significantly dependent on overall treatment time and fraction size, differently by tumor stage. Favorable fractionation schedules considered as optimal for T sub(LMS) were those in which treatment was given 5 times weekly with a daily dose rate more than 196 rad in a shorter overall time of less than 42 days. In contrast to T sub(LMS), effective schedules for Tsub(3+4) consisted of longer overall time of more than 60 days and a lower daily dose rate of less than 153 rad. In Tsub(1+2), the optimal schedule was needed to be altered according to rapidness of progression of disease characterised by duration of the complaints, which was statistically proved to be significantly shorter in Tsub(1+2) than Tsub(3+4). Rapidity-adjusted schedule consisted of a shorter over-all time of less than 49 days with a daily dose rate of more than 175 rad 5 fractions a week for a case having a duration of complaints of less than 2.9 months, and a longer overall time of more than 50 days with a daily dose rate of less than 174 rad for a case having a duration of more than 3 months. (J.P.N.)

Outage scheduling and implementation

International Nuclear Information System (INIS)

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

1986-01-01

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

Project Schedule Simulation

DEFF Research Database (Denmark)

Mizouni, Rabeb; Lazarova-Molnar, Sanja

2015-01-01

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

Analyzing temporal changes in maximum runoff volume series of the Danube River

International Nuclear Information System (INIS)

Halmova, Dana; Pekarova, Pavla; Onderka, Milan; Pekar, Jan

2008-01-01

Several hypotheses claim that more extremes in climatic and hydrologic phenomena are anticipated. In order to verify such hypotheses it is inevitable to examine the past periods by thoroughly analyzing historical data. In the present study, the annual maximum runoff volumes with t-day durations were calculated for a 130-year series of mean daily discharge of Danube River at Bratislava gauge (Slovakia). Statistical methods were used to clarify how the maximum runoff volumes of the Danube River changed over two historical periods (1876-1940 and 1941-2005). The conclusion is that the runoff volume regime during floods has not changed significantly during the last 130 years.

Shorter sleep duration is associated with social impairment and comorbidities in ASD.

Science.gov (United States)

Veatch, Olivia J; Sutcliffe, James S; Warren, Zachary E; Keenan, Brendan T; Potter, Melissa H; Malow, Beth A

2017-07-01

Sleep disturbance, particularly insomnia, is common in children with autism spectrum disorders (ASD). Furthermore, disturbed sleep affects core symptoms and other related comorbidities. Understanding the causes and consequences of sleep disturbances in children with ASD is an important step toward mitigating these symptoms. To better understand the connection between sleep duration and ASD severity, we analyzed ASD-related symptoms using the Autism Diagnostic Interview-Revised (ADI-R), Autism Diagnostic Observation Schedule (ADOS), IQ scores, and parent reports of the average amount of time slept per night that were available in the medical histories of 2,714 children with ASD in the Simons Simplex Collection (SSC). The mean (SD) sleep duration was 555 minutes. Sleep duration and severity of core ASD symptoms were negatively correlated, and sleep duration and IQ scores were positively correlated. Regression results indicated that more severe social impairment, primarily a failure to develop peer relationships, is the core symptom most strongly associated with short sleep duration. Furthermore, increased severity for numerous maladaptive behaviors assessed on the Child Behavior Checklist, as well as reports of attention deficit disorder, depressive disorder, and obsessive compulsive disorder were associated with short sleep duration. Severity scores for social/communication impairment and restricted and repetitive behaviors (RRB) were increased, and IQ scores were decreased, for children reported to sleep ≤420 minutes per night (lower 5th percentile) compared to children sleeping ≥660 minutes (upper 95th percentile). Our results indicate that reduced amounts of sleep are related to more severe symptoms in children with ASD. Autism Res 2017. © 2017 International Society for Autism Research, Wiley Periodicals, Inc. Autism Res 2017, 10: 1221-1238. © 2017 International Society for Autism Research, Wiley Periodicals, Inc. © 2017 International Society for Autism

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

Gain scheduling using the Youla parameterization

DEFF Research Database (Denmark)

Niemann, Hans Henrik; Stoustrup, Jakob

1999-01-01

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

Are chronotype, social jetlag and sleep duration associated with health measured by Work Ability Index?

Science.gov (United States)

Yong, Mei; Fischer, Dorothee; Germann, Christina; Lang, Stefan; Vetter, Céline; Oberlinner, Christoph

The present study investigates the impact of chronotype, social jetlag and sleep duration on self-perceived health, measured by Work Ability Index (WAI), within an industrial setting. Between 2011 and 2013, 2474 day and shift workers participated in a health check offered by an occupational health promotion program and filled out the Munich ChronoType Questionnaire (adapted to the rotational 12-h schedule for shift workers) and the WAI. We computed sleep duration on work and free days, chronotype, and social jetlag. We used linear regression models to examine chronotype, sleep duration and social jetlag for association with the WAI sum score, and proportional odds models to estimate the combined effect of social jetlag and sleep duration. Participants reported an average daily sleep duration of 7.35 h (SD: 1.2 h), had an average chronotype of 3:08 a.m. (SD: 1 h), and the average social jetlag corresponded to 1.96 h (SD: 2.05 h). Increasing social jetlag and shorter sleep duration were independently associated with a decreasing WAI, while chronotype per se was not associated with WAI. Short sleep duration combined with high social jetlag significantly increased the risk of poor WAI (OR = 1.36; 95% CI: 1.09-1.72), while long sleep duration and high social jetlag were not associated with poor WAI (OR = 1.09; 95% CI: 0.88-1.35). Our results add to a growing body of literature, suggesting that circadian misalignment, but not chronotype per se, may be critical for health. Our results indicate that longer sleep may override the adverse effects of social jetlag on WAI.

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1982-07-01

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

Likelihood Estimation of Gamma Ray Bursts Duration Distribution

OpenAIRE

Horvath, Istvan

2005-01-01

Two classes of Gamma Ray Bursts have been identified so far, characterized by T90 durations shorter and longer than approximately 2 seconds. It was shown that the BATSE 3B data allow a good fit with three Gaussian distributions in log T90. In the same Volume in ApJ. another paper suggested that the third class of GRBs is may exist. Using the full BATSE catalog here we present the maximum likelihood estimation, which gives us 0.5% probability to having only two subclasses. The MC simulation co...

Maximum Work of Free-Piston Stirling Engine Generators

Science.gov (United States)

Kojima, Shinji

2017-04-01

Using the method of adjoint equations described in Ref. [1], we have calculated the maximum thermal efficiencies that are theoretically attainable by free-piston Stirling and Carnot engine generators by considering the work loss due to friction and Joule heat. The net work done by the Carnot cycle is negative even when the duration of heat addition is optimized to give the maximum amount of heat addition, which is the same situation for the Brayton cycle described in our previous paper. For the Stirling cycle, the net work done is positive, and the thermal efficiency is greater than that of the Otto cycle described in our previous paper by a factor of about 2.7-1.4 for compression ratios of 5-30. The Stirling cycle is much better than the Otto, Brayton, and Carnot cycles. We have found that the optimized piston trajectories of the isothermal, isobaric, and adiabatic processes are the same when the compression ratio and the maximum volume of the same working fluid of the three processes are the same, which has facilitated the present analysis because the optimized piston trajectories of the Carnot and Stirling cycles are the same as those of the Brayton and Otto cycles, respectively.

Scheduled Evening Sleep and Enhanced Lighting Improve Adaptation to Night Shift Work in Older Adults

Science.gov (United States)

Chinoy, Evan D.; Harris, Michael P.; Kim, Min Ju; Wang, Wei; Duffy, Jeanne F.

2017-01-01

Objectives We tested whether a sleep and circadian-based treatment shown to improve circadian adaptation to night shifts and attenuate negative effects on alertness, performance, and sleep in young adults would also be effective in older adults. Methods We assessed subjective alertness, sustained attention (psychomotor vigilance task, PVT), sleep duration (actigraphy), and circadian timing (salivary dim-light melatonin onset, DLMO) in eighteen older adults (57.2±3.8 y; mean±SD) in a simulated shift work protocol. Four day shifts were followed by three night shifts in the laboratory. Participants slept at home and were randomized to either the Treatment Group (scheduled evening sleep and enhanced lighting during the latter half of night shifts), or Control Group (ad lib sleep and typical lighting during night shifts). Results Compared to day shifts, alertness and sustained attention declined on the first night shift in both groups, and was worse in the latter half of the night shifts. Alertness and attention improved on nights 2 and 3 for the Treatment Group but remained lower for the Control Group. Sleep duration in the Treatment Group remained similar to baseline (6–7 h) following night shifts, but was shorter (3–5 h) following night shifts in the Control Group. Treatment Group circadian timing advanced by 169.3±16.1 min (mean±SEM) but did not shift (−9.7±9.9 min) in the Control Group. Conclusions The combined treatment of scheduled evening sleep and enhanced lighting increased sleep duration and partially aligned circadian phase with sleep and work timing, resulting in improved night shift alertness and performance. PMID:27566781

Search method for long-duration gravitational-wave transients from neutron stars

International Nuclear Information System (INIS)

Prix, R.; Giampanis, S.; Messenger, C.

2011-01-01

We introduce a search method for a new class of gravitational-wave signals, namely, long-duration O(hours-weeks) transients from spinning neutron stars. We discuss the astrophysical motivation from glitch relaxation models and we derive a rough estimate for the maximal expected signal strength based on the superfluid excess rotational energy. The transient signal model considered here extends the traditional class of infinite-duration continuous-wave signals by a finite start-time and duration. We derive a multidetector Bayes factor for these signals in Gaussian noise using F-statistic amplitude priors, which simplifies the detection statistic and allows for an efficient implementation. We consider both a fully coherent statistic, which is computationally limited to directed searches for known pulsars, and a cheaper semicoherent variant, suitable for wide parameter-space searches for transients from unknown neutron stars. We have tested our method by Monte-Carlo simulation, and we find that it outperforms orthodox maximum-likelihood approaches both in sensitivity and in parameter-estimation quality.

New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

Energy Technology Data Exchange (ETDEWEB)

Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P. [ITB, Faculty of Earth Sciences and Tecnology (Indonesia); BMKG (Indonesia)

2012-06-20

The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance ({Delta}) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log {Delta}+ 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

Science.gov (United States)

Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P.

2012-06-01

The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance (Δ) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log Δ + 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

International Nuclear Information System (INIS)

Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P.

2012-01-01

The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance (Δ) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log Δ+ 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management.

Science.gov (United States)

Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

2018-02-25

The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism.

Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

Science.gov (United States)

Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

2018-01-01

The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism. PMID:29495346

Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

Directory of Open Access Journals (Sweden)

Bhagya Nathali Silva

2018-02-01

Full Text Available The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism.

Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

Directory of Open Access Journals (Sweden)

Rashmi Sharma

2014-01-01

Full Text Available In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF, Rate Monotonic (RM, and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation. Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR, Average CPU Utilization (ECU, Failure Ratio (FR, and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

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

Science.gov (United States)

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

2008-01-01

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

A Heuristic Scheduling Algorithm for Minimizing Makespan and Idle Time in a Nagare Cell

Directory of Open Access Journals (Sweden)

M. Muthukumaran

2012-01-01

Full Text Available Adopting a focused factory is a powerful approach for today manufacturing enterprise. This paper introduces the basic manufacturing concept for a struggling manufacturer with limited conventional resources, providing an alternative solution to cell scheduling by implementing the technique of Nagare cell. Nagare cell is a Japanese concept with more objectives than cellular manufacturing system. It is a combination of manual and semiautomatic machine layout as cells, which gives maximum output flexibility for all kind of low-to-medium- and medium-to-high- volume productions. The solution adopted is to create a dedicated group of conventional machines, all but one of which are already available on the shop floor. This paper focuses on the development of heuristic scheduling algorithm in step-by-step method. The algorithm states that the summation of processing time of all products on each machine is calculated first and then the sum of processing time is sorted by the shortest processing time rule to get the assignment schedule. Based on the assignment schedule Nagare cell layout is arranged for processing the product. In addition, this algorithm provides steps to determine the product ready time, machine idle time, and product idle time. And also the Gantt chart, the experimental analysis, and the comparative results are illustrated with five (1×8 to 5×8 scheduling problems. Finally, the objective of minimizing makespan and idle time with greater customer satisfaction is studied through.

Approximating Preemptive Stochastic Scheduling

OpenAIRE

Megow Nicole; Vredeveld Tjark

2009-01-01

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

Can we predict the duration of an interglacial?

Directory of Open Access Journals (Sweden)

P. C. Tzedakis

2012-09-01

Full Text Available Differences in the duration of interglacials have long been apparent in palaeoclimate records of the Late and Middle Pleistocene. However, a systematic evaluation of such differences has been hampered by the lack of a metric that can be applied consistently through time and by difficulties in separating the local from the global component in various proxies. This, in turn, means that a theoretical framework with predictive power for interglacial duration has remained elusive. Here we propose that the interval between the terminal oscillation of the bipolar seesaw and three thousand years (kyr before its first major reactivation provides an estimate that approximates the length of the sea-level highstand, a measure of interglacial duration. We apply this concept to interglacials of the last 800 kyr by using a recently-constructed record of interhemispheric variability. The onset of interglacials occurs within 2 kyr of the boreal summer insolation maximum/precession minimum and is consistent with the canonical view of Milankovitch forcing pacing the broad timing of interglacials. Glacial inception always takes place when obliquity is decreasing and never after the obliquity minimum. The phasing of precession and obliquity appears to influence the persistence of interglacial conditions over one or two insolation peaks, leading to shorter (~ 13 kyr and longer (~ 28 kyr interglacials. Glacial inception occurs approximately 10 kyr after peak interglacial conditions in temperature and CO₂, representing a characteristic timescale of interglacial decline. Second-order differences in duration may be a function of stochasticity in the climate system, or small variations in background climate state and the magnitude of feedbacks and mechanisms contributing to glacial inception, and as such, difficult to predict. On the other hand, the broad duration of an interglacial may be determined by the phasing of astronomical parameters and the history of

Schedules of Controlled Substances: Temporary Placement of ortho-Fluorofentanyl, Tetrahydrofuranyl Fentanyl, and Methoxyacetyl Fentanyl Into Schedule I. Temporary amendment; temporary scheduling order.

Science.gov (United States)

2017-10-26

The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule the synthetic opioids, N-(2-fluorophenyl)-N-(1-phenethylpiperidin-4-yl)propionamide (ortho-fluorofentanyl or 2-fluorofentanyl), N-(1-phenethylpiperidin-4-yl)-N-phenyltetrahydrofuran-2-carboxamide (tetrahydrofuranyl fentanyl), and 2-methoxy-N-(1-phenethylpiperidin-4-yl)-N-phenylacetamide (methoxyacetyl fentanyl), into Schedule I. This action is based on a finding by the Administrator that the placement of ortho-fluorofentanyl, tetrahydrofuranyl fentanyl, and methoxyacetyl fentanyl into Schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to Schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, ortho-fluorofentanyl, tetrahydrofuranyl fentanyl, and methoxyacetyl fentanyl.

Estimating potential diapause duration in Calanus finmarchicus

Science.gov (United States)

Saumweber, Whitley J.; Durbin, Edward G.

2006-11-01

Deep basins in the Gulf of Maine act as refuge for a large population of diapausing Calanus finmarchicus during the summer and fall. This population acts as the primary seed population for Georges Bank in the spring and is thought to be composed primarily of individuals that developed during the previous spring bloom. The factors affecting growth and mortality in the summer-fall population are not well understood, however, and loss terms from advection and starvation may be large. To assess the potential energetic limitation and loss of C. finmarchicus from the Gulf of Maine basins, a new nitrogen-specific respiration model has been developed for the resting stage of the species. Stage C5 C. finmarchicus were collected during July, September, and December 2003 from Wilkinson and Georges Basins. Animals were collected using both MOCNESS tows and zooplankton samplers on the Johnson Sea Link II submersible. Metabolic rates were measured using a Micro-Oxymax gas analyzer and Winkler incubation techniques both at sea and on animals kept in culture on shore. Respiration rates measured in the field were not significantly different from those measured on shore, with a mean of 130 μmol O 2 gN -1 h -1 (14.4 μmol O 2 gC -1 h -1) at 0 °C and a Q10 of 2.77 (2.58 for carbon-specific respiration). Using the nitrogen-specific rates in conjunction with visual estimates of nitrogen weight and lipid stores, we derived a discrete function for predicting potential diapause duration based on an animal's length, oil sac volume, and the in situ temperature. The maximum potential diapause duration for a C5 C. finmarchicus is predicted to range from 280 days at 0 °C to approximately 90 days at 11 °C. The maximum potential diapause duration in the Gulf of Maine is predicted to be between 3.5 and 5.5 months. These results suggest that energetic limitation may play a role in controlling the population dynamics of diapausing C. finmarchicus in the Gulf of Maine. A reassessment of the

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.

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

Self-scheduling with Microsoft Excel.

Science.gov (United States)

Irvin, S A; Brown, H N

1999-01-01

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

A Suboptimal Scheme for Multi-User Scheduling in Gaussian Broadcast Channels

KAUST Repository

Zafar, Ammar; Alouini, Mohamed-Slim; Shaqfeh, Mohammad

2014-01-01

This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

A Suboptimal Scheme for Multi-User Scheduling in Gaussian Broadcast Channels

KAUST Repository

Zafar, Ammar

2014-05-28

This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

Immunization Schedules for Adults

Science.gov (United States)

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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

Nontraditional work schedules for pharmacists.

Science.gov (United States)

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

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

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

Science.gov (United States)

Belke, Terry W

2012-07-01

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

Cost and schedule reduction for next-generation Candu

International Nuclear Information System (INIS)

Hopwood, J.M.; Yu, S.; Pakan, M.; Soulard, M.

2002-01-01

AECL has developed a suite of technologies for Candu R reactors that enable the next step in the evolution of the Candu family of heavy-water-moderated fuel-channel reactors. These technologies have been combined in the design for the Advanced Candu Reactor TM1 (ACRTM), AECL's next generation Candu power plant. The ACR design builds extensively on the existing Candu experience base, but includes innovations, in design and in delivery technology, that provide very substantial reductions in capital cost and in project schedules. In this paper, main features of next generation design and delivery are summarized, to provide the background basis for the cost and schedule reductions that have been achieved. In particular the paper outlines the impact of the innovative design steps for ACR: - Selection of slightly enriched fuel bundle design; - Use of light water coolant in place of traditional Candu heavy water coolant; - Compact core design with unique reactor physics benefits; - Optimized coolant and turbine system conditions. In addition to the direct cost benefits arising from efficiency improvement, and from the reduction in heavy water, the next generation Candu configuration results in numerous additional indirect cost benefits, including: - Reduction in number and complexity of reactivity mechanisms; - Reduction in number of heavy water auxiliary systems; - Simplification in heat transport and its support systems; - Simplified human-machine interface. The paper also describes the ACR approach to design for constructability. The application of module assembly and open-top construction techniques, based on Candu and other worldwide experience, has been proven to generate savings in both schedule durations and overall project cost, by reducing premium on-site activities, and by improving efficiency of system and subsystem assembly. AECL's up-to-date experience in the use of 3-D CADDS and related engineering tools has also been proven to reduce both engineering and

BIM-BASED SCHEDULING OF CONSTRUCTION

DEFF Research Database (Denmark)

Andersson, Niclas; Büchmann-Slorup, Rolf

2010-01-01

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

Scheduled evening sleep and enhanced lighting improve adaptation to night shift work in older adults.

Science.gov (United States)

Chinoy, Evan D; Harris, Michael P; Kim, Min Ju; Wang, Wei; Duffy, Jeanne F

2016-12-01

We tested whether a sleep and circadian-based treatment shown to improve circadian adaptation to night shifts and attenuate negative effects on alertness, performance and sleep in young adults would also be effective in older adults. We assessed subjective alertness, sustained attention (psychomotor vigilance task, PVT), sleep duration (actigraphy) and circadian timing (salivary dim-light melatonin onset, DLMO) in 18 older adults (57.2±3.8 years; mean±SD) in a simulated shift work protocol. 4 day shifts were followed by 3 night shifts in the laboratory. Participants slept at home and were randomised to either the treatment group (scheduled evening sleep and enhanced lighting during the latter half of night shifts) or control group (ad-lib sleep and typical lighting during night shifts). Compared with day shifts, alertness and sustained attention declined on the first night shift in both groups, and was worse in the latter half of the night shifts. Alertness and attention improved on nights 2 and 3 for the treatment group but remained lower for the control group. Sleep duration in the treatment group remained similar to baseline (6-7 hours) following night shifts, but was shorter (3-5 hours) following night shifts in the control group. Treatment group circadian timing advanced by 169.3±16.1 min (mean±SEM) but did not shift (-9.7±9.9 min) in the control group. The combined treatment of scheduled evening sleep and enhanced lighting increased sleep duration and partially aligned circadian phase with sleep and work timing, resulting in improved night shift alertness and performance. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

Power generation scheduling. A free market based procedure with reserve constraints included

International Nuclear Information System (INIS)

Huse, Einar Staale

1998-01-01

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs

Power generation scheduling. A free market based procedure with reserve constraints included

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1999-12-31

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs.

Power generation scheduling. A free market based procedure with reserve constraints included

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1998-12-31

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs.

The effect of the greek research reactor operating schedule on its fission product inventory

International Nuclear Information System (INIS)

Annousis, J.N., Armyriotis, J.S.

1987-12-01

A simple method to convert the fission product inventory of the 'Democritos' uous Greek Research Reactor (GRR) corresponding to its continuous operation over a given time interval, into the inventory corresponting to GRR discontinuous but periodic operation of the same total duration, is presented in this paper. Relevant correction factors for 31 radioecologically significant radionuclides of the inventory are given as a function of the number of hours or operation per day, 5 days per week of the GRR, according to its present of possible future operating schedule

The effect of the Greek Research Reactor operating schedule on its fission product inventory

International Nuclear Information System (INIS)

ANOUSSIS, J.N.; ARMYRIOTIS, J.S.

1987-12-01

Full text:A simple method to convert the fission product inventory of ''Demokritos'' Greek Research Reactor(GRR) corresponding to its continuous operation over a given time interval, into the inventory corresponding to GRR discontinuous but periodic operation of the same total duration, is presented in this paper. Relevant correction factors for 31 radioecologically significant radionuclides of the inventory are given as a function of the number of hours of operation per day, 5 days per week of the GRR, according to its present or possible future operating schedule. (author)

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

Science.gov (United States)

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

2012-01-01

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

Scheduling algorithms for saving energy and balancing load

Energy Technology Data Exchange (ETDEWEB)

Antoniadis, Antonios

2012-08-03

In this thesis we study problems of scheduling tasks in computing environments. We consider both the modern objective function of minimizing energy consumption, and the classical objective of balancing load across machines. We first investigate offline deadline-based scheduling in the setting of a single variable-speed processor that is equipped with a sleep state. The objective is that of minimizing the total energy consumption. Apart from settling the complexity of the problem by showing its NP-hardness, we provide a lower bound of 2 for general convex power functions, and a particular natural class of schedules called s{sub crit}-schedules. We also present an algorithmic framework for designing good approximation algorithms. For general convex power functions our framework improves the best known approximation-factor from 2 to 4/3. This factor can be reduced even further to 137/117 for a specific well-motivated class of power functions. Furthermore, we give tight bounds to show that our framework returns optimal s{sub crit}-schedules for the two aforementioned power-function classes. We then focus on the multiprocessor setting where each processor has the ability to vary its speed. Job migration is allowed, and we again consider classical deadline-based scheduling with the objective of energy minimization. We first study the offline problem and show that optimal schedules can be computed efficiently in polynomial time for any convex and non-decreasing power function. Our algorithm relies on repeated maximum flow computations. Regarding the online problem and power functions P(s) = s{sup {alpha}}, where s is the processor speed and {alpha} > 1 a constant, we extend the two well-known single-processor algorithms Optimal Available and Average Rate. We prove that Optimal Available is {alpha}{sup {alpha}}-competitive as in the single-processor case. For Average Rate we show a competitive factor of (2{alpha}){sup {alpha}}/2 + 1, i.e., compared to the single

The impact of training schedules on the sleep and fatigue of elite athletes.

Science.gov (United States)

Sargent, Charli; Lastella, Michele; Halson, Shona L; Roach, Gregory D

2014-12-01

In any sport, successful performance requires a planned approach to training and recovery. While sleep is recognized as an essential component of this approach, the amount and quality of sleep routinely obtained by elite athletes has not been systematically evaluated. Data were collected from 70 nationally ranked athletes from seven different sports. Athletes wore wrist activity monitors and completed self-report sleep/training diaries for 2 weeks during normal training. The athletes also recorded their fatigue level prior to each training session using a 7-point scale. On average, the athletes spent 08:18 ± 01:12 h in bed, fell asleep at 23:06 ± 01:12 h, woke at 6:48 ± 01:30 h and obtained 06:30 ± 01:24 h of sleep per night. There was a marked difference in the athletes' sleep/wake behaviour on training days and rest days. Linear mixed model analyses revealed that on nights prior to training days, time spent in bed was significantly shorter (p = 0.001), sleep onset and offset times were significantly earlier (p sleep obtained was significantly less (p = 0.001), than on nights prior to rest days. Moreover, there was a significant effect of sleep duration on pre-training fatigue levels (p ≤ 0.01). Specifically, shorter sleep durations were associated with higher levels of pre-training fatigue. Taken together, these findings suggest that the amount of sleep an elite athlete obtains is dictated by their training schedule. In particular, early morning starts reduce sleep duration and increase pre-training fatigue levels. When designing schedules, coaches should be aware of the implications of the timing of training sessions for sleep and fatigue. In cases where early morning starts are unavoidable, countermeasures for minimizing sleep loss - such as strategic napping during the day and correct sleep hygiene practices at night - should be considered.

A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem

Directory of Open Access Journals (Sweden)

Jian Gao

2011-08-01

Full Text Available Distributed Permutation Flowshop Scheduling Problem (DPFSP is a newly proposed scheduling problem, which is a generalization of classical permutation flow shop scheduling problem. The DPFSP is NP-hard in general. It is in the early stages of studies on algorithms for solving this problem. In this paper, we propose a GA-based algorithm, denoted by GA_LS, for solving this problem with objective to minimize the maximum completion time. In the proposed GA_LS, crossover and mutation operators are designed to make it suitable for the representation of DPFSP solutions, where the set of partial job sequences is employed. Furthermore, GA_LS utilizes an efficient local search method to explore neighboring solutions. The local search method uses three proposed rules that move jobs within a factory or between two factories. Intensive experiments on the benchmark instances, extended from Taillard instances, are carried out. The results indicate that the proposed hybrid genetic algorithm can obtain better solutions than all the existing algorithms for the DPFSP, since it obtains better relative percentage deviation and differences of the results are also statistically significant. It is also seen that best-known solutions for most instances are updated by our algorithm. Moreover, we also show the efficiency of the GA_LS by comparing with similar genetic algorithms with the existing local search methods.

Network scheduling at Belene NPP construction site

International Nuclear Information System (INIS)

Matveev, A.

2010-01-01

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

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

NARCIS (Netherlands)

Gracia, P.; Kalmijn, M.

2016-01-01

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

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry......-specific characteristics induce specific and complex scheduling problems. Based on ideas about decomposition of the scheduling task and the production process, we develop an analysis methodology for scheduling problems in food processing. This combines an analysis of structural (technological) elements of the production...... process with an analysis of the tasks of the scheduler. This helps to understand, describe, and structure scheduling problems in food processing, and forms a basis for improving scheduling and applying methods developed in literature. It also helps in evaluating the organisational structures...

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

Science.gov (United States)

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

2016-05-01

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

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

Conception of Self-Construction Production Scheduling System

Science.gov (United States)

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

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

Effect of sampling schedule on pharmacokinetic parameter estimates of promethazine in astronauts

Science.gov (United States)

Boyd, Jason L.; Wang, Zuwei; Putcha, Lakshmi

2005-08-01

Six astronauts on the Shuttle Transport System (STS) participated in an investigation on the pharmacokinetics of promethazine (PMZ), a medication used for the treatment of space motion sickness (SMS) during flight. Each crewmember completed the protocol once during flight and repeated thirty days after returned to Earth. Saliva samples were collected at scheduled times for 72 h after PMZ administration; more frequent samples were collected on the ground than during flight owing to schedule constraints in flight. PMZ concentrations in saliva were determined by a liquid chromatographic/mass spectrometric (LC-MS) assay and pharmacokinetic parameters (PKPs) were calculated using actual flight and ground-based data sets and using time-matched sampling schedule on ground to that during flight. Volume of distribution (Vc) and clearance (Cls) decreased during flight compared to that from time-matched ground data set; however, ClS and Vc estimates were higher for all subjects when partial ground data sets were used for analysis. Area under the curve (AUC) normalized with administered dose was similar in flight and partial ground data; however AUC was significantly lower using time-matched sampling compared with the full data set on ground. Half life (t1/2) was longest during flight, shorter with matched-sampling schedule on ground and shortest when complete data set from ground was used. Maximum concentration (Cmax), time for Cmax (tmax), parameters of drug absorption, depicted a similar trend with lowest and longest respectively, during flight, lower with time- matched ground data and highest and shortest with full ground data.

Working with a fixed operating room team on consecutive similar cases and the effect on case duration and turnover time.

Science.gov (United States)

Stepaniak, Pieter S; Vrijland, Wietske W; de Quelerij, Marcel; de Vries, Guus; Heij, Christiaan

2010-12-01

If variation in procedure times could be controlled or better predicted, the cost of surgeries could be reduced through improved scheduling of surgical resources. This study on the impact of similar consecutive cases on the turnover, surgical, and procedure times tests the perception that repeating the same manual tasks reduces the duration of these tasks. We hypothesize that when a fixed team works on similar consecutive cases the result will be shorter turnover and procedure duration as well as less variation as compared with the situation without a fixed team. Case-control study. St Franciscus Hospital, a large general teaching hospital in Rotterdam, the Netherlands. Two procedures, inguinal hernia repair and laparoscopic cholecystectomy, were selected and divided across a control group and a study group. Patients were randomly assigned to the study or control group. Preparation time, surgical time, procedure time, and turnover time. For inguinal hernia repair, we found a significantly lower preparation time and 10 minutes less procedure time in the study group, as compared with the control group. Variation in the study group was lower, as compared with the control group. For laparoscopic cholecystectomy, preparation time was significantly lower in the study group, as compared with the control group. For both procedures, there was a significant decrease in turnover time. Scheduling similar consecutive cases and performing with a fixed team results in lower turnover times and preparation times. The procedure time of the inguinal hernia repair decreased significantly and has practical scheduling implications. For more complex surgery, like laparoscopic cholecystectomy, there is no effect on procedure time.

Schedule and cost reduction of nuclear generating facilities in Ontario study overview

International Nuclear Information System (INIS)

Huterer, J.

1991-01-01

During the five year period 1985 to 1990, Ontario Hydro conducted a major study with the objective to reduce the cost and construction duration for future nuclear generating facilities in Ontario. This paper reports on the study called Major Projects: Schedule and Cost Reduction Study (SCRS). Ontario Hydro is a public utility with the responsibility for meeting electricity need for the province of Ontario with a population of 9.6 million. In order to adequately address future electricity needs, Ontario Hydro has developed and submitted a demand/supply plan which covers the next 25 years. The SCRS for major projects contributed to this demand/supply plan

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.

Pulse duration discriminator

International Nuclear Information System (INIS)

Kosakovskij, L.F.

1980-01-01

Basic circuits of a discriminator for discrimination of pulses with the duration greater than the preset one, and of a multifunctional discriminator allowing to discriminate pulses with the duration greater (tsub(p)>tsub(s)) and lesser (tsub(p) tsub(s) and with the duration tsub(p) [ru

Immunization Schedules for Infants and Children

Science.gov (United States)

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

Collaborative Optimization of Stop Schedule Plan and Ticket Allotment for the Intercity Train

Directory of Open Access Journals (Sweden)

Xichun Chen

2016-01-01

Full Text Available As regards the ticket allotment issue of the intercity passenger corridor designed for different train grades, the matching relationship between the ticket allotment and the passenger flow demand is studied. The passenger flow conversion equation which is based on the collaborative optimization of the intercity train stop schedule plan and ticket allotment is established. Then the mathematical model aiming at the maximum revenue of intercity train system and the highest satisfaction from the passengers is established. The particle swarm harmony search algorithm is designed to solve the model. The example verifies the effectiveness of the model and algorithm, which indicates that, through the collaborative optimization of the stop schedule plan and ticket allotment for different grades intercity trains, the sectional utilization rate of the train can be improved; meanwhile, the optimum matching between the intercity train revenue and the passenger satisfaction can be realized.

A Formal Product-Line Engineering Approach for Schedulers

NARCIS (Netherlands)

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

2017-01-01

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

Robust and Flexible Scheduling with Evolutionary Computation

DEFF Research Database (Denmark)

Jensen, Mikkel T.

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

Quantitative computed tomography versus spirometry in predicting air leak duration after major lung resection for cancer.

Science.gov (United States)

Ueda, Kazuhiro; Kaneda, Yoshikazu; Sudo, Manabu; Mitsutaka, Jinbo; Li, Tao-Sheng; Suga, Kazuyoshi; Tanaka, Nobuyuki; Hamano, Kimikazu

2005-11-01

Emphysema is a well-known risk factor for developing air leak or persistent air leak after pulmonary resection. Although quantitative computed tomography (CT) and spirometry are used to diagnose emphysema, it remains controversial whether these tests are predictive of the duration of postoperative air leak. Sixty-two consecutive patients who were scheduled to undergo major lung resection for cancer were enrolled in this prospective study to define the best predictor of postoperative air leak duration. Preoperative factors analyzed included spirometric variables and area of emphysema (proportion of the low-attenuation area) that was quantified in a three-dimensional CT lung model. Chest tubes were removed the day after disappearance of the air leak, regardless of pleural drainage. Univariate and multivariate proportional hazards analyses were used to determine the influence of preoperative factors on chest tube time (air leak duration). By univariate analysis, site of resection (upper, lower), forced expiratory volume in 1 second, predicted postoperative forced expiratory volume in 1 second, and area of emphysema ( 10%) were significant predictors of air leak duration. By multivariate analysis, site of resection and area of emphysema were the best independent determinants of air leak duration. The results were similar for patients with a smoking history (n = 40), but neither forced expiratory volume in 1 second nor predicted postoperative forced expiratory volume in 1 second were predictive of air leak duration. Quantitative CT is superior to spirometry in predicting air leak duration after major lung resection for cancer. Quantitative CT may aid in the identification of patients, particularly among those with a smoking history, requiring additional preventive procedures against air leak.

A new sentence generator providing material for maximum reading speed measurement.

Science.gov (United States)

Perrin, Jean-Luc; Paillé, Damien; Baccino, Thierry

2015-12-01

A new method is proposed to generate text material for assessing maximum reading speed of adult readers. The described procedure allows one to generate a vast number of equivalent short sentences. These sentences can be displayed for different durations in order to determine the reader's maximum speed using a psychophysical threshold algorithm. Each sentence is built so that it is either true or false according to common knowledge. The actual reading is verified by asking the reader to determine the truth value of each sentence. We based our design on the generator described by Crossland et al. and upgraded it. The new generator handles concepts distributed in an ontology, which allows an easy determination of the sentences' truth value and control of lexical and psycholinguistic parameters. In this way many equivalent sentence can be generated and displayed to perform the measurement. Maximum reading speed scores obtained with pseudo-randomly chosen sentences from the generator were strongly correlated with maximum reading speed scores obtained with traditional MNREAD sentences (r = .836). Furthermore, the large number of sentences that can be generated makes it possible to perform repeated measurements, since the possibility of a reader learning individual sentences is eliminated. Researchers interested in within-reader performance variability could use the proposed method for this purpose.

The development of KMRR schedule and progress control system (KSPCS) for the master schedule of KMRR project

International Nuclear Information System (INIS)

Choi, Chang Woong; Lee, Tae Joon; Kim, Joon Yun; Cho, Yun Ho; Hah, Jong Hyun

1993-07-01

This report was to development the computerized schedule and progress control system for the master schedule of KMRR project with ARTEMIS 7000/386 CM (Ver. 7.4.2.) based on project management theory (PERT/CPM, PDM, and S-curve). This system has been efficiently used for KMRR master schedule and will be utilized for the detail scheduling of KMRR project. (Author) 23 refs., 26 figs., 52 tabs

The development of KMRR schedule and progress control system (KSPCS) for the master schedule of KMRR project

Energy Technology Data Exchange (ETDEWEB)

Choi, Chang Woong; Lee, Tae Joon; Kim, Joon Yun; Cho, Yun Ho; Hah, Jong Hyun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

1993-07-01

This report was to development the computerized schedule and progress control system for the master schedule of KMRR project with ARTEMIS 7000/386 CM (Ver. 7.4.2.) based on project management theory (PERT/CPM, PDM, and S-curve). This system has been efficiently used for KMRR master schedule and will be utilized for the detail scheduling of KMRR project. (Author) 23 refs., 26 figs., 52 tabs.

An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times

Directory of Open Access Journals (Sweden)

Rui Zhang

2011-09-01

Full Text Available Due to the influence of unpredictable random events, the processing time of each operation should be treated as random variables if we aim at a robust production schedule. However, compared with the extensive research on the deterministic model, the stochastic job shop scheduling problem (SJSSP has not received sufficient attention. In this paper, we propose an artificial bee colony (ABC algorithm for SJSSP with the objective of minimizing the maximum lateness (which is an index of service quality. First, we propose a performance estimate for preliminary screening of the candidate solutions. Then, the K-armed bandit model is utilized for reducing the computational burden in the exact evaluation (through Monte Carlo simulation process. Finally, the computational results on different-scale test problems validate the effectiveness and efficiency of the proposed approach.

Scheduling home appliances for energy efficient buildings

DEFF Research Database (Denmark)

Rossello Busquet, Ana; Kardaras, Georgios; Iversen, Villy Bæk

2010-01-01

The number of appliances found in users’ homes is increasing together with electricity consumption of users’ residences. In addition, there is a tendency to consume during the same period leading to demand peaks. During these periods, electricity providers are forced to develop costly methods...... to generate enough power to meet consumers’ requirements. In addition, high demand peaks can lead to electricity shortages or even blackouts in certain areas. In order to avoid demand peaks, users’ appliances should consume electricity in a more distributed way. A new methodology to schedule the usage of home...... appliances is proposed and analyzed. The main concept behind this approach is the aggregation of home appliances into priority classes and the definition of a maximum power consumption threshold, which is not allowed to be exceeded during peak hours. The scenario simulated describes a modern household, where...

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

Science.gov (United States)

2013-04-12

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

A branch and cut approach to the multiproduct pipeline scheduling problem

Energy Technology Data Exchange (ETDEWEB)

Souza Filho, Erito Marques de; Bahiense, Laura; Ferreira Filho, Virgilio Jose Martins [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil)

2009-07-01

Pipelines are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. We address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. The major difficulties faced in these operations are related to the satisfaction of product demands by the various consumer markets, and operational constraints such as the maximum sizes of contiguous pumping packs, and the immiscible products. Several researchers have developed models and techniques for this short-term pipeline scheduling problem. Two different methodologies have been proposed in the literature: heuristic search techniques and exact methods. In this paper, we use a branch-and cut algorithm, performed in Xpress-MP{sup T}M, and compare the solutions obtained with that ones obtained before using the Variable Neighborhood Search metaheuristic. The computational results showed a significant improvement of performance in relation to previous algorithm. (author)

Probabilistic representation of duration of load effects in timber structures

DEFF Research Database (Denmark)

Svensson, Staffan

2011-01-01

Reliability analysis of structures for the purpose of code calibration or reliability verification of specific structures requires that the relevant failure modes are represented and analyzed. For structural timber, sustaining a life load, two failure cases for each failure mode have......-based design of timber structures in terms of a modification factor View the MathML source which is multiplied on the short-term resistance of the timber material. The scenario of a beam subject to office space life loads is analyzed and the modification factor View the MathML source is calibrated by using...... to be considered. These two cases are maximum load level exceeding load-carrying capacity and damage accumulation (caused by the load and its duration) leading to failure. The effect of both load intensity and load duration on the capacity of timber has been an area of large interest over the last decades...

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

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.

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.

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

Longer repetition duration increases muscle activation and blood lactate response in matched resistance training protocols

Directory of Open Access Journals (Sweden)

Hugo Cesar Martins-Costa

2016-03-01

Full Text Available Abstract This study analyzed the effect of different repetition durations on electromyographic and blood lactate responses of the bench press exercise. Fifteen recreationally trained male volunteers completed two training protocols, matched for intensity (% one-repetition maximum; 1RM, number of sets, number of repetitions, and rest intervals. One of the protocols was performed with a repetition duration of 4 s (2 s concentric: 2 s eccentric; 2:2 protocol, whereas the second protocol had a repetition duration of 6 s (2 s concentric: 4 s eccentric; 2:4 protocol. The results showed higher normalized integrated electromyography (pectoralis major and triceps brachii for the 2:4 protocol. Blood lactate concentration was also higher in the 2:4 protocol across all sets. These results show that adding 2 s to the eccentric action in matched training protocols increases muscle activation and blood lactate response, which reinforces the notion that increasing repetition duration is an alternative load progression in resistance training.

The triangle scheduling problem

NARCIS (Netherlands)

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

2017-01-01

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

Effects of methylprednisolone on the duration of rocuronium-induced neuromuscular block

Science.gov (United States)

Geng, Weilian; Nie, Yuyan; Huang, Shaoqiang

2017-01-01

Abstract Background: We aim to investigate whether intraoperative use of methylprednisolone could affect the duration of rocuronium-induced neuromuscular blockade. Methods: A double blind, randomized, placebo-controlled trial was conducted. A total of 136 patients underwent gynecologic laparoscopic surgery were randomly divided into 3 groups: pregroup, receiving intravenous injection of methylprednisolone (40 mg) 30 minutes before induction of anesthesia; postgroup, receiving intravenous injection of methylprednisolone (40 mg) immediately after induction of anesthesia and intubation; and control group, receiving intravenous injection of normal saline. Patients were intravenously administrated with rocuronium 0.6 mg/kg, and changes in adductor policies evoked twitch responses were measured by ulnar nerve stimulator. Results: We found that all patients achieved maximum blockade effects, and there was no difference in onset time among the 2 groups. For time required to achieve train-of-four ratio (TOFR) 90%, pregroup (64.50 ± 10.52 minutes) and postgroup (65.29 ± 11.64 minutes) were significantly shorter than that of the control group (71.04 ± 10.55 minutes, P = .027), whereas clinical duration and total duration were significantly shorter in the 2 groups received methylprednisolone than the control group. However, there was no significant difference between the 2 treatment groups either in clinical duration and total duration of muscle relaxants, or time required to achieve TOFR 90%. No significant difference was found in recovery index among the 3 groups. Conclusion: Our findings suggest that a single intravenous injection of methylprednisolone, no matter preoperatively or intraoperatively, could shorten the duration of rocuronium-induced neuromuscular blockade. PMID:28953616

A System for Automatically Generating Scheduling Heuristics

Science.gov (United States)

Morris, Robert

1996-01-01

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

A novel minimum cost maximum power algorithm for future smart home energy management.

Science.gov (United States)

Singaravelan, A; Kowsalya, M

2017-11-01

With the latest development of smart grid technology, the energy management system can be efficiently implemented at consumer premises. In this paper, an energy management system with wireless communication and smart meter are designed for scheduling the electric home appliances efficiently with an aim of reducing the cost and peak demand. For an efficient scheduling scheme, the appliances are classified into two types: uninterruptible and interruptible appliances. The problem formulation was constructed based on the practical constraints that make the proposed algorithm cope up with the real-time situation. The formulated problem was identified as Mixed Integer Linear Programming (MILP) problem, so this problem was solved by a step-wise approach. This paper proposes a novel Minimum Cost Maximum Power (MCMP) algorithm to solve the formulated problem. The proposed algorithm was simulated with input data available in the existing method. For validating the proposed MCMP algorithm, results were compared with the existing method. The compared results prove that the proposed algorithm efficiently reduces the consumer electricity consumption cost and peak demand to optimum level with 100% task completion without sacrificing the consumer comfort.

Applying dynamic priority scheduling scheme to static systems of pinwheel task model in power-aware scheduling.

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.

Improvement to Airport Throughput Using Intelligent Arrival Scheduling and an Expanded Planning Horizon

Science.gov (United States)

Glaab, Patricia C.

2012-01-01

The first phase of this study investigated the amount of time a flight can be delayed or expedited within the Terminal Airspace using only speed changes. The Arrival Capacity Calculator analysis tool was used to predict the time adjustment envelope for standard descent arrivals and then for CDA arrivals. Results ranged from 0.77 to 5.38 minutes. STAR routes were configured for the ACES simulation, and a validation of the ACC results was conducted comparing the maximum predicted time adjustments to those seen in ACES. The final phase investigated full runway-to-runway trajectories using ACES. The radial distance used by the arrival scheduler was incrementally increased from 50 to 150 nautical miles (nmi). The increased Planning Horizon radii allowed the arrival scheduler to arrange, path stretch, and speed-adjust flights to more fully load the arrival stream. The average throughput for the high volume portion of the day increased from 30 aircraft per runway for the 50 nmi radius to 40 aircraft per runway for the 150 nmi radius for a traffic set representative of high volume 2018. The recommended radius for the arrival scheduler s Planning Horizon was found to be 130 nmi, which allowed more than 95% loading of the arrival stream.

Lifetime predictions for the Solar Maximum Mission (SMM) and San Marco spacecraft

Science.gov (United States)

Smith, E. A.; Ward, D. T.; Schmitt, M. W.; Phenneger, M. C.; Vaughn, F. J.; Lupisella, M. L.

1989-01-01

Lifetime prediction techniques developed by the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD) are described. These techniques were developed to predict the Solar Maximum Mission (SMM) spacecraft orbit, which is decaying due to atmospheric drag, with reentry predicted to occur before the end of 1989. Lifetime predictions were also performed for the Long Duration Exposure Facility (LDEF), which was deployed on the 1984 SMM repair mission and is scheduled for retrieval on another Space Transportation System (STS) mission later this year. Concepts used in the lifetime predictions were tested on the San Marco spacecraft, which reentered the Earth's atmosphere on December 6, 1988. Ephemerides predicting the orbit evolution of the San Marco spacecraft until reentry were generated over the final 90 days of the mission when the altitude was less than 380 kilometers. The errors in the predicted ephemerides are due to errors in the prediction of atmospheric density variations over the lifetime of the satellite. To model the time dependence of the atmospheric densities, predictions of the solar flux at the 10.7-centimeter wavelength were used in conjunction with Harris-Priester (HP) atmospheric density tables. Orbital state vectors, together with the spacecraft mass and area, are used as input to the Goddard Trajectory Determination System (GTDS). Propagations proceed in monthly segments, with the nominal atmospheric drag model scaled for each month according to the predicted monthly average value of F10.7. Calibration propagations are performed over a period of known orbital decay to obtain the effective ballistic coefficient. Progagations using plus or minus 2 sigma solar flux predictions are also generated to estimate the despersion in expected reentry dates. Definitive orbits are compared with these predictions as time expases. As updated vectors are received, these are also propagated to reentryto continually update the lifetime predictions.

Q-switched all-fiber laser with short pulse duration based on tungsten diselenide

Science.gov (United States)

Li, Wenyi; OuYang, Yuyi; Ma, Guoli; Liu, Mengli; Liu, Wenjun

2018-05-01

Fiber lasers are widely used in industrial processing, sensing, medical and communications applications due to their simple structure, good stability and low cost. With the rapid development of fiber lasers and the sustained improvement of industrial laser quality requirements, researchers in ultrafast optics focus on how to get laser pulses with high output power and narrow pulse duration. Q-switched technology is one of the most effective techniques to generate ultrashort pulses. In this paper, a tungsten diselenide saturable absorber with 16.82% modulation depth is prepared by chemical vapor deposition. Experimental results show that when the pump power changes from 115.7 mW to 630 mW, the all-fiber laser can achieve a stable Q-switched pulse output. The repetition rate of the output pulse varies from 80.32 kHz to 204.2 kHz, the pulse duration is 581 ns, the maximum output power is 17.1 mW and the maximum pulse energy is 83.7 nJ. Results in this paper show that tungsten diselenide can be applied to ultrafast optics, which is a kind of saturable absorption material with excellent properties.

Artificial intelligence approaches to astronomical observation scheduling

Science.gov (United States)

Johnston, Mark D.; Miller, Glenn

1988-01-01

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

Results of a 5-Week Schedule of Modern Total Skin Electron Beam Radiation Therapy

Energy Technology Data Exchange (ETDEWEB)

Morris, Stephen Lloyd, E-mail: stephen.morris@gstt.nhs.uk [St Johns Institute of Dermatology, Guys and St Thomas Hospital, London (United Kingdom); McGovern, Mark; Bayne, Sally; Wain, Mary; Child, Fiona; Whittaker, Sean [St Johns Institute of Dermatology, Guys and St Thomas Hospital, London (United Kingdom)

2013-08-01

Purpose: To report the outcomes of a 5-week schedule of total skin electron beam radiation therapy (TSEB) for mycosis fungoides (MF). Methods: Over 5 years, 41 patients with confirmed MF were treated with a modern TSEB technique delivering 30 Gy in 20 fractions over 5 weeks to the whole skin surface. Data were collected prospectively and entered into the skin tumor unit research database. Skin modified skin weighted assessment tool score data were collected to determine response, duration of response, survival, and toxicity. The outcomes were analyzed according to the patient's stage before TSEB, prognostic factors, and adjuvant treatments. Results: Seventeen patients were stage 1B, 19 were stage IIB, 3 were stage III, and 2 were stage IV. The overall response rate was 95%, with a complete response rate of 51%. Seventy-six percent of patients had relapsed at median follow-up of 18 months. The median time to relapse was 12 months, to systemic therapy was 15 months, and to modified skin weighted assessment tool progression above baseline was 44 months. The complete response rate was 59% in stage IB and 47% in stage IIB patients. The median time to skin relapse was longer in stage IB compared with stage IIB, 18 months versus 9 months. The median time to systemic therapy was longer in stage IB compared with stage IIB, >56 months versus 8 months. The median overall survival was 35 months: >56 months for stage IB, 25 months for stage IIB, 46 months for stage III, and 23.5 months for stage IV. Fifteen patients received adjuvant psoralen + ultraviolet A treatment with no difference seen in the time to relapse. Conclusions: This 5-week schedule of TSEB for MF has a high response rate with comparable duration of response to other regimens. Future studies are needed to find adjuvant and combination treatments to improve the duration of response.

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

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

Alternative Work Schedules: Definitions

Science.gov (United States)

Journal of the College and University Personnel Association, 1977

1977-01-01

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

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.

Voltage scheduling for low power/energy

Science.gov (United States)

Manzak, Ali

2001-07-01

Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

The software for schedule creation and optimization solves a difficult, important and practical problem. The proposed solution is an online employee portal where administrator users can create and manage watch schedules and employee requests. Each employee can login with his/her own account and see his/her assignments, manage requests, etc. Employees set as administrators can perform the employee scheduling online, manage requests, etc. This scheduling software allows users not only to see the initial and optimized watch schedule in a simple and understandable form, but also to create special rules and criteria and input their business. The system using rules automatically will generate watch schedule.

Technology for planning and scheduling under complex constraints

Science.gov (United States)

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

1997-02-01

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

INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

Directory of Open Access Journals (Sweden)

Remigiusz Romuald Iwańkowicz

2015-02-01

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1983-05-01

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

CMS multicore scheduling strategy

International Nuclear Information System (INIS)

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

2014-01-01

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

Southern Ocean Control of Glacial AMOC Stability and Dansgaard-Oeschger Interstadial Duration

Science.gov (United States)

Buizert, C.; Schmittner, A.

2016-12-01

Glacial periods exhibit abrupt Dansgaard-Oeschger (DO) climatic oscillations that are thought to be linked to instabilities in the Atlantic meridional overturning circulation (AMOC). Great uncertainty remains regarding the dynamics of the DO cycle, as well as controls on the timing and duration of individual events. Using ice core data we show that the duration of warm (interstadial) periods is strongly correlated with Antarctic climate, and presumably with Southern Ocean (SO) temperature and the position of the Southern Hemisphere (SH) westerlies. We propose a SO control on AMOC stability and interstadial duration via the rate of Antarctic bottom water formation, meridional density/pressure gradients, Agulhas Leakage, and SO adiabatic upwelling. This hypothesis is supported by climate model experiments that demonstrate SO warming leads to a stronger AMOC that is less susceptible to freshwater perturbations. In the AMOC stability diagram, SO warming and strengthening of the SH westerlies both shift the vigorous AMOC branch toward higher freshwater values, thus raising the threshold for AMOC collapse. The proposed mechanism could provide a consistent explanation for several diverse observations, including maximum DO activity during intermediate ice volume/SH temperature, and successively shorter DO durations within each Bond cycle. It may further have implications for the fate of the AMOC under future global warming.

Fatiguing effect of multiple take-offs and landings in regional airline operations.

Science.gov (United States)

Honn, Kimberly A; Satterfield, Brieann C; McCauley, Peter; Caldwell, J Lynn; Van Dongen, Hans P A

2016-01-01

Fatigue is a risk factor for flight performance and safety in commercial aviation. In US commercial aviation, to help to curb fatigue, the maximum duration of flight duty periods is regulated based on the scheduled start time and the number of flight segments to be flown. There is scientific support for regulating maximum duty duration based on scheduled start time; fatigue is well established to be modulated by circadian rhythms. However, it has not been established scientifically whether the number of flight segments, per se, affects fatigue. To address this science gap, we conducted a randomized, counterbalanced, cross-over study with 24 active-duty regional airline pilots. Objective and subjective fatigue was compared between a 9-hour duty day with multiple take-offs and landings versus a duty day of equal duration with a single take-off and landing. To standardize experimental conditions and isolate the fatiguing effect of the number of segments flown, the entire duty schedules were carried out in a high-fidelity, moving-base, full-flight, regional jet flight simulator. Steps were taken to maintain operational realism, including simulated airplane inspections and acceptance checks, use of realistic dispatch releases and airport charts, real-world air traffic control interactions, etc. During each of the two duty days, 10 fatigue test bouts were administered, which included a 10-minute Psychomotor Vigilance Test (PVT) assessment of objective fatigue and Samn-Perelli (SP) and Karolinska Sleepiness Scale (KSS) assessments of subjective sleepiness/fatigue. Results showed a greater build-up of objective and subjective fatigue in the multi-segment duty day than in the single-segment duty day. With duty start time and duration and other variables that could impact fatigue levels held constant, the greater build-up of fatigue in the multi-segment duty day was attributable specifically to the difference in the number of flight segments flown. Compared to findings in

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

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

A global quantification of “normal” sleep schedules using smartphone data

Science.gov (United States)

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

2016-01-01

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

Scheduling lessons learned from the Autonomous Power System

Science.gov (United States)

Ringer, Mark J.

1992-01-01

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

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

40 CFR 141.702 - Sampling schedules.

Science.gov (United States)

2010-07-01

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

Empirical properties of inter-cancellation durations in the Chinese stock market

Directory of Open Access Journals (Sweden)

Gao-Feng eGu

2014-03-01

Full Text Available Order cancellation process plays a crucial role in the dynamics of price formation in order-driven stock markets and is important in the construction and validation of computational finance models. Based on the order flow data of 23 liquid stocks traded on the Shenzhen Stock Exchange in 2003, we investigate the empirical statistical properties of inter-cancellation durations in units of events defined as the waiting times between two consecutive cancellations. The inter-cancellation durations for both buy and sell orders of all the stocks favor a $q$-exponential distribution when the maximum likelihood estimation method is adopted; In contrast, both cancelled buy orders of 9 stocks and cancelled sell orders of 4 stocks prefer Weibull distribution when the nonlinear least-square estimation is used. Applying detrended fluctuation analysis (DFA, centered detrending moving average (CDMA and multifractal detrended fluctuation analysis (MF-DFA methods, we unveil that the inter-cancellation duration time series process long memory and multifractal nature for both buy and sell cancellations of all the stocks. Our findings show that order cancellation processes exhibit long-range correlated bursty behaviors and are thus not Poissonian.

Prevalence of α(+)-Thalassemia in the Scheduled Tribe and Scheduled Caste Populations of Damoh District in Madhya Pradesh, Central India.

Science.gov (United States)

Singh, Mendi P S S; Gupta, Rasik B; Yadav, Rajiv; Sharma, Ravendra K; Shanmugam, Rajasubramaniam

2016-08-01

This study was carried out to ascertain the allelic frequency of α(+)-thalassemia (α(+)-thal) in Scheduled caste and scheduled tribe populations of the Damoh district of Madhya Pradesh, India. Random blood samples of Scheduled tribe (267) and Scheduled caste (168), considering the family as a sampling unit, were analyzed for the presence of the -α(3.7) (rightward) (NG_000006.1: g.34164_37967del3804) and -α(4.2) (leftward) (AF221717) deletions. α(+)-Thal was significantly higher in the Scheduled tribals (77.9%) as compared to the scheduled caste population (9.0%). About 58.0% scheduled tribals carried at least one chromosome with the -α(3.7) deletion and 20.0% scheduled tribals carried the -α(4.2) deletion. Frequency for the -α(3.7) allele was 0.487 in the scheduled tribal populations in comparison to 0.021 in scheduled castes. Allelic frequency for -α(4.2) was 0.103 and 0.024, respectively, in the above communities. No Hardy-Weinberg equilibrium for α-thal gene (p population, indicating the presence of selection pressures in favor of α-thal mutation and adaptation.

Routine environmental monitoring schedule, calendar year 1995

International Nuclear Information System (INIS)

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

1994-12-01

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

Factors predictive of the onset and duration of action of local anesthesia in mandibular third-molar surgery: a prospective study.

Science.gov (United States)

Al-Shayyab, Mohammad H; Baqain, Zaid H

2018-04-01

The aim of this study was to assess the influence of patients' and surgical variables on the onset and duration of action of local anesthesia (LA) in mandibular third-molar (M3) surgery. Patients scheduled for mandibular M3 surgery were considered for inclusion in this prospective cohort study. Patients' and surgical variables were recorded. Two per cent (2%) lidocaine with 1:100,000 epinephrine was used to block the nerves for extraction of mandibular M3. Then, the onset of action and duration of LA were monitored. Univariate analysis and multivariate regression analysis were used to analyze the data. The final cohort included 88 subjects (32 men and 56 women; mean age ± SD = 29.3 ± 12.3 yr). With univariate analysis, age, gender, body mass index (BMI), smoking quantity and duration, operation time, and 'volume of local anesthetic needed' significantly influenced the onset of action and duration of LA. Multivariate regression revealed that age and smoking quantity were the only statistically significant predictors of the onset of action of LA, whereas age, smoking quantity, and 'volume of local anesthetic needed' were the only statistically significant predictors of duration of LA. Further studies are recommended to uncover other predictors of the onset of action and duration of LA. © 2018 Eur J Oral Sci.

Interactive Dynamic Mission Scheduling for ASCA

Science.gov (United States)

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

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

Analytical Method to Estimate Fatigue Life Time Duration in Service for Runner Blade Mechanism of Kaplan Turbines

Directory of Open Access Journals (Sweden)

Ana – Maria Budai

2010-10-01

Full Text Available The paper present an analytical method that can be used to determianted fatigue life time duration in service for runner blade mechanism of Kaplan turbines. The study was made for lever button of runer blade mechanism using two analytical relation to calculate the maximum number of stress cycles whereupon the mechanism work without any damage. To estimate fatigue life time duration will be used a formula obtained from one of most comon cumulative damage methodology taking in consideration the real exploatation conditions of a specified Kapaln turbine.

Discounted Duration Calculus

DEFF Research Database (Denmark)

Ody, Heinrich; Fränzle, Martin; Hansen, Michael Reichhardt

2016-01-01

To formally reason about the temporal quality of systems discounting was introduced to CTL and LTL. However, these logic are discrete and they cannot express duration properties. In this work we introduce discounting for a variant of Duration Calculus. We prove decidability of model checking...... for a useful fragment of discounted Duration Calculus formulas on timed automata under mild assumptions. Further, we provide an extensive example to show the usefulness of the fragment....

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

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

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

Limited Preemptive Scheduling in Real-time Systems

OpenAIRE

Thekkilakattil, Abhilash

2016-01-01

Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when scheduling real-time tasks, mainly in the form of preemption overheads and blocking, that potentially compromise timeliness guarantees. The high preemption overheads in preemptive real-time scheduling may imply high resource utilization, often requiring significant over-provisioning, e.g., pessimistic Worst Case Execution Time (WCET) approximations. Non-preemptive scheduling, on the other hand...

Clinch River Breeder Reactor Plant Project: construction schedule

International Nuclear Information System (INIS)

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

1982-01-01

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

TECHNICAL MAINTENANCE EFFICIENCY OF THE AIRCRAFT MAINTENANCE-FREE ON-BOARD SYSTEM BETWEEN SCHEDULED MAINTENANCES

Directory of Open Access Journals (Sweden)

A. M. Bronnikov

2017-01-01

Full Text Available The avionics concept of the maintenance-free on-board equipment implies the absence of necessity to maintain onboard systems between scheduled maintenance, preserving the required operational and technical characteristics; it should be achieved by automatic diagnosis of the technical condition and the application of active means of ensuring a failsafe design, allowing to change the structure of the system to maintain its functions in case of failure. It is supposed that such equipment will reduce substantially and in the limit eliminate traditional maintenance of aircraft between scheduled maintenance, ensuring maximum readiness for use, along with improving safety. The paper proposes a methodology for evaluating the efficiency of maintenance-free between scheduled maintenance aircraft system with homogeneous redundancy. The excessive redundant elements allow the system to accumulate failures which are repaired during the routine maintenance. If the number of failures of any reserve is approaching a critical value, the recovery of the on-board system (elimination of all failures is carried out between scheduled maintenance by conducting rescue and recovery operations. It is believed that service work leads to the elimination of all failures and completely updates the on-board system. The process of system operational status changes is described with the discrete-continuous model in the flight time. The average losses in the sorties and the average cost of operation are used as integrated efficiency indicators of system operation. For example, the evaluation of the operation efficiency of formalized on-board system with homogeneous redundancy demonstrates the efficiency of the proposed methodology and the possibility of its use while analyzing the efficiency of the maintenance-free operation equipment between scheduled periods. As well as a comparative analysis of maintenance-free operation efficiency of the on-board system with excessive

Quality-aware media scheduling on MPSoC platforms

DEFF Research Database (Denmark)

Gangadharan, Deepak; Chakraborty, Samarjit; Zimmermann, Roger

2013-01-01

and personal computers by providing maximum quality of service to the multiple streams, it is a difficult task in devices with resource constraints. In order to efficiently utilize the resources, it is essential to derive the necessary processor cycles for multiple video streams such that they are displayed...... be scheduled such that a prespecified quality constraint is satisfied with the available service. We present this framework in the context of a PiP application, but it is applicable in general for multiple media streams. The results obtained using the formal framework were further verified using experiments......Applications that stream multiple video/audio or video+audio clips are being implemented in embedded devices. A Picture-in-Picture (PiP) application is one such application scenario, where two videos are played simultaneously. Although the PiP application is very efficiently handled in televisions...

Utilization Bound of Non-preemptive Fixed Priority Schedulers

Science.gov (United States)

Park, Moonju; Chae, Jinseok

It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

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

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

2015-01-01

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

Rate and duration of seed filling and yield of soybean affected by water and radiation deficits

Directory of Open Access Journals (Sweden)

Kazem GHASSEMI-GOLEZANI

2015-11-01

Full Text Available Seed filling and yield of soybean under water and radiation deficits were investigated during 2011 and 2012. Treatments were irrigations (I1, I2, I3 and I4 for irrigation after 60, 90, 120 and 150 mm evaporation from class A pan, respectively in main plots and light interceptions (L1: 100 %, L2: 65 % and L3: 25 % sunlight in sub-plots. Seeds per plant under I1 and I2 decreased, but under I3 and I4 increasedas a result of radiation deficit. Maximum seed weight and seed filling duration of plants under 25 % light interception (L3 were higher than those under full sunlight (L1 and 65 % light interception (L2. In contrast, plants under full sunlight had the highest seed filling rate, particularly under water stress. Seed filling duration under severe light deficit (L3 was about 9 days longer than that under full sunlight (L1, leading to 15.8 % enhancement in maximum seed weight. Decreasing seed yield of soybean under well watering and mild water stress and improving it under moderate and severe water deficit due to low solar radiation are directly related with changes in seed filling duration and consequently in seed weight and number of seeds per plant under these conditions.

Rolling scheduling of electric power system with wind power based on improved NNIA algorithm

Science.gov (United States)

Xu, Q. S.; Luo, C. J.; Yang, D. J.; Fan, Y. H.; Sang, Z. X.; Lei, H.

2017-11-01

This paper puts forth a rolling modification strategy for day-ahead scheduling of electric power system with wind power, which takes the operation cost increment of unit and curtailed wind power of power grid as double modification functions. Additionally, an improved Nondominated Neighbor Immune Algorithm (NNIA) is proposed for solution. The proposed rolling scheduling model has further improved the operation cost of system in the intra-day generation process, enhanced the system’s accommodation capacity of wind power, and modified the key transmission section power flow in a rolling manner to satisfy the security constraint of power grid. The improved NNIA algorithm has defined an antibody preference relation model based on equal incremental rate, regulation deviation constraints and maximum & minimum technical outputs of units. The model can noticeably guide the direction of antibody evolution, and significantly speed up the process of algorithm convergence to final solution, and enhance the local search capability.

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.

[A study on vowel duration and word length of adductor spasmodic dysphonia].

Science.gov (United States)

Chen, Zhipeng; Ge, Pingjiang

2016-03-01

To understand the vowel duration and statement reading of the adductor spasmodic dysphonia (ADSD) patients compared with their normal controls, and provide ideas for clinical diagnosis and treatment. Twenty-nine ADSD patients were included in the research, with 31 normal controls. All subjects filled in form voice handicap index (VHI) by themselves. Maximum phonetic time (MPT) and maximum loudness phonetic time(MLPT) were tested on /a/ sound for all patients. Also, all the patients were required to read aloud a standard mandarin assay named , duration were measured with Praat5. 0 software after sounds were collected. A one-way t-test was performed to compare spasmodic group with control group on VHI, MPT, MLPT and duration for reading standard sentences. Pearson/Spearman correlation was tested. Result: The VHI of the 29 ADSD patients is 89±12, and their normal controls 15±16, indicating that the VHI in ADSD group is significantly higher than in the control group(P<0. 01). The MPT of the ADSD group is(16. 9±9. 8 s), and the control group is (25. 3±10.0)s, indicating that MPT in the ADSD group is significantly shorter than the control group(P<0. 01). The MLPT of the ADSD group is (15.7±7. 6)s, and the control group is (26. 5±11. 4)s, indicating that MLPT in the ADSD group is significantly shorter than the control group (P<0. 01). The duration of standard sentence reading of the ADSD group is (55.0±14. 2)s, and the control group is (37. 8±4. 8)s, indicating that the duration of standard sentence reading in the ADSD group is significantly longer than the control group (P<0. 01). Correlation analysis showed that MPT and MLPT are related within the ADSD group(r=0. 697,P< 0.01), other indexes being tested have no significant correlations. The voice disorder condition of the ADSD patients is significantly worse than normal people. Their pronunciations on continuous vowels are not lasting compared with normal people. In the meantime, their ability to read sentences

Evaluating Annual Maximum and Partial Duration Series for Estimating Frequency of Small Magnitude Floods

Directory of Open Access Journals (Sweden)

Fazlul Karim

2017-06-01

Full Text Available Understanding the nature of frequent floods is important for characterising channel morphology, riparian and aquatic habitat, and informing river restoration efforts. This paper presents results from an analysis on frequency estimates of low magnitude floods using the annual maximum and partial series data compared to actual flood series. Five frequency distribution models were fitted to data from 24 gauging stations in the Great Barrier Reef (GBR lagoon catchments in north-eastern Australia. Based on the goodness of fit test, Generalised Extreme Value, Generalised Pareto and Log Pearson Type 3 models were used to estimate flood frequencies across the study region. Results suggest frequency estimates based on a partial series are better, compared to an annual series, for small to medium floods, while both methods produce similar results for large floods. Although both methods converge at a higher recurrence interval, the convergence recurrence interval varies between catchments. Results also suggest frequency estimates vary slightly between two or more partial series, depending on flood threshold, and the differences are large for the catchments that experience less frequent floods. While a partial series produces better frequency estimates, it can underestimate or overestimate the frequency if the flood threshold differs largely compared to bankfull discharge. These results have significant implications in calculating the dependency of floodplain ecosystems on the frequency of flooding and their subsequent management.

Cure Schedule for Stycast 2651/Catalyst 9.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

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

Reducing electricity demand peaks by scheduling home appliances usage

Energy Technology Data Exchange (ETDEWEB)

Rossello-Busquet, A.; Kardaras, G.; Baek Iversen, V.; Soler, J.; Dittmann, L.

2011-05-15

Nowadays there is a tendency to consume electricity during the same period of the day leading to demand peaks. Regular energy consumption habits lead to demand peaks at specific temporal intervals, because users consume power at the same time. In order to avoid demand peaks, users' appliances should consume electricity in a more temporarily distributed way. A new methodology to schedule the usage of home appliances is proposed and analyzed in this paper. The main concept behind this approach is the aggregation of home appliances into priority classes and the definition of a maximum power consumption limit, which is not allowed to be exceeded during peak hours. The scenario simulated describes a modern household, where the electrical devices are classified in low and high priority groups. The high priority devices are always granted power in order to operate without temporal restrictions. On the contrary, the low priority devices have to pause their operation, when the algorithm dictates it, and resume it in the future. This can become beneficial for both energy companies and users. The electricity suppliers companies will be capable of regulating power generation during demand peaks periods. Moreover, users can be granted lower electricity bill rates for accepting delaying the operation of some of their appliances. In order to analyze this scenario, teletraffic engineering theory, which is used in evaluating the performance of telecommunication networks, is used. A reversible fair scheduling (RFS) algorithm, which was originally developed for telecommunication networks, is applied. The purpose is to analyze how a power consumption limit and priorities for home appliances will affect the demand peak and the users' everyday life. Verification of the effectiveness of the RFS algorithm is done by means of simulation and by using real data for power consumption and operation hours. The defined maximum power limit of 750 and 1000 Watt was not exceeded during

Job shop scheduling problem with late work criterion

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

Dose assessment around TR-2 reactor due to maximum credible accident

International Nuclear Information System (INIS)

Turgut, M. H.; Adalioglu, U.; Aytekin, A.

2001-01-01

The revision of safety analysis report of TR-2 research reactor had been initiated in 1995. The whole accident analysis and accepted scenario for maximum credible accident has been revised according to the new safety concepts and the impact to be given to the environment due to this scenario has been assessed. This paper comprises all results of these calculations. The accepted maximum credible accident scenario is the partial blockage of the whole reactor core which resulted in the release of 25% of the core inventory. The DOSER code which uses very conservative modelling of atmospheric distributions were modified for the assessment calculations. Pasquill conditions based on the local weather observations, topography, and building affects were considered. The thyroid and whole body doses for 16 sectors and up to 10 km of distance around CNAEM were obtained. Release models were puff and a prolonged one of two hours of duration. Release fractions for the active isotopes were chosen from literature which were realistic

Physical method to assess a probable maximum precipitation, using CRCM datas

International Nuclear Information System (INIS)

Beauchamp, J.

2009-01-01

'Full text:' For Nordic hydropower facilities, spillways are designed with a peak discharge based on extreme conditions. This peak discharge is generally derived using the concept of a probable maximum flood (PMF), which results from the combined effect of abundant downpours (probable maximum precipitation - PMP) and rapid snowmelt. On a gauged basin, the weather data record allows for the computation of the PMF. However, uncertainty in the future climate raises questions as to the accuracy of current PMP estimates for existing and future hydropower facilities. This project looks at the potential use of the Canadian Regional Climate Model (CRCM) data to compute the PMF in ungauged basins and to assess potential changes to the PMF in a changing climate. Several steps will be needed to accomplish this task. This paper presents the first step that aims at applying/adapting to CRCM data the in situ moisture maximization technique developed by the World Meteorological Organization, in order to compute the PMP at the watershed scale. The CRCM provides output data on a 45km grid at a six hour time step. All of the needed atmospheric data is available at sixteen different pressure levels. The methodology consists in first identifying extreme precipitation events under current climate conditions. Then, a maximum persisting twelve hours dew point is determined at each grid point and pressure level for the storm duration. Afterwards, the maximization ratio is approximated by merging the effective temperature with dew point and relative humidity values. The variables and maximization ratio are four-dimensional (x, y, z, t) values. Consequently, two different approaches are explored: a partial ratio at each step and a global ratio for the storm duration. For every identified extreme precipitation event, a maximized hyetograph is computed from the application of this ratio, either partial or global, on CRCM precipitation rates. Ultimately, the PMP is the depth of the

Physical method to assess a probable maximum precipitation, using CRCM datas

Energy Technology Data Exchange (ETDEWEB)

Beauchamp, J. [Univ. de Quebec, Ecole de technologie superior, Quebec (Canada)

2009-07-01

'Full text:' For Nordic hydropower facilities, spillways are designed with a peak discharge based on extreme conditions. This peak discharge is generally derived using the concept of a probable maximum flood (PMF), which results from the combined effect of abundant downpours (probable maximum precipitation - PMP) and rapid snowmelt. On a gauged basin, the weather data record allows for the computation of the PMF. However, uncertainty in the future climate raises questions as to the accuracy of current PMP estimates for existing and future hydropower facilities. This project looks at the potential use of the Canadian Regional Climate Model (CRCM) data to compute the PMF in ungauged basins and to assess potential changes to the PMF in a changing climate. Several steps will be needed to accomplish this task. This paper presents the first step that aims at applying/adapting to CRCM data the in situ moisture maximization technique developed by the World Meteorological Organization, in order to compute the PMP at the watershed scale. The CRCM provides output data on a 45km grid at a six hour time step. All of the needed atmospheric data is available at sixteen different pressure levels. The methodology consists in first identifying extreme precipitation events under current climate conditions. Then, a maximum persisting twelve hours dew point is determined at each grid point and pressure level for the storm duration. Afterwards, the maximization ratio is approximated by merging the effective temperature with dew point and relative humidity values. The variables and maximization ratio are four-dimensional (x, y, z, t) values. Consequently, two different approaches are explored: a partial ratio at each step and a global ratio for the storm duration. For every identified extreme precipitation event, a maximized hyetograph is computed from the application of this ratio, either partial or global, on CRCM precipitation rates. Ultimately, the PMP is the depth of the

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.

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

A novel minimum cost maximum power algorithm for future smart home energy management

Directory of Open Access Journals (Sweden)

A. Singaravelan

2017-11-01

Full Text Available With the latest development of smart grid technology, the energy management system can be efficiently implemented at consumer premises. In this paper, an energy management system with wireless communication and smart meter are designed for scheduling the electric home appliances efficiently with an aim of reducing the cost and peak demand. For an efficient scheduling scheme, the appliances are classified into two types: uninterruptible and interruptible appliances. The problem formulation was constructed based on the practical constraints that make the proposed algorithm cope up with the real-time situation. The formulated problem was identified as Mixed Integer Linear Programming (MILP problem, so this problem was solved by a step-wise approach. This paper proposes a novel Minimum Cost Maximum Power (MCMP algorithm to solve the formulated problem. The proposed algorithm was simulated with input data available in the existing method. For validating the proposed MCMP algorithm, results were compared with the existing method. The compared results prove that the proposed algorithm efficiently reduces the consumer electricity consumption cost and peak demand to optimum level with 100% task completion without sacrificing the consumer comfort.

Sport Tournament Automated Scheduling System

Directory of Open Access Journals (Sweden)

Raof R. A. A

2018-01-01

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

Duration of the action of rocuronium in patients with BMI of less than 25: An observational study.

Science.gov (United States)

Takahata, Osamu; Takahoko, Ken-Ichi; Sasakawa, Tomoki; Inagaki, Yasuyoshi; Takahoko, Hiroyuki; Kunisawa, Takayuki

2018-05-02

The duration of rocuronium in patients with BMI more than 30 kg m is prolonged. Whether the reverse is true when BMI is less than 18.5 kg m is unclear. The objective of this study was to investigate whether a BMI less than 25 kg m affects the duration of rocuronium in doses adjusted for actual body weight. A prospective, observational, single-centre study. The operating room of a teaching hospital from 1 June 2008 to 30 June 2015. Thirty patients with American Society of Anesthesiologists physical status I or II who were scheduled to undergo elective surgery (BMI rocuronium (D1) was defined as the time from injection of rocuronium 0.6 mg kg to return of first twitch height to 25% of the control. Duration of additional doses (D2) was the time from a supplement of 0.15 mg kg rocuronium to return of first twitch height to 25% of the control. The relationship between D1 or D2 and BMI was examined using linear regression analysis. Linear regression analysis revealed a significant correlation between duration of initial dose and BMI (R = 0.246; P = 0.00531). A significant correlation between the duration of the additional dose and BMI was also found (R = 0.316; P = 0.00122). The lower the BMI, the shorter the duration of rocuronium at initial and additional doses determined by the actual body weight in adult patients with a BMI less than 25 kg m. www.umin.ac.jp/ctr/index/htm with registry number UMIN 00009337 and UMIN 000015407.

Common Sleep, Psychiatric, and Somatic Problems According to Work Schedule: an Internet Survey in an Eastern European Country.

Science.gov (United States)

Voinescu, Bogdan I

2018-03-19

A wide range of health problems was investigated, aiming to identify the presence and severity of a set of self-reported and common sleep, psychiatric, and somatic health problems among working professionals in four different shift schedules (morning, evening, rotating, and day) in several cities in Romania. A heterogeneous sample of 488 workers of different professions completed online a battery of tests, namely the Basic Nordic Sleep Questionnaire, the Parasomnia Questionnaire, the Epworth Sleepiness Scale, and the Patient Health Questionnaire, designed to identity symptoms of insomnia, sleepiness, snoring, parasomnia, as well as of depression, anxiety, eating, somatoform, and alcohol use disorders, respectively. The timing and the duration of the sleep, along with the presence of high blood pressure and type 2 diabetes mellitus were also inquired. The prevalence of the different health problems in relation to the type of shift schedule was evaluated with the Pearson Chi-square test. ANOVA was used to calculate the significance of the difference between the means, while associations with different health problems were estimated by binary logistic regression. The most common mental health problems were depression (26%), insomnia (20%), alcohol misuse (18%), and anxiety (17%). No significant differences based on the type of shift in terms of health problems were found, except for high blood pressure and symptoms of panic disorder that were more frequently reported by the workers in early morning shifts. Together with the workers in rotating shifts, they also reported increased sleepiness, poorer sleep quality, and shorter sleep duration. In contrast, the workers in evening shifts reported less severe health problems and longer sleep duration. Working in early morning shifts was found to be associated with poorer health outcomes, while working in rotating and early morning shifts with more severe sleep-related problems.

Duration judgements over multiple elements

Directory of Open Access Journals (Sweden)

Inci eAyhan

2012-11-01

Full Text Available We investigated the limits of the number of events observers can simultaneously time. For single targets occurring in one of eight positions sensitivity to duration was improved for spatially pre-cued items as compared to post-cued items indicating that exogenous driven attention can improve duration discrimination. Sensitivity to duration for pre-cued items was also marginally better for single items as compared to eight items indicating that even after the allocation of focal attention, distracter items can interfere with the encoding of duration. For an eight item array discrimination was worse for post-cued locations as compared to pre-cued locations indicating both that attention can improve duration discrimination performance and that it was not possible to access a perfect memory trace of the duration of eight elements. The interference from the distracters in the pre-cued eight item array may reflect some mandatory averaging of target and distracter events. To further explore duration averaging we asked subjects to explicitly compare average durations of multiple item arrays against a single item standard duration. Duration discrimination thresholds were significantly lower for single elements as compared to multiple elements, showing that averaging, either automatically or intentionally, impairs duration discrimination. There was no set size effect. Performance was the same for averages of two and eight items, but performance with even an average of two items was worse than for one item. This was also true for sequential presentation indicating poor performance was not due to limits on the division of attention across items. Rather performance appears to be limited by an inability to remember or aggregate duration information from two or more items. Although it is possible to manipulate perceived duration locally, there appears to be no perceptual mechanisms for aggregating local durations across space.

Automatic updating of times remaining in surgical cases using bayesian analysis of historical case duration data and "instant messaging" updates from anesthesia providers.

Science.gov (United States)

Dexter, Franklin; Epstein, Richard H; Lee, John D; Ledolter, Johannes

2009-03-01

Operating room (OR) whiteboards (status displays) communicate times remaining for ongoing cases to perioperative stakeholders (e.g., postanesthesia care unit, anesthesiologists, holding area, and control desks). Usually, scheduled end times are shown for each OR. However, these displays are inaccurate for predicting the time that remains in a case. Once a case scheduled for 2 h has been on-going for 1.5 h, the median time remaining is not 0.5 h but longer, and the amount longer differs among procedures. We derived the conditional Bayesian lower prediction bound of a case's duration, conditional on the minutes of elapsed OR time. Our derivations make use of the posterior predictive distribution of OR times following an exponential of a scaled Student t distribution that depends on the scheduled OR time and several parameters calculated from historical case duration data. The statistical method was implemented using Structured Query Language (SQL) running on the anesthesia information management system (AIMS) database server. In addition, AIMS workstations were sent instant messages displaying a pop-up dialog box asking for anesthesia providers' estimates for remaining times. The dialogs caused negotiated interruptions (i.e., the anesthesia provider could reply immediately, keep the dialog displayed, or defer response). There were no announcements, education, or efforts to promote buy-in. After a case had been in the OR longer than scheduled, the median remaining OR time for the case changes little over time (e.g., 35 min left at 2:30 pm and also at 3:00 pm while the case was still on-going). However, the remaining time differs substantially among surgeons and scheduled procedure(s) (16 min longer [10th percentile], 35 min [50th], and 86 min [90th]). We therefore implemented an automatic method to estimate the times remaining in cases. The system was operational for >119 of each day's 120 5-min intervals. When instant message dialogs appearing on AIMS workstations

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.

Solving Multi-Resource Constrained Project Scheduling Problem using Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Hsiang-Hsi Huang

2015-01-01

Full Text Available This paper applied Ant Colony Optimization (ACO to develop a resource constraints scheduling model to achieve the resource allocation optimization and the shortest completion time of a project under resource constraints and the activities precedence requirement for projects. Resource leveling is also discussed and has to be achieved under the resource allocation optimization in this research. Testing cases and examples adopted from the international test bank were studied for verifying the effectiveness of the proposed model. The results showed that the solutions of different cases all have a better performance within a reasonable time. These can be obtained through ACO algorithm under the same constrained conditions. A program was written for the proposed model that is able to automatically produce the project resource requirement figure after the project duration is solved.

JIT single machine scheduling problem with periodic preventive maintenance

Science.gov (United States)

Shahriari, Mohammadreza; Shoja, Naghi; Zade, Amir Ebrahimi; Barak, Sasan; Sharifi, Mani

2016-09-01

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

Issue of CILRT duration

International Nuclear Information System (INIS)

Dougan, J.R.

1983-01-01

Containment Integrated Leakage Rate Tests (CILRTs) represent large investments of time and money on the part of the utilities operating nuclear power plants. In the early days of containment testing, leak rate tests were conducted from a minimum of 24 hours to a maximum of several days. The minimum time period of 24 hours was adopted and continues to form the fundamental approach of the Nuclear Regulatory Commission (NRC). However, there does not appear to be technical justification for the minimum test period of 24 hours. In fact, several industry sources have shown that successful CILRTs can be conducted in much less time. The NRC has recognized this fact and has approved CILRTs of less than 24 hours. But some utilities still feel constrained to use the 24 hour test due to their Technical Specifications. And although criteria for determining the duration of a CILRT have been published, no specific criteria have been agreed upon as final. Therefore, it is the purpose of this paper to highlight several of the proposed criteria and the concerns that might arise following the implementation of such criteria

Vehicle and driver scheduling for public transit.

Science.gov (United States)

2009-08-01

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

Recognizing famous voices: influence of stimulus duration and different types of retrieval cues.

Science.gov (United States)

Schweinberger, S R; Herholz, A; Sommer, W

1997-04-01

The current investigation measured the effects of increasing stimulus duration on listeners' ability to recognize famous voices. In addition, the investigation studied the influence of different types of cues on the naming of voices that could not be named before. Participants were presented with samples of famous and unfamiliar voices and were asked to decide whether or not the samples were spoken by a famous person. The duration of each sample increased in seven steps from 0.25 s up to a maximum of 2 s. Voice recognition improvements with stimulus duration were with a growth function. Gains were most rapid within the first second and less pronounced thereafter. When participants were unable to name a famous voice, they were cued with either a second voice sample, the occupation, or the initials of the celebrity. Initials were most effective in eliciting the name only when semantic information about the speaker had been accessed prior to cue presentation. Paralleling previous research on face naming, this may indicate that voice naming is contingent on previous activation of person-specific semantic information.

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.

Brief-stimulus presentations on multiform tandem schedules

OpenAIRE

Reed, Phil

1994-01-01

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

Mathematical programming and financial objectives for scheduling projects

CERN Document Server

Kimms, Alf

2001-01-01

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

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

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.

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

2017-08-01

Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

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

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

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

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.

Science.gov (United States)

Xiang, Wei; Yin, Jiao; Lim, Gino

2015-02-01

individual maximum overtime (OT); and (4) an 42% reduction in the total OT of nurses. Comparison results with the real 10-workday hospital scheduling further show the advantage of the ACO in several measurements. Instead of assigning all surgeries by a surgeon to only one OR and the same nurses by traditional manual approach in hospital, ACO realizes a more balanced surgery arrangement by assigning the surgeries to different ORs and nurses. It eventually leads to shortening the end time within the confidential interval of [7.4%, 24.6%] with 95% confidence level. The ACO approach proposed in this paper efficiently solves the surgery scheduling problem with daily nurse roster while providing a shortened end time and relatively balanced resource allocations. It also supports the advantage of integrating the surgery scheduling with the nurse scheduling and the efficiency of systematic optimization considering a complete three-stage surgery flow and resources involved. Copyright © 2014 Elsevier B.V. All rights reserved.

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.

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

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

2018-02-01

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

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

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

2018-03-01

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

Impact of modules on the ACR construction schedule

International Nuclear Information System (INIS)

Choy, Ed; Elgohary, Medhat; Fairclough, Neville; Yu, Stephen; Murayama, Kouichi; Miura, Jun; Kawahata, Junichi

2003-01-01

The ACR (Advanced CANDU Reactor), developed by Atomic Energy of Canada Ltd. (AECL), is designed with constructability considerations as a major requirement during all project phases from the concept design stage to the detail design stage. For ACR-700, a project schedule of 48 months has been developed for the nth replicated unit with a 36 month construction period duration from First Concrete to Fuel Load. AECL, recognizing the immense benefit of collective experience, is partnering with Hitachi Ltd in the development of the ACR power plant design. AECL has gained valuable experience in implementing new construction methods at the Qinshan (Phase III) twin unit CANDU 6 plant in China, and Hitachi likewise has enjoyed success in modular construction of ABWRs in Japan. Utilizing these experiences, AECL is developing the ACR nuclear steam plant (NSP) and Hitachi is developing the Turbine Building. An overall construction strategy, which builds on the success of these construction methods from the nuclear power plant developments in China and Japan, has been developed for the ACR. The overall construction strategy comprises the 'Open Top' construction technique using a Very Heavy Lift crane, parallel construction activities, with extensive modularization and prefabrication. Modules and prefabrications are major features of the ACR design, resulting in an excess of 80% of Reactor Building internal work being completed as modules or as very streamlined traditional construction. This paper reviews the ACR construction strategy and provides examples of modules and how they impact on the ACR construction schedule. In conclusion, the ACR-700 is designed using the latest, proven construction methods to achieve a 36 month construction period for the nth replicated unit. (author)

EXTREME MAXIMUM AND MINIMUM AIR TEMPERATURE IN MEDİTERRANEAN COASTS IN TURKEY

Directory of Open Access Journals (Sweden)

Barbaros Gönençgil

2016-01-01

Full Text Available In this study, we determined extreme maximum and minimum temperatures in both summer and winter seasons at the stations in the Mediterranean coastal areas of Turkey.In the study, the data of 24 meteorological stations for the daily maximum and minimumtemperatures of the period from 1970–2010 were used. From this database, a set of four extreme temperature indices applied warm (TX90 and cold (TN10 days and warm spells (WSDI and cold spell duration (CSDI. The threshold values were calculated for each station to determine the temperatures that were above and below the seasonal norms in winter and summer. The TX90 index displays a positive statistically significant trend, while TN10 display negative nonsignificant trend. The occurrence of warm spells shows statistically significant increasing trend while the cold spells shows significantly decreasing trend over the Mediterranean coastline in Turkey.

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, we address design problems that are characteristic to such hierarchically scheduled systems: assignment...... of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system...

Flow shop scheduling with heterogeneous workers

OpenAIRE

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

2014-01-01

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

21 CFR 113.83 - Establishing scheduled processes.

Science.gov (United States)

2010-04-01

... commercial production runs should be determined on the basis of recognized scientific methods to be of a size... CONTAINERS Production and Process Controls § 113.83 Establishing scheduled processes. Scheduled processes for... production shall be adequately provided for in establishing the scheduled process. Critical factors, e.g...

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-06

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

An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems

Directory of Open Access Journals (Sweden)

Chandramouli Anandaraman

2011-10-01

Full Text Available Job Shop Scheduling Problem (JSSP and Flow Shop Scheduling Problem (FSSP are strong NP-complete combinatorial optimization problems among class of typical production scheduling problems. An improved Sheep Flock Heredity Algorithm (ISFHA is proposed in this paper to find a schedule of operations that can minimize makespan. In ISFHA, the pairwise mutation operation is replaced by a single point mutation process with a probabilistic property which guarantees the feasibility of the solutions in the local search domain. A Robust-Replace (R-R heuristic is introduced in place of chromosomal crossover to enhance the global search and to improve the convergence. The R-R heuristic is found to enhance the exploring potential of the algorithm and enrich the diversity of neighborhoods. Experimental results reveal the effectiveness of the proposed algorithm, whose optimization performance is markedly superior to that of genetic algorithms and is comparable to the best results reported in the literature.

Influence of Working Environment on Fatigue Life Time Duration for Runner Blades of Kaplan Turbines

Directory of Open Access Journals (Sweden)

Ana-Maria Budai

2010-10-01

Full Text Available The paper present an analytical analyzes refer to influence of working environment on life time duration in service of runner blades of Kaplan turbines. The study are made using only analytical method, the entry dates being obtained from measurements made in situ for a Kaplan turbine. To calculate the maximum number of stress cycles whereupon the runner blades work without any damage it was used an analytical relation known in specialized literatures under the name of Morrow’s relation. To estimate fatigue life time duration will be used a formula obtained from one of most common cumulative damage methodology taking in consideration the real exploitation conditions of a specified Kaplan turbine.

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

Minimizing tardiness for job shop scheduling under uncertainties

OpenAIRE

Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

2016-01-01

International audience; —Many disturbances can occur during the execution of a manufacturing scheduling process. To cope with this drawback , flexible solutions are proposed based on the offline and the online phase of the schedule. Groups of permutable operations is one of the most studied flexible scheduling methods bringing flexibility as well as quality to a schedule. The online phase of this method is based on a human-machine system allowing to choose in real-time one schedule from a set...

A QoS-Based Dynamic Queue Length Scheduling Algorithm in Multiantenna Heterogeneous Systems

Directory of Open Access Journals (Sweden)

Verikoukis Christos

2010-01-01

Full Text Available The use of real-time delay-sensitive applications in wireless systems has significantly grown during the last years. Therefore the designers of wireless systems have faced a challenging issue to guarantee the required Quality of Service (QoS. On the other hand, the recent advances and the extensive use of multiple antennas have already been included in several commercial standards, where the multibeam opportunistic transmission beamforming strategies have been proposed to improve the performance of the wireless systems. A cross-layer-based dynamically tuned queue length scheduler is presented in this paper, for the Downlink of multiuser and multiantenna WLAN systems with heterogeneous traffic requirements. To align with modern wireless systems transmission strategies, an opportunistic scheduling algorithm is employed, while a priority to the different traffic classes is applied. A tradeoff between the maximization of the throughput of the system and the guarantee of the maximum allowed delay is obtained. Therefore, the length of the queue is dynamically adjusted to select the appropriate conditions based on the operator requirements.

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

Brown, J.T.; McDonald, J.K.

1992-05-01

The Integrated Test Schedule incorporates the various schedules the Buried Waste Integrated Demonstration (BWID) supports into one document. This document contains the Federal Facilities Agreement and Consent Order schedules for the Idaho National Engineering Laboratory, Hanford Reservation, Oak Ridge Reservation, and Fernald Environmental Materials Center. Included in the Integrated Test Schedule is the Buried Waste Integrated Demonstration ''windows of opportunity'' schedule. The ''windows of opportunity'' schedule shows periods of time in which Buried Waste Integrated Demonstration Program-sponsored technology demonstrations could support key decisions in the Federal Facilities Agreement and Consent Order. Schedules for the Buried Waste Integrated Demonstration-sponsored technology task plans are categorized by technology area and divided by current fiscal year and out-year. Total estimated costs for Buried Waste Integrated Demonstration-sponsored Technology Task Plans for FY-92 through FY-97 are $74.756M

Theoretical Evaluation of the Maximum Work of Free-Piston Engine Generators

Science.gov (United States)

Kojima, Shinji

2017-01-01

Utilizing the adjoint equations that originate from the calculus of variations, we have calculated the maximum thermal efficiency that is theoretically attainable by free-piston engine generators considering the work loss due to friction and Joule heat. Based on the adjoint equations with seven dimensionless parameters, the trajectory of the piston, the histories of the electric current, the work done, and the two kinds of losses have been derived in analytic forms. Using these we have conducted parametric studies for the optimized Otto and Brayton cycles. The smallness of the pressure ratio of the Brayton cycle makes the net work done negative even when the duration of heat addition is optimized to give the maximum amount of heat addition. For the Otto cycle, the net work done is positive, and both types of losses relative to the gross work done become smaller with the larger compression ratio. Another remarkable feature of the optimized Brayton cycle is that the piston trajectory of the heat addition/disposal process is expressed by the same equation as that of an adiabatic process. The maximum thermal efficiency of any combination of isochoric and isobaric heat addition/disposal processes, such as the Sabathe cycle, may be deduced by applying the methods described here.

Pulsed dose rate and fractionated high dose rate brachytherapy: choice of brachytherapy schedules to replace low dose rate treatments

International Nuclear Information System (INIS)

Visser, Andries G.; Aardweg, Gerard J.M.J. van den; Levendag, Peter C.

1996-01-01

Purpose: Pulsed dose rate (PDR) brachytherapy is a new type of afterloading brachytherapy (BT) in which a continuous low dose rate (LDR) treatment is simulated by a series of 'pulses,' i.e., fractions of short duration (less than 0.5 h) with intervals between fractions of 1 to a few hours. At the Dr. Daniel den Hoed Cancer Center, the term 'PDR brachytherapy' is used for treatment schedules with a large number of fractions (at least four per day), while the term 'fractionated high dose rate (HDR) brachytherapy' is used for treatment schedules with just one or two brachytherapy fractions per day. Both treatments can be applied as alternatives for LDR BT. This article deals with the choice between PDR and fractionated HDR schedules and proposes possible fractionation schedules. Methods and Materials: To calculate HDR and PDR fractionation schedules with the intention of being equivalent to LDR BT, the linear-quadratic (LQ) model has been used in an incomplete repair formulation as given by Brenner and Hall, and by Thames. In contrast to earlier applications of this model, both the total physical dose and the overall time were not kept identical for LDR and HDR/PDR schedules. A range of possible PDR treatment schedules is presented, both for booster applications (in combination with external radiotherapy (ERT) and for BT applications as a single treatment. Because the knowledge of both α/β values and the half time for repair of sublethal damage (T (1(2)) ), which are required for these calculations, is quite limited, calculations regarding the equivalence of LDR and PDR treatments have been performed for a wide range of values of α/β and T (1(2)) . The results are presented graphically as PDR/LDR dose ratios and as ratios of the PDR/LDR tumor control probabilities. Results: If the condition that total physical dose and overall time of a PDR treatment must be exactly identical to the values for the corresponding LDR treatment regimen is not applied, there appears

Modelling the dispersion of radionuclides following short duration releases to rivers

International Nuclear Information System (INIS)

Smith, J.T.; Bowes, M.; Denison, F.H.

2003-01-01

This project develops a model for assessing short duration liquid discharges of radionuclides to rivers. The assessment of doses arising from discharges to rivers is normally carried out by considering annual average discharge rates. Actual authorised discharges, however, may occur unevenly during the year or relatively high short-term discharges could occur in the unlikely event of an incident. Short term radionuclide releases could potentially result in temporary increases in radionuclide activity concentrations in water and fish which are greater than those resulting from a continuous discharge. The purpose of this project is to develop a model to assess short term releases from these sites, and where possible develop generic methods of assessing short term releases. An advection-dispersion model was developed to predict the concentrations of radionuclides in the river environment, ie in river water, river bed sediment and in predatory fish. Uptake of radionuclides to fish was modelled by estimating rates of uptake of radionuclides via the aquatic food chain or across the gill, as appropriate. The model was used to predict the concentrations of the radionuclides in the river Thames and its tributaries as a result of short duration discharges into stretches of the Thames and River Colne. Model output is given as a series of graphs of activity concentration and time integrated activity concentration resulting from a 1 MBq discharge for the following release durations: 5 minutes, 1 h, 3 h, 12 h and 24 h. The five locations for which predictions are given were 100m, 300m, 1000m, 3000m and 10000m downstream. The river volumetric flow rate was shown to be the most important environmental variable determining activity concentrations in water, fish and sediments following a release. In general, the maximum and integrated activity concentrations in water and fish will be in inverse proportion to the river volumetric flow rate, for a given amount and duration of release

14 CFR 399.81 - Unrealistic or deceptive scheduling.

Science.gov (United States)

2010-01-01

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

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow...... protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack...

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Pleasure craft scheduling. 401.58... OF TRANSPORTATION SEAWAY REGULATIONS AND RULES Regulations Seaway Navigation § 401.58 Pleasure craft scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in...

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)

Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert

1990-01-01

Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

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

2013-01-01

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

Enhancing the Meaningfulness of Work for Astronauts on Long Duration Space Exploration Missions.

Science.gov (United States)

Britt, Thomas W; Sytine, Anton; Brady, Ashley; Wilkes, Russ; Pittman, Rebecca; Jennings, Kristen; Goguen, Kandice

2017-08-01

Numerous authors have identified the stressors likely to be encountered on long duration space exploration missions (e.g., to Mars), including the possibility of significant crises, separation from family, boredom/monotony, and interpersonal conflict. Although many authors have noted that meaningful work may be beneficial for astronauts on these missions, none have detailed the sources of meaningful work for astronauts and how these sources may differ between astronauts. The present article identifies how engagement in meaningful work during long duration missions may mitigate the adverse effects of demands and increase the potential for benefits resulting from the missions. Semistructured interviews were conducted with nine NASA personnel, including astronauts, flight directors, and flight surgeons. Questions addressed sources of meaning for astronauts, characteristics of tasks that enhance vs. detract from meaning, and recommendations for enhancing meaning. Personnel mentioned contributing to humanity and the next generation, contributing to the mission, and exploration as the most meaningful aspects of their work. Characteristics of tasks that enhanced meaning included using a variety of skills, feeling personal control over their schedule, autonomy in the execution of tasks, and understanding the importance of the experiments conducted on the mission. Top recommendations to sustain meaning were insuring social needs were met through such activities as the strategic use of social media, giving astronauts autonomy as well as structure, and conducting training during transit. Implications are addressed for tailoring meaning-based interventions for astronauts participating on long duration missions and assessing the effectiveness of these interventions.Britt TW, Sytine A, Brady A, Wilkes R, Pittman R, Jennings K, Goguen K. Enhancing the meaningfulness of work for astronauts on long duration space exploration missions. Aerosp Med Hum Perform. 2017; 88(8):779-783.

Feasibility, Safety, and Efficacy of an Alternative Schedule of Sunitinib for the Treatment of Patients with Metastatic Renal Cell Carcinoma: A Retrospective Study.

Science.gov (United States)

Buti, Sebastiano; Donini, Maddalena; Bersanelli, Melissa; Gattara, Alessia; Leonardi, Francesco; Passalacqua, Rodolfo

2017-12-01

Standard treatment with sunitinib for patients with metastatic renal cancer provides an 'on-off' schedule (daily administration of a 50-mg capsule for 4 weeks, followed by a 2-week break; consecutive 6-week cycles). We developed an alternative intermittent schedule to reduce the toxicity and symptoms of tumor regrowth during the rest period and to allow prolonged continuation of therapy, maintaining dose intensity. The objective of this study was to provide a retrospective evaluation of the feasibility, safety, and efficacy of an alternative schedule of sunitinib in patients who did not tolerate classical treatment. Patients treated with the classical schedule with at least grade 2 toxicity or recurrence of symptoms during the rest period were switched to an alternative schedule (the same daily dose 5 consecutive days per week for 5 weeks and then the same daily dose on days 1, 3, and 5 in the sixth week; consecutive 6-week cycles). Twenty-five patients were enrolled. The median time from sunitinib initiation to schedule switch was 2.9 months. After the switch, the median therapy duration was 9.2 months. Rate of delay, corrected by cycle number, was 10% for both schedules. After the switch, 48.7% of patients obtained a toxicity reduction (hypertension -82%, stomatitis -71%, cutaneous toxicity -69%). A reduction in 'on-off symptoms' (-86%) was achieved. Overall response rate was 40% and the disease control rate was 80%. Median progression-free survival was 16.4 months and median overall survival was 41.3 months. Despite the small sample size and retrospective nature, we demonstrated the feasibility, safety, and efficacy of the alternative schedule, allowing prolonged treatment and better quality of life.

Routine environmental monitoring schedule, calendar year 1997

Energy Technology Data Exchange (ETDEWEB)

Markes, B.M., Westinghouse Hanford

1996-12-10

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

Decay-usage scheduling in multiprocessors

NARCIS (Netherlands)

Epema, D.H.J.

1998-01-01

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

Approximate maximum parsimony and ancestral maximum likelihood.

Science.gov (United States)

Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat

2010-01-01

We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

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

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

Nonblocking Scheduling for Web Service Transactions

DEFF Research Database (Denmark)

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

2007-01-01

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

Flexible Work Schedules. ERIC Digest.

Science.gov (United States)

Kerka, Sandra

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

Televised Antismoking Advertising: Effects of Level and Duration of Exposure

Science.gov (United States)

Cotter, Trish; Perez, Donna; Wakefield, Melanie

2013-01-01

Objectives. We assessed the effects of levels and duration of exposure to televised antismoking advertising on cognitive and behavioral changes. Methods. We used data from a serial cross-sectional telephone survey with weekly interviews of adult smokers and recent quitters in New South Wales, Australia (n = 13 301), between April 2005 and December 2010. We merged survey data with commercial TV ratings data to estimate individuals’ exposure to antismoking advertising. Results. Logistic regression analyses indicated that after adjustment for a wide range of potential confounders, exposure to antismoking advertising at levels between 100 and 200 gross rating points per week on average over 6 to 9 weeks was associated with an increased likelihood of having (1) salient quitting thoughts and (2) recent quit attempts. Associations between exposure for shorter periods and these outcomes were not significant. Conclusions. Broadcasting schedules may affect the success of antismoking ads. Campaign planners should ensure advertising exposure at adequate frequency over relatively sustained periods to maximize impact. PMID:23763419

Televised antismoking advertising: effects of level and duration of exposure.

Science.gov (United States)

Dunlop, Sally; Cotter, Trish; Perez, Donna; Wakefield, Melanie

2013-08-01

We assessed the effects of levels and duration of exposure to televised antismoking advertising on cognitive and behavioral changes. We used data from a serial cross-sectional telephone survey with weekly interviews of adult smokers and recent quitters in New South Wales, Australia (n = 13,301), between April 2005 and December 2010. We merged survey data with commercial TV ratings data to estimate individuals' exposure to antismoking advertising. Logistic regression analyses indicated that after adjustment for a wide range of potential confounders, exposure to antismoking advertising at levels between 100 and 200 gross rating points per week on average over 6 to 9 weeks was associated with an increased likelihood of having (1) salient quitting thoughts and (2) recent quit attempts. Associations between exposure for shorter periods and these outcomes were not significant. Broadcasting schedules may affect the success of antismoking ads. Campaign planners should ensure advertising exposure at adequate frequency over relatively sustained periods to maximize impact.

Toward an Autonomous Telescope Network: the TBT Scheduler

Science.gov (United States)

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

2015-09-01

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

Pittsburgh International Airport - Scheduled Passenger Traffic

Data.gov (United States)

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

Comparison of an alternative and existing binning methods to reduce the acquisition duration of 4D PET/CT

International Nuclear Information System (INIS)

Didierlaurent, David; Ribes, Sophie; Caselles, Olivier; Jaudet, Cyril; Dierickx, Lawrence O.; Zerdoud, Slimane; Brillouet, Severine; Weits, Kathleen; Batatia, Hadj; Courbon, Frédéric

2014-01-01

Purpose: Respiratory motion is a source of artifacts that reduce image quality in PET. Four dimensional (4D) PET/CT is one approach to overcome this problem. Existing techniques to limiting the effects of respiratory motions are based on prospective phase binning which requires a long acquisition duration (15–25 min). This time is uncomfortable for the patients and limits the clinical exploitation of 4D PET/CT. In this work, the authors evaluated an existing method and an alternative retrospective binning method to reduce the acquisition duration of 4D PET/CT. Methods: The authors studied an existing mixed-amplitude binning (MAB) method and an alternative binning method by mixed-phases (MPhB). Before implementing MPhB, they analyzed the regularity of the breathing patterns in patients. They studied the breathing signal drift and missing CT slices that could be challenging for implementing MAB. They compared the performance of MAB and MPhB with current binning methods to measure the maximum uptake, internal volume, and maximal range of tumor motion. Results: MPhB can be implemented depending on an optimal phase (in average, the exhalation peak phase −4.1% of the entire breathing cycle duration). Signal drift of patients was in average 35% relative to the breathing amplitude. Even after correcting this drift, MAB was feasible in 4D CT for only 64% of patients. No significant differences appeared between the different binning methods to measure the maximum uptake, internal volume, and maximal range of tumor motion. The authors also determined the inaccuracies of MAB and MPhB to measure the maximum amplitude of tumor motion with three bins (less than 3 mm for movement inferior to 12 mm, up to 6.4 mm for a 21 mm movement). Conclusions: The authors proposed an alternative binning method by mixed-phase binning that halves the acquisition duration of 4D PET/CT. Mixed-amplitude binning was challenging because of signal drift and missing CT slices. They showed that more

A novel approach to the design and operation scheduling of heterogeneous catalytic reactors

International Nuclear Information System (INIS)

Ghodasara, Kamlesh; Smith, Robin; Hwang, Sungwon

2014-01-01

A number of studies have been conducted to reduce the overall level of catalyst deactivation in heterogeneous catalytic reactors, and improve the performance of reactors, such as yield, conversion or selectivity. The methodology generally includes optimization of the following: (1) operating conditions of the reaction system, such as feed temperature, normal operating temperature, pressure, and composition of feed streams; (2) reactor design parameters, such as dimension of the reactor, side stream distribution along the axis of the reactor beds, the mixing ratio of inert catalyst at each bed; and (3) catalyst design parameters, such as the pore size distribution across the pellet, active material distribution, size and shape of the catalyst, etc. Few studies have examined optimization of the overall catalyst reactor performance throughout the catalyst lifetime, considering catalyst deactivation. Furthermore, little attention has been given to the impact of various configurations of reactor networks and scheduling of the reactor operation (i.e., online and offline-regeneration) on the overall reactor performance throughout the catalyst lifetime. Therefore, we developed a range of feasible sequences of reactors and scheduling of reactors for operation and regeneration, and compared the overall reactor performance of multiple cases. Furthermore, a superstructure of reactor networks was developed and optimized to determine the optimum reactor network that shows the maximum overall reactor performance. The operating schedule of each reactor in the network was considered further. Lastly, the methodology was illustrated using a case study of the MTO (methanol to olefin) process

Cloud Service Scheduling Algorithm Research and Optimization

Directory of Open Access Journals (Sweden)

Hongyan Cui

2017-01-01

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

Reducing Electricity Demand Peaks by Scheduling Home Appliances Usage

DEFF Research Database (Denmark)

Rossello Busquet, Ana; Kardaras, Georgios; Iversen, Villy Bæk

2011-01-01

Nowadays there is a tendency to consume electricity during the same period of the day leading to demand peaks. Regular energy consumption habits lead to demand peaks at specific temporal intervals, because users consume power at the same time. In order to avoid demand peaks, users’ appliances...... should consume electricity in a more temporarily distributed way. A new methodology to schedule the usage of home appliances is proposed and analyzed in this paper. The main concept behind this approach is the aggregation of home appliances into priority classes and the definition of a maximum power...... consumption limit, which is not allowed to be exceeded during peak hours. The scenario simulated describes a modern household, where the electrical devices are classified in low and high priority groups. The high priority devices are always granted power in order to operate without temporal restrictions...

High levels of DDT in breast milk: Intake, risk, lactation duration, and involvement of gender

International Nuclear Information System (INIS)

Bouwman, Hindrik; Kylin, Henrik; Sereda, Barbara; Bornman, Riana

2012-01-01

We investigated presence and levels of DDT in 163 breast milk samples from four South African villages where, in three of them, malaria is controlled with DDT-sprayed indoors. Mean ΣDDT levels in breast milk were 18, 11, and 9.5 mg/kg mf (milk fat) from the three DDT-sprayed villages, respectively, including the highest ΣDDT level ever reported for breast milk from South Africa (140 mg/kg mf). Understanding the causes for these differences would be informative for exposure reduction intervention. The Provisional Tolerable Daily Intake (PTDI) for DDT by infants, and the Maximum Residue Limit (MRL) were significantly exceeded. DDT had no effect on duration of lactation. There were indications (not significant) from DDT-sprayed villages that first-born female infants drink milk with more ΣDDT than first-born male infants, and vice versa for multipara male and female infants, suggesting gender involvement on levels of DDT in breast milk – requiring further investigation. - Highlights: ► The highest ΣDDT in breast milk ever found in South Africa is reported. ► Maximum Residue Limit is exceeded, up to 99 times. ► Provisional Tolerable Daily Intake is exceeded, up to 310 times. ► High ΣDDT did not affect duration of lactation. ► Infant gender may affect levels of ΣDDT in breast milk. - High levels of DDT in breast milk from a DDT-spayed area exceeded known limits in milk, but did not affect duration lactation. Infant gender may affect levels of ΣDDT in breast milk.

A Gas Scheduling Optimization Model for Steel Enterprises

Directory of Open Access Journals (Sweden)

Niu Honghai

2017-01-01

Full Text Available Regarding the scheduling problems of steel enterprises, this research designs the gas scheduling optimization model according to the rules and priorities. Considering different features and the process changes of the gas unit in the process of actual production, the calculation model of process state and gas consumption soft measurement together with the rules of scheduling optimization is proposed to provide the dispatchers with real-time gas using status of each process, then help them to timely schedule and reduce the gas volume fluctuations. In the meantime, operation forewarning and alarm functions are provided to avoid the abnormal situation in the scheduling, which has brought about very good application effect in the actual scheduling and ensures the safety of the gas pipe network system and the production stability.

A reduced feedback proportional fair multiuser scheduling scheme

KAUST Repository

Shaqfeh, Mohammad

2011-12-01

Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed and ordered scheduling mechanism. A slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we propose a novel proportional fair multiuser switched-diversity scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the per-user feedback thresholds. We demonstrate by numerical examples that our reduced feedback proportional fair scheduler operates within 0.3 bits/sec/Hz from the achievable rates by the conventional full feedback proportional fair scheduler in Rayleigh fading conditions. © 2011 IEEE.

Where do we stand with fuzzy project scheduling?

CERN Document Server

Bonnal, Pierre; Lacoste, Germain

2004-01-01

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

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

Job schedulers for Big data processing in Hadoop environment: testing real-life schedulers using benchmark programs

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

Full Text Available At present, big data is very popular, because it has proved to be much successful in many fields such as social media, E-commerce transactions, etc. Big data describes the tools and technologies needed to capture, manage, store, distribute, and analyze petabyte or larger-sized datasets having different structures with high speed. Big data can be structured, unstructured, or semi structured. Hadoop is an open source framework that is used to process large amounts of data in an inexpensive and efficient way, and job scheduling is a key factor for achieving high performance in big data processing. This paper gives an overview of big data and highlights the problems and challenges in big data. It then highlights Hadoop Distributed File System (HDFS, Hadoop MapReduce, and various parameters that affect the performance of job scheduling algorithms in big data such as Job Tracker, Task Tracker, Name Node, Data Node, etc. The primary purpose of this paper is to present a comparative study of job scheduling algorithms along with their experimental results in Hadoop environment. In addition, this paper describes the advantages, disadvantages, features, and drawbacks of various Hadoop job schedulers such as FIFO, Fair, capacity, Deadline Constraints, Delay, LATE, Resource Aware, etc, and provides a comparative study among these schedulers.

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.

Post LS1 schedule

CERN Document Server

Lamont, M

2014-01-01

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

Staffing, overtime, and shift scheduling project

International Nuclear Information System (INIS)

Lewis, P.M.

1989-01-01

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

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.

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

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

Scheduling job shop - A case study

Science.gov (United States)

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

2016-08-01

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

A study on the intra-annual variation and the spatial distribution of precipitation amount and duration over Greece on a 10 day basis

Science.gov (United States)

Bartzokas, A.; Lolis, C. J.; Metaxas, D. A.

2003-02-01

The intra-annual variation of precipitation amount and duration and their spatial distribution during the year are studied on a 10 day basis for the Greek region, using S-mode and T-mode factor analysis. (i) For the intra-annual variation of precipitation amount, two modes were revealed: the first shows one broad maximum during the conventional winter in stations affected by the sea; the second presents two maxima, the first during late autumn-early winter and the second during late spring, corresponding to the northern mainland stations. (ii) For the spatial distribution of precipitation, three main patterns were revealed: the first one is the winter pattern, with the maximum over the west windward area; the second is the summer pattern, with a maximum over the north inland region; and the third is the autumn pattern, with the maximum over northwestern Greece. (iii) For precipitation duration, two types of intra-annual variation were revealed. The first one is similar to the first of the analysis for precipitation amount; the second presents two maxima, the first during the beginning of December and the second during the middle of February, corresponding to the areas of northwestern and northeastern Greece. (iv) For the spatial distribution of precipitation duration, three main patterns were revealed: the first is the summer pattern, which is similar to the second of the analysis for precipitation amount; the second is the winter pattern, with the spatial maximum located over the eastern mainland and western Crete; finally, the third one is the autumn pattern, with the maximum in northwestern Greece. During the third 10 day period of October and the second 10 day period of February, precipitation seems to present singularities, possibly due to fluctuations in atmospheric circulation. The above intra-annual variations and spatial distribution patterns are connected to the seasonal variations of the depression trajectories, the atmospheric instability, the influence

Modeling the Cray memory scheduler

Energy Technology Data Exchange (ETDEWEB)

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

1992-04-01

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

The relationship between movement speed and duration during soccer matches

Science.gov (United States)

Mahler, Hubert; Heyde, Christian; Röll, Mareike; Gollhofer, Albert

2017-01-01

The relationship between the time duration of movement (t(dur)) and related maximum possible power output has been studied and modeled under many conditions. Inspired by the so-called power profiles known for discontinuous endurance sports like cycling, and the critical power concept of Monod and Scherrer, the aim of this study was to evaluate the numerical characteristics of the function between maximum horizontal movement velocity (HSpeed) and t(dur) in soccer. To evaluate this relationship, GPS data from 38 healthy soccer players and 82 game participations (≥30 min active playtime) were used to select maximum HSpeed for 21 distinct t(dur) values (between 0.3 s and 2,700 s) based on moving medians with an incremental t(dur) window-size. As a result, the relationship between HSpeed and Log(t(dur)) appeared reproducibly as a sigmoidal decay function, and could be fitted to a five-parameter equation with upper and lower asymptotes, and an inflection point, power and decrease rate. Thus, the first three parameters described individual characteristics if evaluated using mixed-model analysis. This study shows for the first time the general numerical relationship between t(dur) and HSpeed in soccer games. In contrast to former descriptions that have evaluated speed against power, HSpeed against t(dur) always yields a sigmoidal shape with a new upper asymptote. The evaluated curve fit potentially describes the maximum moving speed of individual players during the game, and allows for concise interpretations of the functional state of team sports athletes. PMID:28742832

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

Full Text Available Home energy management systems (HEMS face many challenges of uncertainty, which have a great impact on the scheduling of home appliances. To handle the uncertain parameters in the household load scheduling problem, this paper uses a robust optimization method to rebuild the household load scheduling model for home energy management. The model proposed in this paper can provide the complete robust schedules for customers while considering the disturbance of uncertain parameters. The complete robust schedules can not only guarantee the customers’ comfort constraints but also cooperatively schedule the electric devices for cost minimization and load shifting. Moreover, it is available for customers to obtain multiple schedules through setting different robust levels while considering the trade-off between the comfort and economy.

The robust schedule - A link to improved workflow

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2012-01-01

-down the contractors, and force them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In attempt to improve productivity three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have been...... analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule to tight. A too tight schedule is inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors interacting and dependable....... The result is a chaotic, complex and uncontrolled construction site. Furthermore, strict time limits entail the workflow to be optimized under non-optimal conditions. Even though productivity seems to be increasing, productivity per man-hour is decreasing resulting in increased cost. To increase productivity...