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

Dealing with opponents of industry: Let the allies work for you

International Nuclear Information System (INIS)

Duncan, Colin

1998-01-01

Full text: The opponents of industry, and most Green campaigning groups, thrive on controversy. Opponents of industry, and of the nuclear industry in particular, can expect to find a more receptive public audience than do the companies they attack. Therefore, there is little to be gained by industry entering into direct conflict, or even high-profile debate, with opponents. Industry spokesmen do not rate as being trustworthy in the eyes of the public. And it does not pay to directly attack the credibility, however justified such criticisms are, of the likes of Greenpeace. In a polarised debate, if your company is seen to be partisan and the opponents to be neutral, the public will gravitate towards the opponents. The way forward is to influence the forces which ran help industry establish the middle ground to dissipate the tension. The problem for industry is not so much that it has opponents, but that it does not have enough third party advocates to mediate in disputes. Therefore, the first step is to identify the key issues facing a company or industry. The second, is to work with credible people and organisations to establish independent mechanisms which can prevent an unfavourable climate building up around those issues. The art of dealing with opponents, is the art of identifying such mechanisms (people, organisations and professions) to influence an increasingly cynical and distrusting public. These opinion-formers should be the main focus of a communications strategy designed to counter opponents. They are the conduit through which to influence public opinion in general. For instance, the debate surrounding the incidence of leukaemia around nuclear sites cannot be answered by the industry using the facts, scientific evidence, or by entering into a noisy dialogue with opponents. However, the medical profession, along with scientists working outside the nuclear industry, is in a position to shift public concern away from nuclear sites. BNFL has promoted

Nuclear opponents and party politics

International Nuclear Information System (INIS)

Tollmann, A.

1987-01-01

The question treated in this article is: what do the members of the Austrian parliament - of the different parties - against nuclear energy, in particular against nuclear installations in neighbour countries? Of special interest is the Green party, now also represented in the parliament. The conclusion is that even this party, though in principle definitely anti-nuclear, is of no help to nuclear opponents in general, and to the Working Group No to Zwentendorf in particular. (qui)

The behavior of an opponent alters pacing decisions in 4-km cycling time trials.

Science.gov (United States)

Konings, Marco J; Schoenmakers, Patrick P J M; Walker, Andrew J; Hettinga, Florentina J

2016-05-01

The present study aimed to explore how athletes respond to different behaviors of their opponents. Twelve moderately to highly physically active participants with at least two years of cycling experience completed four 4-km time trials on a Velotron cycle ergometer. After a familiarization time trial (FAM), participants performed three experimental time trials in randomized order with no opponent (NO), a virtual opponent who started slower and finished faster compared to FAM (OP-SLOWFAST), or a virtual opponent who started faster and finished slower compared to FAM (OP-FASTSLOW). Repeated-measures ANOVAs (Ppower output, velocity and RPE. OP-SLOWFAST and OP-FASTSLOW were completed faster compared to NO (385.5±27.5, 385.0±28.6, and 390.6±29.3s, respectively). An interaction effect for condition×distance (F=3.944, Ppower outputs by the participants in the initial 750m compared to a slower starting opponent. The present study is the first to show that the behavior of an opponent affects pacing-related decisions in laboratory-controlled conditions. Our findings support the recently proposed interdependence of perception and action, and emphasize the interaction with the environment as an important determinant for an athlete's pacing decisions, especially during the initial stages of a race. Copyright © 2016 Elsevier Inc. All rights reserved.

Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints

Directory of Open Access Journals (Sweden)

He Cheng

2014-02-01

Full Text Available It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2 time. In this paper we give an O(n2 algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm

Challenging the other: exploring the role of opponent gender in digital game competition for female players.

Science.gov (United States)

Vermeulen, Lotte; Núñez Castellar, Elena; Van Looy, Jan

2014-05-01

Abstract The present study investigated the effect of opponent gender on the game experience of female players. Concretely, it looked into skill perception and player emotions of women in same gender and cross-gender game competition. We set up a 2×2×2 (male vs. female opponent×low vs. high competitive women×lost vs. won game) experimental design in which women were instructed to play against a proclaimed male and female competitor. Unknowingly, however, participants played against an AI, which was configured to produce a winning and a losing condition for each opponent by manipulating difficulty. Results indicated that opponent gender only had an effect on perceived stress, which was higher with male opponents. Moreover, players evaluated their own gaming skills as lower and the skills of presumed male opponents as higher when they thought they were playing against men. Importantly, our results also showed that the above described pattern for self-perceived skills and perceived opponent skills was modulated by trait competitiveness with a larger effect size for low competitive women. Overall, this study illustrates that gender dynamics affect the play experience of women in cross-gender gaming competition. Implications and suggestions for future research are discussed.

Understanding response patterns in dyadic conflict: An interactive approach combining self-construal and opponent's dominance-submissiveness.

Science.gov (United States)

Au, Al K C; Lam, Shui-Fong

2017-04-01

Previous works on the effect of self-construal in interpersonal behaviours tend to adopt a main effect approach. The present research proposes an interactive approach in understanding two response patterns in dyadic conflict by combining self-construal and the stance of the opponent. Independent self-construal was hypothesised to be associated with a self-centred pattern of conflict response, which is characterised by taking contending responses regardless of whether the stance of the opponent is dominant or submissive. Relational self-construal was hypothesised to be associated with a tuning-in pattern of conflict response, which is characterised by showing contending responses when the opponent is submissive but yielding responses when the opponent is dominant. With trait self-construal measured and opponent's stance manipulated, Study 1 provided initial support for the hypotheses. Study 2 showed a three-way interaction effect between trait self-construal, manipulated self-construal and the opponent's stance on actual conflict responses during discussion of a scenario. The effect of self-construal manipulation was only observed among people who were low in trait independent self-construal and average in trait relational self-construal. The results pinpoint the importance of considering personal and opponent factors simultaneously in understanding the dynamics of dyadic conflict processes. © 2015 International Union of Psychological Science.

Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date.

Science.gov (United States)

Xu, Zhenzhen; Zou, Yongxing; Kong, Xiangjie

2015-01-01

To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA.

To breathe or fight? Siamese fighting fish differ when facing a real opponent or mirror image.

Science.gov (United States)

Arnott, Gareth; Beattie, Emma; Elwood, Robert W

2016-08-01

Displays are a feature of animal contest behaviour and have been interpreted as a means of gathering information on opponent fighting ability, as well as signalling aggressive motivation. In fish, contest displays often include frontal and lateral elements, which in the latter involves contestants showing their flanks to an opponent. Previous work in a range of fish species has demonstrated population-level lateralization of these displays, preferentially showing one side to their opponent. Mirrors are commonly used in place of a real opponent to study aggression in fish, yet they may disrupt the normal pattern of display behaviour. Here, using Siamese fighting fish, Betta splendens, we compare the aggressive behaviour of males to a mirror image and real opponent behind a transparent barrier. As this species is a facultative air-breather, we also quantify surface breathing, providing insights into underlying fight motivation. Consistent with previous work, we found evidence of population-level lateralization, with a bias to present the left side and use the left eye when facing a real opponent. Contrary to expectations, there were no differences in the aggressive displays to a mirror and real opponent, with positive correlations between the behaviour in the two scenarios. However, there were important differences in surface breathing, which was more frequent and of longer duration in the mirror treatment. The reasons for these differences are discussed in relation to the repertoire of contest behaviour and motivation when facing a real opponent. Copyright © 2016 Elsevier B.V. All rights reserved.

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

An Opponent-Process Theory of Motivation: II. Cigarette Addiction

Science.gov (United States)

Solomon, Richard L.; Corbit, John D.

1973-01-01

Methods suggested by opponent-process theory of acquired motivation in helping smokers to quit the habit include use of antagonistic drugs, total cessation from tobacco, and decrease in intensity and frequency of tobacco use. (DS)

The effect of opponent type on human performance in a three-alternative choice task.

Science.gov (United States)

Lie, Celia; Baxter, Jennifer; Alsop, Brent

2013-10-01

Adult participants played computerised games of "Paper Scissors Rock". Participants in one group were told that they were playing against the computer, and those in the other group were told that they were playing against another participant in the adjacent room. The participant who won the most games would receive a $50 prize. For both groups however, the opponent's responses (paper, scissors, or rock) were generated by the computer, and the distribution of these responses was varied across four blocks of 126 trials. Results were analysed using the generalised matching law for the three possible pairs of alternatives (paper vs. scissors, paper vs. rock, and scissors vs. rock) across all participants in each group. Overall, significantly higher estimates of sensitivity to the distribution of opponent's responses were obtained from participants who were told their opponent was a computer compared to participants who were told their opponent was another participant. While adding to the existing literature showing that the generalised matching law is an adequate descriptor of human three-alternative choice behaviour, these findings show that external factors such as perceived opponent type can affect the efficacy of reinforcer contingencies on human behaviour. This suggests that generalising the results from tasks performed against a computer to real-life human-to-human interactions warrants some caution. Copyright © 2013 Elsevier B.V. All rights reserved.

Integrated Scheduling of Production and Distribution with Release Dates and Capacitated Deliveries

Directory of Open Access Journals (Sweden)

Xueling Zhong

2016-01-01

Full Text Available This paper investigates an integrated scheduling of production and distribution model in a supply chain consisting of a single machine, a customer, and a sufficient number of homogeneous capacitated vehicles. In this model, the customer places a set of orders, each of which has a given release date. All orders are first processed nonpreemptively on the machine and then batch delivered to the customer. Two variations of the model with different objective functions are studied: one is to minimize the arrival time of the last order plus total distribution cost and the other is to minimize total arrival time of the orders plus total distribution cost. For the former one, we provide a polynomial-time exact algorithm. For the latter one, due to its NP-hard property, we provide a heuristic with a worst-case ratio bound of 2.

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

Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

Directory of Open Access Journals (Sweden)

Tao Ren

2014-01-01

Full Text Available We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

Asymptotic analysis of SPTA-based algorithms for no-wait flow shop scheduling problem with release dates.

Science.gov (United States)

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time

Directory of Open Access Journals (Sweden)

Chuan-Li Zhao

2014-01-01

Full Text Available This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d. It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in On4 time. For the model with job-independent position effects, we proved that the problems can be solved in On3 time by providing a dynamic programming algorithm.

Memory of opponents is more potent than visual sign stimuli after social hierarchy has been established

DEFF Research Database (Denmark)

Korzan, W.J.; Höglund, Erik; Watt, M.J.

2007-01-01

During agonistic interactions between male Anolis carolinensis, perception of a visual sign stimulus (darkened eyespots) not only inhibits aggression and promotes initial attainment of dominant social status, but also evokes distinct neuroendocrine responses in each opponent. This study was desig......During agonistic interactions between male Anolis carolinensis, perception of a visual sign stimulus (darkened eyespots) not only inhibits aggression and promotes initial attainment of dominant social status, but also evokes distinct neuroendocrine responses in each opponent. This study...... was designed to examine the effect of eyespot manipulation on behavior and social rank during a second interaction between opponents that had previously established a natural dyadic social hierarchy. Prior to a second interaction, eyespots of familiar size-matched combatants were manipulated to reverse...... information conveyed by this visual signal. Eyespots on the previously dominant male were masked with green paint to indicate low aggression and social status. Previously subordinate males had their eyespots permanently marked with black paint to convey high aggression and status. Opponents were then re...

Identifying and tracking switching, non-stationary opponents: a Bayesian approach

CSIR Research Space (South Africa)

Hernandez-Leal, P

2016-02-01

Full Text Available extend BPR to adversarial settings, in particular, to opponents that switch from one stationary strategy to another. Our proposed extension enables learning new models in an online fashion when the learning agent detects that the current policies...

Opponent-Color Fusion of Multi-Sensor Imagery: Visible, IR and SAR

National Research Council Canada - National Science Library

Waxman, A

1998-01-01

.... Building on the work reported in two of our earlier papers from IRIS Passive Sensors 1996, we show how opponent-color processing and center-surround shunting neural networks can be used to develop...

A Pyrrhic victory for the opponents

International Nuclear Information System (INIS)

Haag, J.

2000-01-01

This article reviews the situation of renewable energies in Switzerland after a popular vote turned down promotional measures in the year 2000. The situation is analysed and the opinions of various leaders of professional associations and political groups are discussed. Comparisons are made between ideas said to evolve from short-term narrow-mindedness and those developed by more visionary corporations and governments. The effect of the negative outcome of the popular vote on research and development and economic development are discussed. The author expresses his opinion that measures will still have to be taken, thus making the opponents' success more of a Pyrrhic sort of victory

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

Expectancy effects in tennis: the impact of opponents' pre-match non-verbal behaviour on male tennis players.

Science.gov (United States)

Buscombe, Richard; Greenlees, Iain; Holder, Tim; Thelwell, Richard; Rimmer, Matt

2006-12-01

In this study, we examined the impact of a male opponent's pre-match body language and clothing (general vs. sports-specific) on how his performances were judged by an observer. Forty male tennis players viewed videos of a male target tennis player warming up and then observed playing footage of the target. Each participant viewed the target player warming up displaying one of four combinations of body language and clothing (positive body language/tennis-specific clothing; positive body language/general sportswear; negative body language/tennis-specific clothing; negative body language/general sportswear). Participants rated the performance of the tennis player and gave their perceptions of the likely outcome of a tennis match with the target player. Analyses of variance indicated that clothing and body language had an interactive effect on both outcome expectations and ratings of performance. The findings support the contention that the initial impressions athletes form of their opponents can influence the way in which they judge the performances of opponents and their perceived likelihood of success against the same opponents.

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

A test of the opponent-process theory of motivation using lesions that selectively block morphine reward.

Science.gov (United States)

Vargas-Perez, Hector; Ting-A-Kee, Ryan A; Heinmiller, Andrew; Sturgess, Jessica E; van der Kooy, Derek

2007-06-01

The opponent-process theory of motivation postulates that motivational stimuli activate a rewarding process that is followed by an opposed aversive process in a homeostatic control mechanism. Thus, an acute injection of morphine in nondependent animals should evoke an acute rewarding response, followed by a later aversive response. Indeed, the tegmental pedunculopontine nucleus (TPP) mediates the rewarding effects of opiates in previously morphine-naive animals, but not other unconditioned effects of opiates, or learning ability. The aversive opponent process for acute morphine reward was revealed using a place-conditioning paradigm. The conditioned place aversion induced by 16-h spontaneous morphine withdrawal from an acute morphine injection in nondependent rats was abolished by TPP lesions performed prior to drug experience. However, TPP-lesioned rats did show conditioned aversions for an environment paired with the acute administration of the opioid antagonist naloxone, which blocks endogenous opioids. The results show that blocking the rewarding effects of morphine with TPP lesions also blocked the opponent aversive effects of acute morphine withdrawal in nondependent animals. Thus, this spontaneous withdrawal aversion (the opponent process) is induced by the acute rewarding effects of morphine and not by other unconditioned effects of morphine, the pharmacological effects of morphine or endogenous opioids being displaced from opiate receptors.

Video Game Violence and the Female Game Player: Self- and Opponent Gender Effects on Presence and Aggressive Thoughts

Science.gov (United States)

Eastin, Matthew S.

2006-01-01

Adding depth and breadth to the general aggression model, this paper presents three experiments that test the relationships among user and opponent gender representation, opponent type, presence, and aggressive thoughts from violent video game play. Studies 1 and 2 suggest that females experience greater presence and more aggressive thoughts from…

oRGB: a practical opponent color space for computer graphics.

Science.gov (United States)

Bratkova, Margarita; Boulos, Solomon; Shirley, Peter

2009-01-01

Designed for computer graphics, oRGB is a new color model based on opponent color theory. It works well for both HSV-style color selection and computational applications such as color transfer. oRGB also enables new applications such as a quantitative cool-to-warm metric, intuitive color manipulation and variations, and simple gamut mapping.

Integrated network design and scheduling problems :

Energy Technology Data Exchange (ETDEWEB)

Nurre, Sarah G.; Carlson, Jeffrey J.

2014-01-01

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

The coupling between gaze behavior and opponent kinematics during anticipation of badminton shots.

Science.gov (United States)

Alder, David; Ford, Paul R; Causer, Joe; Williams, A Mark

2014-10-01

We examined links between the kinematics of an opponent's actions and the visual search behaviors of badminton players responding to those actions. A kinematic analysis of international standard badminton players (n = 4) was undertaken as they completed a range of serves. Video of these players serving was used to create a life-size temporal occlusion test to measure anticipation responses. Expert (n = 8) and novice (n = 8) badminton players anticipated serve location while wearing an eye movement registration system. During the execution phase of the opponent's movement, the kinematic analysis showed between-shot differences in distance traveled and peak acceleration at the shoulder, elbow, wrist and racket. Experts were more accurate at responding to the serves compared to novice players. Expert players fixated on the kinematic locations that were most discriminating between serve types more frequently and for a longer duration compared to novice players. Moreover, players were generally more accurate at responding to serves when they fixated vision upon the discriminating arm and racket kinematics. Findings extend previous literature by providing empirical evidence that expert athletes' visual search behaviors and anticipatory responses are inextricably linked to the opponent action being observed. Copyright © 2014 Elsevier B.V. All rights reserved.

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

The Science of Racing against Opponents: Affordance Competition and the Regulation of Exercise Intensity in Head-to-Head Competition.

Science.gov (United States)

Hettinga, Florentina J; Konings, Marco J; Pepping, Gert-Jan

2017-01-01

Athlete-environment interactions are crucial factors in understanding the regulation of exercise intensity in head-to-head competitions. Previously, we have proposed a framework based on the interdependence of perception and action, which allows us to explore athletic behavior in the more complex pacing situations occurring when athletes need to respond to actions of their opponents. In the present perspective we will further explore whether opponents, crucial external factors in competitive sports, could indeed be perceived as social invitations for action. Decisions regarding how to expend energy over the race are based on internal factors such as the physiological/biomechanical capacity of the athlete in relation to external factors such as those presented by opponents. For example: Is the athlete able to overtake competitors, or not? We present several experimental studies that demonstrate that athletes regulate their exercise intensity differently in head-to-head competition compared to time-trial exercises: Relational athlete-environment aspects seem to outweigh benefits of the individual optimal energy distribution. Also, the behavior of the opponents has been shown to influence pacing strategies of competing athletes, again demonstrating the importance of relational athlete-environment aspects in addition to strictly internal factors. An ecological perspective is presented in which opponents are proposed to present social affordances, and decision-making is conceptualized as a resultant of affordance-competition. This approach will provide novel insights in tactical decision-making and pacing behavior in head-to-head competitions. Future research should not only focus on the athlete's internal state, but also try to understand opponents in the context of the social affordances they provide.

Response saturation of monochromatic increments on intense achromatic backgrounds: implications for color-opponent organization in human vision

Science.gov (United States)

Drum, Bruce; Sternheim, Charles E.

2005-10-01

We present evidence that steady achromatic adapting fields can produce response saturation in color-opponent pathways. We measured tvi (log increment threshold illuminance versus log background illuminance) functions at four test wavelengths (430, 490, 575, and 660 nm) and nine background illuminances from 4.0 to 5.6 log Td. Foveal, 2° diameter, 1 s duration test stimuli were presented on a concentric, perceptually white (5128°K color temperature), 7° diameter, steady background. Thresholds were obtained by the method of adjustment, after which the test stimulus illuminances were increased 0.6 log unit and the subject estimated percentages of red, yellow, green, blue, and white. Average tvi slopes for two subjects were 2.06 for 430 nm, 1.6 for 490 nm, 1.11 for 575 nm and 1.34 for 660 nm, consistent with the estimated ratios of chromatic to achromatic sensitivity at the same wavelengths. Also, the percentage of white seen in the suprathreshold increments increased with increasing background illuminance despite increases in excitation purity. These findings imply that steady, intense, achromatic backgrounds can produce response saturation in color-opponent mechanisms at wavelengths across the visible spectrum. The saturation was more extreme at short wavelengths than at middle or long wavelengths, producing a tritanopic condition at the highest background illuminances. The tritanopia reduced color space to a predominately red-blue dichromacy, in agreement with previous findings. The results support a multistage opponent-color model in which precortical koniocellular and parvocellular opponent pathways interact to produce the observed red-green and yellow-blue color-opponent channels at a cortical level.

Game Schedules and Rate of Concussions in the National Football League.

Science.gov (United States)

Teramoto, Masaru; Cushman, Daniel M; Cross, Chad L; Curtiss, Heather M; Willick, Stuart E

2017-11-01

Concussion prevention in the National Football League (NFL) is an important priority for player safety. The NFL now has modified game schedules, and one concern is that unconventional game schedules, such as a shortened rest period due to playing on a Thursday rather than during the weekend, may lead to an increased risk of injuries. Unconventional game schedules in the NFL are associated with an increased rate of concussion. Descriptive epidemiological study. This study analyzed concussions and game schedules over the NFL regular seasons from 2012 to 2015 (4 years). Documented numbers of concussions, identified by use of the online database PBS Frontline Concussion Watch, were summarized by regular-season weeks. Association of days of rest and game location (home, away, or overseas) with the rate of concussion was examined by use of the χ 2 test. Logistic regression analysis was performed to examine the relationships of days of rest and home/away games to the risk of repeated concussions, with adjustment for player position. A total of 582 concussions were analyzed in this study. A significantly greater number of concussions occurred in the second half of the season ( P game location, or timing of the bye week by the team or the opponent ( P > .05). Game schedules were not significantly associated with the occurrence of repeat concussions ( P > .05). Unconventional game schedules in the NFL, including playing on Thursday and playing overseas, do not seem to put players at increased risk of concussions.

A comparison of due-date selection rules

NARCIS (Netherlands)

Baker, K.R.; Bertrand, J.W.M.

1981-01-01

In sequencing and scheduling models it is usually assumed that due dates represent exogeneous information. In many practical settings, however, due dates can be discretionary, or at least negotiable. Relatively few studies have incorporated discretionary due dates, and even then the rules proposed

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

month; the necessary rate of a month; the quantities to be completed before half period of the project; the quantities to be achieved before the cold function test. Due to a lot of documents and equipment in LANP, it is impossible to present their supply dates one by one in the level 2 project schedule. The rules, in reference to the corresponding construction starting dates, were given to define the supply dates. The good practices of construction schedule control are presented, including draft of a construction program, performance evaluation, specific coordination meeting and Work Load Point application. The schedule control culture is described, that is one core, two criteria, three control mechanisms, four resources to be secured. (author)

Learning from induced changes in opponent (re)actions in multi-agent games

NARCIS (Netherlands)

P.J. 't Hoen (Pieter Jan); S.M. Bohte (Sander); J.A. La Poutré (Han)

2005-01-01

textabstractMulti-agent learning is a growing area of research. An important topic is to formulate how an agent can learn a good policy in the face of adaptive, competitive opponents. Most research has focused on extensions of single agent learning techniques originally designed for agents in more

The scheduling of repeat cesarean section operations: prospective management protocol experience.

Science.gov (United States)

Read, J A

1985-03-01

There are benefits to patients and a busy obstetric service if repeat cesarean section operations are performed on a scheduled basis. Optimum management avoids prematurity and reduces the need for amniocentesis. Over a period of 20 months repeat cesarean sections were performed at Tripler Army Medical Center while a protocol with the following elements was used: (1) known last menstrual period; (2) landmarks: positive urine human chorionic gonadotropin test by 6 weeks, Doppler fetal heart tone by 12 weeks, date determination by examination before 10 weeks, fetoscope fetal heart tone by 20 weeks, and date determination by size before 30 weeks; (3) date determination by midtrimester sonogram(s); (4) normal third-trimester glucose screening; (5) biparietal diameter of 9.2 or 9.5 cm before scheduling. With two or more clinical landmarks and one date by sonogram or one landmark and date by two sonograms, elective repeat cesarean section was scheduled at 39 weeks if the biparietal diameter was greater than or equal to 9.2 cm (127). If dates by sonogram were less than dates by last menstrual period but greater than 1 week or if last menstrual period was unknown, dates by sonogram and landmarks corresponding to dates by sonogram were used to electively schedule, with biparietal diameters of 9.2 or 9.5 cm respectively required (28). If protocol criteria were not met or earlier delivery was indicated (e.g., vertical scar or diabetes), amniocentesis was performed (42), except when not possible, advisable, or refused when patients either elected labor (20) or were scheduled if three or more criteria for 40+ weeks were met (18). Of 225 patients (70.5%) scheduled by protocol (173), amniocentesis (34), or medical indication (18), 188 (58.9%) were delivered without labor. In the 147 patients (46.1%) delivered electively by protocol without labor or amniocentesis, there were no cases of respiratory distress syndrome and the mean birth weight was 3517 gm. With early care and better

5 CFR 950.801 - Campaign schedule.

Science.gov (United States)

2010-01-01

... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...

Analyzing NPS Scheduling Using OSIRIS

Science.gov (United States)

1993-03-01

School TEACHER SCHEDULE BLOCKS REPORT Date: 2/19/93 Period Name ID Term Days 1234 Adragna , Joe 170401 1 F xx Agrawal, Brij 120101 1 F xx Almquist...LOAD REPORT Date: 3/18/93 Total Max Consec Total Teacher ID Term Classes Classes Stud Adragna , Joe 170401 1 1 1 3 Agrawal, Brij 120101 1 2 2 98 Aiello

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

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

Directory of Open Access Journals (Sweden)

Peng Liu

2017-01-01

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

Opponent Coding of Sound Location (Azimuth) in Planum Temporale is Robust to Sound-Level Variations.

Science.gov (United States)

Derey, Kiki; Valente, Giancarlo; de Gelder, Beatrice; Formisano, Elia

2016-01-01

Coding of sound location in auditory cortex (AC) is only partially understood. Recent electrophysiological research suggests that neurons in mammalian auditory cortex are characterized by broad spatial tuning and a preference for the contralateral hemifield, that is, a nonuniform sampling of sound azimuth. Additionally, spatial selectivity decreases with increasing sound intensity. To accommodate these findings, it has been proposed that sound location is encoded by the integrated activity of neuronal populations with opposite hemifield tuning ("opponent channel model"). In this study, we investigated the validity of such a model in human AC with functional magnetic resonance imaging (fMRI) and a phase-encoding paradigm employing binaural stimuli recorded individually for each participant. In all subjects, we observed preferential fMRI responses to contralateral azimuth positions. Additionally, in most AC locations, spatial tuning was broad and not level invariant. We derived an opponent channel model of the fMRI responses by subtracting the activity of contralaterally tuned regions in bilateral planum temporale. This resulted in accurate decoding of sound azimuth location, which was unaffected by changes in sound level. Our data thus support opponent channel coding as a neural mechanism for representing acoustic azimuth in human AC. © The Author 2015. Published by Oxford University Press.

Racing an Opponent Alters Pacing, Performance and Muscle Force Decline, But Not RPE

NARCIS (Netherlands)

Konings, Marco J; Parkinson, Jordan; Zijdewind, Inge; Hettinga, Florentina

PURPOSE: Performing against a virtual opponent has been shown to invite a change in pacing and improve time trial (TT) performance. This study explored how this performance improvement is established by assessing changes in pacing, neuromuscular function and perceived exertion. METHODS: After a peak

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

Improved Hybrid Opponent System for Professional Military Training

Directory of Open Access Journals (Sweden)

Michael Pelosi

2017-10-01

Full Text Available Described herein is a general-purpose software engineering architecture for autonomous, computer controlled opponent implementation in modern maneuver warfare simulation and training. The implementation has been developed, refined, and tested in the user crucible for several years. The approach represents a hybrid application of various well-known AI techniques, including domain modeling, agent modeling, and object-oriented programming. Inspired by computer chess approaches, the methodology combines this theoretical foundation with a hybrid and scalable portfolio of additional techniques. The result remains simple enough to be maintainable, comprehensible for the code writers as well as the end-users, and robust enough to handle a wide spectrum of possible mission scenarios and circumstances without modification.

Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-04-01

Full Text Available This paper discusses an integrated model of batch production and maintenance scheduling on a deteriorating machine producing multiple items to be delivered at a common due date. The model describes the trade-off between total inventory cost and maintenance cost as the increase of production run length. The production run length is a time bucket between two consecutive preventive maintenance activities. The objective function of the model is to minimize total cost consisting of in process and completed part inventory costs, setup cost, preventive and corrective maintenance costs and rework cost. The problem is to determine the optimal production run length and to schedule the batches obtained from determining the production run length in order to minimize total cost.

Nuclear opponents sentenced to pay electricity rates

International Nuclear Information System (INIS)

Anon.

1980-01-01

In its decison of March 19, 1980 the Local Court of Hamburg sentenced a nuclear opponent to pay the sum withheld to the electricity supply utility. He had remitted 10 per cent of the rate on a blocked account. A right to refuse payment cannot be founded on Art. 4 of the Basic Law, since the freedom of conscience is not unilimited but may be restricted by the legal system or by obligations undertaken by oneself. Nor does the defendant have a right to withhold, since he is not entitled to a counter-claim from the power supply contract. Against the right to refuse payment in good faith speaks the fact that the plaintiff operates the nuclear power plant legally persuant to a licence. Even if the licence was withdrawn by an administrative court, this would not abolish with retroactive effect the existing reasonability of payment. (HSCH) [de

Hydroelectricity and ecological considerations. Falsification of the environmental reality by the opponents of hydropower

Directory of Open Access Journals (Sweden)

Andrzej Giziński

2013-09-01

Full Text Available Opponents of hydroelectricity claim falsely that hydrotechnical development of the Lower Vistula River constitutes implementation of Edward Gierek’s concept of bringing only environmental damage1. Statements on the negative environmental impact of constructing small hydroelectric power stations (SHPS are equally groundless. Permanent protests against the construction of dams and river damming, regardless of the motivations and will of protesters, increase energy dependence on Russia, and preserves the poor, post-Bierut hydrological situation2. The main fallacy made by hydropower opponents is the alternative treatment of power and environmental purposes. Environmental errors consist in continuous omission of even the most obvious positive ecological effects of constructing river dams and – what is especially reprehensible – inventing non-existent threats, e.g. lethal concentration of toxic heavy metals in deposits of the Włocławek Reservoir or the detrimental impact of warming up water in stage of falls on the fish population below the dam.

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.

Scheduling job shop - A case study

Science.gov (United States)

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

2016-08-01

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

Offshore wind power in Sweden—A qualitative analysis of attitudes with particular focus on opponents

International Nuclear Information System (INIS)

Waldo, Åsa

2012-01-01

The Swedish Parliament has voted for massive expansion of wind power within the next decade. As in many other countries, the establishment of new wind farms has aroused local opposition. This paper contributes to the literature using a qualitative methodology to analyse attitudes towards wind power. In 2007, we carried out in-depth interviews with 40 stakeholders concerned with two planned near-shore farms in Sweden; despite their location, the wind farms' visual impact provoked strong negative attitudes. However, we found no evidence of the NIMBY-syndrome; rather, those opposing the wind farms question wind power more generally, especially vis-à-vis nuclear power. The analysis of attitudes is based on three components: cognition, feeling and action tendency. The results show high consistency between the feeling and cognitive components of attitudes: a negative feeling regarding landscape impact, for example, is accompanied by a belief that wind power is inefficient and unprofitable. However, in many cases the action tendency component is in dissonance with the other two: opponents remain passive despite being against the establishment of new wind farms. These passive opponents represent elements of uncertainty as they may suddenly, at a late stage, turn into active opponents exerting an effect on the decision process. - Highlights: ► Opposition to near-shore wind farms expressed in in-depth interviews is analysed. ► Wind power is viewed as a threat to landscape qualities regardless of proximity. ► Inefficiency and unprofitability are reasons to question wind power establishments. ► Passive opposition is an element of uncertainty that may turn into active opposition. ► Understanding of local response must rest on level of support as well as activity.

The complexity behind the date

CERN Multimedia

2009-01-01

For the waiting world, and indeed for most of us here at CERN, ‘the LHC schedule’ simply means the date that the LHC will restart - and we only take notice when that end-date changes. But in fact the schedule is a constantly evolving intricate document coordinating all the repairs, consolidation and commissioning in every part of the machine. So, what actually goes on behind the scenes in timing and planning all the work on one of the most complex scientific instruments ever built?

The Thera eruption: continuing discussion of the dating

International Nuclear Information System (INIS)

Aitken, M.J.; Betancourt, P.P.

1988-01-01

Until recently it had been generally accepted that the radiocarbon dates for the destruction levels at Akrotiri resulting from the Minoan eruption of Thera on the Aegean island of Santorini 'did not make sense', interference by carbon dioxide emanations from the volcano, deficient in carbon-14, sometimes being suggested as the cause (as recently discussed by Olsson 1987). The scatter was said to be unacceptably large, but above all, after calibration the majority of dates were at least a century earlier than expected on the basis of the accepted Minoan chronology, established by archaeological linkages to the Egyptian astronomically-anchored calendar. The situation has now been changed. First, from a reassessment of linkages it has been proposed (Betancourt 1987) that the relevant Late Minoan period (LM IA) started at least a century earlier than according to the usual chronology. Secondly, accurate high-precision calibration curves have become available (e.g. Pearson and Stuiver 1986); although previous curves are generally concordant with these, for the relevant period the new calibration has the effect of making calibrated dates more recent by about half a century. The purpose of the present note is to bring together the various datings that are now extant. Although a shift of a century may seem trivial to those remote from Aegean archaeology the topic is of more than local interest on account of the tendency for opponents of radiocarbon to use the dates as 'yet another example of failure' and of the challenge to science-based techniques to provide an unambiguous result for this major natural catastrophy. (author)

Vaccinating my way--use of alternative vaccination schedules in New York State.

Science.gov (United States)

Nadeau, Jessica A; Bednarczyk, Robert A; Masawi, Munyaradzi R; Meldrum, Megan D; Santilli, Loretta; Zansky, Shelley M; Blog, Debra S; Birkhead, Guthrie S; McNutt, Louise-Anne

2015-01-01

To identify children vaccinated following an alternative vaccine schedule using immunization information system data and determine the impact of alternative schedule use on vaccine coverage. Children born in New York State, outside New York City, between January 1, 2009 and August 14, 2011 were assessed for vaccination patterns consistent with use of an alternative schedule. Children who by 9 months of age had at least 3 vaccination visits recorded in the statewide mandatory immunization information system after 41 days of age were classified as either attempting to conform to the Centers for Disease Control and Prevention published recommended vaccination schedule or an alternative schedule. The number of vaccination visits and up-to-date status at age 9 months were compared between groups. Of the 222 628 children studied, the proportion of children following an alternative schedule was 25%. These children were significantly less likely to be up-to-date at age 9 months (15%) compared with those conforming to the routine schedule (90%, P Children following an alternative schedule on average had about 2 extra vaccine visits compared with children following a routine schedule (P children in this study appear to be intentionally deviating from the routine schedule. Intentional deviation leads to poor vaccination coverage leaving children vulnerable to infection and increasing the potential for vaccine-preventable disease outbreaks. Copyright © 2015 Elsevier Inc. All rights reserved.

Scheduling Agreeable Jobs On A Single Machine To Minimize ...

African Journals Online (AJOL)

Journal of Applied Science and Technology ... (NP) scheduling of number of jobs on a single machine to minimize weighted number of early and tardy jobs where the earliest start times and latest due date are agreeable (i.e. earliest start time must increase in the same sequence as latest due dates) has been considered.

76 FR 10233 - Schedule of Water Charges

Science.gov (United States)

2011-02-24

... DELAWARE RIVER BASIN COMMISSION 18 CFR Part 420 Schedule of Water Charges AGENCY: Delaware River..., Part III, Basin Regulations--Water Supply Charges. Accordingly, the Commission's water charging rates..., 2011. Effective Date: February 24, 2011. FOR FURTHER INFORMATION CONTACT: For questions about the water...

Reinforcement Learning in the Game of Othello: Learning Against a Fixed Opponent and Learning from Self-Play

NARCIS (Netherlands)

van der Ree, Michiel; Wiering, Marco

2013-01-01

This paper compares three strategies in using reinforcement learning algorithms to let an artificial agent learnto play the game of Othello. The three strategies that are compared are: Learning by self-play, learning from playing against a fixed opponent, and learning from playing against a fixed

The exercise and affect relationship: evidence for the dual-mode model and a modified opponent process theory.

Science.gov (United States)

Markowitz, Sarah M; Arent, Shawn M

2010-10-01

This study examined the relationship between exertion level and affect using the framework of opponent-process theory and the dual-mode model, with the Activation-Deactivation Adjective Checklist and the State Anxiety Inventory among 14 active and 14 sedentary participants doing 20 min of treadmill exercise at speeds of 5% below, 5% above, and at lactate threshold (LT). We found a significant effect of time, condition, Time × Condition, and Time × Group, but no group, Group × Condition, or Time × Group × Condition effects, such that the 5% above LT condition produced a worsening of affect in-task compared with all other conditions whereas, across conditions, participants experienced in-task increases in energy and tension, and in-task decreases in tiredness and calmness relative to baseline. Posttask, participants experienced mood improvement (decreased tension, anxiety, and increased calmness) across conditions, with a 30-min delay in the above LT condition. These results partially support the dual-mode model and a modified opponent-process theory.

Dominant and opponent relations in cortical function: An EEG study of exam performance and stress

Directory of Open Access Journals (Sweden)

Lucia P. Pavlova

2017-12-01

Full Text Available This paper analyzes the opponent dynamics of human motivational and affective processes, as conceptualized by RS Solomon, from the position of AA Ukhtomsky’s neurophysiological principle of the dominant and its applications in the field of human electroencephalographic analysis. As an experimental model, we investigate the dynamics of cortical activity in students submitting university final course oral examinations in naturalistic settings, and show that successful performance in these settings depends on the presence of specific types of cortical activation patterns, involving high indices of left-hemispheric and frontal cortical dominance, whereas the lack thereof predicts poor performance on the task, and seems to be associated with difficulties in the executive regulation of cognitive (intellectual and motivational processes in these highly demanding and stressful conditions. Based on such knowledge, improved educational and therapeutic interventions can be suggested which take into account individual variability in the neurocognitive mechanisms underlying adaptation to motivationally and intellectually challenging, stressful tasks, such as oral university exams. Some implications of this research for opponent-process theory and its closer integration into current neuroscience research on acquired motivations are discussed.

29 CFR 510.10 - Table of wage rates and effective dates.

Science.gov (United States)

2010-07-01

... REGULATIONS IMPLEMENTATION OF THE MINIMUM WAGE PROVISIONS OF THE 1989 AMENDMENTS TO THE FAIR LABOR STANDARDS ACT IN PUERTO RICO Schedule of Minimum Wage Rates Applicable in Puerto Rico § 510.10 Table of wage rates and effective dates. (a) The following table provides effective dates of minimum wage increases...

50 CFR 34.6 - Schedule of appraisals.

Science.gov (United States)

2010-10-01

... Secretary shall make fair market value appraisals of areas administered by the Service within five years... reappraised on a schedule of at least once every five years. Until areas are appraised, the fair market value... fee lands added to such areas after that date shall be on the basis of fair market value. ...

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.

77 FR 42332 - Large Power Transformers From Korea; Revised Schedule for the Subject Investigation

Science.gov (United States)

2012-07-18

... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-1189 (Final)] Large Power Transformers From Korea; Revised Schedule for the Subject Investigation AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date: July 12, 2012. FOR FURTHER INFORMATION CONTACT: Edward...

A transportation-scheduling system for managing silvicultural projects

Science.gov (United States)

Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

2005-01-01

A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

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

Recent experiments testing an opponent-process theory of acquired motivation.

Science.gov (United States)

Solomon, R L

1980-01-01

There are acquired motives of the addiction type which seem to be non-associative in nature. They all seem to involve affective phenomena caused by reinforcers, unconditioned stimuli or innate releasers. When such stimuli are repeatedly presented, at least three affective phenomena occur: (1) affective contrast effects, (2) affective habituation (tolerance), and (3) affective withdrawal syndromes. These phenomena can be precipitated either by pleasant or unpleasant events (positive or negative reinforcers). Whenever we see these three phenomena, we also see the development of an addictive cycle, a new motivational system. These phenomena are explained by an opponent-process theory of motivation which holds that there are affect control systems which oppose large departures from affective equilibrium. The control systems are strengthened by use and weakened by disuse. Current observations and experiments testing the theory are described for: (1) the growth of social attachment (imprinting) in ducklings; and (2) the growth of adjunctive behaviors. The findings so far support the theory.

A Neural Model of Chromatic Induction in Uniform and Textured Images and Psychophysical Detection of Non-Opponent Chromatic Qualia

Science.gov (United States)

Livitz, Gennady

2011-01-01

Color is a complex and rich perceptual phenomenon that relates physical properties of light to certain perceptual qualia associated with vision. Hering's opponent color theory, widely regarded as capturing the most fundamental aspects of color phenomenology, suggests that certain unique hues are mutually exclusive as components of a single color.…

Application of Tabu Search Algorithm in Job Shop Scheduling

Directory of Open Access Journals (Sweden)

Betrianis Betrianis

2010-10-01

Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then  compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.

Decentralization and mechanism design for online machine scheduling

NARCIS (Netherlands)

Arge, Lars; Heydenreich, Birgit; Müller, Rudolf; Freivalds, Rusins; Uetz, Marc Jochen

We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of each job, namely its release date $r_j$, its processing time $p_j$ and its weight $w_j$ is only known to the job itself,

Scheduling of resource-constrained projects

CERN Document Server

Klein, Robert

2000-01-01

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

Opponent appetitive-aversive neural processes underlie predictive learning of pain relief.

Science.gov (United States)

Seymour, Ben; O'Doherty, John P; Koltzenburg, Martin; Wiech, Katja; Frackowiak, Richard; Friston, Karl; Dolan, Raymond

2005-09-01

Termination of a painful or unpleasant event can be rewarding. However, whether the brain treats relief in a similar way as it treats natural reward is unclear, and the neural processes that underlie its representation as a motivational goal remain poorly understood. We used fMRI (functional magnetic resonance imaging) to investigate how humans learn to generate expectations of pain relief. Using a pavlovian conditioning procedure, we show that subjects experiencing prolonged experimentally induced pain can be conditioned to predict pain relief. This proceeds in a manner consistent with contemporary reward-learning theory (average reward/loss reinforcement learning), reflected by neural activity in the amygdala and midbrain. Furthermore, these reward-like learning signals are mirrored by opposite aversion-like signals in lateral orbitofrontal cortex and anterior cingulate cortex. This dual coding has parallels to 'opponent process' theories in psychology and promotes a formal account of prediction and expectation during pain.

76 FR 39159 - Schedule for Rating Disabilities; The Digestive System

Science.gov (United States)

2011-07-05

... of this change is to incorporate medical advances that have occurred since the last review, insert current medical terminology, and provide clear criteria. DATES: Comments must be received by VA on or... the rating schedule, and implement current medical criteria and terminology that reflect recent...

Guidelines of Decommissioning Schedule Establishment

Energy Technology Data Exchange (ETDEWEB)

Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

2016-10-15

Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

The eschatological opponent of Daniel and the Antichrist of the Syriac Apocalypse of Daniel

Directory of Open Access Journals (Sweden)

Sara Daiane Silva José

2014-12-01

Full Text Available The Syriac Apocalypse of Daniel (Syr Apoc Dan, a Christian apocalypse from the seventh century of Common Era, is clearly tributary to the canonical book of Daniel (Dn. In its turn, Dn provided the figure of an eschatological opponent who was re-signified in Christianity: the Antichrist. The cosmic dimensions of the malevolent character of oppressive tyrant of Dn – his arrogance against the gods, the abomination of desolation, military conquests and persecutions of the saints, the change of the cosmic order, the time of the reign and death of the tyrant – are considered in this work compared with the Antichrist of the Syr Apoc Dan.

A Mathematical Model for Scheduling a Batch Processing Machine with Multiple Incompatible Job Families, Non-identical Job dimensions, Non-identical Job sizes, Non-agreeable release times and due dates

International Nuclear Information System (INIS)

Ramasubramaniam, M; Mathirajan, M

2013-01-01

The paper addresses the problem scheduling a batch processing machine with multiple incompatible job families, non-identical job dimensions, non-identical job sizes and non-agreeable release dates to minimize makespan. The research problem is solved by proposing a mixed integer programming model that appropriately takes into account the parameters considered in the problem. The proposed is validated using a numerical example. The experiment conducted show that the model can pose significant difficulties in solving the large scale instances. The paper concludes by giving the scope for future work and some alternative approaches one can use for solving these class of problems.

Machine scheduling to minimize weighted completion times the use of the α-point

CERN Document Server

Gusmeroli, Nicoló

2018-01-01

This work reviews the most important results regarding the use of the α-point in Scheduling Theory. It provides a number of different LP-relaxations for scheduling problems and seeks to explain their polyhedral consequences. It also explains the concept of the α-point and how the conversion algorithm works, pointing out the relations to the sum of the weighted completion times. Lastly, the book explores the latest techniques used for many scheduling problems with different constraints, such as release dates, precedences, and parallel machines. This reference book is intended for advanced undergraduate and postgraduate students who are interested in scheduling theory. It is also inspiring for researchers wanting to learn about sophisticated techniques and open problems of the field.

Interface between the production plan and the master production schedule in assembly environments

OpenAIRE

Moya Navarro, Marcos; Sánchez Brenes, Magaly

2012-01-01

In a production environment there is a direct relationship between the market and the manufacturing process of goods.When production is immersed in an assembly environment, the process of production planning and scheduling becomes complex, and the enterprises have the risk of losing competitive advantages in terms of not meeting delivery dates and production high costs. Linear programming has become an appropriate tool for production planning and scheduling in complex manufacturing environmen...

77 FR 67395 - Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Revised Schedule for the...

Science.gov (United States)

2012-11-09

... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 701-TA-350 and 731-TA-616 and 618 (Third Review)] Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Revised Schedule for the Subject Reviews AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date...

Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

Directory of Open Access Journals (Sweden)

Hendra Achmadi

2010-06-01

Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.

Ready for a fight? The physiological effects of detecting an opponent's pheromone cues prior to a contest.

Science.gov (United States)

Garcia, Mark J; Williams, John; Sinderman, Benjamin; Earley, Ryan L

2015-10-01

Reception of pheromone cues can elicit significant physiological (e.g. steroid hormone levels) changes in the recipient. These pheromone-induced physiological changes have been well documented for male-female interactions, but scarcely in same-sex interactions (male-male and female-female). We sought to address this dearth in the current literature and examine whether mangrove rivulus fish (Kryptolebias marmoratus) could detect and, ultimately, mount a physiological response to the pheromone signature of a potential, same-sex competitor. We examined steroid hormone levels in mangrove rivulus exposed to one of three treatments: 1) isolation, 2) exposure to pheromones of a size-matched partner, and 3) pheromone exposure to a size-matched opponent followed by a physical encounter with the opponent. We found that exposure to a competitor's pheromone cues elicited a significant increase in testosterone levels. Increases in testosterone were similar across genetically distinct lineages derived from geographically distinct populations. Further, testosterone levels were similar between individuals only exposed to pheromone cues and individuals exposed to both pheromone cues and a subsequent physical encounter. Our findings led us to generate a number of testable predictions regarding how mangrove rivulus utilize pheromone signals in social interactions, the molecular mechanisms linking social stimuli and hormonal responses, and the possible adaptive benefits of hormonal responsiveness to receiving a potential competitor's pheromone cues. Copyright © 2015 Elsevier Inc. All rights reserved.

Distinguishing the opponents promotes cooperation in well-mixed populations

Science.gov (United States)

Wardil, Lucas; da Silva, Jafferson K. L.

2010-03-01

Cooperation has been widely studied when an individual strategy is adopted against all coplayers. In this context, some extra mechanisms, such as punishment, reward, memory, and network reciprocity must be introduced in order to keep cooperators alive. Here, we adopt a different point of view. We study the adoption of different strategies against different opponents instead of adoption of the same strategy against all of them. In the context of the prisoner dilemma, we consider an evolutionary process in which strategies that provide more benefits are imitated and the players replace the strategy used in one of the interactions furnishing the worst payoff. Individuals are set in a well-mixed population, so that network reciprocity effect is excluded and both synchronous and asynchronous updates are analyzed. As a consequence of the replacement rule, we show that mutual cooperation is never destroyed and the initial fraction of mutual cooperation is a lower bound for the level of cooperation. We show by simulation and mean-field analysis that (i) cooperation dominates for synchronous update and (ii) only the initial mutual cooperation is maintained for asynchronous update. As a side effect of the replacement rule, an “implicit punishment” mechanism comes up in a way that exploitations are always neutralized providing evolutionary stability for cooperation.

Organization of the construction and schedule of realization

International Nuclear Information System (INIS)

Szerovay, Antal; Vogel, Oszkar

1988-01-01

The four units of the Paks nuclear power plant with all the auxiliary and service facilities were constructed between 1974 and 1987. Major features of building activities, types of buildings classified according to the connection between the facility and the technology are listed. Processes and structures applied to the construction of the main reactor building are mentioned emphasizing the importance of up-to-date building methods. To move the large equipment into the reactor building Potain cranes of 400 Mp were used. As a result of adequate schedule the auxiliary buildings could be used as preparatory buildings during the construction of the plant. The energy and material supply, the schedule of the construction works are discussed. (V.N.) 6 refs.; 5 figs

Communication, opponents, and clan performance in online games: a social network approach.

Science.gov (United States)

Lee, Hong Joo; Choi, Jaewon; Kim, Jong Woo; Park, Sung Joo; Gloor, Peter

2013-12-01

Online gamers form clans voluntarily to play together and to discuss their real and virtual lives. Although these clans have diverse goals, they seek to increase their rank in the game community by winning more battles. Communications among clan members and battles with other clans may influence the performance of a clan. In this study, we compared the effects of communication structure inside a clan, and battle networks among clans, with the performance of the clans. We collected battle histories, posts, and comments on clan pages from a Korean online game, and measured social network indices for communication and battle networks. Communication structures in terms of density and group degree centralization index had no significant association with clan performance. However, the centrality of clans in the battle network was positively related to the performance of the clan. If a clan had many battle opponents, the performance of the clan improved.

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

Auspicious birth dates among Chinese in California.

Science.gov (United States)

Almond, Douglas; Chee, Christine Pal; Sviatschi, Maria Micaela; Zhong, Nan

2015-07-01

The number eight is considered lucky in Chinese culture, e.g. the Beijing Olympics began at 8:08 pm on 8/8/2008. Given the potential for discretion in selecting particular dates of labor induction or scheduled Cesarean section (C-section), we consider whether Chinese-American births in California occur disproportionately on the 8th, 18th, or 28th day of the month. We find 2.3% "too many" Chinese births on these auspicious birth dates, whereas Whites show no corresponding increase. The increase in Chinese births is driven by higher parity C-sections: the number of repeat C-sections is 6% "too high" on auspicious birth dates. Sons born to Chinese parents account for the entire increase; daughter deliveries do not seem to be timed to achieve "lucky" birth dates. We also find avoidance of repeat C-section deliveries on the 4th, 14th, and 24th of the month, considered unlucky in Chinese culture. Finally, we replicate earlier work finding that Friday the 13th delivery dates are avoided and document a particularly large decrease among Chinese. For Whites and Chinese in California, mothers with higher levels of education are particularly likely to avoid delivering on the 13th. Copyright © 2015 Elsevier B.V. All rights reserved.

Simulation of less master production schedule nervousness model

OpenAIRE

Herrera , Carlos; Thomas , André

2009-01-01

International audience; In production decision making systems, Master Production Schedule (MPS) states the requirements for individual end items by date and quantity. The solution sensitivity to demand forecast changes, unforeseen supplier and production problem occurrences, is known as nervousness. This feature cause undesirable effects at tactical and operational levels. Some of these effects are production and inventory cost increases and, also, negative impacts on overall and labor produc...

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.

The motivation to breastfeed: a fit to the opponent-process theory?

Science.gov (United States)

Myers, H H; Siegel, P S

1985-07-01

The opponent-process theory, a dynamic model of acquired motivation presented by Solomon and Corbit (1974), was applied to the process of breastfeeding. A modified form of the Nowlis Mood Adjective Checklist (MACL, Nowlis, 1965, 1970) and a discomfort measure were used in assessing through recall the affective course predicted by the theory. The data were analyzed using multivariate analysis of variance (MANOVA) and correlational procedures. Results were highly significant: Women who breastfed for relatively long periods recalled positive affective responses while the baby was at breast and a subsequent negative or dysphoric response. The additional characteristics of acquired motivation, habituation, and withdrawal, were also evidenced in the data. As a control for possible confounding demand characteristics inherent in the methodology, a sample of childless women was surveyed using an "as-if" form of the same questionnaire. Very little similarity to the breastfeeders was found in the pattern of responses yielded by this group. It was concluded that our major findings are quite likely free of influence from this source.

75 FR 5620 - New Date for April 2010 Customs Brokers License Examination

Science.gov (United States)

2010-02-03

... types of infractions. In the case of an applicant for an individual broker's license, section 641... regularly scheduled examination date conflicts with a national holiday, religious observance, or other... (April 5) coincides with the observance of Passover. In consideration of this conflict with Passover, CBP...

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)

Model Integrasi Penjadwalan Produksi Batch dan Penjadwalan Perawatan dengan Kendala Due Date

Directory of Open Access Journals (Sweden)

Zahedi .

2014-01-01

Full Text Available This paper discusses the integration model of batch production and preventive maintenance scheduling on a single machine producing an item to be delivered at a common due date. The machine is a deteriorating machine that requires preventive maintenance to ensure the availability of the machine at a desired service level. Decision variables of the model are the number of preventive maintenances, the schedule, length of production runs, as well as the number of batches, batch sizes and the production schedule of the resulting batches for each production run. The objective function of the model is to minimize the total cost consisting of inventory costs during parts processing, setup cost and cost of preventive maintenance. The results show three important points: First, the sequence of optimal batches always follows the SPT (short processing time. Second, variation of preventive maintenance unit cost does not influence the sequence of batches. Third, the first production run length from production starting time is smaller than the next production run length and this pattern continues until the due date. When in process inventory unit cost is increased, the pattern will continue until a specified cost limit, and beyond the limit the pattern will change to be the opposite pattern.

An Improved Multiobjective PSO for the Scheduling Problem of Panel Block Construction

Directory of Open Access Journals (Sweden)

Zhi Yang

2016-01-01

Full Text Available Uncertainty is common in ship construction. However, few studies have focused on scheduling problems under uncertainty in shipbuilding. This paper formulates the scheduling problem of panel block construction as a multiobjective fuzzy flow shop scheduling problem (FSSP with a fuzzy processing time, a fuzzy due date, and the just-in-time (JIT concept. An improved multiobjective particle swarm optimization called MOPSO-M is developed to solve the scheduling problem. MOPSO-M utilizes a ranked-order-value rule to convert the continuous position of particles into the discrete permutations of jobs, and an available mapping is employed to obtain the precedence-based permutation of the jobs. In addition, to improve the performance of MOPSO-M, archive maintenance is combined with global best position selection, and mutation and a velocity constriction mechanism are introduced into the algorithm. The feasibility and effectiveness of MOPSO-M are assessed in comparison with general MOPSO and nondominated sorting genetic algorithm-II (NSGA-II.

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 Study on the Optimum Bucket Size for Master Scheduling : For the Case of Hierarchically tured Products

OpenAIRE

木内, 正光

2010-01-01

The function of master scheduling is to plan the flow of order from its arrival to its completion. In this study, the problem of bucket size for master scheduling is taken up. The bucket size for master scheduling has much influence on the lead time of the order. However, to date there is no clear method for how to set the optimum bucket size. The purpose of this study is to propose a method to set the optimum bucket size. In this paper, an equation to estimate the optimum bucket size is prop...

Athabasca--special report No. 1, we are progressing on schedule

Energy Technology Data Exchange (ETDEWEB)

Moss, A E

1966-09-01

Since April of 1964 when the government of Alberta gave permission for the production of crude oil from the Athabasca Tar Sands, construction of a $240 million oil sands venture has been progressing according to schedule. This plant will be capable of processing 45,000 bbl of crude oil per day and will require the mining of approximately 135,000 tons of material per day. The scheduled completion date for this project is Sept. 1967. This huge project consists of the construction of various plant units and service facilities, preparation of the mine for production, construction of a highway and a multi- million dollar bridge, and the design and construction of a 16-in. pipeline 266 miles in length. A shortage of experienced engineers, supervisors, and skilled tradesmen has been the largest problem. In spite of the many problems encountered, approximately 50% of the construction has now been completed and the plant will be completed on schedule.

The spirit of St. Lucie: nuclear plant built on schedule

International Nuclear Information System (INIS)

Derrickson, W.B.

1984-01-01

Florida Power and Light Company currently has four nuclear units in operation with St. Lucie Unit 2 being the last to receive an operating license in June, 1983. It's sister Unit 1 received its license in 1976 and has, through 1982, compiled one of the best operating records in the United States. The full power license for St. Lucie Unit 2 was received from the Nuclear Regulatory Commission (NRC) on June 10, 1983, just six years after construction began. The industry average for construction of nuclear plants in this time period is about 10 years. The success of the St. Lucie Unit 2 project can be at least in part attributed to planning the work, accurate and timely reporting of results via valid indicators, well trained and skilled personnel, and most of all, teamwork. During the course of the project the plant was constantly on or near schedule and always ahead of industry averages. This was done despite issuance of numerous regulations by the NRC (TMI), a 1979 hurricane which did considerable damage to the Reactor Auxiliary Building, labor problems, and an NRC schedule review team that determined the best that could be done was to complete the plant a year later. The final price tag is about $1.42 billion, including ''allowance for funds used during construction''. In operation to date the post core loading test program has been completed in less than two months, enabling the plant to be put into commercial operation only two months after its original scheduled date of May 28, 1983exclamation

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

77 FR 39502 - New Date for the October 2012 Customs Broker License Examination

Science.gov (United States)

2012-07-03

... specified types of infractions. This section also provides that an examination may be conducted to assess an... unless the regularly scheduled examination date conflicts with a national holiday, religious observance... observance of the religious holiday, Sukkot. In consideration of this conflict, CBP has decided to change the...

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.

Location coding by opponent neural populations in the auditory cortex.

Directory of Open Access Journals (Sweden)

G Christopher Stecker

2005-03-01

Full Text Available Although the auditory cortex plays a necessary role in sound localization, physiological investigations in the cortex reveal inhomogeneous sampling of auditory space that is difficult to reconcile with localization behavior under the assumption of local spatial coding. Most neurons respond maximally to sounds located far to the left or right side, with few neurons tuned to the frontal midline. Paradoxically, psychophysical studies show optimal spatial acuity across the frontal midline. In this paper, we revisit the problem of inhomogeneous spatial sampling in three fields of cat auditory cortex. In each field, we confirm that neural responses tend to be greatest for lateral positions, but show the greatest modulation for near-midline source locations. Moreover, identification of source locations based on cortical responses shows sharp discrimination of left from right but relatively inaccurate discrimination of locations within each half of space. Motivated by these findings, we explore an opponent-process theory in which sound-source locations are represented by differences in the activity of two broadly tuned channels formed by contra- and ipsilaterally preferring neurons. Finally, we demonstrate a simple model, based on spike-count differences across cortical populations, that provides bias-free, level-invariant localization-and thus also a solution to the "binding problem" of associating spatial information with other nonspatial attributes of sounds.

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.

SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems

Science.gov (United States)

Ghatpande, Abhay; Nakazato, Hidenori; Beaumont, Olivier; Watanabe, Hiroshi

Divisible Load Theory (DLT) is an established mathematical framework to study Divisible Load Scheduling (DLS). However, traditional DLT does not address the scheduling of results back to source (i. e., result collection), nor does it comprehensively deal with system heterogeneity. In this paper, the DLSRCHETS (DLS with Result Collection on HET-erogeneous Systems) problem is addressed. The few papers to date that have dealt with DLSRCHETS, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions to DLSRCHETS. In this paper, a new polynomial time heuristic algorithm, SPORT (System Parameters based Optimized Result Transfer), is proposed as a solution to the DLSRCHETS problem. With the help of simulations, it is proved that the performance of SPORT is significantly better than existing algorithms. The other major contributions of this paper include, for the first time ever, (a) the derivation of the condition to identify the presence of idle time in a FIFO schedule for two processors, (b) the identification of the limiting condition for the optimality of FIFO and LIFO schedules for two processors, and (c) the introduction of the concept of equivalent processor in DLS for heterogeneous systems with result collection.

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.

77 FR 38775 - Schedules for Atlantic Shark Identification Workshops and Protected Species Safe Handling...

Science.gov (United States)

2012-06-29

..., 2012, in Rosenberg, TX, has been changed to August 16, 2012. This workshop notice originally published... & Suites, 28332 SW Freeway 59, Rosenberg, TX 77471. The July and September workshop dates remain unchanged... Atlantic Shark Identification Workshop scheduled for August 9, 2012, in Rosenberg, TX, has been rescheduled...

Genetic programming for evolving due-date assignment models in job shop environments.

Science.gov (United States)

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

2014-01-01

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic nature of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

Directory of Open Access Journals (Sweden)

Cheng Chen

2014-01-01

Full Text Available Selection and scheduling are an important topic in production systems. To tackle the order acceptance and scheduling problem on a single machine with release dates, tardiness penalty, and sequence-dependent setup times, in this paper a diversity controlling genetic algorithm (DCGA is proposed, in which a diversified population is maintained during the whole search process through survival selection considering both the fitness and the diversity of individuals. To measure the similarity between individuals, a modified Hamming distance without considering the unaccepted orders in the chromosome is adopted. The proposed DCGA was validated on 1500 benchmark instances with up to 100 orders. Compared with the state-of-the-art algorithms, the experimental results show that DCGA improves the solution quality obtained significantly, in terms of the deviation from upper bound.

75 FR 41891 - Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States

Science.gov (United States)

2010-07-19

... INTERNATIONAL TRADE COMMISSION [Investigation No. 1205-8] Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States AGENCY: United States International Trade Commission. ACTION: Change in date for transmitting final recommendations to the President. SUMMARY: The...

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.

75 FR 75695 - Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States

Science.gov (United States)

2010-12-06

... INTERNATIONAL TRADE COMMISSION [Investigation No. 1205-8 (Addendum)] Certain Footwear.... 1205-8, Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United... addition of new tariff lines applicable to the subject footwear. DATES: December 22, 2010: Deadline for...

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.

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Directory of Open Access Journals (Sweden)

Sivashan Chetty

2015-01-01

Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

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.

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

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)

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.

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

Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks

Directory of Open Access Journals (Sweden)

Djalal Hedjazi

2015-04-01

Full Text Available Skill management is a key factor in improving effectiveness of industrial companies, notably their maintenance services. The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams constraints. This problem is generally known as unrelated parallel machine scheduling. We consider the problem with a both objectives of minimizing total weighted tardiness (TWT and number of tardiness tasks. Our interest is focused particularly on solving this problem under skill constraints, which each resource has a skill level. So, we propose a new efficient heuristic to obtain an approximate solution for this NP-hard problem and demonstrate his effectiveness through computational experiments. This heuristic is designed for implementation in a static maintenance scheduling problem (with unequal release dates, processing times and resource skills, while minimizing objective functions aforementioned.

76 FR 29750 - Filing Dates for the Nevada Special Election in the 2nd Congressional District

Science.gov (United States)

2011-05-23

... 2nd Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Nevada has scheduled a Special General Election on September 13, 2011, to fill... Heller. Committees required to file reports in connection with the Special General Election on September...

75 FR 10483 - Filing Dates for the Pennsylvania Special Election in the 12th Congressional District

Science.gov (United States)

2010-03-08

... in the 12th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Pennsylvania has scheduled a Special General Election on May 18... John P. Murtha. Committees required to file reports in connection with the Special General Election on...

76 FR 17124 - Filing Dates for the California Special Election in the 36th Congressional District

Science.gov (United States)

2011-03-28

... the 36th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: California has scheduled a special general election on May 17, 2011, to... committees of candidates who participate in the California Special General and Special Runoff Elections shall...

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

OpenAIRE

Liu, Peng; Wang, Xiaoli

2017-01-01

A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due ...

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.

Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

Directory of Open Access Journals (Sweden)

Tao Ren

2012-01-01

Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

Physiological outperformance at the morphologically-transformed edge of the cyanobacteriosponge Terpios hoshinota (Suberitidae: Hadromerida when confronting opponent corals.

Directory of Open Access Journals (Sweden)

Jih-Terng Wang

Full Text Available Terpios hoshinota, an encrusting cyanosponge, is known as a strong substrate competitor of reef-building corals that kills encountered coral by overgrowth. Terpios outbreaks cause significant declines in living coral cover in Indo-Pacific coral reefs, with the damage usually lasting for decades. Recent studies show that there are morphological transformations at a sponge's growth front when confronting corals. Whether these morphological transformations at coral contacts are involved with physiological outperformance (e.g., higher metabolic activity or nutritional status over other portions of Terpios remains equivocal. In this study, we compared the indicators of photosynthetic capability and nitrogen status of a sponge-cyanobacteria association at proximal, middle, and distal portions of opponent corals. Terpios tissues in contact with corals displayed significant increases in photosynthetic oxygen production (ca. 61%, the δ13C value (ca. 4%, free proteinogenic amino acid content (ca. 85%, and Gln/Glu ratio (ca. 115% compared to middle and distal parts of the sponge. In contrast, the maximum quantum yield (Fv/Fm, which is the indicator usually used to represent the integrity of photosystem II, of cyanobacteria photosynthesis was low (0.256~0.319 and showed an inverse trend of higher values in the distal portion of the sponge that might be due to high and variable levels of cyanobacterial phycocyanin. The inconsistent results between photosynthetic oxygen production and Fv/Fm values indicated that maximum quantum yields might not be a suitable indicator to represent the photosynthetic function of the Terpios-cyanobacteria association. Our data conclusively suggest that Terpios hoshinota competes with opponent corals not only by the morphological transformation of the sponge-cyanobacteria association but also by physiological outperformance in accumulating resources for the battle.

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.

75 FR 34450 - Filing Dates for the Indiana Special Election in the 3rd Congressional District

Science.gov (United States)

2010-06-17

... 3rd Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Indiana has scheduled a Special General Election on November 2, 2010, to fill.... Committees required to file reports in connection with the Special General Election on November 2, 2010...

Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool

Science.gov (United States)

Oktaviandri, Muchamad; Hassan, Adnan; Mohd Shaharoun, Awaluddin

2016-02-01

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.

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

75 FR 12544 - Filing Dates for the Hawaii Special Election In the 1st Congressional District

Science.gov (United States)

2010-03-16

... 1st Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Hawaii has scheduled a Special General Election on May 22, 2010, to fill the U.... Committees required to file reports in connection with the Special General Election on May 22, 2010, shall...

78 FR 9916 - Filing Dates for the Missouri Special Election in the 8th Congressional District

Science.gov (United States)

2013-02-12

... 8th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Missouri has scheduled a Special General Election on June 4, 2013, to fill the.... Committees required to file reports in connection with the Special General Election on June 4, 2013, shall...

75 FR 17742 - Filing Dates for the Georgia Special Election in the 9th Congressional District

Science.gov (United States)

2010-04-07

... 9th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Georgia has scheduled a special general election on May 11, 2010, to fill the U... participate in the Georgia Special General and Special Runoff Elections shall file a 12-day Pre-General Report...

77 FR 56208 - Filing Dates for the Kentucky Special Election in the 4th Congressional District

Science.gov (United States)

2012-09-12

... 4th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Kentucky has scheduled a general election on November 6, 2012, to fill the U.S... required to file reports in connection with the Special General Election on November 6, 2012, shall file a...

78 FR 53454 - Filing Dates for the Louisiana Special Elections in the 5th Congressional District

Science.gov (United States)

2013-08-29

... the 5th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Louisiana has scheduled a Special General Election on October 19, 2013, to fill... Special General and Special Runoff Elections shall file a 12-day Pre-General Report on October 7, 2013; a...

75 FR 62131 - Filing Dates for the New York Special Election in the 29th Congressional District

Science.gov (United States)

2010-10-07

... 29th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on November 2, 2010, to fill.... Committees required to file reports in connection with the Special General Election on November 2, 2010...

76 FR 45797 - Filing Dates for the New York Special Election in the 9th Congressional District

Science.gov (United States)

2011-08-01

... 9th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on September 13, 2011, to.... Committees required to file reports in connection with the Special General Election on September 13, 2011...

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

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Directory of Open Access Journals (Sweden)

Guoliang Li

2017-01-01

Full Text Available We study the order acceptance and scheduling (OAS problem with time-dependent earliness-tardiness penalties in a single agile earth observation satellite environment where orders are defined by their release dates, available processing time windows ranging from earliest start date to deadline, processing times, due dates, sequence-dependent setup times, and revenues. The objective is to maximise total revenue, where the revenue from an order is a piecewise linear function of its earliness and tardiness with reference to its due date. We formulate this problem as a mixed integer linear programming model and develop a novel hybrid differential evolution (DE algorithm under self-adaptation framework to solve this problem. Compared with classical DE, hybrid DE employs two mutation operations, scaling factor adaptation and crossover probability adaptation. Computational tests indicate that the proposed algorithm outperforms classical DE in addition to two other variants of DE.

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.

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

76 FR 16419 - Filing Dates for the New York Special Election in the 26th Congressional District

Science.gov (United States)

2011-03-23

... 26th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on May 24, 2011, to fill the.... Committees required to file reports in connection with the Special General Election on May 24, 2011, shall...

Production Scheduling in Complex Job Shops from an Industrie 4.0 Perspective: A Review and Challenges in the Semiconductor Industry

OpenAIRE

Waschneck, Bernd; Bauernhansl, Thomas; Altenmüller, Thomas; Kyek, Andreas

2017-01-01

On the one hand, Industrie 4.0 has recently emerged as the keyword for increasing productivity in the 21st century. On the other hand, production scheduling in a Complex Job Shop (CJS) environment, such as wafer fabrication facilities, has drawn interest of researchers dating back to the 1950s [65, 18]. Although both research areas overlap, there seems to be very little interchange of ideas. This review presents and assesses production scheduling techniques in complex job shops from an Indust...

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

OpenAIRE

Dvir Shabtay; George Steiner

2007-01-01

With the increased emphasis on the effective management of operational issues in supply chains, the timely delivery of products has become even more important. Companies have to quote attainable delivery dates and then meet these, or face large tardiness penalties. We study systems that can be modeled by single-machine scheduling problems with due date assignment and controllable job-processing times, which are either linear or convex functions of the amount of a continuously divisible and no...

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

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

Opponent and bidirectional control of movement velocity in the basal ganglia

Science.gov (United States)

Yttri, Eric A.

2016-01-01

For goal-directed behavior it is critical that we can both select the appropriate action and learn to modify the underlying movements (e.g. the pitch of a note or velocity of a reach) to improve outcomes. The basal ganglia are a critical nexus where circuits necessary for the production of behavior, such as neocortex and thalamus, are integrated with reward signaling 1 to reinforce successful, purposive actions 2. Dorsal striatum, a major input structure of basal ganglia is composed of two opponent pathways, direct and indirect, thought to select actions that elicit positive outcomes or suppress actions that do not, respectively 3,4. Activity-dependent plasticity modulated by reward is thought to be sufficient for selecting actions in striatum 5,6. Although perturbations of basal ganglia function produce profound changes in movement 7, it remains unknown whether activity-dependent plasticity is sufficient to produce learned changes in movement kinematics, such as velocity. Here we used cell-type specific stimulation delivered in closed-loop during movement to demonstrate that activity in either the direct or indirect pathway is sufficient to produce specific and sustained increases or decreases in velocity without affecting action selection or motivation. These behavioral changes were a form of learning that accumulated over trials, persisted after the cessation of stimulation, and were abolished in the presence of dopamine antagonists. Our results reveal that the direct and indirect pathways can each bidirectionally control movement velocity, demonstrating unprecedented specificity and flexibility in the control of volition by the basal ganglia. PMID:27135927

Department of Energy Delivery Commitment Schedules for spent nuclear fuel

International Nuclear Information System (INIS)

Klose, M.C.; Cole, B.M.

1993-01-01

The Delivery Commitment Schedule (DCS) provides Purchasers with the opportunity to inform the DOE of their plans for utilizing their allocations of projected spent nuclear fuel (SNF) acceptance capacity. This information will assist DOE in meeting its contractual waste acceptance responsibilities and in developing the Civilian Radioactive Waste Management System (CRWMS). 63 months prior to the delivery date, Purchasers submit a DCS(s) to designate: the range of discharge dates to the SNF the Purchaser desires to deliver, the fuel type, the type of transport cask required, the preferred shipping mode, and the particular site from which the Purchaser desires to deliver in the particular delivery year. The actual number of DCSs submitted by a Purchaser may vary according to the number of allocations they have and the number of DCSs they choose to submit for each allocation. Once a Purchaser submits a DCS, DOE will approve or disapprove the DCS within three months of receipt. The approved DCSs are used by DOE to assist in determining the baseline mix of truck and rail transportation casks. This paper delineates the DCS submittal process as well as the DCSs received to date along with their status and associated DOE commitments

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.

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

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

Directory of Open Access Journals (Sweden)

S. Molla-Alizadeh-Zavardehi

2014-01-01

Full Text Available This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA, variable neighborhood search (VNS, and simulated annealing (SA frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.

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

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.

Multi-objective group scheduling optimization integrated with preventive maintenance

Science.gov (United States)

Liao, Wenzhu; Zhang, Xiufang; Jiang, Min

2017-11-01

This article proposes a single-machine-based integration model to meet the requirements of production scheduling and preventive maintenance in group production. To describe the production for identical/similar and different jobs, this integrated model considers the learning and forgetting effects. Based on machine degradation, the deterioration effect is also considered. Moreover, perfect maintenance and minimal repair are adopted in this integrated model. The multi-objective of minimizing total completion time and maintenance cost is taken to meet the dual requirements of delivery date and cost. Finally, a genetic algorithm is developed to solve this optimization model, and the computation results demonstrate that this integrated model is effective and reliable.

Optimization of Task Scheduling Algorithm through QoS Parameters for Cloud Computing

Directory of Open Access Journals (Sweden)

Monika

2016-01-01

Full Text Available Cloud computing is an incipient innovation which broadly spreads among analysts. It furnishes clients with foundation, stage and programming as enhancement which is easily available by means of web. A cloud is a sort of parallel and conveyed framework comprising of a gathering of virtualized PCs that are utilized to execute various tasks to accomplish good execution time, accomplish due date and usage of its assets. The scheduling issue can be seen as the finding an ideal task of assignments over the accessible arrangement of assets with the goal that we can accomplish the wanted objectives for tasks. This paper presents an optimal algorithm for scheduling tasks to get their waiting time as a QoS parameter. The algorithm is simulated using Cloudsim simulator and experiments are carried out to help clients to make sense of the bottleneck of utilizing no. of virtual machine parallely.

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.

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.

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

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

Science.gov (United States)

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

2014-01-01

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

A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Rui Zhang

2011-01-01

Full Text Available The job shop scheduling problem (JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.

Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighted earliness/tardiness cost

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2016-06-01

Full Text Available In the competitive business world, applying a reliable and powerful mechanism to support decision makers in manufacturing companies and helping them save time by considering varieties of effective factors is an inevitable issue. Advanced Available-to-Promise is a perfect tool to design and perform such a mechanism. In this study, this mechanism which is compatible with the Make-to-Forecast production systems is presented. The ability to distinguish between batch mode and real-time mode advanced available-to-promise is one of the unique superiorities of the proposed model. We also try to strengthen this mechanism by integrating the inventory allocation and job shop scheduling by considering due dates and weighted earliness/tardiness cost that leads to more precise decisions. A mixed integer programming (MIP model and a heuristic algorithm according to its disability to solve large size problems are presented. The designed experiments and the obtained results have proved the efficiency of the proposed heuristic method.

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

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

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

Updating Linear Schedules with Lowest Cost: a Linear Programming Model

Science.gov (United States)

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

2017-10-01

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

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…

Eggs and Abortion: "Women-Protective" Language Used by Opponents in Legislative Debates over Reproductive Health.

Science.gov (United States)

Jesudason, Sujatha; Weitz, Tracy

2015-01-01

In this paper we undertake an examination of the presence of similar "women-protective" discourses in policy debates occurring over two bills on reproductive-related topics considered during the 2013 California legislature session. The first bill (AB154), now signed into law, allows nurse practitioners, certified nurse midwives, and physician assistants to perform first-trimester aspiration abortions. The second bill (AB926), had it passed, would remove the prohibition on paying women for providing eggs to be used for research purposes. Using frame analysis we find evidence of similar protective arguments by opponents of both bills, although these advocates do not share ideological positions on abortion rights or women's autonomy. In the case of AB154, anti-abortion advocates use language and frames that call for protecting the health of women against the imputed interests of the "abortion industry." In the case of AB926, feminists and pro-choice advocates evoke similar frameworks for the protection of women against the interests of the "medical research industry." Both sides argue for the "protection of women," from opposing positions on the rights and autonomy of women in relationship to reproductive freedom. © 2015 American Society of Law, Medicine & Ethics, Inc.

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.

Schedule-Aware Workflow Management Systems

Science.gov (United States)

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

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

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

Self-scheduling with Microsoft Excel.

Science.gov (United States)

Irvin, S A; Brown, H N

1999-01-01

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

A 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

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

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.

A modified genetic algorithm for time and cost optimization of an additive manufacturing single-machine scheduling

Directory of Open Access Journals (Sweden)

M. Fera

2018-09-01

Full Text Available Additive Manufacturing (AM is a process of joining materials to make objects from 3D model data, usually layer by layer, as opposed to subtractive manufacturing methodologies. Selective Laser Melting, commercially known as Direct Metal Laser Sintering (DMLS®, is the most diffused additive process in today’s manufacturing industry. Introduction of a DMLS® machine in a production department has remarkable effects not only on industrial design but also on production planning, for example, on machine scheduling. Scheduling for a traditional single machine can employ consolidated models. Scheduling of an AM machine presents new issues because it must consider the capability of producing different geometries, simultaneously. The aim of this paper is to provide a mathematical model for an AM/SLM machine scheduling. The complexity of the model is NP-HARD, so possible solutions must be found by metaheuristic algorithms, e.g., Genetic Algorithms. Genetic Algorithms solve sequential optimization problems by handling vectors; in the present paper, we must modify them to handle a matrix. The effectiveness of the proposed algorithms will be tested on a test case formed by a 30 Part Number production plan with a high variability in complexity, distinct due dates and low production volumes.

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

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.

78 FR 66803 - Fee Schedule for the Transfer of U.S. Treasury Book-Entry Securities Held on the National Book...

Science.gov (United States)

2013-11-06

... Transfer of U.S. Treasury Book-Entry Securities Held on the National Book-Entry System AGENCY: Bureau of... (Treasury) is announcing a new fee schedule applicable to transfers of U.S. Treasury book-entry securities maintained on the National Book-Entry System (NBES) that occur on or after January 2, 2014. DATES: Effective...

Network scheduling at Belene NPP construction site

International Nuclear Information System (INIS)

Matveev, A.

2010-01-01

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

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

NARCIS (Netherlands)

Gracia, P.; Kalmijn, M.

2016-01-01

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

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

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

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

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

Cost and schedule reduction for next-generation Candu

International Nuclear Information System (INIS)

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

2002-01-01

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

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

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.

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

The comparison of absolute dating (Radiocarbon dating) and relative dating of Pringapus and Gondosuli temples

International Nuclear Information System (INIS)

Faisal, W; Arumbinang, H; Taftazani, A; Widayati, S; Sumiyatno; Suhardi

1996-01-01

The absolute dating (radiocarbon, 14 C dating) and relative dating of Pringapus and Gondosuli temples in Temanggung regency (district) of Central Java Province have been carried out. The field sampling was done especially with the purpose to obtain vertical data, so that excavation method was adopted in the case. The main data were the ecofacts of organic habitation such as bones, woods, charcoals, shells, and paper artefacts. The artefacts data were used as a comparison. The comparative data analysis were conducted at Yogyakarta archaeological Department Laboratory, thus included dating of artefacts which were performed according to archaeological analysis procedures, generally based on the attributes attached to the artefacts, whereas the absolute dating of charcoal samples were performed in the Radiocarbon Dating Laboratory at Yogyakarta Nuclear Research Centre. Based on the relative dating of epigraphy content on the andesit rock from Gondosuli Temple which showed the year of 754 Saka or 832 AD, the Pringapus Temple was estimated to be built in the 850 AD. According to the absolute dating (Radiocarbon Dating with delta 13 C and tree ring corrections) the age for Gondosuli temple based on GDS/LU-2/Spit-7 samples is (384 -602) AD and from GDS/LU-2/Spit-8 = (452 - 652) AD. With these significant differences in the results obtained, it can be concluded that culture environment where the sample were collected already existed before the temple was built. Further investigation is still required

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

NASA Instrument Cost/Schedule Model

Science.gov (United States)

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

2011-01-01

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

A Model of Batch Scheduling for a Single Batch Processor with Additional Setups to Minimize Total Inventory Holding Cost of Parts of a Single Item Requested at Multi-due-date

Science.gov (United States)

Hakim Halim, Abdul; Ernawati; Hidayat, Nita P. A.

2018-03-01

This paper deals with a model of batch scheduling for a single batch processor on which a number of parts of a single items are to be processed. The process needs two kinds of setups, i. e., main setups required before processing any batches, and additional setups required repeatedly after the batch processor completes a certain number of batches. The parts to be processed arrive at the shop floor at the times coinciding with their respective starting times of processing, and the completed parts are to be delivered at multiple due dates. The objective adopted for the model is that of minimizing total inventory holding cost consisting of holding cost per unit time for a part in completed batches, and that in in-process batches. The formulation of total inventory holding cost is derived from the so-called actual flow time defined as the interval between arrival times of parts at the production line and delivery times of the completed parts. The actual flow time satisfies not only minimum inventory but also arrival and delivery just in times. An algorithm to solve the model is proposed and a numerical example is shown.

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

Dating Violence

Science.gov (United States)

... for Teens / Dating Violence Bulletins for Teens: Dating Violence What is it? If you are a victim ... often. If You Are a Victim of Dating Violence, You Might… Think it's your fault. Feel angry, ...

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

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.

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

Energy Technology Data Exchange (ETDEWEB)

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

2012-07-01

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

Setting a date

International Nuclear Information System (INIS)

Moore, Glenis.

1987-01-01

Dating techniques are discussed and explained. The age range and sensitivity of different techniques are given. Potassium/argon dating, amino-acid dating, radiocarbon dating, dendrochronology, thermoluminescence and geomagnetic field dating are all mentioned. Each technique is explained and a brief history given. The techniques and equipment used by the British Museum, and some examples of archaeological articles dated are mentioned. (UK)

Cortical fMRI activation to opponents' body kinematics in sport-related anticipation: expert-novice differences with normal and point-light video.

Science.gov (United States)

Wright, M J; Bishop, D T; Jackson, R C; Abernethy, B

2011-08-18

Badminton players of varying skill levels viewed normal and point-light video clips of opponents striking the shuttle towards the viewer; their task was to predict in which quadrant of the court the shuttle would land. In a whole-brain fMRI analysis we identified bilateral cortical networks sensitive to the anticipation task relative to control stimuli. This network is more extensive and localised than previously reported. Voxel clusters responding more strongly in experts than novices were associated with all task-sensitive areas, whereas voxels responding more strongly in novices were found outside these areas. Task-sensitive areas for normal and point-light video were very similar, whereas early visual areas responded differentially, indicating the primacy of kinematic information for sport-related anticipation. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

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.

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

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

Technology for planning and scheduling under complex constraints

Science.gov (United States)

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

1997-02-01

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

Schedule to Nuclear Energy Act no 92, 1982: no. R. 1132, 13 Jun 1986

International Nuclear Information System (INIS)

1986-01-01

This is a schedule to the Nuclear Energy Act, 1982 (Act no. 92 of 1982). In the event of a nuclear accident the corporation must keep clear records of the persons affected by such accidents, as well as information such as the place, date, time and nature of a nuclear accident. Records must be copied, reproduced or transcribed by the corporation and must be kept in such a durable manner that the records will remain suitable to be submitted at any time during a period of 30 years

Health Information Sources, Perceived Vaccination Benefits, and Maintenance of Childhood Vaccination Schedules.

Science.gov (United States)

Hwang, Juwon; Shah, Dhavan V

2018-06-05

Parental concerns over the safety or necessity of childhood vaccination have increased over the past decades. At the same time, there has been a proliferation of vaccine-related information available through a range of health information sources. This study investigates the associations between evaluations of health information sources, parental perceptions of childhood vaccination benefits, and the maintenance of vaccination schedules for their children. Specifically, this study aims to (a) incorporate social media into the battery of health information sources and (b) differentiate households with a childhood autism diagnosis and those without, given unsubstantiated but persistent concerns about vaccine safety and autism. Analyzing a sample of U.S. households, a total of 4,174 parents who have at least one child under the age of 18 were analyzed, including 138 of parents of households with a childhood autism diagnosis. Results show that the more the parents value interpersonal communication and magazines as sources of health information, the more they perceive vaccination benefits, and the more the value they put on television, the better they keep vaccination schedules up-to-date for their children. On the other hand, social media are negatively associated with their perceptions of vaccination benefits. Although parents of children diagnosed with autism are less likely to perceive vaccination benefits, no interaction effects with evaluations of health information sources are found on parental perceptions of vaccination benefits or maintenance of schedules.

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.

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

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.

Federal Facility Agreement plans and schedules for liquid low-level radioactive waste tank systems at Oak Ridge National Laboratory, Oak Ridge, Tennessee

International Nuclear Information System (INIS)

1993-06-01

The Superfund Amendments and Reauthorization Act of the Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) requires a Federal Facility Agreement (FFA) for federal facilities placed on the National Priorities List. The Oak Ridge Reservation was placed on that list on December 21, 1989, and the agreement was signed in November 1991 by the Department of Energy Oak Ridge Field Office (DOE-OR), the US Environmental Protection Agency (EPA)-Region IV, and the Tennessee Department of Environment and Conservation (TDEC). The effective date of the FFA was January 1, 1992. Section 9 and Appendix F of the agreement impose design and operating requirements on the Oak Ridge National Laboratory (ORNL) liquid low-level radioactive waste (LLLW) tank systems and identify several plans, schedules, and assessments that must be submitted to EPA/TDEC for review or approval. The initial issue of this document in March 1992 transmitted to EPA/TDEC those plans and schedules that were required within 60 to 90 days of the FFA effective date. The current revision of this document updates the plans, schedules, and strategy for achieving compliance with the FFA, and it summarizes the progress that has been made over the past year. Chapter 1 describes the history and operation of the ORNL LLLW System, the objectives of the FFA, the organization that has been established to bring the system into compliance, and the plans for achieving compliance. Chapters 2 through 7 of this report contain the updated plans and schedules for meeting FFA requirements. This document will continue to be periodically reassessed and refined to reflect newly developed information and progress

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

17 CFR 248.128 - Effective date, compliance date, and prospective application.

Science.gov (United States)

2010-04-01

... Affiliate Marketing § 248.128 Effective date, compliance date, and prospective application. (a) Effective date. This subpart is effective September 10, 2009. (b) Mandatory compliance date. Compliance with this... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Effective date, compliance...

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

Science.gov (United States)

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

2016-08-01

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

Routine environmental monitoring schedule, calendar year 1995

International Nuclear Information System (INIS)

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

1994-12-01

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

F/H Area high level waste removal plan ampersand schedule as required by the Federal Facility Agreement for the Savannah River Site

International Nuclear Information System (INIS)

Hunter, M.A.

1993-11-01

The F and H-area HLW Tank Farms are one component of a larger integrated waste treatment system consisting of facilities designed for the overall processing of several radioactive waste streams resulting from nuclear material processing. Section IX.E of the SRS Federal Facility Agreement requires the DOE to submit to the EPA and SCDHEC for review and approval, a plan(s) and schedule(s) for the removal from service of waste tank systems(s)/component(s) that do not meet secondary containment standards, or that leak or have leaked. The Plan and Schedule for removal from service of these waste tanks is shown in Appendices A and B, respectively. Other portions of this package which include schedule dates are provided for information only. The SRS intends to remove systems from service as opposed to providing secondary containment for non-compliant systems. The systems that do not meet secondary containment requirements or that have leaked (as determined by tank assessment reports) include High Level Waste Tanks No. 1--24 along with corresponding ancillary equipment

Evidence for Non-Opponent Coding of Colour Information in Human Visual Cortex: Selective Loss of "Green" Sensitivity in a Subject with Damaged Ventral Occipito-Temporal Cortex.

Science.gov (United States)

Rauscher, Franziska G; Plant, Gordon T; James-Galton, Merle; Barbur, John L

2011-01-01

Damage to ventral occipito-temporal extrastriate visual cortex leads to the syndrome of prosopagnosia often with coexisting cerebral achromatopsia. A patient with this syndrome resulting in a left upper homonymous quadrantanopia, prosopagnosia, and incomplete achromatopsia is described. Chromatic sensitivity was assessed at a number of locations in the intact visual field using a dynamic luminance contrast masking technique that isolates the use of colour signals. In normal subjects chromatic detection thresholds form an elliptical contour when plotted in the Commission Internationale d'Eclairage, (x-y), chromaticity diagram. Because the extraction of colour signals in early visual processing involves opponent mechanisms, subjects with Daltonism (congenital red/green loss of sensitivity) show symmetric increase in thresholds towards the long wavelength ("red") and middle wavelength ("green") regions of the spectrum locus. This is also the case with acquired loss of chromatic sensitivity as a result of retinal or optic nerve disease. Our patient's results were an exception to this rule. Whilst his chromatic sensitivity in the central region of the visual field was reduced symmetrically for both "red/green" and "yellow/blue" directions in colour space, the subject's lower left quadrant showed a marked asymmetry in "red/green" thresholds with the greatest loss of sensitivity towards the "green" region of the spectrum locus. This spatially localized asymmetric loss of "green" but not "red" sensitivity has not been reported previously in human vision. Such loss is consistent with selective damage of neural substrates in the visual cortex that process colour information, but are spectrally non-opponent.

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.

Automated scheduling and planning from theory to practice

CERN Document Server

Ozcan, Ender; Urquhart, Neil

2013-01-01

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

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

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

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

Science.gov (United States)

Rash, James

2014-01-01

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial

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

Radiocarbon dates for Rangitoto and Motutapu, a consideration of dating accuracy

International Nuclear Information System (INIS)

Law, R.G.

1975-01-01

The carbon dates for the eruptions of Rangitoto and the occupation of Maori sites on Motutapu contain inconsistencies which are explicable only after the dates have been corrected to allow for the nature of the dating method. The only date which is reasonably established is a 14th or 15th century dating for the ash shower covering Motutapu. (auth.)

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.

Dating Violence

Science.gov (United States)

Stader, David L.

2011-01-01

Dating violence is a form of student-on-student victimization and is a serious school safety issue. Research indicates that at a minimum, 10 percent of high school students are victims of dating violence in one form or another. Among female high school students that date, some data indicate that as many as 30 percent may be victims of dating…

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

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.

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.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2013-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materials in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2009-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2008-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2012-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materials in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2009-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs

Irradiation of dates

International Nuclear Information System (INIS)

Farkas, J.; Al-Charchafchy, F.; Al-Shaikhaly, M.H.; Mirjan, J.; Auda, H.

1974-01-01

Testing of the technical feasibility of radurization of fresh dates was attempted. In addition preliminary studies were carried out to investigate the applicability of gamma rays to date syrup manufacture. The varieties Zahdi, Lelwi and Tabarzel were studied at different stages of ripening. The eating quality of fresh dates was not affected significantly by irradiation even with doses of 270 and 540 krad. The duration of the softening process, after-ripening, of dates was prolonged by low doses of 10-30 krad in the majority of the experimental batches. The time period of after-ripening was reduced with 270 krad, as well as with 540 krad as a result of shortening of the induction period, i.e. the time after which the date begins to soften. The microbial spoilage of khalaal Lelwi dates was considerably reduced by irradiation with doses above 90 krad. The dibis yield of fully rutab dates was highly increased by the radiation doses of 375 to 2000 krad. The darkness and viable cell count of dibis pressed from irradiated dates were significantly lower than that of untreated dates. (F.J.)

MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

Directory of Open Access Journals (Sweden)

Ladislav Rosocha

2015-07-01

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

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

Substitution of Sugar with Dates Powder and Dates Syrup in Cookies Making

OpenAIRE

W.A. Alsenaien; R.A. Alamer; Zhen-Xing Tang; S.A. Albahrani; M.A. Al-Ghannam; S.M. Aleid

2015-01-01

In this study, the effects of dates powder and dates syrup as a sugar substitution, on the physical properties and sensory attributes of cookies were studied. An increase in firmness and moisture content of cookies supplemented with dates was obtained. The diameter and spread ratio of cookies showed a decrease with increasing levels of date powder or date syrup. Partial replacement of sugar with date powder or date syrup produced cookies with more dark and red color. Sensory evaluation result...

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

California LLW disposal site development update: Ahead of milestone schedule

International Nuclear Information System (INIS)

Romano, S.A.; Gaynor, R.K.

1987-01-01

US Ecology has been designated by the State of California to locate, develop and operate a low-level radioactive waste disposal facility. In early 1986, the firm identified eighteen desert basins in southeastern California for siting consideration. Three candidate sites were selected for detailed field characterization work in February, 1987. A preferred site for licensing purposes will be identified in early 1988. California is currently ahead of the siting milestone schedule mandated by the Low-Level Radioactive Waste Policy Amendments Act. It is likely that a license application will be filed before the 1990 milestone date. This paper describes the process undertaken by US Ecology to identify three candidates sites for characterization, and the public involvement program supporting this decision. Future activities leading to final site development are also described

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

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

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

2017-08-01

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

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

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

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

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

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Sunxin Wang

2014-01-01

Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

Prescribed Travel Schedules for Fatigue Management

Science.gov (United States)

Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

2011-01-01

The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

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

2018-02-01

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

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

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

2018-03-01

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

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

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

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

Psychiatry and Religion: Opponents or Collaborators? The Power of Spirituality in Contemporary Psychiatry.

Science.gov (United States)

Jakovljević, Miro

2017-04-01

Religion and psychiatry have had complicated, sometimes neutral or friendly and cooperative, sometimes competitive and antagonistic relations over their long histories. Relations between psychiatry and religion are influenced by complex belief systems, each diverse and changing. Psychiatry has often ignored spiritual and religious dimension in health and illness while religions influenced the treatment of mental disorders directly by defining mental disorders as evil spirit possessions and prescribing exorcism as treatment. It has been a long way to prevail looking for natural over supra-natural explanations for mental disorders. Psychiatry and religion as social practices should be regarded as allies against pseudoscientific nonsense and superstitions. This alliance is based on the next evidence: 1. religious and spiritual well-being is an important component of mental health as well as of health in general; 2. research and empirical evidence reveals that healthy-minded and distorted or sick faith are quite distinct in the effects in the lives of the faithful; 3. psychiatrists are professionally expected to always respect and be sensitive to the spiritual and religious beliefs and practices of their patients; 4. religious and spiritual beliefs and practice is very important aspect of person-centered psychiatry. The enduring task for both psychiatry and religion is to enable human beings to live their lives with courage, sense, and optimism, to strive towards creating conditions of well-being and individual, public and global mental health as well as to dispel beliefs and patterns which trap people in lives of misery and mental disorders. Psychiatry and religion in creative dialogues as allies can significantly contribute to the healing of our broken world and promoting compassionate society and empathic civilization. When psychiatry and religion see each other as opponents or even enemies this is only because of their mutual misreading and pseudoscientific

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

Teen Dating Violence

Science.gov (United States)

... Room Social Media Publications Injury Center Teen Dating Violence Recommend on Facebook Tweet Share Compartir On This ... serious forms of violence. What is teen dating violence? Teen Dating Violence [550 KB, 2 Pages, 508] ...

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

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

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)

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

1990-01-01

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

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

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

2013-01-01

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

Status Report on the Development of Micro-Scheduling Software for the Advanced Outage Control Center Project

Energy Technology Data Exchange (ETDEWEB)

Germain, Shawn St. [Idaho National Lab. (INL), Idaho Falls, ID (United States); Thomas, Kenneth [Idaho National Lab. (INL), Idaho Falls, ID (United States); Farris, Ronald [Idaho National Lab. (INL), Idaho Falls, ID (United States); Joe, Jeffrey [Idaho National Lab. (INL), Idaho Falls, ID (United States)

2014-09-01

optimally deployed with the least amount of delay and unproductive use of resources. The remaining sections of this report describe in more detail the scheduling challenges that occur during outages, how a Micro-Scheduling capability helps address those challenges, and provides a status update on work accomplished to date and the path forward.

Routine environmental monitoring schedule, calendar year 1997

Energy Technology Data Exchange (ETDEWEB)

Markes, B.M., Westinghouse Hanford

1996-12-10

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

Decay-usage scheduling in multiprocessors

NARCIS (Netherlands)

Epema, D.H.J.

1998-01-01

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

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

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

Schedulability Analysis for Java Finalizers

DEFF Research Database (Denmark)

Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans

2010-01-01

Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact...... on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way....

Nonblocking Scheduling for Web Service Transactions

DEFF Research Database (Denmark)

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

2007-01-01

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

Integration of Building Information Modeling and Critical Path Method Schedules to Simulate the Impact of Temperature and Humidity at the Project Level

Directory of Open Access Journals (Sweden)

Yongwei Shan

2014-07-01

Full Text Available Steel construction activities are often undertaken in an environment with limited climate control. Both hot and cold temperatures can physically and psychologically affect construction workers, thus decreasing their productivity. Temperature and humidity are two factors that constantly exert forces on workers and influence their performance and efficiency. Previous studies have established a relationship between labor productivity and temperature and humidity. This research is built on the existing body of knowledge and develops a framework of integrating building information modeling (BIM with a lower level critical path method (CPM schedule to simulate the overall impact of temperature and humidity on a healthcare facility’s structural steel installation project in terms of total man hours required to build the project. This research effort utilized historical weather data of four cities across the U.S., with each city having workable seasons year-round and conducted a baseline assessment to test if various project starting dates and locations could significantly impact the project’s schedule performance. It was found that both varied project start dates and locations can significantly contribute to the difference in the man hours required to build the model project and that the project start date and location can have an interaction effect. This study contributes to the overall body of knowledge by providing a framework that can help practitioners better understand the overall impact of a productivity influencing factor at a project level, in order to facilitate better decision making.

How residents and interns utilise and perceive the personal digital assistant and UpToDate

Directory of Open Access Journals (Sweden)

Lim Tow

2008-07-01

Full Text Available Abstract Background In this era of evidence-based medicine, doctors are increasingly using information technology to acquire medical knowledge. This study evaluates how residents and interns utilise and perceive the personal digital assistant (PDA and the online resource UpToDate. Methods This is a questionnaire survey of all residents and interns in a tertiary teaching hospital. Results Out of 168 doctors, 134 (79.8% responded to the questionnaire. Only 54 doctors (40.3% owned a PDA. Although these owners perceived that the PDA was most useful for providing drug information, followed by medical references, scheduling and medical calculators, the majority of them did not actually have medical software applications downloaded on their PDAs. The greatest concerns highlighted for the PDA were the fear of loss and breakage, and the preference for working with desktop computers and paper. Meanwhile, only 76 doctors (56.7% used UpToDate, even though the hospital had an institutional subscription for it. Although 93.4% of these users would recommend UpToDate to a colleague, only 57.9% stated that the use of UpToDate had led to a change in their management of patients. Conclusion Although UpToDate and various PDA software applications were deemed useful by some of the residents and interns in our study, both digital tools were under-utilised. More should be done to facilitate the use of medical software applications on PDAs, to promote awareness of tools for evidence-based medicine such as UpToDate, and to facilitate the application of evidence-based medicine in daily clinical practice.

Flexible Work Schedules. ERIC Digest.

Science.gov (United States)

Kerka, Sandra

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

Toward an Autonomous Telescope Network: the TBT Scheduler

Science.gov (United States)

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

2015-09-01

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

Modelling altered fractionation schedules

International Nuclear Information System (INIS)

Fowler, J.F.

1993-01-01

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

Pittsburgh International Airport - Scheduled Passenger Traffic

Data.gov (United States)

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

Bullying Predicts Reported Dating Violence and Observed Qualities in Adolescent Dating Relationships.

Science.gov (United States)

Ellis, Wendy E; Wolfe, David A

2015-10-01

The relationship between reported bullying, reported dating violence, and dating relationship quality measured through couple observations was examined. Given past research demonstrating similarity between peer and dating contexts, we expected that bullying would predict negative dating experiences. Participants with dating experience (n = 585; 238 males, M(age) = 15.06) completed self-report assessments of bullying and dating violence perpetration and victimization. One month later, 44 opposite-sex dyads (M(age) = 15.19) participated in behavioral observations. In 10-min sessions, couples were asked to rank and discuss areas of relationship conflict while being video-recorded. Qualities of the relationship were later coded by trained observers. Regression analysis revealed that bullying positively predicted dating violence perpetration and victimization. Self-reported bullying also predicted observations of lower relationship support and higher withdrawal. Age and gender interactions further qualified these findings. The bullying of boys, but not girls, was significantly related to dating violence perpetration. Age interactions showed that bullying was positively predictive of dating violence perpetration and victimization for older, but not younger adolescents. Positive affect was also negatively predicted by bullying, but only for girls. These findings add to the growing body of evidence that adolescents carry forward strategies learned in the peer context to their dating relationships. © The Author(s) 2014.

Cloud Service Scheduling Algorithm Research and Optimization

Directory of Open Access Journals (Sweden)

Hongyan Cui

2017-01-01

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

A Gas Scheduling Optimization Model for Steel Enterprises

Directory of Open Access Journals (Sweden)

Niu Honghai

2017-01-01

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

A reduced feedback proportional fair multiuser scheduling scheme

KAUST Repository

Shaqfeh, Mohammad

2011-12-01

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

Where do we stand with fuzzy project scheduling?

CERN Document Server

Bonnal, Pierre; Lacoste, Germain

2004-01-01

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

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

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

Mission Operations Planning and Scheduling System (MOPSS)

Science.gov (United States)

Wood, Terri; Hempel, Paul

2011-01-01

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

Post LS1 schedule

CERN Document Server

Lamont, M

2014-01-01

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

Evidence for Non-Opponent Coding of Colour Information in Human Visual Cortex: Selective Loss of “Green” Sensitivity in a Subject with Damaged Ventral Occipito-Temporal Cortex

Science.gov (United States)

Rauscher, Franziska G.; Plant, Gordon T.; James-Galton, Merle; Barbur, John L.

2011-01-01

Damage to ventral occipito-temporal extrastriate visual cortex leads to the syndrome of prosopagnosia often with coexisting cerebral achromatopsia. A patient with this syndrome resulting in a left upper homonymous quadrantanopia, prosopagnosia, and incomplete achromatopsia is described. Chromatic sensitivity was assessed at a number of locations in the intact visual field using a dynamic luminance contrast masking technique that isolates the use of colour signals. In normal subjects chromatic detection thresholds form an elliptical contour when plotted in the Commission Internationale d’Eclairage, (x-y), chromaticity diagram. Because the extraction of colour signals in early visual processing involves opponent mechanisms, subjects with Daltonism (congenital red/green loss of sensitivity) show symmetric increase in thresholds towards the long wavelength (“red”) and middle wavelength (“green”) regions of the spectrum locus. This is also the case with acquired loss of chromatic sensitivity as a result of retinal or optic nerve disease. Our patient’s results were an exception to this rule. Whilst his chromatic sensitivity in the central region of the visual field was reduced symmetrically for both “red/green” and “yellow/blue” directions in colour space, the subject’s lower left quadrant showed a marked asymmetry in “red/green” thresholds with the greatest loss of sensitivity towards the “green” region of the spectrum locus. This spatially localized asymmetric loss of “green” but not “red” sensitivity has not been reported previously in human vision. Such loss is consistent with selective damage of neural substrates in the visual cortex that process colour information, but are spectrally non-opponent. PMID:27956924

Staffing, overtime, and shift scheduling project

International Nuclear Information System (INIS)

Lewis, P.M.

1989-01-01

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

Realistic Scheduling Mechanism for Smart Homes

Directory of Open Access Journals (Sweden)

Danish Mahmood

2016-03-01

Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.

The political attack ad

Directory of Open Access Journals (Sweden)

Palma Peña-Jiménez, Ph.D.

2011-01-01

Full Text Available During election campaigns the political spot has a clear objective: to win votes. This message is communicated to the electorate through television and Internet, and usually presents a negative approach, which includes a direct critical message against the opponent, rather than an exposition of proposals. This article is focused on the analysis of the campaign attack video ad purposely created to encourage the disapproval of the political opponent among voters. These ads focus on discrediting the opponent, many times, through the transmission of ad hominem messages, instead of disseminating the potential of the political party and the virtues and manifesto of its candidate. The article reviews the development of the attack ad since its first appearance, which in Spain dates back to 1996, when the famous Doberman ad was broadcast, and examines the most memorable campaign attack ads.

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

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

Modeling the Cray memory scheduler

Energy Technology Data Exchange (ETDEWEB)

Wickham, K.L.; Litteer, G.L.

1992-04-01

This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.

Dating and Sexual Feelings

Science.gov (United States)

... Home Body Your sexuality Dating and sexual feelings Dating and sexual feelings Thinking about romance, starting to ... you learn how to stay healthy and strong. Dating older guys top If you date someone even ...

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

Full Text Available Home energy management systems (HEMS face many challenges of uncertainty, which have a great impact on the scheduling of home appliances. To handle the uncertain parameters in the household load scheduling problem, this paper uses a robust optimization method to rebuild the household load scheduling model for home energy management. The model proposed in this paper can provide the complete robust schedules for customers while considering the disturbance of uncertain parameters. The complete robust schedules can not only guarantee the customers’ comfort constraints but also cooperatively schedule the electric devices for cost minimization and load shifting. Moreover, it is available for customers to obtain multiple schedules through setting different robust levels while considering the trade-off between the comfort and economy.

The robust schedule - A link to improved workflow

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2012-01-01

-down the contractors, and force them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In attempt to improve productivity three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have been...... analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule to tight. A too tight schedule is inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors interacting and dependable....... The result is a chaotic, complex and uncontrolled construction site. Furthermore, strict time limits entail the workflow to be optimized under non-optimal conditions. Even though productivity seems to be increasing, productivity per man-hour is decreasing resulting in increased cost. To increase productivity...

Shiftwork Scheduling for the 1990s.

Science.gov (United States)

Coleman, Richard M.

1989-01-01

The author discusses the problems of scheduling shift work, touching on such topics as employee desires, health requirements, and business needs. He presents a method for developing shift schedules that addresses these three areas. Implementation hints are also provided. (CH)

CMS Records Schedule

Data.gov (United States)

U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

Economic appraisal of deployment schedules for high-level radioactive waste repositories

International Nuclear Information System (INIS)

Hoai Linh Doan, Phuong; Duquesnoy, T.; Devezeaux de Lavergne, J.G.

2017-01-01

The deep geological repository (DGR) is considered as the definitive management solution for high-level radioactive waste (HLW). Countries defined different DGR implementation schedules, depending on their national context and political choices. We raise the question of the economic grounds of such political decisions by providing an economic analysis of different DGR schedules. We investigate the optimal timing for DGR commissioning based on available Nuclear Energy Agency (NEA) data (2013). Two scenarios are considered: -1) rescheduling the deployment of a DGR with the same initial operational period, and -2) rescheduling the deployment of a DGR with a shorter operational period, i.e. initial closure date. Given the long timescales of such projects, we also take into account the discounting effect. The first finding is that it appears more economically favorable to extend the interim storage than to dispose of the HLW immediately. Countries which chose 'immediate' disposal are willing to accept higher costs to quickly solve the problem. Another interesting result is that there is an optimal solution with respect to the length of DGR operational period and the waste flow for disposal. Based on data provided by the Organisation for Economic Cooperation and Development (OECD)/Nuclear Energy Agency (NEA), we find an optimal operating period of about 15 years with a flow of 2000 tHM/year. (authors)

Economic appraisal of deployment schedules for high-level radioactive waste repositories

Directory of Open Access Journals (Sweden)

Doan Phuong Hoai Linh

2017-01-01

Full Text Available The deep geological repository (DGR is considered as the definitive management solution for high-level waste (HLW. Countries defined different DGR implementation schedules, depending on their national context and political choices. We raise the question of the economic grounds of such political decisions by providing an economic analysis of different DGR schedules. We investigate the optimal timing for DGR commissioning based on available Nuclear Energy Agency (NEA data (2013. Two scenarios are considered: (1 rescheduling the deployment of a DGR with the same initial operational period, and (2 rescheduling the deployment of a DGR with a shorter operational period, i.e. initial closure date. Given the long timescales of such projects, we also take into account the discounting effect. The first finding is that it appears more economically favorable to extend the interim storage than to dispose of the HLW immediately. Countries which chose “immediate” disposal are willing to accept higher costs to quickly solve the problem. Another interesting result is that there is an optimal solution with respect to the length of DGR operational period and the waste flow for disposal. Based on data provided by the Organisation for Economic Cooperation and Development (OECD/Nuclear Energy Agency (NEA, we find an optimal operating period of about 15 years with a flow of 2000 tHM/year.

Planning construction of integrative schedule management for nuclear power project

International Nuclear Information System (INIS)

Zeng Zhenglin; Wang Wenying; Peng Fei

2012-01-01

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

Spent nuclear fuel project integrated schedule plan

International Nuclear Information System (INIS)

Squires, K.G.

1995-01-01

The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel

Spent nuclear fuel project integrated schedule plan

Energy Technology Data Exchange (ETDEWEB)

Squires, K.G.

1995-03-06

The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel.

Agent-based scheduling for aircraft deicing

NARCIS (Netherlands)

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

2006-01-01

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

Knowledge-based scheduling of arrival aircraft

Science.gov (United States)

Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

1995-01-01

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

International Nuclear Information System (INIS)

Morgan, D.L.; Srite, B.E.

1986-01-01

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

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.

Personality profiles and psychopathology among students exposed to dating violence at theObafemi AwolowoUniversity, Ile-Ife.

Science.gov (United States)

Boladale, Mapayi; Yetunde, Oladimeji; Adesanmi, Akinsulore; Olutayo, Aloba; Olanrewaju, Ibigbami

2015-01-01

Dating violence is a complex phenomenon, and researchers continue to examine a wide range of precursors and contributing factors. Evidence indicates that violent intimate partners may be more likely to have personality disorders and dependency and attachment problems compared with non-violent ones. The aim of the present study is to evaluate the interaction between the personality profiles, pattern of psychopathology, and dating violence among university students in Obafemi Awolowo University, Ile-Ife. The study utilized a cross-sectional survey design with a total of 400 students selected using a multistage sampling technique. They completed the Sociodemographic Data Schedule, the Conflict Tactic Scale (CTS), Eysenck Personality Questionnaire (EPQ), and the General Health Questionnaire (GHQ). Univariate analysis was used to determine the prevalence of dating violence, psychopathology, and personality traits, and these were expressed in percentages. Association at bivariate level was assessed using chi-square and at multivariate level using logistic regression and correlations as was appropriate depending on the type of variable. The age of the respondents ranged between 18 and 35 years (M = 21.44, SD = 2.99). The prevalence of dating violence in the previous 12 months was 34%, and the prevalence of psychopathology was 15%. In the logistic regression model constructed, it was found that the significant predictors of dating violence were the psychoticism and neuroticism personality traits, which were also found to be positive correlates of psychopathology. The magnitude of dating violence found in this study is comparable with those found in other countries of the world. This study found an association between dating violence and personality in the study population and also between certain personality traits and psychopathology. The personality profiles of students could affect their interpersonal relationships greatly, and this fact must feature in dating violence

Diverse task scheduling for individualized requirements in cloud manufacturing

Science.gov (United States)

Zhou, Longfei; Zhang, Lin; Zhao, Chun; Laili, Yuanjun; Xu, Lida

2018-03-01

Cloud manufacturing (CMfg) has emerged as a new manufacturing paradigm that provides ubiquitous, on-demand manufacturing services to customers through network and CMfg platforms. In CMfg system, task scheduling as an important means of finding suitable services for specific manufacturing tasks plays a key role in enhancing the system performance. Customers' requirements in CMfg are highly individualized, which leads to diverse manufacturing tasks in terms of execution flows and users' preferences. We focus on diverse manufacturing tasks and aim to address their scheduling issue in CMfg. First of all, a mathematical model of task scheduling is built based on analysis of the scheduling process in CMfg. To solve this scheduling problem, we propose a scheduling method aiming for diverse tasks, which enables each service demander to obtain desired manufacturing services. The candidate service sets are generated according to subtask directed graphs. An improved genetic algorithm is applied to searching for optimal task scheduling solutions. The effectiveness of the scheduling method proposed is verified by a case study with individualized customers' requirements. The results indicate that the proposed task scheduling method is able to achieve better performance than some usual algorithms such as simulated annealing and pattern search.

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

Science.gov (United States)

2013-05-16

The Deputy Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cannabinoids under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48). This action is based on a finding by the Deputy Administrator that the placement of these synthetic cannabinoids and their salts, isomers and salts of isomers into Schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the full effect of the CSA and the Controlled Substances Import and Export Act (CSIEA) and their implementing regulations including criminal, civil and administrative penalties, sanctions and regulatory controls of Schedule I substances will be imposed on the manufacture, distribution, possession, importation, and exportation of these synthetic cannabinoids.

Interoceanic canal excavation scheduling via computer simulation

Energy Technology Data Exchange (ETDEWEB)

Baldonado, Orlino C [Holmes and Narver, Inc., Los Angeles, CA (United States)

1970-05-15

The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

Interoceanic canal excavation scheduling via computer simulation

International Nuclear Information System (INIS)

Baldonado, Orlino C.

1970-01-01

The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

46 CFR 525.2 - Terminal schedules.

Science.gov (United States)

2010-10-01

... domestic law and international conventions and agreements adopted by the United States; such terminal... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule that...

Robust scheduling in an uncertain environment

NARCIS (Netherlands)

Wilson, M.

2016-01-01

This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway industry companies. The focus therefore lies on scheduling of maintenance operations on rolling stock

Solving project scheduling problems by minimum cut computations

NARCIS (Netherlands)

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

In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in

DMEPOS Fee Schedule

Data.gov (United States)

U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...

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

International Nuclear Information System (INIS)

Cardoso, G.; Stadler, M.; Bozchalui, M.C.; Sharma, R.; Marnay, C.; Barbosa-Póvoa, A.; Ferrão, P.

2014-01-01

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. - Highlights: • This paper introduces a new EV aggregator model in the DER-CAM model and expands it with a stochastic formulation. • The model is used to analyze the impact of EVs in DER investment decisions in a large office building. • The uncertainty in EV driving patterns is considered through scenarios based on data from a daily commute driving survey. • Results indicate that EVs have a significant impact in optimal DER decisions, particularly when looking at short payback periods. • Furthermore, results indicate that uncertainty in EV driving schedules has little impact on DER investment decisions

Designing of vague logic based multilevel feedback queue scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-03-01

Full Text Available Multilevel feedback queue scheduler suffers from major issues of scheduling such as starvation for long tasks, fixed number of queues, and static length of time quantum in each queue. These factors directly affect the performance of the scheduler. At many times impreciseness exists in attributes of tasks which make the performance even worse. In this paper, our intent is to improve the performance by providing a solution to these issues. We design a multilevel feedback queue scheduler using a vague set which we call as VMLFQ scheduler. VMLFQ scheduler intelligently handles the impreciseness and defines the optimum number of queues as well as the optimal size of time quantum for each queue. It also resolves the problem of starvation. This paper simulates and analyzes the performance of VMLFQ scheduler with the other multilevel feedback queue techniques using MatLab.

76 FR 28194 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2011-05-16

... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY... publishing its proposed Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from... on the proposed fee schedule should be mailed or delivered to the Office of the General Counsel...

75 FR 27228 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2010-05-14

... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY... publishing its proposed Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from... on the proposed fee schedule should be mailed or delivered to the Office of the General Counsel...

A decentralized scheduling algorithm for time synchronized channel hopping

Directory of Open Access Journals (Sweden)

Andrew Tinka

2011-09-01

Full Text Available Time Synchronized Channel Hopping (TSCH is an existing Medium Access Control scheme which enables robust communication through channel hopping and high data rates through synchronization. It is based on a time-slotted architecture, and its correct functioning depends on a schedule which is typically computed by a central node. This paper presents, to our knowledge, the first scheduling algorithm for TSCH networks which both is distributed and which copes with mobile nodes. Two variations on scheduling algorithms are presented. Aloha-based scheduling allocates one channel for broadcasting advertisements for new neighbors. Reservation- based scheduling augments Aloha-based scheduling with a dedicated timeslot for targeted advertisements based on gossip information. A mobile ad hoc motorized sensor network with frequent connectivity changes is studied, and the performance of the two proposed algorithms is assessed. This performance analysis uses both simulation results and the results of a field deployment of floating wireless sensors in an estuarial canal environment. Reservation-based scheduling performs significantly better than Aloha-based scheduling, suggesting that the improved network reactivity is worth the increased algorithmic complexity and resource consumption.

On Coding of Scheduling Information in OFDM

OpenAIRE

Gunnarsson, Fredrik; Moosavi, Reza; Eriksson, Jonas; Larsson, Erik G.; Wiberg, Niklas; Frenger, Pål

2009-01-01

Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The...

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

Management of Temporal Constraints for Factory Scheduling.

Science.gov (United States)

1987-06-01

consistency of scheduling decisions were implemented in both the ISIS [Fox 84] and SOJA [LePape 85a] scheduling systems. More recent work with the...kinds of time propagation systems: the symbolic and the numeric ones. Symbolic systems combine relationships with a temporal logic a la Allen [Allen 81...maintains consistency by narrowing time windows associated with activities as decisions are made, and SOJA [LePape 85b] guarantees a schedule’s

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

77 FR 33980 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2012-06-08

... 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Notice... the Board's proposed FOIA Fee Schedule Update published in the Federal Register of June 1, 2012. The...: The FOIA requires each Federal agency covered by the Act to specify a schedule of fees applicable to...

Residency Applicants Prefer Online System for Scheduling Interviews

Directory of Open Access Journals (Sweden)

Wills, Charlotte

2015-03-01

Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.

Genetic algorithm to solve the problems of lectures and practicums scheduling

Science.gov (United States)

Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.

A dynamic approach to vehicle scheduling

NARCIS (Netherlands)

D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

2001-01-01

textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

21 CFR 1308.13 - Schedule III.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and... opposite it. (b) Stimulants. Unless specifically excepted or unless listed in another schedule, any... a stimulant effect on the central nervous sxstem, including its salts, isomers (whether optical...

29 CFR 825.202 - Intermittent leave or reduced leave schedule.

Science.gov (United States)

2010-07-01

... leave schedule is a leave schedule that reduces an employee's usual number of working hours per workweek, or hours per workday. A reduced leave schedule is a change in the employee's schedule for a period of... 29 Labor 3 2010-07-01 2010-07-01 false Intermittent leave or reduced leave schedule. 825.202...

Quaternary dating methods

International Nuclear Information System (INIS)

Mahaney, W.C.

1984-01-01

The papers in this book cover absolute, relative and multiple dating methods, and have been written by specialists from a number of different earth sciences disciplines - their common interest being the dating of geological materials within the Quaternary. Papers on absolute dating methods discuss radiocarbon, uranium-series, potassium argon, 40 Ar/ 39 Ar, paleomagnetic, obsidian hydration, thermoluminescence, amino acid racemization, tree rings, and lichenometric techniques. Those on relative dating include discussions on various geomorphic relative age indicators such as drainage density changes, hypsometric integrals, bifurcation ratios, stream junction angles, spur morphology, hillslope geometry, and till sheet characteristics. The papers on multiple dating cite examples from the Rocky Mountains, Australia, Lake Agassiz Basin, and the Southern Andes. Also included is the panel discussion which reviews and assesses the information presented, and a field trip guide which discusses the sequences of Wisconian tills and interlayered lacustrine and fluvial sediments. (orig.)

Optimal Temporal Decoupling in Task Scheduling with Preferences

NARCIS (Netherlands)

Endhoven, L.; Klos, T.B.; Witteveen, C.

2011-01-01

Multi-agent planning and scheduling concerns finding a joint plan to achieve some set of common goals with several independent agents each aiming to find a plan or schedule for their part of the goals. To avoid conflicts in these individual plans or schedules decoupling is used. Such a decoupling

Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-01-01

Full Text Available Fuzzy based CPU scheduler has become of great interest by operating system because of its ability to handle imprecise information associated with task. This paper introduces an extension to the fuzzy based round robin scheduler to a Vague Logic Based Round Robin (VBRR scheduler. VBRR scheduler works on 2-layered framework. At the first layer, scheduler has a vague inference system which has the ability to handle the impreciseness of task using vague logic. At the second layer, Vague Logic Based Round Robin (VBRR scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. An optimum time quantum reduces the overhead on scheduler by reducing the unnecessary context switches which lead to improve the overall performance of system. The work is simulated using MATLAB and compared with the conventional round robin scheduler and the other two fuzzy based approaches to CPU scheduler. Given simulation analysis and results prove the effectiveness and efficiency of VBRR scheduler.

Request-Driven Schedule Automation for the Deep Space Network

Science.gov (United States)

Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Call, Jared; Mercado, Marisol

2010-01-01

The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.

Progress in radiocarbon dating

International Nuclear Information System (INIS)

Hedges, R.E.M.

1985-01-01

The article concerns radiocarbon dating, the most important method for dating in archaeology. The principles and practice of the dating method are described. Recent developments in radiocarbon dating due to technical advances, are discussed, and include radiometric counting of small samples and accelerator mass spectrometry. Carbon isotopes and the environment are also discussed. (U.K.)

PLAN-IT - Scheduling assistant for solar system exploration

International Nuclear Information System (INIS)

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

1987-01-01

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

Management Matters. Changing to Flexible Scheduling

Science.gov (United States)

Pappas, Marjorie L.

2005-01-01

Elementary school library media specialists state that one of the most frustrating issues they face is the fixed schedules in their library media centers. Beyond the cost effectiveness issue, the fixed schedule severely limits using the resources of the library media center for inquiry learning and collaborative teaching experiences between the…

DME Prosthetics Orthotics, and Supplies Fee Schedule

Data.gov (United States)

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

Interactive Anticipatory Scheduling for Two Military Applications

National Research Council Canada - National Science Library

Howe, Adele

2003-01-01

...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...

Planning and Scheduling for Environmental Sensor Networks

Science.gov (United States)

Frank, J. D.

2005-12-01

Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

Science.gov (United States)

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-04-16

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

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

2018-03-01

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

Parental work schedules and child overweight and obesity.

Science.gov (United States)

Champion, S L; Rumbold, A R; Steele, E J; Giles, L C; Davies, M J; Moore, V M

2012-04-01

Studies in school-age children have consistently shown a positive association between maternal paid work hours and child obesity. However, there is conflicting evidence about the impact of maternal work hours scheduled at nonstandard times (for example, evenings, nights or weekends), and no previous examination of paternal work schedules and child weight. We examined the associations between maternal, paternal and combined parental paid work schedules and overweight/obesity in children at age 9 years. Data were analysed from the most recent follow-up of 9-year-old children (n=434) in an Australian birth cohort study. Children were measured and classified as overweight/obese using the International Obesity Taskforce body mass index cutoff points. Current working conditions of parents were obtained from a structured interview with the primary caregiver. Logistic regression analyses were used to investigate the effect of parental work schedules on child overweight/obesity with adjustment for a range of sociodemographic and household factors associated with parental employment and child weight. At 9 years of age, 99 children (22.8%) were overweight or obese. When parental work schedules were examined separately, child overweight/obesity was significantly associated with paternal nonstandard work schedules (adjusted odds ratio (OR) 1.97, 95% confidence interval (CI) 1.08-3.61). There was no association with any type of maternal work schedule. We also found an association between child overweight/obesity and circumstances in which both parents worked nonstandard schedules; however, this was of borderline statistical significance in the adjusted models (adjusted OR 2.26, 95% CI 0.99-5.16). Work hours scheduled at nonstandard times, when worked by the father or both parents, were associated with child overweight and obesity. These findings indicate the potential importance of fathers' paid work arrangements for child overweight/obesity, which until recently has largely

A NEW APPROACH TO CLASS SCHEDULING. FINAL REPORT.

Science.gov (United States)

CANTER, JOHN; AND OTHERS

AN INVESTIGATION OF THE USE OF A PROTOTYPE DEVICE FOR CLASS SCHEDULING WAS MADE. THE BEEKLEY INSITE DEVICE THAT WAS STUDIED USES THE "PEEK-A-BOO" PRINCIPLE OF MATCHING COMPUTER TAPES. A TEST GROUP OF 149 GRADUATE STUDENTS WAS USED. THEIR DESIRED SCHEDULES WERE MATCHED AUTOMATICALLY AGAINST A PROPOSED MASTER SCHEDULE TO EVALUATE THE…

Cost effective shift schedules enhance utility operations

International Nuclear Information System (INIS)

Coleman, R.M.

1995-01-01

This article describes how new shift scheduling concepts can save utility operations millions of dollars every year and yet maintain safety and improve employee morale. The key to scheduling is to define and match the work load. This includes discretionary as well as daily, weekly, and yearly core work loads. In most power plants the overall work load (including maintenance, operations, materials handling, etc.) on day shift is greater than on other shifts, hence an unbalanced schedule would be appropriate

A Phenomenological Investigation of Adolescent Dating Relationships and Dating Violence Counseling Interventions

Science.gov (United States)

Hays, Danica G.; Michel, Rebecca E.; Cole, Rebekah F.; Emelianchik, Kelly; Forman, Julia; Lorelle, Sonya; McBride, Rebecca; Sikes, April

2011-01-01

Despite the prevalence of dating violence, incidences often go unreported due to a lack of awareness among students as to appropriate dating behaviors. This phenomenology investigated how adolescents conceptualize and experience dating relationships. We explored adolescent females' definitions of healthy and abusive relationships, experiences with…

Multiple-Machine Scheduling with Learning Effects and Cooperative Games

Directory of Open Access Journals (Sweden)

Yiyuan Zhou

2015-01-01

Full Text Available Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.

Efficient Academic Scheduling at the U.S. Naval Academy

National Research Council Canada - National Science Library

Zane, David

2003-01-01

This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...

SOFIA's Choice: Automating the Scheduling of Airborne Observations

Science.gov (United States)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time-differentiated cong......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1997-01-01

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

State Teacher Salary Schedules. Policy Analysis

Science.gov (United States)

Griffith, Michael

2016-01-01

In the United States most teacher compensation issues are decided at the school district level. However, a group of states have chosen to play a role in teacher pay decisions by instituting statewide teacher salary schedules. Education Commission of the States has found that 17 states currently make use of teacher salary schedules. This education…

Cost-efficient scheduling of FAST observations

Science.gov (United States)

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

2018-03-01

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

Project schedule and cost estimate report

International Nuclear Information System (INIS)

1988-03-01

All cost tables represent obligation dollars, at both a constant FY 1987 level and an estimated escalation level, and are based on the FY 1989 DOE Congressional Budget submittal of December 1987. The cost tables display the total UMTRA Project estimated costs, which include both Federal and state funding. The Total Estimated Cost (TEC) for the UMTRA Project is approximately $992.5 million (in 1987 escalated dollars). Project schedules have been developed that provide for Project completion by September 1994, subject to Congressional approval extending DOE's authorization under Public Law 95-604. The report contains site-specific demographic data, conceptual design assumptions, preliminary cost estimates, and site schedules. A general project overview is also presented, which includes a discussion of the basis for the schedule and cost estimates, contingency assumptions, work breakdown structure, and potential project risks. The schedules and cost estimates will be revised as necessary to reflect appropriate decisions relating to relocation of certain tailings piles, or other special design considerations or circumstances (such as revised EPA groundwater standards), and changes in the Project mission. 27 figs', 97 tabs

Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Directory of Open Access Journals (Sweden)

Jianbo Qian

2013-01-01

Full Text Available We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them in O(n4 time. For some important special cases, the time complexity can be improved to be O(n2 using dynamic programming techniques.

Schedulability of Herschel revisited using statistical model checking

DEFF Research Database (Denmark)

David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel

2015-01-01

-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...... and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...

Correlates of minimal dating.

Science.gov (United States)

Leck, Kira

2006-10-01

Researchers have associated minimal dating with numerous factors. The present author tested shyness, introversion, physical attractiveness, performance evaluation, anxiety, social skill, social self-esteem, and loneliness to determine the nature of their relationships with 2 measures of self-reported minimal dating in a sample of 175 college students. For women, shyness, introversion, physical attractiveness, self-rated anxiety, social self-esteem, and loneliness correlated with 1 or both measures of minimal dating. For men, physical attractiveness, observer-rated social skill, social self-esteem, and loneliness correlated with 1 or both measures of minimal dating. The patterns of relationships were not identical for the 2 indicators of minimal dating, indicating the possibility that minimal dating is not a single construct as researchers previously believed. The present author discussed implications and suggestions for future researchers.

The Synthesis of a Hardware Scheduler for Non-Manifest Loops

NARCIS (Netherlands)

Mansour, O.; Molenkamp, Egbert; Krol, Th.

This paper addresses the hardware implementation of a dynamic scheduler for non-manifest data dependent periodic loops. Static scheduling techniques which are known to give near optimal scheduling-solutions for manifest loops, fail at scheduling non-manifest loops, since they lack the run time

Radiometric dating methods

International Nuclear Information System (INIS)

Bourdon, B.

2003-01-01

The general principle of isotope dating methods is based on the presence of radioactive isotopes in the geologic or archaeological object to be dated. The decay with time of these isotopes is used to determine the 'zero' time corresponding to the event to be dated. This paper recalls the general principle of isotope dating methods (bases, analytical methods, validation of results and uncertainties) and presents the methods based on natural radioactivity (Rb-Sr, Sm-Nd, U-Pb, Re-Os, K-Ar (Ar-Ar), U-Th-Ra- 210 Pb, U-Pa, 14 C, 36 Cl, 10 Be) and the methods based on artificial radioactivity with their applications. Finally, the methods based on irradiation damages (thermoluminescence, fission tracks, electron spin resonance) are briefly evoked. (J.S.)

Multiresource allocation and scheduling for periodic soft real-time applications

Science.gov (United States)

Gopalan, Kartik; Chiueh, Tzi-cker

2001-12-01

Real-time applications that utilize multiple system resources, such as CPU, disks, and network links, require coordinated scheduling of these resources in order to meet their end-to-end performance requirements. Most state-of-the-art operating systems support independent resource allocation and deadline-driven scheduling but lack coordination among multiple heterogeneous resources. This paper describes the design and implementation of an Integrated Real-time Resource Scheduler (IRS) that performs coordinated allocation and scheduling of multiple heterogeneous resources on the same machine for periodic soft real-time application. The principal feature of IRS is a heuristic multi-resource allocation algorithm that reserves multiple resources for real-time applications in a manner that can maximize the number of applications admitted into the system in the long run. At run-time, a global scheduler dispatches the tasks of the soft real-time application to individual resource schedulers according to the precedence constraints between tasks. The individual resource schedulers, which could be any deadline based schedulers, can make scheduling decisions locally and yet collectively satisfy a real-time application's performance requirements. The tightness of overall timing guarantees is ultimately determined by the properties of individual resource schedulers. However, IRS maximizes overall system resource utilization efficiency by coordinating deadline assignment across multiple tasks in a soft real-time application.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

Directory of Open Access Journals (Sweden)

Sukho Oh

2018-04-01

Full Text Available Time Slotted Channel Hopping (TSCH is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Scheduled meals and scheduled palatable snacks synchronize circadian rhythms: consequences for ingestive behavior.

Science.gov (United States)

Escobar, Carolina; Salgado, Roberto; Rodriguez, Katia; Blancas Vázquez, Aurea Susana; Angeles-Castellanos, Manuel; Buijs, Ruud M

2011-09-26

Food is a potent time signal for the circadian system and has shown to entrain and override temporal signals transmitted by the biological clock, the suprachiasmatic nucleus, which adjusts mainly to the daily light/dark (LD) alternation. Organisms mostly ingest food in their active period and this permits a correct coordination between the LD and the food elicited time signals with the circadian system. Under conditions when feeding opportunities are shifted to the usual resting/sleep phase, the potent entraining force of food, shifts circadian fluctuations in several tissues, organs, and brain structures toward meal time, resulting a desynchrony within the body and between the organism and the external LD cycle. The daily scheduled access to a palatable snack exerts similar changes specifically to brain areas involved in motivation and reward responses. This review describes the phenomenology of food entrainment and entrainment by a palatable snack. It suggests how scheduled feeding can lead to food addiction and how shifted feeding schedules toward the sleep phase can result in altered ingestive behavior, obesity and disturbed metabolic responses. Copyright © 2011 Elsevier Inc. All rights reserved.

Distributed Research Project Scheduling Based on Multi-Agent Methods

Directory of Open Access Journals (Sweden)

Constanta Nicoleta Bodea

2011-01-01

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

Construction schedules slack time minimizing

Science.gov (United States)

Krzemiński, Michał

2017-07-01

The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

Efficient Load Scheduling Method For Power Management

Directory of Open Access Journals (Sweden)

Vijo M Joy

2015-08-01

Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.

Courts, Scheduled Damages, and Medical Malpractice Insurance

DEFF Research Database (Denmark)

Bertoli, Paola; Grembi, Veronica

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

Longitudinal relationships between individual and class norms supporting dating violence and perpetration of dating violence.

Science.gov (United States)

Taylor, Katherine A; Sullivan, Terri N; Farrell, Albert D

2015-03-01

Dating violence is commonly perpetrated in adolescence, making it imperative to understand risk factors in order to inform prevention efforts. Although individual norms supporting dating violence are strongly related to its perpetration, few studies have examined their longitudinal impact. Moreover, the influence of class norms (i.e., norms for students in the same grade, cohort, and school) supporting dating violence on perpetration has rarely been studied. The current study examined longitudinal relationships between individual and class norms supporting dating violence and perpetration of physical and psychological dating violence. Participants were two cohorts of sixth graders from 37 schools who were in dating relationships at Wave 1 and 6 months later at Wave 2 (N = 2,022; 43% female; 52% African American, 21% Latino/a, 20% White, and 7% other). The analyses used a multilevel approach, with students represented at Level 1 and classes (n = 74) at Level 2. The models tested direct effects of Wave 1 individual and class norms supporting dating violence on subsequent changes in perpetration of dating violence at Wave 2 and the extent to which gender moderated these relationships. The findings indicated that greater individual norms supporting male dating violence predicted greater change in perpetration of physical and psychological dating violence and greater individual norms supporting female dating violence predicted greater change in perpetration of psychological dating violence. Greater class norms supporting male dating violence predicted greater change in perpetration of physical dating violence; whereas greater class norms supporting female dating violence predicted less change in perpetration of physical dating violence. These findings highlight the need to address norms in early adolescence.

Environmental monitoring master sampling schedule: January--December 1989

International Nuclear Information System (INIS)

Bisping, L.E.

1989-01-01

Environmental monitoring of the Hanford Site 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 calendar year 1989 for the Surface and Ground-Water Environmental Monitoring Projects. This schedule is subject to modification during the year in response to changes in Site operations, 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. This schedule includes routine ground-water sampling performed by PNL for Westinghouse Hanford Company, but does not include samples that may be collected in 1989 to support special studies or special contractor projects, or for quality control. The sampling schedule for Site-wide chemical monitoring is not included here, because it varies each quarter as needed, based on past results and operating needs. This schedule does not include Resource Conservation and Recovery Act ground-water sampling performed by PNL for Hanford Site contractors, nor does it include sampling that may be done by other DOE Hanford contractors

Understanding Teen Dating Violence

Science.gov (United States)

Understanding Teen Dating Violence Fact Sheet 2014 Dating violence is a type of intimate partner violence. It occurs between two people in a close relationship. The nature of dating violence can be physical, emotional, or sexual. • Physical— This ...

Evaluation of a twelve-hour/day shift schedule

International Nuclear Information System (INIS)

Lewis, P.M.; Swaim, D.J.

1986-01-01

In April 1985, the operating crews at the Fast Flux Test Facility near Richland, Washington, changed their rotating shift schedule from an 8-hour to a 12-hour a day work schedule. The primary purpose of the change was to reduce the attrition of operators by increasing their job satisfaction. Eighty-four percent of the operators favored the change. A program was established to evaluate the effects on plant performance, operator alertness, attrition, sleep, health, job satisfaction, and off-the-job satisfaction. Preliminary results from that evaluation program indicate that the 12-hour shift schedule is a reasonable alternative to an 8-hour schedule at this facility

Parallel machine scheduling with release dates, due dates and family setup times

NARCIS (Netherlands)

Schutten, Johannes M.J.; Leussink, R.A.M.

1996-01-01

In manufacturing, there is a fundamental conflict between efficient production and delivery performance. Maximizing machine utilization by batching similar jobs may lead to poor delivery performance. Minimizing customers' dissatisfaction may lead to an inefficient use of the machines. In this paper,

The Realities of Date Rape.

Science.gov (United States)

Presley, Cara; Watson, Jennifer; Williams, Audrey R.

This poster presentation addresses the issue of date rape, specifically in the college environment. Highlighted are date rape statistics, demographics, and date rape drugs. Also discussed are date rape warnings and prevention strategies. It is concluded that college and university administrators must place the issue of date rape and acquaintance…

PLACEMENT APPLICATIONS SCHEDULING LECTURE IN INTERNATIONAL PROGRAM UNIKOM BASED ANDROID

Directory of Open Access Journals (Sweden)

Andri Sahata Sitanggang

2017-12-01

Full Text Available One who determines life of a classroom namely mapping scheduling courses especially at college. The process scheduling has included time or schedule of a class of available, room available, lecture who is scheduled for, and schedule for lecturer going to teach. Hopefully with a scheduling it will facilitate the students and teachers in obtaining information lecture schedule. With the emergence of the android application ( is implanted in mobile phones , the public can now use the internet so fast that is based .So with that researchers give one a technology based solutions to build android application .This is because one of the technology has given the functions which may make it easier for students and university lecturers in terms of access to information. In building this application used method of the prototype consisting 2 access namely access user and admin , where module user consisting of modules register , login , scheduling module , while for admin given module login , register and arrangement information scheduling courses both the administration and lecturers .Application made will be integrated with internet so that this program is real-time application.

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.

Tail-robust scheduling using Limited Processor Sharing.

NARCIS (Netherlands)

Nair, J.K.; Wierman, A.; Zwart, A.P.

2010-01-01

From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice versa, leading to fundamental problems in designing schedulers that are robust to

The application of artificial intelligence to astronomical scheduling problems

Science.gov (United States)

Johnston, Mark D.

1992-01-01

Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike

Location-based Scheduling

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

Designing a fuzzy scheduler for hard real-time systems

Science.gov (United States)

Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami

1992-01-01

In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.

Road sign detection based on opponent color and rotational symmetry%基于颜色对抗和旋转对称的路标检测算法

Institute of Scientific and Technical Information of China (English)

黄跃凯; 徐丹; 曾昊; 吴达德

2014-01-01

本文针对禁止和警告标志提出了一种基于颜色对抗和旋转中心投影的检测方法。颜色对抗来源于人眼视觉机制中存在的相互对立的红/绿、黄/蓝色素对，以此突出红色和黄色区域。投影阶段则利用交通标志规则多边形的特征将点对的梯度向量向其旋转中心投影，得到多边形的中心位置和尺度信息。另外，采用多边形的几何特征进一步区分交通标志的类别。实验证明该方法能够满足实时需求，并对光照、旋转、尺度变化具有一定的不变性。%We present a real time road sign detection framework for warning and prohibition signs based on opponent colors and rotational center voting. The opponent colors exist in human primary visual cortex, like red/green, yellow/blue, by which red and yellow regions can be enhanced. During voting stage, pairwise gradient vectors vote for their rotational symmetry centers then regular polygons’ position and scales will be detected. Furthermore, polygons’ geometric features are used to classify the shape of the road signs. The experiments show that the proposed method satisfies real time application and is partly invariant to changes of illumination, scale and rotation.

12 CFR 41.28 - Effective date, compliance date, and prospective application.

Science.gov (United States)

2010-01-01

... TREASURY FAIR CREDIT REPORTING Affiliate Marketing § 41.28 Effective date, compliance date, and prospective... an affiliate to make solicitations to a consumer if the bank receives such information prior to...

16 CFR 680.28 - Effective date, compliance date, and prospective application.

Science.gov (United States)

2010-01-01

... REPORTING ACT AFFILIATE MARKETING § 680.28 Effective date, compliance date, and prospective application. (a... part shall not prohibit you from using eligibility information that you receive from an affiliate to...

12 CFR 571.28 - Effective date, compliance date, and prospective application.

Science.gov (United States)

2010-01-01

... THE TREASURY FAIR CREDIT REPORTING Affiliate Marketing § 571.28 Effective date, compliance date, and... receive from an affiliate to make solicitations to a consumer if you receive such information prior to...

User interface issues in supporting human-computer integrated scheduling

Science.gov (United States)

Cooper, Lynne P.; Biefeld, Eric W.

1991-01-01

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

Some extensions of the discrete lotsizing and scheduling problem

NARCIS (Netherlands)

M. Salomon (Marc); L.G. Kroon (Leo); R. Kuik (Roelof); L.N. van Wassenhove (Luk)

1991-01-01

textabstractIn this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process.

The applicability of knowledge-based scheduling to the utilities industry

International Nuclear Information System (INIS)

Yoshimoto, G.; Gargan, R. Jr.; Duggan, P.

1992-01-01

The Electric Power Research Institute (EPRI), Nuclear Power Division, has identified the three major goals of high technology applications for nuclear power plants. These goals are to enhance power production through increasing power generation efficiency, to increase productivity of the operations, and to reduce the threats to the safety of the plant. Our project responds to the second goal by demonstrating that significant productivity increases can be achieved for outage maintenance operations based on existing knowledge-based scheduling technology. Its use can also mitigate threats to potential safety problems by means of the integration of risk assessment features into the scheduler. The scheduling approach uses advanced techniques enabling the automation of the routine scheduling decision process that previously was handled by people. The process of removing conflicts in scheduling is automated. This is achieved by providing activity representations that allow schedulers to express a variety of different scheduling constraints and by implementing scheduling mechanisms that simulate kinds of processes that humans use to find better solutions from a large number of possible solutions. This approach allows schedulers to express detailed constraints between activities and other activities, resources (material and personnel), and requirements that certain states exist for their execution. Our scheduler has already demonstrated its benefit to improving the shuttle processing flow management at Kennedy Space Center. Knowledge-based scheduling techniques should be examined by utilities industry researchers, developers, operators and management for application to utilities planning problems because of its great cost benefit potential. 4 refs., 4 figs

Up-Dating: Ratings of Perceived Dating Success Are Better Online than Offline.

Science.gov (United States)

Fullwood, Chris; Attrill-Smith, Alison

2018-01-01

The primary aims of this study were to test whether perceived dating success would differ between offline and online zero-acquaintance dating contexts and to investigate the role that self-esteem might play in these evaluations. Participants were presented with the same photos of targets in either an offline or online dating scenario and rated their chances of dating success along with their perceptions of how attractive they thought the target would consider them. Higher self-esteem individuals believed they would be rated as more attractive. There was an overall perception that, irrespective of self-esteem level, meeting online would lead to better chances of dating success. These findings are considered in relation to an increased ability to more precisely manage impressions and develop an image of the self which would be evaluated more positively online.

Microcomputer-based workforce scheduling for hospital porters.

Science.gov (United States)

Lin, C K

1999-01-01

This paper focuses on labour scheduling for hospital porters who are the major workforce providing routine cleansing of wards, transportation and messenger services. Generating an equitable monthly roster for porters while meeting the daily minimum demand is a tedious task scheduled manually by a supervisor. In considering a variety of constraints and goals, a manual schedule was usually produced in seven to ten days. To be in line with the strategic goal of scientific management of an acute care regional hospital in Hong Kong, a microcomputer-based algorithm was developed to schedule the monthly roster. The algorithm, coded in Digital Visual Fortran 5.0 Professional, could generate a monthly roster in seconds. Implementation has been carried out since September 1998 and the results proved to be useful to hospital administrators and porters. This paper discusses both the technical and human issues involved during the computerization process.

Car painting process scheduling with harmony search algorithm

Science.gov (United States)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure

Science.gov (United States)

Matyska, Ludek; Ruda, Miroslav; Toth, Simon

For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.

Dynamic Scheduling for Cloud Reliability using Transportation Problem

OpenAIRE

P. Balasubramanie; S. K. Senthil Kumar

2012-01-01

Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud computing environment. Therefore there is a need to implement a sch...

Carbon 14 dating method

International Nuclear Information System (INIS)

Fortin, Ph.

2000-01-01

This document gives a first introduction to 14 C dating as it is put into practice at the radiocarbon dating centre of Claude-Bernard university (Lyon-1 univ., Villeurbanne, France): general considerations and recalls of nuclear physics; the 14 C dating method; the initial standard activity; the isotopic fractioning; the measurement of samples activity; the liquid-scintillation counters; the calibration and correction of 14 C dates; the preparation of samples; the benzene synthesis; the current applications of the method. (J.S.)

Optimal Algorithms and a PTAS for Cost-Aware Scheduling

NARCIS (Netherlands)

L. Chen; N. Megow; R. Rischke; L. Stougie (Leen); J. Verschae

2015-01-01

htmlabstractWe consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the

5 CFR 532.513 - Flexible and compressed work schedules.

Science.gov (United States)

2010-01-01

... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Flexible and compressed work schedules... REGULATIONS PREVAILING RATE SYSTEMS Premium Pay and Differentials § 532.513 Flexible and compressed work schedules. Federal Wage System employees who are authorized to work flexible and compressed work schedules...

Distributing Flexibility to Enhance Robustness in Task Scheduling Problems

NARCIS (Netherlands)

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

2013-01-01

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

ESSOPE: Towards S/C operations with reactive schedule planning

Science.gov (United States)

Wheadon, J.

1993-01-01

The ESSOPE is a prototype front-end tool running on a Sun workstation and interfacing to ESOC's MSSS spacecraft control system for the exchange of telecommand requests (to MSSS) and telemetry reports (from MSSS). ESSOPE combines an operations Planner-Scheduler, with a Schedule Execution Control function. Using an internal 'model' of the spacecraft, the Planner generates a schedule based on utilization requests for a variety of payload services by a community of Olympus users, and incorporating certain housekeeping operations. Conflicts based on operational constraints are automatically resolved, by employing one of several available strategies. The schedule is passed to the execution function which drives MSSS to perform it. When the schedule can no longer be met, either because the operator interferes (by delays or changes of requirements), or because ESSOPE has recognized some spacecraft anomalies, the Planner produces a modified schedule maintaining the on-going procedures as far as consistent with the new constraints or requirements.

Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission.

Science.gov (United States)

Qin, Danyang; Yang, Songxiang; Zhang, Yan; Ma, Jingya; Ding, Qun

2017-06-09

Wireless energy collecting technology can effectively reduce the network time overhead and prolong the wireless sensor network (WSN) lifetime. However, the traditional energy collecting technology cannot achieve the balance between ergodic channel capacity and average collected energy. In order to solve the problem of the network transmission efficiency and the limited energy of wireless devices, three improved scheduling mechanisms are proposed: improved signal noise ratio (SNR) scheduling mechanism (IS2M), improved N-SNR scheduling mechanism (INS2M) and an improved Equal Throughput scheduling mechanism (IETSM) for different channel conditions to improve the whole network performance. Meanwhile, the average collected energy of single users and the ergodic channel capacity of three scheduling mechanisms can be obtained through the order statistical theory in Rayleig, Ricean, Nakagami- m and Weibull fading channels. It is concluded that the proposed scheduling mechanisms can achieve better balance between energy collection and data transmission, so as to provide a new solution to realize synchronous information and energy transmission for WSNs.

Dates fruits classification using SVM

Science.gov (United States)

Alzu'bi, Reem; Anushya, A.; Hamed, Ebtisam; Al Sha'ar, Eng. Abdelnour; Vincy, B. S. Angela

2018-04-01

In this paper, we used SVM in classifying various types of dates using their images. Dates have interesting different characteristics that can be valuable to distinguish and determine a particular date type. These characteristics include shape, texture, and color. A system that achieves 100% accuracy was built to classify the dates which can be eatable and cannot be eatable. The built system helps the food industry and customer in classifying dates depending on specific quality measures giving best performance with specific type of dates.

Heuristic Approach for Balancing Shift Schedules

International Nuclear Information System (INIS)

Kim, Dae Ho; Yun, Young Su; Lee, Yong Hee

2005-01-01

In this paper, a heuristic approach for balancing shift schedules is proposed. For the shift schedules, various constraints which have usually been considered in realworld industry are used, and the objective is to minimize the differences of the workloads in each workgroup. The constraints and objective function are implemented in the proposed heuristic approach. Using a simple instance, the efficiency of the proposed heuristic approach is proved

Job schedul in Grid batch farms

International Nuclear Information System (INIS)

Gellrich, Andreas

2014-01-01

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

It's the End of the World as we Know it: Populist Strategies of the Family Code Opponents

Directory of Open Access Journals (Sweden)

Roman Kuhar

2015-06-01

Full Text Available The starting hypothesis is connected to the new role of the Roman Catholic Church (RCC in policy discussions on issues related to sexual citizenship: RCC is secularizing its image and discourse by establishing satellite organizations working on its behalf, in order to clericalize society. One of such satellite organizations is the Civil Initiative for the Family and Rights of Children (CIFRC, which was the main opponent of the new Family Code. In this paper we use critical frame analysis in order to analyze CIFRC’s discourse, placing it in the context of political homophobia and populist action. The central framework of CIFRC’s discourse was a creation of homosexuality as a threat — first in relation to the “innocent” children, but also in relation to the “real” family. Their discourse contains simple problem-solution binaries, in which the problem can be solved by (legal, symbolic, physical removal of those who are constituted as a problem in the first place (homosexuals. In the concluding part of the article, we contextualize the results of the study by introducing a broader European dimension of conservative mass movements against so-called theory or ideology of gender. This is a new chapter in the battle against human rights of LGBT-persons, in which language and concepts, which were until recently used by the proponents of gender equality and human rights of LGBT-persons, are now (abused by conservative forces.

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.

Real-time systems scheduling fundamentals

CERN Document Server

Chetto, Maryline

2014-01-01

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

Endogenous scheduling preferences and congestion

DEFF Research Database (Denmark)

Fosgerau, Mogens; Small, Kenneth

2010-01-01

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

Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

Directory of Open Access Journals (Sweden)

Maria Drakaki

2017-02-01

Full Text Available Agent-based intelligent manufacturing control systems are capable to efficiently respond and adapt to environmental changes. Manufacturing system adaptation and evolution can be addressed with learning mechanisms that increase the intelligence of agents. In this paper a manufacturing scheduling method is presented based on Timed Colored Petri Nets (CTPNs and reinforcement learning (RL. CTPNs model the manufacturing system and implement the scheduling. In the search for an optimal solution a scheduling agent uses RL and in particular the Q-learning algorithm. A warehouse order-picking scheduling is presented as a case study to illustrate the method. The proposed scheduling method is compared to existing methods. Simulation and state space results are used to evaluate performance and identify system properties.

Best Speed Fit EDF Scheduling for Performance Asymmetric Multiprocessors

Directory of Open Access Journals (Sweden)

Peng Wu

2017-01-01

Full Text Available In order to improve the performance of a real-time system, asymmetric multiprocessors have been proposed. The benefits of improved system performance and reduced power consumption from such architectures cannot be fully exploited unless suitable task scheduling and task allocation approaches are implemented at the operating system level. Unfortunately, most of the previous research on scheduling algorithms for performance asymmetric multiprocessors is focused on task priority assignment. They simply assign the highest priority task to the fastest processor. In this paper, we propose BSF-EDF (best speed fit for earliest deadline first for performance asymmetric multiprocessor scheduling. This approach chooses a suitable processor rather than the fastest one, when allocating tasks. With this proposed BSF-EDF scheduling, we also derive an effective schedulability test.

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities

OpenAIRE

Bonifaci , Vincenzo; Brandenburg , Björn; D'Angelo , Gianlorenzo; Marchetti-Spaccamela , Alberto

2016-01-01

International audience; Many multiprocessor real-time operating systems offer the possibility to restrict the migrations of any task to a specified subset of processors by setting affinity masks. A notion of " strong arbitrary processor affinity scheduling " (strong APA scheduling) has been proposed; this notion avoids schedulability losses due to overly simple implementations of processor affinities. Due to potential overheads, strong APA has not been implemented so far in a real-time operat...

KASS v.2.2. scheduling software for construction

OpenAIRE

Krzemiński Michał

2016-01-01

The paper presents fourth version of specialist useful software in scheduling KASS v.2.2 (Algorithm Scheduling Krzeminski System). KASS software is designed for construction scheduling, specially form flow shop models. The program is being dedicated closely for the purposes of the construction. In distinguishing to other used programs in tasks of this type operational research criteria were designed closely with the thought about construction works and about the specificity of the building pr...

Project control integrating cost and schedule in construction

CERN Document Server

Del Pico, Wayne J

2013-01-01

The key to successful project control is the fusing of cost to schedule whereby the management of one helps to manage the other. Project Control: Integrating Cost and Schedule in Construction explores the reasons behind and the methodologies for proper planning, monitoring, and controlling both project costs and schedule. Filling a current void the topic of project control applied to the construction industry, it is essential reading for students and professionals alike.

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

Fixed-Time Schedule Effects in Combination with Response-Dependent Schedules

Science.gov (United States)

Borrero, John C.; Bartels-Meints, Jamie A.; Sy, Jolene R.; Francisco, Monica T.

2011-01-01

We evaluated the effects of fixed-interval (FI), fixed-time (FT), and conjoint (combined) FI FT reinforcement schedules on the responding of 3 adults who had been diagnosed with schizophrenia. Responding on vocational tasks decreased for 2 of 3 participants under FT alone relative to FI alone. Responding under FI FT resulted in response…

Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

KAUST Repository

Zafar, Ammar

2012-09-16

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

Schedule reconciliation tests for management prudency determination

International Nuclear Information System (INIS)

Howell, G.E.

1986-01-01

The prudency audit of a nuclear project involves engineering, construction, financial, and management dimensions. The audit must retrospectively evaluate the decisions and actions of management decision makers and then equitably allocate the cost impacts of those decisions and actions in a comprehensive and objective manner. In most situations, determination of the impact of schedule delays is a paramount issue. Manzi and Associates uses an approach to schedule reconciliation that focuses on the site-specific, as-built condition. The as-built schedule model is analyzed by a backward pass, or but-for methodology which focuses on the causes and impacts of identified delays. The objective is to demonstrate that but-for the identified delay, the project could have been built in the as-planned time frame. The but-for methodology has been used in many contract dispute cases and is currently being applied to schedule reconciliation on several nuclear plants. The potential for applying this methodology to both new construction and retrofit projects is great

Cure Schedule for Stycast 2651/Catalyst 11.

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 Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 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 was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, T_g, exceeding cure temperature).

Job scheduling in a heterogenous grid environment

Energy Technology Data Exchange (ETDEWEB)

Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

2004-02-11

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

Artificial intelligence for the CTA Observatory scheduler

Science.gov (United States)

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

2014-08-01

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

Automated Scheduling of Personnel to Staff Operations for the Mars Science Laboratory

Science.gov (United States)

Knight, Russell; Mishkin, Andrew; Allbaugh, Alicia

2014-01-01

Leveraging previous work on scheduling personnel for space mission operations, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] to the domain of scheduling personnel for operations of the Mars Science Laboratory. Automated scheduling of personnel is not new. We compare our representations to a sampling of employee scheduling systems available with respect to desired features. We described the constraints required by MSL personnel schedulers and how each is handled by the scheduling algorithm.

The impact of alternative pricing methods for drugs in California Workers' Compensation System: Fee-schedule pricing.

Science.gov (United States)

Wilson, Leslie; Turkistani, Fatema A; Huang, Wei; Tran, Dang M; Lin, Tracy Kuo

2018-01-01

California's Workers' Compensation System (CAWCS) Department of Industrial Relations questioned the adequacy of the current Medi-Cal fee-schedule pricing and requested analysis of alternatives that maximize price availability and maintain budget neutrality. To compare CAWCS pharmacy-dispensed (PD) drug prices under alternative fee schedules, and identify combinations of alternative benchmarks that have prices available for the largest percentage of PD drugs and that best reach budget neutrality. Claims transaction-level data (2011-2013) from CAWCS were used to estimate total annual PD pharmaceutical payments. Medi-Cal pricing data was from the Workman's Compensation Insurance System (WCIS). Average Wholesale Prices (AWP), Wholesale Acquisition Costs (WAC), Direct Prices (DP), Federal Upper Limit (FUL) prices, and National Average Drug Acquisition Costs (NADAC) were from Medi-Span. We matched National Drug Codes (NDCs), pricing dates, and drug quantity for comparisons. We report pharmacy-dispensed (PD) claims frequency, reimbursement matching rate, and paid costs by CAWCS as the reference price against all alternative price benchmarks. Of 12,529,977 CAWCS claims for pharmaceutical products 11.6% (1,462,814) were for PD drugs. Prescription drug cost for CAWCS was over $152M; $63.9M, $47.9M, and $40.6M in 2011-2013. Ninety seven percent of these CAWCS PD claims had a Medi-Cal price. Alternative mechanisms provided a price for fewer claims; NADAC 94.23%, AWP 90.94%, FUL 73.11%, WAC 66.98%, and DP 14.33%. Among CAWCS drugs with no Medi-Cal price in PD claims, AWP, WAC, NADAC, DP, and FUL provided prices for 96.7%, 63.14%, 24.82%, 20.83%, and 15.08% of claims. Overall CAWCS paid 100.52% of Medi-Cal, 60% of AWP, 97% of WAC, 309.53% of FUL, 103.83% of DP, and 136.27% of NADAC. CAWCS current Medi-Cal fee-schedule price list for PD drugs is more complete than all alternative fee-schedules. However, all reimbursement approaches would require combinations of pricing benchmarks

Perceptions of Teachers in South Florida Toward Block Scheduling.

Science.gov (United States)

Hamdy, Mona; Urich, Ted

1998-01-01

A study was conducted at two metropolitan South Florida high schools to determine perceptions of 100 teachers concerning block scheduling. Teachers felt that the 4 X 4 block schedule contained too many time gaps for teaching foreign languages, English, and math. Teachers believed block schedules benefitted advanced students more than others and…

29 CFR 2520.103-10 - Annual report financial schedules.

Science.gov (United States)

2010-07-01

... 29 Labor 9 2010-07-01 2010-07-01 false Annual report financial schedules. 2520.103-10 Section 2520... financial schedules. (a) General. The administrator of a plan filing an annual report pursuant to § 2520.103... of the annual report the separate financial schedules described in paragraph (b) of this section. (b...

Harmonious personnel scheduling

NARCIS (Netherlands)

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

2006-01-01

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

Internet dating as a project: the commodification and rationalisation of online dating

Directory of Open Access Journals (Sweden)

Tjaša Žakelj

2015-04-01

Full Text Available Based on qualitative empirical data from two studies on Internet dating in Slovenia, this paper discusses the social contexts of the Internet dating of heterosexual men and women and homosexual men. Special attention is given to different aspects of the commodification and rationalisation of dating in the process of forming potential (romantic partnerships. First, we discuss our respondents’ reasons for using the Internet to get in touch with potential (romantic partners. Second, we focus on the demands and strategies of targeted market- ing in personal profile writing and, finally, on the process of selecting potential partners. Our study shows that the primary understanding of Internet dating among people who engage in it is its economic nature. Together with targeted marketing and the predeter- mined criteria for choosing interesting others, Internet dating can thus be understood as a market that encourages rationalisation and commodification in the process of forming intimate relationships.

Generating variable and random schedules of reinforcement using Microsoft Excel macros.

Science.gov (United States)

Bancroft, Stacie L; Bourret, Jason C

2008-01-01

Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values.

Dating Violence among College Students

Science.gov (United States)

Iconis, Rosemary

2013-01-01

Dating violence is a significant problem on college campuses. More than one-fifth of the undergraduate dating population are physically abused by their dating partners and an even greater percentage are psychologically abused. Researchers have identified risk factors for college student dating violence. Preventive interventions are strongly…

20 CFR 404.630 - Use of date of written statement as filing date.

Science.gov (United States)

2010-04-01

... data on the Internet Social Security Benefit Application to us, we will use the date of the... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Use of date of written statement as filing date. 404.630 Section 404.630 Employees' Benefits SOCIAL SECURITY ADMINISTRATION FEDERAL OLD-AGE...

Alternative Work Schedules in Office and Nonoffice Work Settings.

Science.gov (United States)

Kirk, Raymond J.; Barton, H. David

A rapidly growing change in the workplace is the replacement of a fixed work schedule with a variety of alternative work schedules (AWS), including both flexible and compressed schedules. Experimenting organizations (N=901) evaluated one of four major categories of AWS in office and nonoffice settings, i.e., a flexible 8-hour day;…

Parametric Cost and Schedule Modeling for Early Technology Development

Science.gov (United States)

2018-04-02

Research NoteNational Security Rep rt PARAMETRIC MODELING FOR EARLY TECHNOLOGY DEVELOPMENT COST AND SCHEDULE Chuck...Alexander NSR_11x17_Cover_CostModeling_v8.indd 1 11/20/17 3:15 PM PARAMETRIC COST AND SCHEDULE MODELING FOR EARLY  TECHNOLOGY DEVELOPMENT Chuck...COST AND SCHEDULE MODELING FOR EARLY  TECHNOLOGY DEVELOPMENT iii Contents Figures

A Market-Based Approach to Multi-factory Scheduling

Science.gov (United States)

Vytelingum, Perukrishnen; Rogers, Alex; MacBeth, Douglas K.; Dutta, Partha; Stranjak, Armin; Jennings, Nicholas R.

In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations of scheduling in a centralised manner - which requires a center to have complete and perfect information for optimality and the truthful revelation of potentially commercially private preferences to that center - we advocate an informationally decentralised approach that is both agile and dynamic. In particular, this work adopts a market-based approach for decentralised scheduling by considering the different stakeholders representing different factories as self-interested, profit-motivated economic agents that trade resources for the scheduling of jobs. The overall schedule of these jobs is then an emergent behaviour of the strategic interaction of these trading agents bidding for resources in a market based on limited information and their own preferences. Using a simple (zero-intelligence) bidding strategy, we empirically demonstrate that our market-based approach achieves a lower bound efficiency of 84%. This represents a trade-off between a reasonable level of efficiency (compared to a centralised approach) and the desirable benefits of a decentralised solution.

A Review Of Fault Tolerant Scheduling In Multicore Systems

Directory of Open Access Journals (Sweden)

Shefali Malhotra

2015-05-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1995-02-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1995-02-01

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