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.

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

An adaptive random search for short term generation scheduling with network constraints.

Directory of Open Access Journals (Sweden)

J A Marmolejo

Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

DEFF Research Database (Denmark)

Neumann, Frank; Witt, Carsten

2015-01-01

combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

An Efficient Randomized Algorithm for Real-Time Process Scheduling in PicOS Operating System

Science.gov (United States)

Helmy*, Tarek; Fatai, Anifowose; Sallam, El-Sayed

PicOS is an event-driven operating environment designed for use with embedded networked sensors. More specifically, it is designed to support the concurrency in intensive operations required by networked sensors with minimal hardware requirements. Existing process scheduling algorithms of PicOS; a commercial tiny, low-footprint, real-time operating system; have their associated drawbacks. An efficient, alternative algorithm, based on a randomized selection policy, has been proposed, demonstrated, confirmed for efficiency and fairness, on the average, and has been recommended for implementation in PicOS. Simulations were carried out and performance measures such as Average Waiting Time (AWT) and Average Turn-around Time (ATT) were used to assess the efficiency of the proposed randomized version over the existing ones. The results prove that Randomized algorithm is the best and most attractive for implementation in PicOS, since it is most fair and has the least AWT and ATT on average over the other non-preemptive scheduling algorithms implemented in this paper.

Sound production treatment for acquired apraxia of speech: Effects of blocked and random practice on multisyllabic word production.

Science.gov (United States)

Wambaugh, Julie; Nessler, Christina; Wright, Sandra; Mauszycki, Shannon; DeLong, Catharine

2016-10-01

This study was designed to examine the effects of practice schedule, blocked vs random, on outcomes of a behavioural treatment for acquired apraxia of speech (AOS), Sound Production Treatment (SPT). SPT was administered to four speakers with chronic AOS and aphasia in the context of multiple baseline designs across behaviours and participants. Treatment was applied to multiple sound errors within three-to-five syllable words. All participants received both practice schedules: SPT-Random (SPT-R) and SPT-Blocked (SPT-B). Improvements in accuracy of word production for trained items were found for both treatment conditions for all participants. One participant demonstrated better maintenance effects associated with SPT-R. Response generalisation to untreated words varied across participants, but was generally modest and unstable. Stimulus generalisation to production of words in sentence completion was positive for three of the participants. Stimulus generalisation to production of phrases was positive for two of the participants. Findings provide additional efficacy data regarding SPT's effects on articulation of treated items and extend knowledge of the treatment's effects when applied to multiple targets within multisyllabic words.

Hybrid Discrete Differential Evolution Algorithm for Lot Splitting with Capacity Constraints in Flexible Job Scheduling

Directory of Open Access Journals (Sweden)

Xinli Xu

2013-01-01

Full Text Available A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot scheduling chromosome. To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE is presented, in which the local strategy with dynamic random searching based on the critical path and a random mutation operator is developed. The performance of HDDE was experimented with 14 benchmark problems and the practical dye vat scheduling problem. The simulation results showed that the proposed algorithm has the strong global search capability and can effectively solve the practical lot splitting problems with equipment capacity constraints.

Random vibrations theory and practice

CERN Document Server

Wirsching, Paul H; Ortiz, Keith

1995-01-01

Random Vibrations: Theory and Practice covers the theory and analysis of mechanical and structural systems undergoing random oscillations due to any number of phenomena— from engine noise, turbulent flow, and acoustic noise to wind, ocean waves, earthquakes, and rough pavement. For systems operating in such environments, a random vibration analysis is essential to the safety and reliability of the system. By far the most comprehensive text available on random vibrations, Random Vibrations: Theory and Practice is designed for readers who are new to the subject as well as those who are familiar with the fundamentals and wish to study a particular topic or use the text as an authoritative reference. It is divided into three major sections: fundamental background, random vibration development and applications to design, and random signal analysis. Introductory chapters cover topics in probability, statistics, and random processes that prepare the reader for the development of the theory of random vibrations a...

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.

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

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

A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling

Directory of Open Access Journals (Sweden)

Dong Yumin

2014-01-01

Full Text Available A quantum random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in quantum mechanics and apply it to data clustering. We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk. For the data clustering problem of high dimensional space, we can decompose one m-dimensional quantum random walk into m one-dimensional quantum random walk. In the end of the paper, we compare the quantum random walk optimization method with GA (genetic algorithm, ACO (ant colony optimization, and SAA (simulated annealing algorithm. In the same time, we prove its validity and rationality by the experiment of analog and simulation.

Distributed practice. The more the merrier? A randomised bronchoscopy simulation study

OpenAIRE

Bjerrum, Anne Sofie; Eika, Berit; Charles, Peder; Hilberg, Ole

2016-01-01

Introduction: The distribution of practice affects the acquisition of skills. Distributed practice has shown to be more effective for skills acquisition than massed training. However, it remains unknown as to which is the most effective distributed practice schedule for learning bronchoscopy skills through simulation training. This study compares two distributed practice schedules: One-day distributed practice and weekly distributed practice.Method: Twenty physicians in training were randomly...

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 Provably Secure Multi-node Communication

OpenAIRE

Ali, Omar; Ayoub, Mahmoud F.; Youssef, Moustafa

2013-01-01

We present a practical and provably-secure multimode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. We present the details of the technique and analyze it to quantify the secrecy-fairness-overhead trade-off. Implementation of the scheme over Crossb...

Estrutura de prática e validade ecológica no processo adaptativo de aprendizagem motora Practice schedule and ecological validity in the adaptive process of motor learning

Directory of Open Access Journals (Sweden)

Marcela Massigli

2011-03-01

Full Text Available O objetivo desse estudo foi investigar o efeito da estrutura de prática no processo adaptativo de aprendizagem motora em função da validade ecológica da situação experimental. Participaram do estudo 104 crianças distribuídas em oito grupos experimentais (dois níveis de validade ecológica x quatro estruturas de prática. A tarefa consistiu em rebater uma bola de tênis de mesa lançada por um equipamento ou pelo experimentador, com o objetivo de acertar um alvo localizado no lado oposto da mesa. O estudo envolveu duas fases: estabilização e adaptação. O desempenho foi analisado por meio da soma dos pontos obtidos em blocos de 10 tentativas. Os resultados mostraram que os efeitos das práticas constante, aleatória, constante-aleatória e aleatória-constante no processo adaptativo de aprendizagem motora foram similares em ambos os níveis de validade ecológica; a prática constante foi a estrutura menos efetiva no processo adaptativo de aprendizagem motora em ambas as situações experimentais.The aim of this study was to investigate the effect of different practice schedules in the adaptive process of motor learning in function of the ecological validity of the experimental situation. Participants were 104 children distributed in eight experimental groups (2 levels of ecological validity x 4 practice schedules. The task was to hit a table tennis ball thrown by equipment or experimenter, aiming to hit a target located on the opposite side of the table. The study was carried out in two phases: stabilization and adaptation. Performance was analyzed through the sum of the points achieved in ten trial blocks. Results showed that the effects of constant, random, constant-random and random-constant practice on the adaptive process of motor learning were similar in both levels of ecological validity; constant practice was the less effective schedule on the adaptive process of motor learning in both experimental situations.

Practical job shop scheduling

NARCIS (Netherlands)

Schutten, Johannes M.J.

1998-01-01

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

Practice expenses in the MFS (Medicare fee schedule): the service-class approach.

Science.gov (United States)

Latimer, E A; Kane, N M

1995-01-01

The practice expense component of the Medicare fee schedule (MFS), which is currently based on historical charges and rewards physician procedures at the expense of cognitive services, is due to be changed by January 1, 1998. The Physician Payment Review Commission (PPRC) and others have proposed microcosting direct costs and allocating all indirect costs on a common basis, such as physician time or work plus direct costs. Without altering the treatment of direct costs, the service-class approach disaggregates indirect costs into six practice function costs. The practice function costs are then allocated to classes of services using cost-accounting and statistical methods. This approach would make the practice expense component more resource-based than other proposed alternatives.

Dissociable effects of practice variability on learning motor and timing skills.

Science.gov (United States)

Caramiaux, Baptiste; Bevilacqua, Frédéric; Wanderley, Marcelo M; Palmer, Caroline

2018-01-01

Motor skill acquisition inherently depends on the way one practices the motor task. The amount of motor task variability during practice has been shown to foster transfer of the learned skill to other similar motor tasks. In addition, variability in a learning schedule, in which a task and its variations are interweaved during practice, has been shown to help the transfer of learning in motor skill acquisition. However, there is little evidence on how motor task variations and variability schedules during practice act on the acquisition of complex motor skills such as music performance, in which a performer learns both the right movements (motor skill) and the right time to perform them (timing skill). This study investigated the impact of rate (tempo) variability and the schedule of tempo change during practice on timing and motor skill acquisition. Complete novices, with no musical training, practiced a simple musical sequence on a piano keyboard at different rates. Each novice was assigned to one of four learning conditions designed to manipulate the amount of tempo variability across trials (large or small tempo set) and the schedule of tempo change (randomized or non-randomized order) during practice. At test, the novices performed the same musical sequence at a familiar tempo and at novel tempi (testing tempo transfer), as well as two novel (but related) sequences at a familiar tempo (testing spatial transfer). We found that practice conditions had little effect on learning and transfer performance of timing skill. Interestingly, practice conditions influenced motor skill learning (reduction of movement variability): lower temporal variability during practice facilitated transfer to new tempi and new sequences; non-randomized learning schedule improved transfer to new tempi and new sequences. Tempo (rate) and the sequence difficulty (spatial manipulation) affected performance variability in both timing and movement. These findings suggest that there is a

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

Science.gov (United States)

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

2013-01-01

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

Auditory Training for Adults Who Have Hearing Loss: A Comparison of Spaced Versus Massed Practice Schedules.

Science.gov (United States)

Tye-Murray, Nancy; Spehar, Brent; Barcroft, Joe; Sommers, Mitchell

2017-08-16

The spacing effect in human memory research refers to situations in which people learn items better when they study items in spaced intervals rather than massed intervals. This investigation was conducted to compare the efficacy of meaning-oriented auditory training when administered with a spaced versus massed practice schedule. Forty-seven adult hearing aid users received 16 hr of auditory training. Participants in a spaced group (mean age = 64.6 years, SD = 14.7) trained twice per week, and participants in a massed group (mean age = 69.6 years, SD = 17.5) trained for 5 consecutive days each week. Participants completed speech perception tests before training, immediately following training, and then 3 months later. In line with transfer appropriate processing theory, tests assessed both trained tasks and an untrained task. Auditory training improved the speech recognition performance of participants in both groups. Benefits were maintained for 3 months. No effect of practice schedule was found on overall benefits achieved, on retention of benefits, nor on generalizability of benefits to nontrained tasks. The lack of spacing effect in otherwise effective auditory training suggests that perceptual learning may be subject to different influences than are other types of learning, such as vocabulary learning. Hence, clinicians might have latitude in recommending training schedules to accommodate patients' schedules.

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.

The Offering, Scheduling and Maintenance of Elective Advanced Pharmacy Practice Experiences

Directory of Open Access Journals (Sweden)

Rex O. Brown

2015-12-01

Full Text Available The Accreditation Council for Pharmacy Education (ACPE provides standards for colleges of pharmacy to assist in the provision of pharmacy education to student pharmacists. An integral part of all college educational programs includes the provision of experiential learning. Experiential learning allows students to gain real-world experience in direct patient care during completion of the curriculum. All college of pharmacy programs provide several Advanced Pharmacy Practice Experiences (APPEs, which include a balance between the four required experiences and a number of other required or elective APPEs. Required APPEs include advanced community, advanced institutional, ambulatory care, and general medicine. The elective APPEs include a myriad of opportunities to help provide a balanced education in experiential learning for student pharmacists. These unique opportunities help to expose student pharmacists to different career tracks that they may not have been able to experience otherwise. Not all colleges offer enough elective APPEs to enable the student pharmacist to obtain experiences in a defined area. Such an approach is required to produce skilled pharmacy graduates that are capable to enter practice in various settings. Elective APPEs are scheduled logically and are based upon student career interest and site availability. This article describes the offering, scheduling and maintenance of different elective APPEs offered by The University of Tennessee College of Pharmacy.

How shift scheduling practices contribute to fatigue amongst freight rail operating employees: Findings from Canadian accident investigations.

Science.gov (United States)

Rudin-Brown, Christina M; Harris, Sarah; Rosberg, Ari

2018-02-01

Canada's freight rail system moves 70% of the country's surface goods and almost half of all exports (RAC, 2016). These include dangerous goods. Anonymous survey of freight rail operating employees conducted by the Teamsters Canada Rail Conference (TCRC, 2014) revealed that many do not report getting enough sleep because of their work schedules, and that fatigue may be affecting their performance at work. Besides general impairments in attention and cognitive functioning, fatigue in railway operating employees slows reaction time to safety alarms and impairs conformance to train operating requirements. Shift scheduling practices can contribute to sleep-related fatigue by restricting sleep opportunities, requiring extended periods of wakefulness and by disrupting daily (circadian) rhythms. The primary goal of accident investigation is to identify causal and contributing factors so that similar occurrences can be prevented. A database search of Transportation Safety Board (TSB) rail investigation reports published in the 21-year period from 1995 to 2015 identified 18 that cited sleep-related fatigue of freight rail operating employees as a causal, contributing, or risk finding. This number represents about 20% of TSB rail investigations from the same period in which a human factors aspect of freight train activities was a primary cause. Exploration of accident themes suggests that management of fatigue and shift scheduling in the freight rail industry is a complex issue that is often not conducive to employee circadian rhythms and sleep requirements. It also suggests that current shift scheduling and fatigue management practices may be insufficient to mitigate the associated safety risk. Railway fatigue management systems that are based on the principles of modern sleep science are needed to improve scheduling practices and mitigate the ongoing safety risk. Crown Copyright © 2018. Published by Elsevier Ltd. All rights reserved.

16 CFR 5.60 - Scheduling of hearing.

Science.gov (United States)

2010-01-01

... 16 Commercial Practices 1 2010-01-01 2010-01-01 false Scheduling of hearing. 5.60 Section 5.60 Commercial Practices FEDERAL TRADE COMMISSION ORGANIZATION, PROCEDURES AND RULES OF PRACTICE STANDARDS OF CONDUCT Disciplinary Actions Concerning Postemployment Conflict of Interest § 5.60 Scheduling of hearing...

Practical quantum appointment scheduling

Science.gov (United States)

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

2018-04-01

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

Distributed practice. The more the merrier? A randomised bronchoscopy simulation study.

Science.gov (United States)

Bjerrum, Anne Sofie; Eika, Berit; Charles, Peder; Hilberg, Ole

2016-01-01

The distribution of practice affects the acquisition of skills. Distributed practice has shown to be more effective for skills acquisition than massed training. However, it remains unknown as to which is the most effective distributed practice schedule for learning bronchoscopy skills through simulation training. This study compares two distributed practice schedules: One-day distributed practice and weekly distributed practice. Twenty physicians in training were randomly assigned to one-day distributed or weekly distributed bronchoscopy simulation practice. Performance was assessed with a pre-test, a post-test after each practice session, and a 4-week retention test using previously validated simulator measures. Data were analysed with repeated measures ANOVA. No interaction was found between group and test (F(4,72) 0.16), except for the measure 'percent-segments-entered', and no main effect of group was found for any of the measures (F(1,72)0.36), which indicates that there was no difference between the learning curves of the one-day distributed practice schedule and the weekly distributed practice schedule. We found no difference in effectiveness of bronchoscopy skills acquisition between the one-day distributed practice and the weekly distributed practice. This finding suggests that the choice of bronchoscopy training practice may be guided by what best suits the clinical practice.

Randomness determines practical security of BB84 quantum key distribution

Science.gov (United States)

Li, Hong-Wei; Yin, Zhen-Qiang; Wang, Shuang; Qian, Yong-Jun; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu

2015-11-01

Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong randomness attack and weak randomness attack respectively. We prove security of BB84 protocol under randomness attacking models, and these results can be applied to guarantee the security of the practical quantum key distribution system.

Random practice - one of the factors of the motor learning process

Directory of Open Access Journals (Sweden)

Petr Valach

2012-01-01

Full Text Available BACKGROUND: An important concept of acquiring motor skills is the random practice (contextual interference - CI. The explanation of the effect of contextual interference is that the memory has to work more intensively, and therefore it provides higher effect of motor skills retention than the block practice. Only active remembering of a motor skill assigns the practical value for appropriate using in the future. OBJECTIVE: The aim of this research was to determine the difference in how the motor skills in sport gymnastics are acquired and retained using the two different teaching methods - blocked and random practice. METHODS: The blocked and random practice on the three selected gymnastics tasks were applied in the two groups students of physical education (blocked practice - the group BP, random practice - the group RP during two months, in one session a week (totally 80 trials. At the end of the experiment and 6 months after (retention tests the groups were tested on the selected gymnastics skills. RESULTS: No significant differences in a level of the gymnastics skills were found between BP group and RP group at the end of the experiment. However, the retention tests showed significantly higher level of the gymnastics skills in the RP group in comparison with the BP group. CONCLUSION: The results confirmed that a retention of the gymnastics skills using the teaching method of the random practice was significantly higher than with use of the blocked practice.

Emergency Radiology Practice Patterns: Shifts, Schedules, and Job Satisfaction.

Science.gov (United States)

Hanna, Tarek N; Shekhani, Haris; Lamoureux, Christine; Mar, Hanna; Nicola, Refky; Sliker, Clint; Johnson, Jamlik-Omari

2017-03-01

To assess the practice environment of emergency radiologists with a focus on schedule, job satisfaction, and self-perception of health, wellness, and diagnostic accuracy. A survey drawing from prior radiology and health care shift-work literature was distributed via e-mail to national societies, teleradiology groups, and private practices. The survey remained open for 4 weeks in 2016, with one reminder. Data were analyzed using hypothesis testing and logistic regression modeling. Response rate was 29.6% (327/1106); 69.1% of respondents (n = 226) were greater than 40 years old, 73% (n = 240) were male, and 87% (n = 284) practiced full time. With regard to annual overnight shifts (NS): 36% (n = 118) did none, 24.9% (n = 81) did 182 or more, and 15.6% (n = 51) did 119. There was a significant association between average NS worked per year and both perceived negative health effects (P impact on memory (P job enjoyment and number of annual NS (P job" for radiologists who work no NS is 2.21 times greater than for radiologists who work at least 119 NS, when shift length is held constant. Radiologists with 11+ years of experience who work no NS or 1 to 100 NS annually have lower odds of feeling overwhelmed when compared with those working the same number of NS with job satisfaction and negative health self-perception. Copyright © 2016 American College of Radiology. Published by Elsevier Inc. All rights reserved.

The effects of practice schedule and critical thinking prompts on learning and transfer of complex judgment

NARCIS (Netherlands)

Helsdingen, Anne; Van Gog, Tamara; Van Merriënboer, Jeroen

2010-01-01

Helsdingen, A. S., Van Gog, T., & Van Merriënboer, J. J. G. (2011). The effects of practice schedule and critical thinking prompts on learning and transfer of complex judgment task. Journal of Educational Psychology, 103(2), 383-398. doi:10.1037/a0022370

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

Directory of Open Access Journals (Sweden)

Amar N. Katre

2014-01-01

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

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

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

Random maintenance policies

CERN Document Server

Nakagawa, Toshio

2014-01-01

Exploring random maintenance models, this book provides an introduction to the implementation of random maintenance, and it is one of the first books to be written on this subject.  It aims to help readers learn new techniques for applying random policies to actual reliability models, and it provides new theoretical analyses of various models including classical replacement, preventive maintenance and inspection policies. These policies are applied to scheduling problems, backup policies of database systems, maintenance policies of cumulative damage models, and reliability of random redundant systems. Reliability theory is a major concern for engineers and managers, and in light of Japan’s recent earthquake, the reliability of large-scale systems has increased in importance. This also highlights the need for a new notion of maintenance and reliability theory, and how this can practically be applied to systems. Providing an essential guide for engineers and managers specializing in reliability maintenance a...

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.

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

Effects of psychological therapies in randomized trials and practice-based studies.

Science.gov (United States)

Barkham, Michael; Stiles, William B; Connell, Janice; Twigg, Elspeth; Leach, Chris; Lucock, Mike; Mellor-Clark, John; Bower, Peter; King, Michael; Shapiro, David A; Hardy, Gillian E; Greenberg, Leslie; Angus, Lynne

2008-11-01

Randomized trials of the effects of psychological therapies seek internal validity via homogeneous samples and standardized treatment protocols. In contrast, practice-based studies aim for clinical realism and external validity via heterogeneous samples of clients treated under routine practice conditions. We compared indices of treatment effects in these two types of studies. Using published transformation formulas, the Beck Depression Inventory (BDI) scores from five randomized trials of depression (N = 477 clients) were transformed into Clinical Outcomes in Routine Evaluation-Outcome Measure (CORE-OM) scores and compared with CORE-OM data collected in four practice-based studies (N = 4,196 clients). Conversely, the practice-based studies' CORE-OM scores were transformed into BDI scores and compared with randomized trial data. Randomized trials showed a modest advantage over practice-based studies in amount of pre-post improvement. This difference was compressed or exaggerated depending on the direction of the transformation but averaged about 12%. There was a similarly sized advantage to randomized trials in rates of reliable and clinically significant improvement (RCSI). The largest difference was yielded by comparisons of effect sizes which suggested an advantage more than twice as large, reflecting narrower pre-treatment distributions in the randomized trials. Outcomes of completed treatments for depression in randomized trials appeared to be modestly greater than those in routine care settings. The size of the difference may be distorted depending on the method for calculating degree of change. Transforming BDI scores into CORE-OM scores and vice versa may be a preferable alternative to effect sizes for comparisons of studies using these measures.

Advisory Committee on Immunization Practices Recommended Immunization Schedule for Children and Adolescents Aged 18 Years or Younger - United States, 2018.

Science.gov (United States)

Robinson, Candice L; Romero, José R; Kempe, Allison; Pellegrini, Cynthia; Szilagyi, Peter

2018-02-09

In October 2017, the Advisory Committee on Immunization Practices (ACIP) approved the Recommended Immunization Schedule for Children and Adolescents Aged 18 Years or Younger - United States, 2018. The 2018 child and adolescent immunization schedule summarizes ACIP recommendations, including several changes from the 2017 immunization schedules, in three figures and footnotes to the figures. These documents can be found on the CDC immunization schedule website (https://www.cdc.gov/vaccines/schedules/index.html). These immunization schedules are approved by ACIP (https://www.cdc.gov/vaccines/acip/index.html), the American Academy of Pediatrics (https://www.aap.org), the American Academy of Family Physicians (https://www.aafp.org), and the American College of Obstetricians and Gynecologists (https://www.acog.org). Health care providers are advised to use the figures and the footnotes together. The full ACIP recommendations for each vaccine, including contraindications and precautions, can be found at https://www.cdc.gov/vaccines/hcp/acip-recs/index.html. Providers should be aware that changes in recommendations for specific vaccines can occur between annual updates to the childhood/adolescent immunization schedules. If errors or omissions are discovered within the child and adolescent schedule, CDC posts revised versions on the CDC immunization schedule website.

Advisory Committee on Immunization Practices Recommended Immunization Schedule for Adults Aged 19 Years or Older - United States, 2018.

Science.gov (United States)

Kim, David K; Riley, Laura E; Hunter, Paul

2018-02-09

In October 2017, the Advisory Committee on Immunization Practices (ACIP) voted to approve the Recommended Immunization Schedule for Adults Aged 19 Years or Older, United States, 2018. The 2018 adult immunization schedule summarizes ACIP recommendations in two figures and a table of contraindications and precautions for vaccines recommended for adults, and is intended is to assist health care providers in implementing the current ACIP recommendations for vaccinating adults. The schedule can be found at https://www.cdc.gov/vaccines/schedules.* The full ACIP recommendations for each vaccine are available at https://www.cdc.gov/vaccines/hcp/acip-recs/index.html. The 2018 adult immunization schedule has also been approved by the American College of Physicians (https://www.acponline.org), the American Academy of Family Physicians (https://www.aafp.org), the American College of Obstetricians and Gynecologists (https://www.acog.org), and the American College of Nurse-Midwives (http://www.midwife.org). The ACIP-recommended use of each vaccine is developed after an in-depth review of vaccine-related data, including data on disease epidemiology, vaccine efficacy and effectiveness, vaccine safety, feasibility of program implementation, and economic aspects of immunization policy (1).

A distributed scheduling algorithm for heterogeneous real-time systems

Science.gov (United States)

Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

1991-01-01

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

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.

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

Adaptation Practices to Climate Change Among Rice Farmers in ...

African Journals Online (AJOL)

The study examined adaptation practices to climate change among rice farmers in Anambra State, Nigeria. Data were collected from 100 rice farmers by the combination of multistage, purposive and simple random sampling techniques, through the use of interview schedule. Percentage and mean statistics were used for ...

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.

7 CFR 305.23 - Steam sterilization treatment schedules.

Science.gov (United States)

2010-01-01

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

An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

OpenAIRE

Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

2014-01-01

This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand unc...

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.

Effect of reduced dose schedules and intramuscular injection of anthrax vaccine adsorbed on immunological response and safety profile: a randomized trial.

Science.gov (United States)

Wright, Jennifer G; Plikaytis, Brian D; Rose, Charles E; Parker, Scott D; Babcock, Janiine; Keitel, Wendy; El Sahly, Hana; Poland, Gregory A; Jacobson, Robert M; Keyserling, Harry L; Semenova, Vera A; Li, Han; Schiffer, Jarad; Dababneh, Hanan; Martin, Sandra K; Martin, Stacey W; Marano, Nina; Messonnier, Nancy E; Quinn, Conrad P

2014-02-12

We evaluated an alternative administration route, reduced schedule priming series, and increased intervals between booster doses for anthrax vaccine adsorbed (AVA). AVA's originally licensed schedule was 6 subcutaneous (SQ) priming injections administered at months (m) 0, 0.5, 1, 6, 12 and 18 with annual boosters; a simpler schedule is desired. Through a multicenter randomized, double blind, non-inferiority Phase IV human clinical trial, the originally licensed schedule was compared to four alternative and two placebo schedules. 8-SQ group participants received 6 SQ injections with m30 and m42 "annual" boosters; participants in the 8-IM group received intramuscular (IM) injections according to the same schedule. Reduced schedule groups (7-IM, 5-IM, 4-IM) received IM injections at m0, m1, m6; at least one of the m0.5, m12, m18, m30 vaccine doses were replaced with saline. All reduced schedule groups received a m42 booster. Post-injection blood draws were taken two to four weeks following injection. Non-inferiority of the alternative schedules was compared to the 8-SQ group at m2, m7, and m43. Reactogenicity outcomes were proportions of injection site and systemic adverse events (AEs). The 8-IM group's m2 response was non-inferior to the 8-SQ group for the three primary endpoints of anti-protective antigen IgG geometric mean concentration (GMC), geometric mean titer, and proportion of responders with a 4-fold rise in titer. At m7 anti-PA IgG GMCs for the three reduced dosage groups were non-inferior to the 8-SQ group GMCs. At m43, 8-IM, 5-IM, and 4-IM group GMCs were superior to the 8-SQ group. Solicited injection site AEs occurred at lower proportions in the IM group compared to SQ. Route of administration did not influence the occurrence of systemic AEs. A 3 dose IM priming schedule with doses administered at m0, m1, and m6 elicited long term immunological responses and robust immunological memory that was efficiently stimulated by a single booster vaccination at

Pilot Randomized Trial Comparing Intersession Scheduling of Biofeedback Results to Individuals with Chronic Pain: Influence on Psychologic Function and Pain Intensity.

Science.gov (United States)

Weeks, Douglas L; Whitney, Anthony A; Tindall, Angelique G; Carter, Gregory T

2015-10-01

The objective of this study was to compare the effectiveness of two biofeedback schedules on long-term improvement in physical and psychologic reactivity to chronic nonmalignant pain. This study is a prospective, randomized pilot trial. Twenty adults with chronic pain engaged in heart rate variability (HRV) biofeedback training for nine sessions with HRV presented visually. Two groups, formed by random assignment, were compared: The faded feedback group received concurrent visual HRV biofeedback in session 1, with the amount of biofeedback systematically reduced for ensuing sessions so that, by session 9, the participants were controlling HRV without external feedback. The full feedback group received visual HRV biofeedback continuously across all sessions. Outcome measures assessed at baseline, immediately after the program, and 3 mos after the program included pain intensity, fear-avoidance beliefs, and self-report physical functioning. Use of biofeedback skills was also assessed 3 mos after the program. Nominal variables were analyzed with χ. Continuous measures were analyzed with repeated-measures analyses of variance. The faded feedback schedule resulted in greater use of biofeedback skills at 3 mos and improved pain intensity and fear-avoidance beliefs after the program and at 3 mos. Physical functioning did not differ between groups. Systematically reducing the frequency of external visual feedback during HRV biofeedback training was associated with reduced reactivity to chronic pain. Results of this pilot study should be confirmed with a larger randomized study.

Nurses' practice environment and satisfaction with schedule flexibility is related to intention to leave due to dissatisfaction: A multi-country, multilevel study.

Science.gov (United States)

Leineweber, Constanze; Chungkham, Holendro Singh; Lindqvist, Rikard; Westerlund, Hugo; Runesdotter, Sara; Smeds Alenius, Lisa; Tishelman, Carol

2016-06-01

Nursing turnover is a major issue for health care managers, notably during the global nursing workforce shortage. Despite the often hierarchical structure of the data used in nursing studies, few studies have investigated the impact of the work environment on intention to leave using multilevel techniques. Also, differences between intentions to leave the current workplace or to leave the profession entirely have rarely been studied. The aim of the current study was to investigate how aspects of the nurse practice environment and satisfaction with work schedule flexibility measured at different organisational levels influenced the intention to leave the profession or the workplace due to dissatisfaction. Multilevel models were fitted using survey data from the RN4CAST project, which has a multi-country, multilevel, cross-sectional design. The data analysed here are based on a sample of 23,076 registered nurses from 2020 units in 384 hospitals in 10 European countries (overall response rate: 59.4%). Four levels were available for analyses: country, hospital, unit, and individual registered nurse. Practice environment and satisfaction with schedule flexibility were aggregated and studied at the unit level. Gender, experience as registered nurse, full vs. part-time work, as well as individual deviance from unit mean in practice environment and satisfaction with work schedule flexibility, were included at the individual level. Both intention to leave the profession and the hospital due to dissatisfaction were studied. Regarding intention to leave current workplace, there is variability at both country (6.9%) and unit (6.9%) level. However, for intention to leave the profession we found less variability at the country (4.6%) and unit level (3.9%). Intention to leave the workplace was strongly related to unit level variables. Additionally, individual characteristics and deviance from unit mean regarding practice environment and satisfaction with schedule flexibility were

Randomized controlled trial of RTS,S/AS02D and RTS,S/AS01E malaria candidate vaccines given according to different schedules in Ghanaian children.

Directory of Open Access Journals (Sweden)

Seth Owusu-Agyei

2009-10-01

Full Text Available The target delivery channel of RTS,S candidate malaria vaccines in malaria-endemic countries in Africa is the World Health Organisation Expanded Program on Immunization. As an Adjuvant System, age de-escalation and schedule selection step, this study assessed 3 schedules of RTS,S/AS01(E and RTS,S/AS02(D in infants and young children 5-17 months of age in Ghana.A Phase II, partially-blind randomized controlled study (blind to vaccine, not to schedule, of 19 months duration was conducted in two (2 centres in Ghana between August 2006 and May 2008. Subjects were allocated randomly (1:1:1:1:1:1 to one of six study groups at each study site, each defining which vaccine should be given and by which schedule (0,1-, 0,1,2- or 0,1,7-months. For the 0,1,2-month schedule participants received RTS,S/AS01(E or rabies vaccine at one center and RTS,S/AS01(E or RTS,S/AS02(D at the other. For the other schedules at both study sites, they received RTS,S/AS01(E or RTS,S/AS02(D. The primary outcome measure was the occurrence of serious adverse events until 10 months post dose 1.The number of serious adverse events reported across groups was balanced. One child had a simple febrile convulsion, which evolved favourably without sequelae, considered to be related to RTS,S/AS01(E vaccination. Low grade reactions occurred slightly more frequently in recipients of RTS,S/AS than rabies vaccines; grade 3 reactions were infrequent. Less local reactogenicity occurred with RTS,S/AS01(E than RTS,S/AS02(D. Both candidate vaccines were highly immunogenic for anti-circumsporozoite and anti-Hepatitis B Virus surface antigen antibodies. Recipients of RTS,S/AS01(E compared to RTS,S/AS02(D had higher peak anti-circumsporozoite antibody responses for all 3 schedules. Three dose schedules were more immunogenic than 2 dose schedules. Area under the curve analyses for anti-circumsporozoite antibodies were comparable between the 0,1,2- and 0,1,7-month RTS,S/AS01(E schedules.Both candidate

Trustable Virtual Machine Scheduling in a Cloud

OpenAIRE

Hermenier , Fabien; Henrio , Ludovic

2017-01-01

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

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.

A case study: the initiative to improve RN scheduling at Hamilton Health Sciences.

Science.gov (United States)

Wallace, Laurel-Anne; Pierson, Sharon

2008-01-01

In 2003, Hamilton Health Sciences embarked on an initiative to improve and standardize nursing schedules and scheduling practices. The scheduling project was one of several initiatives undertaken by a corporate-wide Nursing Resource Group established to enhance the work environment and patient care and to ensure appropriate utilization of nursing resources across the organization's five hospitals. This article focuses on major activities undertaken in the scheduling initiative. The step-by-step approach described, plus examples of the scheduling resources developed and samples of extended-tour schedules, will all provide insight, potential strategies and practical help for nursing administrators, human resources (HR) personnel and others interested in improving nurse scheduling.

ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS

Directory of Open Access Journals (Sweden)

Alexey S. Dobrynin

2014-01-01

Full Text Available Tasks of time-schedule construction (JSSP in various fields of human activities have an important theoretical and practical significance. The main feature of these tasks is a timing requirement, describing allowed planning time periods and periods of downtime. This article describes implementation variations of the work scheduling algorithm under timing requirements for the tasks of industrial time-schedules construction, and service activities.

Patient safety, resident well-being and continuity of care with different resident duty schedules in the intensive care unit: a randomized trial.

Science.gov (United States)

Parshuram, Christopher S; Amaral, Andre C K B; Ferguson, Niall D; Baker, G Ross; Etchells, Edward E; Flintoft, Virginia; Granton, John; Lingard, Lorelei; Kirpalani, Haresh; Mehta, Sangeeta; Moldofsky, Harvey; Scales, Damon C; Stewart, Thomas E; Willan, Andrew R; Friedrich, Jan O

2015-03-17

Shorter resident duty periods are increasingly mandated to improve patient safety and physician well-being. However, increases in continuity-related errors may counteract the purported benefits of reducing fatigue. We evaluated the effects of 3 resident schedules in the intensive care unit (ICU) on patient safety, resident well-being and continuity of care. Residents in 2 university-affiliated ICUs were randomly assigned (in 2-month rotation-blocks from January to June 2009) to in-house overnight schedules of 24, 16 or 12 hours. The primary patient outcome was adverse events. The primary resident outcome was sleepiness, measured by the 7-point Stanford Sleepiness Scale. Secondary outcomes were patient deaths, preventable adverse events, and residents' physical symptoms and burnout. Continuity of care and perceptions of ICU staff were also assessed. We evaluated 47 (96%) of 49 residents, all 971 admissions, 5894 patient-days and 452 staff surveys. We found no effect of schedule (24-, 16- or 12-h shifts) on adverse events (81.3, 76.3 and 78.2 events per 1000 patient-days, respectively; p = 0.7) or on residents' sleepiness in the daytime (mean rating 2.33, 2.61 and 2.30, respectively; p = 0.3) or at night (mean rating 3.06, 2.73 and 2.42, respectively; p = 0.2). Seven of 8 preventable adverse events occurred with the 12-hour schedule (p = 0.1). Mortality rates were similar for the 3 schedules. Residents' somatic symptoms were more severe and more frequent with the 24-hour schedule (p = 0.04); however, burnout was similar across the groups. ICU staff rated residents' knowledge and decision-making worst with the 16-hour schedule. Our findings do not support the purported advantages of shorter duty schedules. They also highlight the trade-offs between residents' symptoms and multiple secondary measures of patient safety. Further delineation of this emerging signal is required before widespread system change. ClinicalTrials.gov, no. NCT00679809. © 2015 Canadian Medical

Survey Email Scheduling and Monitoring in eRCTs (SESAMe): A Digital Tool to Improve Data Collection in Randomized Controlled Clinical Trials.

Science.gov (United States)

Skonnord, Trygve; Steen, Finn; Skjeie, Holgeir; Fetveit, Arne; Brekke, Mette; Klovning, Atle

2016-11-22

Electronic questionnaires can ease data collection in randomized controlled trials (RCTs) in clinical practice. We found no existing software that could automate the sending of emails to participants enrolled into an RCT at different study participant inclusion time points. Our aim was to develop suitable software to facilitate data collection in an ongoing multicenter RCT of low back pain (the Acuback study). For the Acuback study, we determined that we would need to send a total of 5130 emails to 270 patients recruited at different centers and at 19 different time points. The first version of the software was tested in a pilot study in November 2013 but was unable to deliver multiuser or Web-based access. We resolved these shortcomings in the next version, which we tested on the Web in February 2014. Our new version was able to schedule and send the required emails in the full-scale Acuback trial that started in March 2014. The system architecture evolved through an iterative, inductive process between the project study leader and the software programmer. The program was tested and updated when errors occurred. To evaluate the development of the software, we used a logbook, a research assistant dialogue, and Acuback trial participant queries. We have developed a Web-based app, Survey Email Scheduling and Monitoring in eRCTs (SESAMe), that monitors responses in electronic surveys and sends reminders by emails or text messages (short message service, SMS) to participants. The overall response rate for the 19 surveys in the Acuback study increased from 76.4% (655/857) before we introduced reminders to 93.11% (1149/1234) after the new function (P<.001). Further development will aim at securing encryption and data storage. The SESAMe software facilitates consecutive patient data collection in RCTs and can be used to increase response rates and quality of research, both in general practice and in other clinical trial settings. ©Trygve Skonnord, Finn Steen, Holgeir

Job shop scheduling by local search

NARCIS (Netherlands)

Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

1994-01-01

We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness

A Cluster-Randomized Trial of Restorative Practices: An Illustration to Spur High-Quality Research and Evaluation

Science.gov (United States)

Acosta, Joie D.; Chinman, Matthew; Ebener, Patricia; Phillips, Andrea; Xenakis, Lea; Malone, Patrick S.

2016-01-01

Restorative practices in schools lack rigorous evaluation studies. As an example of rigorous school-based research, this article describes the first randomized control trial of restorative practices to date, the Study of Restorative Practices. It is a 5-year, cluster-randomized controlled trial (RCT) of the Restorative Practices Intervention (RPI)…

Preoperative home-based physical therapy versus usual care to improve functional health of frail older adults scheduled for elective total hip arthroplasty: A pilot randomized controlled trial

NARCIS (Netherlands)

Oosting, E.; Jans, M.P.; Dronkers, J.J.; Naber, R.H.; Dronkers-Landman, C.M.; Appelman-De Vries, S.M.; Meeteren, N.L. van

2012-01-01

Preoperative home-based physical therapy versus usual care to improve functional health of frail older adults scheduled for elective total hip arthroplasty: a pilot randomized controlled trial. Objective: To investigate the feasibility and preliminary effectiveness of a home-based intensive exercise

Estrutura de prática e idade no processo adaptativo da aprendizagem de uma tarefa de "timing" coincidente Practice schedule and age on the adaptive process of the coincident timing task learning

Directory of Open Access Journals (Sweden)

Lucia Afonso Gonçalves

2010-12-01

Full Text Available O objetivo desse estudo foi investigar os efeitos de diferentes estruturas de prática no processo adaptativo da aprendizagem de uma tarefa de "timing" coincidente em função da idade. Crianças (n = 40, adultos (n = 47 e idosos (n = 57 foram distribuídos em grupos de prática constante, aleatória, constante-aleatória e aleatória-constante. A tarefa consistiu consistia em tocar certos alvos de forma sequencial em integração a um estímulo visual. O delineamento envolveu duas fases de aprendizagem: estabilização e adaptação. Os dados foram analisados em relação aos erros absoluto, variável, constante e de execução. Os resultados mostraram que o processo adaptativo na aprendizagem de crianças, adultos e idosos de uma tarefa de "timing" coincidente foi mais beneficiado pela prática constante-aleatória.The objective of this study was to investigate the effects of different practice schedules on the adaptive process of a coincident timing task learning in function of age. Children (n = 40, adults (n = 47 and elderly (n = 57 were distributed into constant, random, constant-random and random-constant practice groups. The task consisted of touching response keys sequentially in conjunction with a visual stimulus. The experimental design was consisted of two learning phases: stabilization and adaptation. The data were analyzed in terms of absolute, variable, constant and execution errors. The results showed that the constant-random practice was the most efficient for the adaptive process in learning a coincident timing task regardless of the age group.

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

Solving Large Scale Crew Scheduling Problems in Practice

NARCIS (Netherlands)

E.J.W. Abbink (Erwin); L. Albino; T.A.B. Dollevoet (Twan); D. Huisman (Dennis); J. Roussado; R.L. Saldanha

2010-01-01

textabstractThis paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of guards. Some labor rules restrict the duties of a certain crew base

An Improved Recovery Algorithm for Decayed AES Key Schedule Images

Science.gov (United States)

Tsow, Alex

A practical algorithm that recovers AES key schedules from decayed memory images is presented. Halderman et al. [1] established this recovery capability, dubbed the cold-boot attack, as a serious vulnerability for several widespread software-based encryption packages. Our algorithm recovers AES-128 key schedules tens of millions of times faster than the original proof-of-concept release. In practice, it enables reliable recovery of key schedules at 70% decay, well over twice the decay capacity of previous methods. The algorithm is generalized to AES-256 and is empirically shown to recover 256-bit key schedules that have suffered 65% decay. When solutions are unique, the algorithm efficiently validates this property and outputs the solution for memory images decayed up to 60%.

How changes to the Medicare Benefits Schedule could improve the practice of cardiology and save taxpayer money.

Science.gov (United States)

Harper, Richard W; Nasis, Arthur; Sundararajan, Vijaya

2015-09-21

Rising health care costs above inflation are placing serious strains on the sustainability of the Australian Medicare system in its current structure. The Medicare Benefits Schedule (MBS), which lists rebates payable to patients for private medical services provided on a fee-for-service basis, is the cornerstone of the Australian health care system. Introduced in the 1980s, the MBS has changed little despite major advances in the evidence base for the practice of cardiology. We outline how we believe sensible changes to the MBS listings for four cardiac services--invasive coronary angiography, computed tomography coronary angiography, stress testing and percutaneous coronary intervention--would improve the clinical practice of cardiology and save substantial amounts of taxpayer money.

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.

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.

Reliable gain-scheduled control of discrete-time systems and its application to CSTR model

Science.gov (United States)

Sakthivel, R.; Selvi, S.; Mathiyalagan, K.; Shi, Y.

2016-10-01

This paper is focused on reliable gain-scheduled controller design for a class of discrete-time systems with randomly occurring nonlinearities and actuator fault. Further, the nonlinearity in the system model is assumed to occur randomly according to a Bernoulli distribution with measurable time-varying probability in real time. The main purpose of this paper is to design a gain-scheduled controller by implementing a probability-dependent Lyapunov function and linear matrix inequality (LMI) approach such that the closed-loop discrete-time system is stochastically stable for all admissible randomly occurring nonlinearities. The existence conditions for the reliable controller is formulated in terms of LMI constraints. Finally, the proposed reliable gain-scheduled control scheme is applied on continuously stirred tank reactor model to demonstrate the effectiveness and applicability of the proposed design technique.

Joint optimization of production scheduling and machine group preventive maintenance

International Nuclear Information System (INIS)

Xiao, Lei; Song, Sanling; Chen, Xiaohui; Coit, David W.

2016-01-01

Joint optimization models were developed combining group preventive maintenance of a series system and production scheduling. In this paper, we propose a joint optimization model to minimize the total cost including production cost, preventive maintenance cost, minimal repair cost for unexpected failures and tardiness cost. The total cost depends on both the production process and the machine maintenance plan associated with reliability. For the problems addressed in this research, any machine unavailability leads to system downtime. Therefore, it is important to optimize the preventive maintenance of machines because their performance impacts the collective production processing associated with all machines. Too lengthy preventive maintenance intervals may be associated with low scheduled machine maintenance cost, but may incur expensive costs for unplanned failure due to low machine reliability. Alternatively, too frequent preventive maintenance activities may achieve the desired high reliability machines, but unacceptably high scheduled maintenance cost. Additionally, product scheduling plans affect tardiness and maintenance cost. Two results are obtained when solving the problem; the optimal group preventive maintenance interval for machines, and the assignment of each job, including the corresponding start time and completion time. To solve this non-deterministic polynomial-time problem, random keys genetic algorithms are used, and a numerical example is solved to illustrate the proposed model. - Highlights: • Group preventive maintenance (PM) planning and production scheduling are jointed. • Maintenance interval and assignment of jobs are decided by minimizing total cost. • Relationships among system age, PM, job processing time are quantified. • Random keys genetic algorithms (GA) are used to solve the NP-hard problem. • Random keys GA and Particle Swarm Optimization (PSO) are compared.

A Practical Framework to Study Low-Power Scheduling Algorithms on Real-Time and Embedded Systems

Directory of Open Access Journals (Sweden)

Jian (Denny Lin

2014-05-01

Full Text Available With the advanced technology used to design VLSI (Very Large Scale Integration circuits, low-power and energy-efficiency have played important roles for hardware and software implementation. Real-time scheduling is one of the fields that has attracted extensive attention to design low-power, embedded/real-time systems. The dynamic voltage scaling (DVS and CPU shut-down are the two most popular techniques used to design the algorithms. In this paper, we firstly review the fundamental advances in the research of energy-efficient, real-time scheduling. Then, a unified framework with a real Intel PXA255 Xscale processor, namely real-energy, is designed, which can be used to measure the real performance of the algorithms. We conduct a case study to evaluate several classical algorithms by using the framework. The energy efficiency and the quantitative difference in their performance, as well as the practical issues found in the implementation of these algorithms are discussed. Our experiments show a gap between the theoretical and real results. Our framework not only gives researchers a tool to evaluate their system designs, but also helps them to bridge this gap in their future works.

Integrated multi-resource planning and scheduling in engineering project

Directory of Open Access Journals (Sweden)

Samer Ben Issa

2017-01-01

Full Text Available Planning and scheduling processes in project management are carried out sequentially in prac-tice, i.e. planning project activities first without visibility of resource limitation, and then schedul-ing the project according to these pre-planned activities. This is a need to integrate these two pro-cesses. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called “the Minimum Moments of Resources Required around X-Y axes (MMORR”, we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates

Directory of Open Access Journals (Sweden)

Rui Zhang

2013-01-01

Full Text Available We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs, while the second part is related with the setting of machine speeds. Therefore, the decision variables include both the production schedule (sequences of jobs and the production rate of each machine. The optimization process, however, is significantly complicated by the stochastic factors in the manufacturing system. To address the difficulty, a simulation-based three-stage optimization framework is presented in this paper for high-quality robust solutions to the integrated scheduling problem. The first stage (crude optimization is featured by the ordinal optimization theory, the second stage (finer optimization is implemented with a metaheuristic called differential evolution, and the third stage (fine-tuning is characterized by a perturbation-based local search. Finally, computational experiments are conducted to verify the effectiveness of the proposed approach. Sensitivity analysis and practical implications are also discussed.

A Metaheuristic Scheduler for Time Division Multiplexed Network-on-Chip

DEFF Research Database (Denmark)

Sørensen, Rasmus Bo; Sparsø, Jens; Pedersen, Mark Ruvald

2014-01-01

significant practical implications, is the minimization of the TDM schedule period by over-provisioning bandwidth to connections with the smallest bandwidth requirements. Our results show that this is possible with only negligible impact on the schedule period. We evaluate the scheduler with seven different...... applications from the MCSL NOC benchmark suite. In the special case of all-to-all communication with equal bandwidths on all communication channels, we obtain schedules with a shorter period than reported in previous work....

Bridging the Gap Between Planning and Scheduling

Science.gov (United States)

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

2000-01-01

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

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.

Filling the Holes: Work Schedulers as Job Crafters of Employment Practice in Long-Term Health Care

Science.gov (United States)

Kossek, Ellen Ernst; Piszczek, Matthew M.; Mcalpine, Kristie L.; Hammer, Leslie B.; Burke, Lisa

2016-01-01

Although work schedulers serve an organizational role influencing decisions about balancing conflicting stakeholder interests over schedules and staffing, scheduling has primarily been described as an objective activity or individual job characteristic. The authors use the lens of job crafting to examine how schedulers in 26 health care facilities enact their roles as they “fill holes” to schedule workers. Qualitative analysis of interview data suggests that schedulers expand their formal scope and influence to meet their interpretations of how to manage stakeholders (employers, workers, and patients). The authors analyze variations in the extent of job crafting (cognitive, physical, relational) to broaden role repertoires. They find evidence that some schedulers engage in rule-bound interpretation to avoid role expansion. They also identify four types of schedulers: enforcers, patient-focused schedulers, employee-focused schedulers, and balancers. The article adds to the job-crafting literature by showing that job crafting is conducted not only to create meaningful work but also to manage conflicting demands and to mediate among the competing labor interests of workers, clients, and employers. PMID:27721517

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.

The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

Science.gov (United States)

Shinn, Stephen A.; Bryson, Jonathan; Klein, Gerald; Lunz-Ruark, Val; Majerowicz, Walt; McKeever, J.; Nair, Param

2016-01-01

Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

Approximating multi-objective scheduling problems

NARCIS (Netherlands)

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

2013-01-01

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

7 CFR 29.9404 - Marketing area opening dates and marketing schedules.

Science.gov (United States)

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Marketing area opening dates and marketing schedules... MARKETING SERVICE (Standards, Inspections, Marketing Practices), DEPARTMENT OF AGRICULTURE COMMODITY....9404 Marketing area opening dates and marketing schedules. (a) The Flue-Cured Tobacco Advisory...

Quantity and quality assessment of randomized controlled trials on orthodontic practice in PubMed.

Science.gov (United States)

Shimada, Tatsuo; Takayama, Hisako; Nakamura, Yoshiki

2010-07-01

To find current high-quality evidence for orthodontic practice within a reasonable time, we tested the performance of a PubMed search. PubMed was searched using publication type randomized controlled trial and medical subject heading term "orthodontics" for articles published between 2003 and 2007. The PubMed search results were compared with those from a hand search of four orthodontic journals to determine the sensitivity of PubMed search. We evaluated the precision of the PubMed search result and assessed the quality of individual randomized controlled trials using the Jadad scale. Sensitivity and precision were 97.46% and 58.12%, respectively. In PubMed, of the 277 articles retrieved, 161 (58.12%) were randomized controlled trials on orthodontic practice, and 115 of the 161 articles (71.42%) were published in four orthodontic journals: American Journal of Orthodontics and Dentofacial Orthopedics, The Angle Orthodontist, the European Journal of Orthodontics, and the Journal of Orthodontics. Assessment by the Jadad scale revealed 60 high-quality randomized controlled trials on orthodontic practice, of which 45 (75%) were published in these four journals. PubMed is a highly desirable search engine for evidence-based orthodontic practice. To stay current and get high-quality evidence, it is reasonable to look through four orthodontic journals: American Journal of Orthodontics and Dentofacial Orthopedics, The Angle Orthodontist, the European Journal of Orthodontics, and the Journal of Orthodontics.

Responsive versus scheduled feeding in preterm infants (Review)

OpenAIRE

Watson, Julie; McGuire, William

2015-01-01

Scheduled feeding of prescribed enteral volumes remains standard practice for preterm infants. However, feeding preterm infants in response to their feeding and satiation cues (responsive, cue-based, or infant led feeding) rather than at scheduled intervals might enhance parent experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge.\\ud \\ud Objectives: To assess the effect of feeding pr...

Optimal joint scheduling of electrical and thermal appliances in a smart home environment

International Nuclear Information System (INIS)

Shirazi, Elham; Zakariazadeh, Alireza; Jadid, Shahram

2015-01-01

Highlights: • Thermal appliances are scheduled based on desired temperature and energy prices. • A discomfort index has been introduced within the home energy scheduling model. • Appliances are scheduled based on activity probability and desired options. • Starting probability depends on the social random factor and consumption behavior. - Abstract: With the development of home area network, residents have the opportunity to schedule their power usage in the home by themselves aiming at reducing electricity expenses. Moreover, as renewable energy sources are deployed in home, a home energy management system needs to consider both energy consumption and generation simultaneously to minimize the energy cost. In this paper, a smart home energy management model has been presented in which electrical and thermal appliances are jointly scheduled. The proposed method aims at minimizing the electricity cost of a residential customer by scheduling various type of appliances considering the residents consumption behavior, seasonal probability, social random factor, discomfort index and appliances starting probability functions. In this model, the home central controller receives the electricity price information, environmental factors data as well as the resident desired options in order to optimally schedule appliances including electrical and thermal. The scheduling approach is tested on a typical home including variety of home appliances, a small wind turbine, photovoltaic panel, combined heat and power unit, boiler and electrical and thermal storages over a 24-h period. The results show that the scheduling of different appliances can be reached simultaneously by using the proposed formulation. Moreover, simulation results evidenced that the proposed home energy management model exhibits a lower cost and, therefore, is more economical.

Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach

Directory of Open Access Journals (Sweden)

Aidin Delgoshaei

2016-09-01

Full Text Available Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.

BINARY PARTICLE SWARM OPTIMIZATION APPROACH FOR RANDOM GENERATION OUTAGE MAINTENANCE SCHEDULING

Directory of Open Access Journals (Sweden)

K. Suresh

2013-01-01

Full Text Available This paper presents a methodology for maintenance scheduling (MS of generators using binary particle swarm optimization (BPSO based probabilistic approach. The objective of this paper is to reduce the loss of load probability (LOLP for a power system. The capacity outage probability table (COPT is the initial step in creating maintenance schedule using the probabilistic levelized risk method. This paper proposes BPSO method which is used to construct the COPT. In order to mitigate the effects of probabilistic levelized risk method, BPSO based probabilistic levelized risk method is embarked on a MS problem. In order to validate the effectiveness of the proposed algorithm, case study results for simple five unit system can accomplish a significant levelization in the reliability indices that make possible to evaluate system generation system adequacy in the MS horizon of the power system. The proposed method shows better performance compared with other optimization methods and conventional method with improved search performance.

Relay-aided multi-cell broadcasting with random network coding

DEFF Research Database (Denmark)

Lu, Lu; Sun, Fan; Xiao, Ming

2010-01-01

We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling...

Hepatitis B vaccination in prison with a 3-week schedule is more efficient than the standard 6-month schedule

DEFF Research Database (Denmark)

Christensen, Peer B; Fisker, Niels; Krarup, Henrik B

2004-01-01

A randomized study of injecting drug users in a Danish prison comparing vaccination at 0, 1 and 3 weeks with the 0, 1 and 6 months schedule (20microg Engerix B i.m.) was conducted. Due to a low participation rate, a second nonrandomized study was conducted in Estonia where all prisoners were vacc...

Direct block scheduling technology: Analysis of Avidity

Directory of Open Access Journals (Sweden)

Felipe Ribeiro Souza

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

Influence of titration schedule and maintenance dose on the tolerability of adjunctive eslicarbazepine acetate: An integrated analysis of three randomized placebo-controlled trials.

Science.gov (United States)

Krauss, Gregory; Biton, Victor; Harvey, Jay H; Elger, Christian; Trinka, Eugen; Soares da Silva, Patrício; Gama, Helena; Cheng, Hailong; Grinnell, Todd; Blum, David

2018-01-01

To examine the influence of titration schedule and maintenance dose on the incidence and type of treatment-emergent adverse events (TEAEs) associated with adjunctive eslicarbazepine acetate (ESL). Data from three randomized, double-blind, placebo-controlled trials were analyzed. Patients with refractory partial-onset seizures were randomized to maintenance doses of ESL 400, 800, or 1200mg QD (dosing was initiated at 400 or 800mg QD) or placebo. The incidence of TEAEs was analyzed during the double-blind period (2-week titration phase; 12-week maintenance phase), according to the randomized maintenance dose and the titration schedule. 1447 patients were included in the analysis. During the first week of treatment, 62% of patients taking ESL 800mg QD had ≥1 TEAE, vs 35% of those taking 400mg QD and 32% of the placebo group; dizziness, somnolence, nausea, and headache were numerically more frequent in patients taking ESL 800mg than those taking ESL 400mg QD. During the double-blind period, the incidences of common TEAEs were lower in patients who initiated ESL at 400mg vs 800mg QD. For the 800 and 1200mg QD maintenance doses, rates of TEAEs leading to discontinuation were lower in patients who began treatment with 400mg than in those who began taking ESL 800mg QD. Initiation of ESL at 800mg QD is feasible. However, initiating treatment with ESL 400mg QD for 1 or 2 weeks is recommended, being associated with a lower incidence of TEAEs, and related discontinuations. For some patients, treatment may be initiated at 800mg QD, if the need for more immediate seizure reduction outweighs concerns about increased risk of adverse reactions during initiation. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

Scheduling Aircraft Landings under Constrained Position Shifting

Science.gov (United States)

Balakrishnan, Hamsa; Chandran, Bala

2006-01-01

Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling.

Science.gov (United States)

Li, Bin-Bin; Wang, Ling

2007-06-01

This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.

Homework schedule: an important factor associated with shorter sleep duration among Chinese school-aged children.

Science.gov (United States)

Li, Shenghui; Yang, Qian; Chen, Zhe; Jin, Xingming; Jiang, Fan; Shen, Xiaoming

2014-09-03

This study was designed to examine the hypothesis that homework schedule has adverse impacts on Chinese children's sleep-wake habits and sleep duration. A random sample of 19,299 children aged 5.08 to 11.99 years old participated in a large, cross-sectional survey. A parent-administered questionnaire was completed to quantify children's homework schedule and sleep behaviors. Generally, it was demonstrated that more homework schedule was significantly associated with later bedtime, later wake time, and shorter sleep duration. Among all sleep variables, bedtime and sleep duration during weekdays appeared to be most affected by homework schedule, especially homework schedule during weekdays.

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

Manufacturing scheduling systems an integrated view on models, methods and tools

CERN Document Server

Framinan, Jose M; Ruiz García, Rubén

2014-01-01

The book is devoted to the problem of manufacturing scheduling, which is the efficient allocation of jobs (orders) over machines (resources) in a manufacturing facility. It offers a comprehensive and integrated perspective on the different aspects required to design and implement systems to efficiently and effectively support manufacturing scheduling decisions. Obtaining economic and reliable schedules constitutes the core of excellence in customer service and efficiency in manufacturing operations. Therefore, scheduling forms an area of vital importance for competition in manufacturing companies. However, only a fraction of scheduling research has been translated into practice, due to several reasons. First, the inherent complexity of scheduling has led to an excessively fragmented field in which different sub problems and issues are treated in an independent manner as goals themselves, therefore lacking a unifying view of the scheduling problem. Furthermore, mathematical brilliance and elegance has sometime...

Practical Experiences With Torque Meta-Scheduling In The Czech National Grid

Directory of Open Access Journals (Sweden)

Simon Toth

2012-01-01

Full Text Available The Czech National Grid Infrastructure went through a complex transition inthe last year. The production environment has been switched from a commercialbatch system PBSPro, which was replaced by an open source alternative Torquebatch system.This paper concentrates on two aspects of this transition. First, we will presentour practical experience with Torque being used as a production ready batchsystem. Our modified version of Torque, with all the necessary PBSPro ex-clusive features re-implemented and further extended with new features likecloud-like behaviour, was deployed across the entire production environment,covering the entire Czech Republic for almost a full year.In the second part, we will present our work on meta-scheduling. This in-volves our work on distributed architecture and cloud-grid convergence. Thedistributed architecture was designed to overcome the limitations of a centralserver setup, which was originally used and presented stability and performanceissues. While this paper does not discuss the inclusion of cloud interfaces intogrids, it does present the dynamic infrastructure, which is a requirement forsharing the grid infrastructure between a batch system and a cloud gateway.We are also inviting everyone to try out our fork of the Torque batch system,which is now publicly available.

Evaluation of dose reduction versus standard dosing for maintenance of remission in patients with spondyloarthritis and clinical remission with anti-TNF (REDES-TNF): study protocol for a randomized controlled trial.

Science.gov (United States)

Pontes, Caridad; Gratacós, Jordi; Torres, Ferran; Avendaño, Cristina; Sanz, Jesús; Vallano, Antoni; Juanola, Xavier; de Miguel, Eugenio; Sanmartí, Raimon; Calvo, Gonzalo

2015-08-20

Dose reduction schedules of tumor necrosis factor antagonists (anti-TNF) as maintenance therapy in patients with spondyloarthritis are used empirically in clinical practice, despite the lack of clinical trials providing evidence for this practice. To address this issue the Spanish Society of Rheumatology (SER) and Spanish Society of Clinical Pharmacology (SEFC) designed a 3-year multicenter, randomized, open-label, controlled clinical trial (2 years for inclusion and 1 year of follow-up). The study is expected to include 190 patients with axial spondyloarthritis on stable maintenance treatment (≥4 months) with any anti-TNF agent at doses recommended in the summary of product characteristics. Patients will be randomized to either a dose reduction arm or maintenance of the dosing regimen as per the official labelling recommendations. Randomization will be stratified according to the anti-TNF agent received before study inclusion. Patient follow-up, visit schedule, and examinations will be maintained as per normal clinical practice recommendations according to SER guidelines. The study aims to test the hypothesis of noninferiority of the dose reduction strategy compared with standard treatment. The first patients were recruited in July 2012, and study completion is scheduled for the end of April 2015. The REDES-TNF study is a pragmatic clinical trial that aims to provide evidence to support a medical decision now made empirically. The study results may help inform clinical decisions relevant to both patients and healthcare decision makers. EudraCT 2011-005871-18 (21 December 2011).

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System

Directory of Open Access Journals (Sweden)

Litian Duan

2016-11-01

Full Text Available In the multiple-reader environment (MRE of radio frequency identification (RFID system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range.

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)

Effectiveness in practice-based research: Looking for alternatives to the randomized controlled trial (RCT)

NARCIS (Netherlands)

Tavecchio, L.

2015-01-01

Over the last decade, the status of the randomized controlled trial (RCT), hallmark of evidence-based medicine (research), has been growing strongly in general practice, social work and public health. But this type of research is only practicable under strictly controlled and well-defined settings

Randomized Phase III Noninferiority Study Comparing Two Radiotherapy Fractionation Schedules in Patients With Low-Risk Prostate Cancer

Science.gov (United States)

Dignam, James J.; Amin, Mahul B.; Bruner, Deborah W.; Low, Daniel; Swanson, Gregory P.; Shah, Amit B.; D’Souza, David P.; Michalski, Jeff M.; Dayes, Ian S.; Seaward, Samantha A.; Hall, William A.; Nguyen, Paul L.; Pisansky, Thomas M.; Faria, Sergio L.; Chen, Yuhchyau; Koontz, Bridget F.; Paulus, Rebecca; Sandler, Howard M.

2016-01-01

Purpose Conventional radiotherapy (C-RT) treatment schedules for patients with prostate cancer typically require 40 to 45 treatments that take place from > 8 to 9 weeks. Preclinical and clinical research suggest that hypofractionation—fewer treatments but at a higher dose per treatment—may produce similar outcomes. This trial was designed to assess whether the efficacy of a hypofractionated radiotherapy (H-RT) treatment schedule is no worse than a C-RT schedule in men with low-risk prostate cancer. Patients and Methods A total of 1,115 men with low-risk prostate cancer were randomly assigned 1:1 to C-RT (73.8 Gy in 41 fractions over 8.2 weeks) or to H-RT (70 Gy in 28 fractions over 5.6 weeks). This trial was designed to establish (with 90% power and an α of .05) that treatment with H-RT results in 5-year disease-free survival (DFS) that is not worse than C-RT by more than 7.65% (H-RT/C-RT hazard ratio [HR] < 1.52). Results A total of 1,092 men were protocol eligible and had follow-up information; 542 patients were assigned to C-RT and 550 to H-RT. Median follow-up was 5.8 years. Baseline characteristics were not different according to treatment assignment. The estimated 5-year DFS was 85.3% (95% CI, 81.9 to 88.1) in the C-RT arm and 86.3% (95% CI, 83.1 to 89.0) in the H-RT arm. The DFS HR was 0.85 (95% CI, 0.64 to 1.14), and the predefined noninferiority criterion that required that DFS outcomes be consistent with HR < 1.52 was met (P < .001). Late grade 2 and 3 GI and genitourinary adverse events were increased (HR, 1.31 to 1.59) in patients who were treated with H-RT. Conclusion In men with low-risk prostate cancer, the efficacy of 70 Gy in 28 fractions over 5.6 weeks is not inferior to 73.8 Gy in 41 fractions over 8.2 weeks, although an increase in late GI/genitourinary adverse events was observed in patients treated with H-RT. PMID:27044935

Making healthy eating and physical activity policy practice: the design and overview of a group randomized controlled trial in afterschool programs.

Science.gov (United States)

Beets, Michael W; Glenn Weaver, R; Turner-McGrievy, Gabrielle; Huberty, Jennifer; Ward, Dianne S; Freedman, Darcy A; Saunders, Ruth; Pate, Russell R; Beighle, Aaron; Hutto, Brent; Moore, Justin B

2014-07-01

National and state organizations have developed policies calling upon afterschool programs (ASPs, 3-6 pm) to serve a fruit or vegetable (FV) each day for snack, while eliminating foods and beverages high in added-sugars, and to ensure children accumulate a minimum of 30 min/d of moderate-to-vigorous physical activity (MVPA). Few efficacious and cost-effective strategies exist to assist ASP providers in achieving these important public health goals. This paper reports on the design and conceptual framework of Making Healthy Eating and Physical Activity (HEPA) Policy Practice in ASPs, a 3-year group randomized controlled trial testing the effectiveness of strategies designed to improve snacks served and increase MVPA in children attending community-based ASPs. Twenty ASPs, serving over 1800 children (6-12 years) will be enrolled and match-paired based on enrollment size, average daily min/d MVPA, and days/week FV served, with ASPs randomized after baseline data collection to immediate intervention or a 1-year delayed group. The framework employed, STEPs (Strategies To Enhance Practice), focuses on intentional programming of HEPA in each ASPs' daily schedule, and includes a grocery store partnership to reduce price barriers to purchasing FV, professional development training to promote physical activity to develop core physical activity competencies, as well as ongoing technical support/assistance. Primary outcome measures include children's accelerometry-derived MVPA and time spend sedentary while attending an ASP, direct observation of staff HEPA promoting and inhibiting behaviors, types of snacks served, and child consumption of snacks, as well as, cost of snacks via receipts and detailed accounting of intervention delivery costs to estimate cost-effectiveness. Copyright © 2014 Elsevier Inc. All rights reserved.

Making Healthy Eating and Physical Activity Policy Practice: The Design and Overview of a Group Randomized Controlled Trial in Afterschool Programs

Science.gov (United States)

Beets, Michael W.; Weaver, R. Glenn; Turner-McGrievy, Gabrielle; Huberty, Jennifer; Ward, Dianne S.; Freedman, Darcy A.; Saunders, Ruth; Pate, Russell R.; Beighle, Aaron; Moore, Justin B.

2014-01-01

National and state organizations have developed policies calling upon afterschool programs (ASPs, 3-6pm) to serve a fruit or vegetable (FV) each day for snack, while eliminating foods and beverages high in added-sugars, and to ensure children accumulate a minimum of 30 min/d of moderate-to-vigorous physical activity (MVPA). Few efficacious and cost-effective strategies exist to assist ASP providers in achieving these important public health goals. This paper reports on the design and conceptual framework of Making Healthy Eating and Physical Activity (HEPA) Policy Practice in ASPs, a 3-year group randomized controlled trial testing the effectiveness of strategies designed to improve snacks served and increase MVPA in children attending community-based ASPs. Twenty ASPs, serving over 1,800 children (6-12yrs) will be enrolled and match-paired based on enrollment size, average daily min/d MVPA, and days/week FV served, with ASPs randomized after baseline data collection to immediate intervention or a 1-year delayed group. The framework employed, STEPs (Strategies To Enhance Practice), focuses on intentional programming of HEPA in each ASPs’ daily schedule, and includes a grocery store partnership to reduce price barriers to purchasing FV, professional development training to promote physical activity to develop core physical activity competencies, as well as ongoing technical support/assistance. Primary outcome measures include children’s accelerometry-derived MVPA and time spend sedentary while attending an ASP, direct observation of staff HEPA promoting and inhibiting behaviors, types of snacks served, and child consumption of snacks, as well as, cost of snacks via receipts and detailed accounting of intervention delivery costs to estimate cost-effectiveness. PMID:24893225

A bi-criteria M-machine SDST flow shop scheduling using modified ...

African Journals Online (AJOL)

user

In the present work, a modified heuristic based genetic algorithm ..... Due to the large search space in flow shop scheduling, it is expected that random generation ..... ergonomics, anthropometry, inventory management and quality control etc.

CellSs: Scheduling Techniques to Better Exploit Memory Hierarchy

Directory of Open Access Journals (Sweden)

Pieter Bellens

2009-01-01

Full Text Available Cell Superscalar's (CellSs main goal is to provide a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E. that automatically exploits the inherent concurrency of the applications at a task level. The CellSs environment is based on a source-to-source compiler that translates annotated C or Fortran code and a runtime library tailored for the Cell/B.E. that takes care of the concurrent execution of the application. The first efforts for task scheduling in CellSs derived from very simple heuristics. This paper presents new scheduling techniques that have been developed for CellSs for the purpose of improving an application's performance. Additionally, the design of a new scheduling algorithm is detailed and the algorithm evaluated. The CellSs scheduler takes an extension of the memory hierarchy for Cell/B.E. into account, with a cache memory shared between the SPEs. All new scheduling practices have been evaluated showing better behavior of our system.

STATISTICAL LANDMARKS AND PRACTICAL ISSUES REGARDING THE USE OF SIMPLE RANDOM SAMPLING IN MARKET RESEARCHES

Directory of Open Access Journals (Sweden)

CODRUŢA DURA

2010-01-01

Full Text Available The sample represents a particular segment of the statistical populationchosen to represent it as a whole. The representativeness of the sample determines the accuracyfor estimations made on the basis of calculating the research indicators and the inferentialstatistics. The method of random sampling is part of probabilistic methods which can be usedwithin marketing research and it is characterized by the fact that it imposes the requirementthat each unit belonging to the statistical population should have an equal chance of beingselected for the sampling process. When the simple random sampling is meant to be rigorouslyput into practice, it is recommended to use the technique of random number tables in order toconfigure the sample which will provide information that the marketer needs. The paper alsodetails the practical procedure implemented in order to create a sample for a marketingresearch by generating random numbers using the facilities offered by Microsoft Excel.

Job shop scheduling with makespan objective: A heuristic approach

Directory of Open Access Journals (Sweden)

Mohsen Ziaee

2014-04-01

Full Text Available Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem.

Flexible Scheduling May Have a Positive Impact on School Library Circulation. A Review of: Gavigan, K., Pribesh, S., & Dickinson, G. (2010. Fixed or flexible schedule? Schedule impacts and school library circulation. Library and Information Science Research, 32(2, 131-37.

Directory of Open Access Journals (Sweden)

Ann Medaille

2011-03-01

Full Text Available Objective – To determine whether a significant, positive relationship exists between flexible scheduling in elementary school library media centers and per-pupil circulation statistics.Design – Online survey.Setting – Library media centers in public elementary schools in two states of the United States.Subjects – A total of 88 elementary school library media specialists completed the survey.Methods – A 22-question online survey was created using Inquisite software. A link to the survey was sent via e-mail to a 600-person random sample of public school library media specialists whose names were drawn from the memberships of the North Carolina School Library Media Association and the Virginia Educational Media Association, with combined memberships totalling approximately 2,000. A random sample of 600 was chosen to provide a 95% confidence level with a confidence interval of plus or minus three points. The survey included questions about school schedules (flexible, partially flexible, or fixed, collection size, circulation statistics, total student enrolment, school type (elementary, middle, or high, school location (urban, rural, or suburban, percentage of students eligible for free and reduced price lunch, numbers of full-time professional library media specialists employed at the school, access procedures, and library closure information. The survey response rate was 29.3% (176 respondents. Because fixed versus flexible scheduling is an issue that primarily affects elementary schools, the authors further narrowed their subject pool to 88 elementary school respondents. Data were analyzed using SPSS 16.0 statistical software. Correlation analysis, including the analysis of covariance (ANCOVA, was used to compare differences in the three scheduling types and to control for other variables (such as location, socioeconomic status, collection size, staffing, days closed, and others that may affect circulation.Main Results – Of the 88

"What Do I Teach for 90 Minutes?" Creating a Successful Block-Scheduled English Classroom.

Science.gov (United States)

Porter, Carol

The story of the process that Mundelein High School (located in a northwest suburb of Chicago, Illinois) as it moved from a traditional schedule to a block schedule is described throughout this book as a way to blend theory with practice. The book addresses types of block schedules; key issues for effective preparation; professional development…

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

Science.gov (United States)

Zhou, Jing; Dong, Shoubin

2018-06-01

In recent years many heuristic algorithms have been proposed to solve task scheduling problems in the cloud environment owing to their optimization capability. This article proposes a hybrid glowworm swarm optimization (HGSO) based on glowworm swarm optimization (GSO), which uses a technique of evolutionary computation, a strategy of quantum behaviour based on the principle of neighbourhood, offspring production and random walk, to achieve more efficient scheduling with reasonable scheduling costs. The proposed HGSO reduces the redundant computation and the dependence on the initialization of GSO, accelerates the convergence and more easily escapes from local optima. The conducted experiments and statistical analysis showed that in most cases the proposed HGSO algorithm outperformed previous heuristic algorithms to deal with independent tasks.

Robust Optimization-Based Generation Self-Scheduling under Uncertain Price

Directory of Open Access Journals (Sweden)

Xiao Luo

2011-01-01

Full Text Available This paper considers generation self-scheduling in electricity markets under uncertain price. Based on the robust optimization (denoted as RO methodology, a new self-scheduling model, which has a complicated max-min optimization structure, is set up. By using optimal dual theory, the proposed model is reformulated to an ordinary quadratic and quadratic cone programming problems in the cases of box and ellipsoidal uncertainty, respectively. IEEE 30-bus system is used to test the new model. Some comparisons with other methods are done, and the sensitivity with respect to the uncertain set is analyzed. Comparing with the existed uncertain self-scheduling approaches, the new method has twofold characteristics. First, it does not need a prediction of distribution of random variables and just requires an estimated value and the uncertain set of power price. Second, the counterpart of RO corresponding to the self-scheduling is a simple quadratic or quadratic cone programming. This indicates that the reformulated problem can be solved by many ordinary optimization algorithms.

Resource-constrained project scheduling problem: review of past and recent developments

Directory of Open Access Journals (Sweden)

Farhad Habibi

2018-01-01

Full Text Available The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis

OpenAIRE

Shmuel, Ori; Cohen, Asaf; Gurewitz, Omer

2017-01-01

Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyse the system's properties, such as delay, QoS and capacity scaling laws. Specifically, we start with analyzing the performance while \\...

Attitudes, beliefs, and practices regarding electronic nicotine delivery systems in patients scheduled for elective surgery.

Science.gov (United States)

Kadimpati, Sandeep; Nolan, Margaret; Warner, David O

2015-01-01

Smokers are at increased risk of postoperative complications. Electronic nicotine delivery systems (ENDS; or electronic cigarettes) could be a useful tool to reduce harm in the perioperative period. This pilot study examined the attitudes, beliefs, and practices of smokers scheduled for elective surgery regarding ENDS. This was a cross-sectional survey of current cigarette smokers who were evaluated in a preoperative clinic before elective surgery at Mayo Clinic. Measures included demographic characteristics, smoking history, 2 indices assessing the perception of how smoking affected health risks, ENDS use history, and 3 indices assessing interest in, perceived benefits of, and barriers to using ENDS in the perioperative period. Of the 112 smokers who completed the survey, 62 (55%) had tried ENDS and 24 (21%) reported current use. The most commonly stated reason for using ENDS was to quit smoking. Approximately 2 in 3 participants would be willing to use ENDS to help them reduce or eliminate perioperative cigarette use, and similar proportions perceived health benefits of doing so. Of the factors studied, only attempted to quit within the last year was significantly associated with increased interest in the perioperative use of ENDS (P=.03). Compared with participants who had tried ENDS (n=62), those who had never tried ENDS (n=50) had a significantly increased interest in the perioperative use of ENDS. A substantial proportion of patients scheduled for elective surgery had tried ENDS and would consider using ENDS to reduce perioperative use of cigarettes. Copyright © 2015 Mayo Foundation for Medical Education and Research. Published by Elsevier Inc. All rights reserved.

Impact of Spacing of Practice on Learning Brand Name and Generic Drugs.

Science.gov (United States)

Terenyi, James; Anksorus, Heidi; Persky, Adam M

2018-02-01

Objective. To test the impact of schedules of retrieval practice on learning brand and generic name drug information in a self-paced course. Methods. Students completed weekly quizzes on brand and generic name conversions for 100 commonly prescribed drugs. Each student completed part of the drug list on a schedule of equal, expanding, or contracting spacing, one practice (massed) or study only in a partial block design. Results. On measures of long-term retention, the contracting spacing schedule led to superior retention (67%) compared to the massed practice (50%) and study-only condition (46%); contracting practice also was significantly higher than expanding practice (58%,) or equal practice (59%). Overall performance decreased by almost 50% (final exam 95%, long-term retention 55%) over a 6-week period. Conclusion. A contracting spacing schedule was the most effective schedule of practice, and all spacing schedules were superior to massed practice or study-only conditions.

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

Directory of Open Access Journals (Sweden)

Ming Zeng

2017-01-01

Full Text Available The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.

Project scheduling with resources constraints: application in the equipment production for the oil industry; Scheduling de projetos com restricao de recursos: aplicacao na producao de equipamentos para a industria de petroleo

Energy Technology Data Exchange (ETDEWEB)

Cruz, Carolina A.O.; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE)

2008-07-01

One of the essential steps in the main scope Project Management is the Time Management made by the planning and control of the project schedule. In this work is presented the resource constrained scheduling problem beyond its mathematical formulation and a review of papers about this issue. In sequence is presented a practical example of this model considering a simplified model of an engineering project schedule of oil production equipment. The results obtained with the model application are shown and the conclusions about the work with resource constrained scheduling problems. (author)

A Cluster-Randomized Trial of Restorative Practices: An Illustration to Spur High-Quality Research and Evaluation.

Science.gov (United States)

Acosta, Joie D; Chinman, Matthew; Ebener, Patricia; Phillips, Andrea; Xenakis, Lea; Malone, Patrick S

2016-01-01

Restorative Practices in schools lack rigorous evaluation studies. As an example of rigorous school-based research, this paper describes the first randomized control trial of restorative practices to date, the Study of Restorative Practices. It is a 5-year, cluster-randomized controlled trial (RCT) of the Restorative Practices Intervention (RPI) in 14 middle schools in Maine to assess whether RPI impacts both positive developmental outcomes and problem behaviors and whether the effects persist during the transition from middle to high school. The two-year RPI intervention began in the 2014-2015 school year. The study's rationale and theoretical concerns are discussed along with methodological concerns including teacher professional development. The theoretical rationale and description of the methods from this study may be useful to others conducting rigorous research and evaluation in this area.

An innovative artificial bee colony algorithm and its application to a practical intercell scheduling problem

Science.gov (United States)

Li, Dongni; Guo, Rongtao; Zhan, Rongxin; Yin, Yong

2018-06-01

In this article, an innovative artificial bee colony (IABC) algorithm is proposed, which incorporates two mechanisms. On the one hand, to provide the evolutionary process with a higher starting level, genetic programming (GP) is used to generate heuristic rules by exploiting the elements that constitute the problem. On the other hand, to achieve a better balance between exploration and exploitation, a leading mechanism is proposed to attract individuals towards a promising region. To evaluate the performance of IABC in solving practical and complex problems, it is applied to the intercell scheduling problem with limited transportation capacity. It is observed that the GP-generated rules incorporate the elements of the most competing human-designed rules, and they are more effective than the human-designed ones. Regarding the leading mechanism, the strategies of the ageing leader and multiple challengers make the algorithm less likely to be trapped in local optima.

Coordinating space telescope operations in an integrated planning and scheduling architecture

Science.gov (United States)

Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela

1992-01-01

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

Using a best-practice perioperative governance structure to implement better block scheduling.

Science.gov (United States)

Heiser, Randy

2013-01-01

Achieving, developing, and maintaining a well-functioning OR scheduling system requires a well-designed perioperative governance structure. Traditional OR/surgery committees, consisting mainly of surgeons, have tried to provide this function but often have not succeeded. An OR governance model should be led by an OR executive committee that functions as a board of directors for the surgery program and works closely with the surgery department medical director and an OR advisory committee. Ideally, the OR executive committee should develop a block schedule that includes a mix of block, open, and urgent or emergent OR access, because this combination is most effective for improving OR use and adapting to changes in surgical procedure volume. Copyright © 2013 AORN, Inc. Published by Elsevier Inc. All rights reserved.

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.

A Randomized Experiment Testing the Efficacy of a Scheduling Nudge in a Massive Open Online Course (MOOC

Directory of Open Access Journals (Sweden)

Rachel Baker

2016-10-01

Full Text Available An increasing number of students are taking classes offered online through open-access platforms; however, the vast majority of students who start these classes do not finish. The incongruence of student intentions and subsequent engagement suggests that self-control is a major contributor to this stark lack of persistence. This study presents the results of a large-scale field experiment (N = 18,043 that examines the effects of a self-directed scheduling nudge designed to promote student persistence in a massive open online course. We find that random assignment to treatment had no effects on near-term engagement and weakly significant negative effects on longer-term course engagement, persistence, and performance. Interestingly, these negative effects are highly concentrated in two groups of students: those who registered close to the first day of class and those with .edu e-mail addresses. We consider several explanations for these findings and conclude that theoretically motivated interventions may interact with the diverse motivations of individual students in possibly unintended ways.

A first Experimental Investigation of the Practical Efficiency of Battery Scheduling

NARCIS (Netherlands)

Miliche, Damien; de Graaf, Maurits; Hoekstra, Gerard; Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

Nowadays, mobile devices are used more and more, and their battery lifetime is a key concern. In this paper, we concentrate on a method called battery scheduling with the aim to optimize the battery lifetime of mobile devices. This technique has already been largely theoretically studied in other

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.

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.

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.

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

Directory of Open Access Journals (Sweden)

Wenming Cheng

2012-01-01

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

Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

Directory of Open Access Journals (Sweden)

Xiaocheng Liu

2012-01-01

Full Text Available An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.

Using randomized variable practice in the treatment of childhood apraxia of speech.

Science.gov (United States)

Skelton, Steven L; Hagopian, Aubrie Lynn

2014-11-01

The purpose of this study was to determine if randomized variable practice, a central component of concurrent treatment, would be effective and efficient in treating childhood apraxia of speech (CAS). Concurrent treatment is a treatment program that takes the speech task hierarchy and randomizes it so that all tasks are worked on in one session. Previous studies have shown the treatment program to be effective and efficient in treating phonological and articulation disorders. The program was adapted to be used with children with CAS. A research design of multiple baselines across participants was used. Probes of generalization to untaught words were administered every fifth session. Three children, ranging in age from 4 to 6 years old, were the participants. Data were collected as percent correct productions during baseline, treatment, and probes of generalization of target sounds to untaught words and three-word phrases. All participants showed an increase in correct productions during treatment and during probes. Effect sizes (standard mean difference) for treatment were 3.61-5.00, and for generalization probes, they were 3.15-8.51. The results obtained from this study suggest that randomized variable practice as used in concurrent treatment can be adapted for use in treating children with CAS. Replication of this study with other children presenting CAS will be needed to establish generality of the findings.

Learning Search Control Knowledge for Deep Space Network Scheduling

Science.gov (United States)

Gratch, Jonathan; Chien, Steve; DeJong, Gerald

1993-01-01

While the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, for specific distributions of problems and constraints, domain-specific solutions have been shown to perform in much better than exponential time.

Contrast and autoshaping in multiple schedules varying reinforcer rate and duration.

Science.gov (United States)

Hamilton, B E; Silberberg, A

1978-07-01

Thirteen master pigeons were exposed to multiple schedules in which reinforcement frequency (Experiment I) or duration (Experiment II) was varied. In Phases 1 and 3 of Experiment I, the values of the first and second components' random-interval schedules were 33 and 99 seconds, respectively. In Phase 2, these values were 99 seconds for both components. In Experiment II, a random-interval 33-second schedule was associated with each component. During Phases 1 and 3, the first and second components had hopper durations of 7.5 and 2.5 seconds respectively. During Phase 2, both components' hopper durations were 2.5 seconds. In each experiment, positive contrast obtained for about half the master subjects. The rest showed a rate increase in both components (positive induction). Each master subject's key colors and reinforcers were synchronously presented on a response-independent basis to a yoked control. Richer component key-pecking occurred during each experiment's Phases 1 and 3 among half these subjects. However, none responded during the contrast condition (unchanged component of each experiment's Phase 2). From this it is inferred that autoshaping did not contribute to the contrast and induction findings among master birds. Little evidence of local contrast (highest rate at beginning of richer component) was found in any subject. These data show that (a) contrast can occur independently from autoshaping, (b) contrast assays during equal-valued components may produce induction, (c) local contrast in multiple schedules often does not occur, and (d) differential hopper durations can produce autoshaping and contrast.

Benchmarking recent national practice in rectal cancer treatment with landmark randomized controlled trials

NARCIS (Netherlands)

Borstlap, Waa; Deijen, C. L.; den Dulk, M.; Bonjer, H. J.; van de Velde, C. J.; Bemelman, W. A.; Tanis, P. J.; Aalbers, A.; Acherman, Y.; Algie, G. D.; Alting von Geusau, B.; Amelung, F.; Aukema, T. S.; Bakker, I. S.; Basha, S.; Bastiaansen, A. J. N. M.; Belgers, E.; Bleeker, W.; Blok, J.; Bosker, R. J. I.; Bosmans, J. W.; Boute, M. C.; Bouvy, N. D.; Bouwman, H.; Brandt-Kerkhof, A.; Brinkman, D. J.; Bruin, S.; Bruns, E. R. J.; Burbach, J. P. M.; Burger, J. W. A.; Buskens, C. J.; Clermonts, S.; Coenen, P. P. L. O.; Compaan, C.; Consten, E. C. J.; Darbyshire, T.; de Mik, S. M. L.; de Graaf, E. J. R.; de Groot, I.; de Vos Tot Nederveen Cappel, R. J. L.; de Wilt, J. H. W.; van der Wolde, J.; den Boer, F. C.; Dekker, J. W. T.; Demirkiran, A.; van Duijvendijk, P.; Musters, G. D.; van Rossem, C. C.; Schreuder, A. M.; Swank, H. A.

2017-01-01

Aim A Snapshot study design eliminates changes in treatment and outcome over time. This population based Snapshot study aimed to determine current practice and outcome of rectal cancer treatment with published landmark randomized controlled trials as a benchmark. Method In this collaborative

Benchmarking recent national practice in rectal cancer treatment with landmark randomized controlled trials

NARCIS (Netherlands)

Borstlap, W. A. A.; Deijen, C. L.; den Dulk, M.; Bonjer, H. J.; van de Velde, C. J.; Bemelman, W. A.; Tanis, P. J.; Aalbers, A.; Acherman, Y.; Algie, G. D.; von Geu-sau, B. Alting; Amelung, F.; Aukema, T. S.; Bakker, I. S.; Bartels, S. A.; Basha, S.; Bastiaansen, A. J. N. M.; Belgers, E.; Bleeker, W.; Blok, J.; Bosker, R. J. I.; Bosmans, J. W.; Boute, M. C.; Bouvy, N. D.; Bouwman, H.; Brandt-Kerkhof, A.; Brinkman, D. J.; Bruin, S.; Bruns, E. R. J.; Burbach, J. P. M.; Burger, J. W. A.; Buskens, C. J.; Clermonts, S.; Coene, P. P. L. O.; Compaan, C.; Consten, E. C. J.; Darbyshire, T.; de Mik, S. M. L.; de Graaf, E. J. R.; de Groot, I.; Cappel, R. J. L. de Vos Tot Nederveen; de Wilt, J. H. W.; van der Wolde, J.; den Boer, F. C.; Furnee, E. J. B.; Havenga, K.; Klaase, J.; Holzik, M. F. Lutke; Meerdink, M.; Wevers, K.

Aim A Snapshot study design eliminates changes in treatment and outcome over time. This population based Snapshot study aimed to determine current practice and outcome of rectal cancer treatment with published landmark randomized controlled trials as a benchmark. Method In this collaborative

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

Science.gov (United States)

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

2015-01-01

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

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.

A simple rule based model for scheduling farm management operations in SWAT

Science.gov (United States)

Schürz, Christoph; Mehdi, Bano; Schulz, Karsten

2016-04-01

For many interdisciplinary questions at the watershed scale, the Soil and Water Assessment Tool (SWAT; Arnold et al., 1998) has become an accepted and widely used tool. Despite its flexibility, the model is highly demanding when it comes to input data. At SWAT's core the water balance and the modeled nutrient cycles are plant growth driven (implemented with the EPIC crop growth model). Therefore, land use and crop data with high spatial and thematic resolution, as well as detailed information on cultivation and farm management practices are required. For many applications of the model however, these data are unavailable. In order to meet these requirements, SWAT offers the option to trigger scheduled farm management operations by applying the Potential Heat Unit (PHU) concept. The PHU concept solely takes into account the accumulation of daily mean temperature for management scheduling. Hence, it contradicts several farming strategies that take place in reality; such as: i) Planting and harvesting dates are set much too early or too late, as the PHU concept is strongly sensitivity to inter-annual temperature fluctuations; ii) The timing of fertilizer application, in SWAT this often occurs simultaneously on the same date in in each field; iii) and can also coincide with precipitation events. Particularly, the latter two can lead to strong peaks in modeled nutrient loads. To cope with these shortcomings we propose a simple rule based model (RBM) to schedule management operations according to realistic farmer management practices in SWAT. The RBM involves simple strategies requiring only data that are input into the SWAT model initially, such as temperature and precipitation data. The user provides boundaries of time periods for operation schedules to take place for all crops in the model. These data are readily available from the literature or from crop variety trials. The RBM applies the dates by complying with the following rules: i) Operations scheduled in the

A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

Directory of Open Access Journals (Sweden)

Lei Wang

2017-01-01

Full Text Available In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES and improved population diversity strategy (IPDS are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective.

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.

Personalized Video Feedback and Repeated Task Practice Improve Laparoscopic Knot-Tying Skills: Two Controlled Trials.

Science.gov (United States)

Abbott, Eduardo F; Thompson, Whitney; Pandian, T K; Zendejas, Benjamin; Farley, David R; Cook, David A

2017-11-01

Compare the effect of personalized feedback (PF) vs. task demonstration (TD), both delivered via video, on laparoscopic knot-tying skills and perceived workload; and evaluate the effect of repeated practice. General surgery interns and research fellows completed four repetitions of a simulated laparoscopic knot-tying task at one-month intervals. Midway between repetitions, participants received via e-mail either a TD video (demonstration by an expert) or a PF video (video of their own performance with voiceover from a blinded senior surgeon). Each participant received at least one video per format, with sequence randomly assigned. Outcomes included performance scores and NASA Task Load Index (NASA-TLX) scores. To evaluate the effectiveness of repeated practice, scores from these trainees on a separate delayed retention test were compared against historical controls who did not have scheduled repetitions. Twenty-one trainees completed the randomized study. Mean change in performance scores was significantly greater for those receiving PF (difference = 23.1 of 150 [95% confidence interval (CI): 0, 46.2], P = .05). Perceived workload was also significantly reduced (difference = -3.0 of 20 [95% CI: -5.8, -0.3], P = .04). Compared with historical controls (N = 93), the 21 with scheduled repeated practice had higher scores on the laparoscopic knot-tying assessment two weeks after the final repetition (difference = 1.5 of 10 [95% CI: 0.2, 2.8], P = .02). Personalized video feedback improves trainees' procedural performance and perceived workload compared with a task demonstration video. Brief monthly practice sessions support skill acquisition and retention.

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.

Condition-based maintenance at both scheduled and unscheduled opportunities

NARCIS (Netherlands)

Kalosi, S.; Kapodistria, S.; Resing, J.A.C.

2016-01-01

Motivated by original equipment manufacturer (OEM) service and maintenance practices we consider a single component subject to replacements at failure instances and two types of preventive maintenance opportunities: scheduled, which occur due to periodic system reviews of the equipment, and

Hybrid IP/CP Methods for Solving Sports Scheduling Problems

DEFF Research Database (Denmark)

Rasmussen, Rasmus Vinther

2006-01-01

The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...

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.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

Science.gov (United States)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines

Science.gov (United States)

Ozmutlu, H. Cenk

2014-01-01

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms. PMID:24977204

MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines.

Science.gov (United States)

Eroglu, Duygu Yilmaz; Ozmutlu, H Cenk

2014-01-01

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.

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

Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations

CERN Document Server

Toporkov, Victor; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

2015-01-01

In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution strategies are suggested. Job framework forming is justified with such quality of service indicators as an average job execution time, a number of required scheduling cycles, and a number of job execution declines. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one utilizes the mentioned compatibility coefficient. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.

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.

Randomized controlled trial of the effect of medical audit on AIDS prevention in general practice

DEFF Research Database (Denmark)

Sandbæk, Annelli

1999-01-01

OBJECTIVE: We aimed to evaluate the effect of a medical audit on AIDS prevention in general practice. METHODS: We conducted a prospective randomized controlled study performed as 'lagged intervention'. At the time of comparison, the intervention group had completed 6 months of audit including a p...... of such consultations initiated by the GPs. CONCLUSIONS: Medical audit had no observed effect on AIDS prevention in general practice. Udgivelsesdato: 1999-Oct......OBJECTIVE: We aimed to evaluate the effect of a medical audit on AIDS prevention in general practice. METHODS: We conducted a prospective randomized controlled study performed as 'lagged intervention'. At the time of comparison, the intervention group had completed 6 months of audit including....... One hundred and thirty-three GPs completed the project. The main outcome measures were the number of consultations involving AIDS prevention and the number of talks about AIDS initiated by the GP, and some elements of the content were registered on a chart. RESULTS: No statistically significant...

Increasing the reliability of production schedules in a pharmaceutical packaging department.

Science.gov (United States)

Pacciarelli, Dario; D'Ariano, Andrea

2012-12-01

This paper studies quantitative methods for evaluating the potential benefits of introducing new advanced tracking technologies in the pharmaceutical industry with special reference to radio frequency identification (RFID). RFID technology is an effective way for increasing the quality of the data that are used to generate production schedules, but there is a lack of scientific research to quantify the return on investment that can be achieved in practice. In this work, we distinguish two major sources of data unreliability: one is the inherent stochasticity of operations, which cannot be reduced by RFID, and the other one is the data estimation error, which can be significantly reduced by RFID. We focus on the marginal contribution of the latter quantity to the productivity of the packaging department of a pharmaceutical plant, propose a systematic method for assessing this impact and discuss its implementation in a practical test case. Our results confirm that advanced tracking technologies in combination with effective scheduling procedures show a significant potential for improving productivity. Extensions to other production environments and their issues associated with scheduling problems are also discussed.

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

Algorithm of composing the schedule of construction and installation works

Science.gov (United States)

Nehaj, Rustam; Molotkov, Georgij; Rudchenko, Ivan; Grinev, Anatolij; Sekisov, Aleksandr

2017-10-01

An algorithm for scheduling works is developed, in which the priority of the work corresponds to the total weight of the subordinate works, the vertices of the graph, and it is proved that for graphs of the tree type the algorithm is optimal. An algorithm is synthesized to reduce the search for solutions when drawing up schedules of construction and installation works, allocating a subset with the optimal solution of the problem of the minimum power, which is determined by the structure of its initial data and numerical values. An algorithm for scheduling construction and installation work is developed, taking into account the schedule for the movement of brigades, which is characterized by the possibility to efficiently calculate the values of minimizing the time of work performance by the parameters of organizational and technological reliability through the use of the branch and boundary method. The program of the computational algorithm was compiled in the MatLAB-2008 program. For the initial data of the matrix, random numbers were taken, uniformly distributed in the range from 1 to 100. It takes 0.5; 2.5; 7.5; 27 minutes to solve the problem. Thus, the proposed method for estimating the lower boundary of the solution is sufficiently accurate and allows efficient solution of the minimax task of scheduling construction and installation works.

Anodal transcranial direct current stimulation over the primary motor cortex does not enhance the learning benefits of self-controlled feedback schedules.

Science.gov (United States)

Carter, Michael J; Smith, Victoria; Carlsen, Anthony N; Ste-Marie, Diane M

2018-05-01

A distinct learning advantage has been shown when participants control their knowledge of results (KR) scheduling during practice compared to when the same KR schedule is imposed on the learner without choice (i.e., yoked schedules). Although the learning advantages of self-controlled KR schedules are well-documented, the brain regions contributing to these advantages remain unknown. Identifying key brain regions would not only advance our theoretical understanding of the mechanisms underlying self-controlled learning advantages, but would also highlight regions that could be targeted in more applied settings to boost the already beneficial effects of self-controlled KR schedules. Here, we investigated whether applying anodal transcranial direct current stimulation (tDCS) to the primary motor cortex (M1) would enhance the typically found benefits of learning a novel motor skill with a self-controlled KR schedule. Participants practiced a spatiotemporal task in one of four groups using a factorial combination of KR schedule (self-controlled vs. yoked) and tDCS (anodal vs. sham). Testing occurred on two consecutive days with spatial and temporal accuracy measured on both days and learning was assessed using 24-h retention and transfer tests without KR. All groups improved their performance in practice and a significant effect for practicing with a self-controlled KR schedule compared to a yoked schedule was found for temporal accuracy in transfer, but a similar advantage was not evident in retention. There were no significant differences as a function of KR schedule or tDCS for spatial accuracy in retention or transfer. The lack of a significant tDCS effect suggests that M1 may not strongly contribute to self-controlled KR learning advantages; however, caution is advised with this interpretation as typical self-controlled learning benefits were not strongly replicated in the present experiment.

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Science.gov (United States)

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

Low-Feedback Opportunistic Scheduling Schemes for Wireless Networks with Heterogenous Users

KAUST Repository

Rashid, Faraan

2012-07-01

Efficient implementation of resource sharing strategies in a multi-user wireless environment can improve the performance of a network significantly. In this thesis we study various scheduling strategies for wireless networks and handle the problem of opportunistically scheduling transmissions using channel aware schemes. First we propose a scheme that can handle users with asymmetric channel conditions and is opportunistic in the sense that it exploits the multi-user diversity of the network. The scheme requires the users to have a priori knowledge of their channel distributions. The associated overhead is limited meaning it offers reduced feedback load, that does not scale with the increasing number of users. The main technique used to shrink the feedback load is the contention based distributed implementation of a splitting algorithm that does not require explicit feedback to the scheduler from every user. The users find the best among themselves, in a distributed manner, while requiring just a ternary broadcast feedback from the scheduler at the end of each mini-slot. In addition, it can also handle fairness constraints in time and throughput to various degrees. Next we propose another opportunistic scheduler that offers most of the benefits of the previously proposed scheme but is more practical because it can also handle heterogenous users whose channel distributions are unknown. This new scheme actually reduces the complexity and is also more robust for changing traffic patterns. Finally we extend both these schemes to the scenario where there are fixed thresholds, this enables us to handle opportunistic scheduling in practical systems that can only transmit over finite number of discrete rates with the additional benefit that full feedback session, even from the selected user, is never required.

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

Science.gov (United States)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

Initial examination of the effects of overtime and shift scheduling on nuclear power plant safety performance

International Nuclear Information System (INIS)

Baker, K.; Olson, J.; Montgomery, J.

1990-01-01

The research reported here uses currently available data to begin to document overtime and shift scheduling practices in the nuclear industry and assess their safety consequences. Overtime and the 12-hour shift schedule have been found to affect employee fatigue and human error in other industries but neither of these practices have been systematically researched within the nuclear industry. Overtime has long been a standard practice in the nuclear industry and, recently, several licensees have adopted a 12-hour shift schedule for control room operations crews. Although 12-hour shifts have certain benefits for the employer and employee alike (e.g., can require fewer total employees and provide longer periods of time-off) there is some concern that the 12-hour shift may produce greater employee fatigue. Moreover, the 12-hour shift may exacerbate the negative effect of overtime. The potential effect of human error in the nuclear industry for the health and safety of both nuclear power plant workers and the general public requires that these practices be assessed. Data on overtime practices was obtained from the International Brotherhood of Electrical Workers (IBEW) for plants covered by the bargaining unit - approximately 63% of the total number of operating plants. Information on operator shift schedule was collected from all operating plants in 1987 by the NRC. The research produced fairly strong evidence that greater amounts of overtime worked by operators is associated with a greater number of operational problems

Performance improvement of per-user threshold based multiuser switched scheduling system

KAUST Repository

Nam, Haewoon

2013-01-01

SUMMARY This letter proposes a multiuser switched scheduling scheme with per-user threshold and post user selection and provides a generic analytical framework for determining the optimal feedback thresholds. The proposed scheme applies an individual feedback threshold for each user rather than a single common threshold for all users to achieve some capacity gain due to the flexibility of threshold selection as well as a lower scheduling outage probability. In addition, since scheduling outage may occur with a non-negligible probability, the proposed scheme employs post user selection in order to further improve the ergodic capacity, where the user with the highest potential for a higher channel quality than other users is selected. Numerical and simulation results show that the capacity gain by post user selection is significant when random sequence is used. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.

ATD-2 Surface Scheduling and Metering Concept

Science.gov (United States)

Coppenbarger, Richard A.; Jung, Yoon Chul; Capps, Richard Alan; Engelland, Shawn A.

2017-01-01

This presentation describes the concept of ATD-2 tactical surface scheduling and metering. The concept is composed of several elements, including data exchange and integration; surface modeling; surface scheduling; and surface metering. The presentation explains each of the elements. Surface metering is implemented to balance demand and capacity• When surface metering is on, target times from surface scheduler areconverted to advisories for throttling demand• Through the scheduling process, flights with CTOTs will not get addedmetering delay (avoids potential for ‘double delay’)• Carriers can designate certain flights as exempt from metering holds• Demand throttle in Phase 1 at CLT is through advisories sent to rampcontrollers for pushback instructions to the flight deck– Push now– Hold for an advised period of time (in minutes)• Principles of surface metering can be more generally applied to otherairports in the NAS to throttle demand via spot-release times (TMATs Strong focus on optimal use of airport resources• Flexibility enables stakeholders to vary the amount of delay theywould like transferred to gate• Addresses practical aspects of executing surface metering in aturbulent real world environment• Algorithms designed for both short term demand/capacityimbalances (banks) or sustained metering situations• Leverage automation to enable surface metering capability withoutrequiring additional positions• Represents first step in Tactical/Strategic fusion• Provides longer look-ahead calculations to enable analysis ofstrategic surface metering potential usage

Home Health Chains and Practice Patterns: Evidence of 2008 Medicare Reimbursement Revision.

Science.gov (United States)

Huang, Sean Shenghsiu; Kim, Hyunjee

2017-10-01

Home health agencies (HHAs) are known to exploit the Medicare reimbursement schedule by targeting a specific number of therapy visits. These targeting behaviors cause unnecessary medical spending. The Centers for Medicare & Medicaid Services estimates that during fiscal year 2015, Medicare made more than $10 billion in improper payments to HHAs. Better understanding of heterogeneous gaming behaviors among HHAs can inform policy makers to more effectively oversee the home health care industry. This article aims to study how home health chains adjust and adopt new targeting behaviors as compared to independent agencies under the new reimbursement schedule. The analytic data are constructed from: (1) 5% randomly sampled Medicare home health claim data, and (2) HHA chain information extracted from the Medicare Cost Report. The study period spans from 2007 to 2010, and the sample includes 7800 unique HHAs and 380,118 treatment episodes. A multivariate regression model is used to determine whether chain and independent agencies change their practice patterns and adopt different targeting strategies after the revision of the reimbursement schedule in 2008. This study finds that independent agencies are more likely to target 6 and 14 visits, while chain agencies are more likely to target 20 visits. Such a change of practice patterns is more significant among for-profit HHAs. The authors expect these findings to inform policy makers that organizational structures, especially the combination of for-profit status and chain affiliation, should be taken into the consideration when detecting medical fraud and designing the reimbursement schedule.

Using a vision cognitive algorithm to schedule virtual machines

Directory of Open Access Journals (Sweden)

Zhao Jiaqi

2014-09-01

Full Text Available Scheduling virtual machines is a major research topic for cloud computing, because it directly influences the performance, the operation cost and the quality of services. A large cloud center is normally equipped with several hundred thousand physical machines. The mission of the scheduler is to select the best one to host a virtual machine. This is an NPhard global optimization problem with grand challenges for researchers. This work studies the Virtual Machine (VM scheduling problem on the cloud. Our primary concern with VM scheduling is the energy consumption, because the largest part of a cloud center operation cost goes to the kilowatts used. We designed a scheduling algorithm that allocates an incoming virtual machine instance on the host machine, which results in the lowest energy consumption of the entire system. More specifically, we developed a new algorithm, called vision cognition, to solve the global optimization problem. This algorithm is inspired by the observation of how human eyes see directly the smallest/largest item without comparing them pairwisely. We theoretically proved that the algorithm works correctly and converges fast. Practically, we validated the novel algorithm, together with the scheduling concept, using a simulation approach. The adopted cloud simulator models different cloud infrastructures with various properties and detailed runtime information that can usually not be acquired from real clouds. The experimental results demonstrate the benefit of our approach in terms of reducing the cloud center energy consumption

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

Science.gov (United States)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

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.

Planning and Scheduling for Environmental Sensor Networks

Science.gov (United States)

Frank, J. D.

2005-12-01

resources and to reduce the costs of communication. Planning and scheduling is generally a heavy consumer of time, memory and energy resources. This means careful thought must be given to how much planning and scheduling should be done on the sensors themselves, and how much to do elsewhere. The difficulty of planning and scheduling is exacerbated when reasoning about uncertainty. More time, memory and energy is needed to solve such problems, leading either to more expensive sensors, or suboptimal plans. For example, scientifically interesting events may happen at random times, making it difficult to ensure that sufficient resources are availanble. Since uncertainty is usually lowest in proximity to the sensors themselves, this argues for planning and scheduling onboard the sensors. However, cost minimization dictates sensors be kept as simple as possible, reducing the amount of planning and scheduling they can do themselves. Furthermore, coordinating each sensor's independent plans can be difficult. In the full presentation, we will critically review the planning and scheduling systems used by previously fielded sensor networks. We do so primarily from the perspective of the computational sciences, with a focus on taming computational complexity when operating sensor networks. The case studies are derived from sensor networks based on UAVs, satellites, and planetary rovers. Planning and scheduling considerations include multi-sensor coordination, optimizing science value, onboard power management, onboard memory, planning movement actions to acquire data, and managing communications.These case studies offer lessons for future designs of environmental sensor networks.

Learners’ Perceptions of the Effectiveness of Spaced Learning Schedule in L2 Vocabulary Learning

Directory of Open Access Journals (Sweden)

Amir Reza Lotfolahi

2016-05-01

Full Text Available The spacing effect is a ubiquitous phenomenon, whereby memory is enhanced for the information that is learned across different points in time rather than being learned at once. A considerable amount of research has focused on the nature of the spacing effect, and there is general acceptance that spacing learning events out in time promotes learning. However, fewer studies have been conducted in educational settings. The aim of this study is to explore learners’ perceptions of different spacing schedules (massed vs. spaced. To achieve the purpose of the study, we taught 30 children 24 English–Farsi word pairs utilizing different spacing schedules. Later, we administered a questionnaire to explore leaarners’ perceptions of both massed and spaced schedules. The results revealed that the children percieved spaced practice to be more effective than massed practice.

Immediate effects of adding mental practice to physical practice on the gait of individuals with Parkinson's disease: Randomized clinical trial.

Science.gov (United States)

Santiago, Lorenna Marques de Melo; de Oliveira, Daniel Antunes; de Macêdo Ferreira, Louise Gabriella Lopes; de Brito Pinto, Hyanne Yasmim; Spaniol, Ana Paula; de Lucena Trigueiro, Larissa Coutinho; Ribeiro, Tatiana Souza; de Sousa, Angélica Vieira Cavalcanti; Piemonte, Maria Elisa Pimentel; Lindquist, Ana Raquel Rodrigues

2015-01-01

Mental practice has shown benefits in the rehabilitation of neurological patients, however, there is no evidence of immediate effects on gait of individuals with Parkinson's disease. Determine the effects of mental practice activity added to physical practice on the gait of individuals with Idiopathic Parkinson's Disease (IPD). 20 patients classified with stage 2 and 3, according to the Hoehn and Yahr scale were randomized into 2 groups. The experimental group (N = 10) was submitted to a single session of mental practice and physical practice gait protocol and the control group (N = 10) only to physical practice. The primary outcomes were stride length and total stance and swing time. Secondary outcomes were hip range of motion, velocity and mobility. Subjects were reassessed 10 minutes, 1 day and 7 days after the end of the session. There was no statistically significant difference between the groups. An intragroup difference was observed in velocity, stride length, hip range of motion, and mobility, as well as total stance and swing time. These results were also observed on follow-ups. Mental practice did not have a greater effect on the gait of individuals with IPD than physical practice, after a single session.

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.

Innovative Production Scheduling with Customer Satisfaction Based Measurement for the Sustainability of Manufacturing Firms

Directory of Open Access Journals (Sweden)

Sang-Oh Shim

2017-12-01

Full Text Available Scheduling problems for the sustainability of manufacturing firms in the era of the fourth industrial revolution is addressed in this research. In terms of open innovation, innovative production scheduling can be defined as scheduling using big data, cyber-physical systems, internet of things, cloud computing, mobile network, and so on. In this environment, one of the most important things is to develop an innovative scheduling algorithm for the sustainability of manufacturing firms. In this research, a flexible flowshop scheduling problem is considered with the properties of sequence-dependent setup and different process plans for jobs. In a flexible flowshop, there are serial workstations with multiple pieces of equipment that are able to process multiple lots simultaneously. Since the scheduling in this workshop is known to be extremely difficult, it is important to devise an efficient and effective scheduling algorithm. In this research, a heuristic algorithm is proposed based on a few dispatching rules and economic lot size model with the objective of minimizing total tardiness of orders. For the purposes of performance evaluation, a simulation study is conducted on randomly generated problem instances. The results imply that our proposed method outperforms the existing ones, and greatly enhances the sustainability of manufacturing firms.

Resource planning and scheduling of payload for satellite with particle swarm optimization

Science.gov (United States)

Li, Jian; Wang, Cheng

2007-11-01

The resource planning and scheduling technology of payload is a key technology to realize an automated control for earth observing satellite with limited resources on satellite, which is implemented to arrange the works states of various payloads to carry out missions by optimizing the scheme of the resources. The scheduling task is a difficult constraint optimization problem with various and mutative requests and constraints. Based on the analysis of the satellite's functions and the payload's resource constraints, a proactive planning and scheduling strategy based on the availability of consumable and replenishable resources in time-order is introduced along with dividing the planning and scheduling period to several pieces. A particle swarm optimization algorithm is proposed to address the problem with an adaptive mutation operator selection, where the swarm is divided into groups with different probabilities to employ various mutation operators viz., differential evolution, Gaussian and random mutation operators. The probabilities are adjusted adaptively by comparing the effectiveness of the groups to select a proper operator. The simulation results have shown the feasibility and effectiveness of the method.

Immunogenicity and safety evaluation of bivalent types 1 and 3 oral poliovirus vaccine by comparing different poliomyelitis vaccination schedules in China: A randomized controlled non-inferiority clinical trial.

Science.gov (United States)

Qiu, Jingjun; Yang, Yunkai; Huang, Lirong; Wang, Ling; Jiang, Zhiwei; Gong, Jian; Wang, Wei; Wang, Hongyan; Guo, Shaohong; Li, Chanjuan; Wei, Shuyuan; Mo, Zhaojun; Xia, Jielai

2017-06-03

The type 2 component of the oral poliovirus vaccine is targeted for global withdrawal through a switch from the trivalent oral poliovirus vaccine (tOPV) to a bivalent oral poliovirus vaccine (bOPV). The switch is intended to prevent paralytic polio caused by circulating vaccine-derived poliovirus type 2. We aimed to assess the immunogenicity and safety profile of 6 vaccination schedules with different sequential doses of inactivated poliovirus vaccine (IPV), tOPV, or bOPV. A randomized controlled trial was conducted in China in 2015. Healthy newborn babies randomly received one of the following 6 vaccination schedules: cIPV-bOPV-bOPV(I-B-B), cIPV-tOPV-tOPV(I-T-T), cIPV-cIPV-bOPV(I-I-B), cIPV-cIPV-tOPV(I-I-T), cIPV-cIPV-cIPV(I-I-I), or tOPV-tOPV-tOPV(T-T-T). Doses were administered sequentially at 4-6 week intervals after collecting baseline blood samples. Patients were proactively followed up for observation of adverse events after the first dose and 30 days after all doses. The primary study objective was to investigate the immunogenicity and safety profile of different vaccine schedules, evaluated by seroconversion, seroprotection and antibody titer against poliovirus types 1, 2, and 3 in the per-protocol population. Of 600 newborn babies enrolled, 504 (84.0%) were included in the per-protocol population. For type 1 poliovirus, the differences in the seroconversion were 1.17% (95% CI = -2.74%, 5.08%) between I-B-B and I-T-T and 0.00% (95% CI: -6.99%, 6.99%) between I-I-B and I-I-T; for type 3 poliovirus, differences in the seroconversion were 3.49% (95% CI: -1.50%, 8.48%) between I-B-B and I-T-T and -2.32% (95% CI: -5.51%, 0.86%) between I-I-B and I-I-T. The non-inferiority conclusion was achieved in both poliovirus type 1 and 3 with the margin of -10%. Of 24 serious adverse events reported, no one was vaccine-related. The vaccination schedules with bOPV followed by one or 2 doses of IPV were recommended to substitute for vaccinations involving tOPV without

Effect of a tailored physical activity intervention delivered in general practice settings: results of a randomized controlled trial

NARCIS (Netherlands)

Sluijs, van E.M.F.; Poppel - Bruinvels, van M.N.M.; Twisk, J.W.R.; Paw, M.J.M. Chin A; Calfas, K.J.; Mechelen, van W.

2005-01-01

OBJECTIVES: We evaluated the effectiveness of a minimal intervention physical activity strategy (physician-based assessment and counseling for exercise [PACE]) applied in general practice settings in the Netherlands. METHODS: Randomization took place at the general practice level. Participants were

Effect of a tailored physical activity intervention delivered in general practice settings: results of a randomized controlled trial

NARCIS (Netherlands)

van Sluijs, E.M.F.; van Poppel-Bruinvels, M.N.M.; Twisk, J.W.R.; Chin A Paw, M.J.M.; Calfas, K.J.; van Mechelen, W.

2005-01-01

Objectives. We evaluated the effectiveness of a minimal intervention physical activity strategy (physician-based assessment and counseling for exercise [PACE]) applied in general practice settings in the Netherlands. Methods. Randomization took place at the general practice level. Participants were

Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments

Directory of Open Access Journals (Sweden)

Kairong Duan

2018-05-01

Full Text Available Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs. When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA. We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time.

Shift scheduling limits for the nuclear industry NRC policy and recommendations

International Nuclear Information System (INIS)

Koontz, J.; Morisseau, D.; Lewis, P.

1985-01-01

A study on shift scheduling and use of overtime and their effects on human performance in nuclear and non-nuclear industries was conducted. An analysis of the literature, current practices, and federal policy on shift scheduling resulted in human factors recommendations for limiting hours of work in the nuclear industry for nuclear power plant personnel conducting safety related functions. Recommended limits on total hours of work were developed by a panel of experts for both 8-hour and 12-hour daily shift schedules for weekly, biweekly, monthly, and annual work periods. The study results are particularly applicable to control room operators but should also be considered for other personnel where performance degradation due to fatigue could directly affect safe plant operations

A hybrid electromagnetism-like algorithm for a multi-mode resource-constrained project scheduling problem

Directory of Open Access Journals (Sweden)

Mohammad Hossein Sadeghi

2013-08-01

Full Text Available In this paper, two different sub-problems are considered to solve a resource constrained project scheduling problem (RCPSP, namely i assignment of modes to tasks and ii scheduling of these tasks in order to minimize the makespan of the project. The modified electromagnetism-like algorithm deals with the first problem to create an assignment of modes to activities. This list is used to generate a project schedule. When a new assignment is made, it is necessary to fix all mode dependent requirements of the project activities and to generate a random schedule with the serial SGS method. A local search will optimize the sequence of the activities. Also in this paper, a new penalty function has been proposed for solutions which are infeasible with respect to non-renewable resources. Performance of the proposed algorithm has been compared with the best algorithms published so far on the basis of CPU time and number of generated schedules stopping criteria. Reported results indicate excellent performance of the algorithm.

Suitability and managerial implications of a Master Surgical Scheduling approach

NARCIS (Netherlands)

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

2010-01-01

textabstractAbstract: Operating room (OR) planning and scheduling is a popular and challenging subject within the operational research applied to health services research (ORAHS). However, the impact in practice is very limited. The organization and culture of a hospital and the inherent

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

GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

Energy Technology Data Exchange (ETDEWEB)

Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2008-07-01

Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

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

International Nuclear Information System (INIS)

Tonkinson, J.A.

1994-01-01

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

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

Science.gov (United States)

2013-12-10

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

Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

Directory of Open Access Journals (Sweden)

Aidin Delgoshaei

2016-09-01

Full Text Available The issue of resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating is frequently seen after initial scheduling of a project in practice and causes significant amount of efforts to modify the initial schedules. In this research, a new method is developed for modifying over-allocated schedules in a multi-mode resource constrained project scheduling problems (MRCPSPs with positive cash flows (MRCPSP-PCF. The aim is to maximize profit of the MRCPSPs or logically minimizing costs. The proposed method can be used as a macro in Microsoft Office Project® Software to modify resource over-allocated days after scheduling a project. This research considers progress payment method and preemptive resources. The proposed approach maximizes profit by scheduling activities through the resource calendar respecting to the available level of preemptive resources and activity numbers. To examine the performance of the proposed method a number of experiments derived from the literature are solved. The results are then compared with the circumstances where resource constraints are relaxed. The outcomes show that in all studied cases, the proposed algorithm can provide modified schedules with no over-allocated days. Afterward the method is applied to modify a manufacturing project in practice.

On Novel Access and Scheduling Schemes for IoT Communications

Directory of Open Access Journals (Sweden)

Zheng Jiang

2016-01-01

Full Text Available The Internet of Things (IoT is expected to foster the development of 5G wireless networks and requires the efficient support for a large number of simultaneous short message communications. To address these challenges, some existing works utilize new waveform and multiuser superposition transmission schemes to improve the capacity of IoT communication. In this paper, we will investigate the spatial degree of freedom of IoT devices based on their distribution, then extend the multiuser shared access (MUSA which is one of the typical MUST schemes to spatial domain, and propose two novel schemes, that is, the preconfigured access scheme and the joint spatial and code domain scheduling scheme, to enhance IoT communication. The results indicate that the proposed schemes can reduce the collision rate dramatically during the IoT random access procedure and improve the performance of IoT communication obviously. Based on the simulation results, it is also shown that the proposed scheduling scheme can achieve the similar performance to the corresponding brute-force scheduling but with lower complexity.

Design and analysis of group-randomized trials in cancer: A review of current practices.

Science.gov (United States)

Murray, David M; Pals, Sherri L; George, Stephanie M; Kuzmichev, Andrey; Lai, Gabriel Y; Lee, Jocelyn A; Myles, Ranell L; Nelson, Shakira M

2018-06-01

The purpose of this paper is to summarize current practices for the design and analysis of group-randomized trials involving cancer-related risk factors or outcomes and to offer recommendations to improve future trials. We searched for group-randomized trials involving cancer-related risk factors or outcomes that were published or online in peer-reviewed journals in 2011-15. During 2016-17, in Bethesda MD, we reviewed 123 articles from 76 journals to characterize their design and their methods for sample size estimation and data analysis. Only 66 (53.7%) of the articles reported appropriate methods for sample size estimation. Only 63 (51.2%) reported exclusively appropriate methods for analysis. These findings suggest that many investigators do not adequately attend to the methodological challenges inherent in group-randomized trials. These practices can lead to underpowered studies, to an inflated type 1 error rate, and to inferences that mislead readers. Investigators should work with biostatisticians or other methodologists familiar with these issues. Funders and editors should ensure careful methodological review of applications and manuscripts. Reviewers should ensure that studies are properly planned and analyzed. These steps are needed to improve the rigor and reproducibility of group-randomized trials. The Office of Disease Prevention (ODP) at the National Institutes of Health (NIH) has taken several steps to address these issues. ODP offers an online course on the design and analysis of group-randomized trials. ODP is working to increase the number of methodologists who serve on grant review panels. ODP has developed standard language for the Application Guide and the Review Criteria to draw investigators' attention to these issues. Finally, ODP has created a new Research Methods Resources website to help investigators, reviewers, and NIH staff better understand these issues. Published by Elsevier Inc.

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Zhidong Deng

2009-10-01

Full Text Available Energy constraints restrict the lifetime of wireless sensor networks (WSNs with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes’ energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs.

Multiobjective Variable Neighborhood Search algorithm for scheduling independent jobs on computational grid

Directory of Open Access Journals (Sweden)

S. Selvi

2015-07-01

Full Text Available Grid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to super computers distributed around the world. As the grid environments facilitate distributed computation, the scheduling of grid jobs has become an important issue. In this paper, an investigation on implementing Multiobjective Variable Neighborhood Search (MVNS algorithm for scheduling independent jobs on computational grid is carried out. The performance of the proposed algorithm has been evaluated with Min–Min algorithm, Simulated Annealing (SA and Greedy Randomized Adaptive Search Procedure (GRASP algorithm. Simulation results show that MVNS algorithm generally performs better than other metaheuristics methods.

A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity

Directory of Open Access Journals (Sweden)

Kenzo KURIHARA

2005-02-01

Full Text Available We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1the variation of productive capacity, and (2the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.

A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

International Nuclear Information System (INIS)

Lian Zhigang; Gu Xingsheng; Jiao Bin

2008-01-01

It is well known that the flow-shop scheduling problem (FSSP) is a branch of production scheduling and is NP-hard. Now, many different approaches have been applied for permutation flow-shop scheduling to minimize makespan, but current algorithms even for moderate size problems cannot be solved to guarantee optimality. Some literatures searching PSO for continuous optimization problems are reported, but papers searching PSO for discrete scheduling problems are few. In this paper, according to the discrete characteristic of FSSP, a novel particle swarm optimization (NPSO) algorithm is presented and successfully applied to permutation flow-shop scheduling to minimize makespan. Computation experiments of seven representative instances (Taillard) based on practical data were made, and comparing the NPSO with standard GA, we obtain that the NPSO is clearly more efficacious than standard GA for FSSP to minimize makespan

Suitability and managerial implications of a Master Surgical Scheduling approach

NARCIS (Netherlands)

van Oostrum, Jeroen M.; Bredenhoff, Eelco; Bredenhoff, E.; Hans, Elias W.

2010-01-01

Operating room (OR) planning and scheduling is a popular and challenging subject within the operational research applied to health services research (ORAHS). However, the impact in practice is very limited. The organization and culture of a hospital and the inherent characteristics of its processes

Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

NARCIS (Netherlands)

Nemati, F.; Behnam, M.; Bril, R.J.

2009-01-01

In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent. In practice a typical real-time system usually share logical resources among tasks. However, synchronization in the multiprocessor area has not

Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2017-01-01

In practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling

A pilot cluster randomized controlled trial of structured goal-setting following stroke.

Science.gov (United States)

Taylor, William J; Brown, Melanie; William, Levack; McPherson, Kathryn M; Reed, Kirk; Dean, Sarah G; Weatherall, Mark

2012-04-01

To determine the feasibility, the cluster design effect and the variance and minimal clinical importance difference in the primary outcome in a pilot study of a structured approach to goal-setting. A cluster randomized controlled trial. Inpatient rehabilitation facilities. People who were admitted to inpatient rehabilitation following stroke who had sufficient cognition to engage in structured goal-setting and complete the primary outcome measure. Structured goal elicitation using the Canadian Occupational Performance Measure. Quality of life at 12 weeks using the Schedule for Individualised Quality of Life (SEIQOL-DW), Functional Independence Measure, Short Form 36 and Patient Perception of Rehabilitation (measuring satisfaction with rehabilitation). Assessors were blinded to the intervention. Four rehabilitation services and 41 patients were randomized. We found high values of the intraclass correlation for the outcome measures (ranging from 0.03 to 0.40) and high variance of the SEIQOL-DW (SD 19.6) in relation to the minimally importance difference of 2.1, leading to impractically large sample size requirements for a cluster randomized design. A cluster randomized design is not a practical means of avoiding contamination effects in studies of inpatient rehabilitation goal-setting. Other techniques for coping with contamination effects are necessary.

The CHI 2013 interactive schedule

DEFF Research Database (Denmark)

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

2013-01-01

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

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.

An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Kosar, Tevfik

2010-05-20

Scientific applications and experimental facilities generate massive data sets that need to be transferred to remote collaborating sites for sharing, processing, and long term storage. In order to support increasingly data-intensive science, next generation research networks have been deployed to provide high-speed on-demand data access between collaborating institutions. In this paper, we present a practical model for online data scheduling in which data movement operations are scheduled in advance for end-to-end high performance transfers. In our model, data scheduler interacts with reservation managers and data transfer nodes in order to reserve available bandwidth to guarantee completion of jobs that are accepted and confirmed to satisfy preferred time constraint given by the user. Our methodology improves current systems by allowing researchers and higher level meta-schedulers to use data placement as a service where theycan plan ahead and reserve the scheduler time in advance for their data movement operations. We have implemented our algorithm and examined possible techniques for incorporation into current reservation frameworks. Performance measurements confirm that the proposed algorithm is efficient and scalable.

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

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.

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.

Investigating the Contextual Interference Effect Using Combination Sports Skills in Open and Closed Skill Environments.

Science.gov (United States)

Cheong, Jadeera P G; Lay, Brendan; Razman, Rizal

2016-03-01

This study attempted to present conditions that were closer to the real-world setting of team sports. The primary purpose was to examine the effects of blocked, random and game-based training practice schedules on the learning of the field hockey trap, close dribble and push pass that were practiced in combination. The secondary purpose was to investigate the effects of predictability of the environment on the learning of field hockey sport skills according to different practice schedules. A game-based training protocol represented a form of random practice in an unstable environment and was compared against a blocked and a traditional random practice schedule. In general, all groups improved dribble and push accuracy performance during the acquisition phase when assessed in a closed environment. In the retention phase, there were no differences between the three groups. When assessed in an open skills environment, all groups improved their percentage of successful executions for trapping and passing execution, and improved total number of attempts and total number of successful executions for both dribbling and shooting execution. Between-group differences were detected for dribbling execution with the game-based group scoring a higher number of dribbling successes. The CI effect did not emerge when practicing and assessing multiple sport skills in a closed skill environment, even when the skills were practiced in combination. However, when skill assessment was conducted in a real-world situation, there appeared to be some support for the CI effect. Key pointsThe contextual interference effect was not supported when practicing several skills in combination when the sports skills were assessed in a closed skill environment.There appeared to be some support for the contextual interference effect when sports skills were assessed in an open skill environment, which were similar to a real game situation.A game-based training schedule can be used as an alternative

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

Science.gov (United States)

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

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Randomization tests

CERN Document Server

Edgington, Eugene

2007-01-01

Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani

Random reward priming is task-contingent

DEFF Research Database (Denmark)

Ásgeirsson, Árni Gunnar; Kristjánsson, Árni

2014-01-01

Consistent financial reward of particular features influences the allocation of visual attention in many ways. More surprising are 1-trial reward priming effects on attention where reward schedules are random and reward on one trial influences attentional allocation on the next. Those findings...

Neural Feedback Scheduling of Real-Time Control Tasks

OpenAIRE

Xia, Feng; Tian, Yu-Chu; Sun, Youxian; Dong, Jinxiang

2008-01-01

Many embedded real-time control systems suffer from resource constraints and dynamic workload variations. Although optimal feedback scheduling schemes are in principle capable of maximizing the overall control performance of multitasking control systems, most of them induce excessively large computational overheads associated with the mathematical optimization routines involved and hence are not directly applicable to practical systems. To optimize the overall control performance while minimi...

Improving management of patients with autism spectrum disorder having scheduled surgery: optimizing practice.

Science.gov (United States)

Thompson, Debbie Gearner; Tielsch-Goddard, Anna

2014-01-01

Surgical preparation for children with autism spectrum disorders can be a challenge to perioperative staff because of the unique individual needs and behaviors in this population. Most children with autism function best in predictable, routine environments, and being in the hospital and other health care settings can create a stressful situation. This prospective, descriptive, quality improvement project was conducted to optimize best practices for perioperative staff and better individualize the plan of care for the autistic child and his or her family. Forty-three patients with a diagnosis of autism or autistic spectrum disorder were seen over 6 months at a suburban pediatric hospital affiliated with a major urban pediatric hospital and had an upcoming scheduled surgery or procedure requiring anesthesia. Caregivers were interviewed before and after surgery to collect information to better help their child cope with their hospital visit. In an evaluation of project outcomes, data were tabulated and summarized and interview data were qualitatively coded for emerging themes to improve the perioperative process for the child. Findings showed that staff members were able to recognize potential and actual stressors and help identify individual needs of surgical patients with autism. The families were pleased and appreciative of the individual attention and focus on their child's special needs. Investigators also found increased staff interest in optimizing the surgical experience for autistic children. Copyright © 2014 National Association of Pediatric Nurse Practitioners. Published by Mosby, Inc. All rights reserved.

Mix-oriented manufacturing control (MOMC): a quasi-optimal procedure for dynamic scheduling control

Science.gov (United States)

Cristofari, Marco; Caron, Franco; McDuffie, Ernest L.

1997-12-01

The total system throughput (ST) is one of the most important decision variables at the planning/scheduling phase of a manufacturing system. Material requirement planning (MRP) and master production schedule (MPS) are based on the assumption that ST is known. All the subsequent developments (e.g. jobs- release, system work-load, input-product mix, etc.) depends on such an assumption. If this assumption is incorrect, the production activity control (PAC) will not be able to satisfy the planned targets during the scheduling phase. Delays and bottlenecks will be unavoidable in the system. In case of random flexible manufacturing system (FMS) (or, in general, job-shop production), the measure of ST can not be evaluated a priori without running simulations or observing the actual flow of the operations in the system. The way entities enter the system (sequencing and percentage of the input products) effects the value of ST in such a way that estimation based on historical data are highly risky. The methodology proposed in this paper allows the scheduler to assess the analytical functions which link ST, and other output performance variables, to the input product mix (IPM). This way the robustness of the scheduling plan can be verified before the actual release of the jobs into the system.

Optimal scheduling for distribution network with redox flow battery storage

International Nuclear Information System (INIS)

Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

2016-01-01

Highlights: • A novel method for optimal scheduling of storages in radial network is presented. • Peak shaving and load leveling are the main objectives. • Vanadium redox flow battery is considered as the energy storage unit. • Real data is used for simulation. - Abstract: There are many advantages to utilize storages in electric power system. Peak shaving, load leveling, load frequency control, integration of renewable, energy trading and spinning reserve are the most important of them. Batteries, especially redox flow batteries, are one of the appropriate storages for utilization in distribution network. This paper presents a novel, heuristic and practical method for optimal scheduling in distribution network with flow battery storage. This heuristic method is more suitable for scheduling and operation of distribution networks which require installation of storages. Peak shaving and load leveling is considered as the main objective in this paper. Several indices are presented in this paper for determine the place of storages and also scheduling for optimal use of energy in them. Simulations of this paper are based on real information of distribution network substation that located in Semnan, Iran.

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.

A derived heuristics based multi-objective optimization procedure for micro-grid scheduling

Science.gov (United States)

Li, Xin; Deb, Kalyanmoy; Fang, Yanjun

2017-06-01

With the availability of different types of power generators to be used in an electric micro-grid system, their operation scheduling as the load demand changes with time becomes an important task. Besides satisfying load balance constraints and the generator's rated power, several other practicalities, such as limited availability of grid power and restricted ramping of power output from generators, must all be considered during the operation scheduling process, which makes it difficult to decide whether the optimization results are accurate and satisfactory. In solving such complex practical problems, heuristics-based customized optimization algorithms are suggested. However, due to nonlinear and complex interactions of variables, it is difficult to come up with heuristics in such problems off-hand. In this article, a two-step strategy is proposed in which the first task deciphers important heuristics about the problem and the second task utilizes the derived heuristics to solve the original problem in a computationally fast manner. Specifically, the specific operation scheduling is considered from a two-objective (cost and emission) point of view. The first task develops basic and advanced level knowledge bases offline from a series of prior demand-wise optimization runs and then the second task utilizes them to modify optimized solutions in an application scenario. Results on island and grid connected modes and several pragmatic formulations of the micro-grid operation scheduling problem clearly indicate the merit of the proposed two-step procedure.

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

Development of preventive maintenance procedures and schedules

International Nuclear Information System (INIS)

Schlenker, H.V.; Hammel, J.

1977-01-01

An outline of the procedures and schedules developed for preventive maintenance in power stations within the Rheinisch-Westfaelisches Elektrizitaetswerk (RWE) is presented. After an introduction of maintenance in general the different kinds of preventive maintenance activities are described. This includes also the prerequisite identification systems. The aims of preventive maintenance and the measures are explained that have to be taken, if these aims are to be achieved. A number of examples from actual practice are cited. (orig.) [de

Gender Still Matters: Effects of Workplace Discrimination on Employment Schedules of Young Professionals

Directory of Open Access Journals (Sweden)

Gabriele Plickert

2017-11-01

Full Text Available The influx of women into the legal profession has significantly changed the landscape of legal practice. Women lawyers today no longer face the challenges to entering the legal profession they encountered thirty years ago. However, despite these advancements, research continues to demonstrate that there are still gender-based issues women have to face in the legal workplace. Among these issues to date are the difficulties in combining responsibilities of work with responsibilities of families and children that underpin women’s employment and earning disadvantages. Using survey data from a national representative U.S. panel study of lawyers, we examine how work schedules, comparing full-time to part-time work, vary by personal disposition and workplace characteristics. Drawing from prominent explanations of gender inequality in the legal profession, we focus on inquiries of commitment to work, performance, ideal worker expectations, practice settings, and job satisfaction among dimensions of workplace characteristics and examine their effects on women and men lawyers’ work schedules. Logistic regression results show that work schedules significantly vary by gender, parental role, and experience of workplace discrimination. We find that, although all parents experience types of discrimination, there are still major differences in work schedules between mothers and fathers. Our study adds to the gender debate of employment and organizations by examining quantitatively experiences of workplace discrimination.

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.

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

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

Directory of Open Access Journals (Sweden)

Ibraheem Alhassan

2015-06-01

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

Preventive maintenance optimization for a multi-component system under changing job shop schedule

International Nuclear Information System (INIS)

Zhou Xiaojun; Lu Zhiqiang; Xi Lifeng

2012-01-01

Variability and small lot size is a common feature for many discrete manufacturing processes designed to meet a wide array of customer needs. Because of this, job shop schedule often has to be continuously updated in reaction to changes in production plan. Generally, the aim of preventive maintenance is to ensure production effectiveness and therefore the preventive maintenance models must have the ability to be adaptive to changes in job shop schedule. In this paper, a dynamic opportunistic preventive maintenance model is developed for a multi-component system with considering changes in job shop schedule. Whenever a job is completed, preventive maintenance opportunities arise for all the components in the system. An optimal maintenance practice is dynamically determined by maximizing the short-term cumulative opportunistic maintenance cost savings for the system. The numerical example shows that the scheme obtained by the proposed model can effectively address the preventive maintenance scheduling problem caused by the changes in job shop schedule and is more efficient than the ones based on two other commonly used preventive maintenance models.

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

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.

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

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

Nurse Scheduling by Cooperative GA with Effective Mutation Operator

Science.gov (United States)

Ohki, Makoto

In this paper, we propose an effective mutation operators for Cooperative Genetic Algorithm (CGA) to be applied to a practical Nurse Scheduling Problem (NSP). The nurse scheduling is a very difficult task, because NSP is a complex combinatorial optimizing problem for which many requirements must be considered. In real hospitals, the schedule changes frequently. The changes of the shift schedule yields various problems, for example, a fall in the nursing level. We describe a technique of the reoptimization of the nurse schedule in response to a change. The conventional CGA is superior in ability for local search by means of its crossover operator, but often stagnates at the unfavorable situation because it is inferior to ability for global search. When the optimization stagnates for long generation cycle, a searching point, population in this case, would be caught in a wide local minimum area. To escape such local minimum area, small change in a population should be required. Based on such consideration, we propose a mutation operator activated depending on the optimization speed. When the optimization stagnates, in other words, when the optimization speed decreases, the mutation yields small changes in the population. Then the population is able to escape from a local minimum area by means of the mutation. However, this mutation operator requires two well-defined parameters. This means that user have to consider the value of these parameters carefully. To solve this problem, we propose a periodic mutation operator which has only one parameter to define itself. This simplified mutation operator is effective over a wide range of the parameter value.

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.

Randomized controlled trial of the effect of medical audit on AIDS prevention in general practice

DEFF Research Database (Denmark)

Sandbæk, Annelli

1999-01-01

OBJECTIVE: We aimed to evaluate the effect of a medical audit on AIDS prevention in general practice. METHODS: We conducted a prospective randomized controlled study performed as 'lagged intervention'. At the time of comparison, the intervention group had completed 6 months of audit including...... of such consultations initiated by the GPs. CONCLUSIONS: Medical audit had no observed effect on AIDS prevention in general practice. Udgivelsesdato: 1999-Oct...... a primary activity registration, feedback of own data and a meeting with colleagues and experts, and had received brief summaries of the meetings and reminders about the project (a full 'audit circle'). The participants were from general practices in Copenhagen and the Counties of Funen and Vejle, Denmark...

Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

Science.gov (United States)

Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

2010-10-05

In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

A randomized controlled trial comparing haemodynamic stability in ...

African Journals Online (AJOL)

Methods: Thirty two elderly patients scheduled for lower limb or pelvic surgery under spinal anaesthesia were randomized .... conducted and that their personal information would be kept .... file which was stored in a lockable filing drawer.

Congestion game scheduling for virtual drug screening optimization

Science.gov (United States)

Nikitina, Natalia; Ivashko, Evgeny; Tchernykh, Andrei

2018-02-01

In virtual drug screening, the chemical diversity of hits is an important factor, along with their predicted activity. Moreover, interim results are of interest for directing the further research, and their diversity is also desirable. In this paper, we consider a problem of obtaining a diverse set of virtual screening hits in a short time. To this end, we propose a mathematical model of task scheduling for virtual drug screening in high-performance computational systems as a congestion game between computational nodes to find the equilibrium solutions for best balancing the number of interim hits with their chemical diversity. The model considers the heterogeneous environment with workload uncertainty, processing time uncertainty, and limited knowledge about the input dataset structure. We perform computational experiments and evaluate the performance of the developed approach considering organic molecules database GDB-9. The used set of molecules is rich enough to demonstrate the feasibility and practicability of proposed solutions. We compare the algorithm with two known heuristics used in practice and observe that game-based scheduling outperforms them by the hit discovery rate and chemical diversity at earlier steps. Based on these results, we use a social utility metric for assessing the efficiency of our equilibrium solutions and show that they reach greatest values.

The effect of adaptive versus static practicing on student learning - evidence from a randomized field experiment

NARCIS (Netherlands)

van Klaveren, Chris; Vonk, Sebastiaan; Cornelisz, Ilja

2017-01-01

Schools and governments are increasingly investing in adaptive practice software. To date, the evidence whether adaptivity improves learning outcomes is limited and mixed. A large-scale randomized control trial is conducted in Dutch secondary schools to evaluate the effectiveness of an adaptive

Two-Stage Multi-Objective Collaborative Scheduling for Wind Farm and Battery Switch Station

Directory of Open Access Journals (Sweden)

Zhe Jiang

2016-10-01

Full Text Available In order to deal with the uncertainties of wind power, wind farm and electric vehicle (EV battery switch station (BSS were proposed to work together as an integrated system. In this paper, the collaborative scheduling problems of such a system were studied. Considering the features of the integrated system, three indices, which include battery swapping demand curtailment of BSS, wind curtailment of wind farm, and generation schedule tracking of the integrated system are proposed. In addition, a two-stage multi-objective collaborative scheduling model was designed. In the first stage, a day-ahead model was built based on the theory of dependent chance programming. With the aim of maximizing the realization probabilities of these three operating indices, random fluctuations of wind power and battery switch demand were taken into account simultaneously. In order to explore the capability of BSS as reserve, the readjustment process of the BSS within each hour was considered in this stage. In addition, the stored energy rather than the charging/discharging power of BSS during each period was optimized, which will provide basis for hour-ahead further correction of BSS. In the second stage, an hour-ahead model was established. In order to cope with the randomness of wind power and battery swapping demand, the proposed hour-ahead model utilized ultra-short term prediction of the wind power and the battery switch demand to schedule the charging/discharging power of BSS in a rolling manner. Finally, the effectiveness of the proposed models was validated by case studies. The simulation results indicated that the proposed model could realize complement between wind farm and BSS, reduce the dependence on power grid, and facilitate the accommodation of wind power.

DEVELOPMENT OF GENETIC ALGORITHM-BASED METHODOLOGY FOR SCHEDULING OF MOBILE ROBOTS

DEFF Research Database (Denmark)

Dang, Vinh Quang

problem is to minimize the total traveling time of the single mobile robot and thereby increase its availability. For the second scheduling problem, a fleet of mobile robots is considered together with a set of machines to carry out different types of tasks, e.g. pre-assembly or quality inspection. Some...... problem and finding optimal solutions for each one. However, the formulated mathematical models could only be applicable to small-scale problems in practice due to the significant increase of computation time as the problem size grows. Note that making schedules of mobile robots is part of real-time....... For the first scheduling problem, a single mobile robot is considered to collect and transport container of parts and empty them into machine feeders where needed. A limit on carrying capacity of the single mobile robot and hard time windows of part-feeding tasks are considered. The objective of the first...

Multi-Agent Based Beam Search for Real-Time Production Scheduling and Control Method, Software and Industrial Application

CERN Document Server

Kang, Shu Gang

2013-01-01

The Multi-Agent Based Beam Search (MABBS) method systematically integrates four major requirements of manufacturing production - representation capability, solution quality, computation efficiency, and implementation difficulty - within a unified framework to deal with the many challenges of complex real-world production planning and scheduling problems. Multi-agent Based Beam Search for Real-time Production Scheduling and Control introduces this method, together with its software implementation and industrial applications.  This book connects academic research with industrial practice, and develops a practical solution to production planning and scheduling problems. To simplify implementation, a reusable software platform is developed to build the MABBS method into a generic computation engine.  This engine is integrated with a script language, called the Embedded Extensible Application Script Language (EXASL), to provide a flexible and straightforward approach to representing complex real-world problems. ...

Travel time and concurrent-schedule choice: retrospective versus prospective control.

OpenAIRE

Davison, M; Elliffe, D

2000-01-01

Six pigeons were trained on concurrent variable-interval schedules in which two different travel times between alternatives, 4.5 and 0.5 s, were randomly arranged. In Part 1, the next travel time was signaled while the subjects were responding on each alternative. Generalized matching analyses of performance in the presence of the two travel-time signals showed significantly higher response and time sensitivity when the longer travel time was signaled compared to when the shorter time was sig...

Scheduling Algorithms for Maximizing Throughput with Zero-Forcing Beamforming in a MIMO Wireless System

Science.gov (United States)

Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

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

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Directory of Open Access Journals (Sweden)

Behrouz Afshar-Nadjafi

2014-01-01

Full Text Available Extensive research works have been carried out in resource constrained project scheduling problem. However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted. In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties. A mixed integer programming formulation is proposed for the problem. The resulting problem is NP-hard. So, we try to obtain a satisfying solution using simulated annealing (SA algorithm. The efficiency of the proposed algorithm is tested based on 150 randomly produced examples. Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.

A Randomized, Controlled Study of DTaP-IPV-HB-PRP-T, a Fully Liquid Hexavalent Vaccine, Administered in a 3-, 5- and 11- to 12-month Schedule.

Science.gov (United States)

Vesikari, Timo; Silfverdal, Sven-Arne; Jordanov, Emilia; Feroldi, Emmanuel

2017-01-01

To assess the immunogenicity and safety of a fully liquid, ready-to-use hexavalent DTaP-IPV-HB-PRP-T vaccine when administered in a 2 + 1 schedule at 3, 5 and 11-12 months of age. Phase III, randomized, active-controlled, observer-blind, multicenter study. Infants were randomized to receive DTaP-IPV-HB-PRP-T (N = 275) or a licensed control hexavalent vaccine (DTaP-IPV-HB//PRP~T: N = 275), both given in coadministration with Prevenar 13. Serum was analyzed for immune responses to all vaccine antigens. Noninferiority of DTaP-IPV-HB-PRP-T to the control vaccine was tested at completion of the primary series using predefined seroprotection (SP) rate and vaccine response (VR) rates. Safety was assessed using parental reports. Noninferiority of DTaP-IPV-HB-PRP-T to the control vaccine was demonstrated postdose 3 for each antigen, and the SP (for D, T, poliovirus 1, 2 and 3, hepatitis B and polyribosylribitol phosphate) and VR rates (for pertussis toxin and filamentous hemagglutinin) were high in each group. SP rates for D, T, polio 1, 2, 3 and VR rates for pertussis toxin and filamentous hemagglutinin were similar in each group. For hepatitis B, SP rate was slightly higher for DTaP-IPV-HB//PRP~T (99.6%) than DTaP-IPV-HB-PRP-T (96.4%), and for PRP, SP rate was higher for DTaP-IPV-HB-PRP-T (93.5%) than DTaP-IPV-HB//PRP~T (85.2%). For Prevenar 13, the SP rate was high for each serotype and similar for both groups. All vaccines were well tolerated. These study findings confirm the safety and immunogenicity and thus the suitability of this fully liquid hexavalent vaccine for administration in a 2 + 1 schedule.

Early surgery versus optimal current step-up practice for chronic pancreatitis (ESCAPE): design and rationale of a randomized trial.

Science.gov (United States)

Ahmed Ali, Usama; Issa, Yama; Bruno, Marco J; van Goor, Harry; van Santvoort, Hjalmar; Busch, Olivier R C; Dejong, Cornelis H C; Nieuwenhuijs, Vincent B; van Eijck, Casper H; van Dullemen, Hendrik M; Fockens, Paul; Siersema, Peter D; Gouma, Dirk J; van Hooft, Jeanin E; Keulemans, Yolande; Poley, Jan W; Timmer, Robin; Besselink, Marc G; Vleggaar, Frank P; Wilder-Smith, Oliver H; Gooszen, Hein G; Dijkgraaf, Marcel G W; Boermeester, Marja A

2013-03-18

In current practice, patients with chronic pancreatitis undergo surgical intervention in a late stage of the disease, when conservative treatment and endoscopic interventions have failed. Recent evidence suggests that surgical intervention early on in the disease benefits patients in terms of better pain control and preservation of pancreatic function. Therefore, we designed a randomized controlled trial to evaluate the benefits, risks and costs of early surgical intervention compared to the current stepwise practice for chronic pancreatitis. The ESCAPE trial is a randomized controlled, parallel, superiority multicenter trial. Patients with chronic pancreatitis, a dilated pancreatic duct (≥5 mm) and moderate pain and/or frequent flare-ups will be registered and followed monthly as potential candidates for the trial. When a registered patient meets the randomization criteria (i.e. need for opioid analgesics) the patient will be randomized to either early surgical intervention (group A) or optimal current step-up practice (group B). An expert panel of chronic pancreatitis specialists will oversee the assessment of eligibility and ensure that allocation to either treatment arm is possible. Patients in group A will undergo pancreaticojejunostomy or a Frey-procedure in case of an enlarged pancreatic head (≥4 cm). Patients in group B will undergo a step-up practice of optimal medical treatment, if needed followed by endoscopic interventions, and if needed followed by surgery, according to predefined criteria. Primary outcome is pain assessed with the Izbicki pain score during a follow-up of 18 months. Secondary outcomes include complications, mortality, total direct and indirect costs, quality of life, pancreatic insufficiency, alternative pain scales, length of hospital admission, number of interventions and pancreatitis flare-ups. For the sample size calculation we defined a minimal clinically relevant difference in the primary endpoint as a difference of at least

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

Randomized clinical trial on the use of antispasmodic drugs in barium enema: impact on radiological practice

International Nuclear Information System (INIS)

Goei, Reginald; Kessels, Alphons H.; Nix, Maarten; Knipschild, Paul G.

2000-01-01

Purpose: To assess the willingness of radiologists to change their practice when the results of a randomized clinical trial (RCT) on the use of antispasmodic drugs in barium enema are presented. Materials and Methods: During the years 1994 and 1995 two postal questionnaires were sent to 481 practicing radiologists who were all members of the Netherlands Society of Radiology. In the first questionnaire the respondents were asked to give the characteristics of their practices in performing daily barium enema. The data from this questionnaire was used as a reference. The second questionnaire was sent to the respondents together with an abstract on the randomized clinical trial supporting the use of antispasmodic drugs in barium enema. We also indicated a preference for Buscopan over Glucagon as the antispasmodic drug. The willingness to change prescription habits was measured by comparing the data of the two questionnaires. Results: Of 481 practicing radiologists, 312 responded to the first questionnaire and gave information of their prescription habits (response rate 64%). These 312 responders were sent an abstract of the RCT and were asked to fill out a second questionnaire to determine their willingness to change their practice. Two hundred and sixty-seven radiologists responded (response rate 86%). A significant number of 119 (51%) were willing to increase the use of antispasmodic drugs. A significant number of 128 (55%) chose to increase the use of Buscopan, while a significant number of 81 (32%) were willing to decrease the use of Glucagon. Conclusion: Direct exposure to the results of an RCT recommending the use of antispasmodic drugs in barium enema, especially Buscopan, is likely to increase its use by practicing radiologists

Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed

2015-12-01

This paper addresses the joint coordinated scheduling and power control 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, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZ). The paper considers the problem of scheduling users to PZs and determining their power levels (PL), by maximizing the weighted sum-rate under the practical constraints 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 joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximumweight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed crosslayer scheme provides appreciable performance improvement as compared to schemes from recent literature.

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 and Power Control in Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

This paper addresses the joint coordinated scheduling and power control 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, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZ). The paper considers the problem of scheduling users to PZs and determining their power levels (PL), by maximizing the weighted sum-rate under the practical constraints 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 joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximumweight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed crosslayer scheme provides appreciable performance improvement as compared to schemes from recent literature.

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.

A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy

Directory of Open Access Journals (Sweden)

Esra Ekinci

2007-01-01

Full Text Available We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.

Moving from Efficacy to Effectiveness in Cognitive Behavioral Therapy for Psychosis: A Randomized Clinical Practice Trial

Science.gov (United States)

Lincoln, Tania M.; Ziegler, Michael; Mehl, Stephanie; Kesting, Marie-Luise; Lullmann, Eva; Westermann, Stefan; Rief, Winfried

2012-01-01

Objective: Randomized controlled trials have attested the efficacy of cognitive behavioral therapy (CBT) in reducing psychotic symptoms. Now, studies are needed to investigate its effectiveness in routine clinical practice settings. Method: Eighty patients with schizophrenia spectrum disorders who were seeking outpatient treatment were randomized…

Heuristics in dynamic scheduling : A practical framework with a case study in elevator dispatching

NARCIS (Netherlands)

De Jong, J.L.

2012-01-01

Dynamic scheduling problems are ubiquitous: traffic lights, elevators, planning of manufacturing plants, air traffic control, etc. Tasks have to be put on a timeline as smart as possible to reach certain goals. These goals may be related to production costs, the use of (scarce) resources, deadlines.

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

Interleaved Practice with Multiple Representations: Analyses with Knowledge Tracing Based Techniques

Science.gov (United States)

Rau, Martina A.; Pardos, Zachary A.

2012-01-01

The goal of this paper is to use Knowledge Tracing to augment the results obtained from an experiment that investigated the effects of practice schedules using an intelligent tutoring system for fractions. Specifically, this experiment compared different practice schedules of multiple representations of fractions: representations were presented to…

Safety of a 3-weekly schedule of carboplatin plus pegylated liposomal doxorubicin as first line chemotherapy in patients with ovarian cancer: preliminary results of the MITO-2 randomized trial

International Nuclear Information System (INIS)

Pignata, Sandro; Del Gaizo, Filomena; Naglieri, Emanuele; Ferro, Antonella; Musso, Pietro; D'Arco, Alfonso Maria; Sorio, Roberto; Pisano, Carmela; Di Maio, Massimo; Signoriello, Giuseppe; Annunziata, Annalisa; Scambia, Giovanni; Perrone, Francesco; Savarese, Antonella; Breda, Enrico; Scollo, Paolo; De Vivo, Rocco; Rossi, Emanuela; Gebbia, Vittorio; Natale, Donato

2006-01-01

The MITO-2 (Multicentre Italian Trials in Ovarian cancer) study is a randomized phase III trial comparing carboplatin plus paclitaxel to carboplatin plus pegylated liposomal doxorubicin in first-line chemotherapy of patients with ovarian cancer. Due to the paucity of published phase I data on the 3-weekly experimental schedule used, an early safety analysis was planned. Patients with ovarian cancer (stage Ic-IV), aged < 75 years, ECOG performance status ≤ 2, were randomized to carboplatin AUC 5 plus paclitaxel 175 mg/m 2 , every 3 weeks or to carboplatin AUC 5 plus pegylated liposomal doxorubicin 30 mg/m 2 , every 3 weeks. Treatment was planned for 6 cycles. Toxicity was coded according to the NCI-CTC version 2.0. The pre-planned safety analysis was performed in July 2004. Data from the first 50 patients treated with carboplatin plus pegylated liposomal doxorubicin were evaluated. Median age was 60 years (range 34–75). Forty-three patients (86%) completed 6 cycles. Two thirds of the patients had at least one cycle delayed due to toxicity, but 63% of the cycles were administered on time. In most cases the reason for chemotherapy delay was neutropenia or other hematological toxicity. No delay due to palmar-plantar erythrodysesthesia (PPE) was recorded. No toxic death was recorded. Reported hematological toxicities were: grade (G) 3 anemia 16%, G3/G4 neutropenia 36% and 10% respectively, G3/4 thrombocytopenia 22% and 4% respectively. Non-haematological toxicity was infrequent: pulmonary G1 6%, heart rhythm G1 4%, liver toxicity G1 6%, G2 4% and G3 2%. Complete hair loss was reported in 6% of patients, and G1 neuropathy in 2%. PPE was recorded in 14% of the cases (G1 10%, G2 2%, G3 2%). This safety analysis shows that the adopted schedule of carboplatin plus pegylated liposomal doxorubicin given every 3 weeks is feasible as first line treatment in ovarian cancer patients, although 37% of the cycles were delayed due to haematological toxicity. Toxicities that are

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

OpenAIRE

Katre, Amar N.

2014-01-01

Introduction. The practice of modern pediatric dentistry requires delivery of quality care in combination with adherence to excellent business as well as time management principles. A definite appointment schedule should be presented to the parents on the first or second appointment. More importantly, the prescribed schedule should be followed to the best of the professional abilities of the pediatric dentist. Aims. The aim of the study was to assess the co-relation between appointment schedu...

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems.

Science.gov (United States)

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

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…

Random Assignment: Practical Considerations from Field Experiments.

Science.gov (United States)

Dunford, Franklyn W.

1990-01-01

Seven qualitative issues associated with randomization that have the potential to weaken or destroy otherwise sound experimental designs are reviewed and illustrated via actual field experiments. Issue areas include ethics and legality, liability risks, manipulation of randomized outcomes, hidden bias, design intrusiveness, case flow, and…

Integration of scheduling and discrete event simulation systems to improve production flow planning

Science.gov (United States)

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

2016-08-01

The increased availability of data and computer-aided technologies such as MRPI/II, ERP and MES system, allowing producers to be more adaptive to market dynamics and to improve production scheduling. Integration of production scheduling and computer modelling, simulation and visualization systems can be useful in the analysis of production system constraints related to the efficiency of manufacturing systems. A integration methodology based on semi-automatic model generation method for eliminating problems associated with complexity of the model and labour-intensive and time-consuming process of simulation model creation is proposed. Data mapping and data transformation techniques for the proposed method have been applied. This approach has been illustrated through examples of practical implementation of the proposed method using KbRS scheduling system and Enterprise Dynamics simulation system.

New preemptive scheduling for OBS networks considering cascaded wavelength conversion

Science.gov (United States)

Gao, Xingbo; Bassiouni, Mostafa A.; Li, Guifang

2009-05-01

In this paper we introduce a new preemptive scheduling technique for next generation optical burst-switched networks considering the impact of cascaded wavelength conversions. It has been shown that when optical bursts are transmitted all optically from source to destination, each wavelength conversion performed along the lightpath may cause certain signal-to-noise deterioration. If the distortion of the signal quality becomes significant enough, the receiver would not be able to recover the original data. Accordingly, subject to this practical impediment, we improve a recently proposed fair channel scheduling algorithm to deal with the fairness problem and aim at burst loss reduction simultaneously in optical burst switching. In our scheme, the dynamic priority associated with each burst is based on a constraint threshold and the number of already conducted wavelength conversions among other factors for this burst. When contention occurs, a new arriving superior burst may preempt another scheduled one according to their priorities. Extensive simulation results have shown that the proposed scheme further improves fairness and achieves burst loss reduction as well.

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…

Effective Schedule and Cost Management as a Product Development Lead

Science.gov (United States)

Simmons, Cynthia

2015-01-01

The presentation will be given at the 26th Annual Thermal Fluids Analysis Workshop (TFAWS 2015) hosted by the Goddard SpaceFlight Center (GSFC) Thermal Engineering Branch (Code 545). This course provides best practices, helpful tools and lessons learned for staying on plan and day-to-day management of Subsystem flight development after getting Project approval for your Subsystem schedule and budget baseline.

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

Generation and Analysis of Constrained Random Sampling Patterns

DEFF Research Database (Denmark)

Pierzchlewski, Jacek; Arildsen, Thomas

2016-01-01

Random sampling is a technique for signal acquisition which is gaining popularity in practical signal processing systems. Nowadays, event-driven analog-to-digital converters make random sampling feasible in practical applications. A process of random sampling is defined by a sampling pattern, which...... indicates signal sampling points in time. Practical random sampling patterns are constrained by ADC characteristics and application requirements. In this paper, we introduce statistical methods which evaluate random sampling pattern generators with emphasis on practical applications. Furthermore, we propose...... algorithm generates random sampling patterns dedicated for event-driven-ADCs better than existed sampling pattern generators. Finally, implementation issues of random sampling patterns are discussed....

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.

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.

Pharmacists correcting schedule II prescriptions: DEA flip-flops continue.

Science.gov (United States)

Abood, Richard R

2010-12-01

The Drug Enforcement Administration (DEA) has in recent years engaged in flip-flopping over important policy decisions. The most recent example involved whether a pharmacist can correct a written schedule II prescription upon verification with the prescriber. For several years the DEA's policy permitted this practice. Then the DEA issued a conflicting policy statement in 2007 in the preamble to the multiple schedule II prescription regulation, causing a series of subsequent contradictory statements ending with the policy that pharmacists should follow state law or policy until the Agency issues a regulation. It is doubtful that the DEA's opinion in the preamble would in itself constitute legal authority, or that the Agency would try to enforce the opinion. Nonetheless, these flip-flop opinions have confused pharmacists, caused some pharmacies to have claims rejected by third party payors, and most likely have inconvenienced patients.

Field Engineers' Scheduling at Oil Rigs: a Case Study

Directory of Open Access Journals (Sweden)

Y. S. Usmani

2012-02-01

Full Text Available Oil exploration and production operations face a number of challenges. Professional planners have to design solutions for various practical problems or issues. However, the time consumed is often very extensive because of the large number of possible solutions. Further, the matter of choosing the best solution remains. The present paper investigates a problem related to leading companies in the energy and chemical manufacturing sector of the oil and gas industry. Each company’s field engineers are expensive and valuable assets. Therefore, an optimized roster is rather important. In the present paper, the objective is to design a field engineers’ schedule which would be both feasible and satisfying towards the various demands of rigs, with minimum operational cost to the company. An efficient and quick optimization technique is presented to schedule the shifts of field engineers.

Design of Gain Scheduling Control Using State Derivative Feedback

Directory of Open Access Journals (Sweden)

Lázaro Ismael Hardy Llins

2017-01-01

Full Text Available In recent years, the study of systems subject to time-varying parameters has awakened the interest of many researchers. The gain scheduling control strategy guarantees a good performance for systems of this type and also is considered as the simplest to deal with problems of this nature. Moreover, the class of systems in which the state derivative signals are easier to obtain than the state signals, such as in the control for reducing vibrations in a mechanical system, has gained an important hole in control theory. Considering those ideas, we propose sufficient conditions via LMI for designing a gain scheduling controller using state derivative feedback. The D-stability methodology was used for improving the performance of the transitory response. Practical implementation in an active suspension system and comparison with other methods validates the efficiency of the proposed strategy.

Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals

Directory of Open Access Journals (Sweden)

Peng Guo

2013-04-01

Full Text Available Railway container terminals, where gantry cranes are responsible for loading and unloading containers between freight trains and yards, are important hubs of hinterland logistics transportation. Terminal managers confront the challenge in improving the efficiency of their service. As the most expensive equipment in a terminal, the operational performance of gantry cranes is a crucial factor. In this paper, the gantry crane scheduling problem of railway container terminals is investigated. A mixed integer programming model which considers the effect of dwelling position dependent processing times is formulated. In addition, the safety distances, the travel times and the non-crossing requirement of cranes are incorporated in the mathematical model. A novel discrete artificial bee colony algorithm is presented to solve the intractable scheduling problem. Computational experiments are conducted to evaluate the proposed algorithm on some randomly constructed instances based on typical terminal operational data. Experimental results show that the proposed approach can obtain near optimal solutions for the investigated problem in a reasonable computational time.

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

DEFF Research Database (Denmark)

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

2017-01-01

BACKGROUND AND PURPOSE: The study will test the hypothesis that preventive topical steroid treatment instituted from start of radiotherapy can ameliorate acute radiation dermatitis. Subgroups of increased risk of dermatitis are included. MATERIAL AND METHODS: A double blinded randomized trial...... of acute radiation dermatitis in breast cancer patients treated with adjuvant RT, independent of RT schedule. Preventive application of a potent corticosteroid cream should be used in the routine and instituted at the start of RT....... schedules as well as for anatomical sites, skin type, breast size and BMI. Patients treated the irradiated area during the radiation period and two weeks following cessation of radiation. RESULTS: Patients receiving hypofraction RT developed less skin reactions than those treated with conventional RT...

A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags

Directory of Open Access Journals (Sweden)

Angela Hsiang-Ling Chen

2016-09-01

Full Text Available Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP, improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving the RCPSP and its multi-mode variations, there is no standardized procedure that can guide project management practitioners in their scheduling tasks. This is mainly because many of the proposed approaches are either based on unrealistic/oversimplified scenarios or they propose solution procedures not easily applicable or even feasible in real-life situations. In this study, we solve a more true-to-life and complex model, Multimode RCPSP with minimal and maximal time lags (MRCPSP/max. The complexity of the model solved is presented, and the practicality of the proposed approach is justified depending on only information that is available for every project regardless of its industrial context. The results confirm that it is possible to determine a robust makespan and to calculate an execution time-frame with gaps lower than 11% between their lower and upper bounds. In addition, in many instances, the solved lower bound obtained was equal to the best-known optimum.

Stochastic short-term maintenance scheduling of GENCOs in an oligopolistic electricity market

International Nuclear Information System (INIS)

Fotouhi Ghazvini, Mohammad Ali; Canizes, Bruno; Vale, Zita; Morais, Hugo

2013-01-01

Highlights: ► Decision making under uncertainty. ► Stochastic Mixed Integer Quadratic Programming applied to short-term maintenance scheduling. ► Outage scheduling in Oligopolistic electricity markets. ► Generation companies maintenance scheduling. -- Abstract: In the proposed model, the independent system operator (ISO) provides the opportunity for maintenance outage rescheduling of generating units before each short-term (ST) time interval. Long-term (LT) scheduling for 1 or 2 years in advance is essential for the ISO and the generation companies (GENCOs) to decide their LT strategies; however, it is not possible to be exactly followed and requires slight adjustments. The Cournot-Nash equilibrium is used to characterize the decision-making procedure of an individual GENCO for ST intervals considering the effective coordination with LT plans. Random inputs, such as parameters of the demand function of loads, hourly demand during the following ST time interval and the expected generation pattern of the rivals, are included as scenarios in the stochastic mixed integer program defined to model the payoff-maximizing objective of a GENCO. Scenario reduction algorithms are used to deal with the computational burden. Two reliability test systems were chosen to illustrate the effectiveness of the proposed model for the ST decision-making process for future planned outages from the point of view of a GENCO.

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

How to Measure Motivational Interviewing Fidelity in Randomized Controlled Trials: Practical Recommendations.

Science.gov (United States)

Jelsma, Judith G M; Mertens, Vera-Christina; Forsberg, Lisa; Forsberg, Lars

2015-07-01

Many randomized controlled trials in which motivational interviewing (MI) is a key intervention make no provision for the assessment of treatment fidelity. This methodological shortcoming makes it impossible to distinguish between high- and low-quality MI interventions, and, consequently, to know whether MI provision has contributed to any intervention effects. This article makes some practical recommendations for the collection, selection, coding and reporting of MI fidelity data, as measured using the Motivational Interviewing Treatment Integrity Code. We hope that researchers will consider these recommendations and include MI fidelity measures in future studies. Copyright © 2015 Elsevier Inc. All rights reserved.

Evaluating Visual Activity Schedules as Evidence-Based Practice for Individuals with Autism Spectrum Disorders

Science.gov (United States)

Knight, Victoria; Sartini, Emily; Spriggs, Amy D.

2015-01-01

A comprehensive review of the literature was conducted for articles published between 1993 and 2013 to evaluate the quality of the Visual Activity Schedules (VAS) literature using current evidence-based criteria developed by Horner et al. (Except Child 71:165-179, 2005). Authors sought to determine whether VAS can be considered an evidence-based…

Practice schedules for surgical skills: the role of task characteristics and proactive interference on psychomotor skills acquisition.

Science.gov (United States)

Willis, Ross E; Curry, Eileen; Gomez, Pedro Pablo

2013-01-01

Although break periods during training sessions are desirable, it is unclear what learners should do during these breaks. Some educators recommend that learners abstain from all task-related practice; however, it is possible that switching to an alternate exercise during break periods can also be effective. The construct of proactive interference (PI) posits that new learning is disrupted by prior learning. PI can be "released" when the nature of the task is changed after several practice trials. In this study, we examined the existence of PI in motor learning under 5 training conditions that differed in contrast to a target exercise. Preclinical medical students (n = 75) performed 1 trial of peg transfer as a pretest. Participants were then randomly assigned to 1 of 5 training conditions: mass practice, similar exercise (laparoscopic bean transfer), dissimilar exercise (open suturing), observation, or rest. Participants in the mass practice condition practiced peg transfer in 3 training blocks of 15 minutes, each separated by a 5-minute break. Participants in the other conditions performed 3 training blocks consisting of 15 minutes of peg transfer followed by an interspersed alternate exercise. On completion of 3 training blocks, participants performed 1 additional peg transfer trial as a posttest. Despite having trained for the same amount of time on the target task, Analysis of Covariance on posttest scores using pretest scores as the covariate indicated a significant main effect for training condition (p = 0.009). Participants engaging in mass practice performed significantly worse than participants in the dissimilar (p = 0.012), observation (p = 0.022), and rest (p < 0.001) conditions. Additionally, participants in the similar exercise condition performed worse than participants in the rest condition (p = 0.03). When learning a laparoscopic task, a break comprised of dissimilar practice or unrelated activities is effective in releasing PI and improving

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.

Alternative Work Schedules: Many Agencies Do Not Allow Employees the Full Flexibility Permitted by Law. Report to Congressional Committees.

Science.gov (United States)

General Accounting Office, Washington, DC. General Government Div.

A review was conducted of the extent to which selected federal agencies are allowing employees to use alternative work schedules (AWS) as authorized by the Federal Employees Flexible and Compressed Work Schedules Act. The statute permits, rather than requires, agencies to institute AWS programs. The study surveyed the policies and practices of 59…

Aging based maintenance and reinvestment scheduling of electric distribution

Energy Technology Data Exchange (ETDEWEB)

Korpijarvi, J.

2012-07-01

The maintenance of electric distribution network is a topical question for distribution system operators because of increasing significance of failure costs. In this dissertation the maintenance practices of the distribution system operators are analyzed and a theory for scheduling maintenance activities and reinvestment of distribution components is created. The scheduling is based on the deterioration of components and the increasing failure rates due to aging. The dynamic programming algorithm is used as a solving method to maintenance problem which is caused by the increasing failure rates of the network. The other impacts of network maintenance like environmental and regulation reasons are not included to the scope of this thesis. Further the tree trimming of the corridors and the major disturbance of the network are not included to the problem optimized in this thesis. For optimizing, four dynamic programming models are presented and the models are tested. Programming is made in VBA-language to the computer. For testing two different kinds of test networks are used. Because electric distribution system operators want to operate with bigger component groups, optimal timing for component groups is also analyzed. A maintenance software package is created to apply the presented theories in practice. An overview of the program is presented (orig.)

From Preemptive to Non-preemptive Scheduling Using Rejections

OpenAIRE

Lucarelli , Giorgio; Srivastav , Abhinav; Trystram , Denis

2016-01-01

International audience; We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platforms cannot be interrupted or migrated once they start their execution (due ...

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

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.

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.

Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling

Directory of Open Access Journals (Sweden)

Tomáš Macák

2016-01-01

Full Text Available Time management has a crucial role in organizations and also in our personal lives. Managerial scheduling is an important tool for the time management, especially It can serve as a tool for the first phase, of time management - namely for effective planning. This paper focusses on finding the best possible setting for determining significant the best layout for activities according to the criteria of urgency and importance using a modified steepest ascent method, which can be referred as dynamic scheduling. This term indicates the nature of the method; wherein the experimental design space is changed to look for the best conditions for adjustment factors influencing a managerial process. Existing methods for layout optimization mentioned in the literature and conventionally implemented in practice have only shown local optima.

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems

Directory of Open Access Journals (Sweden)

Xuejun Li

2015-01-01

Full Text Available Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO and Particle Swarm Optimization (PSO have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

Randomized clinical trial to evaluate mental practice in enhancing advanced laparoscopic surgical performance.

Science.gov (United States)

Louridas, M; Bonrath, E M; Sinclair, D A; Dedy, N J; Grantcharov, T P

2015-01-01

Mental practice, the cognitive rehearsal of a task without physical movement, is known to enhance performance in sports and music. Investigation of this technique in surgery has been limited to basic operations. The purpose of this study was to develop mental practice scripts, and to assess their effect on advanced laparoscopic skills and surgeon stress levels in a crisis scenario. Twenty senior surgical trainees were randomized to either conventional training or mental practice groups, the latter being trained by an expert performance psychologist. Participants' skills were assessed while performing a porcine laparoscopic jejunojejunostomy as part of a crisis scenario in a simulated operating room, using the Objective Structured Assessment of Technical Skill (OSATS) and bariatric OSATS (BOSATS) instruments. Objective and subjective stress parameters were measured, as well as non-technical skills using the Non-Technical Skills for Surgeons rating tool. An improvement in OSATS (P = 0.003) and BOSATS (P = 0.003) scores was seen in the mental practice group compared with the conventional training group. Seven of ten trainees improved their technical performance during the crisis scenario, whereas four of the ten conventionally trained participants deteriorated. Mental imagery ability improved significantly following mental practice training (P = 0.011), but not in the conventional group (P = 0.083). No differences in objective or subjective stress levels or non-technical skills were evident. Mental practice improves technical performance for advanced laparoscopic tasks in the simulated operating room, and allows trainees to maintain or improve their performance despite added stress. © 2014 BJS Society Ltd. Published by John Wiley & Sons Ltd.

Providing frequency regulation reserve services using demand response scheduling

International Nuclear Information System (INIS)

Motalleb, Mahdi; Thornton, Matsu; Reihani, Ehsan; Ghorbani, Reza

2016-01-01

Highlights: • Proposing a market model for contingency reserve services using demand response. • Considering transient limitations of grid frequency for inverter-based generations. • Price-sensitive scheduling of residential batteries and water heaters using dynamic programming. • Calculating the profits of both generation companies and demand response aggregators. - Abstract: During power grid contingencies, frequency regulation is a primary concern. Historically, frequency regulation during contingency events has been the sole responsibility of the power utility. We present a practical method of using distributed demand response scheduling to provide frequency regulation during contingency events. This paper discusses the implementation of a control system model for the use of distributed energy storage systems such as battery banks and electric water heaters as a source of ancillary services. We present an algorithm which handles the optimization of demand response scheduling for normal operation and during contingency events. We use dynamic programming as an optimization tool. A price signal is developed using optimal power flow calculations to determine the locational marginal price of electricity, while sensor data for water usage is also collected. Using these inputs to dynamic programming, the optimal control signals are given as output. We assume a market model in which distributed demand response resources are sold as a commodity on the open market and profits from demand response aggregators as brokers of distributed demand response resources can be calculated. In considering control decisions for regulation of transient changes in frequency, we focus on IEEE standard 1547 in order to prevent the safety shut-off of inverter-based generation and further exacerbation of frequency droop. This method is applied to IEEE case 118 as a demonstration of the method in practice.

Multi-objective group scheduling with learning effect in the cellular manufacturing system

Directory of Open Access Journals (Sweden)

Mohammad Taghi Taghavi-fard

2011-01-01

Full Text Available Group scheduling problem in cellular manufacturing systems consists of two major steps. Sequence of parts in each part-family and the sequence of part-family to enter the cell to be processed. This paper presents a new method for group scheduling problems in flow shop systems where it minimizes makespan (Cmax and total tardiness. In this paper, a position-based learning model in cellular manufacturing system is utilized where processing time for each part-family depends on the entrance sequence of that part. The problem of group scheduling is modeled by minimizing two objectives of position-based learning effect as well as the assumption of setup time depending on the sequence of parts-family. Since the proposed problem is NP-hard, two meta heuristic algorithms are presented based on genetic algorithm, namely: Non-dominated sorting genetic algorithm (NSGA-II and non-dominated rank genetic algorithm (NRGA. The algorithms are tested using randomly generated problems. The results include a set of Pareto solutions and three different evaluation criteria are used to compare the results. The results indicate that the proposed algorithms are quite efficient to solve the problem in a short computational time.

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

Planning and scheduling for petroleum refineries using mathematical programming

Directory of Open Access Journals (Sweden)

Joly M.

2002-01-01

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

Dispatching Plan Based on Route Optimization Model Considering Random Wind for Aviation Emergency Rescue

Directory of Open Access Journals (Sweden)

Ming Zhang

2016-01-01

Full Text Available Aviation emergency rescue is an effective means of nature disaster relief that is widely used in many countries. The dispatching plan of aviation emergency rescue guarantees the efficient implementation of this relief measure. The conventional dispatching plan that does not consider random wind factors leads to a nonprecise quick-responsive scheme and serious safety issues. In this study, an aviation emergency rescue framework that considers the influence of random wind at flight trajectory is proposed. In this framework, the predicted wind information for a disaster area is updated by using unscented Kalman filtering technology. Then, considering the practical scheduling problem of aircraft emergency rescue at present, a multiobjective model is established in this study. An optimization model aimed at maximizing the relief supply satisfaction, rescue priority satisfaction, and minimizing total rescue flight distance is formulated. Finally, the transport times of aircraft with and without the influence of random wind are analyzed on the basis of the data of an earthquake disaster area. Results show that the proposed dispatching plan that considers the constraints of updated wind speed and direction is highly applicable in real operations.

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

Improving low-wage, midsized employers' health promotion practices: a randomized controlled trial.

Science.gov (United States)

Hannon, Peggy A; Harris, Jeffrey R; Sopher, Carrie J; Kuniyuki, Alan; Ghosh, Donetta L; Henderson, Shelly; Martin, Diane P; Weaver, Marcia R; Williams, Barbara; Albano, Denise L; Meischke, Hendrika; Diehr, Paula; Lichiello, Patricia; Hammerback, Kristen E; Parks, Malcolm R; Forehand, Mark

2012-08-01

The Guide to Community Preventive Services (Community Guide) offers evidence-based intervention strategies to prevent chronic disease. The American Cancer Society (ACS) and the University of Washington Health Promotion Research Center co-developed ACS Workplace Solutions (WPS) to improve workplaces' implementation of Community Guide strategies. To test the effectiveness of WPS for midsized employers in low-wage industries. Two-arm RCT; workplaces were randomized to receive WPS during the study (intervention group) or at the end of the study (delayed control group). Forty-eight midsized employers (100-999 workers) in King County WA. WPS provides employers one-on-one consulting with an ACS interventionist via three meetings at the workplace. The interventionist recommends best practices to adopt based on the workplace's current practices, provides implementation toolkits for the best practices the employer chooses to adopt, conducts a follow-up visit at 6 months, and provides technical assistance. Employers' implementation of 16 best practices (in the categories of insurance benefits, health-related policies, programs, tracking, and health communications) at baseline (June 2007-June 2008) and 15-month follow-up (October 2008-December 2009). Data were analyzed in 2010-2011. Intervention employers demonstrated greater improvement from baseline than control employers in two of the five best-practice categories; implementing policies (baseline scores: 39% program, 43% control; follow-up scores: 49% program, 45% control; p=0.013) and communications (baseline scores: 42% program, 44% control; follow-up scores: 76% program, 55% control; p=0.007). Total best-practice implementation improvement did not differ between study groups (baseline scores: 32% intervention, 37% control; follow-up scores: 39% intervention, 42% control; p=0.328). WPS improved employers' health-related policies and communications but did not improve insurance benefits design, programs, or tracking. Many

Research on logistics scheduling based on PSO

Science.gov (United States)

Bao, Huifang; Zhou, Linli; Liu, Lei

2017-08-01

With the rapid development of e-commerce based on the network, the logistics distribution support of e-commerce is becoming more and more obvious. The optimization of vehicle distribution routing can improve the economic benefit and realize the scientific of logistics [1]. Therefore, the study of logistics distribution vehicle routing optimization problem is not only of great theoretical significance, but also of considerable value of value. Particle swarm optimization algorithm is a kind of evolutionary algorithm, which is based on the random solution and the optimal solution by iteration, and the quality of the solution is evaluated through fitness. In order to obtain a more ideal logistics scheduling scheme, this paper proposes a logistics model based on particle swarm optimization algorithm.

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Directory of Open Access Journals (Sweden)

Angela Hsiang-Ling Chen

2014-09-01

Full Text Available Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP, a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC—an effective and powerful meta-heuristic—to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every

Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

Directory of Open Access Journals (Sweden)

Różycki Rafał

2016-09-01

Full Text Available In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.

How random are random numbers generated using photons?

International Nuclear Information System (INIS)

Solis, Aldo; Angulo Martínez, Alí M; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U’Ren, Alfred B; Hirsch, Jorge G

2015-01-01

Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined. (paper)

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.

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.

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

Discordance between 'actual' and 'scheduled' check-in times at a heart failure clinic.

Science.gov (United States)

Gorodeski, Eiran Z; Joyce, Emer; Gandesbery, Benjamin T; Blackstone, Eugene H; Taylor, David O; Tang, W H Wilson; Starling, Randall C; Hachamovitch, Rory

2017-01-01

A 2015 Institute Of Medicine statement "Transforming Health Care Scheduling and Access: Getting to Now", has increased concerns regarding patient wait times. Although waiting times have been widely studied, little attention has been paid to the role of patient arrival times as a component of this phenomenon. To this end, we investigated patterns of patient arrival at scheduled ambulatory heart failure (HF) clinic appointments and studied its predictors. We hypothesized that patients are more likely to arrive later than scheduled, with progressively later arrivals later in the day. Using a business intelligence database we identified 6,194 unique patients that visited the Cleveland Clinic Main Campus HF clinic between January, 2015 and January, 2017. This clinic served both as a tertiary referral center and a community HF clinic. Transplant and left ventricular assist device (LVAD) visits were excluded. Punctuality was defined as the difference between 'actual' and 'scheduled' check-in times, whereby negative values (i.e., early punctuality) were patients who checked-in early. Contrary to our hypothesis, we found that patients checked-in late only a minority of the time (38% of visits). Additionally, examining punctuality by appointment hour slot we found that patients scheduled after 8AM had progressively earlier check-in times as the day progressed (P < .001 for trend). In both a Random Forest-Regression framework and linear regression models the most important risk-adjusted predictors of early punctuality were: later in the day appointment hour slot, patient having previously been to the hospital, age in the early 70s, and white race. Patients attending a mixed population ambulatory HF clinic check-in earlier than scheduled times, with progressive discrepant intervals throughout the day. This finding may have significant implications for provider utilization and resource planning in order to maximize clinic efficiency. The impact of elective early arrival on

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

Transfusion practice and complications after laparotomy - an observational analysis of a randomized clinical trial

DEFF Research Database (Denmark)

Nielsen, Kamilla; Meyhoff, C S; Johansson, P I

2012-01-01

Background  Transfusion of allogeneic red blood cells (RBC) may be associated with side effects. This study aimed to assess whether an association could be detected between transfusion practice and the occurrence of complications after laparotomy. Study design and methods  This study is an observ......Background  Transfusion of allogeneic red blood cells (RBC) may be associated with side effects. This study aimed to assess whether an association could be detected between transfusion practice and the occurrence of complications after laparotomy. Study design and methods  This study...... is an observational analysis of data from a randomized trial in 1400 patients who underwent laparotomy. A subgroup of 224 transfused patients with an intraoperative blood loss ≥200 ml were included in the analysis. Logistic regression analysis was used to investigate risk factors for postoperative complications...

Population-based versus practice-based recall for childhood immunizations: a randomized controlled comparative effectiveness trial.

Science.gov (United States)

Kempe, Allison; Saville, Alison; Dickinson, L Miriam; Eisert, Sheri; Reynolds, Joni; Herrero, Diana; Beaty, Brenda; Albright, Karen; Dibert, Eva; Koehler, Vicky; Lockhart, Steven; Calonge, Ned

2013-06-01

We compared the effectiveness and cost-effectiveness of population-based recall (Pop-recall) versus practice-based recall (PCP-recall) at increasing immunizations among preschool children. This cluster-randomized trial involved children aged 19 to 35 months needing immunizations in 8 rural and 6 urban Colorado counties. In Pop-recall counties, recall was conducted centrally using the Colorado Immunization Information System (CIIS). In PCP-recall counties, practices were invited to attend webinar training using CIIS and offered financial support for mailings. The percentage of up-to-date (UTD) and vaccine documentation were compared 6 months after recall. A mixed-effects model assessed the association between intervention and whether a child became UTD. Ten of 195 practices (5%) implemented recall in PCP-recall counties. Among children needing immunizations, 18.7% became UTD in Pop-recall versus 12.8% in PCP-recall counties (P immunization rates in preschool children.

Overcoming barriers to scheduling embedded generation to support distribution networks

Energy Technology Data Exchange (ETDEWEB)

Wright, A.J.; Formby, J.R.

2000-07-01

Current scheduling of embedded generation for distribution in the UK is limited and patchy. Some DNOs actively schedule while others do none. The literature on the subject is mainly about accommodating volatile wind output, and optimising island systems, for both cost of supply and network stability. The forthcoming NETA will lower prices, expose unpredictable generation to imbalance markets and could introduce punitive constraint payments on DNOs, but at the same time create a dynamic market for both power and ancillary services from embedded generators. Most renewable generators either run as base load (e.g. waste ) or according to the vagaries of the weather (e.g. wind, hydro), so offer little scope for scheduling other than 'off'. CHP plant is normally heat- led for industrial processes or building needs, but supplementary firing or thermal storage often allow considerable scope for scheduling. Micro-CHP with thermal storage could provide short-term scheduling, but tends to be running anyway during the evening peak. Standby generation appears to be ideal for scheduling, but in practice operators may be unwilling to run parallel with the network, and noise and pollution problems may preclude frequent operation. Statistical analysis can be applied to calculate the reliability of several generators compared to one; with a large number of generators such as micro-CHP reliability of a proportion of load is close to unity. The type of communication for generation used will depend on requirements for bandwidth, cost, reliability and whether it is bundled with other services. With high levels of deeply embedded, small-scale generation using induction machines, voltage control and black start capability will become important concerns on 11 kV and LV networks. This will require increased generation monitoring and remote control of switchgear. Examples of cost benefits from scheduling are given, including deferred reinforcement, increased exports on non

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.

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.

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 scatter-corrected list-mode reconstruction and a practical scatter/random approximation technique for dynamic PET imaging

International Nuclear Information System (INIS)

Cheng, J-C; Rahmim, Arman; Blinder, Stephan; Camborde, Marie-Laure; Raywood, Kelvin; Sossi, Vesna

2007-01-01

We describe an ordinary Poisson list-mode expectation maximization (OP-LMEM) algorithm with a sinogram-based scatter correction method based on the single scatter simulation (SSS) technique and a random correction method based on the variance-reduced delayed-coincidence technique. We also describe a practical approximate scatter and random-estimation approach for dynamic PET studies based on a time-averaged scatter and random estimate followed by scaling according to the global numbers of true coincidences and randoms for each temporal frame. The quantitative accuracy achieved using OP-LMEM was compared to that obtained using the histogram-mode 3D ordinary Poisson ordered subset expectation maximization (3D-OP) algorithm with similar scatter and random correction methods, and they showed excellent agreement. The accuracy of the approximated scatter and random estimates was tested by comparing time activity curves (TACs) as well as the spatial scatter distribution from dynamic non-human primate studies obtained from the conventional (frame-based) approach and those obtained from the approximate approach. An excellent agreement was found, and the time required for the calculation of scatter and random estimates in the dynamic studies became much less dependent on the number of frames (we achieved a nearly four times faster performance on the scatter and random estimates by applying the proposed method). The precision of the scatter fraction was also demonstrated for the conventional and the approximate approach using phantom studies

Policy-into-practice for rheumatoid arthritis: randomized controlled trial and cohort study of e-learning targeting improved physiotherapy management.

Science.gov (United States)

Fary, Robyn E; Slater, Helen; Chua, Jason; Ranelli, Sonia; Chan, Madelynn; Briggs, Andrew M

2015-07-01

To examine the effectiveness of a physiotherapy-specific, web-based e-learning platform, "RAP-el," in best-practice management of rheumatoid arthritis (RA) using a single-blind, randomized controlled trial (RCT) and prospective cohort study. Australian-registered physiotherapists were electronically randomized into intervention and control groups. The intervention group accessed RAP-eL over 4 weeks. Change in self-reported confidence in knowledge and skills was compared between groups at the end of the RCT using linear regression conditioned for baseline scores by a blinded assessor, using intent-to-treat analysis. Secondary outcomes included physiotherapists' satisfaction with RA management and responses to RA-relevant clinical statements and practice-relevant vignettes. Retention was evaluated in a cohort study 8 weeks after the RCT. Eighty physiotherapists were randomized into the intervention and 79 into the control groups. Fifty-six and 48, respectively, provided baseline data. Significant between-group differences were observed for change in confidence in knowledge (mean difference 8.51; 95% confidence interval [95% CI] 6.29, 10.73; effect size 1.62) and skills (mean difference 7.26; 95% CI 5.1, 9.4; effect size 1.54), with the intervention group performing better. Satisfaction in ability to manage RA, 4 of the 6 clinical statements, and responses to vignettes demonstrated significant improvement in the intervention group. Although 8-week scores showed declines in most outcomes, their clinical significance remains uncertain. RAP-eL can improve self-reported confidence, likely practice behaviors and satisfaction in physiotherapists' ability to manage people with RA, and improve their clinical knowledge in several areas of best-practice RA management in the short term. © 2015, American College of Rheumatology.

Changing Workplaces to Reduce Work-Family Conflict: Schedule Control in a White-Collar Organization.

Science.gov (United States)

Kelly, Erin L; Moen, Phyllis; Tranby, Eric

2011-04-01

Work-family conflicts are common and consequential for employees, their families, and work organizations. Can workplaces be changed to reduce work-family conflict? Previous research has not been able to assess whether workplace policies or initiatives succeed in reducing work-family conflict or increasing work-family fit. Using longitudinal data collected from 608 employees of a white-collar organization before and after a workplace initiative was implemented, we investigate whether the initiative affects work-family conflict and fit, whether schedule control mediates these effects, and whether work demands, including long hours, moderate the initiative's effects on work-family outcomes. Analyses clearly demonstrate that the workplace initiative positively affects the work-family interface, primarily by increasing employees' schedule control. This study points to the importance of schedule control for our understanding of job quality and for management policies and practices.

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

Cost/schedule performance measurement system utilized on the Fast Flux Test Facility project

International Nuclear Information System (INIS)

Brown, R.K.; Frost, R.A.; Zimmerman, F.M.

1976-01-01

An Earned Value-Integrated Cost/Schedule Performance Measurement System has been applied to a major nonmilitary nuclear design and construction project. This system is similar to the Department of Defense Cost/Schedule Performance Measurement System. The project is the Fast Flux Test Facility (a Fuels and Materials test reactor for the Liquid Metal Fast Breeder Reactor Program) being built at the Hanford Engineering Development Laboratory, Richland, Washington, by Westinghouse Hanford Company for the U. S. Energy Research and Development Administration. Because the project was well into the construction phase when the Earned Value System was being considered, it was decided that the principles of DOD's Cost/Schedule Control System Criteria would be applied to the extent possible but no major changes in accounting practices or management systems were imposed. Implementation of this system enabled the following questions to be answered: For work performed, how do actual costs compare with the budget for that work. What is the impact of cost and schedule variances at an overall project level composed of different kinds of activities. Without the Earned Value system, these questions could be answered in a qualitative, subjective manner at best

Operating room scheduling and surgeon assignment problem under surgery durations uncertainty.

Science.gov (United States)

Liu, Hongwei; Zhang, Tianyi; Luo, Shuai; Xu, Dan

2017-12-29

Scientific management methods are urgently needed to balance the demand and supply of heath care services in Chinese hospitals. Operating theatre is the bottleneck and costliest department. Therefore, the surgery scheduling is crucial to hospital management. To increase the utilization and reduce the cost of operating theatre, and to improve surgeons' satisfaction in the meantime, a practical surgery scheduling which could assign the operating room (OR) and surgeon for the surgery and sequence surgeries in each OR was provided for hospital managers. Surgery durations were predicted by fitting the distributions. A two-step mixed integer programming model considering surgery duration uncertainty was proposed, and sample average approximation (SAA) method was applied to solve the model. Durations of various surgeries were log-normal distributed respectively. Numerical experiments showed the model and method could get good solutions with different sample sizes. Real-life constraints and duration uncertainty were considered in the study, and the model was also very applicable in practice. Average overtime of each OR was reducing and tending to be stable with the number of surgeons increasing, which is a discipline for OR management.

Intensive versus conventional blood pressure monitoring in a general practice population. The Blood Pressure Reduction in Danish General Practice trial: a randomized controlled parallel group trial

DEFF Research Database (Denmark)

Klarskov, Pia; Bang, Lia E; Schultz-Larsen, Peter

2018-01-01

To compare the effect of a conventional to an intensive blood pressure monitoring regimen on blood pressure in hypertensive patients in the general practice setting. Randomized controlled parallel group trial with 12-month follow-up. One hundred and ten general practices in all regions of Denmark....... One thousand forty-eight patients with essential hypertension. Conventional blood pressure monitoring ('usual group') continued usual ad hoc blood pressure monitoring by office blood pressure measurements, while intensive blood pressure monitoring ('intensive group') supplemented this with frequent...... a reduction of blood pressure. Clinical Trials NCT00244660....

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.

Association of intervention outcomes with practice capacity for change: Subgroup analysis from a group randomized trial

Directory of Open Access Journals (Sweden)

Weyer Sharon

2008-05-01

Full Text Available Abstract Background The relationship between health care practices' capacity for change and the results and sustainability of interventions to improve health care delivery is unclear. Methods In the setting of an intervention to increase preventive service delivery (PSD, we assessed practice capacity for change by rating motivation to change and instrumental ability to change on a one to four scale. After combining these ratings into a single score, random effects models tested its association with change in PSD rates from baseline to immediately after intervention completion and 12 months later. Results Our measure of practices' capacity for change varied widely at baseline (range 2–8; mean 4.8 ± 1.6. Practices with greater capacity for change delivered preventive services to eligible patients at higher rates after completion of the intervention (2.7% per unit increase in the combined effort score, p Conclusion Greater capacity for change is associated with a higher probability that a practice will attain and sustain desired outcomes. Future work to refine measures of this practice characteristic may be useful in planning and implementing interventions that result in sustained, evidence-based improvements in health care delivery.

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

Analysis and Development of a Web-Enabled Planning and Scheduling Database Application

Science.gov (United States)

2013-09-01

will be fully functional of the Macintosh Operating System . This is the platform of the original database and the platform of the testing system ...was to explore available scheduling tools operational on the Macintosh Operating System with 78 the smallest practical price tag. The solution was...48 F. PROPOSED DBMS ENVIRONMENT .........................49 1. Operating System (OS) ........................49 2

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

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.

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.

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.

Scaling Non-Regular Shared-Memory Codes by Reusing Custom Loop Schedules

Directory of Open Access Journals (Sweden)

Dimitrios S. Nikolopoulos

2003-01-01

Full Text Available In this paper we explore the idea of customizing and reusing loop schedules to improve the scalability of non-regular numerical codes in shared-memory architectures with non-uniform memory access latency. The main objective is to implicitly setup affinity links between threads and data, by devising loop schedules that achieve balanced work distribution within irregular data spaces and reusing them as much as possible along the execution of the program for better memory access locality. This transformation provides a great deal of flexibility in optimizing locality, without compromising the simplicity of the shared-memory programming paradigm. In particular, the programmer does not need to explicitly distribute data between processors. The paper presents practical examples from real applications and experiments showing the efficiency of the approach.

Making working memory work: the effects of extended practice on focus capacity and the processes of updating, forward access, and random access.

Science.gov (United States)

Price, John M; Colflesh, Gregory J H; Cerella, John; Verhaeghen, Paul

2014-05-01

We investigated the effects of 10h of practice on variations of the N-Back task to investigate the processes underlying possible expansion of the focus of attention within working memory. Using subtractive logic, we showed that random access (i.e., Sternberg-like search) yielded a modest effect (a 50% increase in speed) whereas the processes of forward access (i.e., retrieval in order, as in a standard N-Back task) and updating (i.e., changing the contents of working memory) were executed about 5 times faster after extended practice. We additionally found that extended practice increased working memory capacity as measured by the size of the focus of attention for the forward-access task, but not for variations where probing was in random order. This suggests that working memory capacity may depend on the type of search process engaged, and that certain working-memory-related cognitive processes are more amenable to practice than others. Copyright © 2014 Elsevier B.V. All rights reserved.

Engineering practice variation through provider agreement: a cluster-randomized feasibility trial.

Science.gov (United States)

McCarren, Madeline; Twedt, Elaine L; Mansuri, Faizmohamed M; Nelson, Philip R; Peek, Brian T

2014-01-01

Minimal-risk randomized trials that can be embedded in practice could facilitate learning health-care systems. A cluster-randomized design was proposed to compare treatment strategies by assigning clusters (eg, providers) to "favor" a particular drug, with providers retaining autonomy for specific patients. Patient informed consent might be waived, broadening inclusion. However, it is not known if providers will adhere to the assignment or whether institutional review boards will waive consent. We evaluated the feasibility of this trial design. Agreeable providers were randomized to "favor" either hydrochlorothiazide or chlorthalidone when starting patients on thiazide-type therapy for hypertension. The assignment applied when the provider had already decided to start a thiazide, and providers could deviate from the strategy as needed. Prescriptions were aggregated to produce a provider strategy-adherence rate. All four institutional review boards waived documentation of patient consent. Providers (n=18) followed their assigned strategy for most of their new thiazide prescriptions (n=138 patients). In the "favor hydrochlorothiazide" group, there was 99% adherence to that strategy. In the "favor chlorthalidone" group, chlorthalidone comprised 77% of new thiazide starts, up from 1% in the pre-study period. When the assigned strategy was followed, dosing in the recommended range was 48% for hydrochlorothiazide (25-50 mg/day) and 100% for chlorthalidone (12.5-25.0 mg/day). Providers were motivated to participate by a desire to contribute to a comparative effectiveness study. A study promotional mug, provider information letter, and interactions with the site investigator were identified as most helpful in reminding providers of their study drug strategy. Providers prescribed according to an assigned drug-choice strategy most of the time for the purpose of a comparative effectiveness study. This simple design could facilitate research participation and behavior change

Introduction to random matrices theory and practice

CERN Document Server

Livan, Giacomo; Vivo, Pierpaolo

2018-01-01

Modern developments of Random Matrix Theory as well as pedagogical approaches to the standard core of the discipline are surprisingly hard to find in a well-organized, readable and user-friendly fashion. This slim and agile book, written in a pedagogical and hands-on style, without sacrificing formal rigor fills this gap. It brings Ph.D. students in Physics, as well as more senior practitioners, through the standard tools and results on random matrices, with an eye on most recent developments that are not usually covered in introductory texts. The focus is mainly on random matrices with real spectrum. The main guiding threads throughout the book are the Gaussian Ensembles. In particular, Wigner’s semicircle law is derived multiple times to illustrate several techniques  (e.g., Coulomb gas approach, replica theory). Most chapters are accompanied by Matlab codes (stored in an online repository) to guide readers through the numerical check of most analytical results.

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.

Tools and techniques for schedule's controlling: tracking system and control of Urucu-Manaus gas-pipeline construction, stretch B1

Energy Technology Data Exchange (ETDEWEB)

Zuany, Valdenise Marques; Dias, Jose Luiz Gomes [CONCREMAT Engenharia e Tecnologia S/A, Rio de Janeiro, RJ (Brazil)

2009-07-01

The goal is to show the monitoring systems and deadline control, using the PMBOK{sup R} project management tools, in the Construction and Assembly of the Coari-Manaus Gas-pipeline, stretch B1, which includes the cities of Coari, Codajas, Anori and Anama, in the state of Amazon, in the Northern Undertaking Implementation (IENOR), an Engineering division of the PETROBRAS System. This report presents the practical effects of the usage of three schedule control tools of the project: Performance Measurement, using the technique of the Earned Value Management (EVM), which integrates cost, schedule and physical progress of the enterprise to determine the variations of schedule and performance; Project Management Software, MSProject, which allows schedule's elaboration and makes the tracking of the planned dates possible (baseline) in relation to real dates and forecasts the trend level, the effects of changes in the project's schedule, demonstrating its utility as a schedule control tool; and Schedule Variance Analysis, which adopts practical data to reach the pessimistic, most likely and optimistic expectations. The implantation of these tools was based in the Work Breakdown Structure of the enterprise. The application of these three tools in the tracking and control of the enterprise demonstrates that, the use of information and techniques deriving from the planning and control can be an important support for project management and decision taking, comparing the results gotten in the implantation of the plan with its actual realization, defining, thus, the necessary corrective actions, generating learned lessons to use in future projects. (author)

Ares Launch Vehicles Lean Practices Case Study

Science.gov (United States)

Doreswamy, Rajiv, N.; Self, Timothy A.

2008-01-01

This viewgraph presentation describes test strategies and lean philisophies and practices that are applied to Ares Launch Vehicles. The topics include: 1) Testing strategy; 2) Lean Practices in Ares I-X; 3) Lean Practices Applied to Ares I-X Schedule; 4) Lean Event Results; 5) Lean, Six Sigma, and Kaizen Practices in the Ares Projects Office; 6) Lean and Kaizen Success Stories; and 7) Ares Six Sigma Practices.

Cost Minimization for Joint Energy Management and Production Scheduling Using Particle Swarm Optimization

Science.gov (United States)

Shah, Rahul H.

Production costs account for the largest share of the overall cost of manufacturing facilities. With the U.S. industrial sector becoming more and more competitive, manufacturers are looking for more cost and resource efficient working practices. Operations management and production planning have shown their capability to dramatically reduce manufacturing costs and increase system robustness. When implementing operations related decision making and planning, two fields that have shown to be most effective are maintenance and energy. Unfortunately, the current research that integrates both is limited. Additionally, these studies fail to consider parameter domains and optimization on joint energy and maintenance driven production planning. Accordingly, production planning methodology that considers maintenance and energy is investigated. Two models are presented to achieve well-rounded operating strategy. The first is a joint energy and maintenance production scheduling model. The second is a cost per part model considering maintenance, energy, and production. The proposed methodology will involve a Time-of-Use electricity demand response program, buffer and holding capacity, station reliability, production rate, station rated power, and more. In practice, the scheduling problem can be used to determine a joint energy, maintenance, and production schedule. Meanwhile, the cost per part model can be used to: (1) test the sensitivity of the obtained optimal production schedule and its corresponding savings by varying key production system parameters; and (2) to determine optimal system parameter combinations when using the joint energy, maintenance, and production planning model. Additionally, a factor analysis on the system parameters is conducted and the corresponding performance of the production schedule under variable parameter conditions, is evaluated. Also, parameter optimization guidelines that incorporate maintenance and energy parameter decision making in the

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.

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.

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.

A practical introduction to Random Forest for genetic association studies in ecology and evolution.

Science.gov (United States)

Brieuc, Marine S O; Waters, Charles D; Drinan, Daniel P; Naish, Kerry A

2018-03-05

Large genomic studies are becoming increasingly common with advances in sequencing technology, and our ability to understand how genomic variation influences phenotypic variation between individuals has never been greater. The exploration of such relationships first requires the identification of associations between molecular markers and phenotypes. Here, we explore the use of Random Forest (RF), a powerful machine-learning algorithm, in genomic studies to discern loci underlying both discrete and quantitative traits, particularly when studying wild or nonmodel organisms. RF is becoming increasingly used in ecological and population genetics because, unlike traditional methods, it can efficiently analyse thousands of loci simultaneously and account for nonadditive interactions. However, understanding both the power and limitations of Random Forest is important for its proper implementation and the interpretation of results. We therefore provide a practical introduction to the algorithm and its use for identifying associations between molecular markers and phenotypes, discussing such topics as data limitations, algorithm initiation and optimization, as well as interpretation. We also provide short R tutorials as examples, with the aim of providing a guide to the implementation of the algorithm. Topics discussed here are intended to serve as an entry point for molecular ecologists interested in employing Random Forest to identify trait associations in genomic data sets. © 2018 John Wiley & Sons Ltd.

Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed

2017-07-17

In practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling devices to the frames’ radio resources blocks (RRBs) of the single-antenna base-stations (BSs), adjusting the transmit power levels, and for synchronizing the transmit frames across the connected BSs. Previous studies show that the jointly coordinated scheduling and power control problem in the considered CRAN can be solved using an approach that scales exponentially with the number of BSs, devices, and RRBs, which makes the practical implementation infeasible for reasonably sized networks. This paper instead proposes a low-complexity solution to the problem, under the constraints that each device cannot be served by more than one BS but can be served by multiple RRBs within each BS frame, and under the practical assumption that the channel is constant during the duration of each frame. The paper utilizes graph-theoretical based techniques and shows that constructing a single power control graph is sufficient to obtain the optimal solution with a complexity that is independent of the number of RRBs. Simulation results reveal the optimality of the proposed solution for slow-varying channels, and show that the solution performs near-optimal for highly correlated channels.

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

Quality of life assessment with different radiotherapy schedules in palliative management of advanced carcinoma esophagus: A prospective randomized study

Directory of Open Access Journals (Sweden)

Shaveta Mehta

2008-01-01

Full Text Available Aim: To investigate the quality of life (QOL of patients with advanced carcinoma esophagus treated with different palliative radiation schedules. Methods: Sixty-two consecutive patients with inoperable, non-metastatic carcinoma of the esophagus were randomly allocated to Arm-A (external radiotherapy 30 Gy/10 fractions + brachytherapy 12 Gy/two sessions, Arm-B (external radiotherapy 30 Gy /10 fractions and Arm-C (external radiotherapy 20Gy /five fractions. The QOL was assessed using the European Organization for Research and Treatment of Cancer questionnaire at presentation, after treatment and at 3 months follow-up. Results: The mean QOL score improved, in arm-A from 38 to 52 after treatment and 56 at 3 months, in arm-B from 30 to 44 after treatment and 55 at 3 months and in arm-C from 24 to 40 after treatment but decreased to 37 at 3 months. Improvement in dysphagia scores at the first follow-up was 46.1% in arm-A, 25.0% in arm-B and 22.6% in arm-C. The difference was maintained at 3 months, with maximum improvement in arm-A (57.6%. No significant differences were found between the three arms with regard to complications and additional procedures needed for relief of dysphagia. Conclusion: In comparison with external radiotherapy alone, external radiotherapy with intraluminal brachytherapy has shown a trend toward better QOL and consistent dysphagia relief without significant difference in adverse effects.

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

An innovative telemedicine knowledge translation program to improve quality of care in intensive care units: protocol for a cluster randomized pragmatic trial

Directory of Open Access Journals (Sweden)

Pinto Ruxandra

2009-02-01

Full Text Available Abstract Background There are challenges to timely adoption of, and ongoing adherence to, evidence-based practices known to improve patient care in the intensive care unit (ICU. Quality improvement initiatives using a collaborative network approach may increase the use of such practices. Our objective is to evaluate the effectiveness of a novel knowledge translation program for increasing the proportion of patients who appropriately receive the following six evidence-based care practices: venous thromboembolism prophylaxis; ventilator-associated pneumonia prevention; spontaneous breathing trials; catheter-related bloodstream infection prevention; decubitus ulcer prevention; and early enteral nutrition. Methods and design We will conduct a pragmatic cluster randomized active control trial in 15 community ICUs and one academic ICU in Ontario, Canada. The intervention is a multifaceted videoconferenced educational and problem-solving forum to organize knowledge translation strategies, including comparative audit and feedback, educational sessions from content experts, and dissemination of algorithms. Fifteen individual ICUs (clusters will be randomized to receive quality improvement interventions targeting one of the best practices during each of six study phases. Each phase lasts four months during the first study year and three months during the second. At the end of each study phase, ICUs are assigned to an intervention for a best practice not yet received according to a random schedule. The primary analysis will use patient-level process-of-care data to measure the intervention's effect on rates of adoption and adherence of each best practice in the targeted ICU clusters versus controls. Discussion This study design evaluates a new system for knowledge translation and quality improvement across six common ICU problems. All participating ICUs receive quality improvement initiatives during every study phase, improving buy-in. This study design

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

An improved charging/discharging strategy of lithium batteries considering depreciation cost in day-ahead microgrid scheduling

International Nuclear Information System (INIS)

Zhang, Zhong; Wang, Jianxue; Wang, Xiuli

2015-01-01

Highlights: • A quantitative depreciation cost model is put forward for lithium batteries. • A practical charging/discharging strategy is applied to battery management. • The depth of discharge of the battery storage is scheduled more rationally. • The proposed strategy improves the cost efficiency of lithium batteries in MGs. - Abstract: An energy storage system is critical for the safe and stable operation of a microgrid (MG) and has a promising prospect in future power system. Economical and safe operation of storage system is of great significance to MGs. This paper presents an improved management strategy for lithium battery storage by establishing a battery depreciation cost model and employing a practical charging/discharging strategy. Firstly, experimental data of lithium battery cycle lives, which are functions of the depth of discharge, are investigated and synthesized. A quantitative depreciation cost model is put forward for lithium batteries from the perspective of cycle life. Secondly, a practical charging/discharging strategy is applied to the lithium battery management in MGs. Then, an optimal scheduling model is developed to minimize MG operational cost including battery depreciation cost. Finally, numerical tests are conducted on a typical grid-connected MG. Results show that the depth of discharge of storage is scheduled more rationally, and operational cost is simultaneously saved for MG under the proposed management strategy. This study helps to improve the cost efficiency and alleviate the aging process for lithium batteries.

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

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

Does non-standard work mean non-standard health? Exploring links between non-standard work schedules, health behavior, and well-being

Directory of Open Access Journals (Sweden)

Megan R. Winkler

2018-04-01

Full Text Available The last century has seen dramatic shifts in population work circumstances, leading to an increasing normalization of non-standard work schedules (NSWSs, defined as non-daytime, irregular hours. An ever-growing body of evidence links NSWSs to a host of non-communicable chronic conditions; yet, these associations primarily concentrate on the physiologic mechanisms created by circadian disruption and insufficient sleep. While important, not all NSWSs create such chronobiologic disruption, and other aspects of working time and synchronization could be important to the relationships between work schedules and chronic disease. Leveraging survey data from Project EAT, a population-based study with health-related behavioral and psychological data from U.S. adults aged 25–36 years, this study explored the risks for a broad range of less healthful behavioral and well-being outcomes among NSWS workers compared to standard schedule workers (n = 1402. Variations across different NSWSs (evening, night/rotating, and irregular schedules were also explored. Results indicated that, relative to standard schedule workers, workers with NSWSs are at increased risk for non-optimal sleep, substance use, greater recreational screen time, worse dietary practices, obesity, and depression. There was minimal evidence to support differences in relative risks across workers with different types of NSWSs. The findings provide insight into the potential links between NSWSs and chronic disease and indicate the relevancy social disruption and daily health practices may play in the production of health and well-being outcomes among working populations. Keywords: United States, Work schedule tolerance, Health behavior, Mental health, Substance abuse, Obesity

Simulation methods for nuclear production scheduling

International Nuclear Information System (INIS)

Miles, W.T.; Markel, L.C.

1975-01-01

Recent developments and applications of simulation methods for use in nuclear production scheduling and fuel management are reviewed. The unique characteristics of the nuclear fuel cycle as they relate to the overall optimization of a mixed nuclear-fossil system in both the short-and mid-range time frame are described. Emphasis is placed on the various formulations and approaches to the mid-range planning problem, whose objective is the determination of an optimal (least cost) system operation strategy over a multi-year planning horizon. The decomposition of the mid-range problem into power system simulation, reactor core simulation and nuclear fuel management optimization, and system integration models is discussed. Present utility practices, requirements, and research trends are described. 37 references

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.

Variable Scheduling to Mitigate Channel Losses in Energy-Efficient Body Area Networks

Directory of Open Access Journals (Sweden)

Lavy Libman

2012-11-01

Full Text Available We consider a typical body area network (BAN setting in which sensor nodes send data to a common hub regularly on a TDMA basis, as defined by the emerging IEEE 802.15.6 BAN standard. To reduce transmission losses caused by the highly dynamic nature of the wireless channel around the human body, we explore variable TDMA scheduling techniques that allow the order of transmissions within each TDMA round to be decided on the fly, rather than being fixed in advance. Using a simple Markov model of the wireless links, we devise a number of scheduling algorithms that can be performed by the hub, which aim to maximize the expected number of successful transmissions in a TDMA round, and thereby significantly reduce transmission losses as compared with a static TDMA schedule. Importantly, these algorithms do not require a priori knowledge of the statistical properties of the wireless channels, and the reliability improvement is achieved entirely via shuffling the order of transmissions among devices, and does not involve any additional energy consumption (e.g., retransmissions. We evaluate these algorithms directly on an experimental set of traces obtained from devices strapped to human subjects performing regular daily activities, and confirm that the benefits of the proposed variable scheduling algorithms extend to this practical setup as well.

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

Selecting information technology for physicians' practices: a cross-sectional study

Directory of Open Access Journals (Sweden)

Eden Karen

2002-04-01

Full Text Available Abstract Background Many physicians are transitioning from paper to electronic formats for billing, scheduling, medical charts, communications, etc. The primary objective of this research was to identify the relationship (if any between the software selection process and the office staff's perceptions of the software's impact on practice activities. Methods A telephone survey was conducted with office representatives of 407 physician practices in Oregon who had purchased information technology. The respondents, usually office managers, answered scripted questions about their selection process and their perceptions of the software after implementation. Results Multiple logistic regression revealed that software type, selection steps, and certain factors influencing the purchase were related to whether the respondents felt the software improved the scheduling and financial analysis practice activities. Specifically, practices that selected electronic medical record or practice management software, that made software comparisons, or that considered prior user testimony as important were more likely to have perceived improvements in the scheduling process than were other practices. Practices that considered value important, that did not consider compatibility important, that selected managed care software, that spent less than $10,000, or that provided learning time (most dramatic increase in odds ratio, 8.2 during implementation were more likely to perceive that the software had improved the financial analysis process than were other practices. Conclusion Perhaps one of the most important predictors of improvement was providing learning time during implementation, particularly when the software involves several practice activities. Despite this importance, less than half of the practices reported performing this step.

Current nuclear industry practices with regard to the integration of surveillances

International Nuclear Information System (INIS)

Stewart, M.; Smith, C.

1992-04-01

Commercial nuclear industry practices regarding the integration of technical specification (TS) surveillance and maintenance activities are identified in this report. A questionnaire was developed and used to obtain current industry practices from NRC Regional personnel and INEL engineers with utility experience. Some of these practices indicate that the scheduling of TS surveillance and maintenance items could be more effectively coordinated. Also, must utilities do not formally consider risk implications when they are scheduling maintenance. Methodologies and approaches for proposing and evaluating changes to improve the integration of TS surveillance and maintenance activities have been identified for planned future work

Varied Practice in Laparoscopy Training: Beneficial Learning Stimulation or Cognitive Overload?

Science.gov (United States)

Spruit, Edward N; Kleijweg, Luca; Band, Guido P H; Hamming, Jaap F

2016-01-01

Determining the optimal design for surgical skills training is an ongoing research endeavor. In education literature, varied practice is listed as a positive intervention to improve acquisition of knowledge and motor skills. In the current study we tested the effectiveness of a varied practice intervention during laparoscopy training. Twenty-four trainees (control group) without prior experience received a 3 weeks laparoscopic skills training utilizing four basic and one advanced training task. Twenty-eight trainees (experimental group) received the same training with a random training task schedule, more frequent task switching and inverted viewing conditions on the four basic training tasks, but not the advanced task. Results showed inferior performance of the experimental group on the four basic laparoscopy tasks during training, at the end of training and at a 2 months retention session. We assume the inverted viewing conditions have led to the deterioration of learning in the experimental group because no significant differences were found between groups on the only task that had not been practiced under inverted viewing conditions; the advanced laparoscopic task. Potential moderating effects of inter-task similarity, task complexity, and trainee characteristics are discussed.

Varied Practice in Laparoscopy Training: Beneficial Learning Stimulation or Cognitive Overload?

Directory of Open Access Journals (Sweden)

Edward N. eSpruit

2016-05-01

Full Text Available AbstractDetermining the optimal design for surgical skills training is an ongoing research endeavor. In education literature, varied practice is listed as a positive intervention to improve acquisition of knowledge and motor skills. In the current study we tested the effectiveness of a varied practice intervention during laparoscopy training. 24 trainees (control group without prior experience received a three week laparoscopic skills training utilizing four basic and one advanced training task. 28 trainees (experimental group received the same training with a random training task schedule, more frequent task switching and inverted viewing conditions on the four basic training tasks, but not the advanced task. Results showed inferior performance of the experimental group on the four basic laparoscopy tasks during training, at the end of training and at a two month retention session. We assume the inverted viewing conditions have led to the deterioration of learning in the experimental group because no significant differences were found between groups on the only task that had not been practiced under inverted viewing conditions; the advanced laparoscopic task. Potential moderating effects of inter-task similarity, task complexity and trainee characteristics are discussed.

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

Discordance between 'actual' and 'scheduled' check-in times at a heart failure clinic.

Directory of Open Access Journals (Sweden)

Eiran Z Gorodeski

Full Text Available A 2015 Institute Of Medicine statement "Transforming Health Care Scheduling and Access: Getting to Now", has increased concerns regarding patient wait times. Although waiting times have been widely studied, little attention has been paid to the role of patient arrival times as a component of this phenomenon. To this end, we investigated patterns of patient arrival at scheduled ambulatory heart failure (HF clinic appointments and studied its predictors. We hypothesized that patients are more likely to arrive later than scheduled, with progressively later arrivals later in the day.Using a business intelligence database we identified 6,194 unique patients that visited the Cleveland Clinic Main Campus HF clinic between January, 2015 and January, 2017. This clinic served both as a tertiary referral center and a community HF clinic. Transplant and left ventricular assist device (LVAD visits were excluded. Punctuality was defined as the difference between 'actual' and 'scheduled' check-in times, whereby negative values (i.e., early punctuality were patients who checked-in early. Contrary to our hypothesis, we found that patients checked-in late only a minority of the time (38% of visits. Additionally, examining punctuality by appointment hour slot we found that patients scheduled after 8AM had progressively earlier check-in times as the day progressed (P < .001 for trend. In both a Random Forest-Regression framework and linear regression models the most important risk-adjusted predictors of early punctuality were: later in the day appointment hour slot, patient having previously been to the hospital, age in the early 70s, and white race.Patients attending a mixed population ambulatory HF clinic check-in earlier than scheduled times, with progressive discrepant intervals throughout the day. This finding may have significant implications for provider utilization and resource planning in order to maximize clinic efficiency. The impact of elective early

Adaptive Dynamic Process Scheduling on Distributed Memory Parallel Computers

Directory of Open Access Journals (Sweden)

Wei Shu

1994-01-01

Full Text Available One of the challenges in programming distributed memory parallel machines is deciding how to allocate work to processors. This problem is particularly important for computations with unpredictable dynamic behaviors or irregular structures. We present a scheme for dynamic scheduling of medium-grained processes that is useful in this context. The adaptive contracting within neighborhood (ACWN is a dynamic, distributed, load-dependent, and scalable scheme. It deals with dynamic and unpredictable creation of processes and adapts to different systems. The scheme is described and contrasted with two other schemes that have been proposed in this context, namely the randomized allocation and the gradient model. The performance of the three schemes on an Intel iPSC/2 hypercube is presented and analyzed. The experimental results show that even though the ACWN algorithm incurs somewhat larger overhead than the randomized allocation, it achieves better performance in most cases due to its adaptiveness. Its feature of quickly spreading the work helps it outperform the gradient model in performance and scalability.

Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm

Directory of Open Access Journals (Sweden)

Ada Che

2008-01-01

Full Text Available Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs. In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.

A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem

Directory of Open Access Journals (Sweden)

Antonio Costa

2014-07-01

Full Text Available Production processes in Cellular Manufacturing Systems (CMS often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs and Biased Random Sampling (BRS search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.

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.

Randomized Clinical Trial of the Effectiveness of a Home-Based Advanced Practice Psychiatric Nurse Intervention: Outcomes for Individuals with Serious Mental Illness and HIV

Science.gov (United States)

Hanrahan, Nancy P.; Wu, Evan; Kelly, Deena; Aiken, Linda H.; Blank, Michael B.

2011-01-01

Individuals with serious mental illness have greater risk for contracting HIV, multiple morbidities, and die 25 years younger than the general population. This high need and high cost subgroup face unique barriers to accessing required health care in the current health care system. The effectiveness of an advanced practice nurse model of care management was assessed in a four-year random controlled trial. Results are reported in this paper. In a four-year random controlled trial, a total of 238 community-dwelling individuals with HIV and serious mental illness (SMI) were randomly assigned to an intervention group (n=128) or to a control group (n=110). Over 12 months, the intervention group received care management from advanced practice psychiatric nurse, and the control group received usual care. The intervention group showed significant improvement in depression (P=.012) and the physical component of health-related quality of life (P=.03) from baseline to 12 months. The advanced practice psychiatric nurse intervention is a model of care that holds promise for a higher quality of care and outcomes for this vulnerable population. PMID:21935499

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

Comparison of Different Approaches to the Cutting Plan Scheduling

Directory of Open Access Journals (Sweden)

Peter Bober

2011-10-01

Full Text Available Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial optimization problem. In this respect, various approaches and methods are used to arrive to a viable solution. The paper reports three approaches represented by three discreet optimization methods. The first one is back-tracing algorithm and serves as a reference to verify functionality of the other two ones. The second method is optimization using genetic algorithms, and the third one presents heuristic approach to optimization based on anticipated properties of an optimal solution. Research results indicate that genetic algorithms are demanding to calculate though not dependant on the selected objective function. Heuristic algorithm is fast but dependant upon anticipated properties of the optimal solution. Hence, at change of the objective function it has to be changed. When the scheduling by genetic algorithms is solvable in a sufficiently short period of time, it is more appropriate from the practical point than the heuristic algorithm. The back-tracing algorithm usually does not provide a result in a feasible period of time.

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.

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

Modified loss coefficients in the determination of optimum generation scheduling

Energy Technology Data Exchange (ETDEWEB)

Hazarika, D.; Bordoloi, P.K. (Assam Engineering Coll. (IN))

1991-03-01

A modified method has been evolved to form the loss coefficients of an electrical power system network by decoupling load and generation and thereby creating additional fictitious load buses. The system losses are then calculated and co-ordinated to arrive at an optimum scheduling of generation using the standard co-ordination equation. The method presented is superior to the ones currently available, in that it is applicable to a multimachine system with random variation of load and it accounts for limits in plant generations and line losses. The precise nature of results and the economy in the cost of energy production obtained by this method is quantified and presented. (author).

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.

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.

Ant colony optimisation for scheduling of flexible job shop with multi-resources requirements

Directory of Open Access Journals (Sweden)

Kalinowski Krzysztof

2017-01-01

Full Text Available The paper presents application of ant colony optimisation algorithm for scheduling multi-resources operations in flexible job shop type of production systems. Operations that require the participation of two or more resources are common in industrial practice, when planning are subject not only machines, but also other additional resources (personnel, tools, etc.. Resource requirements of operation are indicated indirectly by resource groups. The most important parameters of the resource model and resource groups are also described. A basic assumptions for ant colony algorithm used for scheduling in the considered model with multiresources requirements of operations is discussed. The main result of the research is the schema of metaheuristic that enables searching best-score solutions in manufacturing systems satisfying presented constraints.

Treatment effectiveness of PMTO for children's behavior problems in Iceland: assessing parenting practices in a randomized controlled trial.

Science.gov (United States)

Sigmarsdóttir, Margrét; Degarmo, David S; Forgatch, Marion S; Guðmundsdóttir, Edda Vikar

2013-12-01

Findings are presented from an Icelandic randomized control trial (RCT) evaluating parent management training - Oregon model (PMTO™), a parent training intervention designed to improve parenting practices and reduce child behavior problems. In a prior report from this effectiveness study that focused on child outcomes, children in the PMTO condition showed greater reductions in reported child adjustment problems relative to the comparison group. The present report focuses on observed parenting practices as the targeted outcome, with risk by treatment moderators also tested. It was hypothesized that mothers assigned to the PMTO condition would show greater gains in pre-post parenting practices relative to controls. The sample was recruited from five municipalities throughout Iceland and included 102 participating families of children with behavior problems. Cases were referred by community professionals and randomly assigned to either PMTO (n = 51) or community services usually offered (n = 51). Child age ranged from 5 to 12 years; 73% were boys. Contrary to expectations, findings showed no main effects for changes in maternal parenting. However, evaluation of risk by treatment moderators showed greater gains in parenting practices for mothers who increased in depressed mood within the PMTO group relative to their counterparts in the comparison group. This finding suggests that PMTO prevented the expected damaging effects of depression on maternal parenting. Failure to find hypothesized main effects may indicate that there were some unobserved factors regarding the measurement and a need to further adapt the global observational procedures to Icelandic culture. © 2013 The Scandinavian Psychological Associations.

A Hybrid Metaheuristic for Multi-Objective Scientific Workflow Scheduling in a Cloud Environment

Directory of Open Access Journals (Sweden)

Nazia Anwar

2018-03-01

Full Text Available Cloud computing has emerged as a high-performance computing environment with a large pool of abstracted, virtualized, flexible, and on-demand resources and services. Scheduling of scientific workflows in a distributed environment is a well-known NP-complete problem and therefore intractable with exact solutions. It becomes even more challenging in the cloud computing platform due to its dynamic and heterogeneous nature. The aim of this study is to optimize multi-objective scheduling of scientific workflows in a cloud computing environment based on the proposed metaheuristic-based algorithm, Hybrid Bio-inspired Metaheuristic for Multi-objective Optimization (HBMMO. The strong global exploration ability of the nature-inspired metaheuristic Symbiotic Organisms Search (SOS is enhanced by involving an efficient list-scheduling heuristic, Predict Earliest Finish Time (PEFT, in the proposed algorithm to obtain better convergence and diversity of the approximate Pareto front in terms of reduced makespan, minimized cost, and efficient load balance of the Virtual Machines (VMs. The experiments using different scientific workflow applications highlight the effectiveness, practicality, and better performance of the proposed algorithm.

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.

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

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.

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

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

Simultaneous personnel and vehicle shift scheduling in the waste management sector.

Science.gov (United States)

Ghiani, Gianpaolo; Guerriero, Emanuela; Manni, Andrea; Manni, Emanuele; Potenza, Agostino

2013-07-01

Urban waste management is becoming an increasingly complex task, absorbing a huge amount of resources, and having a major environmental impact. The design of a waste management system consists in various activities, and one of these is related to the definition of shift schedules for both personnel and vehicles. This activity has a great incidence on the tactical and operational cost for companies. In this paper, we propose an integer programming model to find an optimal solution to the integrated problem. The aim is to determine optimal schedules at minimum cost. Moreover, we design a fast and effective heuristic to face large-size problems. Both approaches are tested on data from a real-world case in Southern Italy and compared to the current practice utilized by the company managing the service, showing that simultaneously solving these problems can lead to significant monetary savings. Copyright © 2013 Elsevier Ltd. All rights reserved.

The Home Care Crew Scheduling Problem

DEFF Research Database (Denmark)

Rasmussen, Matias Sevel; Justesen, Tor

In the Home Care Crew Scheduling Problem (HCCSP) a staff of caretakers has to be assigned a number of visits, such that the total number of assigned visits is maximised. The visits have different locations and positions in time, and travelling time and time windows must be respected. The challenge...... when assigning visits to caretakers lies in the existence of soft constraints and indeed also in temporal dependencies between the starting times of visits. Most former approaches to solving the HCCSP involve the use of heuristic methods. Here we develop an exact branch-and-price algorithm that uses...... clustering of the visits based on the problem structure. The algorithm is tested on real-life problem instances and we obtain solutions that are better than current practice in all cases....

Prospective Randomized Controlled Study on the Efficacy of Multimedia Informed Consent for Patients Scheduled to Undergo Green-Light High-Performance System Photoselective Vaporization of the Prostate

Directory of Open Access Journals (Sweden)

Dong Yeub Ham

2016-04-01

Full Text Available Purpose: The aim of this study was to evaluate the efficacy of a multimedia informed consent (IC presentation on the understanding and satisfaction of patients who were scheduled to receive 120-W green-light high-performance system photoselective vaporization of the prostate (HPS-PVP. Materials and Methods: A multimedia IC (M-IC presentation for HPS-PVP was developed. Forty men with benign prostatic hyperplasia who were scheduled to undergo HPS-PVP were prospectively randomized to a conventional written IC group (W-IC group, n=20 or the M-IC group (n=20. The allocated IC was obtained by one certified urologist, followed by a 15-question test (maximum score, 15 to evaluate objective understanding, and questionnaires on subjective understanding (range, 0∼10 and satisfaction (range, 0∼10 using a visual analogue scale. Results: Demographic characteristics, including age and the highest level of education, did not significantly differ between the two groups. No significant differences were found in scores reflecting the objective understanding of HPS-PVP (9.9±2.3 vs. 10.6±2.8, p=0.332 or in subjective understanding scores (7.5±2.1 vs. 8.6±1.7, p=0.122; however, the M-IC group showed higher satisfaction scores than the W-IC group (7.4±1.7 vs. 8.4±1.5, p=0.033. After adjusting for age and educational level, the M-IC group still had significantly higher satisfaction scores. Conclusions: M-IC did not enhance the objective knowledge of patients regarding this surgical procedure. However, it improved the satisfaction of patients with the IC process itself.

Prospective Randomized Controlled Study on the Efficacy of Multimedia Informed Consent for Patients Scheduled to Undergo Green-Light High-Performance System Photoselective Vaporization of the Prostate

Science.gov (United States)

Ham, Dong Yeub; Choi, Woo Suk; Song, Sang Hoon; Ahn, Young-Joon; Park, Hyoung Keun; Kim, Hyeong Gon

2016-01-01

Purpose The aim of this study was to evaluate the efficacy of a multimedia informed consent (IC) presentation on the understanding and satisfaction of patients who were scheduled to receive 120-W green-light high-performance system photoselective vaporization of the prostate (HPS-PVP). Materials and Methods A multimedia IC (M-IC) presentation for HPS-PVP was developed. Forty men with benign prostatic hyperplasia who were scheduled to undergo HPS-PVP were prospectively randomized to a conventional written IC group (W-IC group, n=20) or the M-IC group (n=20). The allocated IC was obtained by one certified urologist, followed by a 15-question test (maximum score, 15) to evaluate objective understanding, and questionnaires on subjective understanding (range, 0~10) and satisfaction (range, 0~10) using a visual analogue scale. Results Demographic characteristics, including age and the highest level of education, did not significantly differ between the two groups. No significant differences were found in scores reflecting the objective understanding of HPS-PVP (9.9±2.3 vs. 10.6±2.8, p=0.332) or in subjective understanding scores (7.5±2.1 vs. 8.6±1.7, p=0.122); however, the M-IC group showed higher satisfaction scores than the W-IC group (7.4±1.7 vs. 8.4±1.5, p=0.033). After adjusting for age and educational level, the M-IC group still had significantly higher satisfaction scores. Conclusions M-IC did not enhance the objective knowledge of patients regarding this surgical procedure. However, it improved the satisfaction of patients with the IC process itself. PMID:27169129

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.

Automatic programming via iterated local search for dynamic job shop scheduling.

Science.gov (United States)

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2015-01-01

Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

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

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.

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

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.

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

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.

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

Using the 4 Pillars Practice Transformation Program to Increase Pneumococcal Immunizations for Older Adults: A Cluster-Randomized Trial.

Science.gov (United States)

Zimmerman, Richard K; Brown, Anthony E; Pavlik, Valory N; Moehling, Krissy K; Raviotta, Jonathan M; Lin, Chyongchiou J; Zhang, Song; Hawk, Mary; Kyle, Shakala; Patel, Suchita; Ahmed, Faruque; Nowalk, Mary Patricia

2017-01-01

To test the effectiveness of a step-by step, evidence-based guide, the 4 Pillars Practice Transformation Program, to increase adult pneumococcal vaccination. Randomized controlled cluster trial (RCCT) in Year 1 (June 1, 2013 to May 31, 2014) and pre-post study in Year 2 (June 1, 2014 to January 31, 2015) with data analyzed in 2016. Baseline year was June 1, 2012, to May 31, 2013. Demographic and vaccination data were derived from deidentified electronic medical record extractions. Primary care practices (n = 25) stratified according to metropolitan area (Houston, Pittsburgh), location (rural, urban, suburban), and type (family medicine, internal medicine), randomized to receive the intervention in Year 1 (n = 13) or Year 2 (n = 12). Individuals aged 65 and older at baseline (N = 18,107; mean age 74.2; 60.7% female, 16.5% non-white, 15.7% Hispanic). The 4 Pillars Program, provider education, and one-on-one coaching of practice-based immunization champions. Outcome measures were 23-valent pneumococcal polysaccharide vaccine (PPSV) and pneumococcal conjugate vaccine (PCV) vaccination rates and percentage point (PP) changes in vaccination rates. In the Year 1 RCCT, PPSV vaccination rates increased significantly in all intervention and control groups, with average increases ranging from 6.5 to 8.7 PP (P < .001). The intervention was not related to greater likelihood of PPSV vaccination. In the Year 2 pre-post study, the likelihood of PPSV and PCV vaccination was significantly higher in the active intervention sites than the maintenance sites in Pittsburgh but not in Houston. In a RCCT, PPSV vaccination rates increased in the intervention and control groups in Year 1. In a pre-post study, private primary care practices actively participating in the 4 Pillars Practice Transformation Program improved PPSV and PCV uptake significantly more than practices that were in the maintenance phase of the study. © 2016, Copyright the Authors Journal compilation © 2016, The American

Recommended Immunization Schedules for Persons Aged 0 through 18 Years--United States, 2010. Morbidity and Mortality Weekly Report QuickGuide. Volume 58, Number 51 & 52

Science.gov (United States)

Centers for Disease Control and Prevention, 2010

2010-01-01

The Advisory Committee on Immunization Practices (ACIP) annually publishes an immunization schedule for persons aged 0 through 18 years that summarizes recommendations for currently licensed vaccines for children aged 18 years and younger and includes recommendations in effect as of December 15, 2009. The changes to the previous schedule are…

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.

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

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

Scheduling and coordination for in-service inspection of nuclear power plant

International Nuclear Information System (INIS)

Li Songbai

1996-11-01

Based on the practice and experiences of pre-service and in-service inspections for Daya Bay Nuclear Power Plant (NPP) by Research Institute of Nuclear Power Operation (RINPO) following RSEM code, requirements of utility and actual situation in China, the in-service inspection preparation for organization, techniques and equipment/tooling, materials, personnel and documentation is briefly described. And the scheduling and coordinating consideration for planed in-service inspection activities during NPP outage is emphatically introduced. (2 refs., 4 figs.)

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

A randomized study of multimedia informational aids for research on medical practices: implications for informed consent

Science.gov (United States)

Kraft, Stephanie A; Constantine, Melissa; Magnus, David; Porter, Kathryn M.; Lee, Sandra Soo-Jin; Green, Michael; Kass, Nancy E; Wilfond, Benjamin S.; Cho, Mildred K

2016-01-01

Background/aims Participant understanding is a key element of informed consent for enrollment in research. However, participants often do not understand the nature, risks, benefits, or design of the studies in which they take part. Research on medical practices, which studies standard interventions rather than new treatments, has the potential to be especially confusing to participants because it is embedded within usual clinical care. Our objective in this randomized study was to compare the ability of a range of multimedia informational aids to improve participant understanding in the context of research on medical practices. Methods We administered a Web-based survey to members of a proprietary online panel sample selected to match national U.S. demographics. Respondents were randomized to one of five arms: four content-equivalent informational aids (animated videos, slideshows with voiceover, comics, and text), and one no-intervention control. We measured knowledge of research on medical practices using a summary knowledge score from 10 questions based on the content of the informational aids. We used ANOVA and paired t-tests to compare knowledge scores between arms. Results There were 1500 completed surveys (300 in each arm). Mean knowledge scores were highest for the slideshows with voiceover (65.7%), followed by the animated videos (62.7%), comics (60.7%), text (57.2%), and control (50.3%). Differences between arms were statistically significant except between the slideshows with voiceover and animated videos and between the animated videos and comics. Informational aids that included an audio component (animated videos and slideshows with voiceover) had higher knowledge scores than those without an audio component (64.2% versus 59.0%, peffectively than text alone. However, the relatively low knowledge scores suggest that targeted informational aids may be needed to teach some particularly challenging concepts. Nonetheless, our results demonstrate the

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE