Human Performance-Aware Scheduling and Routing of a Multi-Skilled Workforce

Directory of Open Access Journals (Sweden)

Maikel L. van Eck

2017-10-01

Full Text Available Planning human activities within business processes often happens based on the same methods and algorithms as are used in the area of manufacturing systems. However, human behaviour is quite different from machine behaviour. Their performance depends on a number of factors, including workload, stress, personal preferences, etc. In this article we describe an approach for scheduling activities of people that takes into account business rules and dynamic human performance in order to optimise the schedule. We formally describe the scheduling problem we address and discuss how it can be constructed from inputs in the form of business process models and performance measurements. Finally, we discuss and evaluate an implementation for our planning approach to show the impact of considering dynamic human performance in scheduling.

On the Correspondence between Preference Assessment Outcomes and Progressive-Ratio Schedule Assessments of Stimulus Value

Science.gov (United States)

DeLeon, Iser G.; Frank, Michelle A.; Gregory, Meagan K.; Allman, Melissa J.

2009-01-01

The current study examined whether stimuli of different preference levels would be associated with different amounts of work maintained by the stimuli, as determined through progressive-ratio schedule break points. Using a paired-choice preference assessment, stimuli were classified as high, moderate, or low preference for 4 individuals with…

Evidence for positive, but not negative, behavioral contrast with wheel-running reinforcement on multiple variable-ratio schedules.

Science.gov (United States)

Belke, Terry W; Pierce, W David

2016-12-01

Rats responded on a multiple variable-ratio (VR) 10 VR 10 schedule of reinforcement in which lever pressing was reinforced by the opportunity to run in a wheel for 30s in both the changed (manipulated) and unchanged components. To generate positive contrast, the schedule of reinforcement in the changed component was shifted to extinction; to generate negative contrast, the schedule was shifted to VR 3. With the shift to extinction in the changed component, wheel-running and local lever-pressing rates increased in the unchanged component, a result supporting positive contrast; however, the shift to a VR 3 schedule in the changed component showed no evidence of negative contrast in the unaltered setting, only wheel running decreased in the unchanged component. Changes in wheel-running rates across components were consistent in showing a compensation effect, depending on whether the schedule manipulation increased or decreased opportunities for wheel running in the changed component. These findings are the first to demonstrate positive behavioral contrast on a multiple schedule with wheel running as reinforcement in both components. Copyright © 2016 Elsevier B.V. All rights reserved.

Influence of intravenous self-administered psychomotor stimulants on performance of rhesus monkeys in a multiple schedule paradigm.

Science.gov (United States)

Hoffmeister, F

1980-01-01

Rhesus monkeys were trained to complete three multiple schedules. The schedules consisted of three components: a fixed interval (component 1), a variable interval (component 2), and a fixed ratio (component 3). During components 1 and 2, pressing lever 1 was always reinforced by food delivery. During component 3, pressing lever 2 resulted in either food delivery or intravenous infusions of saline solution, solutions of cocaine, of d-amphetamine, of phenmetrazine, or fenetylline. In schedule I, animals were presented with all three components independent of key-pressing behavior during components 1 and 2. In schedule II the availability of component 2 was dependent on completion of component 1. Component 3 was made available only on completion of component 2. Noncompletion of components 1 or 2 resulted in time-out of 15 and 10 min, respectively. Schedule III was identical with schedule II, except that in schedule III the completion of components was indicated only by a change in the lever lights. The influence of self-administered drugs on behavior in all three components was evaluated. Self-administration of psychomotor stimulants impaired the performance of animals and delayed completion of components 1 and 2 of schedules I, II, and III. The effects on behavior were similar with low drug intake in schedule III, moderate intake in schedule II, and high drug intake in schedule I. These effects were strong with self-administration of phenmetrazine, moderate with self-administration of cocaine and d-amphetamine, and weak with self-administration of fenetylline.

Evidence for a role of 5-HT2C receptors in the motor aspects of performance, but not the efficacy of food reinforcers, in a progressive ratio schedule

NARCIS (Netherlands)

Bezzina, G.; Body, S.; Cheung, T.H.; Hampson, C.L.; Bradshaw, C.M.; Glennon, J.C.; Szabadi, E.

2015-01-01

RATIONALE: 5-Hydroxytryptamine2C (5-HT2C) receptor agonists reduce the breakpoint in progressive ratio schedules of reinforcement, an effect that has been attributed to a decrease of the efficacy of positive reinforcers. However, a reduction of the breakpoint may also reflect motor impairment.

Performance Evaluation of Bidding-Based Multi-Agent Scheduling Algorithms for Manufacturing Systems

Directory of Open Access Journals (Sweden)

Antonio Gordillo

2014-10-01

Full Text Available Artificial Intelligence techniques have being applied to many problems in manufacturing systems in recent years. In the specific field of manufacturing scheduling many studies have been published trying to cope with the complexity of the manufacturing environment. One of the most utilized approaches is (multi agent-based scheduling. Nevertheless, despite the large list of studies reported in this field, there is no resource or scientific study on the performance measure of this type of approach under very common and critical execution situations. This paper focuses on multi-agent systems (MAS based algorithms for task allocation, particularly in manufacturing applications. The goal is to provide a mechanism to measure the performance of agent-based scheduling approaches for manufacturing systems under key critical situations such as: dynamic environment, rescheduling, and priority change. With this mechanism it will be possible to simulate critical situations and to stress the system in order to measure the performance of a given agent-based scheduling method. The proposed mechanism is a pioneering approach for performance evaluation of bidding-based MAS approaches for manufacturing scheduling. The proposed method and evaluation methodology can be used to run tests in different manufacturing floors since it is independent of the workshop configuration. Moreover, the evaluation results presented in this paper show the key factors and scenarios that most affect the market-like MAS approaches for manufacturing scheduling.

Annual Equivalent Value, Benefit Cost Ratio, and Composite Performance Index as Valuation Appraisal Support of Teakwood Plantation

Directory of Open Access Journals (Sweden)

Sugiharto Soeleman

2014-04-01

Full Text Available Teak (Tectona grandis L.f is a premium high-value hardwood species being viewed as the most preferred species for investment opportunity. Recently, there has been a gradual move away from state control of teakwood plantation toward the participation of private enterprises. Several enterprises offer investment opportunity of teakwood plantation in which one of the main selling points being offered is a quick harvesting schedule. A quick harvesting time, however, might not provide the best outcome to the investors. This research exercise and compare the valuation appraisal of different harvesting schedules. The research focused on project planning, enterprise budget, financial projection, and valuation measurements to arrive at overall appraisal. To avoid any possible bias of individual investor's preference on common valuation criteria such as total investment, net cash flow (NCF, net present value (NPV, internal rate of return (IRR, profit on investment (P/I, and payback period (PBP, 3 otherS criteria namely benefit cost ratio (BCR, annual equivalent value (AEV, and composite performance index (CPI have been applied to arrive at a more fair valuation. It is concluded that the longer the harvesting schedule, the better valuation outcome could be achieved, and therefore, investors should critically review any investment proposal in accordance to their preference on valuation criteria. Keywords : annual equivalent value, benefit cost ratio, composite performance index, valuation appraisal

Size-based scheduling to improve web performance

NARCIS (Netherlands)

Harchol-Balter, M.; Schroeder, B.; Bansal, N.; Agrawal, M.

2003-01-01

Is it possible to reduce the expected response time of every request at a web server, simply by changing the order in which we schedule the requests? That is the question we ask in this paper.This paper proposes a method for improving the performance of web servers servicing static HTTP requests.

Impact of interference on the performance of selection based parallel multiuser scheduling

KAUST Repository

Nam, Sungsik

2012-02-01

In conventional multiuser parallel scheduling schemes, every scheduled user is interfering with every other scheduled user, which limits the capacity and performance of multiuser systems, and the level of interference becomes substantial as the number of scheduled users increases. Based on the above observations, we investigate the trade-off between the system throughput and the number of scheduled users through the exact analysis of the total average sum rate capacity and the average spectral efficiency. Our analytical results can help the system designer to carefully select the appropriate number of scheduled users to maximize the overall throughput while maintaining an acceptable quality of service under certain channel conditions. © 2012 IEEE.

Performance analysis of job scheduling policies in parallel supercomputing environments

Energy Technology Data Exchange (ETDEWEB)

Naik, V.K.; Squillante, M.S. [IBM T.J. Watson Research Center, Yorktown Heights, NY (United States); Setia, S.K. [George Mason Univ., Fairfax, VA (United States). Dept. of Computer Science

1993-12-31

In this paper the authors analyze three general classes of scheduling policies under a workload typical of largescale scientific computing. These policies differ in the manner in which processors are partitioned among the jobs as well as the way in which jobs are prioritized for execution on the partitions. Their results indicate that existing static schemes do not perform well under varying workloads. Adaptive policies tend to make better scheduling decisions, but their ability to adjust to workload changes is limited. Dynamic partitioning policies, on the other hand, yield the best performance and can be tuned to provide desired performance differences among jobs with varying resource demands.

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

Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

Directory of Open Access Journals (Sweden)

Imam Ahmad Ashari

2016-11-01

Full Text Available Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization  algorithm in solving the case of course scheduling.

Choice with frequently changing food rates and food ratios.

Science.gov (United States)

Baum, William M; Davison, Michael

2014-03-01

In studies of operant choice, when one schedule of a concurrent pair is varied while the other is held constant, the constancy of the constant schedule may exert discriminative control over performance. In our earlier experiments, schedules varied reciprocally across components within sessions, so that while food ratio varied food rate remained constant. In the present experiment, we held one variable-interval (VI) schedule constant while varying the concurrent VI schedule within sessions. We studied five conditions, each with a different constant left VI schedule. On the right key, seven different VI schedules were presented in seven different unsignaled components. We analyzed performances at several different time scales. At the longest time scale, across conditions, behavior ratios varied with food ratios as would be expected from the generalized matching law. At shorter time scales, effects due to holding the left VI constant became more and more apparent, the shorter the time scale. In choice relations across components, preference for the left key leveled off as the right key became leaner. Interfood choice approximated strict matching for the varied right key, whereas interfood choice hardly varied at all for the constant left key. At the shortest time scale, visit patterns differed for the left and right keys. Much evidence indicated the development of a fix-and-sample pattern. In sum, the procedural difference made a large difference to performance, except for choice at the longest time scale and the fix-and-sample pattern at the shortest time scale. © Society for the Experimental Analysis of Behavior.

Improved human performance through appropriate work scheduling

International Nuclear Information System (INIS)

Morisseau, D.S.; Lewis, P.M.; Persensky, J.J.

1987-01-01

The Nuclear Regulatory Commission (NRC) has had a policy, Generic Letter 82-12, on hours of work since 1982. The policy states that licensees should establish controls to prevent situations where fatigue could reduce the ability of operating personnel to perform their duties safely (USNRC 1982). While that policy does give guidance on hours of work and overtime, it does not address periods of longer than 7 days or work schedules other than the routine 8-hour day, 40-hour week. Recognizing that NRC policy could provide broader guidance for shift schedules and hours of overtime work, the Division of Human Factors Safety conducted a project with Pacific Northwest Laboratories (PNL) to help the NRC better understand the human factors principles and issues concerning hours of work so that the NRC could consider updating their policy as necessary. The results of this project are recommendations for guidelines and limits for periods of 14 days, 28 days, and 1 year to take into account the cumulative effects of fatigue. In addition, routine 12-hour shifts are addressed. This latter type of shift schedule has been widely adopted in the petroleum and chemical industries and several utilities operating nuclear power plants have adopted it as well. Since this is the case, it is important to consider including guidelines for implementing this type of schedule. This paper discusses the bases for the PNL recommendations which are currently being studied by the NRC

Entity’s Irregular Demand Scheduling of the Wholesale Electricity Market based on the Forecast of Hourly Price Ratios

Directory of Open Access Journals (Sweden)

O. V. Russkov

2015-01-01

Full Text Available The article considers a hot issue to forecast electric power demand amounts and prices for the entities of wholesale electricity market (WEM, which are in capacity of a large user with production technology requirements prevailing over hourly energy planning ones. An electric power demand of such entities is on irregular schedule. The article analyses mathematical models, currently applied to forecast demand amounts and prices. It describes limits of time-series models and fundamental ones in case of hourly forecasting an irregular demand schedule of the electricity market entity. The features of electricity trading at WEM are carefully analysed. Factors that influence on irregularity of demand schedule of the metallurgical plant are shown. The article proposes method for the qualitative forecast of market price ratios as a tool to reduce a dependence on the accuracy of forecasting an irregular schedule of demand. It describes the differences between the offered method and the similar ones considered in research studies and scholarly works. The correlation between price ratios and relaxation in the requirements for the forecast accuracy of the electric power consumption is analysed. The efficiency function of forecast method is derived. The article puts an increased focus on description of the mathematical model based on the method of qualitative forecast. It shows main model parameters and restrictions the electricity market imposes on them. The model prototype is described as a programme module. Methods to assess an effectiveness of the proposed forecast model are examined. The positive test results of the model using JSC «Volzhsky Pipe Plant» data are given. A conclusion is drawn concerning the possibility to decrease dependence on the forecast accuracy of irregular schedule of entity’s demand at WEM. The effective trading tool has been found for the entities of irregular demand schedule at WEM. The tool application allows minimizing cost

Multi-core processing and scheduling performance in CMS

International Nuclear Information System (INIS)

Hernández, J M; Evans, D; Foulkes, S

2012-01-01

Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resulting in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.

Performance comparison of some evolutionary algorithms on job shop scheduling problems

Science.gov (United States)

Mishra, S. K.; Rao, C. S. P.

2016-09-01

Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

Performance of Spatial Division Multiplexing MIMO with Frequency Domain Packet Scheduling

DEFF Research Database (Denmark)

Wei, Na; Pokhariyal, Akhilesh; Sørensen, Troels Bundgaard

2008-01-01

the performance bounds of SDM-FDPS. To facilitate the analysis, a unified SINR concept is utilized to make a fair comparison of MIMO schemes with different number of spatial streams. The effect of packet scheduling is included in the post-scheduling SINR distribution using an analytical model. Based on that...

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

Impact of Scheduling Policies on Control System Performance

DEFF Research Database (Denmark)

Schiøler, Henrik; Ravn, Anders Peter; Nielsen, Jens Frederik Dalsgaard

2003-01-01

It is well known that jitter has an impact on control system performance, and this is often used as an argument for static scheduling policies, e.g. a time triggered architecture. However, it is only completion jitter that seriously disturbs standard linear control algorithms in a way similar to ...

Adaptive scheduling with postexamining user selection under nonidentical fading

KAUST Repository

Gaaloul, Fakhreddine

2012-11-01

This paper investigates an adaptive scheduling algorithm for multiuser environments with statistically independent but nonidentically distributed (i.n.d.) channel conditions. The algorithm aims to reduce feedback load by sequentially and arbitrarily examining the user channels. It also provides improved performance by realizing postexamining best user selection. The first part of the paper presents new formulations for the statistics of the signal-to-noise ratio (SNR) of the scheduled user under i.n.d. channel conditions. The second part capitalizes on the findings in the first part and presents various performance and processing complexity measures for adaptive discrete-time transmission. The results are then extended to investigate the effect of outdated channel estimates on the statistics of the scheduled user SNR, as well as some performance measures. Numerical results are provided to clarify the usefulness of the scheduling algorithm under perfect or outdated channel estimates. © 1967-2012 IEEE.

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

Science.gov (United States)

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

2016-09-13

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

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance.

Science.gov (United States)

Carter, Christine E; Grahn, Jessica A

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the "contextual interference effect." While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

Science.gov (United States)

Carter, Christine E.; Grahn, Jessica A.

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

Optimizing music learning: Exploring how blocked and interleaved practice schedules affect advanced performance

Directory of Open Access Journals (Sweden)

Christine E Carter

2016-08-01

Full Text Available Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the contextual interference effect. While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (twelve minutes per piece and a second concerto exposition and technical excerpt to practice in an interleaved schedule (three minutes per piece, alternating until a total of twelve minutes of practice were completed on each piece. Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated

The Effects of Work-Reinforcer Schedules on Performance and Preference in Students with Autism

Science.gov (United States)

Bukala, Magdalena; Hu, Meng Yao; Lee, Ronald; Ward-Horner, John C.; Fienup, Daniel M.

2015-01-01

This study investigated performance under and preference for continuous and discontinuous work-reinforcer schedules in 3 students who had been diagnosed with autism. Under continuous schedules, participants completed all work and consumed all reinforcers in contiguous units. Under discontinuous schedules, work and reinforcer access were broken up…

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.

Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

DEFF Research Database (Denmark)

Izosimov, Viacheslav; Pop, Paul; Eles, Petru

2012-01-01

In this article, we propose a strategy for the synthesis of fault-tolerant schedules and for the mapping of fault-tolerant applications. Our techniques handle transparency/performance trade-offs and use the faultoccurrence information to reduce the overhead due to fault tolerance. Processes...... and messages are statically scheduled, and we use process reexecution for recovering from multiple transient faults. We propose a finegrained transparent recovery, where the property of transparency can be selectively applied to processes and messages. Transparency hides the recovery actions in a selected part...... of the application so that they do not affect the schedule of other processes and messages. While leading to longer schedules, transparent recovery has the advantage of both improved debuggability and less memory needed to store the faulttolerant schedules....

Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

Science.gov (United States)

Xia, Feng; Ma, Longhua; Peng, Chen; Sun, Youxian; Dong, Jinxiang

2008-01-01

There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS) scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting cross-layer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An event-driven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN. PMID:27879934

Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

Directory of Open Access Journals (Sweden)

Jinxiang Dong

2008-07-01

Full Text Available There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting crosslayer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An eventdriven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN.

Impact of flexible scheduling on employee performance regarding stress and work-family conflict

OpenAIRE

Raja Abdul Ghafoor Khan; Furqan Ahmad Khan; Dr. Muhammad Aslam Khan; Mohsin Shakeel

2011-01-01

Stress, work-family conflicts and flexible scheduling are three of the most important elements in organizational studies. The focus of current study is to understand the effect of Stress,work family conflicts and flexible scheduling on employee’s performance and also to understand whether flexible scheduling helps in reducing stress and work-family conflicts or not. The back bone of this study is the secondary data comprised of comprehensive literature review. A survey has also been conducted...

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

International Nuclear Information System (INIS)

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

1976-01-01

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

Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect

Directory of Open Access Journals (Sweden)

Mingbao Cheng

2013-01-01

Full Text Available We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect. The objective is to minimize the performance criteria of makespan and the total flow time. For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect. Furthermore, by using the shortest total processing times first (STPT rule, we construct the worst-case performance ratios for both criteria. Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.

Message Scheduling and Forwarding in Congested DTNs

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem

2012-01-01

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

Message Scheduling and Forwarding in Congested DTNs

KAUST Repository

Elwhishi, Ahmed

2012-08-19

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

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

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.

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.

Relative performance of priority rules for hybrid flow shop scheduling with setup times

Directory of Open Access Journals (Sweden)

Helio Yochihiro Fuchigami

2015-12-01

Full Text Available This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent setup times. This production environment is a multistage system with unidirectional flow of jobs, wherein each stage may contain multiple machines available for processing. The optimized measure was the total time to complete the schedule (makespan. The aim was to propose new priority rules to support the schedule and to evaluate their relative performance at the production system considered by the percentage of success, relative deviation, standard deviation of relative deviation, and average CPU time. Computational experiments have indicated that the rules using ascending order of the sum of processing and setup times of the first stage (SPT1 and SPT1_ERD performed better, reaching together more than 56% of success.

Performance of Downlink Frequency Domain Packet Scheduling for the UTRAN Long Term Evolution

DEFF Research Database (Denmark)

Pokhariyal, Akhilesh; Kolding, Troels E.; Mogensen, Preben

2006-01-01

-blind, but time-opportunistic scheduling, FDPS shows gain in both average system capacity and cell-edge data rates on the order of 40%. However, FDPS performance is shown to depend significantly on the frequency-domain scheduling resolution as well as the accuracy of the channel state reports. Assuming Typical...... Urban channel profile, studies show that the scheduling resolution should preferably be as low as 375 kHz to yield significant FDPS gain and the std. of the error of radio state reports need to be kept within 1.5-2 dB....

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

Science.gov (United States)

Verhoeven, F Martijn; Newell, Karl M

2018-06-01

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

INFLUENCE OF SCALE RATIO, ASPECT RATIO, AND PLANFORM ON THE PERFORMANCE OF SUPERCAVITATING HYDROFOILS.

Science.gov (United States)

performance of supercavitating hydrofoils. No appreciable scale effect was found for scale ratios up to 3 in the fully-cavitating flow region. The...overall performance of the hydrofoil by increasing the aspect ratio above 3, and (2) moderate taper ratio seems to be advantageous in view of the overall performance of supercavitating hydrofoils. (Author)

Using Ratio Analysis to Evaluate Financial Performance.

Science.gov (United States)

Minter, John; And Others

1982-01-01

The ways in which ratio analysis can help in long-range planning, budgeting, and asset management to strengthen financial performance and help avoid financial difficulties are explained. Types of ratios considered include balance sheet ratios, net operating ratios, and contribution and demand ratios. (MSE)

Analytical Evaluation of the Performance of Proportional Fair Scheduling in OFDMA-Based Wireless Systems

Directory of Open Access Journals (Sweden)

Mohamed H. Ahmed

2012-01-01

Full Text Available This paper provides an analytical evaluation of the performance of proportional fair (PF scheduling in Orthogonal Frequency-Division Multiple Access (OFDMA wireless systems. OFDMA represents a promising multiple access scheme for transmission over wireless channels, as it combines the orthogonal frequency division multiplexing (OFDM modulation and subcarrier allocation. On the other hand, the PF scheduling is an efficient resource allocation scheme with good fairness characteristics. Consequently, OFDMA with PF scheduling represents an attractive solution to deliver high data rate services to multiple users simultaneously with a high degree of fairness. We investigate a two-dimensional (time slot and frequency subcarrier PF scheduling algorithm for OFDMA systems and evaluate its performance analytically and by simulations. We derive approximate closed-form expressions for the average throughput, throughput fairness index, and packet delay. Computer simulations are used for verification. The analytical results agree well with the results from simulations, which show the good accuracy of the analytical expressions.

Business sustainability performance measurement: Eco-ratio analysis

Directory of Open Access Journals (Sweden)

Collins C. Ngwakwe

2016-12-01

Full Text Available Eco-aware customers and stakeholders are demanding for a measurement that links environmental performance with other business operations. To bridge this seemingly measurement gap, this paper suggests ‘Eco-Ratio Analysis’ and proposes an approach for conducting eco-ratio analysis. It is argued that since accounting ratios function as a tool for evaluating corporate financial viability by management and investors, eco-ratio analysis should be brought to the fore to provide a succinct measurement about the linkage between environmental performance and conventional business performance. It is hoped that this suggestion will usher in a nuance debate and approach in the teaching, research and practice of environmental management and sustainability accounting

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.

Power/performance trade-offs in real-time SDRAM command scheduling

OpenAIRE

Goossens, S.L.M.; Chandrasekar, K.; Akesson, K.B.; Goossens, K.G.W.

2016-01-01

Real-time safety-critical systems should provide hard bounds on an applications’ performance. SDRAM controllers used in this domain should therefore have a bounded worst-case bandwidth, response time, and power consumption. Existing works on real-time SDRAM controllers only consider a narrow range of memory devices, and do not evaluate how their schedulers’ performance varies across memory generations, nor how the scheduling algorithm influences power usage. The extent to which the number of ...

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

Science.gov (United States)

Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary

2017-12-01

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

Application of Performance Ratios in Portfolio Optimization

Directory of Open Access Journals (Sweden)

Aleš Kresta

2015-01-01

Full Text Available The cornerstone of modern portfolio theory was established by pioneer work of Harry Markowitz. Based on his mean-variance framework, Sharpe formulated his well-known Sharpe ratio aiming to measure the performance of mutual funds. The contemporary development in computer’s computational power allowed to apply more complex performance ratios, which take into account also higher moments of return probability distribution. Although these ratios were proposed to help the investors to improve the results of portfolio optimization, we empirically demonstrated in our paper that this may not necessarily be true. On the historical dataset of DJIA components we empirically showed that both Sharpe ratio and MAD ratio outperformed Rachev ratio. However, for Rachev ratio we assumed only one level of parameters value. Different set-ups of parameters may provide different results and thus further analysis is certainly required.

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.

Effects of response-independent stimuli on fixed-interval and fixed-ratio performance of rats: a model for stressful disruption of cyclical eating patterns.

Science.gov (United States)

Reed, Phil

2011-03-01

Binge eating is often associated with stress-induced disruption of typical eating patterns. Three experiments were performed with the aim of developing a potential model for this effect by investigating the effect of presenting response-independent stimuli on rats' lever-pressing for food reinforcement during both fixed-interval (FI) and fixed-ratio (FR) schedules of reinforcement. In Experiment 1, a response-independent brief tone (500-ms, 105-dB, broadband, noisy signal, ranging up to 16 kHz, with spectral peaks at 3 and 500 Hz) disrupted the performance on an FI 60-s schedule. Responding with the response-independent tone was more vigorous than in the absence of the tone. This effect was replicated in Experiment 2 using a within-subject design, but no such effect was noted when a light was employed as a disrupter. In Experiment 3, a 500-ms tone, but not a light, had a similar effect on rats' performance on FR schedules. This tone-induced effect may represent a release from response-inhibition produced by an aversive event. The implications of these results for modeling binge eating are discussed.

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.

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.

Annual Equivalent Value, Benefit Cost Ratio, and Composite Performance Index as Valuation Appraisal Support of Teakwood Plantation

Directory of Open Access Journals (Sweden)

Sugiharto Soeleman

2014-04-01

Full Text Available Teak (Tectona grandis L.f is a premium high-value hardwood species being viewed as the most preferred species for investment opportunity. Recently, there has been a gradual move away from state control of teakwood plantation toward the participation of private enterprises. Several enterprises offer investment opportunity of teakwood plantation in which one of the main selling points being offered is a quick harvesting schedule. A quick harvesting time, however, might not provide the best outcome to the investors. This research exercise and compare the valuation appraisal of different harvesting schedules. The research focused on project planning, enterprise budget, financial projection, and valuation measurements to arrive at overall appraisal. To avoid any possible bias of individual investor's preference on common valuation criteria such as total investment, net cash flow (NCF, net present value (NPV, internal rate of return (IRR, profit on investment (P/I, and payback period (PBP, 3 otherS criteria namely benefit cost ratio (BCR, annual equivalent value (AEV, and composite performance index (CPI have been applied to arrive at a more fair valuation. It is concluded that the longer the harvesting schedule, the better valuation outcome could be achieved, and therefore, investors should critically review any investment proposal in accordance to their preference on valuation criteria.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment

Science.gov (United States)

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing. PMID:28467505

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.

Science.gov (United States)

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Abdulhamid, Shafi'i Muhammad; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

Slow phasic changes in nucleus accumbens dopamine release during fixed ratio acquisition: a microdialysis study.

Science.gov (United States)

Segovia, K N; Correa, M; Salamone, J D

2011-11-24

Nucleus accumbens dopamine (DA) is a critical component of the brain circuitry regulating behavioral output during reinforcement-seeking behavior. Several studies have investigated the characteristics of accumbens DA release during the performance of well-learned operant behaviors, but relatively few have focused on the initial acquisition of particular instrumental behaviors or operant schedules. The present experiments focused on the initial acquisition of operant performance on a reinforcement schedule by studying the transition from a fixed ratio 1 (FR1) schedule to another operant schedule with a higher ratio requirement (i.e. fixed ratio 5 [FR5]). Microdialysis sessions were conducted in different groups of rats that were tested on either the FR1 schedule; the first, second, or third day of FR5 training; or after weeks of FR5 training. Consistent with previous studies, well-trained rats performing on the FR5 schedule after weeks of training showed significant increases in extracellular DA in both core and shell subregions of nucleus accumbens during the behavioral session. On the first day of FR5 training, there was a substantial increase in DA release in nucleus accumbens shell (i.e. approximately 300% of baseline). In contrast, accumbens core DA release was greatest on the second day of FR5 training. In parallel experiments, DA release in core and shell subregions did not significantly increase during free consumption of the same high carbohydrate food pellets that were used in the operant experiments, despite the very high levels of food intake in experienced rats. However, in rats exposed to the high-carbohydrate food for the first time, there was a tendency for extracellular DA to show a small increase. These results demonstrate that transient increases in accumbens DA release occur during the initial acquisition of ratio performance, and suggest that core and shell subregions show different temporal patterns during acquisition of instrumental behavior

A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

KAUST Repository

Elwhishi, Ahmed

2013-05-01

Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.

Why is digit ratio correlated to sports performance?

Science.gov (United States)

Kim, Tae Beom; Kim, Khae Hawn

2016-12-01

Second to fourth digit ratio is the ratio of second to fourth digit length. It has been known that digit ratio is sexually dimorphic in humans, such that males tend to have lower digit ratio (longer fourth digits relative to second digits) than females. Digit ratio is thought to be a biomarker of the balance between fetal testosterone (FT) and fetal estrogen (FE) in a relatively narrow developmental window at the end of the first trimester of pregnancy. On the contrary, the relationships between digit ratio and levels of sex steroids in adults are not clear. Most correlational studies between digit ratio and adult sex steroids have revealed that this association is statistically not significant. However, for many years, a lot of researches showed negative relationships between digit ratio and sports performance such as rugby, surfing, rowing, sprinting, endurance, and hand grip strength. Here, we discuss possible mechanisms about the relationships between digit ratio and sports performance.

1 Tbit/inch2 Recording in Angular-Multiplexing Holographic Memory with Constant Signal-to-Scatter Ratio Schedule

Science.gov (United States)

Hosaka, Makoto; Ishii, Toshiki; Tanaka, Asato; Koga, Shogo; Hoshizawa, Taku

2013-09-01

We developed an iterative method for optimizing the exposure schedule to obtain a constant signal-to-scatter ratio (SSR) to accommodate various recording conditions and achieve high-density recording. 192 binary images were recorded in the same location of a medium in approximately 300×300 µm2 using an experimental system embedded with a blue laser diode with a 405 nm wavelength and an objective lens with a 0.85 numerical aperture. The recording density of this multiplexing corresponds to 1 Tbit/in.2. The recording exposure time was optimized through the iteration of a three-step sequence consisting of total reproduced intensity measurement, target signal calculation, and recording energy density calculation. The SSR of pages recorded with this method was almost constant throughout the entire range of the reference beam angle. The signal-to-noise ratio of the sampled pages was over 2.9 dB, which is higher than the reproducible limit of 1.5 dB in our experimental system.

Performance Analysis of Stop-Skipping Scheduling Plans in Rail Transit under Time-Dependent Demand.

Science.gov (United States)

Cao, Zhichao; Yuan, Zhenzhou; Zhang, Silin

2016-07-13

Stop-skipping is a key method for alleviating congestion in rail transit, where schedules are sometimes difficult to implement. Several mechanisms have been proposed and analyzed in the literature, but very few performance comparisons are available. This study formulated train choice behavior estimation into the model considering passengers' perception. If a passenger's train path can be identified, this information would be useful for improving the stop-skipping schedule service. Multi-performance is a key characteristic of our proposed five stop-skipping schedules, but quantified analysis can be used to illustrate the different effects of well-known deterministic and stochastic forms. Problems in the novel category of forms were justified in the context of a single line rather than transit network. We analyzed four deterministic forms based on the well-known A/B stop-skipping operating strategy. A stochastic form was innovatively modeled as a binary integer programming problem. We present a performance analysis of our proposed model to demonstrate that stop-skipping can feasibly be used to improve the service of passengers and enhance the elasticity of train operations under demand variations along with an explicit parametric discussion.

Performance Analysis of Stop-Skipping Scheduling Plans in Rail Transit under Time-Dependent Demand

Directory of Open Access Journals (Sweden)

Zhichao Cao

2016-07-01

Full Text Available Stop-skipping is a key method for alleviating congestion in rail transit, where schedules are sometimes difficult to implement. Several mechanisms have been proposed and analyzed in the literature, but very few performance comparisons are available. This study formulated train choice behavior estimation into the model considering passengers’ perception. If a passenger’s train path can be identified, this information would be useful for improving the stop-skipping schedule service. Multi-performance is a key characteristic of our proposed five stop-skipping schedules, but quantified analysis can be used to illustrate the different effects of well-known deterministic and stochastic forms. Problems in the novel category of forms were justified in the context of a single line rather than transit network. We analyzed four deterministic forms based on the well-known A/B stop-skipping operating strategy. A stochastic form was innovatively modeled as a binary integer programming problem. We present a performance analysis of our proposed model to demonstrate that stop-skipping can feasibly be used to improve the service of passengers and enhance the elasticity of train operations under demand variations along with an explicit parametric discussion.

2016 Rio Olympic Games: Can the schedule of events compromise athletes' performance?

Science.gov (United States)

Rosa, João Paulo P; Rodrigues, Dayane F; Silva, Andressa; de Moura Simim, Mário Antônio; Costa, Varley T; Noce, Franco; de Mello, Marco Túlio

2016-01-01

The organizing committee of the 2016 Rio Olympic Games recently announced that some of the preliminary and final competitions will be held at night. The present article discusses the potential harmful effects of these late-night competitions on sleep, circadian rhythms and athletic performance during the Olympic Games. Specifically, night-time competition could lead to injury and may compromise an athlete's decision-making, attentional, physiological and other processes. Consequently, these impacts could negatively affect the performance of athletes and their teams. Thus, it is suggested that technical commissions take special care when creating strategies to minimize harm to the athletes by considering factors such as light exposure, melatonin intake, sleep hygiene and scheduled naps, and training at local competition time. Furthermore, it is necessary for specialists in chronobiology and sleep to engage with members of the national teams to develop an activity schedule for physical, technical, tactical and psychological preparation that accounts for circadian rhythms, thereby creating the best possible environment for the athletes to achieve their ideal performance.

Intercell scheduling: A negotiation approach using multi-agent coalitions

Science.gov (United States)

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

2016-10-01

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

Workflow as a Service in the Cloud: Architecture and Scheduling Algorithms

Science.gov (United States)

Wang, Jianwu; Korambath, Prakashan; Altintas, Ilkay; Davis, Jim; Crawl, Daniel

2017-01-01

With more and more workflow systems adopting cloud as their execution environment, it becomes increasingly challenging on how to efficiently manage various workflows, virtual machines (VMs) and workflow execution on VM instances. To make the system scalable and easy-to-extend, we design a Workflow as a Service (WFaaS) architecture with independent services. A core part of the architecture is how to efficiently respond continuous workflow requests from users and schedule their executions in the cloud. Based on different targets, we propose four heuristic workflow scheduling algorithms for the WFaaS architecture, and analyze the differences and best usages of the algorithms in terms of performance, cost and the price/performance ratio via experimental studies. PMID:29399237

Workflow as a Service in the Cloud: Architecture and Scheduling Algorithms.

Science.gov (United States)

Wang, Jianwu; Korambath, Prakashan; Altintas, Ilkay; Davis, Jim; Crawl, Daniel

2014-01-01

With more and more workflow systems adopting cloud as their execution environment, it becomes increasingly challenging on how to efficiently manage various workflows, virtual machines (VMs) and workflow execution on VM instances. To make the system scalable and easy-to-extend, we design a Workflow as a Service (WFaaS) architecture with independent services. A core part of the architecture is how to efficiently respond continuous workflow requests from users and schedule their executions in the cloud. Based on different targets, we propose four heuristic workflow scheduling algorithms for the WFaaS architecture, and analyze the differences and best usages of the algorithms in terms of performance, cost and the price/performance ratio via experimental studies.

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

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

Science.gov (United States)

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

2017-09-01

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

Optimal deployment schedule of an active twist rotor for performance enhancement and vibration reduction in high-speed flights

Directory of Open Access Journals (Sweden)

Young H. YOU

2017-08-01

Full Text Available The best active twist schedules exploiting various waveform types are sought taking advantage of the global search algorithm for the reduction of hub vibration and/or power required of a rotor in high-speed conditions. The active twist schedules include two non-harmonic inputs formed based on segmented step functions as well as the simple harmonic waveform input. An advanced Particle Swarm assisted Genetic Algorithm (PSGA is employed for the optimizer. A rotorcraft Computational Structural Dynamics (CSD code CAMRAD II is used to perform the rotor aeromechanics analysis. A Computation Fluid Dynamics (CFD code is coupled with CSD for verification and some physical insights. The PSGA optimization results are verified against the parameter sweep study performed using the harmonic actuation. The optimum twist schedules according to the performance and/or vibration reduction strategy are obtained and their optimization gains are compared between the actuation cases. A two-phase non-harmonic actuation schedule demonstrates the best outcome in decreasing the power required while a four-phase non-harmonic schedule results in the best vibration reduction as well as the simultaneous reductions in the power required and vibration. The mechanism of reduction to the performance gains is identified illustrating the section airloads, angle-of-attack distribution, and elastic twist deformation predicted by the present approaches.

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.

PERFORMANCE ANALYSIS OF AI BASED QOS SCHEDULER FOR MOBILE WIMAX

Directory of Open Access Journals (Sweden)

D. David Neels Pon Kumar

2012-09-01

Full Text Available Interest in broadband wireless access (BWA has been growing due to increased user mobility and the need for data access at all times. IEEE 802.16e based WiMAX networks promise the best available quality of experience for mobile data service users. WiMAX networks incorporate several Quality of Service (QoS mechanisms at the Media Access Control (MAC level for guaranteed services for multimedia viz. data, voice and video. The problem of assuring QoS is how to allocate available resources among users to meet the QoS criteria such as delay, delay jitter, fairness and throughput requirements. IEEE standard does not include a standard scheduling mechanism and leaves it for various implementer differentiations. Although a lot of the real-time and non real-time packet scheduling schemes has been proposed, it needs to be modified to apply to Mobile WiMAX system that supports five kinds of service classes. In this paper, we propose a novel Priority based Scheduling scheme that uses Artificial Intelligence to support various services by considering the QoS constraints of each class. The simulation results show that slow mobility does not affect the performances and faster mobility and the increment in users beyond a particular load have their say in defining average throughput, average per user throughput, fairness index, average end to end delay and average delay jitter. Nevertheless the results are encouraging that the proposed scheme provides QoS support for each class efficiently.

Exclusive Preference Develops Less Readily on Concurrent Ratio Schedules with Wheel-Running than with Sucrose Reinforcement

Science.gov (United States)

Belke, Terry W.

2010-01-01

Previous research suggested that allocation of responses on concurrent schedules of wheel-running reinforcement was less sensitive to schedule differences than typically observed with more conventional reinforcers. To assess this possibility, 16 female Long Evans rats were exposed to concurrent FR FR schedules of reinforcement and the schedule…

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.

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

Science.gov (United States)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

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

Biomonitoring of physiological status and cognitive performance of underway submariners undergoing a novel watch-standing schedule

Science.gov (United States)

Duplessis, C. A.; Cullum, M. E.; Crepeau, L. J.

2005-05-01

Submarine watch-standers adhere to a 6 hour-on, 12 hour-off (6/12) watch-standing schedule, yoking them to an 18-hr day, engendering circadian desynchronization and chronic sleep deprivation. Moreover, the chronic social crowding, shift work, and confinement of submarine life provide additional stressors known to correlate with elevated secretory immunoglobulin A (sIgA) and cortisol levels, reduced performance, immunologic dysfunction, malignancies, infections, gastrointestinal illness, coronary disease, anxiety, and depression. We evaluated an alternative, compressed, fixed work schedule designed to enhance circadian rhythm entrainment, sleep hygiene, performance, and health on 10 underway submariners, who followed the alternative and 6/12 schedules for approximately 2 weeks each. We measured subjects" sleep, cognitive performance, and salivary biomarker levels. Pilot analysis of the salivary data on one subject utilizing ELISA suggests elevated biomarker levels of stress. Average PM cortisol levels were 0.2 μg/L (normal range: nondetectable - 0.15 μg/L), and mean sIgA levels were 562 μg/ml (normal range: 100-500 μg/ml). Future research exploiting real-time salivary bioassays, via fluorescent polarimetry technology, identified by the Office of Naval Research (ONR) as a future Naval requirement, allows researchers to address correlations between stress-induced elaboration of salivary biomarkers with physiological and performance decrements, thereby fostering insight into the underway submariner"s psychoimmunological status. This may help identify strategies that enhance resilience to stressors. Specifically, empirically-based modeling can identify optimal watch-standing schedules and stress-mitigating procedures -- within the operational constraints of the submarine milieu and the mission --that foster improved circadian entrainment and reduced stress reactivity, enhancing physiological health, operational performance, safety, and job satisfaction.

Criteria and procedures for validating biomathematical models of human performance and fatigue : procedures for analysis of work schedules.

Science.gov (United States)

2013-01-01

Each railroad covered by 49 CFR 228.407 must perform an analysis of the work schedules of its train employees who are engaged in commuter or intercity rail passenger transportation and identify those schedules that, if worked by such a train employee...

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

Directory of Open Access Journals (Sweden)

Dandan Wang

2014-01-01

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

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.

Concurrent progressive-ratio schedules: built-in controls in the study of delayed reward efficacy.

Science.gov (United States)

Jarmolowicz, David P; Hudnall, Jennifer L

2014-08-15

Delayed rewards maintain lower rates of operant responding than immediate rewards, and when given a choice between immediate and delayed rewards, individuals typically choose the immediate reward, even when it is smaller (a phenomenon called delay discounting). The behavioral and neural mechanisms underlying these behavioral patterns, however, are not conclusively understood. The present study developed a method to examine the efficacy of delayed rewards in a way that is suitable for pharmacological manipulation of delayed reward efficacy (while controlling for general changes in reward efficacy). The progressive ratio (PR) paradigm often used to examine reward efficacy was modified such that two PR schedules for lever pressing concurrently yet independently were presented. Across a series of conditions, a range of delays (3-81s) were arranged on one of the levers while the reward on the other lever remained immediate. PR breakpoints (the highest ratio completed on each lever, our measure of reward efficacy) systematically decreased on the delayed, but not on the immediate reward lever, suggesting that delays decreased reward efficacy. This decrease in breakpoint resulted in bias in within-session responding that was accounted for by models that adjusted reward value by the delay to that reward. Unlike the standard PR paradigm, the present arrangement provided the controls needed to differentiate delay specific from general changes in reward efficacy. The present method should be helpful in the study of the behavioral and neural mechanisms of delayed reward efficacy. Modifications of the present paradigm should be useful for pharmacological studies. Copyright © 2014 Elsevier B.V. All rights reserved.

Middle School A/B Block and Traditional Scheduling: An Analysis of Math and Reading Performance by Race

Science.gov (United States)

Gill, Willie Wallicia Allen

2011-01-01

The purpose of this quantitative study was to examine whether a difference existed in the percentage performance of students earning a pass/advanced score on the Standards of Learning (SOL) Test in math and reading in Virginia's Region IV for schools using an A/B block schedule and those using a traditional schedule. The research also examined if…

Parallel Machine Scheduling with Batch Delivery to Two Customers

Directory of Open Access Journals (Sweden)

Xueling Zhong

2015-01-01

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

Performance analysis of switch-based multiuser scheduling schemes with adaptive modulation in spectrum sharing systems

KAUST Repository

Qaraqe, Marwa

2014-04-01

This paper focuses on the development of multiuser access schemes for spectrum sharing systems whereby secondary users are allowed to share the spectrum with primary users under the condition that the interference observed at the primary receiver is below a predetermined threshold. In particular, two scheduling schemes are proposed for selecting a user among those that satisfy the interference constraint and achieve an acceptable signal-to-noise ratio level. The first scheme focuses on optimizing the average spectral efficiency by selecting the user that reports the best channel quality. In order to alleviate the relatively high feedback required by the first scheme, a second scheme based on the concept of switched diversity is proposed, where the base station (BS) scans the secondary users in a sequential manner until a user whose channel quality is above an acceptable predetermined threshold is found. We develop expressions for the statistics of the signal-to-interference and noise ratio as well as the average spectral efficiency, average feedback load, and the delay at the secondary BS. We then present numerical results for the effect of the number of users and the interference constraint on the optimal switching threshold and the system performance and show that our analysis results are in perfect agreement with the numerical results. © 2014 John Wiley & Sons, Ltd.

Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

Directory of Open Access Journals (Sweden)

Madani Sajjad

2011-01-01

Full Text Available Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a the distance of the node from the sink node, (b the importance of the node's location from connectivity's perspective, and (c if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.

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

Influences on Cocaine Tolerance Assessed under a Multiple Conjunctive Schedule of Reinforcement

Science.gov (United States)

Yoon, Jin Ho; Branch, Marc N.

2009-01-01

Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the…

Improving the performance of sorter systems by scheduling inbound containers

NARCIS (Netherlands)

Haneyah, S.W.A.; Schutten, Johannes M.J.; Fikse, K.

2013-01-01

This paper addresses the inbound containers scheduling problem for automated sorter systems in two different industrial sectors: parcel & postal sorting and baggage handling. We build on existing literature, particularly on the dynamic load balancing algorithm designed for the parcel hub scheduling

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

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.

Analysis of Application Power and Schedule Composition in a High Performance Computing Environment

Energy Technology Data Exchange (ETDEWEB)

Elmore, Ryan [National Renewable Energy Lab. (NREL), Golden, CO (United States); Gruchalla, Kenny [National Renewable Energy Lab. (NREL), Golden, CO (United States); Phillips, Caleb [National Renewable Energy Lab. (NREL), Golden, CO (United States); Purkayastha, Avi [National Renewable Energy Lab. (NREL), Golden, CO (United States); Wunder, Nick [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2016-01-05

As the capacity of high performance computing (HPC) systems continues to grow, small changes in energy management have the potential to produce significant energy savings. In this paper, we employ an extensive informatics system for aggregating and analyzing real-time performance and power use data to evaluate energy footprints of jobs running in an HPC data center. We look at the effects of algorithmic choices for a given job on the resulting energy footprints, and analyze application-specific power consumption, and summarize average power use in the aggregate. All of these views reveal meaningful power variance between classes of applications as well as chosen methods for a given job. Using these data, we discuss energy-aware cost-saving strategies based on reordering the HPC job schedule. Using historical job and power data, we present a hypothetical job schedule reordering that: (1) reduces the facility's peak power draw and (2) manages power in conjunction with a large-scale photovoltaic array. Lastly, we leverage this data to understand the practical limits on predicting key power use metrics at the time of submission.

Fatigue, Work Schedules, and Perceived Performance in Bedside Care Nurses.

Science.gov (United States)

Sagherian, Knar; Clinton, Michael E; Abu-Saad Huijer, Huda; Geiger-Brown, Jeanne

2017-07-01

Hospital nurses are expected to maintain optimal work performance; yet, fatigue can threaten safe practice and result in unfavorable patient outcomes. This descriptive cross-sectional study explored the association between fatigue, work schedules, and perceived work performance among nurses. The study sample included 77 bedside nurses who were mostly female, single, and between 20 and 29 years of age. The majority worked 8-hour shifts and overtime. Nurses who worked during off days reported significantly higher chronic fatigue compared with those nurses who took time off. Nurses who reported feeling refreshed after sleep had significantly less chronic and acute fatigue and more intershift recovery. Nurses with acute and chronic fatigue perceived poorer physical performance. Also, nurses who reported chronic fatigue perceived they were less alert and less able to concentrate when providing patient care. Less effective communication was also associated with acute and chronic fatigue. In conclusion, fatigue has safety implications for nurses' practice that should be monitored by nursing management.

Associations between shift schedule characteristics with sleep, need for recovery, health and performance measures for regular (semi-)continuous 3-shift systems.

Science.gov (United States)

van de Ven, Hardy A; Brouwer, Sandra; Koolhaas, Wendy; Goudswaard, Anneke; de Looze, Michiel P; Kecklund, Göran; Almansa, Josue; Bültmann, Ute; van der Klink, Jac J L

2016-09-01

In this cross-sectional study associations were examined between eight shift schedule characteristics with shift-specific sleep complaints and need for recovery and generic health and performance measures. It was hypothesized that shift schedule characteristics meeting ergonomic recommendations are associated with better sleep, need for recovery, health and performance. Questionnaire data were collected from 491 shift workers of 18 companies with 9 regular (semi)-continuous shift schedules. The shift schedule characteristics were analyzed separately and combined using multilevel linear regression models. The hypothesis was largely not confirmed. Relatively few associations were found, of which the majority was in the direction as expected. In particular early starts of morning shifts and many consecutive shifts seem to be avoided. The healthy worker effect, limited variation between included schedules and the cross-sectional design might explain the paucity of significant results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Progressive-Ratio Schedules and Applied Behavior Analysis

Science.gov (United States)

Poling, Alan

2010-01-01

Establishing appropriate relations between the basic and applied areas of behavior analysis has been of long and persistent interest to the author. In this article, the author illustrates that there is a direct relation between how hard an organism will work for access to an object or activity, as indexed by the largest ratio completed under a…

2B-Alert Web: An Open-Access Tool for Predicting the Effects of Sleep/Wake Schedules and Caffeine Consumption on Neurobehavioral Performance.

Science.gov (United States)

Reifman, Jaques; Kumar, Kamal; Wesensten, Nancy J; Tountas, Nikolaos A; Balkin, Thomas J; Ramakrishnan, Sridhar

2016-12-01

Computational tools that predict the effects of daily sleep/wake amounts on neurobehavioral performance are critical components of fatigue management systems, allowing for the identification of periods during which individuals are at increased risk for performance errors. However, none of the existing computational tools is publicly available, and the commercially available tools do not account for the beneficial effects of caffeine on performance, limiting their practical utility. Here, we introduce 2B-Alert Web, an open-access tool for predicting neurobehavioral performance, which accounts for the effects of sleep/wake schedules, time of day, and caffeine consumption, while incorporating the latest scientific findings in sleep restriction, sleep extension, and recovery sleep. We combined our validated Unified Model of Performance and our validated caffeine model to form a single, integrated modeling framework instantiated as a Web-enabled tool. 2B-Alert Web allows users to input daily sleep/wake schedules and caffeine consumption (dosage and time) to obtain group-average predictions of neurobehavioral performance based on psychomotor vigilance tasks. 2B-Alert Web is accessible at: https://2b-alert-web.bhsai.org. The 2B-Alert Web tool allows users to obtain predictions for mean response time, mean reciprocal response time, and number of lapses. The graphing tool allows for simultaneous display of up to seven different sleep/wake and caffeine schedules. The schedules and corresponding predicted outputs can be saved as a Microsoft Excel file; the corresponding plots can be saved as an image file. The schedules and predictions are erased when the user logs off, thereby maintaining privacy and confidentiality. The publicly accessible 2B-Alert Web tool is available for operators, schedulers, and neurobehavioral scientists as well as the general public to determine the impact of any given sleep/wake schedule, caffeine consumption, and time of day on performance of a

Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems

DEFF Research Database (Denmark)

Izosimov, Viacheslav; Pop, Paul; Eles, Petru

2006-01-01

of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional...... process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes....... such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints...

Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

KAUST Repository

Hossain, Md Jahangir

2010-07-01

In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet\\'s access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.

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.

Performance evaluation using bootstrapping DEA techniques: Evidence from industry ratio analysis

OpenAIRE

Halkos, George; Tzeremes, Nickolaos

2010-01-01

In Data Envelopment Analysis (DEA) context financial data/ ratios have been used in order to produce a unified measure of performance metric. However, several scholars have indicated that the inclusion of financial ratios create biased efficiency estimates with implications on firms’ and industries’ performance evaluation. There have been several DEA formulations and techniques dealing with this problem including sensitivity analysis, Prior-Ratio-Analysis and DEA/ output–input ratio analysis ...

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

Using Scheduled Ordering to Improve the Performance of Distribution Supply Chains

OpenAIRE

Lucy Gongtao Chen; Srinagesh Gavirneni

2010-01-01

We study a supply chain with one supplier and many retailers that face exogenous end-customer demands. The supplier and the retailers all try to minimize their own inventory-related costs. In contrast to the retailers' newsvendor-type ordering behavior (under which retailers may place orders freely in every period), we propose two scheduled ordering policies: the scheduled balanced ordering policy (SBOP) and the scheduled synchronized ordering policy (SSOP). Under both the SBOP and SSOP, reta...

Impact of touring, performance schedule, and definitions on 1-year injury rates in a modern dance company.

Science.gov (United States)

Bronner, Shaw; Wood, Lily

2017-11-01

There is ongoing debate about how to define injury in dance: the most encompassing one or a time-loss definition. We examined the relationship between touring, performance schedule and injury definition on injury rates in a professional modern dance company over one-year. In-house healthcare management tracked 35 dancers for work-related musculoskeletal injuries (WMSI), time-loss injuries (TLinj), complaints, and exposure. The year was divided into 6 segments to allow comparison of effects of performance, rehearsal, and touring. Injuries/segment were converted into injuries/1000-h dance exposure. We conducted negative binomial regression analysis to determine differences between segments, P ≤ 0.05. Twenty WMSI, 0.44 injuries/1000-h, were sustained over one-year. WMSI were 6 times more likely to occur in Segment-6, compared with other segments (incident rate ratio = 6.055, P = 0.031). The highest rate of TLinj and traumatic injuries also occurred in Segment-6, reflecting concentrated rehearsal, New York season and performances abroad. More overuse injuries occurred in Segment-2, an international tour, attributed to raked stages. Lack of methods to quantify performance other than injury may mask effects of touring on dancer's well-being. Tracking complaints permits understanding of stressors to specific body regions and healthcare utilisation; however, TLinj remain the most important injuries to track because they impact other dancers and organisational costs.

Analisis Performansi Algoritma Penjadwalan Log Rule dan Frame Level Schedule Skenario Multicell Pada Layer Mac LTE

Directory of Open Access Journals (Sweden)

Ridwan

2016-03-01

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

GABA(A) and dopamine receptors in the nucleus accumbens shell differentially influence performance of a water-reinforced progressive ratio task.

Science.gov (United States)

Covelo, Ignacio R; Wirtshafter, David; Stratford, Thomas R

2012-03-01

Several authors have shown that injections of the GABA(A) agonist muscimol into the medial shell region of the nucleus accumbens (AcbSh) result in large increases in food, but not water, intake. In previous studies we demonstrated that intra-AcbSh injections of either muscimol or of the indirect dopamine agonist amphetamine increase response output on a food-reinforced progressive ratio schedule. In the current experiment we extended these observations by examining the effects of muscimol and amphetamine injections on the performance of a water-reinforced progressive ratio task in mildly deprived animals. We found that muscimol did not affect the number of responses made in the water-reinforced task, even though a marked increase in responding was observed after amphetamine. Muscimol did, however, significantly increase food intake in the same animals. The results suggest that the enhancing effects of intra-AcbSh muscimol differ from those of amphetamine in that they are selective for food-reinforced behaviors. Copyright © 2011. Published by Elsevier Inc.

Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals

Directory of Open Access Journals (Sweden)

Michael Short

2017-07-01

Full Text Available Embedded systems consist of one or more processing units which are completely encapsulated by the devices under their control, and they often have stringent timing constraints associated with their functional specification. Previous research has considered the performance of different types of task scheduling algorithm and developed associated timing analysis techniques for such systems. Although preemptive scheduling techniques have traditionally been favored, rapid increases in processor speeds combined with improved insights into the behavior of non-preemptive scheduling techniques have seen an increased interest in their use for real-time applications such as multimedia, automation and control. However when non-preemptive scheduling techniques are employed there is a potential lack of error confinement should any timing errors occur in individual software tasks. In this paper, the focus is upon adding fault tolerance in systems using non-preemptive deadline-driven scheduling. Schedulability conditions are derived for fault-tolerant periodic and sporadic task sets experiencing bounded error arrivals under non-preemptive deadline scheduling. A timing analysis algorithm is presented based upon these conditions and its run-time properties are studied. Computational experiments show it to be highly efficient in terms of run-time complexity and competitive ratio when compared to previous approaches.

The impact of exposure to shift-based schedules on medical students

Directory of Open Access Journals (Sweden)

David A. Williams

2015-06-01

Full Text Available Background: With new resident duty-hour regulations, resident work schedules have progressively transitioned towards shift-based systems, sometimes resulting in increased team fragmentation. We hypothesized that exposure to shift-based schedules and subsequent team fragmentation would negatively affect medical student experiences during their third-year internal medicine clerkship. Design: As part of a larger national study on duty-hour reform, 67 of 150 eligible third-year medical students completed surveys about career choice, teaching and supervision, assessment, patient care, well-being, and attractiveness of a career in internal medicine after completing their internal medicine clerkship. Students who rotated to hospitals with shift-based systems were compared to those who did not. Non-demographic variables used a five-point Likert scale. Chi-squared and Fisher's exact tests were used to assess the relationships between exposure to shift-based schedules and student responses. Questions with univariate p≤0.1 were included in multivariable logistic regression models. Results: Thirty-six students (54% were exposed to shift-based schedules. Students exposed to shift-based schedules were less likely to perceive that their attendings were committed to teaching (odds ratio [OR] 0.35, 95% confidence interval [CI]: 0.13–0.90, p=0.01 or perceive that residents had sufficient exposure to assess their performance (OR 0.29, 95% CI: 0.09–0.91, p=0.03. However, those students were more likely to feel their interns were able to observe them at the bedside (OR 1.89, 95% CI: 1.08–3.13, p=0.02 and had sufficient exposure to assess their performance (OR 3.00, 95% CI: 1.01–8.86, p=0.05. Conclusions: These findings suggest that shift-based schedules designed in response to duty-hour reform may have important broader implications for the teaching environment.

The impact of exposure to shift-based schedules on medical students.

Science.gov (United States)

Williams, David A; Kogan, Jennifer R; Hauer, Karen E; Yamashita, Traci; Aagaard, Eva M

2015-01-01

With new resident duty-hour regulations, resident work schedules have progressively transitioned towards shift-based systems, sometimes resulting in increased team fragmentation. We hypothesized that exposure to shift-based schedules and subsequent team fragmentation would negatively affect medical student experiences during their third-year internal medicine clerkship. As part of a larger national study on duty-hour reform, 67 of 150 eligible third-year medical students completed surveys about career choice, teaching and supervision, assessment, patient care, well-being, and attractiveness of a career in internal medicine after completing their internal medicine clerkship. Students who rotated to hospitals with shift-based systems were compared to those who did not. Non-demographic variables used a five-point Likert scale. Chi-squared and Fisher's exact tests were used to assess the relationships between exposure to shift-based schedules and student responses. Questions with univariate p ≤ 0.1 were included in multivariable logistic regression models. Thirty-six students (54%) were exposed to shift-based schedules. Students exposed to shift-based schedules were less likely to perceive that their attendings were committed to teaching (odds ratio [OR] 0.35, 95% confidence interval [CI]: 0.13-0.90, p = 0.01) or perceive that residents had sufficient exposure to assess their performance (OR 0.29, 95% CI: 0.09-0.91, p = 0.03). However, those students were more likely to feel their interns were able to observe them at the bedside (OR 1.89, 95% CI: 1.08-3.13, p = 0.02) and had sufficient exposure to assess their performance (OR 3.00, 95% CI: 1.01-8.86, p = 0.05). These findings suggest that shift-based schedules designed in response to duty-hour reform may have important broader implications for the teaching environment.

Associations between shift schedule characteristics with sleep, need for recovery, health and performance measures for regular (semi-) continuous 3-shift systems

NARCIS (Netherlands)

van de Ven, Hardy A.; Brouwer, Sandra; Koolhaas, Wendy; Goudswaard, Anneke; de Looze, Michiel P.; Kecklund, Goran; Almansa, Josue; Bultmann, Ute; van der Klink, Jac J. L.

In this cross-sectional study associations were examined between eight shift schedule characteristics with shift-specific sleep complaints and need for recovery and generic health and performance measures. It was hypothesized that shift schedule characteristics meeting ergonomic recommendations are

Associations between shift schedule characteristics with sleep, need for recovery, health and performance measures for regular (semi-)continuous 3-shift systems

NARCIS (Netherlands)

van de Ven, Hardy A.; Brouwer, Sandra; Koolhaas, Wendy; Goudswaard, Anneke; de Looze, Michiel P.; Kecklund, Göran; Almansa, Josue; Bültmann, Ute; van der Klink, Jac J L

2016-01-01

In this cross-sectional study associations were examined between eight shift schedule characteristics with shift-specific sleep complaints and need for recovery and generic health and performance measures. It was hypothesized that shift schedule characteristics meeting ergonomic recommendations are

Dwell scheduling algorithm based on analyzing scheduling interval for digital array radar%数字阵列雷达波束驻留调度间隔分析算法

Institute of Scientific and Technical Information of China (English)

赵洪涛; 程婷; 何子述

2011-01-01

针对数字阵列雷达波束驻留调度问题,研究了基于调度间隔分析的调度算法.该算法综合分析了1个调度间隔内申请执行的波束驻留任务,且调度过程中进行了脉冲交错.调度准则充分考虑了任务的工作方式优先级和截止期,并以任务丢失率、实现价值率、系统时间利用率作为评估指标.仿真结果表明修正截止期准则主要强调任务的紧迫性,修正工作方式优先级主要强调任务的重要性,而截止期--工作方式优先级和工作方式--截止期调度准则可以在二者间更好地折中,在总体性能上要优于其他调度准则.%Aiming at the problem of beam-dwell scheduling for digital array radar, the algorithm based on analyzing scheduling interval was studied. This algorithm analyzed the dwells applied to be executed in one scheduling interval and introduced pulse interleaving. The scheduling criterion took both priorities and deadlines into account fully, with the Task Drop Ratio, Hit Value Ratio, Time Utilization Ratio as evaluation indexes. The simulation results showed that the modified deadline criterion mainly emphasized the urgency of tasks, while the modified priority criterion mainly emphasized the importance of tasks; the deadline-priority and priority-deadline scheduling criterions could make good balance between urgency and importance. thus superior to other criterions in overall performances.

Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

NARCIS (Netherlands)

Dimitrova, D.C.; Heijenk, G.; Berg, J.L. van den; Yankov, S.

2011-01-01

The Long Term Evolution (LTE) cellular technology is expected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the allocation of resources to active flows in

Integrated Fractional Load and Packet Scheduling for OFDMA Systems

DEFF Research Database (Denmark)

Monghal, Guillaume Damien; Kumar, S.; Pedersen, Klaus I.

2009-01-01

This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic....... This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality...

New Approaches to Irrigation Scheduling of Vegetables

Directory of Open Access Journals (Sweden)

Michael D. Cahn

2017-04-01

Full Text Available Using evapotranspiration (ET data for scheduling irrigations on vegetable farms is challenging due to imprecise crop coefficients, time consuming computations, and the need to simultaneously manage many fields. Meanwhile, the adoption of soil moisture monitoring in vegetables has historically been limited by sensor accuracy and cost, as well as labor required for installation, removal, and collection of readings. With recent improvements in sensor technology, public weather-station networks, satellite and aerial imaging, wireless communications, and cloud computing, many of the difficulties in using ET data and soil moisture sensors for irrigation scheduling of vegetables can now be addressed. Web and smartphone applications have been developed that automate many of the calculations involved in ET-based irrigation scheduling. Soil moisture sensor data can be collected through wireless networks and accessed using web browser or smartphone apps. Energy balance methods of crop ET estimation, such as eddy covariance and Bowen ratio, provide research options for further developing and evaluating crop coefficient guidelines of vegetables, while recent advancements in surface renewal instrumentation have led to a relatively low-cost tool for monitoring crop water requirement in commercial farms. Remote sensing of crops using satellite, manned aircraft, and UAV platforms may also provide useful tools for vegetable growers to evaluate crop development, plant stress, water consumption, and irrigation system performance.

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

PERFORMANCE ANALYSIS BETWEEN EXPLICIT SCHEDULING AND IMPLICIT SCHEDULING OF PARALLEL ARRAY-BASED DOMAIN DECOMPOSITION USING OPENMP

Directory of Open Access Journals (Sweden)

MOHAMMED FAIZ ABOALMAALY

2014-10-01

Full Text Available With the continuous revolution of multicore architecture, several parallel programming platforms have been introduced in order to pave the way for fast and efficient development of parallel algorithms. Back into its categories, parallel computing can be done through two forms: Data-Level Parallelism (DLP or Task-Level Parallelism (TLP. The former can be done by the distribution of data among the available processing elements while the latter is based on executing independent tasks concurrently. Most of the parallel programming platforms have built-in techniques to distribute the data among processors, these techniques are technically known as automatic distribution (scheduling. However, due to their wide range of purposes, variation of data types, amount of distributed data, possibility of extra computational overhead and other hardware-dependent factors, manual distribution could achieve better outcomes in terms of performance when compared to the automatic distribution. In this paper, this assumption is investigated by conducting a comparison between automatic and our newly proposed manual distribution of data among threads in parallel. Empirical results of matrix addition and matrix multiplication show a considerable performance gain when manual distribution is applied against automatic distribution.

Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

NARCIS (Netherlands)

Dimitrova, D.C.; Heijenk, Geert; van den Berg, Hans Leo; Yankov, S.; Masip Bruin, Xavier; Verchere, Dominique; Tsaoussidis, Vassilis; Yannuzzi, Marcelo

The Long Term Evolution (LTE) cellular technology is ex- pected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the al- location of resources to active flows

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.

A financial Ratio Analysis of Commercial Bank Performance in ...

African Journals Online (AJOL)

A financial Ratio Analysis of Commercial Bank Performance in South Africa. ... Journal Home > Vol 2, No 1 (2010) >. Log in or ... This paper investigates the performance of South Africa's commercial banking sector for the period 2005- 2009.

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.

Impact of Scheduling Policies on Control System Performance

DEFF Research Database (Denmark)

Schiøler, Henrik; Ravn, Anders Peter; Nielsen, Jens Frederik Dalsgaard

in the deterministic case and under white noise disturbances. The conclusion is that under very reasonable assumptions about robustness of control algorithms,they are insensitive to relase jitter, albeit strongly sensitive to completion jitter, thus priority based scheduling without preemption is may be preferable...

ANALISIS PENGARUH CAPITAL ADEQUACY RATIO (CAR) DAN NON PERFORMING LOAN (NPL) TERHADAP LOAN TO DEPOSIT RATIO (LDR) PADA BANK BUMN PERSERO DI INDONESIA

OpenAIRE

TANGKO, IRENE LASTRY FARDANI

2012-01-01

Non Performing Loan (NPL)Analisis Pengaruh Capital Adequacy Ratio (CAR) dan Non Performing Loan (NPL) Terhadap Loan to Deposit Ratio (LDR) Pada Bank BUMN Persero Di Indonesia Analysis ofEffect ofCapitalAdequacy Ratio (CAR) and theNon-PerformingLoan(NPL) AgainstLoanto DepositRatio (LDR) Thestate-owned bankinIndonesiaPersero Irene Lastry Fardani Tangko Otto R. Payangan Maat pono Penelitian ini bertujuan untuk menganalisis pengaruh Capital Adequacy Ratio (CAR) dan Non Performin...

Influences on cocaine tolerance assessed under a multiple conjunctive schedule of reinforcement.

Science.gov (United States)

Yoon, Jin Ho; Branch, Marc N

2009-11-01

Under multiple schedules of reinforcement, previous research has generally observed tolerance to the rate-decreasing effects of cocaine that has been dependent on schedule-parameter size in the context of fixed-ratio (FR) schedules, but not under the context of fixed-interval (FI) schedules of reinforcement. The current experiment examined the effects of cocaine on key-pecking responses of White Carneau pigeons maintained under a three-component multiple conjunctive FI (10 s, 30 s, & 120 s) FR (5 responses) schedule of food presentation. Dose-effect curves representing the effects of presession cocaine on responding were assessed in the context of (1) acute administration of cocaine (2) chronic administration of cocaine and (3) daily administration of saline. Chronic administration of cocaine generally resulted in tolerance to the response-rate decreasing effects of cocaine, and that tolerance was generally independent of relative FI value, as measured by changes in ED50 values. Daily administration of saline decreased ED50 values to those observed when cocaine was administered acutely. The results show that adding a FR requirement to FI schedules is not sufficient to produce schedule-parameter-specific tolerance. Tolerance to cocaine was generally independent of FI-parameter under the present conjunctive schedules, indicating that a ratio requirement, per se, is not sufficient for tolerance to be dependent on FI parameter.

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

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 EFFECTS OF INCREASE THE COMPRESSION RATIO ON PERFORMANCE OF A DIESEL ENGINE

Directory of Open Access Journals (Sweden)

Adnan PARLAK

2003-02-01

Full Text Available An optimisation of the Diesel cycle has been performed for power output and thermal efficiency with respect to compression ratio for various extreme temperature ratio. The relation between compression ratio and extreme temperature ratio, which gives optimum performance is derived. As the compression ratio of the diesel engine is increased in comparison to the optimum value of the engine, it is shown that the performance of the engine is decreased. The experimental study agrees with these results. In this study, compression ratio of a single cylinder pre-combustion chamber variable compression ratio Ricardo E6 type engine with the optimum compression ratio of 18.20 was increased to 19.60. As a results of this increase, specific fuel consumption was increased about 8 % and brake thermal efficiency was decreased about 7.5 %.

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

International Nuclear Information System (INIS)

Ghodasara, Kamlesh; Smith, Robin; Hwang, Sungwon

2014-01-01

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

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.

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.

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

Science.gov (United States)

Tang, Dunbing; Dai, Min

2015-09-01

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

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

Dental Student Study Strategies: Are Self-Testing and Scheduling Related to Academic Performance?

Science.gov (United States)

McAndrew, Maureen; Morrow, Christina S; Atiyeh, Lindsey; Pierre, Gaëlle C

2016-05-01

Self-testing, a strategy wherein a student actively engages in creating questions and answers from study materials to assist with studying, has been found to be especially advantageous because it enhances future retrieval of information. Studies have found correlations among students' grade point averages (GPAs), self-testing, and rereading study strategies, as well as the spacing of study sessions over time. The aim of this study was to assess relationships among dental students' study strategies, scheduling of study time, and academic achievement. A 16-item survey requesting information on study habits, study schedules, and GPAs was distributed to 358 second-year dental students at New York University College of Dentistry. Additionally, the survey asked students to report the average number of hours per week they devoted to studying for didactic courses and preparing for hands-on preclinical courses. Of the 358 students, 94 (26%) responded to the survey. The vast majority of the respondents reported utilizing self-testing and rereading study strategies. High performers (with higher GPAs) were more likely to use self-testing, especially with flashcards, and to space their studying over multiple sessions. Lower performing students were more likely to highlight or underline their notes and to mass their study sessions or cram. Longer hours devoted to studying and practicing for simulation courses were associated with stronger performance; lower performers reported spending significantly fewer hours practicing for simulation courses. Half of the dental students surveyed said that they felt their studying would be more productive in the morning, although 84% reported doing most of their studying in the evening or late night. Sound study decisions depend on accurate regulation of ongoing learning and appropriate use and timing of evidence-based study strategies, so these results suggest that dental students may require guidance in these areas.

Integrated Campaign Probabilistic Cost, Schedule, Performance, and Value for Program Office Support

Science.gov (United States)

Cornelius, David; Sasamoto, Washito; Daugherty, Kevin; Deacon, Shaun

2012-01-01

This paper describes an integrated assessment tool developed at NASA Langley Research Center that incorporates probabilistic analysis of life cycle cost, schedule, launch performance, on-orbit performance, and value across a series of planned space-based missions, or campaign. Originally designed as an aid in planning the execution of missions to accomplish the National Research Council 2007 Earth Science Decadal Survey, it utilizes Monte Carlo simulation of a series of space missions for assessment of resource requirements and expected return on investment. Interactions between simulated missions are incorporated, such as competition for launch site manifest, to capture unexpected and non-linear system behaviors. A novel value model is utilized to provide an assessment of the probabilistic return on investment. A demonstration case is discussed to illustrate the tool utility.

Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xi Jin

2016-08-01

Full Text Available Wireless sensor networks (WSNs have been widely used in industrial systems. Their real-time performance and reliability are fundamental to industrial production. Many works have studied the two aspects, but only focus on single criticality WSNs. Mixed criticality requirements exist in many advanced applications in which different data flows have different levels of importance (or criticality. In this paper, first, we propose a scheduling algorithm, which guarantees the real-time performance and reliability requirements of data flows with different levels of criticality. The algorithm supports centralized optimization and adaptive adjustment. It is able to improve both the scheduling performance and flexibility. Then, we provide the schedulability test through rigorous theoretical analysis. We conduct extensive simulations, and the results demonstrate that the proposed scheduling algorithm and analysis significantly outperform existing ones.

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.

Centralized Routing and Scheduling Using Multi-Channel System Single Transceiver in 802.16d

Science.gov (United States)

Al-Hemyari, A.; Noordin, N. K.; Ng, Chee Kyun; Ismail, A.; Khatun, S.

This paper proposes a cross-layer optimized strategy that reduces the effect of interferences from neighboring nodes within a mesh networks. This cross-layer design relies on the routing information in network layer and the scheduling table in medium access control (MAC) layer. A proposed routing algorithm in network layer is exploited to find the best route for all subscriber stations (SS). Also, a proposed centralized scheduling algorithm in MAC layer is exploited to assign a time slot for each possible node transmission. The cross-layer optimized strategy is using multi-channel single transceiver and single channel single transceiver systems for WiMAX mesh networks (WMNs). Each node in WMN has a transceiver that can be tuned to any available channel for eliminating the secondary interference. Among the considered parameters in the performance analysis are interference from the neighboring nodes, hop count to the base station (BS), number of children per node, slot reuse, load balancing, quality of services (QoS), and node identifier (ID). Results show that the proposed algorithms significantly improve the system performance in terms of length of scheduling, channel utilization ratio (CUR), system throughput, and average end to end transmission delay.

Comparing the performance of different meta-heuristics for unweighted parallel machine scheduling

Directory of Open Access Journals (Sweden)

Adamu, Mumuni Osumah

2015-08-01

Full Text Available This article considers the due window scheduling problem to minimise the number of early and tardy jobs on identical parallel machines. This problem is known to be NP complete and thus finding an optimal solution is unlikely. Three meta-heuristics and their hybrids are proposed and extensive computational experiments are conducted. The purpose of this paper is to compare the performance of these meta-heuristics and their hybrids and to determine the best among them. Detailed comparative tests have also been conducted to analyse the different heuristics with the simulated annealing hybrid giving the best result.

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.

Ratios performance indicator evaluation of selected engineering enterprises in the northeast cohesion region

OpenAIRE

Šenec, Alexandr

2014-01-01

The paper deals with the performance indicator evaluation of selected industrial companies with a predominance of engineering production. Ratio indicators were used in order to measure business performance per unit of fixed assets and per employee. Analyzed data were obtained from companies annual reports. Trends ratio indicators were intended with the help of mathematical and statistical methods. These ratios indicator assessing the level of performance, value added and operating profit p...

The influence of pressure ratio on the regenerator performance

Science.gov (United States)

Lin, Y.; Zhu, S.

2017-12-01

For a multi-stage pulse tube refrigerator with displacer, improving the regenerator efficiency is important. A displacer can get higher operating pressure ratio compared with inertance tube. The pressure ratio and porosity influence on the regenerator performance with is discussed, and CFD simulation is done on a two-stage pulse tube refrigerator with displacer to show that mass flow rate and pressure wave relation in the regenerator can be realized by a step-displacer.

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.

Scheduling reinforcement about once a day.

Science.gov (United States)

Eckerman, D A

1999-04-01

A pigeon earned its daily food by pecking a key according to reinforcement schedules that produced food about once per day. Fixed-interval (FI), Fixed-time (FT), and various complex schedules were arranged to demonstrate the degree to which a scalloped pattern of responding remained. Pausing continued until about an hour before the reinforcer could be earned for FIs of 12, 24, and 48 h. Pausing was not as long for FIs of 18, 19, and 23 h. Pausing of about 24 h was seen for FI 36 h. FT 24 h produced continued responding but at a diminished frequency. The pattern of responding was strongly controlled by the schedule of reinforcement and seemed relatively independent of the cycle of human activity in the surrounding laboratory. Effects of added ratio contingencies and of signaling the availability of reinforcement in FT were also examined. Signaled FTs of 5 min-3 h produced more responding during the signal (autoshaping) than did FTs of 19 or 24 h.

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.

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.

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

KAUST Repository

Nam, Haewoon

2013-01-01

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

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

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

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

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

Cross-Layer Scheduling and Resource Allocation for Heterogeneous Traffic in 3G LTE

Directory of Open Access Journals (Sweden)

Richard Musabe

2014-01-01

Full Text Available 3G long term evolution (LTE introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP and real-time traffic such as voice over internet protocol (VoIP. Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility under different constraints. We compared our proposed algorithm with proportional fair (PF, exponential proportional fair (EXP-PF, and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics.

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.

Behavioral effects of microwave reinforcement schedules and variations in microwave intensity on albino rats

Energy Technology Data Exchange (ETDEWEB)

Vitulli, W.F.; Lambert, J.K.; Brown, S.W.; Quinn, J.M.

1987-12-01

The objective of this exploratory investigation was to determine the interactive effects of fixed-ratio scheduling of microwave reinforcement in tandem with changes in microwave intensity. Nine albino rats were conditioned to regulate their thermal environment with microwave radiation while living in a Skinner (operant conditioning) Box in which the ambient temperature was about 27.13 degrees F at the beginning of the session. Each rat obtained a 6-sec. exposure of microwave radiation on a fixed-ratio schedule of MW reinforcement, the values of which varied from FR-1 to FR-30. Intensities of MW radiation were 62.5 W, 125 W, 250 W, and 437.5 W. Sessions lasted for 8 to 9 hr. over an approximate 13-mo. period. The effects of the intensity of microwave reinforcement varied as a function of the ratio value of the schedule used. Continuous reinforcement (FR-1) produced the lowest over-all rates, whereas FR-15, and FR-25 produced the highest over-all rates. Relatively higher thermal-behavior rates occurred under 62.5 W than under any of the other MW intensities for FR-1, FR-15, and FR-25, whereas FR-10 and FR-30 ratios produced intermediate rates of thermal responding which were constant for all values of MW intensity. These data are explained in terms of interactive effects between the local satiation or deprivation properties of the MW intensity and the ratio requirements of the schedule of MW reinforcement.

Cost/Performance Ratio Achieved by Using a Commodity-Based Cluster

Science.gov (United States)

Lopez, Isaac

2001-01-01

Researchers at the NASA Glenn Research Center acquired a commodity cluster based on Intel Corporation processors to compare its performance with a traditional UNIX cluster in the execution of aeropropulsion applications. Since the cost differential of the clusters was significant, a cost/performance ratio was calculated. After executing a propulsion application on both clusters, the researchers demonstrated a 9.4 cost/performance ratio in favor of the Intel-based cluster. These researchers utilize the Aeroshark cluster as one of the primary testbeds for developing NPSS parallel application codes and system software. The Aero-shark cluster provides 64 Intel Pentium II 400-MHz processors, housed in 32 nodes. Recently, APNASA - a code developed by a Government/industry team for the design and analysis of turbomachinery systems was used for a simulation on Glenn's Aeroshark cluster.

Effect of organic matter to nitrogen ratio on membrane bioreactor performance.

Science.gov (United States)

Hao, L; Liao, B Q

2015-01-01

Effect of chemical oxygen demand (COD) to nitrogen (COD:N) ratio in feed on the performance of aerobic membrane bioreactor (MBR) for treating a synthetic high-strength industrial waste water containing glucose was studied for over 370 days. The widely recommended nutrients ratio (COD:N:P = 100:5:1) is not necessary for aerobic biological industrial waste water treatment. An increased COD:N ratio from 100:5 to 100:2.5 and 100:1.8 had a limited impact on COD removal efficiency and further led to a significant improvement in membrane performance, a reduced sludge yield, and improved effluent quality in terms of residual nutrients. An increased COD:N ratio will benefit the industrial waste water treatment using MBRs by reducing membrane fouling and sludge yield, saving chemical costs, and reducing secondary pollution by nutrients addition. Optimization of nutrients usage should be conducted for specific industrial waste water streams.

Fatigue Risk Management: The Impact of Anesthesiology Residents' Work Schedules on Job Performance and a Review of Potential Countermeasures.

Science.gov (United States)

Wong, Lily R; Flynn-Evans, Erin; Ruskin, Keith J

2018-04-01

Long duty periods and overnight call shifts impair physicians' performance on measures of vigilance, psychomotor functioning, alertness, and mood. Anesthesiology residents typically work between 64 and 70 hours per week and are often required to work 24 hours or overnight shifts, sometimes taking call every third night. Mitigating the effects of sleep loss, circadian misalignment, and sleep inertia requires an understanding of the relationship among work schedules, fatigue, and job performance. This article reviews the current Accreditation Council for Graduate Medical Education guidelines for resident duty hours, examines how anesthesiologists' work schedules can affect job performance, and discusses the ramifications of overnight and prolonged duty hours on patient safety and resident well-being. We then propose countermeasures that have been implemented to mitigate the effects of fatigue and describe how training programs or practice groups who must work overnight can adapt these strategies for use in a hospital setting. Countermeasures include the use of scheduling interventions, strategic naps, microbreaks, caffeine use during overnight and extended shifts, and the use of bright lights in the clinical setting when possible or personal blue light devices when the room lights must be turned off. Although this review focuses primarily on anesthesiology residents in training, many of the mitigation strategies described here can be used effectively by physicians in practice.

Fundamental ratios and stock market performance : evidence from Turkey

OpenAIRE

Parlak, Deniz

2013-01-01

The fundamental analysis strives to determine the approximate future market value of a firm and an important step in a fundamental analysis is the computation of basic ratios which provide an indication of firms' financial performance in several key areas. The purpose of this study is to investigate the financial performance of Turkish manufacturing companies and the impact of this performance on common stock returns for the three years from 2009 to 2012. The sample consisted of 20 chemical-s...

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.

On program restructuring, scheduling, and communication for parallel processor systems

Energy Technology Data Exchange (ETDEWEB)

Polychronopoulos, Constantine D. [Univ. of Illinois, Urbana, IL (United States)

1986-08-01

This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented.

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)

Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains

KAUST Repository

Hossain, Md Jahangir

2010-03-01

Our contribution, in this paper, is two-fold. First, we analyze the performance of a hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) scheme, which was proposed by the authors, in a fading environment where different users have different average link gains. Specifically, we present a new expression for the spectral efficiency (SE) of the users and using this expression, we compare the degrees of fairness (DOF) of the TBS scheme with that of classical single user opportunistic scheduling schemes, namely, absolute carrier-to-noise ratio (CNR) based single-best user scheduling (SBS) and normalized CNR based proportional fair scheduling (PFS) schemes. The second contribution is that we propose a new hybrid two-user opportunistic scheduling (HTS) scheme based on our earlier proposed TBS scheme. This HTS scheme selects the first user based on the largest absolute CNR value among all the users while the second user is selected based on the ratios of the absolute CNRs to the corresponding average CNRs of the remaining users. The total transmission rate i.e., the constellation size is selected according to the absolute CNR of the first best user. The total transmission rate is then allocated among these selected users by joint consideration of their absolute CNRs and allocated number of information bit(s) are transmitted to them using hierarchical modulations. Numerical results are presented for a fading environment where different users experience independent but non-identical (i.n.d.) channel fading. These selected numerical results show that the proposed HTS scheme can considerably increase the system\\'s fairness without any degradation of the link spectral efficiency (LSE) i.e., the multiuser diversity gain compared to the classical SBS scheme. These results also show that the proposed HTS scheme has a lower fairness in comparison to the PFS scheme which suffers from a considerable degradation in LSE. © 2010 IEEE.

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.

Performance of AC/graphite capacitors at high weight ratios of AC/graphite

Energy Technology Data Exchange (ETDEWEB)

Wang, Hongyu [IM and T Ltd., Advanced Research Center, Saga University, 1341 Yoga-machi, Saga 840-0047 (Japan); Yoshio, Masaki [Advanced Research Center, Department of Applied Chemistry, Saga University, 1341 Yoga-machi, Saga 840-0047 (Japan)

2008-03-01

The effect of negative to positive electrode materials' weight ratio on the electrochemical performance of both activated carbon (AC)/AC and AC/graphite capacitors has been investigated, especially in the terms of capacity and cycle-ability. The limited capacity charge mode has been proposed to improve the cycle performance of AC/graphite capacitors at high weight ratios of AC/graphite. (author)

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

Taking the lag out of jet lag through model-based schedule design.

Science.gov (United States)

Dean, Dennis A; Forger, Daniel B; Klerman, Elizabeth B

2009-06-01

Travel across multiple time zones results in desynchronization of environmental time cues and the sleep-wake schedule from their normal phase relationships with the endogenous circadian system. Circadian misalignment can result in poor neurobehavioral performance, decreased sleep efficiency, and inappropriately timed physiological signals including gastrointestinal activity and hormone release. Frequent and repeated transmeridian travel is associated with long-term cognitive deficits, and rodents experimentally exposed to repeated schedule shifts have increased death rates. One approach to reduce the short-term circadian, sleep-wake, and performance problems is to use mathematical models of the circadian pacemaker to design countermeasures that rapidly shift the circadian pacemaker to align with the new schedule. In this paper, the use of mathematical models to design sleep-wake and countermeasure schedules for improved performance is demonstrated. We present an approach to designing interventions that combines an algorithm for optimal placement of countermeasures with a novel mode of schedule representation. With these methods, rapid circadian resynchrony and the resulting improvement in neurobehavioral performance can be quickly achieved even after moderate to large shifts in the sleep-wake schedule. The key schedule design inputs are endogenous circadian period length, desired sleep-wake schedule, length of intervention, background light level, and countermeasure strength. The new schedule representation facilitates schedule design, simulation studies, and experiment design and significantly decreases the amount of time to design an appropriate intervention. The method presented in this paper has direct implications for designing jet lag, shift-work, and non-24-hour schedules, including scheduling for extreme environments, such as in space, undersea, or in polar regions.

Effects of Radial Gap Ratio between Impeller and Vaned Diffuser on Performance of Centrifugal Compressors

Directory of Open Access Journals (Sweden)

Mohammadjavad Hosseini

2017-07-01

Full Text Available A high-performance centrifugal compressor is needed for numerous industry applications nowadays. The radial gap ratio between the impeller and the diffuser vanes plays an important role in the improvement of the compressor performance. In this paper, the effects of the radial gap ratio on a high-pressure ratio centrifugal compressor are investigated using numerical simulations. The performance and the flow field are compared for six different radial gap ratios and five rotational speeds. The minimal radial gap ratio was 1.04 and the maximal was 1.14. Results showed that reducing the radial gap ratio decreases the choke mass flow rate. For the tip-speed Mach number (impeller inlet with Mu < 1, the pressure recovery and the loss coefficients are not sensitive to the radial gap ratio. However, for Mu ≥ 1, the best radial gap ratio is 1.08 for the pressure recovery and the loss coefficients. Furthermore, the impeller pressure ratio and efficiency are reduced by increasing the radial gap ratio. Finally, the compressor efficiency was compared for different radial gap ratios. For Mu < 1, the radial gap ratio does not have noticeable effects. In comparison, the radial gap ratio of 1.08 has the best performance for Mu ≥ 1.

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

A Framework for Simplifying the Development of Kernel Schedulers: Design and Performance Evaluation

DEFF Research Database (Denmark)

Muller, Gilles; Lawall, Julia Laetitia; Duschene, Hervé

2005-01-01

Writing a new scheduler and integrating it into an existing OS is a daunting task, requiring the understanding of multiple low-level kernel mechanisms. Indeed, implementing a new scheduler is outside the expertise of application programmers, even though they are the ones who understand best the s...

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

Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network

Directory of Open Access Journals (Sweden)

Kazuhiko Hiramoto

2018-01-01

Full Text Available We propose an adaptive gain scheduled semiactive control method using an artificial neural network for structural systems subject to earthquake disturbance. In order to design a semiactive control system with high control performance against earthquakes with different time and/or frequency properties, multiple semiactive control laws with high performance for each of multiple earthquake disturbances are scheduled with an adaptive manner. Each semiactive control law to be scheduled is designed based on the output emulation approach that has been proposed by the authors. As the adaptive gain scheduling mechanism, we introduce an artificial neural network (ANN. Input signals of the ANN are the measured earthquake disturbance itself, for example, the acceleration, velocity, and displacement. The output of the ANN is the parameter for the scheduling of multiple semiactive control laws each of which has been optimized for a single disturbance. Parameters such as weight and bias in the ANN are optimized by the genetic algorithm (GA. The proposed design method is applied to semiactive control design of a base-isolated building with a semiactive damper. With simulation study, the proposed adaptive gain scheduling method realizes control performance exceeding single semiactive control optimizing the average of the control performance subject to various earthquake disturbances.

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

Effects of various planting ratios on the performance of maize and ...

African Journals Online (AJOL)

The experiment was conducted at the Teaching and Research Farm of Ambrose Alli University, Ekpoma to evaluate the performance of maize and cowpea planted at various replacement ratios. Weight of grains per plant and grain yield were higher in cowpea in maize-cowpea intercrop planted in ratio 2:1. Based on the ...

Taking the lag out of jet lag through model-based schedule design.

Directory of Open Access Journals (Sweden)

Dennis A Dean

2009-06-01

Full Text Available Travel across multiple time zones results in desynchronization of environmental time cues and the sleep-wake schedule from their normal phase relationships with the endogenous circadian system. Circadian misalignment can result in poor neurobehavioral performance, decreased sleep efficiency, and inappropriately timed physiological signals including gastrointestinal activity and hormone release. Frequent and repeated transmeridian travel is associated with long-term cognitive deficits, and rodents experimentally exposed to repeated schedule shifts have increased death rates. One approach to reduce the short-term circadian, sleep-wake, and performance problems is to use mathematical models of the circadian pacemaker to design countermeasures that rapidly shift the circadian pacemaker to align with the new schedule. In this paper, the use of mathematical models to design sleep-wake and countermeasure schedules for improved performance is demonstrated. We present an approach to designing interventions that combines an algorithm for optimal placement of countermeasures with a novel mode of schedule representation. With these methods, rapid circadian resynchrony and the resulting improvement in neurobehavioral performance can be quickly achieved even after moderate to large shifts in the sleep-wake schedule. The key schedule design inputs are endogenous circadian period length, desired sleep-wake schedule, length of intervention, background light level, and countermeasure strength. The new schedule representation facilitates schedule design, simulation studies, and experiment design and significantly decreases the amount of time to design an appropriate intervention. The method presented in this paper has direct implications for designing jet lag, shift-work, and non-24-hour schedules, including scheduling for extreme environments, such as in space, undersea, or in polar regions.

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.

A systematic review of the sleep, sleepiness, and performance implications of limited wake shift work schedules.

Science.gov (United States)

Short, Michelle A; Agostini, Alexandra; Lushington, Kurt; Dorrian, Jillian

2015-09-01

The aim of this review was to identify which limited wake shift work schedules (LWSW) best promote sleep, alertness, and performance. LWSW are fixed work/rest cycles where the time-at-work does is ≤8 hours and there is >1 rest period per day, on average, for ≥2 consecutive days. These schedules are commonly used in safety-critical industries such as transport and maritime industries. Literature was sourced using PubMed, Embase, PsycInfo, Scopus, and Google Scholar databases. We identified 20 independent studies (plus a further 2 overlapping studies), including 5 laboratory and 17 field-based studies focused on maritime watch keepers, ship bridge officers, and long-haul train drivers. The measurement of outcome measures was varied, incorporating subjective and objective measures of sleep: sleep diaries (N=5), actigraphy (N=4), and polysomnography, (N=3); sleepiness: Karolinska Sleepiness Scale (N=5), visual analog scale (VAS) alertness (N=2) and author-derived measures (N=2); and performance: Psychomotor Vigilance Test (PVT) (N=5), Reaction Time or Vigilance tasks (N=4), Vector and Letter Cancellation Test (N=1), and subjective performance (N=2). Of the three primary rosters examined (6 hours-on/6 hours-off, 8 hours-on/8 hours-off and 4 hours-on/8 hours-off), the 4 hours-on/8 hours-off roster was associated with better sleep and lower levels of sleepiness. Individuals working 4 hours-on/8 hours-off rosters averaged 1 hour more sleep per night than those working 6 hours-on/6 hours-off and 1.3 hours more sleep than those working 8 hours-on/8 hours-off (Pwork, (ii) more frequent rest breaks, (iii) shifts that start and end at the same clock time every 24 hours, and (iv) work shifts commencing in the daytime (as opposed to night). The findings for performance remain incomplete due to the small number of studies containing a performance measure and the heterogeneity of performance measures within those that did. The literature supports the utility of LWSW in

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.

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

Effect Of Compression Ratio On The Performance Of Diesel Engine At Different Loads.

OpenAIRE

Abhishek Reddy G; Nirmal Pratap Singh

2015-01-01

Variable compression ratio (VCR) technology has long been recognized as a method for improving the automobile engine performance, efficiency, fuel economy with reduced emission. The main feature of the VCR engine is to operate at different compression ratio, by changing the combustion chamber volume, depending on the vehicle performance needs .The need to improve the performance characteristics of the IC Engine has necessitated the present research. Increasing the compression rati...

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

Science.gov (United States)

Iversen, I H

1993-07-01

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

Multiuser Scheduling on the Downlink of an LTE Cellular System

Directory of Open Access Journals (Sweden)

Raymond Kwan

2008-01-01

Full Text Available The challenge of scheduling user transmissions on the downlink of a long-term evolution (LTE cellular communication system is addressed. In particular, a novel optimalmultiuser scheduler is proposed. Numerical results show that the system performance improves with increasing correlation among OFDMA subcarriers. It is found that only a limited amount of feedback information is needed to achieve relatively good performance. A suboptimal reduced-complexity scheduler is also proposed and shown to provide good performance. The suboptimal scheme is especially attractive when the number of users is large, in which case the complexity of the optimal scheme is high.

Multiuser switched diversity scheduling systems with per-user threshold

KAUST Repository

Nam, Haewoon

2010-05-01

A multiuser switched diversity scheduling scheme with per-user feedback threshold is proposed and analyzed in this paper. The conventional multiuser switched diversity scheduling scheme uses a single feedback threshold for every user, where the threshold is a function of the average signal-to-noise ratios (SNRs) of the users as well as the number of users involved in the scheduling process. The proposed scheme, however, constructs a sequence of feedback thresholds instead of a single feedback threshold such that each user compares its channel quality with the corresponding feedback threshold in the sequence. Numerical and simulation results show that thanks to the flexibility of threshold selection, where a potentially different threshold can be used for each user, the proposed scheme provides a higher system capacity than that for the conventional scheme. © 2006 IEEE.

A microeconomic scheduler for parallel computers

Science.gov (United States)

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

1995-01-01

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

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.

Cost, Schedule, And Performance Elements For Comparison of Hydrodynamic Models of Near-Surface Unmanned Underwater Vehicle Operations

Science.gov (United States)

2017-12-01

2-89) Prescribed by ANSI Std. 239-18 ii THIS PAGE INTENTIONALLY LEFT BLANK iii Approved for public release. Distribution is unlimited. COST ...from the scope of this demonstration due to time constraints. Further study of this software would benefit similar cost , schedule, and performance...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA SYSTEMS ENGINEERING CAPSTONE PROJECT REPORT Approved for public release. Distribution

A meta-heuristic method for solving scheduling problem: crow search algorithm

Science.gov (United States)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

Disallowing Same-program Co-schedules to Improve Efficiency in Quad-core Servers

OpenAIRE

de Blanche, Andreas; Lundqvist, Thomas

2017-01-01

Programs running on different cores in a multicore server are often forced to share resources like off-chip memory, caches, I/O devices, etc. This resource sharing often leads to degraded performance, a slowdown, for the programs that share the resources. A job scheduler can improve performance by co-scheduling programs that use different resources on the same server. The most common approach to solve this co-scheduling problem has been to make job-schedulers resource aware, finding ways to c...

A greedy double swap heuristic for nurse scheduling

Directory of Open Access Journals (Sweden)

Murphy Choy

2012-10-01

Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

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.

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.

Performance of real-time strain elastography, transient elastography, and aspartate-to-platelet ratio index in the assessment of fibrosis in chronic hepatitis C.

Science.gov (United States)

Ferraioli, Giovanna; Tinelli, Carmine; Malfitano, Antonello; Dal Bello, Barbara; Filice, Gaetano; Filice, Carlo; Above, Elisabetta; Barbarini, Giorgio; Brunetti, Enrico; Calderon, Willy; Di Gregorio, Marta; Lissandrin, Raffaella; Ludovisi, Serena; Maiocchi, Laura; Michelone, Giuseppe; Mondelli, Mario; Patruno, Savino F A; Perretti, Alessandro; Poma, Gianluigi; Sacchi, Paolo; Zaramella, Marco; Zicchetti, Mabel

2012-07-01

The purpose of this article is to evaluate the diagnostic performance of transient elastography, real-time strain elastography, and aspartate-to-platelet ratio index in assessing fibrosis in patients with chronic hepatitis C by using histologic Metavir scores as reference standard. Consecutive patients with chronic hepatitis C scheduled for liver biopsy were enrolled. Liver biopsy was performed on the same day as transient elastography and real-time strain elastography. Transient elastography and real-time strain elastography were performed in the same patient encounter by a single investigator using a medical device based on elastometry and an ultrasound machine, respectively. Diagnostic performance was assessed by using receiver operating characteristic curves and area under the receiver operating characteristic curve (AUC) analysis. One hundred thirty patients (91 men and 39 women) were analyzed. The cutoff values for transient elastography, real-time strain elastography, and aspartate-to-platelet ratio index were 6.9 kPa, 1.82, and 0.37, respectively, for fibrosis score of 2 or higher; 7.3 kPa, 1.86, and 0.70, respectively, for fibrosis score of 3 or higher; and 9.3 kPa, 2.33, and 0.70, respectively, for fibrosis score of 4. AUC values of transient elastography, real-time strain elastography, aspartate-to-platelet ratio index were 0.88, 0.74, and 0.86, respectively, for fibrosis score of 2 or higher; 0.95, 0.80, and 0.89, respectively, for fibrosis score of 3 or higher; and 0.97, 0.80, and 0.84, respectively, for fibrosis score of 4. A combination of the three methods, when two of three were in agreement, showed AUC curves of 0.93, 0.95, and 0.95 for fibrosis scores of 2 or higher, 3 or higher, and 4, respectively. Transient elastography, real-time strain elastography, and aspartate-to-platelet ratio index values were correlated with histologic stages of fibrosis. Transient elastography offered excellent diagnostic performance in assessing severe fibrosis and

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.

THE EFFECT OF COMPRESSION RATIO VARIATIONS ON THE ENGINE PERFORMANCE PARAMETRES IN SPARK IGNITION ENGINES

Directory of Open Access Journals (Sweden)

Yakup SEKMEN

2005-01-01

Full Text Available Performance of the spark ignition engines may be increased by changing the geometrical compression ratio according to the amount of charging in cylinders. The designed geometrical compression ratio can be realized as an effective compression ratio under the full load and full open throttle conditions since the effective compression ratio changes with the amount of charging into the cylinder in spark ignition engines. So, this condition of the spark ignition engines forces designers to change their geometrical compression ratio according to the amount of charging into the cylinder for improvement of performance and fuel economy. In order to improve the combustion efficiency, fuel economy, power output, exhaust emissions at partial loads, compression ratio must be increased; but, under high load and low speed conditions to prevent probable knock and hard running the compression ratio must be decreased gradually. In this paper, relation of the performance parameters to compression ratio such as power, torque, specific fuel consumption, cylindir pressure, exhaust gas temperature, combustion chamber surface area/volume ratio, thermal efficiency, spark timing etc. in spark ignition engines have been investigated and using of engines with variable compression ratio is suggested to fuel economy and more clear environment.

Job shop scheduling by local search

NARCIS (Netherlands)

Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

1992-01-01

We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

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

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.

Analysis of Financial Ratio to Distinguish Indonesia Joint Venture General Insurance Company Performance using Discriminant Analysis

Directory of Open Access Journals (Sweden)

Subiakto Soekarno

2012-01-01

Full Text Available Insurance industry stands as a service business that plays a significant role in Indonesiaeconomical condition. The development of insurance industry in Indonesia, both of generalinsurance and life insurance, has increased very fast. The general insurance industry itselfdivided into two major players which are local private company and Joint Venture Company.Lately, the use of statistical techniques and financial ratios models to asses financial institutionsuch as insurance company have been used as one of the appropriate combination inpredicting the performance of an industry. This research aims to distinguish between JointVenture General Insurance Companies that have a good performance and those who are lessperforming well using Discriminant Analysis. Further, the findings led that DiscriminantAnalysis is able to distinguish Joint Venture General Insurance Companies that have a goodperformance and those who are not performing well. There are also six ratios which are RBC,Technical Reserve to Investment Ratio, Debt Ratio, Return on Equity, Loss Ratio, and ExpenseRatio that stand as the most influential ratios to distinguish the performance of joint venturegeneral insurance companies. In addition, the result suggest business people to be concernedtoward those six ratios, to increase their companies’ performance.Key words: general insurance, financial ratio, discriminant analysis

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem

2013-01-01

new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive

Job shop scheduling with makespan objective: A heuristic approach

Directory of Open Access Journals (Sweden)

Mohsen Ziaee

2014-04-01

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

Radical radiotherapy for invasive bladder cancer: What dose and fractionation schedule to choose?

International Nuclear Information System (INIS)

Pos, Floris J.; Hart, Guus; Schneider, Christoph; Sminia, Peter

2006-01-01

Purpose: To establish the α/β ratio of bladder cancer from different radiotherapy schedules reported in the literature and provide guidelines for the design of new treatment schemes. Methods and Materials: Ten external beam radiotherapy (EBRT) and five brachytherapy schedules were selected. The biologically effective dose (BED) of each schedule was calculated. Logistic modeling was used to describe the relationship between 3-year local control (LC3y) and BED. Results: The estimated α/β ratio was 13 Gy (95% confidence interval [CI], 2.5-69 Gy) for EBRT and 24 Gy (95% CI, 1.3-460 Gy) for EBRT and brachytherapy combined. There is evidence for an overall dose-response relationship. After an increase in total dose of 10 Gy, the odds of LC3y increase by a factor of 1.44 (95% CI, 1.23-1.70) for EBRT and 1.47 (95% CI, 1.25-1.72) for the data sets of EBRT and brachytherapy combined. Conclusion: With the clinical data currently available, a reliable estimation of the α/β ratio for bladder cancer is not feasible. It seems reasonable to use a conventional α/β ratio of 10-15 Gy. Dose escalation could significantly increase local control. There is no evidence to support short overall treatment times or large fraction sizes in radiotherapy for bladder cancer

An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific

International Nuclear Information System (INIS)

Franke, H.; Jann, J.; Moreira, J.; Pattnaik, P.; Jette, M.

1999-01-01

In this paper we analyze the behavior of a gang-scheduling strategy that we are developing for the ASCI Blue-Pacific machines. Using actual job logs for one of the ASCI machines we generate a statistical model of the current workload with hyper Erlang distributions. We then vary the parameters of those distributions to generate various workloads, representative of different operating points of the machine. Through simulation we obtain performance parameters for three different scheduling strategies: (i) first-come first-serve, (ii) gang-scheduling, and (iii) backfilling. Our results show that backfilling, can be very effective for the common operating points in the 60-70% utilization range. However, for higher utilization rates, time-sharing techniques such as gang-scheduling offer much better performance

Relations between Air-Fuel Ratio and Dynamic Performance of Small Race Cars

OpenAIRE

位田, 晴良; Ida, Haruyoshi; 漁, 佑一郎; Sunadori, Yuichiro; 牧田, 俊太郎; Makita, Syuntaro; 宮﨑, 真央; Miyazaki, Manaka; 磯松, 弥司; Isomatsu, Yatsuka

2017-01-01

'It goes without saying that engine output power characteristics greatly affect the dynamic performance of the race car. One of the methods of changing the output power of the engine is to adjust the set amount of fuel supply. This method changes the air-fuel ratio of the air fuel mixture supplied to the engine. In this study, a slalom test run of a small race car was used to examine dynamic performance with attention to the air-fuel ratio changed by adjusting the set amount of fuel supply. T...

Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

Directory of Open Access Journals (Sweden)

Atinat Palawan

2016-05-01

Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

Non preemptive soft real time scheduler: High deadline meeting rate on overload

Science.gov (United States)

Khalib, Zahereel Ishwar Abdul; Ahmad, R. Badlishah; El-Shaikh, Mohamed

2015-05-01

While preemptive scheduling has gain more attention among researchers, current work in non preemptive scheduling had shown promising result in soft real time jobs scheduling. In this paper we present a non preemptive scheduling algorithm meant for soft real time applications, which is capable of producing better performance during overload while maintaining excellent performance during normal load. The approach taken by this algorithm has shown more promising results compared to other algorithms including its immediate predecessor. We will present the analysis made prior to inception of the algorithm as well as simulation results comparing our algorithm named gutEDF with EDF and gEDF. We are convinced that grouping jobs utilizing pure dynamic parameters would produce better performance.

Relationships between Classroom Schedule Types and Performance on the Algebra I Criterion-Referenced Test

Science.gov (United States)

Murray, Gregory V.; Moyer-Packenham, Patricia S.

2014-01-01

One option for length of individual mathematics class periods is the schedule type selected for Algebra I classes. This study examined the relationship between student achievement, as indicated by Algebra I Criterion-Referenced Test scores, and the schedule type for Algebra I classes. Data obtained from the Utah State Office of Education included…

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

Science.gov (United States)

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

2016-01-01

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

Scheduling and Communication Synthesis for Distributed Real-Time Systems

DEFF Research Database (Denmark)

Pop, Paul

2000-01-01

on aspects of scheduling and communication for embedded real-time systems. Special emphasis has been placed on the impact of the communication infrastructure and protocol on the overall system performance. The scheduling and communication strategies proposed are based on an abstract graph representation...

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.

Combined Noncyclic Scheduling and Advanced Control for Continuous Chemical Processes

Directory of Open Access Journals (Sweden)

Damon Petersen

2017-12-01

Full Text Available A novel formulation for combined scheduling and control of multi-product, continuous chemical processes is introduced in which nonlinear model predictive control (NMPC and noncyclic continuous-time scheduling are efficiently combined. A decomposition into nonlinear programming (NLP dynamic optimization problems and mixed-integer linear programming (MILP problems, without iterative alternation, allows for computationally light solution. An iterative method is introduced to determine the number of production slots for a noncyclic schedule during a prediction horizon. A filter method is introduced to reduce the number of MILP problems required. The formulation’s closed-loop performance with both process disturbances and updated market conditions is demonstrated through multiple scenarios on a benchmark continuously stirred tank reactor (CSTR application with fluctuations in market demand and price for multiple products. Economic performance surpasses cyclic scheduling in all scenarios presented. Computational performance is sufficiently light to enable online operation in a dual-loop feedback structure.

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.

Flow-shop scheduling problem under uncertainties: Review and trends

OpenAIRE

Eliana María González-Neira; Jairo R. Montoya-Torres; David Barrera

2017-01-01

Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of co...

Space network scheduling benchmark: A proof-of-concept process for technology transfer

Science.gov (United States)

Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy

1993-01-01

This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

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.

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)

Combined Effect of Contraction Ratio and Chamber Pressure on the Performance of a Gaseous Hydrogen-Liquid-Oxygen Combustor for a Given Propellant Weight Flow and Oxidant-Fuel Ratio

Science.gov (United States)

Hersch, Martin

1961-01-01

The effect of contraction ratio and chamber pressure on the combustion performance of a gaseous-hydrogen-liquid-oxygen combustor was investigated analytically and experimentally. The experiment was conducted with a "two-dimensional" gaseous-hydrogen-liquid-oxygen engine of about 150-pound thrust. The contraction ratio was varied from 1.5 to 6 by changing the nozzle throat area. This variation resulted in a chamber pressure variation of about 25 to 120 pounds per square inch. The experimental results were corrected for heat transfer to the engine walls and momentum pressure losses. The experimental performance, as evaluated in terms of characteristic exhaust velocity, was 98 percent of theoretical at contraction ratios greater than 3 but decreased very rapidly at smaller contraction ratios. The heat-transfer rate increased with increasing contraction ratio and chamber pressure; it was about 1 Btu per square inch per second at a contraction ratio of 1.5 and increased to about 3 at a contraction ratio of 6. The combined effects of contraction-ratio and chamber-pressure changes on performance were investigated analytically with a mixing model and a vaporization model. The mixing model predicted very poor mixing at contraction ratios below 3 and almost perfect mixing at higher contraction ratios. The performance predicted by the vaporization model was very close to 100 percent for all contraction ratios. From these results, it was concluded that the performance was limited by poor mixing at low contraction ratios and chamber pressures.

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

ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING

Directory of Open Access Journals (Sweden)

P. Mathiyalagan

2010-07-01

Full Text Available Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clusters of varying sizes, and different clusters typically contains processing elements with different level of performance. In this, heuristic approaches based on particle swarm optimization and ant colony optimization algorithms are adopted for solving task scheduling problems in grid environment. Particle Swarm Optimization (PSO is one of the latest evolutionary optimization techniques by nature. It has the better ability of global searching and has been successfully applied to many areas such as, neural network training etc. Due to the linear decreasing of inertia weight in PSO the convergence rate becomes faster, which leads to the minimal makespan time when used for scheduling. To make the convergence rate faster, the PSO algorithm is improved by modifying the inertia parameter, such that it produces better performance and gives an optimized result. The ACO algorithm is improved by modifying the pheromone updating rule. ACO algorithm is hybridized with PSO algorithm for efficient result and better convergence in PSO algorithm.

Space shuttle launch vehicle performance trajectory, exchange ratios, and dispersion analysis

Science.gov (United States)

Toelle, R. G.; Blackwell, D. L.; Lott, L. N.

1973-01-01

A baseline space shuttle performance trajectory for Mission 3A launched from WTR has been generated. Design constraints of maximum dynamic pressure, longitudinal acceleration, and delivered payload were satisfied. Payload exchange ratios are presented with explanation on use. Design envelopes of dynamic pressure, SRB staging point, aerodynamic heating and flight performance reserves are calculated and included.

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.

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

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.

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

Directory of Open Access Journals (Sweden)

Ruey-Maw Chen

2011-01-01

Full Text Available The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the best performance resource heuristic and the latest finish time heuristic. These two heuristics applied to the PSO scheme are for speeding up the search of the particle and improving the capability of finding a sound schedule. Moreover, both global communication topology and local ring communication topology are also investigated for efficient study of proposed scheme. Simulation results demonstrate that the proposed approach in this investigation can successfully solve the task-resource assignment problems in grid computing and similar scheduling problems.

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.

Influence of void ratio on thermal performance of heat pipe receiver

International Nuclear Information System (INIS)

Gui Xiaohong; Tang Dawei; Liang Shiqiang; Lin Bin; Yuan Xiugan

2012-01-01

Highlights: ► The temperature gradient increases significantly and the utility ratio of PCM decreases obviously as void ratio increases. ► Void cavity influences the process of phase change greatly. ► PCM melts slowly during sunlight periods and freezes slowly during eclipse periods as void ratio increases. ► The temperature gradient of PCM zone is very significant with the effect of void cavity. - Abstract: In this paper, influence of void ratio on thermal performance of heat pipe receiver under microgravity is numerically simulated. Accordingly, mathematical model is set up. Numerical method is offered. The temperature field of Phase Change Material (PCM) canister is shown. Numerical results are compared with numerical ones of National Aeronautics and Space Administration (NASA). Numerical results show that the temperature gradient increases significantly and the utility ratio of PCM decreases obviously as void ratio increases. Void cavity influences the process of phase change greatly. PCM melts slowly during sunlight periods and freezes slowly during eclipse periods as void ratio increases. The thermal resistance of void cavity is much bigger than that of PCM canister wall. Void cavity prevents the heat transfer between PCM zone and canister wall. The temperature gradient of PCM zone is very significant with the effect of void cavity. So the thermal stress of heat pipe receiver may increase, and the lifetime may decrease as void ratio increases.

Using a vision cognitive algorithm to schedule virtual machines

OpenAIRE

Zhao Jiaqi; Mhedheb Yousri; Tao Jie; Jrad Foued; Liu Qinghuai; Streit Achim

2014-01-01

Scheduling virtual machines is a major research topic for cloud computing, because it directly influences the performance, the operation cost and the quality of services. A large cloud center is normally equipped with several hundred thousand physical machines. The mission of the scheduler is to select the best one to host a virtual machine. This is an NPhard global optimization problem with grand challenges for researchers. This work studies the Virtual Machine (VM) scheduling problem on the...

Potential support ratios

DEFF Research Database (Denmark)

Kjærgaard, Søren; Canudas-Romo, Vladimir

2017-01-01

The ‘prospective potential support ratio’ has been proposed by researchers as a measure that accurately quantifies the burden of ageing, by identifying the fraction of a population that has passed a certain measure of longevity, for example, 17 years of life expectancy. Nevertheless......, the prospective potential support ratio usually focuses on the current mortality schedule, or period life expectancy. Instead, in this paper we look at the actual mortality experienced by cohorts in a population, using cohort life tables. We analyse differences between the two perspectives using mortality models...

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

Assessing the firm performance through the financial ratios

Directory of Open Access Journals (Sweden)

VASILESCU LAURA

2011-09-01

Full Text Available The main objective of every firm is the creation of value, respectively the investment for which the efficiency resulted is above the profitability ratio required by the shareholders. In this paper are presented the fianancial indicators used for a proper value measuring of the firm’s performance, which are grouped in three categories: accounting, economical and stock exchange. For each group of indicators are presented the weak and strong points and there is underlined the importance of each indicator in order to reflect the value creation.

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

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

48 CFR 915.404-4-71-5 - Fee schedules.

Science.gov (United States)

2010-10-01

... METHODS AND CONTRACT TYPES CONTRACTING BY NEGOTIATION Contract Pricing 915.404-4-71-5 Fee schedules. (a... subcontracting, normal contractor services performed by the government or another contractor: (1) The target fee...) The target fee schedule provides for 45 percent of the contract work to be subcontracted for such...

Traditional/Block Scheduling, Gender, and Test Scores in College Biology Course

Science.gov (United States)

Huelskamp, Diana

2014-01-01

Block scheduling is the reallocation of a school day into longer class sessions to allow for more active teaching strategies and active engagement of students, in the effort to increase student performance. Various types of block scheduling exist. Traditional scheduling is when the school day is divided into six to eight sessions, with each…

Multiple determinants of transfer of evaluative function after conditioning with free-operant schedules of reinforcement.

Science.gov (United States)

Dack, Charlotte; Reed, Phil; McHugh, Louise

2010-11-01

The aim of the four present experiments was to explore how different schedules of reinforcement influence schedule-induced behavior, their impact on evaluative ratings given to conditioned stimuli associated with each schedule through evaluative conditioning, and the transfer of these evaluations through derived stimulus networks. Experiment 1 compared two contrasting response reinforcement rules (variable ratio [VR], variable interval [VI]). Experiment 2 varied the response to reinforcement rule between two schedules but equated the outcome to response rate (differential reinforcement of high rate [DRH] vs. VR). Experiment 3 compared molar and molecular aspects of contingencies of reinforcement (tandem VIVR vs. tandem VRVI). Finally, Experiment 4 employed schedules that induced low rates of responding to determine whether, under these circumstances, responses were more sensitive to the molecular aspects of a schedule (differential reinforcement of low rate [DRL] vs. VI). The findings suggest that the transfer of evaluative functions is determined mainly by differences in response rate between the schedules and the molar aspects of the schedules. However, when neither schedule was based on a strong response reinforcement rule, the transfer of evaluative judgments came under the control of the molecular aspects of the schedule.

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

International Nuclear Information System (INIS)

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

1996-01-01

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

Online scheduling policies for multiclass call centers with impatient customers

NARCIS (Netherlands)

Jouini, O.; Pot, S.A.; Koole, G.M.; Dallery, Y.

2010-01-01

We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI / GI / s + M queue, we focus on developing scheduling policies that satisfy a target ratio constraint on the abandonment probabilities of premium customers to

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.

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

Directory of Open Access Journals (Sweden)

Sonia Yassa

2013-01-01

Full Text Available We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach.

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

Science.gov (United States)

Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach. PMID:24319361

How useful are preemptive schedules?

NARCIS (Netherlands)

Brucker, P.; Heitmann, S.; Hurink, J.L.

2001-01-01

Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also

Environmental monitoring master sampling schedule, January--December 1990

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1990-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 1990 for the Environment Surveillance and Ground-Water 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. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs. This schedule includes ground-water sampling performed by PNL for environmental surveillance of the Hanford Site.

Contribution of Schedule Delays to Cost Growth: How to Make Peace with a Marching Army

Science.gov (United States)

Majerowicz, Walt; Bitten, Robert; Emmons, Debra; Shinn, Stephen A.

2016-01-01

Numerous research papers have shown that cost and schedule growth are interrelated for NASA space science missions. Although there has shown to be a strong correlation of cost growth with schedule growth, it is unclear what percentage of cost growth is caused by schedule growth and how schedule growth can be controlled. This paper attempts to quantify this percentage by looking at historical data and show detailed examples of how schedule growth influences cost growth. The paper also addresses a methodology to show an alternate approach for assessing and setting a robust baseline schedule and use schedule performance metrics to help assess if the project is performing to plan. Finally, recommendations are presented to help control schedule growth in order to minimize cost growth for NASA space science missions.

Revised data taking schedule with ion beams

CERN Document Server

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

2009-01-01

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

Scheduling strategies for LTE uplink with flow behaviour analysis

OpenAIRE

Dimitrova, D.C.; Berg, J.L. van den; Litjens, R.; Heijenk, G.

2010-01-01

Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fa...

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.

An investigation on impacts of scheduling configurations on Mississippi biology subject area testing

Science.gov (United States)

Marchette, Frances Lenora

The purpose of this mixed modal study was to compare the results of Biology Subject Area mean scores of students on a 4 x 4 block schedule, A/B block schedule, and traditional year-long schedule for 1A to 5A size schools. This study also reviewed the data to determine if minority or gender issues might influence the test results. Interviews with administrators and teachers were conducted about the type of schedule configuration they use and the influence that the schedule has on student academic performance on the Biology Subject Area Test. Additionally, this research further explored whether schedule configurations allow sufficient time for students to construct knowledge. This study is important to schools, teachers, and administrators because it can assist them in considering the impacts that different types of class schedules have on student performance and if ethnic or gender issues are influencing testing results. This study used the causal-comparative method for the quantitative portion of the study and constant comparative method for the qualitative portion to explore the relationship of school schedules on student academic achievement on the Mississippi Biology Subject Area Test. The aggregate means of selected student scores indicate that the Mississippi Biology Subject Area Test as a measure of student performance reveals no significant difference on student achievement for the three school schedule configurations. The data were adjusted for initial differences of gender, minority, and school size on the three schedule configurations. The results suggest that schools may employ various schedule configurations and expect student performance on the Mississippi Biology Subject Area Test to be unaffected. However, many areas of concern were identified in the interviews that might impact on school learning environments. These concerns relate to effective classroom management, the active involvement of students in learning, the adequacy of teacher education

Cloud Computing Task Scheduling Based on Cultural Genetic Algorithm

Directory of Open Access Journals (Sweden)

Li Jian-Wen

2016-01-01

Full Text Available The task scheduling strategy based on cultural genetic algorithm(CGA is proposed in order to improve the efficiency of task scheduling in the cloud computing platform, which targets at minimizing the total time and cost of task scheduling. The improved genetic algorithm is used to construct the main population space and knowledge space under cultural framework which get independent parallel evolution, forming a mechanism of mutual promotion to dispatch the cloud task. Simultaneously, in order to prevent the defects of the genetic algorithm which is easy to fall into local optimum, the non-uniform mutation operator is introduced to improve the search performance of the algorithm. The experimental results show that CGA reduces the total time and lowers the cost of the scheduling, which is an effective algorithm for the cloud task scheduling.

Diagnostic performance of sonoelastographic Tsukuba score and strain ratio in evaluation of breast masses

Directory of Open Access Journals (Sweden)

Mahmoud Abd Elaziz Dawood

2018-03-01

Full Text Available The aim of this prospective study was to evaluate the diagnostic performance of the use of strain index ratio by sonoelastography to differentiate between benign and malignant breast lesions. Patients & Methods: This prospective study including 40 females, complaining of breast masses which were suspicious to be malignant on clinical examination. All patients were submitted to B-mode Ultrasound and sonoelastography. Biopsy as a gold standard and pathological study were done for all breast lesions. Results: US examination of every mass was done and categorized according to BI-RADS categories according to ACR2013, according to US lexicon. Sonoelastography examination with Lesions classification was performed on the basis of a 5-point scoring method proposed by Tsukuba elasticity score. Then measurements of strain ratio were done. Statistical analysis of combination of the three methods was sensitivity of 96.7%, specificity of 100% when we use cut off value of 3–4 in elastography score and ≤3 cut off value of strain ratio. Conclusion: The combined use of strain ratio with Tsukuba score and BI-RADS categorization increased the diagnostic performance in differentiation between benign and malignant breast lesions. Keywords: Elastography, Breast masses, Strain ratio, Ultrasound, BI-RADS classification, Tsukuba score

On the secondary users opportunistic scheduling with reduced feedback

KAUST Repository

Song, Yao

2012-03-01

In underlay cognitive radio systems, secondary users (SUs) can share the spectrum with primary users (PUs) as long as the interference caused by SUs to PUs is below a certain threshold. When multiple SUs want to access the channel, multiuser diversity scheme can be applied to maximize the utilization rate of the channel. In this paper, the performance of selective multi user diversity scheme in underlay cognitive radio system is analyzed. We first start with the case in which all SUs have the same average signal-to-noise ratio (SNR). We then treat the more realistic case involving SUs with different average SNRs. Both power control and no power control scenarios are considered for the SUs. Furthermore, we take scheduling fairness into considerations and study a normalized SNR selection scheme in the case that SUs have different average SNRs. © 2012 IEEE.

The serial message-passing schedule for LDPC decoding algorithms

Science.gov (United States)

Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

2015-12-01

The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

Artificial Immune Algorithm for Subtask Industrial Robot Scheduling in Cloud Manufacturing

Science.gov (United States)

Suma, T.; Murugesan, R.

2018-04-01

The current generation of manufacturing industry requires an intelligent scheduling model to achieve an effective utilization of distributed manufacturing resources, which motivated us to work on an Artificial Immune Algorithm for subtask robot scheduling in cloud manufacturing. This scheduling model enables a collaborative work between the industrial robots in different manufacturing centers. This paper discussed two optimizing objectives which includes minimizing the cost and load balance of industrial robots through scheduling. To solve these scheduling problems, we used the algorithm based on Artificial Immune system. The parameters are simulated with MATLAB and the results compared with the existing algorithms. The result shows better performance than existing.

Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

Directory of Open Access Journals (Sweden)

Diwakar Shukla

2010-01-01

Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

Production planning and scheduling in refinery industry

International Nuclear Information System (INIS)

Persson, Jan.

1999-01-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-07-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-06-01

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

Hybrid and dependent task scheduling algorithm for on-board system software

Institute of Scientific and Technical Information of China (English)

魏振华; 洪炳熔; 乔永强; 蔡则苏; 彭俊杰

2003-01-01

In order to solve the hybrid and dependent task scheduling and critical source allocation problems, atask scheduling algorithm has been developed by first presenting the tasks, and then describing the hybrid anddependent scheduling algorithm and deriving the predictable schedulability condition. The performance of thisagorithm was evaluated through simulation, and it is concluded from the evaluation results that the hybrid taskscheduling subalgorithm based on the comparison factor can be used to solve the problem of aperiodic task beingblocked by periodic task in the traditional operating system for a very long time, which results in poor schedu-ling predictability; and the resource allocation subalgorithm based on schedulability analysis can be used tosolve the problems of critical section conflict, ceiling blocking and priority inversion; and the scheduling algo-rithm is nearest optimal when the abortable critical section is 0.6.

Medications for Sleep Schedule Adjustments in Athletes.

Science.gov (United States)

Baird, Matthew B; Asif, Irfan M

Sleep schedule adjustments are common requirements of modern-day athletes. Many nonpharmacologic and pharmacologic strategies exist to facilitate circadian rhythm shifts to maximize alertness and performance during competition. This review summarizes the evidence for commonly used pharmacologic agents and presents recommendations for the sports medicine provider. MEDLINE searches were performed using the following keywords: sleep aids, circadian rhythm adjustment, athletes and sleep, caffeine and sports, melatonin and athletes, and sleep aids and sports. Pertinent articles were extracted and discussed. Clinical review. Level 2. There are very few available studies investigating pharmacologic sleep aids in athletes. Data from studies involving shift workers and airline personnel are more abundant and were used to formulate recommendations and conclusions. Melatonin, caffeine, and nonbenzodiazepine sleep aids have a role in facilitating sleep schedule changes in athletes and maximizing sports performance through sleep enhancement.

Adapting planning and scheduling concepts to an engineering perspective: Key issues and successful techniques

International Nuclear Information System (INIS)

Finnegan, J.M.

1986-01-01

Traditional approaches to engineering planning are slanted toward the formats and interests of downstream implementation, and do not always consider the form and criticality of the front-end engineering development process. These processes and scopes are less defined and more subjective than most construction and operations tasks, and require flexible scheduling methods. This paper discusses the characteristics and requirement of engineering schedules, presents concepts for approaching planning in this field, and illustrates simple methods for developing and analyzing engineering plans, and evaluating schedule performance. Engineering plans are structured into a schedule hierarchy which delineates appropriate control and responsibilities, and is governed by key evaluation and decision milestones. Schedule risk analysis considers the uncertainty of engineering tasks, and critical resource constraints. Methods to evaluate schedule performance recognize that engineers and managers are responsible for adequate planning and forecasting, and quality decisions, even if they cannot control all factors influencing schedule results

Economic Benefit from Progressive Integration of Scheduling and Control for Continuous Chemical Processes

Directory of Open Access Journals (Sweden)

Logan D. R. Beal

2017-12-01

Full Text Available Performance of integrated production scheduling and advanced process control with disturbances is summarized and reviewed with four progressive stages of scheduling and control integration and responsiveness to disturbances: open-loop segregated scheduling and control, closed-loop segregated scheduling and control, open-loop scheduling with consideration of process dynamics, and closed-loop integrated scheduling and control responsive to process disturbances and market fluctuations. Progressive economic benefit from dynamic rescheduling and integrating scheduling and control is shown on a continuously stirred tank reactor (CSTR benchmark application in closed-loop simulations over 24 h. A fixed horizon integrated scheduling and control formulation for multi-product, continuous chemical processes is utilized, in which nonlinear model predictive control (NMPC and continuous-time scheduling are combined.

Quarterly report on program cost and schedule

International Nuclear Information System (INIS)

1989-07-01

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

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

Science.gov (United States)

2010-07-01

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

ATLAS construction schedule

CERN Multimedia

Kotamaki, M

The goal during the last few months has been to freeze and baseline as much as possible the schedules of various ATLAS systems and activities. The main motivations for the re-baselining of the schedules have been the new LHC schedule aiming at first collisions in early 2006 and the encountered delays in civil engineering as well as in the production of some of the detectors. The process was started by first preparing a new installation schedule that takes into account all the new external constraints and the new ATLAS staging scenario. The installation schedule version 3 was approved in the March EB and it provides the Ready For Installation (RFI) milestones for each system, i.e. the date when the system should be available for the start of the installation. TCn is now interacting with the systems aiming at a more realistic and resource loaded version 4 before the end of the year. Using the new RFI milestones as driving dates a new summary schedule has been prepared, or is under preparation, for each system....

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

DEFF Research Database (Denmark)

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

that this is possible with only negligible impact on the schedule period. We evaluate the scheduler with seven different applications from the MCSL NOC benchmark suite. We observe that the metaheuristics perform better than the greedy solution. In the special case of all-to-all communication with equal bandwidths...

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.

Sensor Transmission Power Schedule for Smart Grids

Science.gov (United States)

Gao, C.; Huang, Y. H.; Li, J.; Liu, X. D.

2017-11-01

Smart grid has attracted much attention by the requirement of new generation renewable energy. Nowadays, the real-time state estimation, with the help of phasor measurement unit, plays an important role to keep smart grid stable and efficient. However, the limitation of the communication channel is not considered by related work. Considering the familiar limited on-board batteries wireless sensor in smart grid, transmission power schedule is designed in this paper, which minimizes energy consumption with proper EKF filtering performance requirement constrain. Based on the event-triggered estimation theory, the filtering algorithm is also provided to utilize the information contained in the power schedule. Finally, its feasibility and performance is demonstrated using the standard IEEE 39-bus system with phasor measurement units (PMUs).

Effect of Collector Aspect Ratio on the Thermal Performance of Wavy Finned Absorber Solar Air Heater

OpenAIRE

Abhishek Priyam; Prabha Chand

2016-01-01

A theoretical investigation on the effect of collector aspect ratio on the thermal performance of wavy finned absorber solar air heaters has been performed. For the constant collector area, the various performance parameters have been calculated for plane and wavy finned solar air heaters. It has been found that the performance of wavy finned solar air heater improved with the increase in the collector aspect ratio. The performance of wavy finned solar air heater has been found 30 percent hig...

Research on the ITOC based scheduling system for ship piping production

Science.gov (United States)

Li, Rui; Liu, Yu-Jun; Hamada, Kunihiro

2010-12-01

Manufacturing of ship piping systems is one of the major production activities in shipbuilding. The schedule of pipe production has an important impact on the master schedule of shipbuilding. In this research, the ITOC concept was introduced to solve the scheduling problems of a piping factory, and an intelligent scheduling system was developed. The system, in which a product model, an operation model, a factory model, and a knowledge database of piping production were integrated, automated the planning process and production scheduling. Details of the above points were discussed. Moreover, an application of the system in a piping factory, which achieved a higher level of performance as measured by tardiness, lead time, and inventory, was demonstrated.

Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows

DEFF Research Database (Denmark)

Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn

2012-01-01

This paper deals with the problem of scheduling feeding tasks of a single mobile robot which has capability of supplying parts to feeders on pro-duction lines. The performance criterion is to minimize the total traveling time of the robot and the total tardiness of the feeding tasks being scheduled...

Scheduling in Heterogeneous Grid Environments: The Effects of DataMigration

Energy Technology Data Exchange (ETDEWEB)

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

2004-01-01

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 goal can be fully realized. One problem critical to the effective utilization of computational grids is efficient job scheduling. Our prior work addressed this challenge by defining a grid scheduling architecture and several job migration strategies. The focus of this study is to explore the impact of data migration under a variety of demanding grid conditions. We evaluate our grid scheduling algorithms by simulating compute servers, various groupings of servers into sites, and inter-server networks, using real workloads obtained from leading supercomputing centers. Several key performance metrics are used to compare the behavior of our algorithms against reference local and centralized scheduling schemes. Results show the tremendous benefits of grid scheduling, even in the presence of input/output data migration - while highlighting the importance of utilizing communication-aware scheduling schemes.

CellSs: Scheduling Techniques to Better Exploit Memory Hierarchy

Directory of Open Access Journals (Sweden)

Pieter Bellens

2009-01-01

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

Automatic Generation of Heuristics for Scheduling

Science.gov (United States)

Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

1997-01-01

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

OpenAIRE

Chen, Ruey-Maw; Wang, Chuin-Mu

2011-01-01

The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimo...

The impact of sex ratio and economic status on local birth rates

OpenAIRE

Chipman, A.; Morrison, E.

2013-01-01

Human mating and reproductive behaviour can vary depending on various mechanisms, including the local sex ratio. Previous research shows that as sex ratios become female-biased, women from economically deprived areas are less likely to delay reproductive opportunities to wait for a high-investing mate but instead begin their reproductive careers sooner. Here, we show that the local sex ratio also has an impact on female fertility schedules. At young ages, a female-biased ratio is associated w...

Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

Science.gov (United States)

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

2016-02-01

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

Military Free Fall Scheduling And Manifest Optimization Model

Science.gov (United States)

2016-12-01

zone. As interest in qualifying more personnel increased, the course expanded. By the mid-1990s, Reyes explains, a new location was required to better...Since 2005, the Chilean Professional Soccer Association has used operations research techniques to schedule professional leagues in Chile . These...a new parachute the students are using, the RA-1. The RA-1 parachute has a longer glide ratio, which means the rate of descent is slower than with

On Multiple Users Scheduling Using Superposition Coding over Rayleigh Fading Channels

KAUST Repository

Zafar, Ammar

2013-02-20

In this letter, numerical results are provided to analyze the gains of multiple users scheduling via superposition coding with successive interference cancellation in comparison with the conventional single user scheduling in Rayleigh blockfading broadcast channels. The information-theoretic optimal power, rate and decoding order allocation for the superposition coding scheme are considered and the corresponding histogram for the optimal number of scheduled users is evaluated. Results show that at optimality there is a high probability that only two or three users are scheduled per channel transmission block. Numerical results for the gains of multiple users scheduling in terms of the long term throughput under hard and proportional fairness as well as for fixed merit weights for the users are also provided. These results show that the performance gain of multiple users scheduling over single user scheduling increases when the total number of users in the network increases, and it can exceed 10% for high number of users

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

Planning Risk-Based SQC Schedules for Bracketed Operation of Continuous Production Analyzers.

Science.gov (United States)

Westgard, James O; Bayat, Hassan; Westgard, Sten A

2018-02-01

To minimize patient risk, "bracketed" statistical quality control (SQC) is recommended in the new CLSI guidelines for SQC (C24-Ed4). Bracketed SQC requires that a QC event both precedes and follows (brackets) a group of patient samples. In optimizing a QC schedule, the frequency of QC or run size becomes an important planning consideration to maintain quality and also facilitate responsive reporting of results from continuous operation of high production analytic systems. Different plans for optimizing a bracketed SQC schedule were investigated on the basis of Parvin's model for patient risk and CLSI C24-Ed4's recommendations for establishing QC schedules. A Sigma-metric run size nomogram was used to evaluate different QC schedules for processes of different sigma performance. For high Sigma performance, an effective SQC approach is to employ a multistage QC procedure utilizing a "startup" design at the beginning of production and a "monitor" design periodically throughout production. Example QC schedules are illustrated for applications with measurement procedures having 6-σ, 5-σ, and 4-σ performance. Continuous production analyzers that demonstrate high σ performance can be effectively controlled with multistage SQC designs that employ a startup QC event followed by periodic monitoring or bracketing QC events. Such designs can be optimized to minimize the risk of harm to patients. © 2017 American Association for Clinical Chemistry.

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

Prediction of working memory performance in schizophrenia by plasma ratio of clozapine to N-desmethylclozapine.

Science.gov (United States)

Rajji, Tarek K; Mulsant, Benoit H; Davies, Simon; Kalache, Sawsan M; Tsoutsoulas, Christopher; Pollock, Bruce G; Remington, Gary

2015-06-01

Clozapine's potent antagonism of muscarinic M1 receptors is thought to worsen working memory deficits associated with schizophrenia. In contrast, its major metabolite, N-desmethylclozapine (NDMC), is thought to enhance working memory via its M1 receptor agonist activity. The authors hypothesized that the ratio of serum clozapine and NDMC concentrations would be inversely associated with working memory performance in schizophrenia. Thirty patients with schizophrenia or schizoaffective disorder who were receiving clozapine monotherapy at bedtime completed the MATRICS Consensus Cognitive Battery (MCCB) on the day their blood was collected to assess concentrations of clozapine and NDMC as well as serum anticholinergic activity. The clozapine/NDMC ratio was significantly and negatively associated with working memory performance after controlling for age, gender, education, and symptom severity. No significant associations were found between individual clozapine and NDMC concentrations and working memory performance. Serum anticholinergic activity was significantly associated with clozapine concentration, but not with working memory performance or NDMC concentration. No significant associations were found between any pharmacological measure and performance on other MCCB cognitive domains. This hypothesis-driven study confirms that clozapine/NDMC ratio is a strong predictor of working memory performance in patients with schizophrenia. This finding suggests that manipulating the clozapine/NDMC ratio could enhance cognition in patients with schizophrenia treated with clozapine. It also supports the study of procholinergic agents, such as M1 receptor-positive allosteric modulators, to enhance cognition in schizophrenia.

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.

An application of gain-scheduled control using state-space interpolation to hydroactive gas bearings

DEFF Research Database (Denmark)

Theisen, Lukas Roy Svane; Camino, Juan F.; Niemann, Hans Henrik

2016-01-01

with a gain-scheduling strategy using state-space interpolation, which avoids both the performance loss and the increase of controller order associated to the Youla parametrisation. The proposed state-space interpolation for gain-scheduling is applied for mass imbalance rejection for a controllable gas...... bearing scheduled in two parameters. Comparisons against the Youla-based scheduling demonstrate the superiority of the state-space interpolation....

Gain and exposure scheduling to compensate for photorefractive neural-network weight decay

Science.gov (United States)

Goldstein, Adam A.; Petrisor, Gregory C.; Jenkins, B. Keith

1995-03-01

A gain and exposure schedule that theoretically eliminates the effect of photorefractive weight decay for the general class of outer-product neural-network learning algorithms (e.g., backpropagation, Widrow-Hoff, perceptron) is presented. This schedule compensates for photorefractive diffraction-efficiency decay by iteratively increasing the spatial-light-modulator transfer function gain and decreasing the weight-update exposure time. Simulation results for the scheduling procedure, as applied to backpropagation learning for the exclusive-OR problem, show improved learning performance compared with results for networks trained without scheduling.

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

Directory of Open Access Journals (Sweden)

Lianfei Yu

2017-01-01

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

The effect of alternative work schedules (AWS) on performance during acquisition based testing at the U.S. Army Aberdeen Test Center

OpenAIRE

Thomas, Alicia J.

2014-01-01

Approved for public release; distribution is unlimited This project analyzed the effects of an alternate work schedule (AWS) on the performance of acquisition based testing conducted at the U.S. Army Aberdeen Test Center (ATC), a subordinate test center to the U.S. Army Test and Evaluation Command. The literature review uncovered how an AWS improved employee work and life balance and performance at three separate external companies. Other potential AWS success factors such as employee abse...

Onboard Autonomous Scheduling Intelligence System, Phase I

Data.gov (United States)

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

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.

Missed deadline notification in best-effort schedulers

Science.gov (United States)

Banachowski, Scott A.; Wu, Joel; Brandt, Scott A.

2003-12-01

It is common to run multimedia and other periodic, soft real-time applications on general-purpose computer systems. These systems use best-effort scheduling algorithms that cannot guarantee applications will receive responsive scheduling to meet deadline or timing requirements. We present a simple mechanism called Missed Deadline Notification (MDN) that allows applications to notify the system when they do not receive their desired level of responsiveness. Consisting of a single system call with no arguments, this simple interface allows the operating system to provide better support for soft real-time applications without any a priori information about their timing or resource needs. We implemented MDN in three different schedulers: Linux, BEST, and BeRate. We describe these implementations and their performance when running real-time applications and discuss policies to prevent applications from abusing MDN to gain extra resources.

The effect of sunny area ratios on the thermal performance of solar ponds

International Nuclear Information System (INIS)

Bozkurt, Ismail; Karakilcik, Mehmet

2015-01-01

Highlights: • The effect of sunny area ratio on model solar ponds in different geometries. • The sunny area ratio was calculated for 8 different cases. • The efficiency of the model solar pond was determined for 8 different cases. • The energy efficiencies of the solar pond are affected by the sizes of the solar pond, strongly. • The results help to select the sizes of the solar pond before construction. - Abstract: In this study, we investigated the effect of the sunny area ratios on thermal efficiency of model solar pond for different cases in Adiyaman, Turkey. For this purpose, we modeled the solar ponds to compute theoretical sunny area ratios of the zones and temperature distributions in order to find the performance of the model solar ponds. Incorporating the finite difference approach, one and two dimensional heat balances were written for inner zones and insulation side walls. Through, careful determination of the dimensions, insulation parameter and incoming solar radiation reaching the storage zone increased the efficiency of the solar pond. The efficiencies of the model solar pond were determined for case1a–2a–3a–4a to be maximum 14.93%, 20.42%, 23.51% and 27.84%, and for case1b–2b–3b–4b to be maximum 12.65%, 16.76%, 21.37% and 23.30% in August, respectively. With the increase of the sunny area ratio, the performance of the solar pond significantly increased. However, with the increasing rate of the surface area, performance increase rate decreased gradually. The results provide a strong perspective to determine the dimensions of the solar pond before starting the project of a solar pond

Scheduling for energy and reliability management on multiprocessor real-time systems

Science.gov (United States)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

Job shop scheduling by local search

NARCIS (Netherlands)

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

1994-01-01

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

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

International Nuclear Information System (INIS)

Tonkinson, J.A.

1994-01-01

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

IMPACT OF BUFFER SIZE ON PQRS AND D-PQRS SCHEDULING ALGORITHMS

OpenAIRE

N. Narayanan Prasanth; Kannan Balasubramanian; R. Chithra Devi

2016-01-01

Most of the internet applications required high speed internet connectivity. Crosspoint Buffered Switches are widely used switching architectures and designing a scheduling algorithm is a major challenge. PQRS and D-PQRS are the two most successful schedulers used in Crosspoint Buffered Switches under unicast traffic. In this paper, we analysed the performance of PQRS and DPQRS algorithms by varying the crosspoint buffer size. Simulation result shows the delay performance of the switch increa...

An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

Directory of Open Access Journals (Sweden)

Jianhui Mou

2014-01-01

Full Text Available The goal of the scheduling is to arrange operations on suitable machines with optimal sequence for corresponding objectives. In order to meet market requirements, scheduling systems must own enough flexibility against uncertain events. These events can change production status or processing parameters, even causing the original schedule to no longer be optimal or even to be infeasible. Traditional scheduling strategies, however, cannot cope with these cases. Therefore, a new idea of scheduling called inverse scheduling has been proposed. In this paper, the inverse scheduling with weighted completion time (SMISP is considered in a single-machine shop environment. In this paper, an improved genetic algorithm (IGA with a local searching strategy is proposed. To improve the performance of IGA, efficient encoding scheme, fitness evaluation mechanism, feasible initialization methods, and a local search procedure have been employed in the paper. Because of the local improving method, the proposed IGA can balance its exploration ability and exploitation ability. We adopt 27 instances to verify the effectiveness of the proposed algorithm. The experimental results illustrated that the proposed algorithm can generate satisfactory solutions. This approach also has been applied to solve the scheduling problem in the real Chinese shipyard and can bring some benefits.

Real-Time Scheduling for Preventing Information Leakage with Preemption Overheads

Directory of Open Access Journals (Sweden)

BAEK, H.

2017-05-01

Full Text Available Real-time systems (RTS are characterized by tasks executing in a timely manner to meet its deadlines as a real-time constraint. Most studies of RTS have focused on these criteria as primary design points. However, recent increases in security threats to various real-time systems have shown that enhanced security support must be included as an important design point, retro-fitting such support to existing systems as necessary. In this paper, we propose a new pre-flush technique referred to as flush task reservation for FP scheduling (FTR-FP to conditionally sanitize the state of resources shared by real-time tasks by invoking a flush task (FT in order to mitigate information leakage/corruption of real-time systems. FTR-FP extends existing works exploiting FTs to be applicable more general scheduling algorithms and security model. We also propose modifications to existing real-time scheduling algorithms to implement a pre-flush technique as a security constraint, and analysis technique to verify schedulability of the real-time scheduling. For better analytic capability, our analysis technique provides a count of the precise number of preemptions that a task experiences offline. Our evaluation results demonstrate that our proposed schedulability analysis improves the performance of existing scheduling algorithms in terms of schedulability and preemption cost.

基于ISM的动态优先级调度算法%Dynamic Priority Schedule Algorithm Based on ISM

Institute of Scientific and Technical Information of China (English)

余祖峰; 蔡启先; 刘明

2011-01-01

The EDF schedule algorithm, one of main real-time schedule algorithms of the embedded Linux operating system, can not solve the overload schedule.For this, the paper introduces SLAD algorithm and BACKSLASH algorithm, which have good performance of system load.According to thinking of ISM algorithm, it puts forward a kind of dynamic priority schedule algorithm.According to case of overloads within some time, the algorithm can adjust EDF algorithm and SLAD algorithm neatly, thus improves schedule efficiency of system in usual load and overload cases.Test results for real-time tasks Deadline Miss Ratio(DMR) show its improvement effect.%在嵌入式Linux操作系统的实时调度算法中,EDF调度算法不能解决负载过载问题.为此,引进对系统负载有着良好表现的SLAD算法和BACKSLASH算法.基于ISM算法思路,提出一种动态优先级调度算法.该算法能根据一段时间内负载过载的情况,灵活地调度EDF算法和SLAD算法,从面提高系统在正常负载和过载情况下的调度效率.对实时任务截止期错失率DMR指标的测试结果证明了其改进效果.

A distributed scheduling algorithm for heterogeneous real-time systems

Science.gov (United States)

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

1991-01-01

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

Optimal imaging surveillance schedules after liver-directed therapy for hepatocellular carcinoma.

Science.gov (United States)

Boas, F Edward; Do, Bao; Louie, John D; Kothary, Nishita; Hwang, Gloria L; Kuo, William T; Hovsepian, David M; Kantrowitz, Mark; Sze, Daniel Y

2015-01-01

To optimize surveillance schedules for the detection of recurrent hepatocellular carcinoma (HCC) after liver-directed therapy. New methods have emerged that allow quantitative analysis and optimization of surveillance schedules for diseases with substantial rates of recurrence such as HCC. These methods were applied to 1,766 consecutive chemoembolization, radioembolization, and radiofrequency ablation procedures performed on 910 patients between 2006 and 2011. Computed tomography or magnetic resonance imaging performed just before repeat therapy was set as the time of "recurrence," which included residual and locally recurrent tumor as well as new liver tumors. Time-to-recurrence distribution was estimated by Kaplan-Meier method. Average diagnostic delay (time between recurrence and detection) was calculated for each proposed surveillance schedule using the time-to-recurrence distribution. An optimized surveillance schedule could then be derived to minimize the average diagnostic delay. Recurrence is 6.5 times more likely in the first year after treatment than in the second. Therefore, screening should be much more frequent in the first year. For eight time points in the first 2 years of follow-up, the optimal schedule is 2, 4, 6, 8, 11, 14, 18, and 24 months. This schedule reduces diagnostic delay compared with published schedules and is cost-effective. The calculated optimal surveillance schedules include shorter-interval follow-up when there is a higher probability of recurrence and longer-interval follow-up when there is a lower probability. Cost can be optimized for a specified acceptable diagnostic delay or diagnostic delay can be optimized within a specified acceptable cost. Copyright © 2015 SIR. Published by Elsevier Inc. All rights reserved.

Effects of Different Doping Ratio of Cu Doped CdS on QDSCs Performance

Directory of Open Access Journals (Sweden)

Xiaojun Zhu

2015-01-01

Full Text Available We use the successive ionic layer adsorption and reaction (SILAR method for the preparation of quantum dot sensitized solar cells, to improve the performance of solar cells by doping quantum dots. We tested the UV-Vis absorption spectrum of undoped CdS QDSCs and Cu doped CdS QDSCs with different doping ratios. The doping ratios of copper were 1 : 100, 1 : 500, and 1 : 1000, respectively. The experimental results show that, under the same SILAR cycle number, Cu doped CdS quantum dot sensitized solar cells have higher open circuit voltage, short circuit current density photoelectric conversion efficiency than undoped CdS quantum dots sensitized solar cells. Refinement of Cu doping ratio are 1 : 10, 1 : 100, 1 : 200, 1 : 500, and 1 : 1000. When the proportion of Cu and CdS is 1 : 10, all the parameters of the QDSCs reach the minimum value, and, with the decrease of the proportion, the short circuit current density, open circuit voltage, and the photoelectric conversion efficiency are all increased. When proportion is 1 : 500, all parameters reach the maximum values. While with further reduction of the doping ratio of Cu, the parameters of QDSCs have a decline tendency. The results showed that, in a certain range, the lower the doping ratio of Cu, the better the performance of quantum dot sensitized solar cell.

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.

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

Science.gov (United States)

Zhai, Wenzheng; Hu, Yue-Li; Ran, Feng

2017-07-01

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

Flow-shop scheduling problem under uncertainties: Review and trends

Directory of Open Access Journals (Sweden)

Eliana María González-Neira

2017-03-01

Full Text Available Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. Thus, it is important to study scheduling and sequencing activities under uncertainties since they can cause infeasibilities and disturbances. The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research. To this end, 100 papers about FS and flexible flow-shop scheduling problems published from 2001 to October 2016 were analyzed and classified. Trends in the reviewed literature are presented and finally some research opportunities in the field are proposed.

An extended Intelligent Water Drops algorithm for workflow scheduling in cloud computing environment

Directory of Open Access Journals (Sweden)

Shaymaa Elsherbiny

2018-03-01

Full Text Available Cloud computing is emerging as a high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. Many resource management methods may enhance the efficiency of the whole cloud computing system. The key part of cloud computing resource management is resource scheduling. Optimized scheduling of tasks on the cloud virtual machines is an NP-hard problem and many algorithms have been presented to solve it. The variations among these schedulers are due to the fact that the scheduling strategies of the schedulers are adapted to the changing environment and the types of tasks. The focus of this paper is on workflows scheduling in cloud computing, which is gaining a lot of attention recently because workflows have emerged as a paradigm to represent complex computing problems. We proposed a novel algorithm extending the natural-based Intelligent Water Drops (IWD algorithm that optimizes the scheduling of workflows on the cloud. The proposed algorithm is implemented and embedded within the workflows simulation toolkit and tested in different simulated cloud environments with different cost models. Our algorithm showed noticeable enhancements over the classical workflow scheduling algorithms. We made a comparison between the proposed IWD-based algorithm with other well-known scheduling algorithms, including MIN-MIN, MAX-MIN, Round Robin, FCFS, and MCT, PSO and C-PSO, where the proposed algorithm presented noticeable enhancements in the performance and cost in most situations.

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

Science.gov (United States)

Niu, X. N.; Tang, H.; Wu, L. X.

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

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

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

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Kosar, Tevfik

2010-05-20

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

Appearance of Abnormal Cardiothoracic Ratio of Fetuses with Hemoglobin Bart's Disease: Life Table Analysis.

Science.gov (United States)

Wanapirak, Chanane; Sirichotiyakul, Supatra; Luewan, Suchaya; Srisupundit, Kasemsri; Tongprasert, Fuanglada; Tongsong, Theera

2017-10-01

Objective  To determine the timeline of the first appearance of an increased CT ratio of fetuses with hemoglobin (Hb) Bart's disease. Materials and Methods  A prospective longitudinal study was conducted on pregnancies at risk for fetal Hb Bart's disease. Sonographic markers including cardiothoracic (CT) ratio and middle cerebral artery peak systolic velocity (MCA-PSV) were serially assessed and recorded from the first trimester. The definite diagnosis of fetal Hb Bart's disease based on DNA analysis (CVS), or fetal Hb typing (HPLC; cordocentesis) was performed at the first appearance of an increased CT ratio. Results  Of 275 pregnancies at risk, 64 fetuses were finally proven to be affected and life table analysis was performed. Most affected fetuses showed an increased CT ratio in late first trimester and early second trimester, with median time of the first appearance at 13 weeks and all affected fetuses were detected at 23 weeks or less. The CT ratio yielded a sensitivity of 100 % at a gestational age of 23 weeks with a false-positive rate of 8 %. MCA-PSV appeared later than CT ratio. Only 9.4 % of affected cases developed abnormal MCA-PSV before an increased CT ratio. Conclusion  The timeline of the first appearance of an increased CT ratio of fetuses with Hb Bart's disease was established. This may help us identify Hb Bart's disease among fetuses at risk in earlier gestation and proper schedules for serial ultrasound could be made more effectively. © Georg Thieme Verlag KG Stuttgart · New York.

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

Directory of Open Access Journals (Sweden)

Weiwei Lin

2016-01-01

Full Text Available Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual machine power efficiency-aware greedy scheduling algorithm (VPEGS. As a heuristic algorithm, VPEGS estimates task energy by considering factors including task resource demands, VM power efficiency, and server workload before scheduling tasks in a greedy manner. We simulated a heterogeneous VM cluster and conducted experiment to evaluate the effectiveness of VPEGS. Simulation results show that VPEGS effectively reduced total energy consumption by more than 20% without producing large scheduling overheads. With the similar heuristic ideology, it outperformed Min-Min and RASA with respect to energy saving by about 29% and 28%, respectively.

Advance Resource Provisioning in Bulk Data Scheduling

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet

2012-10-01

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

Coordinates for a High Performance 4:1 Pressure Ratio Centrifugal Compressor

Science.gov (United States)

McKain, Ted F.; Holbrook, Greg J.

1997-01-01

The objective of this program was to define the aerodynamic design and manufacturing coordinates for an advanced 4:1 pressure ratio, single stage centrifugal compressor at a 10 lbm/sec flow size. The approach taken was to perform an exact scale of an existing DDA compressor originally designed at a flow size of 3.655 lbm/sec.

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.

Shift scheduling limits for the nuclear industry NRC policy and recommendations

International Nuclear Information System (INIS)

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

1985-01-01

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

Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2011

Energy Technology Data Exchange (ETDEWEB)

Bisping, Lynn E.

2011-01-21

This document contains the calendar year 2011 schedule for the routine collection of samples for the Surface Environmental Surveillance Project and the Drinking Water Monitoring Project. Each section includes sampling locations, sampling frequencies, sample types, and analyses to be performed. In some cases, samples are scheduled on a rotating basis. If a sample will not be collected in 2011, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2011.

Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2007

Energy Technology Data Exchange (ETDEWEB)

Bisping, Lynn E.

2007-01-31

This document contains the calendar year 2007 schedule for the routine collection of samples for the Surface Environmental Surveillance Project and Drinking Water Monitoring Project. Each section includes sampling locations, sampling frequencies, sample types, and analyses to be performed. In some cases, samples are scheduled on a rotating basis and may not be collected in 2007 in which case the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2007.

Schedule Analytics

Science.gov (United States)

2016-04-30

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

The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

Directory of Open Access Journals (Sweden)

Babar Nazir

2018-05-01

Full Text Available Data Grids deal with geographically-distributed large-scale data-intensive applications. Schemes scheduled for data grids attempt to not only improve data access time, but also aim to improve the ratio of data availability to a node, where the data requests are generated. Data replication techniques manage large data by storing a number of data files efficiently. In this paper, we propose centralized dynamic scheduling strategy-replica placement strategies (CDSS-RPS. CDSS-RPS schedule the data and task so that it minimizes the implementation cost and data transfer time. CDSS-RPS consists of two algorithms, namely (a centralized dynamic scheduling (CDS and (b replica placement strategy (RPS. CDS considers the computing capacity of a node and finds an appropriate location for the job. RPS attempts to improve file access time by using replication on the basis of number of accesses, storage capacity of a computing node, and response time of a requested file. Extensive simulations are carried out to demonstrate the effectiveness of the proposed strategy. Simulation results demonstrate that the replication and scheduling strategies improve the implementation cost and average access time significantly.

Compilation time analysis to minimize run-time overhead in preemptive scheduling on multiprocessors

Science.gov (United States)

Wauters, Piet; Lauwereins, Rudy; Peperstraete, J.

1994-10-01

This paper describes a scheduling method for hard real-time Digital Signal Processing (DSP) applications, implemented on a multi-processor. Due to the very high operating frequencies of DSP applications (typically hundreds of kHz) runtime overhead should be kept as small as possible. Because static scheduling introduces very little run-time overhead it is used as much as possible. Dynamic pre-emption of tasks is allowed if and only if it leads to better performance in spite of the extra run-time overhead. We essentially combine static scheduling with dynamic pre-emption using static priorities. Since we are dealing with hard real-time applications we must be able to guarantee at compile-time that all timing requirements will be satisfied at run-time. We will show that our method performs at least as good as any static scheduling method. It also reduces the total amount of dynamic pre-emptions compared with run time methods like deadline monotonic scheduling.

Evaluation of the 12-hour shift schedule at the Fast Flux Test Facility

International Nuclear Information System (INIS)

Lewis, P.M.; Swaim, D.J.; Rosa, R.R.; Colligan, M.J.; Booth, R.J.; Swint, M.J.

1986-09-01

The objective of this report are to evaluate the effect of the change to the 12-hour/day schedule on operational performance and safety of FFTF; to evaluate the degree to which the change to the 12-hour/day schedule has met its objectives; and to gather information that may be useful to FFTF management and the US Department of Energy (DOE) in evaluating 8- and 12-hour shift schedules at other facilities. The principal conclusion of this report is that the 12-hour/day shift schedule is a reasonable alternative to an 8-hour/day schedule at FFTF. As a result of the scedule change, it seems clear that plant performance improved in two ways. The operator error rate in keeping the Technical Specification Compliance Logs was already very low on the 8-hour shift. On the 12-hour shift, the rate was even lower. Also, the operator interface with craft personnel resulted in an increase in the productivity of the craft personnel

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

Scheduling algorithm for data relay satellite optical communication based on artificial intelligent optimization

Science.gov (United States)

Zhao, Wei-hu; Zhao, Jing; Zhao, Shang-hong; Li, Yong-jun; Wang, Xiang; Dong, Yi; Dong, Chen

2013-08-01

Optical satellite communication with the advantages of broadband, large capacity and low power consuming broke the bottleneck of the traditional microwave satellite communication. The formation of the Space-based Information System with the technology of high performance optical inter-satellite communication and the realization of global seamless coverage and mobile terminal accessing are the necessary trend of the development of optical satellite communication. Considering the resources, missions and restraints of Data Relay Satellite Optical Communication System, a model of optical communication resources scheduling is established and a scheduling algorithm based on artificial intelligent optimization is put forwarded. According to the multi-relay-satellite, multi-user-satellite, multi-optical-antenna and multi-mission with several priority weights, the resources are scheduled reasonable by the operation: "Ascertain Current Mission Scheduling Time" and "Refresh Latter Mission Time-Window". The priority weight is considered as the parameter of the fitness function and the scheduling project is optimized by the Genetic Algorithm. The simulation scenarios including 3 relay satellites with 6 optical antennas, 12 user satellites and 30 missions, the simulation result reveals that the algorithm obtain satisfactory results in both efficiency and performance and resources scheduling model and the optimization algorithm are suitable in multi-relay-satellite, multi-user-satellite, and multi-optical-antenna recourses scheduling problem.

Coordinating space telescope operations in an integrated planning and scheduling architecture

Science.gov (United States)

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

1992-01-01

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

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

Directory of Open Access Journals (Sweden)

Mihai-Victor Micea

2017-06-01

Full Text Available Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H2RTS, which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU utilization factor. From the detailed, integrated schedulability analysis of the H2RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks.

Science.gov (United States)

Micea, Mihai-Victor; Stangaciu, Cristina-Sorina; Stangaciu, Valentin; Curiac, Daniel-Ioan

2017-06-26

Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H²RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU) utilization factor. From the detailed, integrated schedulability analysis of the H²RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.

Use of Perceive, Recall, Plan, Perform Stage Two Cognitive Task Analysis for Students with Autism and Intellectual Disability: The Impact of a Sensory Activity Schedule

Science.gov (United States)

Mills, Caroline; Chapparo, Christine

2017-01-01

The aim of this study was to determine the impact of a classroom sensory activity schedule (SAS) on cognitive strategy use during task performance. This work studies a single-system AB research design with seven students with autism and intellectual disability. Repeated measures using the Perceive, Recall, Plan and Perform (PRPP) Cognitive Task…

Using Integer Programming for Airport Service Planning in Staff Scheduling

Directory of Open Access Journals (Sweden)

W.H. Ip

2010-09-01

Full Text Available Reliability and safety in flight is extremely necessary and that depend on the adoption of proper maintenance system. Therefore, it is essential for aircraft maintenance companies to perform the manpower scheduling efficiently. One of the objectives of this paper is to provide an Integer Programming approach to determine the optimal solutions to aircraft maintenance planning and scheduling and hence the planning and scheduling processes can become more efficient and effective. Another objective is to develop a set of computational schedules for maintenance manpower to cover all scheduled flights. In this paper, a sequential methodology consisting of 3 stages is proposed. They are initial maintenance demand schedule, the maintenance pairing and the maintenance group(s assignment. Since scheduling would split up into different stages, different mathematical techniques have been adopted to cater for their own problem characteristics. Microsoft Excel would be used. Results from the first stage and second stage would be inputted into integer programming model using Microsoft Excel Solver to find the optimal solution. Also, Microsoft Excel VBA is used for devising a scheduling system in order to reduce the manual process and provide a user friendly interface. For the results, all can be obtained optimal solution and the computation time is reasonable and acceptable. Besides, the comparison of the peak time and non-peak time is discussed.

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

OpenAIRE

Weiwei Lin; Wentai Wu; James Z. Wang

2016-01-01

Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual ...

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

Nuclear power plant maintenance scheduling dilemma: a genetic algorithm approach

International Nuclear Information System (INIS)

Mahdavi, M.H.; Modarres, M.

2004-01-01

There are huge numbers of components scheduled for maintenance when a nuclear power plant is shut down. Among these components, a number of them are safety related which their operability as well as reliability when plant becomes up is main concerns. Not performing proper maintenance on this class of components/system would impose substantial risk on operating the NPP. In this paper a new approach based on genetic algorithms is presented to optimize the NPP maintenance schedule during shutdown. following this approach the cost incurred by maintenance activities for each schedule is balanced with the risk imposed by the maintenance scheduling plan to the plant operation status when it is up. The risk model implemented in the GA scheduler as its evaluation function is developed on the basis of the probabilistic risk assessment methodology. the Ga optimizers itself is shown to be superior compared to other optimization methods such as the monte carlo technique

Upper Bound for Queue length in Regulated Burst Service Scheduling

Directory of Open Access Journals (Sweden)

Mahmood Daneshvar Farzanegan

2016-01-01

Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.

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.

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.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Directory of Open Access Journals (Sweden)

Meng-Hsun Tsai

Full Text Available Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP built on top of MultiPath TCP (MPTCP. CBSP enables users to buy bandwidth on demand from neighbors (called Helpers and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC, to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Science.gov (United States)

Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

LTE uplink scheduling - flow level analysis

NARCIS (Netherlands)

Dimitrova, D.C.; van den Berg, J.L.; Heijenk, G.; Litjens, R.; Sacchi, Claudio; Bellalta, Boris; Vinel, Alexey; Schlegel, Christian; Granelli, Fabrizio; Zhang, Yan

Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

LTE uplink scheduling - Flow level analysis

NARCIS (Netherlands)

Dimitrova, D.C.; Berg, J.L. van den; Heijenk, G.; Litjens, R.

2011-01-01

Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

Measurement of signal-to-noise ratio performance of TV fluoroscopy systems

International Nuclear Information System (INIS)

Geluk, R.J.

1985-01-01

A method has been developed for direct measurement of Signal-to-Noise ratio performance on X-ray TV systems. To this end the TV signal resulting from a calibrated test object, is compared with the noise level in the image. The method is objective and produces instantaneous readout, which makes it very suitable for system evaluation under dynamic conditions. (author)

Cloud computing task scheduling strategy based on improved differential evolution algorithm

Science.gov (United States)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

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.

Model Justified Search Algorithms for Scheduling Under Uncertainty

National Research Council Canada - National Science Library

Howe, Adele; Whitley, L. D

2008-01-01

.... We also identified plateaus as a significant barrier to superb performance of local search on scheduling and have studied several canonical discrete optimization problems to discover and model the nature of plateaus...

Optimal Residential Load Scheduling Under Utility and Rooftop Photovoltaic Units

Directory of Open Access Journals (Sweden)

Ghulam Hafeez

2018-03-01

Full Text Available With the rapid advancement in technology, electrical energy consumption is increasing rapidly. Especially, in the residential sector, more than 80% of electrical energy is being consumed because of consumer negligence. This brings the challenging task of maintaining the balance between the demand and supply of electric power. In this paper, we focus on the problem of load balancing via load scheduling under utility and rooftop photovoltaic (PV units to reduce electricity cost and peak to average ratio (PAR in demand-side management. For this purpose, we adopted genetic algorithm (GA, binary particle swarm optimization (BPSO, wind-driven optimization (WDO, and our proposed genetic WDO (GWDO algorithm, which is a hybrid of GA and WDO, to schedule the household load. For energy cost estimation, combined real-time pricing (RTP and inclined block rate (IBR were used. The proposed algorithm shifts load from peak consumption hours to off-peak hours based on combined pricing scheme and generation from rooftop PV units. Simulation results validate our proposed GWDO algorithm in terms of electricity cost and PAR reduction while considering all three scenarios which we have considered in this work: (1 load scheduling without renewable energy sources (RESs and energy storage system (ESS, (2 load scheduling with RESs, and (3 load scheduling with RESs and ESS. Furthermore, our proposed scheme reduced electricity cost and PAR by 22.5% and 29.1% in scenario 1, 47.7% and 30% in scenario 2, and 49.2% and 35.4% in scenario 3, respectively, as compared to unscheduled electricity consumption.

Computer-based irrigation scheduling for cotton crop

International Nuclear Information System (INIS)

Laghari, K.Q.; Memon, H.M.

2008-01-01

In this study a real time irrigation schedule for cotton crop has been tested using mehran model, a computer-based DDS (Decision Support System). The irrigation schedule was set on selected MAD (Management Allowable Depletion) and the current root depth position. The total 451 mm irrigation water applied to the crop field. The seasonal computed crop ET (Evapotranspiration) was estimated 421.32 mm and actual (ET/sub ca/) observed was 413 mm. The model over-estimated seasonal ET by only 1.94. WUE (Water Use Efficiency) for seed-cotton achieved 6.59 Kg (ha mm)/sup -1/. The statistical analysis (R/sup 2/=0.96, ARE%=2.00, T-1.17 and F=550.57) showed good performance of the model in simulated and observed ET values. The designed Mehran model is designed quite versatile for irrigation scheduling and can be successfully used as irrigation DSS tool for various crop types. (author)

Downlink scheduling using non-orthogonal uplink beams

KAUST Repository

Eltayeb, Mohammed E.

2014-04-01

Opportunistic schedulers rely on the feedback of the channel state information of users in order to perform user selection and downlink scheduling. This feedback increases with the number of users, and can lead to inefficient use of network resources and scheduling delays. We tackle the problem of feedback design, and propose a novel class of nonorthogonal codes to feed back channel state information. Users with favorable channel conditions simultaneously transmit their channel state information via non-orthogonal beams to the base station. The proposed formulation allows the base station to identify the strong users via a simple correlation process. After deriving the minimum required code length and closed-form expressions for the feedback load and downlink capacity, we show that i) the proposed algorithm reduces the feedback load while matching the achievable rate of full feedback algorithms operating over a noiseless feedback channel, and ii) the proposed codes are superior to the Gaussian codes.

Downlink scheduling using non-orthogonal uplink beams

KAUST Repository

Eltayeb, Mohammed E.; Al-Naffouri, Tareq Y.; Bahrami, Hamid Reza Talesh

2014-01-01

Opportunistic schedulers rely on the feedback of the channel state information of users in order to perform user selection and downlink scheduling. This feedback increases with the number of users, and can lead to inefficient use of network resources and scheduling delays. We tackle the problem of feedback design, and propose a novel class of nonorthogonal codes to feed back channel state information. Users with favorable channel conditions simultaneously transmit their channel state information via non-orthogonal beams to the base station. The proposed formulation allows the base station to identify the strong users via a simple correlation process. After deriving the minimum required code length and closed-form expressions for the feedback load and downlink capacity, we show that i) the proposed algorithm reduces the feedback load while matching the achievable rate of full feedback algorithms operating over a noiseless feedback channel, and ii) the proposed codes are superior to the Gaussian codes.

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

Influence of oxygen-metal ratio on mixed-oxide fuel performance

International Nuclear Information System (INIS)

Lawrence, L.A.; Leggett, R.D.

1979-04-01

The fuel oxygen-to-metal ratio (O/M) is recognized as an important consideration for performance of uranium--plutonium oxide fuels. An overview of the effects of differing O/M's on the irradiation performance of reference design mixed-oxide fuel in the areas of chemical and mechanical behavior, thermal performance, and fission gas behavior is presented. The pellet fuel has a nominal composition of 75 wt% UO 2 + 25 wt% PuO 2 at a pellet density of approx. 90% TD. for nominal conditions this results in a smeared density of approx. 85%. The cladding in all cases is 20% CW type 316 stainless steel with an outer diameter of 5.84 to 6.35 mm. O/M has been found to significantly influence fuel pin chemistry, mainly FCCI and fission product and fuel migration. It has little effect on thermal performance and overall mechanical behavior or fission gas release. The effects of O/M (ranging from 1.938 to 1.984) in the areas of fuel pin chemistry, to date, have not resulted in any reduction in fuel pin performance capability to goal burnups of approx. 8 atom% or more

The Impact of Volute Aspect Ratio on the Performance of a Mixed Flow Turbine

Directory of Open Access Journals (Sweden)

Samuel P. Lee

2017-11-01

Full Text Available Current trends in the automotive industry towards engine downsizing mean turbocharging now plays a vital role in engine performance. A turbocharger increases charge air density using a turbine to extract waste energy from the exhaust gas to drive a compressor. Most turbocharger applications employ a radial inflow turbine. However, mixed flow turbines can offer non-zero blade angles, reducing leading edge (LE separation at low velocity ratios. The current paper investigates the performance of a mixed flow turbine with three different volute aspect ratio (AR designs (AR = 0.5, 1 and 2. With constant A/r (ratio of volute area to centroid radius, the AR = 0.5 volute design produced a 4.3% increase in cycle averaged mass flow parameter (MFP compared to the AR = 2 design. For the purpose of performance comparison, it was necessary to manipulate the volute A/r’s to ensure constant MFP for aerodynamic similarity. With the volute A/r’s manipulated to ensure constant MFP for aerodynamic similarity, the maximum variation of cycle averaged normalized efficiency measured between the designs was 1.47%. Purely in the rotor region, the variation in normalized cycle averaged efficiency was 1%. The smallest tested volute aspect ratio showed a significant increase in volute loss while the ARs of 1 and 2 showed similar levels of loss. The smallest AR volute showed significant secondary flow development in the volute. The resulting variation in LE incidence was found to vary as a result.

Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis

OpenAIRE

Shmuel, Ori; Cohen, Asaf; Gurewitz, Omer

2017-01-01

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

Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

Directory of Open Access Journals (Sweden)

Xiaocheng Liu

2012-01-01

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

A demand response modeling for residential consumers in smart grid environment using game theory based energy scheduling algorithm

Directory of Open Access Journals (Sweden)

S. Sofana Reka

2016-06-01

Full Text Available In this paper, demand response modeling scheme is proposed for residential consumers using game theory algorithm as Generalized Tit for Tat (GTFT Dominant Game based Energy Scheduler. The methodology is established as a work flow domain model between the utility and the user considering the smart grid framework. It exhibits an algorithm which schedules load usage by creating several possible tariffs for consumers such that demand is never raised. This can be done both individually and among multiple users of a community. The uniqueness behind the demand response proposed is that, the tariff is calculated for all hours and the load during the peak hours which can be rescheduled is shifted based on the Peak Average Ratio. To enable the vitality of the work simulation results of a general case of three domestic consumers are modeled extended to a comparative performance and evaluation with other algorithms and inference is analyzed.

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

Diagnostic Performance of Bronchoalveolar Lavage Fluid CD4/CD8 Ratio for Sarcoidosis: A Meta-analysis.

Science.gov (United States)

Shen, Yongchun; Pang, Caishuang; Wu, Yanqiu; Li, Diandian; Wan, Chun; Liao, Zenglin; Yang, Ting; Chen, Lei; Wen, Fuqiang

2016-06-01

The usefulness of bronchoalveolar lavage fluid (BALF) CD4/CD8 ratio for diagnosing sarcoidosis has been reported in many studies with variable results. Therefore, we performed a meta-analysis to estimate the overall diagnostic accuracy of BALF CD4/CD8 ratio based on the bulk of published evidence. Studies published prior to June 2015 and indexed in PubMed, OVID, Web of Science, Scopus and other databases were evaluated for inclusion. Data on sensitivity, specificity, positive likelihood ratio (PLR), negative likelihood ratio (NLR), and diagnostic odds ratio (DOR) were pooled from included studies. Summary receiver operating characteristic (SROC) curves were used to summarize overall test performance. Deeks's funnel plot was used to detect publication bias. Sixteen publications with 1885 subjects met our inclusion criteria and were included in this meta-analysis. Summary estimates of the diagnostic performance of the BALF CD4/CD8 ratio were as follows: sensitivity, 0.70 (95%CI 0.64-0.75); specificity, 0.83 (95%CI 0.78-0.86); PLR, 4.04 (95%CI 3.13-5.20); NLR, 0.36 (95%CI 0.30-0.44); and DOR, 11.17 (95%CI 7.31-17.07). The area under the SROC curve was 0.84 (95%CI 0.81-0.87). There was no evidence of publication bias. Measuring the BALF CD4/CD8 ratio may assist in the diagnosis of sarcoidosis when interpreted in parallel with other diagnostic factors. Copyright © 2016 The Authors. Published by Elsevier B.V. All rights reserved.

Comparative study on DuPont analysis and DEA models for measuring stock performance using financial ratio

Science.gov (United States)

Arsad, Roslah; Shaari, Siti Nabilah Mohd; Isa, Zaidi

2017-11-01

Determining stock performance using financial ratio is challenging for many investors and researchers. Financial ratio can indicate the strengths and weaknesses of a company's stock performance. There are five categories of financial ratios namely liquidity, efficiency, leverage, profitability and market ratios. It is important to interpret the ratio correctly for proper financial decision making. The purpose of this study is to compare the performance of listed companies in Bursa Malaysia using Data Envelopment Analysis (DEA) and DuPont analysis Models. The study is conducted in 2015 involving 116 consumer products companies listed in Bursa Malaysia. The estimation method of Data Envelopment Analysis computes the efficiency scores and ranks the companies accordingly. The Alirezaee and Afsharian's method of analysis based Charnes, Cooper and Rhodes (CCR) where Constant Return to Scale (CRS) is employed. The DuPont analysis is a traditional tool for measuring the operating performance of companies. In this study, DuPont analysis is used to evaluate three different aspects such as profitability, efficiency of assets utilization and financial leverage. Return on Equity (ROE) is also calculated in DuPont analysis. This study finds that both analysis models provide different rankings of the selected samples. Hypothesis testing based on Pearson's correlation, indicates that there is no correlation between rankings produced by DEA and DuPont analysis. The DEA ranking model proposed by Alirezaee and Asharian is unstable. The method cannot provide complete ranking because the values of Balance Index is equal and zero.

The High Aspect Ratio Design (HARD): A candidate ITER concept with improved technology phase performance

International Nuclear Information System (INIS)

Nevins, W.M.; Perkins, L.J.; Wesley, J.C.

1992-10-01

The High Aspect Ratio Design (HARD) International Thermonuclear Experimental Reactor (ITER) concept developed by the US ITER team is an alternate to the low-aspect-ratio ITER design developed by the ITER participants during the Conceptual Design Activity (CDA). The CDA design, referred to hereafter as ITER CDA, has an aspect ratio, A, of 2.79, a toroidal magnetic field, B T , of 4.85 T, and a plasma current, I p , of 22 MA for operation with an ignited plasma. In contrast, HARD employs higher aspect ratio, A = 4.0, higher toroidal field, B T = 7.11 T, and lower plasma current, I p = 14.8 MA for ignition operation. The cross sections of the two designs are compared in. The parameters and performance of HARD and ITER CDA for inductively driven ignition operation are compared in. The HARD parameters provide the same ignition performance (ignition margin evaluated against ITER-89P confinement scaling) as ITER CDA in a device with comparable size and cost. However, the reason for advancing HARD rather than ITER CDA as the ITER design concept is not inductively driven ignition performance but HARD's significantly enhanced potential to achieve the technology testing and steady-state operation goals of the ITER objectives with non-inductive current drive

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

Propagation techniques. A simulation platform, an analysis tool and different test case scenarios for CTA were developed to test the performance of the scheduler and are also described.

Cocaine tolerance: acute versus chronic effects as dependent upon fixed-ratio size.

OpenAIRE

Hoffman, S H; Branch, M N; Sizemore, G M

1987-01-01

The effects of cocaine on operant behavior were studied by examining fixed-ratio value as a factor in the development of tolerance. Pigeons pecked a response key under a three-component multiple schedule, with each bird being exposed to fixed-ratio values that were categorized as small, medium, or large. Administered acutely, cocaine (1.0 to 10.0 mg/kg) produced dose-related decreases in overall rate of responding. Responding maintained by the largest ratio was decreased by lower doses than t...

Evaluation of the Terminal Area Precision Scheduling and Spacing System for Performance-Based Navigation Arrivals

Science.gov (United States)

Jung, Jaewoo; Swenson, Harry; Thipphavong, Jane; Martin, Lynne Hazel; Chen, Liang; Nguyen, Jimmy

2013-01-01

The growth of global demand for air transportation has put increasing strain on the nation's air traffic management system. To relieve this strain, the International Civil Aviation Organization has urged all nations to adopt Performance-Based Navigation (PBN), which can help to reduce air traffic congestion, decrease aviation fuel consumption, and protect the environment. NASA has developed a Terminal Area Precision Scheduling and Spacing (TAPSS) system that can support increased use of PBN during periods of high traffic, while supporting fuel-efficient, continuous descent approaches. In the original development of this system, arrival aircraft are assigned fuel-efficient Area Navigation (RNAV) Standard Terminal Arrival Routes before their initial descent from cruise, with routing defined to a specific runway. The system also determines precise schedules for these aircraft that facilitate continuous descent through the assigned routes. To meet these schedules, controllers are given a set of advisory tools to precisely control aircraft. The TAPSS system has been evaluated in a series of human-in-the-loop (HITL) air traffic simulations during 2010 and 2011. Results indicated increased airport arrival throughput up to 10 over current operations, and maintained fuel-efficient aircraft decent profiles from the initial descent to landing with reduced controller workload. This paper focuses on results from a joint NASA and FAA HITL simulation conducted in 2012. Due to the FAA rollout of the advance terminal area PBN procedures at mid-sized airports first, the TAPSS system was modified to manage arrival aircraft as they entered Terminal Radar Approach Control (TRACON). Dallas-Love Field airport (DAL) was selected by the FAA as a representative mid-sized airport within a constrained TRACON airspace due to the close proximity of a major airport, in this case Dallas-Ft Worth International Airport, one of the busiest in the world. To address this constraint, RNAV routes and

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

A review of metaheuristic scheduling techniques in cloud computing

Directory of Open Access Journals (Sweden)

Mala Kalra

2015-11-01

Full Text Available Cloud computing has become a buzzword in the area of high performance distributed computing as it provides on-demand access to shared pool of resources over Internet in a self-service, dynamically scalable and metered manner. Cloud computing is still in its infancy, so to reap its full benefits, much research is required across a broad array of topics. One of the important research issues which need to be focused for its efficient performance is scheduling. The goal of scheduling is to map tasks to appropriate resources that optimize one or more objectives. Scheduling in cloud computing belongs to a category of problems known as NP-hard problem due to large solution space and thus it takes a long time to find an optimal solution. There are no algorithms which may produce optimal solution within polynomial time to solve these problems. In cloud environment, it is preferable to find suboptimal solution, but in short period of time. Metaheuristic based techniques have been proved to achieve near optimal solutions within reasonable time for such problems. In this paper, we provide an extensive survey and comparative analysis of various scheduling algorithms for cloud and grid environments based on three popular metaheuristic techniques: Ant Colony Optimization (ACO, Genetic Algorithm (GA and Particle Swarm Optimization (PSO, and two novel techniques: League Championship Algorithm (LCA and BAT algorithm.

The effect of ratio and interval training on Pavlovian-instrumental transfer in mice.

Directory of Open Access Journals (Sweden)

Brian J Wiltgen

Full Text Available Conditional stimuli (CS that are paired with reward can be used to motivate instrumental responses. This process is called Pavlovian-instrumental transfer (PIT. A recent study in rats suggested that habitual responses are particularly sensitive to the motivational effects of reward cues. The current experiments examined this idea using ratio and interval training in mice. Two groups of animals were trained to lever press for food pellets that were delivered on random ratio or random interval schedules. Devaluation tests revealed that interval training led to habitual responding while ratio training produced goal-directed actions. The presentation of CSs paired with reward led to positive transfer in both groups, however, the size of this effect was much larger in mice that were trained on interval schedules. This result suggests that habitual responses are more sensitive to the motivational influence of reward cues than goal-directed actions. The implications for neurobiological models of motivation and drug seeking behaviors are discussed.

Gain-Scheduled Control of a Fossil-Fired Power Plant Boiler

DEFF Research Database (Denmark)

Hangstrup, M.; Stoustrup, Jakob; Andersen, Palle

1999-01-01

-scheduling which interpolates between unstable controllers is not allowed using traditional schemes. The results show that a considerable optimization of the conventional controlled system is obtainable. Also the gain-scheduled optimizing controller is seen to have a superior performance compared to the fixed LTI......In this paper the objective is to optimize the control of a coal fired 250 MW power plant boiler. The conventional control system is supplemented with a multivariable optimizing controller operating in parallel with the conventional control system. Due to the strong dependence of the gains...... and dynamics upon the load, it is beneficial to consider a gain-scheduling control approach. Optimization using complex mu synthesis results in unstable LTI controllers in some operating points of the boiler. A recent gain-scheduling approach allowing for unstable fixed LTI controllers is applied. Gain...

Training loads and injury risk in Australian football—differing acute: chronic workload ratios influence match injury risk

Science.gov (United States)

Carey, David L; Blanch, Peter; Ong, Kok-Leong; Crossley, Kay M; Crow, Justin; Morris, Meg E

2017-01-01

Aims (1) To investigate whether a daily acute:chronic workload ratio informs injury risk in Australian football players; (2) to identify which combination of workload variable, acute and chronic time window best explains injury likelihood. Methods Workload and injury data were collected from 53 athletes over 2 seasons in a professional Australian football club. Acute:chronic workload ratios were calculated daily for each athlete, and modelled against non-contact injury likelihood using a quadratic relationship. 6 workload variables, 8 acute time windows (2–9 days) and 7 chronic time windows (14–35 days) were considered (336 combinations). Each parameter combination was compared for injury likelihood fit (using R2). Results The ratio of moderate speed running workload (18–24 km/h) in the previous 3 days (acute time window) compared with the previous 21 days (chronic time window) best explained the injury likelihood in matches (R2=0.79) and in the immediate 2 or 5 days following matches (R2=0.76–0.82). The 3:21 acute:chronic workload ratio discriminated between high-risk and low-risk athletes (relative risk=1.98–2.43). Using the previous 6 days to calculate the acute workload time window yielded similar results. The choice of acute time window significantly influenced model performance and appeared to reflect the competition and training schedule. Conclusions Daily workload ratios can inform injury risk in Australian football. Clinicians and conditioning coaches should consider the sport-specific schedule of competition and training when choosing acute and chronic time windows. For Australian football, the ratio of moderate speed running in a 3-day or 6-day acute time window and a 21-day chronic time window best explained injury risk. PMID:27789430

A model of alcohol drinking under an intermittent access schedule using group-housed mice.

Directory of Open Access Journals (Sweden)

Magdalena Smutek

Full Text Available Here, we describe a new model of voluntary alcohol drinking by group-housed mice. The model employs sensor-equipped cages that track the behaviors of the individual animals via implanted radio chips. After the animals were allowed intermittent access to alcohol (three 24 h intervals every week for 4 weeks, the proportions of licks directed toward bottles containing alcohol were 50.9% and 39.6% for the male and female mice, respectively. We used three approaches (i.e., quinine adulteration, a progressive ratio schedule and a schedule involving a risk of punishment to test for symptoms of compulsive alcohol drinking. The addition of 0.01% quinine to the alcohol solution did not significantly affect intake, but 0.03% quinine induced a greater than 5-fold reduction in the number of licks on the alcohol bottles. When the animals were required to perform increasing numbers of instrumental responses to obtain access to the bottle with alcohol (i.e., a progressive ratio schedule, they frequently reached a maximum of 21 responses irrespective of the available reward. Although the mice rarely achieved higher response criteria, the number of attempts was ∼ 10 times greater in case of alcohol than water. We have developed an approach for mapping social interactions among animals that is based on analysis of the sequences of entries into the cage corners. This approach allowed us to identify the mice that followed other animals in non-random fashions. Approximately half of the mice displayed at least one interaction of this type. We have not yet found a clear correlation between imitative behavior and relative alcohol preference. In conclusion, the model we describe avoids the limitations associated with testing isolated animals and reliably leads to stable alcohol drinking. Therefore, this model may be well suited to screening for the effects of genetic mutations or pharmacological treatments on alcohol-induced behaviors.

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

Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

Directory of Open Access Journals (Sweden)

Maocai Wang

2014-01-01

Full Text Available Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

Effects of conversion ratio change on the core performances in medium to large TRU burning reactors

International Nuclear Information System (INIS)

Song, Hoon; Kim, Sang-Ji; Yoo, Jae-Woon; Kim, Yeong-Il

2009-01-01

Conceptual fast reactor core designs with sodium coolant are developed at 1,500, 3,000 and 4,500 MWt which are configured to transmute recycled transuranics (TRU) elements with external feeds consisting of LWR spent fuel. Even at each pre-determined power level, the performance parameters, reactivity coefficients and their implications on the safety analysis can be different when the target TRU conversion ratio changes. In order to address this aspect of design, a study on TRU conversion ratio change was performed. The results indicate that it is feasible to design a TRU burner core to accommodate a wide range of conversion ratios by employing different fuel cladding thicknesses. The TRU consumption rate is found to be proportional to the core power without any significant deterioration in the core performance at higher power levels. A low conversion ratio core has an increased TRU consumption rate and much faster burnup reactivity loss, which calls for appropriate means for reactivity compensation. As for the reactivity coefficients related with the conversion ratio change, the core with a low conversion ratio has a less negative Doppler coefficient, a more negative axial expansion coefficient, a more negative control rod worth per rod, a more negative radial expansion coefficient, a less positive sodium density coefficient and a less positive sodium void worth. A slight decrease in the delayed neutron fraction is also noted, reflecting the fertile U-238 fraction reduction. (author)

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

Directory of Open Access Journals (Sweden)

Litian Duan

2016-11-01

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

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

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

Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach

Science.gov (United States)

2010-05-01

This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

Science.gov (United States)

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Gemcitabine and cisplatin in locally advanced and metastatic bladder cancer; 3- or 4-week schedule?

DEFF Research Database (Denmark)

Als, Anne Birgitte; Sengeløv, Lisa; Von Der Maase, Hans

2008-01-01

BACKGROUND: Chemotherapy with gemcitabine and cisplatin (GC) is an active regimen in advanced transitional cell carcinoma (TCC). Traditionally, GC has been administered as a 4-week schedule. However, an alternative 3-week schedule may be more feasible. Long-term survival data for the alternative 3......-week schedule and comparisons of the feasibility and toxicity between the two schedules have not previously been published. MATERIAL AND METHODS: We performed a retrospective analysis of patients with stage IV TCC, treated with GC by a standard 4-week or by an alternative 3-week schedule. RESULTS...

The impact of a scheduling change on ninth grade high school performance on biology benchmark exams and the California Standards Test

Science.gov (United States)

Leonardi, Marcelo

The primary purpose of this study was to examine the impact of a scheduling change from a trimester 4x4 block schedule to a modified hybrid schedule on student achievement in ninth grade biology courses. This study examined the impact of the scheduling change on student achievement through teacher created benchmark assessments in Genetics, DNA, and Evolution and on the California Standardized Test in Biology. The secondary purpose of this study examined the ninth grade biology teacher perceptions of ninth grade biology student achievement. Using a mixed methods research approach, data was collected both quantitatively and qualitatively as aligned to research questions. Quantitative methods included gathering data from departmental benchmark exams and California Standardized Test in Biology and conducting multiple analysis of covariance and analysis of covariance to determine significance differences. Qualitative methods include journal entries questions and focus group interviews. The results revealed a statistically significant increase in scores on both the DNA and Evolution benchmark exams. DNA and Evolution benchmark exams showed significant improvements from a change in scheduling format. The scheduling change was responsible for 1.5% of the increase in DNA benchmark scores and 2% of the increase in Evolution benchmark scores. The results revealed a statistically significant decrease in scores on the Genetics Benchmark exam as a result of the scheduling change. The scheduling change was responsible for 1% of the decrease in Genetics benchmark scores. The results also revealed a statistically significant increase in scores on the CST Biology exam. The scheduling change was responsible for .7% of the increase in CST Biology scores. Results of the focus group discussions indicated that all teachers preferred the modified hybrid schedule over the trimester schedule and that it improved student achievement.

Coordinated scheduling for the downlink of cloud radio-access networks

KAUST Repository

Douik, Ahmed S.

2015-09-11

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

Online Scheduling in Distributed Message Converter Systems

NARCIS (Netherlands)

Risse, Thomas; Wombacher, Andreas; Surridge, Mike; Taylor, Steve; Aberer, Karl

The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the

Proportional green time scheduling for traffic lights

NARCIS (Netherlands)

P. Kovacs; Le, T. (Tung); R. Núñez Queija (Rudesindo); Vu, H. (Hai); N. Walton

2016-01-01

textabstractWe consider the decentralized scheduling of a large number of urban traffic lights. We investigate factors determining system performance, in particular, the length of the traffic light cycle and the proportion of green time allocated to each junction. We study the effect of the length

Fuzzy Networked Control Systems Design Considering Scheduling Restrictions

Directory of Open Access Journals (Sweden)

H. Benítez-Pérez

2012-01-01

known a priory but from a dynamic real-time behavior. To do so, the use of priority dynamic Priority exchange scheduling is performed. The objective of this paper is to show a way to tackle multiple time delays that are bounded and the dynamic response from real-time scheduling approximation. The related control law is designed considering fuzzy logic approximation for nonlinear time delays coupling, where the main advantage is the integration of this behavior through extended state space representation keeping certain linear and bounded behavior and leading to a stable situation during events presentation by guaranteeing stability through Lyapunov.

The effects of sex, sexual orientation, and digit ratio (2D:4D) on mental rotation performance.

Science.gov (United States)

Peters, Michael; Manning, John T; Reimers, Stian

2007-04-01

In spite of the reduced level of experimental control, this large scale study brought some clarity into the relation between mental rotation task (MRT) performance and a number of variables where contradictory associations had previously been reported in the literature. Clear sex differences in MRT were observed for a sample of 134,317 men and 120,783 women, with men outperforming women. There were also MRT differences as a function of sexual orientation: heterosexual men performed better than homosexual men and homosexual women performed better than heterosexual women. Although bisexual men performed better than homosexual men but less well than heterosexual men, no significant differences were observed between bisexual and homosexual women. MRT performance in both men and women peaked in the 20-30 year range, and declined significantly and markedly thereafter. Both men and women showed a significant negative correlation between left and right digit finger ratio and MRT scores, such that individuals with smaller digit ratios (relatively longer ring finger than index finger) performed better than individuals with larger digit ratios.

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…

Influence of Ni/Co molar ratio on electromagnetic properties and microwave absorption performances for Ni/Co paraffin composites

Energy Technology Data Exchange (ETDEWEB)

Yan, S.J., E-mail: shaojiuyan@126.com [Department of Structural Steel, Functional Materials and Heat Treatment Processing, AVIC Beijing Institute of Aeronautical Materials, Beijing 100095 (China); Aviation Key Laboratory of Science and Technology on Stealth Materials, Beijing 100095 (China); Dai, S.L. [The Office of AVIC Beijing Institute of Aeronautical Materials, Beijing 100095 (China); Ding, H.Y.; Wang, Z.Y. [Aviation Key Laboratory of Science and Technology on Stealth Materials, Beijing 100095 (China); Liu, D.B [Department of Structural Steel, Functional Materials and Heat Treatment Processing, AVIC Beijing Institute of Aeronautical Materials, Beijing 100095 (China)

2014-05-01

Ni and Co metallic microparticles with submicron size were synthesized with a simple wet chemical reduction method at a relatively low temperature. Then their morphologies and structures were characterized by SEM and XRD. Ni metallic microparticles have spherical-shape morphology with fcc crystalline structure, however, Co has a distinct leaf-like morphology with the fcc and hcp mixed phases crystalline structures. For the characterization of their electromagnetic properties, paraffin matrix composites containing different molar ratio Ni and Co mixture powder as fillers were prepared. It was found that both the electromagnetic properties and electromagnetic microwave absorption performances of absorber layer were remarkably influenced by Ni/Co molar ratio. The electromagnetic microwave absorption performances were significantly improved by blending Ni and Co metallic microparticles into paraffin matrix with changing Ni/Co molar ratio, and enhanced mechanism were discussed. - Highlights: • Ni and Co microparticles were synthesized by a wet chemical reduction method. • EM properties of absorber were remarkably influenced by Ni/Co molar ratio. • EMA performances can be adjusted by artificially changing Co/Ni molar ratio. • Enhanced EMA performances result from multiple EM attenuation mechanisms.

Energy-exergy analysis of compressor pressure ratio effects on thermodynamic performance of ammonia water combined cycle

International Nuclear Information System (INIS)

Mohtaram, Soheil; Chen, Wen; Zargar, T.; Lin, Ji

2017-01-01

Highlights: • Energy exergy analysis is conducted to find the effects of RP. • EES software is utilized to perform the detailed energy-exergy analyses. • Effects investigated through energy and exergy destruction, enthalpy, yields, etc. • Detailed results are reported showing the performance of gas and combined cycle. - Abstract: The purpose of this study is to investigate the effect of compressor pressure ratio (RP) on the thermodynamic performances of ammonia-water combined cycle through energy and exergy destruction, enthalpy temperature, yields, and flow velocity. The energy-exergy analysis is conducted on the ammonia water combined cycle and the Rankine cycle, respectively. Engineering Equation Solver (EES) software is utilized to perform the detailed analyses. Values and ratios regarding heat drop and exergy loss are presented in separate tables for different equipments. The results obtained by the energy-exergy analysis indicate that by increasing the pressure ratio compressor, exergy destruction of high-pressure compressors, intercooler, gas turbine and the special produced work of gas turbine cycle constantly increase and the exergy destruction of recuperator, in contrast, decreases continuously. In addition, the least amount of input fuel into the combined cycle is observed when the pressure ratio is no less than 7.5. Subsequently, the efficiency of the cycle in gas turbine and combined cycle is reduced because the fuel input into the combined cycle is increased.

HOLD MODE BASED DYNAMIC PRIORITY LOAD ADAPTIVE INTERPICONET SCHEDULING FOR BLUETOOTH SCATTERNETS

Directory of Open Access Journals (Sweden)

G.S. Mahalakshmi

2011-09-01

Full Text Available Scheduling in piconets has emerged as a challenging research area. Interpiconet scheduling focuses on when a bridge is switched among various piconets and how a bridge node communicates with the masters in different piconets. This paper proposes an interpiconet scheduling algorithm named, hold mode based dynamic traffic priority load adaptive scheduling. The bridges are adaptively switched between the piconets according to various traffic loads. The main goal is to maximize the utilization of the bridge by reducing the bridge switch wastes, utilize intelligent decision making algorithm, resolve conflict between the masters, and allow negotiation for bridge utilization in HDPLIS using bridge failure-bridge repair procedure . The Hold mode - dynamic traffic - priority based - load adaptive scheduling reduces the number of bridge switch wastes and hence increases the efficiency of the bridge which results in increased performance of the system.

Vectorization of a penalty function algorithm for well scheduling

Science.gov (United States)

Absar, I.

1984-01-01

In petroleum engineering, the oil production profiles of a reservoir can be simulated by using a finite gridded model. This profile is affected by the number and choice of wells which in turn is a result of various production limits and constraints including, for example, the economic minimum well spacing, the number of drilling rigs available and the time required to drill and complete a well. After a well is available it may be shut in because of excessive water or gas productions. In order to optimize the field performance a penalty function algorithm was developed for scheduling wells. For an example with some 343 wells and 15 different constraints, the scheduling routine vectorized for the CYBER 205 averaged 560 times faster performance than the scalar version.

GLOA: A New Job Scheduling Algorithm for Grid Computing

Directory of Open Access Journals (Sweden)

Zahra Pooranian

2013-03-01

Full Text Available The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA, to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.

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.

On the performance of two-way multiuser mixed RF/FSO relay networks with opportunistic scheduling & asymmetric channel gains

KAUST Repository

Al-Eryani, Yasser F.; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim

2017-01-01

In this paper, the performance of two-way relaying (TWR) multiuser mixed radio frequency/free space optical (RF/FSO) relay networks with opportunistic user scheduling and asymmetric channel fading is studied. First, closed-form expressions for the exact outage probability, asymptotic (high signal-to-noise ration (SNR)) outage probability, and average ergodic channel capacity are derived assuming heterodyne detection (HD) scheme. Additionally, impacts of several system parameters including number of users, pointing errors, and atmospheric turbulence conditions on the overall network performance are investigated. All the theoretical results are validated by Monte-Carlo simulations. The results show that the TWR scheme almost doubles the network ergodic capacity compared to that of one-way relaying (OWR) scheme with the same outage performance. Additionally, the overall diversity order of the network is shown to be affected not only by the number of users, but it is also a function of the pointing error and atmospheric turbulence conditions.

On the performance of two-way multiuser mixed RF/FSO relay networks with opportunistic scheduling & asymmetric channel gains

KAUST Repository

Al-Eryani, Yasser F.

2017-07-20

In this paper, the performance of two-way relaying (TWR) multiuser mixed radio frequency/free space optical (RF/FSO) relay networks with opportunistic user scheduling and asymmetric channel fading is studied. First, closed-form expressions for the exact outage probability, asymptotic (high signal-to-noise ration (SNR)) outage probability, and average ergodic channel capacity are derived assuming heterodyne detection (HD) scheme. Additionally, impacts of several system parameters including number of users, pointing errors, and atmospheric turbulence conditions on the overall network performance are investigated. All the theoretical results are validated by Monte-Carlo simulations. The results show that the TWR scheme almost doubles the network ergodic capacity compared to that of one-way relaying (OWR) scheme with the same outage performance. Additionally, the overall diversity order of the network is shown to be affected not only by the number of users, but it is also a function of the pointing error and atmospheric turbulence conditions.

Hanford Site Environmental Surveillance Master Sampling Schedule

International Nuclear Information System (INIS)

Bisping, L.E.

2000-01-01

Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1, General Environmental Protection Program: and DOE Order 5400.5, Radiation Protection of the Public and the Environment. The sampling design is described in the Operations Office, Environmental Monitoring Plan, United States Department of Energy, Richland DOE/RL-91-50, Rev.2, U.S. Department of Energy, Richland, Washington. This document contains the CY 2000 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section includes sampling locations, sample types, and analyses to be performed. In some cases, samples are scheduled on a rotating basis and may not be collected in 2000 in which case the anticipated year for collection is provided. In addition, a map showing approximate sampling locations is included for each media scheduled for collection

Using a vision cognitive algorithm to schedule virtual machines

Directory of Open Access Journals (Sweden)

Zhao Jiaqi

2014-09-01

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

Effects of dust accumulation and module cleaning on performance ratio of solar rooftop system and solar power plants

Science.gov (United States)

Sakarapunthip, Nattakarn; Chenvidhya, Dhirayut; Chuangchote, Surawut; Kirtikara, Krissanapong; Chenvidhya, Tanokkorn; Onreabroy, Wandee

2017-08-01

Thailand is an agricultural country, with rice, sugar, and cassava as the major export products. Production of rice, sugar cane, and cassava entails agricultural activities that give rise to significant airborne dusts. In this work, five photovoltaic (PV) units (one solar rooftop and four power plants) are selected for the study. From the study of dust accumulation on glass surface located near rice farms, it was found that opaque areas due to the deposition of dust are 11-14% after 1-2-week exposure. As a consequence, PV system performance is affected. Performance ratio was calculated to determine these effects. Overall results reveal that during the dry and hot seasons, dust deposition significantly affects the performance ratio. The performance ratio reduces by 1.6-3% for 1-month dust accumulation and reduces by 6-8% for 2-month dust accumulation. After cleaning the dust accumulated, the performance ratio greatly increases, resulting in the increase in the energy output by 10%. This increase provides economic and cost benefits of PV cleaning. The performance ratio is not significantly changed during the rainy season, which PV modules are relatively clean as the dust is washed away by rain. It was also found that most of the solar power plants in Thailand still rely on manual cleaning of PV modules with washing water followed by wiping. However, only one power plant, employs a machine for cleaning, resulting in lower cleaning costs.

Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Ahmed Mohamed H

2006-01-01

Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

Effects of activity-rest schedules on physiological strain and spinal load in hospital-based porters.

Science.gov (United States)

Beynon, C; Burke, J; Doran, D; Nevill, A

2000-10-01

Workers in physically demanding occupations require rest breaks to recover from physiological stress and biomechanical loading. Physiological stress can increase the risk of developing musculoskeletal disorders and repeated loading of the spine may increase the potential for incurring back pain. The aim of the study was to assess the impact of an altered activity-rest schedule on physiological and spinal loading in hospital-based porters. An existing 4-h activity-rest schedule was obtained from observations on eight male porters. This schedule formed the normal trial, which included two 5- and one 15-min breaks. An alternative 4-h schedule was proposed (experimental condition) that had two breaks each of 12.5 min. It was hypothesized that the experimental trial is more effective in promoting recovery from physiological strain and spinal shrinkage than the normal trial, due to the 5-min breaks being insufficient to allow physiological variables to return to resting levels or the intervertebral discs to reabsorb fluid. Ten males performed both test conditions and oxygen uptake VO2, heart rate, minute ventilation VE, perceived exertion and spinal shrinkage were recorded. There were no significant differences in any of the measured variables between the two trials (p > 0.05). Median heart rates were 78 (range 71-93) and 82 (71-90) beats.min(-1) for the normal trial and the experimental trial respectively, indicating that the activity was of low intensity. The light intensity was corroborated by the oxygen uptakes (0.75, range 0.65-0.94 1.min(-1)). Spinal shrinkage occurred to the same extent in the two trials (2.12 +/- 3.16 mm and 2.88 +/- 2.92 mm in the normal trial and the experimental trial respectively). Varying the length and positioning of the rest breaks did not significantly affect the physiological responses or magnitude of spinal shrinkage between the two trials. More physically demanding work than the porters' schedule should induce greater physiological

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

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.

The nurse scheduling problem: a goal programming and nonlinear optimization approaches

Science.gov (United States)

Hakim, L.; Bakhtiar, T.; Jaharuddin

2017-01-01

Nurses scheduling is an activity of allocating nurses to conduct a set of tasks at certain room at a hospital or health centre within a certain period. One of obstacles in the nurse scheduling is the lack of resources in order to fulfil the needs of the hospital. Nurse scheduling which is undertaken manually will be at risk of not fulfilling some nursing rules set by the hospital. Therefore, this study aimed to perform scheduling models that satisfy all the specific rules set by the management of Bogor State Hospital. We have developed three models to overcome the scheduling needs. Model 1 is designed to schedule nurses who are solely assigned to a certain inpatient unit and Model 2 is constructed to manage nurses who are assigned to an inpatient room as well as at Polyclinic room as conjunct nurses. As the assignment of nurses on each shift is uneven, then we propose Model 3 to minimize the variance of the workload in order to achieve equitable assignment on every shift. The first two models are formulated in goal programming framework, while the last model is in nonlinear optimization form.

Resource-Optimal Scheduling Using Priced Timed Automata

DEFF Research Database (Denmark)

Larsen, Kim Guldstrand; Rasmussen, Jacob Illum; Subramani, K.

2004-01-01

In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear......-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata....

QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Zhang Yan

2009-01-01

Full Text Available This paper studies the packet scheduling problem in Broadband Wireless Access (BWA networks. The key difficulties of the BWA scheduling problem lie in the high variability of wireless channel capacity and the unknown model of packet arrival process. It is difficult for traditional heuristic scheduling algorithms to handle the situation and guarantee satisfying performance in BWA networks. In this paper, we introduce learning-based approach for a better solution. Specifically, we formulate the packet scheduling problem as an average cost Semi-Markov Decision Process (SMDP. Then, we solve the SMDP by using reinforcement learning. A feature-based linear approximation and the Temporal-Difference learning technique are employed to produce a near optimal solution of the corresponding SMDP problem. The proposed algorithm, called Reinforcement Learning Scheduling (RLS, has in-built capability of self-training. It is able to adaptively and timely regulate its scheduling policy according to the instantaneous network conditions. Simulation results indicate that RLS outperforms two classical scheduling algorithms and simultaneously considers: (i effective QoS differentiation, (ii high bandwidth utilization, and (iii both short-term and long-term fairness.

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

Directory of Open Access Journals (Sweden)

Mohammad Hossein Sadeghi

2013-08-01

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

How Should School Districts Shape Teacher Salary Schedules? Linking School Performance to Pay Structure in Traditional Compensation Schemes

Science.gov (United States)

Grissom, Jason A.; Strunk, Katharine O.

2012-01-01

This study examines the relative distribution of salary schedule returns to experience for beginning and veteran teachers. We argue that districts are likely to benefit from structuring salary schedules with greater experience returns early in the teaching career. To test this hypothesis, we match salary data to school-level student performance…

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

Using the principles of circadian physiology enhances shift schedule design

International Nuclear Information System (INIS)

Connolly, J.J.; Moore-Ede, M.C.

1987-01-01

Nuclear power plants must operate 24 h, 7 days a week. For the most part, shift schedules currently in use at nuclear power plants have been designed to meet operational needs without considering the biological clocks of the human operators. The development of schedules that also take circadian principles into account is a positive step that can be taken to improve plant safety by optimizing operator alertness. These schedules reduce the probability of human errors especially during backshifts. In addition, training programs that teach round-the-clock workers how to deal with the problems of shiftwork can help to optimize performance and alertness. These programs teach shiftworkers the underlying causes of the sleep problems associated with shiftwork and also provide coping strategies for improving sleep and dealing with the transition between shifts. When these training programs are coupled with an improved schedule, the problems associated with working round-the-clock can be significantly reduced

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

International Nuclear Information System (INIS)

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

1990-01-01

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

Workforce scheduling: A new model incorporating human factors

Directory of Open Access Journals (Sweden)

Mohammed Othman

2012-12-01

Full Text Available Purpose: The majority of a company’s improvement comes when the right workers with the right skills, behaviors and capacities are deployed appropriately throughout a company. This paper considers a workforce scheduling model including human aspects such as skills, training, workers’ personalities, workers’ breaks and workers’ fatigue and recovery levels. This model helps to minimize the hiring, firing, training and overtime costs, minimize the number of fired workers with high performance, minimize the break time and minimize the average worker’s fatigue level.Design/methodology/approach: To achieve this objective, a multi objective mixed integer programming model is developed to determine the amount of hiring, firing, training and overtime for each worker type.Findings: The results indicate that the worker differences should be considered in workforce scheduling to generate realistic plans with minimum costs. This paper also investigates the effects of human fatigue and recovery on the performance of the production systems.Research limitations/implications: In this research, there are some assumptions that might affect the accuracy of the model such as the assumption of certainty of the demand in each period, and the linearity function of Fatigue accumulation and recovery curves. These assumptions can be relaxed in future work.Originality/value: In this research, a new model for integrating workers’ differences with workforce scheduling is proposed. To the authors' knowledge, it is the first time to study the effects of different important human factors such as human personality, skills and fatigue and recovery in the workforce scheduling process. This research shows that considering both technical and human factors together can reduce the costs in manufacturing systems and ensure the safety of the workers.

Immunization Schedules for Adults

Science.gov (United States)

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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