Throughput maximization of parcel sorter systems by scheduling inbound containers
Haneyah, S.W.A.; Schutten, Johannes M.J.; Fikse, K.; Clausen, Uwe; ten Hompel, Michael; Meier, J. Fabian
2013-01-01
This paper addresses the inbound container scheduling problem for automated sorter systems in express parcel sorting. The purpose is to analyze which container scheduling approaches maximize the throughput of sorter systems. We build on existing literature, particularly on the dynamic load balancing
Improving the performance of sorter systems by scheduling inbound containers
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
Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals
Directory of Open Access Journals (Sweden)
Peng Guo
2013-04-01
Full Text Available Railway container terminals, where gantry cranes are responsible for loading and unloading containers between freight trains and yards, are important hubs of hinterland logistics transportation. Terminal managers confront the challenge in improving the efficiency of their service. As the most expensive equipment in a terminal, the operational performance of gantry cranes is a crucial factor. In this paper, the gantry crane scheduling problem of railway container terminals is investigated. A mixed integer programming model which considers the effect of dwelling position dependent processing times is formulated. In addition, the safety distances, the travel times and the non-crossing requirement of cranes are incorporated in the mathematical model. A novel discrete artificial bee colony algorithm is presented to solve the intractable scheduling problem. Computational experiments are conducted to evaluate the proposed algorithm on some randomly constructed instances based on typical terminal operational data. Experimental results show that the proposed approach can obtain near optimal solutions for the investigated problem in a reasonable computational time.
NRC comprehensive records disposition schedule. Revision 3
International Nuclear Information System (INIS)
1998-02-01
Title 44 US Code, ''Public Printing and Documents,'' regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ''Management and Use of Information and Records,'' and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA's General Records Schedule (dated August 1995)
NRC comprehensive records disposition schedule. Revision 3
Energy Technology Data Exchange (ETDEWEB)
NONE
1998-02-01
Title 44 US Code, ``Public Printing and Documents,`` regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ``Management and Use of Information and Records,`` and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ``Records Management,`` require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA`s General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ``NRC`s Comprehensive Records Disposition Schedule,`` and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA`s General Records Schedule (dated August 1995).
10 CFR 32.103 - Schedule D-prototype tests for ice detection devices containing strontium-90.
2010-01-01
... water and the strontium-90 shall be considered leakage. (e) Observations. After each of the tests... 10 Energy 1 2010-01-01 2010-01-01 false Schedule D-prototype tests for ice detection devices... § 32.103 Schedule D—prototype tests for ice detection devices containing strontium-90. An applicant for...
2017-11-22
This final rule adopts without changes an interim final rule with request for comments published in the Federal Register on March 23, 2017. On July 1, 2016, the U.S. Food and Drug Administration (FDA) approved a new drug application for Syndros, a drug product consisting of dronabinol [(-)-delta-9-trans-tetrahydrocannabinol (delta-9-THC)] oral solution. The Drug Enforcement Administration (DEA) maintains FDA-approved products of oral solutions containing dronabinol in schedule II of the Controlled Substances Act.
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.
Li, Wenkai; Goh, Mark
2015-01-01
Maximizing reader insights into the challenges facing maritime supply chains and container port logistics service providers in Asia, this book highlights their innovative responses to these challenges through real-world case studies. With a focus on mathematical modeling, simulation and heuristics approaches, this book provides academics, engineers, container terminal operators, students in logistics and supply chain management with the latest approaches that can be used to address the planning and scheduling problem in large container terminal yards. This book can be used on a self-contained basis as teaching cases in an undergraduate or specialist class setting, or on techniques applied to maritime container operations for port operations.
Preventive maintenance optimization for a multi-component system under changing job shop schedule
International Nuclear Information System (INIS)
Zhou Xiaojun; Lu Zhiqiang; Xi Lifeng
2012-01-01
Variability and small lot size is a common feature for many discrete manufacturing processes designed to meet a wide array of customer needs. Because of this, job shop schedule often has to be continuously updated in reaction to changes in production plan. Generally, the aim of preventive maintenance is to ensure production effectiveness and therefore the preventive maintenance models must have the ability to be adaptive to changes in job shop schedule. In this paper, a dynamic opportunistic preventive maintenance model is developed for a multi-component system with considering changes in job shop schedule. Whenever a job is completed, preventive maintenance opportunities arise for all the components in the system. An optimal maintenance practice is dynamically determined by maximizing the short-term cumulative opportunistic maintenance cost savings for the system. The numerical example shows that the scheme obtained by the proposed model can effectively address the preventive maintenance scheduling problem caused by the changes in job shop schedule and is more efficient than the ones based on two other commonly used preventive maintenance models.
2017-03-23
On July 1, 2016, the U.S. Food and Drug Administration (FDA) approved a new drug application for Syndros, a drug product consisting of dronabinol [(-)-delta-9-trans-tetrahydrocannabinol (delta-9-THC)] oral solution. Thereafter, the Department of Health and Human Services (HHS) provided the Drug Enforcement Administration (DEA) with a scheduling recommendation that would result in Syndros (and other oral solutions containing dronabinol) being placed in schedule II of the Controlled Substances Act (CSA). In accordance with the CSA, as revised by the Improving Regulatory Transparency for New Medical Therapies Act, DEA is hereby issuing an interim final rule placing FDA-approved products of oral solutions containing dronabinol in schedule II of the CSA.
Kullberg, Anna; Bergenmar, Mia; Sharp, Lena
2016-05-01
To evaluate fixed scheduling compared with self-scheduling for nursing staff in oncological inpatient care with regard to patient and staff outcomes. Various scheduling models have been tested to attract and retain nursing staff. Little is known about how these schedules affect staff and patients. Fixed scheduling and self-scheduling have been studied to a small extent, solely from a staff perspective. We implemented fixed scheduling on two of four oncological inpatient wards. Two wards kept self-scheduling. Through a quasi-experimental design, baseline and follow-up measurements were collected among staff and patients. The Safety Attitudes Questionnaire was used among staff, as well as study-specific questions for patients and staff. Fixed scheduling was associated with less overtime and fewer possibilities to change shifts. Self-scheduling was associated with more requests from management for short notice shift changes. The type of scheduling did not affect patient-reported outcomes. Fixed scheduling should be considered in order to lower overtime. Further research is necessary and should explore patient outcomes to a greater extent. Scheduling is a core task for nurse managers. Our study suggests fixed scheduling as a strategy for managers to improve the effective use of resources and safety. © 2016 John Wiley & Sons Ltd.
The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management
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.
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.
Design Change Model for Effective Scheduling Change Propagation Paths
Zhang, Hai-Zhu; Ding, Guo-Fu; Li, Rong; Qin, Sheng-Feng; Yan, Kai-Yin
2017-09-01
Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how requirement changes propagate in the design of complex product systems and be able to select best options to guide design. Currently, a most approach for design change is lack of take the multi-disciplinary coupling relationships and the number of parameters into account integrally. A new design change model is presented to systematically analyze and search change propagation paths. Firstly, a PDS-Behavior-Structure-based design change model is established to describe requirement changes causing the design change propagation in behavior and structure domains. Secondly, a multi-disciplinary oriented behavior matrix is utilized to support change propagation analysis of complex product systems, and the interaction relationships of the matrix elements are used to obtain an initial set of change paths. Finally, a rough set-based propagation space reducing tool is developed to assist in narrowing change propagation paths by computing the importance of the design change parameters. The proposed new design change model and its associated tools have been demonstrated by the scheduling change propagation paths of high speed train's bogie to show its feasibility and effectiveness. This model is not only supportive to response quickly to diversified market requirements, but also helpful to satisfy customer requirements and reduce product development lead time. The proposed new design change model can be applied in a wide range of engineering systems design with improved efficiency.
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
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
Qiaoyu Sun; R. Kasten Dumroese; Yong Liu
2018-01-01
Container volume and irrigation management affect seedling growth in the nursery and field. We evaluated the effects of container volumes (D40, 656 ml; D60, 983 ml) and subirrigation schedules (85%, 75%, 65%, and 55% of 100% total substrate moisture content, TSMC) on seedling growth in a greenhouse and outplanting performance of Chinese cork oak (Quercus variabilis...
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
Impact of the Hydrocodone Schedule Change on Opioid Prescription Patterns in South Dakota.
Kuschel, Lauren M; Mort, Jane M
2017-10-01
Prescription opioid use is becoming increasingly common; consequently, opioid overdose deaths are increasing at an alarming rate. Hydrocodone, one of the most commonly abused opioids, was changed from a schedule III controlled substance to the more stringent schedule II to decrease abuse and diversion, effective Oct. 6, 2014. The objective of this study was to examine the impact of the hydrocodone schedule change on opioid prescribing in South Dakota. Opioid prescription patterns were examined in the following six-month phases: the baseline phase before the change, the transition phase when existing hydrocodone prescriptions could still be refilled, and the final phase. The South Dakota Board of Pharmacy Prescription Drug Monitoring Program provided aggregate monthly data for South Dakota opioid prescriptions (i.e., total number of prescriptions and days supplied), including urban and rural stratification. T-tests were performed on the monthly values for each phase to determine the significance of differences in prescription features between phases. The number of hydrocodone prescriptions significantly decreased 14 percent from baseline to final phase, while the days supplied per prescription significantly increased 7.4 percent. These changes were greater in rural areas than in urban areas. Conversely, the number of other opioid prescriptions significantly increased by 6.5 percent over this timeframe. The number of hydrocodone prescriptions decreased, while the days supplied per prescription increased. These changes were greater in rural areas than in urban areas. In addition, the number of other opioid prescriptions increased. These trends may reflect some unintended effects of the schedule change.
Management Matters. Changing to Flexible Scheduling
Pappas, Marjorie L.
2005-01-01
Elementary school library media specialists state that one of the most frustrating issues they face is the fixed schedules in their library media centers. Beyond the cost effectiveness issue, the fixed schedule severely limits using the resources of the library media center for inquiry learning and collaborative teaching experiences between the…
Project schedule and cost estimate report
International Nuclear Information System (INIS)
1988-03-01
All cost tables represent obligation dollars, at both a constant FY 1987 level and an estimated escalation level, and are based on the FY 1989 DOE Congressional Budget submittal of December 1987. The cost tables display the total UMTRA Project estimated costs, which include both Federal and state funding. The Total Estimated Cost (TEC) for the UMTRA Project is approximately $992.5 million (in 1987 escalated dollars). Project schedules have been developed that provide for Project completion by September 1994, subject to Congressional approval extending DOE's authorization under Public Law 95-604. The report contains site-specific demographic data, conceptual design assumptions, preliminary cost estimates, and site schedules. A general project overview is also presented, which includes a discussion of the basis for the schedule and cost estimates, contingency assumptions, work breakdown structure, and potential project risks. The schedules and cost estimates will be revised as necessary to reflect appropriate decisions relating to relocation of certain tailings piles, or other special design considerations or circumstances (such as revised EPA groundwater standards), and changes in the Project mission. 27 figs', 97 tabs
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.
Office of Civilian Radioactive Waste Management Program Cost and Schedule Baseline
International Nuclear Information System (INIS)
1992-09-01
The purpose of this document is to establish quantitative expressions of proposed costs and schedule to serve as a basis for measurement of program performance. It identifies the components of the Program Cost and Schedule Baseline (PCSB) that will be subject to change control by the Executive (Level 0) and Program (Level 1) Change Control Boards (CCBS) and establishes their baseline values. This document also details PCSB reporting, monitoring, and corrective action requirements. The Program technical baseline contained in the Waste Management System Description (WMSD), the Waste Management System Requirements (WMSR), and the Physical System Requirements documents provide the technical basis for the PCSB. Changes to the PCSB will be approved by the Pregrain Change Control Board (PCCB)In addition to the PCCB, the Energy System Acquisition Advisory Board Baseline CCB (ESAAB BCCB) will perform control functions relating to Total Project Cost (TPC) and major schedule milestones for the Yucca Mountain Site Characterization Project and the Monitored Retrievable Storage (MRS) Project
Directory of Open Access Journals (Sweden)
Ming Zeng
2017-01-01
Full Text Available The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.
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.
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.
Pittsburgh International Airport - Scheduled Passenger Traffic
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Here you can find Pittsburgh International Airport’s Monthly Scheduled Traffic Reports. Each of these reports contain a year-over-year (YOY) analysis of scheduled...
21 CFR 113.83 - Establishing scheduled processes.
2010-04-01
... commercial production runs should be determined on the basis of recognized scientific methods to be of a size... CONTAINERS Production and Process Controls § 113.83 Establishing scheduled processes. Scheduled processes for... production shall be adequately provided for in establishing the scheduled process. Critical factors, e.g...
Robust and Flexible Scheduling with Evolutionary Computation
DEFF Research Database (Denmark)
Jensen, Mikkel T.
Over the last ten years, there have been numerous applications of evolutionary algorithms to a variety of scheduling problems. Like most other research on heuristic scheduling, the primary aim of the research has been on deterministic formulations of the problems. This is in contrast to real world...... scheduling problems which are usually not deterministic. Usually at the time the schedule is made some information about the problem and processing environment is available, but this information is uncertain and likely to change during schedule execution. Changes frequently encountered in scheduling...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...
U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...
Automated Scheduling Via Artificial Intelligence
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.
DME Prosthetics Orthotics, and Supplies Fee Schedule
U.S. Department of Health & Human Services — Durable Medical Equipment, Prosthetics-Orthotics, and Supplies Fee Schedule. The list contains the fee schedule amounts, floors, and ceilings for all procedure codes...
SOFIA's Choice: Automating the Scheduling of Airborne Observations
Frank, Jeremy; Norvig, Peter (Technical Monitor)
1999-01-01
This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.
Directory of Open Access Journals (Sweden)
Hassan Javanshir
2012-01-01
Full Text Available The world trade has tremendous growth in marine transportation. This paper studies yard crane scheduling problem between different blocks in container terminal. Its purpose is to minimize total travel time of cranes between blocks and total delayed workload in blocks at different periods. In this way the problem is formulated as a mixed integer programming (MIP model. The block pairs between which yard cranes will be transferred, during the various periods, is determined by this model. Afterwards the model is coded in LINGO software, which benefits from branch and bound algorithm to solve. Computational results determine the yard cranes movement sequence among blocks to achieve minimum total travel time for cranes and minimum total delayed workload in blocks at different planning periods. Also the results show capability and adequacy of the developed model.
Changing Workplaces to Reduce Work-Family Conflict: Schedule Control in a White-Collar Organization.
Kelly, Erin L; Moen, Phyllis; Tranby, Eric
2011-04-01
Work-family conflicts are common and consequential for employees, their families, and work organizations. Can workplaces be changed to reduce work-family conflict? Previous research has not been able to assess whether workplace policies or initiatives succeed in reducing work-family conflict or increasing work-family fit. Using longitudinal data collected from 608 employees of a white-collar organization before and after a workplace initiative was implemented, we investigate whether the initiative affects work-family conflict and fit, whether schedule control mediates these effects, and whether work demands, including long hours, moderate the initiative's effects on work-family outcomes. Analyses clearly demonstrate that the workplace initiative positively affects the work-family interface, primarily by increasing employees' schedule control. This study points to the importance of schedule control for our understanding of job quality and for management policies and practices.
Nontraditional work schedules for pharmacists.
Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily
2008-11-15
Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.
EoC Study Update to Examine the Cost, Schedule and Technical Changes to NASA Projects
Bitten, Bob; Emmons, Debra; Shinn, Stephen; Scolese, Chris
2018-01-01
The original National Aeronautics and Space Administration (NASA) Explanation of Change (EoC) study was conducted in 2010 to understand the underlying causes of cost and schedule growth. The first study consisted of 25 missions launched from 2000 to 2010 and looked at the events that led to growth. These events were categorized into different bins that were rolled up to quantify whether the growth was due to internal planning, or internal execution, or from external forces and found that the growth was evenly distributed among those three categories. The result of the study presented nine considerations focused at reducing growth due to project external events and internal planning events. Although no one 'magic bullet' consideration was discovered in the previous work, the nine considerations taken as a whole were postulated to help reduce cost and schedule change in future NASA missions. A recent update was conducted that included investigating 8 missions developed since the previous study to determine if the results were different. Cost, schedule, and mass increases were analyzed from the start of Phase B through Preliminary Design Review and Critical Design Review to Launch. As shown in this paper, the results are better with overall cost and schedule growth being reduced. The paper will show a comparison of the previous results to the updated results to show specific reductions and provide an explanation of which recommendations were followed.
Underground storage tank - Integrated Demonstration Technical Task Plan master schedule
International Nuclear Information System (INIS)
Johnson, C.M.
1994-08-01
This document provides an integrated programmatic schedule (i.e., Master Schedule) for the U.S. Department of Energy (DOE) Underground Storage Tank-Integrated Demonstration (UST-ID) Program. It includes top-level schedule and related information for the DOE Office of Technology Development (EM-50) UST-ID activities. The information is based upon the fiscal year (FY) 1994 technical task plans (TTPS) and has been prepared as a baseline information resource for program participants. The Master Schedule contains Level 0 and Level 1 program schedules for the UST-ID Program. This document is one of a number of programmatic documents developed to support and manage the UST-ID activities. It is composed of the following sections: Program Overview - provides a summary background of the UST-ID Program. This summary addresses the mission, scope, and organizational structure of the program; Activity Description - provides a programmatic description of UST-ID technology development activities and lists the key milestones for the UST-ID systems. Master Schedules - contains the Level 0 and Level 1 programmatic schedules for the UST-ID systems. References - lists the UST-ID programmatic documents used as a basis for preparing the Master Schedule. The appendixes contain additional details related to site-specific technology applications
Flexible Work Schedules. ERIC Digest.
Kerka, Sandra
Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…
Pittsburgh International Airport - March 2018 Scheduled Passenger Traffic
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...
Pittsburgh International Airport - April 2018 Scheduled Passenger Traffic
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...
Pittsburgh International Airport - January 2018 Scheduled Passenger Traffic
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...
Pittsburgh International Airport - February 2018 Scheduled Passenger Traffic
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...
Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns
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.
NASA Instrument Cost/Schedule Model
Habib-Agahi, Hamid; Mrozinski, Joe; Fox, George
2011-01-01
NASA's Office of Independent Program and Cost Evaluation (IPCE) has established a number of initiatives to improve its cost and schedule estimating capabilities. 12One of these initiatives has resulted in the JPL developed NASA Instrument Cost Model. NICM is a cost and schedule estimator that contains: A system level cost estimation tool; a subsystem level cost estimation tool; a database of cost and technical parameters of over 140 previously flown remote sensing and in-situ instruments; a schedule estimator; a set of rules to estimate cost and schedule by life cycle phases (B/C/D); and a novel tool for developing joint probability distributions for cost and schedule risk (Joint Confidence Level (JCL)). This paper describes the development and use of NICM, including the data normalization processes, data mining methods (cluster analysis, principal components analysis, regression analysis and bootstrap cross validation), the estimating equations themselves and a demonstration of the NICM tool suite.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-11-01
This single page document is the November 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the production reactor.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-10-01
This single page document is the October 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-10-15
This single page document is the October 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-09-15
This single page document is the September 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-12-15
This single page document is the December 16, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.
Reactor outage schedule (tentative)
Energy Technology Data Exchange (ETDEWEB)
Walton, R.P.
1969-12-01
This single page document is the December 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.
Perceptions of Teachers in South Florida Toward Block Scheduling.
Hamdy, Mona; Urich, Ted
1998-01-01
A study was conducted at two metropolitan South Florida high schools to determine perceptions of 100 teachers concerning block scheduling. Teachers felt that the 4 X 4 block schedule contained too many time gaps for teaching foreign languages, English, and math. Teachers believed block schedules benefitted advanced students more than others and…
Scheduling drayage operations in synchromodal transport
Rivera, Arturo E.Pérez; Mes, Martijn R.K.; Bektas, Tolga; Coniglio, Stefano; Martinez-Sykora, Antonio; Voss, Stefan
2017-01-01
We study the problem of scheduling drayage operations in synchromodal transport. Besides the usual decisions to time the pick-up and delivery of containers, and to route the vehicles that transport them, synchromodal transport includes the assignment of terminals for empty and loaded containers. The
NASA Schedule Management Handbook
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.
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
Development and use of schedules in education of elementary school children with ASD
Directory of Open Access Journals (Sweden)
Sharova Y.A.
2015-09-01
Full Text Available The work on preparedness for education of elementary school students with autism disorders can be greatly facilitated by the use of the methods that allow to structure child's knowledge about necessary changes. The use of schedules greatly facilitates the process of education, guiding and work on children's adaptation. The article describes stages of the work on inclusion and use of general and individual schedules in two groups of children with intellectual disabilities and autism spectrum disorders in preschool classes. This work was conducted in the Center for Psychological, Medical and Social Support to Children and Adolescents of the Moscow State University of Psychology and Education. The article contains examples of the use schedules to increase independence and to reduce anxiety in children with autism spectrum disorders.
2010-10-08
... Pesticide Management and Disposal; Standards for Pesticide Containers and Containment; Change to Labeling... the pesticide container and containment regulations to provide an 8-month extension of the labeling... titled ``Pesticide Management and Disposal; Standards for Pesticide Containers and Containment'' (71 FR...
Foster, T A; Hackenberg, T D; Vaidya, M
2001-09-01
Pigeons' key pecks produced food under second-order schedules of token reinforcement, with light-emitting diodes serving as token reinforcers. In Experiment 1, tokens were earned according to a fixed-ratio 50 schedule and were exchanged for food according to either fixed-ratio or variable-ratio exchange schedules, with schedule type varied across conditions. In Experiment 2, schedule type was varied within sessions using a multiple schedule. In one component, tokens were earned according to a fixed-ratio 50 schedule and exchanged according to a variable-ratio schedule. In the other component, tokens were earned according to a variable-ratio 50 schedule and exchanged according to a fixed-ratio schedule. In both experiments, the number of responses per exchange was varied parametrically across conditions, ranging from 50 to 400 responses. Response rates decreased systematically with increases in the fixed-ratio exchange schedules, but were much less affected by changes in the variable-ratio exchange schedules. Response rates were consistently higher under variable-ratio exchange schedules than tinder comparable fixed-ratio exchange schedules, especially at higher exchange ratios. These response-rate differences were due both to greater pre-ratio pausing and to lower local rates tinder the fixed-ratio exchange schedules. Local response rates increased with proximity to food under the higher fixed-ratio exchange schedules, indicative of discriminative control by the tokens.
Scheduling the scheduling task : a time management perspective on scheduling
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
2010-06-15
... Pesticide Management and Disposal; Standards for Pesticide Containers and Containment; Change to Labeling... the pesticide container and containment regulations to provide a 4-month extension of the 40 CFR 156... pesticide labels to comply with the label requirements in the container and containment regulations. DATES...
Integrated test schedule for buried waste integrated demonstration
International Nuclear Information System (INIS)
Brown, J.T.; McDonald, J.K.
1992-05-01
The Integrated Test Schedule incorporates the various schedules the Buried Waste Integrated Demonstration (BWID) supports into one document. This document contains the Federal Facilities Agreement and Consent Order schedules for the Idaho National Engineering Laboratory, Hanford Reservation, Oak Ridge Reservation, and Fernald Environmental Materials Center. Included in the Integrated Test Schedule is the Buried Waste Integrated Demonstration ''windows of opportunity'' schedule. The ''windows of opportunity'' schedule shows periods of time in which Buried Waste Integrated Demonstration Program-sponsored technology demonstrations could support key decisions in the Federal Facilities Agreement and Consent Order. Schedules for the Buried Waste Integrated Demonstration-sponsored technology task plans are categorized by technology area and divided by current fiscal year and out-year. Total estimated costs for Buried Waste Integrated Demonstration-sponsored Technology Task Plans for FY-92 through FY-97 are $74.756M
Clinch River Breeder Reactor Plant Project: construction schedule
International Nuclear Information System (INIS)
Purcell, W.J.; Martin, E.M.; Shivley, J.M.
1982-01-01
The construction schedule for the Clinch River Breeder Reactor Plant and its evolution are described. The initial schedule basis, changes necessitated by the evaluation of the overall plant design, and constructability improvements that have been effected to assure adherence to the schedule are presented. The schedule structure and hierarchy are discussed, as are tools used to define, develop, and evaluate the schedule
Liu, Shichao; Liu, Xiaoping P; El Saddik, Abdulmotaleb
2014-03-01
In this paper, we investigate the modeling and distributed control problems for the load frequency control (LFC) in a smart grid. In contrast with existing works, we consider more practical and real scenarios, where the communication topology of the smart grid changes because of either link failures or packet losses. These topology changes are modeled as a time-varying communication topology matrix. By using this matrix, a new closed-loop power system model is proposed to integrate the communication topology changes into the dynamics of a physical power system. The globally asymptotical stability of this closed-loop power system is analyzed. A distributed gain scheduling LFC strategy is proposed to compensate for the potential degradation of dynamic performance (mean square errors of state vectors) of the power system under communication topology changes. In comparison to conventional centralized control approaches, the proposed method can improve the robustness of the smart grid to the variation of the communication network as well as to reduce computation load. Simulation results show that the proposed distributed gain scheduling approach is capable to improve the robustness of the smart grid to communication topology changes. © 2013 ISA. Published by ISA. All rights reserved.
Self-scheduling with Microsoft Excel.
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.
Finding Worst-Case Flexible Schedules using Coevolution
DEFF Research Database (Denmark)
Jensen, Mikkel Thomas
2001-01-01
Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice.......Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice....
Genetic algorithm to solve the problems of lectures and practicums scheduling
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.
MacDonall, James S
2017-09-01
Some have reported changing the schedule at one alternative of a concurrent schedule changed responding at the other alternative (Catania, 1969), which seems odd because no contingencies were changed there. When concurrent schedules are programmed using two schedules, one associated with each alternative that operate continuously, changing the schedule at one alternative also changes the switch schedule at the other alternative. Thus, changes in responding at the constant alternative could be due to the change in the switch schedule. To assess this possibility, six rats were exposed to a series of conditions that alternated between pairs of interval schedules at both alternatives and a pair of interval schedules at one, constant, alternative and a pair of extinction schedules at the other alternative. Comparing run lengths, visit durations and response rates at the constant alternative in the alternating conditions did not show consistent increases and decreases when a strict criterion for changes was used. Using a less stringent definition (any change in mean values) showed changes. The stay/switch analysis suggests it may be inaccurate to apply behavioral contrast to procedures that change from concurrent variable-interval variable-interval schedules to concurrent variable-interval extinction schedules because the contingencies in neither alternative are constant. © 2017 Society for the Experimental Analysis of Behavior.
Knowledge-based scheduling of arrival aircraft
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.
Efficient Academic Scheduling at the U.S. Naval Academy
National Research Council Canada - National Science Library
Zane, David
2003-01-01
This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...
Broadcast scheduling for mobile advertising
De Reyck, B.; Degraeve, Z.
2003-01-01
We describe a broadcast scheduling system developed for a precision marketing firm specialized in location-sensitive permission-based mobile advertising using SMS (Short Message Service) text messaging. Text messages containing advertisements were sent to registered customers when they were shopping in one of two shopping centers in the vicinity of London. The ads typically contained a limited-time promotional offer. The company's problem was deciding which ads to send out to which customers ...
Crane Scheduling for a Plate Storage
DEFF Research Database (Denmark)
Hansen, Jesper; Clausen, Jens
2002-01-01
Odense Steel Shipyard produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. This paper considers the problem of scheduling two cranes that carry out the movements of plates...... into, around and out of the storage. The system is required to create a daily schedule for the cranes, but also handle possible disruptions during the execution of the plan. The problem is solved with a Simulated Annealing algorithm....
Conception of Self-Construction Production Scheduling System
Xue, Hai; Zhang, Xuerui; Shimizu, Yasuhiro; Fujimura, Shigeru
With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for the interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce scheduling system without a lot of expense for customization. In this paper, at first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it.
Cure Schedule for Stycast 2651/Catalyst 9.
Energy Technology Data Exchange (ETDEWEB)
Kropka, Jamie Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); McCoy, John D. [New Mexico Inst. of Mining and Technology, Socorro, NM (United States)
2017-11-01
The Emerson & Cuming technical data sheet (TDS) for Stycast 2651/Catalyst 9 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation uses one of the schedules within the TDS and adds a “post cure” to obtain full reaction.
29 CFR 825.202 - Intermittent leave or reduced leave schedule.
2010-07-01
... leave schedule is a leave schedule that reduces an employee's usual number of working hours per workweek, or hours per workday. A reduced leave schedule is a change in the employee's schedule for a period of... 29 Labor 3 2010-07-01 2010-07-01 false Intermittent leave or reduced leave schedule. 825.202...
Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2006
Energy Technology Data Exchange (ETDEWEB)
Bisping, Lynn E.
2006-01-27
This document contains the calendar year 2006 schedules for the routine and non-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 2006 in which case the anticipated year for collection is provided. The project document package (PDP) for Surface Environmental Surveillance contains the milestone control log for the issuing of CY06 Environmental Surveillance Master Sampling Schedule WBS 4.2.3.21.3.03, milestone: RL00430306 (4830106-12).
Environmental surveillance master sampling schedule
International Nuclear Information System (INIS)
Bisping, L.E.
1997-01-01
Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL)(a) for the US Department of Energy (DOE). This document contains the planned 1997 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. In addition, Section 3.0, Biota, also reflects a rotating collection schedule identifying the year a specific sample is scheduled for collection. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1, General Environmental Protection Program, and DOE Order 5400.5, Radiation Protection of the Public and the Environment. The sampling methods will be the same as those described in the Environmental Monitoring Plan, US Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 1, US Department of Energy, Richland, Washington
Spike: Artificial intelligence scheduling for Hubble space telescope
Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert
1990-01-01
Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.
Directory of Open Access Journals (Sweden)
Andrey Mikhaylovich Bronnikov
2017-01-01
Full Text Available In this article the authors consider the problem of simulating the process of a maintenance-free between scheduled maintenance aircraft system operational status changes, which failure during the flight leads to the disaster. On-board equipment with automatic self-repair between routine maintenance in the event the components fail is called maintenance-free. During operation, onboard equipment accumulates failures maintaining its functions with a safety level not lower than the required minimum. Trouble shooting is carried out either at the end of between-maintenance period (as a rule, or after the failure, which led to the functions disorder or to the decrease below the target level of flight safety (as an exception. The system contains both redundant and nonredundant units and elements with the known failure rates. The system can be in one of the three states: operable, extreme, failed. The excessive redundant elements allow the system to accumulate failures which are repaired during the routine maintenance. The process of system operational status changes is described with the discrete-continuous model in the flight time. Basing on the information about the probabilities of the on-board equipment being in an operable, extreme or failed state, it is possible to calculate such complex efficiency indicators as the average loss of sorties, the average operating costs, the expected number of emergency recovery operations and others. Numerical studies have been conducted to validate the proposed model. It is believed that maintenance work completely updates the system. The analysis of these indicators will allow to evaluate the maintenance-free aircraft equipment operation efficiency, as well as to make an effectiveness comparison with other methods of technical operation. The model can be also used to assess the technical operation systems performance. The model can be used to optimize the period between maintenance.
Data analysis with the DIANA meta-scheduling approach
International Nuclear Information System (INIS)
Anjum, A; McClatchey, R; Willers, I
2008-01-01
The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of the resources
Estimating exponential scheduling preferences
DEFF Research Database (Denmark)
Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid
Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time-differentiated cong......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...
Buchvold, Hogne Vikanes; Pallesen, Ståle; Waage, Siri; Bjorvatn, Bjørn
2018-05-01
Objectives The aim of this study was to investigate changes in body mass index (BMI) between different work schedules and different average number of yearly night shifts over a four-year follow-up period. Methods A prospective study of Norwegian nurses (N=2965) with different work schedules was conducted: day only, two-shift rotation (day and evening shifts), three-shift rotation (day, evening and night shifts), night only, those who changed towards night shifts, and those who changed away from schedules containing night shifts. Paired student's t-tests were used to evaluate within subgroup changes in BMI. Multiple linear regression analysis was used to evaluate between groups effects on BMI when adjusting for BMI at baseline, sex, age, marital status, children living at home, and years since graduation. The same regression model was used to evaluate the effect of average number of yearly night shifts on BMI change. Results We found that night workers [mean difference (MD) 1.30 (95% CI 0.70-1.90)], two shift workers [MD 0.48 (95% CI 0.20-0.75)], three shift workers [MD 0.46 (95% CI 0.30-0.62)], and those who changed work schedule away from [MD 0.57 (95% CI 0.17-0.84)] or towards night work [MD 0.63 (95% CI 0.20-1.05)] all had significant BMI gain (Pnight workers had significantly larger BMI gain compared to day workers [B=0.89 (95% CI 0.06-1.72), Pnight shifts and BMI change using our multiple linear regression model. Conclusions After adjusting for possible confounders, we found that BMI increased significantly more among night workers compared to day workers.
Constraint-based job shop scheduling with ILOG SCHEDULER
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
18 CFR 154.313 - Schedules for minor rate changes.
2010-04-01
... of the End of the Test Period. (7) Schedule E. Working Capital. Show the various components provided.... Depreciation, Depletion, Amortization and Negative Salvage Expenses. Show, separately, the gas plant depreciation, depletion, amortization, and negative salvage expenses by functional classifications. For each...
Alternative Work Schedules in Office and Nonoffice Work Settings.
Kirk, Raymond J.; Barton, H. David
A rapidly growing change in the workplace is the replacement of a fixed work schedule with a variety of alternative work schedules (AWS), including both flexible and compressed schedules. Experimenting organizations (N=901) evaluated one of four major categories of AWS in office and nonoffice settings, i.e., a flexible 8-hour day;…
A Gas Scheduling Optimization Model for Steel Enterprises
Directory of Open Access Journals (Sweden)
Niu Honghai
2017-01-01
Full Text Available Regarding the scheduling problems of steel enterprises, this research designs the gas scheduling optimization model according to the rules and priorities. Considering different features and the process changes of the gas unit in the process of actual production, the calculation model of process state and gas consumption soft measurement together with the rules of scheduling optimization is proposed to provide the dispatchers with real-time gas using status of each process, then help them to timely schedule and reduce the gas volume fluctuations. In the meantime, operation forewarning and alarm functions are provided to avoid the abnormal situation in the scheduling, which has brought about very good application effect in the actual scheduling and ensures the safety of the gas pipe network system and the production stability.
PROMSYS, Plant Equipment Maintenance and Inspection Scheduling
International Nuclear Information System (INIS)
Morgan, D.L.; Srite, B.E.
1986-01-01
1 - Description of problem or function: PROMSYS is a computer system designed to automate the scheduling of routine maintenance and inspection of plant equipment. This 'programmed maintenance' provides the detailed planning and accomplishment of lubrication, inspection, and similar repetitive maintenance activities which can be scheduled at specified predetermined intervals throughout the year. The equipment items included are the typical pumps, blowers, motors, compressors, automotive equipment, refrigeration units, filtering systems, machine shop equipment, cranes, elevators, motor-generator sets, and electrical switchgear found throughout industry, as well as cell ventilation, shielding, containment, and material handling equipment unique to nuclear research and development facilities. Four related programs are used to produce sorted schedule lists, delinquent work lists, and optional master lists. Five additional programs are used to create and maintain records of all scheduled and unscheduled maintenance history. 2 - Method of solution: Service specifications and frequency are established and stored. The computer program reviews schedules weekly and prints, on schedule cards, instructions for service that is due the following week. The basic output from the computer program comes in two forms: programmed-maintenance schedule cards and programmed-maintenance data sheets. The data sheets can be issued in numerical building, route, and location number sequence as equipment lists, grouped for work assigned to a particular foreman as the foreman's equipment list, or grouped by work charged to a particular work order as the work-order list. Data sheets grouped by equipment classification are called the equipment classification list
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)
Crane Scheduling on a Plate Storage
DEFF Research Database (Denmark)
Hansen, Jesper
2002-01-01
OSS produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. Two gantry cranes carry out this task. The planning task is now to create a schedule of movements for the 2 cranes...
2010-04-01
... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule II. 1308.12 Section 1308.12 Food and... 9733 (26) Remifentanil 9739 (27) Sufentanil 9740 (28) Tapentadol 9780 (d) Stimulants. Unless... which contains any quantity of the following substances having a stimulant effect on the central nervous...
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.
Directory of Open Access Journals (Sweden)
Maxim A. Dulebenets
2018-03-01
Full Text Available Considering a substantial increase in volumes of the international seaborne trade and drastic climate changes due to carbon dioxide emissions, liner shipping companies have to improve planning of their vessel schedules and improve energy efficiency. This paper presents a novel mixed integer non-linear mathematical model for the green vessel scheduling problem, which directly accounts for the carbon dioxide emission costs in sea and at ports of call. The original non-linear model is linearized and then solved using CPLEX. A set of numerical experiments are conducted for a real-life liner shipping route to reveal managerial insights that can be of importance to liner shipping companies. Results indicate that the proposed mathematical model can serve as an efficient planning tool for liner shipping companies and may assist with evaluation of various carbon dioxide taxation schemes. Increasing carbon dioxide tax may substantially change the design of vessel schedules, incur additional route service costs, and improve the environmental sustainability. However, the effects from increasing carbon dioxide tax on the marine container terminal operations are found to be very limited.
Reducing Downlink Signaling Traffic in Wireless Systems Using Mobile-Assisted Scheduling
Moosavi, Reza; Larsson, Erik G.
2010-01-01
We present an idea to reduce the part of the downlink signaling traffic in wireless multiple access systems that contains scheduling information. The theoretical basis of the scheme is that the scheduling decisions made by the base station are correlated with the CSI reports from the mobiles. This correlation can be exploited by the source coding scheme that is used to compress the scheduling maps before they are sent to the mobiles. In the proposed scheme, this idea is implemented by letting...
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.
Intelligence amplification framework for enhancing scheduling processes
Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria Eugenia; van Hillegersberg, Jos
2016-01-01
The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This
42 CFR 414.620 - Publication of the ambulance fee schedule.
2010-10-01
... 42 Public Health 3 2010-10-01 2010-10-01 false Publication of the ambulance fee schedule. 414.620... SERVICES (CONTINUED) MEDICARE PROGRAM PAYMENT FOR PART B MEDICAL AND OTHER HEALTH SERVICES Fee Schedule for Ambulance Services § 414.620 Publication of the ambulance fee schedule. Changes in payment rates resulting...
Nurse Scheduling by Cooperative GA with Effective Mutation Operator
Ohki, Makoto
In this paper, we propose an effective mutation operators for Cooperative Genetic Algorithm (CGA) to be applied to a practical Nurse Scheduling Problem (NSP). The nurse scheduling is a very difficult task, because NSP is a complex combinatorial optimizing problem for which many requirements must be considered. In real hospitals, the schedule changes frequently. The changes of the shift schedule yields various problems, for example, a fall in the nursing level. We describe a technique of the reoptimization of the nurse schedule in response to a change. The conventional CGA is superior in ability for local search by means of its crossover operator, but often stagnates at the unfavorable situation because it is inferior to ability for global search. When the optimization stagnates for long generation cycle, a searching point, population in this case, would be caught in a wide local minimum area. To escape such local minimum area, small change in a population should be required. Based on such consideration, we propose a mutation operator activated depending on the optimization speed. When the optimization stagnates, in other words, when the optimization speed decreases, the mutation yields small changes in the population. Then the population is able to escape from a local minimum area by means of the mutation. However, this mutation operator requires two well-defined parameters. This means that user have to consider the value of these parameters carefully. To solve this problem, we propose a periodic mutation operator which has only one parameter to define itself. This simplified mutation operator is effective over a wide range of the parameter value.
2010-04-01
... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs... not less than 25 micrograms of atropine sulfate per dosage unit. (d) Stimulants. Unless specifically... which contains any quantity of the following substances having a stimulant effect on the central nervous...
Endogenous scheduling preferences and congestion
DEFF Research Database (Denmark)
Fosgerau, Mogens; Small, Kenneth
2010-01-01
and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....
Containment for small pressurized water reactors
International Nuclear Information System (INIS)
Siler, W.C.; Marda, R.S.; Smith, W.R.
1977-01-01
Babcock and Wilcox Company has prepared studies under ERDA contract of small and intermediate size (313, 365 and 1200 MWt) PWR reactor plants, for industrial cogeneration or electric power generation. Studies and experience with nuclear plants in this size range indicate unfavorable economics. To offset this disadvantage, modular characteristics of an integral reactor and close-coupled vapor suppression containment have been exploited to shorten construction schedules and reduce construction costs. The resulting compact reactor/containment complex is illustrated. Economic studies to date indicate that the containment design and the innovative construction techniques developed to shorten erection schedules have been important factors in reducing estimated project costs, thus potentially making such smaller plants competetive with competing energy sources
Schedules of requirements for the transport of specified types of radioactive material consignments
International Nuclear Information System (INIS)
1986-01-01
These Schedules have been prepared as a companion document to the 1985 Edition of the Transport Regulations (Safety Series No. 6). As presented here, the Schedules also reflect the corrections and changes implemented by the 1986 Supplement to the Regulations for the Safe Transport of Radioactive Material. Direct cross-referencing to the paragraphs, tables and figures in the Regulations is made, and the use of both the International System of Units (SI) and the formerly accepted, traditional units is continued. In many cases, due to rounding off the numbers, the two values for a given parameter for the two units may differ somewhat. To move toward international use of SI units and to avoid inconsistencies, the values for the SI units are controlling in all cases. These Schedules are provided only as an aid to users of the Regulations and the provisions of the Regulations take precedence over the Schedules. These Schedules also serve as a generic model of the Schedules which are part of modal international regulatory documents, such as the International Maritime Dangerous Goods (IMDG) Code of the International Maritime Organization (IMO), the European Agreement Concerning the International Carriage of Dangerous Goods by Road (ADR) and the International Convention Concerning the Carriage of Dangerous Goods by Rail (CIM/RID). For regulatory purposes, reference shall be made to the detailed provisions of the Regulations specified in Safety Series No. 6. The Schedules do not reproduce the provisions of the Regulations in detail nor do they contain any additional requirements. They merely provide a summary of the main provisions for each specified type of radioactive material, references being provided to the relevant detailed provisions of the Regulations to enable these to be consulted where necessary. A table summarizing package, shipment approval, and notification requirements of the Regulations is provided
Sensitivity analysis of numerical model of prestressed concrete containment
Energy Technology Data Exchange (ETDEWEB)
Bílý, Petr, E-mail: petr.bily@fsv.cvut.cz; Kohoutková, Alena, E-mail: akohout@fsv.cvut.cz
2015-12-15
Graphical abstract: - Highlights: • FEM model of prestressed concrete containment with steel liner was created. • Sensitivity analysis of changes in geometry and loads was conducted. • Steel liner and temperature effects are the most important factors. • Creep and shrinkage parameters are essential for the long time analysis. • Prestressing schedule is a key factor in the early stages. - Abstract: Safety is always the main consideration in the design of containment of nuclear power plant. However, efficiency of the design process should be also taken into consideration. Despite the advances in computational abilities in recent years, simplified analyses may be found useful for preliminary scoping or trade studies. In the paper, a study on sensitivity of finite element model of prestressed concrete containment to changes in geometry, loads and other factors is presented. Importance of steel liner, reinforcement, prestressing process, temperature changes, nonlinearity of materials as well as density of finite elements mesh is assessed in the main stages of life cycle of the containment. Although the modeling adjustments have not produced any significant changes in computation time, it was found that in some cases simplified modeling process can lead to significant reduction of work time without degradation of the results.
An introduction to optimal satellite range scheduling
Vázquez Álvarez, Antonio José
2015-01-01
The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, ...
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.
A customizable, scalable scheduling and reporting system.
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.
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.
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : first quarter.
2014-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : second quarter.
2013-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : fourth quarter.
2013-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : third quarter.
2013-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : second quarter.
2010-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : fourth quarter.
2011-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
Data Bank 10 - Form 41 Financial Schedules of U.S. Air Carriers : first quarter.
2009-01-01
This CD presents financial data for large certificated U.S. carriers. Schedule B-1 presents the balance sheets of the carrier's accounting reports. Schedules P-1 and P-6 contain profit and loss data (income and expense items) for the carrier's operat...
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.
Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration
Zelinski, Shannon; Windhorst, Robert
2016-01-01
A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.
Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)
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.
Yarnell, Christopher J; Shadowitz, Steven; Redelmeier, Donald A
2016-07-01
Physician call schedules are a critical element for medical practice and hospital efficiency. We compared readmission rates prior to and after a change in physician call system at Sunnybrook Health Sciences Centre. We studied patients discharged over a decade (2004 through 2013) and identified whether or not each patient was readmitted within the subsequent 28 days. We excluded patients discharged for a surgical, obstetrical, or psychiatric diagnosis. We used time-to-event analysis and time-series analysis to compare rates of readmission prior to and after the physician call system change (January 1, 2009). A total of 89,697 patients were discharged, of whom 10,001 (11%) were subsequently readmitted and 4280 died. The risk of readmission was increased by about 26% following physician call system change (9.7% vs 12.2%, P system change (95% confidence interval, 22%-31%; P system change persisted across patients with diverse ages, estimated readmission risks, and medical diagnoses. The net effect was equal to 7240 additional patient days in the hospital following call system change. A modest increase was observed at a nearby acute care hospital that did not change physician call system, and no increase in risk of death was observed with increased hospital readmissions. We suggest that changes in physician call systems sometimes increase subsequent hospital readmission rates. Further reductions in readmissions may instead require additional resources or ingenuity. Copyright © 2016 Elsevier Inc. All rights reserved.
A note on a model for quay crane scheduling with non-crossing constraints
DEFF Research Database (Denmark)
Santini, Alberto; Friberg, Henrik Alsing; Røpke, Stefan
2015-01-01
This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced. Computatio......This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced...
Environmental surveillance master sampling schedule
International Nuclear Information System (INIS)
Bisping, L.E.
1995-02-01
Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program
Environmental surveillance master sampling schedule
Energy Technology Data Exchange (ETDEWEB)
Bisping, L.E.
1995-02-01
Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program.
Designing container shipping network under changing demand and freight rates
Directory of Open Access Journals (Sweden)
C. Chen
2010-03-01
Full Text Available This paper focuses on the optimization of container shipping network and its operations under changing cargo demand and freight rates. The problem is formulated as a mixed integer non-linear programming problem (MINP with an objective of maximizing the average unit ship-slot profit at three stages using analytical methodology. The issues such as empty container repositioning, ship-slot allocating, ship sizing, and container configuration are simultaneously considered based on a series of the matrices of demand for a year. To solve the model, a bi-level genetic algorithm based method is proposed. Finally, numerical experiments are provided to illustrate the validity of the proposed model and algorithms. The obtained results show that the suggested model can provide a more realistic solution to the issues on the basis of changing demand and freight rates and arrange a more effective approach to the optimization of container shipping network structures and operations than does the model based on the average demand.
5 CFR 532.207 - Time schedule for wage surveys.
2010-01-01
... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Time schedule for wage surveys. 532.207... PREVAILING RATE SYSTEMS Prevailing Rate Determinations § 532.207 Time schedule for wage surveys. (a) Wage... and the collection of wage data by visits to establishments. (c) A wage-change survey shall be made...
The Growing Diversity of Work Schedules.
Smith, Shirley J.
1986-01-01
The author highlights the predominance of the five-day, 40-hour workweek. Although finding little change in recent years in the proportion of workers on 40-hour schedules, Smith notes that there have been some changes in work patterns, with a still small but growing group of workers on "compressed" full-time weeks of less than five days.…
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
ESSOPE: Towards S/C operations with reactive schedule planning
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.
Project management with dynamic scheduling baseline scheduling, risk analysis and project control
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.
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.
Cure Schedule for Stycast 2651/Catalyst 11.
Energy Technology Data Exchange (ETDEWEB)
Kropka, Jamie Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); McCoy, John D. [New Mexico Inst. of Mining and Technology, Socorro, NM (United States)
2017-11-01
The Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, Tg, exceeding cure temperature).
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...
Escobar, Carolina; Salgado, Roberto; Rodriguez, Katia; Blancas Vázquez, Aurea Susana; Angeles-Castellanos, Manuel; Buijs, Ruud M
2011-09-26
Food is a potent time signal for the circadian system and has shown to entrain and override temporal signals transmitted by the biological clock, the suprachiasmatic nucleus, which adjusts mainly to the daily light/dark (LD) alternation. Organisms mostly ingest food in their active period and this permits a correct coordination between the LD and the food elicited time signals with the circadian system. Under conditions when feeding opportunities are shifted to the usual resting/sleep phase, the potent entraining force of food, shifts circadian fluctuations in several tissues, organs, and brain structures toward meal time, resulting a desynchrony within the body and between the organism and the external LD cycle. The daily scheduled access to a palatable snack exerts similar changes specifically to brain areas involved in motivation and reward responses. This review describes the phenomenology of food entrainment and entrainment by a palatable snack. It suggests how scheduled feeding can lead to food addiction and how shifted feeding schedules toward the sleep phase can result in altered ingestive behavior, obesity and disturbed metabolic responses. Copyright © 2011 Elsevier Inc. All rights reserved.
Flexible Schedules and Shift Work.
Beers, Thomas M.
2000-01-01
Flexible work hours have gained prominence, as more than 25 million workers (27.6% of all full-time workers) can now vary their schedules. However, there has been little change since the mid-1980s in the proportion who work a shift other than a regular daytime shift. (JOW)
Environmental surveillance master sampling schedule
International Nuclear Information System (INIS)
Bisping, L.E.
1994-02-01
This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site
Environmental surveillance master sampling schedule
Energy Technology Data Exchange (ETDEWEB)
Bisping, L.E.
1994-02-01
This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site.
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.
Sensor Transmission Power Schedule for Smart Grids
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).
Environmental surveillance master sampling schedule
Energy Technology Data Exchange (ETDEWEB)
Bisping, L.E.
1993-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). Samples are routinely collected and analyzed to determine the quality of air, surface water, ground water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Drinking Water Project, and Ground-Water Surveillance Project.
Harper, Richard W; Nasis, Arthur; Sundararajan, Vijaya
2015-09-21
Rising health care costs above inflation are placing serious strains on the sustainability of the Australian Medicare system in its current structure. The Medicare Benefits Schedule (MBS), which lists rebates payable to patients for private medical services provided on a fee-for-service basis, is the cornerstone of the Australian health care system. Introduced in the 1980s, the MBS has changed little despite major advances in the evidence base for the practice of cardiology. We outline how we believe sensible changes to the MBS listings for four cardiac services--invasive coronary angiography, computed tomography coronary angiography, stress testing and percutaneous coronary intervention--would improve the clinical practice of cardiology and save substantial amounts of taxpayer money.
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
Accelerating exact schedulability analysis for fixed-priority pre-emptive scheduling
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
A Review Of Fault Tolerant Scheduling In Multicore Systems
Directory of Open Access Journals (Sweden)
Shefali Malhotra
2015-05-01
Full Text Available Abstract In this paper we have discussed about various fault tolerant task scheduling algorithm for multi core system based on hardware and software. Hardware based algorithm which is blend of Triple Modulo Redundancy and Double Modulo Redundancy in which Agricultural Vulnerability Factor is considered while deciding the scheduling other than EDF and LLF scheduling algorithms. In most of the real time system the dominant part is shared memory.Low overhead software based fault tolerance approach can be implemented at user-space level so that it does not require any changes at application level. Here redundant multi-threaded processes are used. Using those processes we can detect soft errors and recover from them. This method gives low overhead fast error detection and recovery mechanism. The overhead incurred by this method ranges from 0 to 18 for selected benchmarks. Hybrid Scheduling Method is another scheduling approach for real time systems. Dynamic fault tolerant scheduling gives high feasibility rate whereas task criticality is used to select the type of fault recovery method in order to tolerate the maximum number of faults.
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.
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.
Belke, T W
2000-05-01
Six male Wistar rats were exposed to different orders of reinforcement schedules to investigate if estimates from Herrnstein's (1970) single-operant matching law equation would vary systematically with schedule order. Reinforcement schedules were arranged in orders of increasing and decreasing reinforcement rate. Subsequently, all rats were exposed to a single reinforcement schedule within a session to determine within-session changes in responding. For each condition, the operant was lever pressing and the reinforcing consequence was the opportunity to run for 15 s. Estimates of k and R(O) were higher when reinforcement schedules were arranged in order of increasing reinforcement rate. Within a session on a single reinforcement schedule, response rates increased between the beginning and the end of a session. A positive correlation between the difference in parameters between schedule orders and the difference in response rates within a session suggests that the within-session change in response rates may be related to the difference in the asymptotes. These results call into question the validity of parameter estimates from Herrnstein's (1970) equation when reinforcer efficacy changes within a session.
Electricity usage scheduling in smart building environments using smart devices.
Lee, Eunji; Bahn, Hyokyung
2013-01-01
With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%.
Preliminary Study of Applying Phase Change Materials (PCM) for Containment Passive Cooling
International Nuclear Information System (INIS)
Ko, A Reum; Lee, Jeong Ik; Yoon, Ho Joon
2016-01-01
Most of Pressurized Water Reactor (PWR) containments use fan cooler systems and containment spray systems. However, the importance of passive safety system has increased after the Fukushima accident. As the main passive safety system, Passive Containment Cooling System (PCCS), which utilizes natural phenomena to remove the heat released from the reactor, is suggested in the advanced pressurized water reactor (APWR). To increase the efficiency of passive cooling, additional passive containment cooling method using Phase Change Material (PCM) is suggested in this paper. For containment using PCMs, there are many advantages. Phase Change Material (PCM) is proposed as an additional passive containment cooling method to increase the efficiency of passive cooling in this paper. To apply proper PCMs to containment, commercially available PCMs were screened while reviewing thermophysical properties data and suggested selection criteria. A sensitivity study was also carried out to identify the effect of potential installation location of PCM using the CAP code. The pressure of containment in most cases showed slightly higher than that of the initial case. For the temperature of steam and water and humidity, similar results with the initial case were showed in most cases
Preliminary Study of Applying Phase Change Materials (PCM) for Containment Passive Cooling
Energy Technology Data Exchange (ETDEWEB)
Ko, A Reum; Lee, Jeong Ik [KAIST, Daejeon (Korea, Republic of); Yoon, Ho Joon [KUSTAR, Abu Dhabi (United Arab Emirates)
2016-05-15
Most of Pressurized Water Reactor (PWR) containments use fan cooler systems and containment spray systems. However, the importance of passive safety system has increased after the Fukushima accident. As the main passive safety system, Passive Containment Cooling System (PCCS), which utilizes natural phenomena to remove the heat released from the reactor, is suggested in the advanced pressurized water reactor (APWR). To increase the efficiency of passive cooling, additional passive containment cooling method using Phase Change Material (PCM) is suggested in this paper. For containment using PCMs, there are many advantages. Phase Change Material (PCM) is proposed as an additional passive containment cooling method to increase the efficiency of passive cooling in this paper. To apply proper PCMs to containment, commercially available PCMs were screened while reviewing thermophysical properties data and suggested selection criteria. A sensitivity study was also carried out to identify the effect of potential installation location of PCM using the CAP code. The pressure of containment in most cases showed slightly higher than that of the initial case. For the temperature of steam and water and humidity, similar results with the initial case were showed in most cases.
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.
Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2010
Energy Technology Data Exchange (ETDEWEB)
Bisping, Lynn E.
2010-01-08
Environmental surveillance of the Hanford Site and surrounding areas is conducted by Pacific Northwest National Laboratory for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford Site environs per regulatory requirements. This document contains the calendar year 2010 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 2010, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2010.
Routing and Scheduling Problems of Container Trucks in a Shared Resource Environment
Jeong, Kyungsoo
2017-01-01
More frequent vehicle movements are required for moving containers in a local area due to low unit volume that a single vehicle can handle compared with vessels and rails involved in the container supply chain. For this reason, truck operations for moving containers significantly affect not only transportation cost itself but also product price. They have inherent operational inefficiencies associated with empty container movements and container processes at facilities such as warehouses, d...
Flexible ship loading problem with transfer vehicle assignment and scheduling
DEFF Research Database (Denmark)
Iris, Çağatay; Christensen, Jonas; Pacino, Dario
2018-01-01
This paper presents the flexible containership loading problem for seaport container terminals. The integrated management of loading operations, planning of the transport vehicles to use and their scheduling is what we define as the Flexible Ship Loading Problem (FSLP). The flexibility comes from...
29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.
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...
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....
2010-04-01
... scheduling, report content, and signature requirements. 416.919n Section 416.919n Employees' Benefits SOCIAL... medical source of examination scheduling, report content, and signature requirements. The medical sources... report containing all of the elements in paragraph (c). (e) Signature requirements. All consultative...
2010-04-01
... scheduling, report content, and signature requirements. 404.1519n Section 404.1519n Employees' Benefits... medical source of examination scheduling, report content, and signature requirements. The medical sources... report containing all of the elements in paragraph (c). (e) Signature requirements. All consultative...
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.
Flexible work schedules, older workers, and retirement.
Siegenthaler, J K; Brenner, A M
2000-01-01
Older workers in the United States indicate that they would prefer flexible work arrangements rather than abrupt retirement, yet management has done very little to make this possible. A review of two bodies of literature from the late 1980s is presented: social science writings including sociological, gerontological, and economic literature, and business and management literature. There is a clash between the way jobs are traditionally scheduled and the needs of growing numbers of older workers. Workers continue to be subject to obstacles to phased retirement due to the structuring of health care and pension benefits, downsizing, organizational inflexibility, and "corporate culture." Thus, general views among social scientists regarding the desirability of flexible schedules toward retirement will not produce real changes unless management becomes committed to such changes and they are securely embedded in company policies.
Radioactive Waste Management System: Draft Project Decision Schedule. Revision
International Nuclear Information System (INIS)
1985-07-01
The Nuclear Waste Policy Act (NWPA) of 1982 (Pub. L. 97-425) requires that the Secretary of Energy prepare, in cooperation with affected Federal agencies, a Project Decision Schedule that portrays the optimum way to attain the operation of geologic repositories. The Draft Project Decision Schedule portrays the major milestones of the Radioactive Waste Management System. It also depicts the set of activities for which Federal agencies have responsibility and the deadlines for taking the required action that are associated with the activities. The NWPA also requires that Federal agencies having determined that they: (1) cannot comply with a deadline for taking a required action; or (2) fail to comply with a deadline contained in the Project Decision Schedule; submit a comprehensive report to the Secretary of Energy and Congress to explain their failure or expected failure. The Secretary, in turn, is required to submit to Congress a response to the agency's report. 7 figs., 13 tabs
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.
Composite containment for nuclear power
International Nuclear Information System (INIS)
Harstead, G.A.; Soeoet, O.
1977-01-01
Fundamentally, a nuclear reactor containment structure provides three major functions; namely, (1), to withstand loads due to pressure and temperature increase due to Design Basis Accident (DBA) (2), to withstand environmental loads such as seismic, tornado and normal loads, and (3) act as a radiation shield. Conventional design practise is to employ either a steel vessel and concrete shield building or a steel lined concrete structure. This paper deals with a new concept in which a steel liner is employed which carries much of the primary membrane loads. This type of structure is similar in some aspects to the previously described systems: a) A mat, lined with a thin plate on its top surface, is similar to concrete containment. b) A cylinder and hemispherical dome, made up of steel plate and concrete, is about 2.5 feet thick (the minimum required for radiation shielding). Although the steel plate and concrete are in contact, as in concrete containment, the steel plate in composite containment is much thicker than the liner. There are two main advantages over present practise; namely reduction of materials and therefore reduced capital cost and even more significantly a shortened construction schedule which will permit more flexibility in overall plant construction schedule and will benefit the cash flow situation. (Auth.)
The CANDU 3 containment structure
International Nuclear Information System (INIS)
1994-01-01
The design of the CANDU 3 nuclear power plant is being developed by AECL CANDU's Saskatchewan office. There are 24 CANDU nuclear power units operating in Canada and abroad and eight units are under construction is Romania and South Korea. The design of the CANDU 3 plant has evolved on the basis of the proven CANDU design. The experiences gained during construction, commissioning and operation of the existing CANDU plants are considered in the design. Many technological enhancements have been implemented in the design processes in all areas. The object has been to develop an improved reactor design that is suitable for the current and the future markets worldwide. Throughout the design phase of CANDU 3, emphasis has been placed in reducing the cost and construction schedule of the plant. This has been achieved by implementing design improvements and using new construction techniques. Appropriate changes and improvements to the design to suit new requirements are also adopted. In CANDU plants, the containment structure acts as an ultimate barrier against the leakage of radioactive substances during normal operations and postulated accident conditions. The concept of the structural design of the containment structure has been examined in considerable detail. This has resulted in development of a new conceptual design for the containment structure for CANDU 3. This paper deals with this new design of the containment structure
International Nuclear Information System (INIS)
McCauley, V.S.; Keiser, J.R.
1992-01-01
This paper summarizes the findings of the Containment Working Group which met at the Workshop on Radioactive, Hazardous, and/or Mixed Waste Sludge Management. The Containment Working Group (CWG) examined the problems associated with providing adequate containment of waste forms from both short- and long-term storage. By its nature, containment encompasses a wide variety of waste forms, storage conditions, container types, containment schemes, and handling activities. A containment system can be anything from a 55-gal drum to a 100-ft-long underground vault. Because of the diverse nature of containment systems, the CWG chose to focus its limited time on broad issues that are applicable to the design of any containment system, rather than attempting to address problems specific to a particular containment system or waste-form type. Four major issues were identified by the CWG. They relate to: (1) service conditions and required system performance; (2) ultimate disposition; (3) cost and schedule; and (4) acceptance criteria, including quality assurance/quality control (QA/QC) concerns. All of the issues raised by the group are similar in that they all help to define containment system requirements
Surgical scheduling: a lean approach to process improvement.
Simon, Ross William; Canacari, Elena G
2014-01-01
A large teaching hospital in the northeast United States had an inefficient, paper-based process for scheduling orthopedic surgery that caused delays and contributed to site/side discrepancies. The hospital's leaders formed a team with the goals of developing a safe, effective, patient-centered, timely, efficient, and accurate orthopedic scheduling process; smoothing the schedule so that block time was allocated more evenly; and ensuring correct site/side. Under the resulting process, real-time patient information is entered into a database during the patient's preoperative visit in the surgeon's office. The team found the new process reduced the occurrence of site/side discrepancies to zero, reduced instances of changing the sequence of orthopedic procedures by 70%, and increased patient satisfaction. Copyright © 2014 AORN, Inc. Published by Elsevier Inc. All rights reserved.
Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2009
Energy Technology Data Exchange (ETDEWEB)
Bisping, Lynn E.
2009-01-20
Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory for the U.S. Department of Energy. Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 450.1 and DOE Order 5400.5. This document contains the calendar year 2009 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. If a sample will not be collected in 2009, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2009.
Sleep schedules and school performance in Indigenous Australian children.
Blunden, Sarah; Magee, Chris; Attard, Kelly; Clarkson, Larissa; Caputi, Peter; Skinner, Timothy
2018-04-01
Sleep duration and sleep schedule variability have been related to negative health and well-being outcomes in children, but little is known about Australian Indigenous children. Data for children aged 7-9 years came from the Australian Longitudinal Study of Indigenous Children and the National Assessment Program-Literacy and Numeracy (NAPLAN). Latent class analysis determined sleep classes taking into account sleep duration, bedtimes, waketimes, and variability in bedtimes from weekdays to weekends. Regression models tested whether the sleep classes were cross-sectionally associated with grade 3 NAPLAN scores. Latent change score modeling then examined whether the sleep classes predicted changes in NAPLAN performance from grades 3 to 5. Five sleep schedule classes were identified: normative sleep, early risers, long sleep, variable sleep, and short sleep. Overall, long sleepers performed best, with those with reduced sleep (short sleepers and early risers) performing the worse on grammar, numeracy, and writing performance. Latent change score results also showed that long sleepers performed best in spelling and writing and short sleepers and typical sleepers performed the worst over time. In this sample of Australian Indigenous children, short sleep was associated with poorer school performance compared with long sleep, with this performance worsening over time for some performance indicators. Other sleep schedules (eg, early wake times and variable sleep) also had some relationships with school performance. As sleep scheduling is modifiable, this offers opportunity for improvement in sleep and thus performance outcomes for these and potentially all children. Copyright © 2018 National Sleep Foundation. Published by Elsevier Inc. All rights reserved.
Constraint-based scheduling applying constraint programming to scheduling problems
Baptiste, Philippe; Nuijten, Wim
2001-01-01
Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...
Scheduling for decommissioning projects
International Nuclear Information System (INIS)
Podmajersky, O.E.
1987-01-01
This paper describes the Project Scheduling system being employed by the Decommissioning Operations Contractor at the Shippingport Station Decommissioning Project (SSDP). Results from the planning system show that the project continues to achieve its cost and schedule goals. An integrated cost and schedule control system (C/SCS) which uses the concept of earned value for measurement of performance was instituted in accordance with DOE orders. The schedule and cost variances generated by the C/SCS system are used to confirm management's assessment of project status. This paper describes the types of schedules and tools used on the SSDP project to plan and monitor the work, and identifies factors that are unique to a decommissioning project that make scheduling critical to the achievement of the project's goals. 1 fig
Program reference schedule baseline
International Nuclear Information System (INIS)
1986-07-01
This Program Reference Schedule Baseline (PRSB) provides the baseline Program-level milestones and associated schedules for the Civilian Radioactive Waste Management Program. It integrates all Program-level schedule-related activities. This schedule baseline will be used by the Director, Office of Civilian Radioactive Waste Management (OCRWM), and his staff to monitor compliance with Program objectives. Chapter 1 includes brief discussions concerning the relationship of the PRSB to the Program Reference Cost Baseline (PRCB), the Mission Plan, the Project Decision Schedule, the Total System Life Cycle Cost report, the Program Management Information System report, the Program Milestone Review, annual budget preparation, and system element plans. Chapter 2 includes the identification of all Level 0, or Program-level, milestones, while Chapter 3 presents and discusses the critical path schedules that correspond to those Level 0 milestones
Optimizing an F-16 Squadron Weekly Pilot Schedule for the Turkish Air Force
2010-03-01
disrupted schedules are rescheduled , minimizing the total number of changes with respect to the previous schedule’s objective function. Output...producing rosters for a nursing staff in a large general hospital (Dowsland, 1998) and afterwards Aickelin and Dowsland use an Indirect Genetic...algorithm to improve the solutions of the nurse scheduling problem which is similar to the fighter squadron pilot scheduling problem (Aickelin and
Space network scheduling benchmark: A proof-of-concept process for technology transfer
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.
Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure
Matyska, Ludek; Ruda, Miroslav; Toth, Simon
For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.
Zweben, Monte
1993-01-01
The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.
Perceptions of randomized security schedules.
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.
Freezing the Master Production Schedule Under Rolling Planning Horizons
V. Sridharan; William L. Berry; V. Udayabhanu
1987-01-01
The stability of the Master Production Schedule (MPS) is a critical issue in managing production operations with a Material Requirements Planning System. One method of achieving stability is to freeze some portion or all of the MPS. While freezing the MPS can limit the number of schedule changes, it can also produce an increase in production and inventory costs. This paper examines three decision variables in freezing the MPS: the freezing method, the freeze interval length, and the planning ...
2013-12-10
This major final rule with comment period addresses changes to the physician fee schedule, clinical laboratory fee schedule, and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. This final rule with comment period also includes a discussion in the Supplementary Information regarding various programs. (See the Table of Contents for a listing of the specific issues addressed in the final rule with comment period.)
Analysis of wallboard containing a phase change material
Tomlinson, J. J.; Heberle, D. P.
Phase change materials (PCMs) used on the interior of buildings hold the promise for improved thermal performance by reducing the energy requirements for space conditioning and by improving thermal comfort by reducing temperature swings inside the building. Efforts are underway to develop a gypsum wallboard containing a hydrocarbon PCM. With a phase change temperature in the room temperature range, the PCM wallboard adds substantially to the thermal mass of the building while serving the same architectural function as conventional wallboard. To determine the thermal and economic performance of this PCM wallboard, the Transient Systems Simulation Program (TRNSYS) was modified to accommodate walls that are covered with PCM plasterboard, and to apportion the direct beam solar radiation to interior surfaces of a building. The modified code was used to simulate the performance of conventional and direct-gain passive solar residential-sized buildings with and without PCM wallboard. Space heating energy savings were determined as a function of PCM wallboard characteristics. Thermal comfort improvements in buildings containing the PCM were qualified in terms of energy savings. The report concludes with a present worth economic analysis of these energy savings and arrives at system costs and economic payback based on current costs of PCMs under study for the wallboard application.
The application of artificial intelligence to astronomical scheduling problems
Johnston, Mark D.
1992-01-01
Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike
Classical verification of quantum circuits containing few basis changes
Demarie, Tommaso F.; Ouyang, Yingkai; Fitzsimons, Joseph F.
2018-04-01
We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier hierarchy, the lowest level for which there is an established quantum advantage. We show that when the circuit has an outcome with probability at least the inverse of some polynomial in the circuit size, the outcome can be checked in polynomial time with bounded error by a completely classical verifier. This verification procedure is based on random sampling of computational paths and is only possible given knowledge of the likely outcome.
Hanford site environmental surveillance master sampling schedule
International Nuclear Information System (INIS)
Bisping, L.E.
1998-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 open-quotes General Environmental Protection Program,close quotes and DOE Order 5400.5, open-quotes Radiation Protection of the Public and the Environment.close quotes The sampling methods are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 2, U.S. Department of Energy, Richland, Washington. This document contains the 1998 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section of this document describes the planned sampling schedule for a specific media (air, surface water, biota, soil and vegetation, sediment, and external radiation). Each section includes the sample location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be planned for 1998 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing sample locations
Graduate Program Scheduling Gains Flexibility through Container Courses: A Case Study
Rose, Richard
2011-01-01
Online course delivery makes possible one innovation which can provide each student with greater program flexibility as well as some personal ownership of the direction and pace of his degree progress. This concept can be called the "container course." A container course is the offering of more than one course simultaneously under a single course…
Application of Tabu Search Algorithm in Job Shop Scheduling
Directory of Open Access Journals (Sweden)
Betrianis Betrianis
2010-10-01
Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.
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.
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.
Master schedule for CY-1982 Hanford environmental surveillance routine program
International Nuclear Information System (INIS)
Blumer, P.J.; Sula, M.J.; Eddy, P.A.
1981-12-01
This report provides the current schedule of data collection for the routine environmental surveillance program at the Hanford Site. The environmental surveillance program objectives are to evaluate and report the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5484.1. The routine sampling schedule provided does not include samples which are planned to be collected during FY-1982 in support of special studies or for quality control purposes. In addition, the routine program outlined in this schedule is subject to modification during the year in response to changes in Site operations, program requirements, or unusual sample results. Sampling schedules are presented for the following: air; Columbia River; sanitary water; surface water; ground water; foodstuffs; wildlife; soil and vegetation; external radiation measurements; portable instrument surveys; and surveillance of waste disposal sites
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
A preliminary analysis of the reactor-based plutonium disposition alternative deployment schedules
International Nuclear Information System (INIS)
Zurn, R.M.
1997-09-01
This paper discusses the preliminary analysis of the implementation schedules of the reactor-based plutonium disposition alternatives. These schedule analyses are a part of a larger process to examine the nine decision criteria used to determine the most appropriate method of disposing of U.S. surplus weapons plutonium. The preliminary analysis indicates that the mission durations for the reactor-based alternatives range from eleven years to eighteen years and the initial mission fuel assemblies containing surplus weapons-usable plutonium could be loaded into the reactors between nine and fourteen years after the Record of Decision
Cultural-Based Genetic Tabu Algorithm for Multiobjective Job Shop Scheduling
Directory of Open Access Journals (Sweden)
Yuzhen Yang
2014-01-01
Full Text Available The job shop scheduling problem, which has been dealt with by various traditional optimization methods over the decades, has proved to be an NP-hard problem and difficult in solving, especially in the multiobjective field. In this paper, we have proposed a novel quadspace cultural genetic tabu algorithm (QSCGTA to solve such problem. This algorithm provides a different structure from the original cultural algorithm in containing double brief spaces and population spaces. These spaces deal with different levels of populations globally and locally by applying genetic and tabu searches separately and exchange information regularly to make the process more effective towards promising areas, along with modified multiobjective domination and transform functions. Moreover, we have presented a bidirectional shifting for the decoding process of job shop scheduling. The computational results we presented significantly prove the effectiveness and efficiency of the cultural-based genetic tabu algorithm for the multiobjective job shop scheduling problem.
Multi-flow scheduling for coordinated direct and relayed users in cellular systems
DEFF Research Database (Denmark)
Thai, Chan; Popovski, Petar; Kaneko, Megumi
2013-01-01
. Such are the Coordinated Direct/Relay (CDR) schemes, where each basic transmission involves two flows to a direct and a relayed user. Usage of MFT schemes as building blocks of more complex transmission schemes essentially changes the problem of scheduling, since some of the flows to be scheduled are coupled in a signal...
Preemptive scheduling with rejection
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
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
Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing
Directory of Open Access Journals (Sweden)
Hendra Achmadi
2010-06-01
Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.
An Agent-Based Solution Framework for Inter-Block Yard Crane Scheduling Problems
Directory of Open Access Journals (Sweden)
Omor Sharif
2012-06-01
Full Text Available The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations. Most container terminals use yard cranes to transfer containers between the yard and trucks (both external and internal. To facilitate vessel operations, an efficient work schedule for the yard cranes is necessary given varying work volumes among yard blocks with different planning periods. This paper investigated an agent-based approach to assign and relocate yard cranes among yard blocks based on the forecasted work volumes. The goal of our study is to reduce the work volume that remains incomplete at the end of a planning period. We offered several preference functions for yard cranes and blocks which are modeled as agents. These preference functions are designed to find effective schedules for yard cranes. In addition, we examined various rules for the initial assignment of yard cranes to blocks. Our analysis demonstrated that our model can effectively and efficiently reduce the percentage of incomplete work volume for any real-world sized problem.
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
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
Galatsch, Michael; Li, Jian; Derycke, Hanne; Müller, Bernd Hans; Hasselhorn, Hans Martin
2013-12-05
Previous cross-sectional findings from the European Nurses Early Exit Study (NEXT) show that nurses who were dissatisfied with their work schedule tended to consider leaving the nursing profession. Mediating factors in this decision process may be caused by self-perceived poor work ability and/or health. The aim of this paper is to investigate changes in work ability and general health among nurses in relation to requested, forced and denied change of shift schedule. Longitudinal data from the NEXT Study was used. In total 11,102 nurses from Belgium, Germany, Finland, the Netherlands, Poland, Slovakia, France and Italy completed both the 'basic questionnaire' (t1) and the '12 month follow-up questionnaire' (t2). To examine the time-effect (repeated measures) and the group-effect of five defined groups of nurses on the Work Ability Index (WAI) and general health (SF36), an adjusted 2-way analysis of covariance (ANCOVA) was performed. The nurses who wanted to, but could not change their shifts during the 12 month follow-up had the lowest initial and follow-up scores for WAI (t1: 37.6, t2: 36.6, p work ability and to a lesser comparatively low extent with increased decline in health scores. A forced change of shift against the nurses' will was significantly associated with a deteriorating work ability and health. The findings would suggest that nurses' desire to change their shift patterns may be an indicator for perceived low work ability and/or low health. The results also indicate that fulfilling nurses' wishes with respect to their shift work pattern may improve their personal resources such as work ability and - to somewhat lesser extent - health. Disregarding nurses' preferences, however, bears the risk for further resource deterioration. The findings imply that shift schedule organization may constitute a valuable preventive tool to promote nurses' work ability and - to lesser extent - their perceived health, not least in aging nursing work forces.
Development of Latent Heat Storage Phase Change Material Containing Plaster
Directory of Open Access Journals (Sweden)
Diana BAJARE
2016-05-01
Full Text Available This paper reviews the development of latent heat storage Phase Change Material (PCM containing plaster as in passive application. Due to the phase change, these materials can store higher amounts of thermal energy than traditional building materials and can be used to add thermal inertia to lightweight constructions. It was shown that the use of PCMs have advantages stabilizing the room temperature variations during summer days, provided sufficient night ventilation is allowed. Another advantage of PCM usage is stabilized indoor temperature on the heating season. The goal of this study is to develop cement and lime based plaster containing microencapsulated PCM. The plaster is expected to be used for passive indoor applications and enhance the thermal properties of building envelope. The plaster was investigated under Scanning Electron Microscope and the mechanical, physical and thermal properties of created plaster samples were determined.
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.
Schedule-dependency of doxorubicin and vinblastine in EAT tumours in mice
International Nuclear Information System (INIS)
Auersperg, M.; Pogacnik, A.; Kloboves-Prevodnik, V.; Sersa, G.; Cemazar, M.
2006-01-01
Background. Antitumour schedule-dependency of the doxorubicin and vinblastine combination was explored. Materials and methods. Intraperitoneal Ehrlich ascites tumours (EAT) syngeneic to CBA mice were treated with vinblastine or doxorubicin alone, or in combined treatment schedules. Results. Combinations of doxorubicin and vinblastine administered at 48-h, but not at 24-h interval, regardless of the sequence of drugs, significantly reduced the number of tumour cells in the ascites in comparison with all other treatments. In the combined treatment schedules, the predominant morphological changes as well as DNA distribution pattern were dependent on the first drug applied. Regardless of the sequence of the drugs, median survival times of animals did not significantly differ between the treatment groups. Conclusions. The effect of combination of vinblastine and doxorubicin is schedule-dependent. The time interval, but not the sequence of drugs seems to be crucial for the observed effect. The data from preclinical studies are important for planning combined treatment schedules in clinical setting. (author)
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.
DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations
Rosenberg, Arnold L; Sotteau, Dominique; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; Interconnection networks and mapping and scheduling parallel computations
1995-01-01
The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed pro...
DEVELOPMENT OF GENETIC ALGORITHM-BASED METHODOLOGY FOR SCHEDULING OF MOBILE ROBOTS
DEFF Research Database (Denmark)
Dang, Vinh Quang
problem is to minimize the total traveling time of the single mobile robot and thereby increase its availability. For the second scheduling problem, a fleet of mobile robots is considered together with a set of machines to carry out different types of tasks, e.g. pre-assembly or quality inspection. Some...... problem and finding optimal solutions for each one. However, the formulated mathematical models could only be applicable to small-scale problems in practice due to the significant increase of computation time as the problem size grows. Note that making schedules of mobile robots is part of real-time....... For the first scheduling problem, a single mobile robot is considered to collect and transport container of parts and empty them into machine feeders where needed. A limit on carrying capacity of the single mobile robot and hard time windows of part-feeding tasks are considered. The objective of the first...
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
Tramp Ship Routing and Scheduling - Models, Methods and Opportunities
DEFF Research Database (Denmark)
Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin
of their demand in advance. However, the detailed requirements of these contract cargoes can be subject to ongoing changes, e.g. the destination port can be altered. For tramp operators, a main concern is therefore the efficient and continuous planning of routes and schedules for the individual ships. Due...... and scheduling problem, focus should now be on extending this basic problem to include additional real-world complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new...
An Improved Scheduling Technique for Time-Triggered Embedded Systems
DEFF Research Database (Denmark)
Pop, Paul; Eles, Petru; Peng, Zebo
1999-01-01
clock synchronization and mode changes. We have improved the quality of the schedules by introducing a new priority function that takes into consideration the communication protocol. Communication has been optimized through packaging messages into slots with a properly selected order and lengths......In this paper we present an improved scheduling technique for the synthesis of time-triggered embedded systems. Our system model captures both the flow of data and that of control. We have considered communication of data and conditions for a time-triggered protocol implementation that supports...
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....
Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems
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.
Orchestration and scheduling of containers in highly available environments
Golja , Dejan
2016-01-01
We are in a period of accelerated adoption of containers - every month more and more companies are introducing and exploring the possibility of using this technology in their environment. Despite the fact that the technology and tools associated with its use are not yet fully standardized, they still bring a lot of benefits. They enable simplified development, empower the usage of microservices and provide a better platform to adjust the capacity of the resources, based on traffic. Neverthele...
Size-based scheduling to improve web performance
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.
Scheduling theory, algorithms, and systems
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...
Suggested instructions for the completion of delivery commitment schedules
International Nuclear Information System (INIS)
Vance, S.A.
1992-01-01
This presentation discusses the Delivery Commitment Schedule form contained in Appendix C of the Standard Contract for Disposal of Spent Nuclear Fuel and/or High-Level Radioactive Waste (the Standard Contract). In particular, the presentation describes some preliminary suggested instructions for completing the form in a manner that may aid the US Department of Energy (DOE) in the development of the Federal Waste Management System (FWMS)
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....
Qiao Wei; Li Ying; Wu Zhong-Hai
2017-01-01
Deep neural networks (DNNs) have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling ...
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
18 CFR 154.202 - Filings to initiate a new rate schedule.
2010-04-01
... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Filings to initiate a new rate schedule. 154.202 Section 154.202 Conservation of Power and Water Resources FEDERAL ENERGY... contain a notice of the interdependence. (b) If a new service, facility, or rate is specifically...
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
International Nuclear Information System (INIS)
Douglas, D.G.; Starr, J.W.; Juliano, T.M.; Maresca, J.W. Jr.
1993-09-01
This document provides a detailed leak detection test plan and schedule for leak testing many of the pipelines that comprise the active portion of the liquid low-level waste (LLLW) system at the Oak Ridge National Laboratory (ORNL). This plan was prepared in response to the requirements of the Federal Facility Agreement (FFA) between the US Department of Energy (DOE) and two other agencies, the US Environmental Protection Agency (EPA) and the Tennessee Department of Environment and Conservation (TDEC). The LLLW system is an interconnected complex of tanks and pipelines. The FFA distinguishes four categories of tank and pipeline systems within this complex: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems. This plan and schedule addresses leak testing of the Category C pipelines and those doubly contained pipelines that do not fully meet the requirements for secondary containment as listed in the FFA
Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2008
Energy Technology Data Exchange (ETDEWEB)
Bisping, Lynn E.
2008-01-01
Environmental surveillance of the Hanford Site and surrounding areas is conducted by Pacific Northwest National Laboratory for the U.S. Department of Energy. Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 450.1, "Environmental Protection Program," and DOE Order 5400.5, "Radiation Protection of the Public and the Environment." The environmental surveillance sampling design is described in the "Hanford Site Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office." This document contains the calendar year 2008 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. If a sample will not be collected in 2008, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2008.
International Nuclear Information System (INIS)
Hunter, M.A.
1993-11-01
The F and H-area HLW Tank Farms are one component of a larger integrated waste treatment system consisting of facilities designed for the overall processing of several radioactive waste streams resulting from nuclear material processing. Section IX.E of the SRS Federal Facility Agreement requires the DOE to submit to the EPA and SCDHEC for review and approval, a plan(s) and schedule(s) for the removal from service of waste tank systems(s)/component(s) that do not meet secondary containment standards, or that leak or have leaked. The Plan and Schedule for removal from service of these waste tanks is shown in Appendices A and B, respectively. Other portions of this package which include schedule dates are provided for information only. The SRS intends to remove systems from service as opposed to providing secondary containment for non-compliant systems. The systems that do not meet secondary containment requirements or that have leaked (as determined by tank assessment reports) include High Level Waste Tanks No. 1--24 along with corresponding ancillary equipment
Real-time scheduling of software tasks
International Nuclear Information System (INIS)
Hoff, L.T.
1995-01-01
When designing real-time systems, it is often desirable to schedule execution of software tasks based on the occurrence of events. The events may be clock ticks, interrupts from a hardware device, or software signals from other software tasks. If the nature of the events, is well understood, this scheduling is normally a static part of the system design. If the nature of the events is not completely understood, or is expected to change over time, it may be necessary to provide a mechanism for adjusting the scheduling of the software tasks. RHIC front-end computers (FECs) provide such a mechanism. The goals in designing this mechanism were to be as independent as possible of the underlying operating system, to allow for future expansion of the mechanism to handle new types of events, and to allow easy configuration. Some considerations which steered the design were programming paradigm (object oriented vs. procedural), programming language, and whether events are merely interesting moments in time, or whether they intrinsically have data associated with them. The design also needed to address performance and robustness tradeoffs involving shared task contexts, task priorities, and use of interrupt service routine (ISR) contexts vs. task contexts. This paper will explore these considerations and tradeoffs
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.
Valency state changes in lanthanide-contained systems under high pressure
Energy Technology Data Exchange (ETDEWEB)
Jayaraman, A
1980-08-01
Changes in valency state induced by pressure in samarium sulphide SmS remind one of alchemy, as the mat black initial substance shines golden after the electron transition. The alchemist's dream is of course not realized, however the compound does exhibit an unusually interesting behaviour in the new state. The valency state of samarium as newly appeared fluctuated very rapidly between two electron configurations. Manipulation of the valency state by pressure or chemical substitution can basically change the physical properties of systems containing lanthanides. The phenomena are described and discussed in the following survey.
Environmental surveillance master sampling schedule
Energy Technology Data Exchange (ETDEWEB)
Bisping, L E
1992-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. Samples for radiological analyses include Air-Particulate Filter, gases and vapor; Water/Columbia River, Onsite Pond, Spring, Irrigation, and Drinking; Foodstuffs/Animal Products including Whole Milk, Poultry and Eggs, and Beef; Foodstuffs/Produce including Leafy Vegetables, Vegetables, and Fruit; Foodstuffs/Farm Products including Wine, Wheat and Alfalfa; Wildlife; Soil; Vegetation; and Sediment. Direct Radiation Measurements include Terrestrial Locations, Columbia River Shoreline Locations, and Onsite Roadway, Railway and Aerial, Radiation Surveys.
Flexible Work Schedules: What Are We Trading off To Get Them?
Golden, Lonnie
2001-01-01
Flexible work schedules have more than doubled since 1985, but workers sometimes must be willing to increase their hours, work evening shifts, or switch to part-time status, self-employment, or certain occupations to get flexibility. Flexibility was less likely for nonwhite, female, unmarried, and less-educated workers. (Contains 38 notes and…
It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management
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…
Approximating Preemptive Stochastic Scheduling
Megow Nicole; Vredeveld Tjark
2009-01-01
We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...
Non-standard work schedules, gender, and parental stress
Directory of Open Access Journals (Sweden)
Mariona Lozano
2016-02-01
Full Text Available Background: Working non-standard hours changes the temporal structure of family life, constraining the time that family members spend with one another and threatening individuals' well-being. However, the empirical research on the link between stress and non-standard schedules has provided mixed results. Some studies have indicated that working non-standard hours is harmful whereas others have suggested that working atypical hours might facilitate the balance between family and work. Moreover, there is some evidence that the association between stress and non-standard employment has different implications for men and women. Objective: This paper examines the association between non-standard work schedules and stress among dual-earner couples with children. Two research questions are addressed. First, do predictability of the schedule and time flexibility moderate the link between non-standard work hours and stress? Second, do non-standard schedules affect men's and women's perceptions of stress differently? Methods: We use a sample of 1,932 working parents from the Canadian 2010 General Social Survey, which includes a time-use diary. A sequential logit regression analysis stratified by gender is employed to model two types of result. First, we estimate the odds of being stressed versus not being stressed. Second, for all respondents feeling stressed, we estimate the odds of experiencing high levels versus moderate levels of stress. Results: Our analysis shows that the link between non-standard working hours and perceived stress differs between mothers and fathers. First, fathers with non-standard schedules appear more likely to experience stress than those working standard hours, although the results are not significant. Among mothers, having a non-standard schedule is associated with a significantly lower risk of experiencing stress. Second, the analysis focusing on the mediating role of flexibility and predictability indicates that
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.
Influences on cocaine tolerance assessed under a multiple conjunctive schedule of reinforcement.
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.
Berzano, D.; Blomer, J.; Buncic, P.; Charalampidis, I.; Ganis, G.; Meusel, R.
2015-12-01
During the last years, several Grid computing centres chose virtualization as a better way to manage diverse use cases with self-consistent environments on the same bare infrastructure. The maturity of control interfaces (such as OpenNebula and OpenStack) opened the possibility to easily change the amount of resources assigned to each use case by simply turning on and off virtual machines. Some of those private clouds use, in production, copies of the Virtual Analysis Facility, a fully virtualized and self-contained batch analysis cluster capable of expanding and shrinking automatically upon need: however, resources starvation occurs frequently as expansion has to compete with other virtual machines running long-living batch jobs. Such batch nodes cannot relinquish their resources in a timely fashion: the more jobs they run, the longer it takes to drain them and shut off, and making one-job virtual machines introduces a non-negligible virtualization overhead. By improving several components of the Virtual Analysis Facility we have realized an experimental “Docked” Analysis Facility for ALICE, which leverages containers instead of virtual machines for providing performance and security isolation. We will present the techniques we have used to address practical problems, such as software provisioning through CVMFS, as well as our considerations on the maturity of containers for High Performance Computing. As the abstraction layer is thinner, our Docked Analysis Facilities may feature a more fine-grained sizing, down to single-job node containers: we will show how this approach will positively impact automatic cluster resizing by deploying lightweight pilot containers instead of replacing central queue polls.
International Nuclear Information System (INIS)
1998-02-01
This volume contains information on cost estimates, planning schedules, yearly cost flowcharts, and life-cycle costs for the six options described in Volume 1, Section 2: Option 1 -- Total removal clean closure; No subsequent use; Option 2 -- Risk-based clean closure; LLW fill; Option 3 -- Risk-based clean closure; CERCLA fill; Option 4 -- Close to RCRA landfill standards; LLW fill; Option 5 -- Close to RCRA landfill standards; CERCLA fill; and Option 6 -- Close to RCRA landfill standards; Clean fill. This volume is divided into two portions. The first portion contains the cost and planning schedule estimates while the second portion contains life-cycle costs and yearly cash flow information for each option
The operational flight and multi-crew scheduling problem
Directory of Open Access Journals (Sweden)
Stojković Mirela
2005-01-01
Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.
Load scheduling for decentralized CHP plants
DEFF Research Database (Denmark)
Nielsen, Henrik Aalborg, orlov 31.07.2008; Madsen, Henrik; Nielsen, Torben Skov
) an interactive decision support tool by which optimal schedules can be found given the forecasts or user-defined modifications of the forecasts, and (iii) an automatic on-line system for monitoring when conditions have changed so that rescheduling is appropriate. In this report the focus is on methods applicable...... be obtained. Furthermore, we believe that all relevant forecasting methods are far too complicated to allow for this integration; both uncertainties originating from the dependence of heat load on climate and from meteorological forecasts need to be taken into account. Instead we suggest that the decision....... By letting the system find optimal schedules for each of these realizations the operator can gain some insight into the importance of the uncertainties. It is shown that with modern personal computers (e.g. 1 GHz Pentium III), operating systems (e.g. RedHat Linux 6.0), and compilers (e.g. GNU C 2...
International Nuclear Information System (INIS)
1995-01-01
This document provides a plan and schedule for leak testing a portion of the Liquid Low-Level Waste (LLLW) system at the Oak Ridge National Laboratory (ORNL), Oak Ridge, Tennessee. It is a concise version of a more general leak testing plan that was prepared in response to the requirements of the Federal Facility Agreement (FFA) for the Oak Ridge Reservation (ORR). This plan includes a schedule for the initial reporting of the leak test results from the various tanks that will be tested. The FFA distinguishes four categories of tank and pipeline systems: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems; there are 14 such tanks addressed in this plan, plus one tank (W-12) that has been temporarily returned to service based on EPA and TDEC concurrence. A schedule for testing these tanks is also included. The plan and schedule also addresses an additional 15 Category B tanks have been demonstrated to meet secondary containment requirements. While these 15 tanks are addressed in this plan for the sake of completeness, they have been removed from the leak testing program based on the design demonstrations that show secondary containment. It is noted that the general plan included 42 tanks. Since that report was issued, 26 of those tanks have passed secondary containment design demonstrations and subsequently have been removed from this leak testing plan. In addition, one tank (LA-104) has been removed from service. Accordingly, this document addresses 15 of the LLLW tanks in the system; plans for testing the pipelines will be described in a separate document
Energy Technology Data Exchange (ETDEWEB)
NONE
1995-01-01
This document provides a plan and schedule for leak testing a portion of the Liquid Low-Level Waste (LLLW) system at the Oak Ridge National Laboratory (ORNL), Oak Ridge, Tennessee. It is a concise version of a more general leak testing plan that was prepared in response to the requirements of the Federal Facility Agreement (FFA) for the Oak Ridge Reservation (ORR). This plan includes a schedule for the initial reporting of the leak test results from the various tanks that will be tested. The FFA distinguishes four categories of tank and pipeline systems: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems; there are 14 such tanks addressed in this plan, plus one tank (W-12) that has been temporarily returned to service based on EPA and TDEC concurrence. A schedule for testing these tanks is also included. The plan and schedule also addresses an additional 15 Category B tanks have been demonstrated to meet secondary containment requirements. While these 15 tanks are addressed in this plan for the sake of completeness, they have been removed from the leak testing program based on the design demonstrations that show secondary containment. It is noted that the general plan included 42 tanks. Since that report was issued, 26 of those tanks have passed secondary containment design demonstrations and subsequently have been removed from this leak testing plan. In addition, one tank (LA-104) has been removed from service. Accordingly, this document addresses 15 of the LLLW tanks in the system; plans for testing the pipelines will be described in a separate document.
Hanford Site Environmental Surveillance Master Sampling Schedule
International Nuclear Information System (INIS)
Bisping, L.E.
1999-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 methods are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL-91-50, Rev.2, U.S. Department of Energy, Richland, Washington. This document contains the CY1999 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section includes the sampling location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be collected in 1999 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing approximate sampling locations
Schedule-Aware Workflow Management Systems
Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.
Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.
Revisiting Symbiotic Job Scheduling
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...
Directory of Open Access Journals (Sweden)
Yi Tang
2017-11-01
Full Text Available The inherent variability and randomness of large-scale wind power integration have brought great challenges to power flow control and dispatch. The distributed power flow controller (DPFC has the higher flexibility and capacity in power flow control in the system with wind generation. This paper proposes a multi-time scale coordinated scheduling model with DPFC to minimize wind power spillage. Configuration of DPFCs is initially determined by stochastic method. Afterward, two sequential procedures containing day-head and real-time scales are applied for determining maximum schedulable wind sources, optimal outputs of generating units and operation setting of DPFCs. The generating plan is obtained initially in day-ahead scheduling stage and modified in real-time scheduling model, while considering the uncertainty of wind power and fast operation of DPFC. Numerical simulation results in IEEE-RTS79 system illustrate that wind power is maximum scheduled with the optimal deployment and operation of DPFC, which confirms the applicability and effectiveness of the proposed method.
International Nuclear Information System (INIS)
Blumer, P.J.; Price, K.R.; Eddy, P.A.; Carlile, J.M.V.
1984-12-01
This report provides the CY 1985 schedule of data collection for the routine Hanford Surface Environmental Monitoring and Ground-Water Monitoring Programs at the Hanford Site. The purpose is to evaluate and report the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5484.1. The routine sampling schedule provided herein does not include samples scheduled to be collected during FY 1985 in support of special studies, special contractor support programs, or for quality control purposes. In addition, the routine program outlined in this schedule is subject to modification during the year in response to changes in site operations, program requirements, or unusual sample results
Selective Flotation of Calcite from Fluorite: A Novel Reagent Schedule
Directory of Open Access Journals (Sweden)
Zhiyong Gao
2016-10-01
Full Text Available Fluorite is an important strategic mineral. In general, fluorite ores will contain a certain amount of calcite gangue mineral. Thus, they need to be separated from each other. For an economic separation, a reverse flotation process is used to float calcite gangue from fluorite. However, little information on the separation is available. In this study, a novel reagent schedule using citric acid (CA as the depressant, sodium fluoride (NaF as the regulator and sulfoleic acid (SOA as the collector, was developed to separate calcite from fluorite. The results demonstrated a high selectivity for the flotation of calcite from fluorite using this new reagent schedule. The best selective separation for a single mineral and mixed binary minerals was obtained when 200 mg/L of NaF, 50 mg/L of CA, and 6 mg/L of SOA were used at pH 9. In addition, a batch flotation experiment was carried out using a run-of-mine feed material. Selective separation was achieved with 85.18% calcite removal while only 11.2% of fluorite was lost. An attempt was made to understand the effect of the new reagent schedule on the flotation of calcite. The results from both microflotation and bench scale flotation demonstrated a great potential for industrial application using this novel reagent schedule to upgrade fluorite ore.
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.
A master surgical scheduling approach for cyclic scheduling in operating room departments
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
IRRIGATION SCHEDULING CALCULATOR (ISC TO IMPROVE WATER MANAGEMENT ON FIELD LEVEL IN EGYPT
Directory of Open Access Journals (Sweden)
Samiha Abou El-Fetouh Hamed Ouda
2017-10-01
Full Text Available The developed model is MS excel sheet called “Irrigation Scheduling Calculator, ISC”. The model requires to input daily weather data to calculate daily evapotranspiration using Penman-Monteith equation. The model calculates water depletion from the root zone to determine when to irrigate and how much water should be applied. The charge from irrigation pump is used to calculate how many hours should the farmer run the pump to deliver the needed amount of water. ISC model was used to developed irrigation schedule for wheat and maize planted in El-Gharbia governorate. The developed schedules were compared to the actual schedules for both crops. Furthermore, CropSyst model was calibrated for both crops and run using the developed schedules by ISC model. The simulation results indicated that the calculated irrigation amount by ISC model for wheat was lower than actual schedule by 6.0 mm. Furthermore, the simulated wheat productivity by CropSyst was higher than measured grain and biological by 2%. Similarly, the calculated applied irrigation amount by ISC model for maize was lower than actual schedule by 79.0 mm and the productivity was not changed.
Immunization Schedules for Adults
... 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
... 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 ...
Concurrent variable-interval variable-ratio schedules in a dynamic choice environment.
Bell, Matthew C; Baum, William M
2017-11-01
Most studies of operant choice have focused on presenting subjects with a fixed pair of schedules across many experimental sessions. Using these methods, studies of concurrent variable- interval variable-ratio schedules helped to evaluate theories of choice. More recently, a growing literature has focused on dynamic choice behavior. Those dynamic choice studies have analyzed behavior on a number of different time scales using concurrent variable-interval schedules. Following the dynamic choice approach, the present experiment examined performance on concurrent variable-interval variable-ratio schedules in a rapidly changing environment. Our objectives were to compare performance on concurrent variable-interval variable-ratio schedules with extant data on concurrent variable-interval variable-interval schedules using a dynamic choice procedure and to extend earlier work on concurrent variable-interval variable-ratio schedules. We analyzed performances at different time scales, finding strong similarities between concurrent variable-interval variable-interval and concurrent variable-interval variable- ratio performance within dynamic choice procedures. Time-based measures revealed almost identical performance in the two procedures compared with response-based measures, supporting the view that choice is best understood as time allocation. Performance at the smaller time scale of visits accorded with the tendency seen in earlier research toward developing a pattern of strong preference for and long visits to the richer alternative paired with brief "samples" at the leaner alternative ("fix and sample"). © 2017 Society for the Experimental Analysis of Behavior.
BIM-BASED SCHEDULING OF CONSTRUCTION
DEFF Research Database (Denmark)
Andersson, Niclas; Büchmann-Slorup, Rolf
2010-01-01
The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...
Directory of Open Access Journals (Sweden)
Selma Becherirat
2018-04-01
Full Text Available Antiangiogenics administration in colorectal cancer patients seemed promising therapeutic approach. Inspite of early encouraging results, it however gave only modest clinical benefits. When AAG was administered with discontinuous schedule, the disease showed acceleration in certain cases. Though resistance to AAG has been extensively studied, it is not documented for discontinuous schedules. To simulate clinical situations, we subjected a patient-derived CRC subcutaneous xenograft in mice to three different protocols: 1 AAG (bevacizumab treatment for 30 days (group A (group B was the control, 2 bevacizumab treatment for 50 days (group C and bevacizumab for 30 days and 20 without treatment (group D, and 3 bevacizumab treatment for 70 days (group E and 70 days treatment with a drug-break period between day 30 and 50 (group F. The tumor growth was monitored, and at sacrifice, the vascularity of tumors was measured and the proangiogenic factors quantified. Tumor phenotype was studied by quantifying cancer stem cells. Interrupting bevacizumab during treatment accelerated tumor growth and revascularization. A significant increase of proangiogenic factors was observed when therapy was stopped. On withdrawal of bevacizumab, as also after the drug-break period, the plasmatic VEGF increased significantly. Similarly, a notable increase of CSCs after the withdrawal and drug-break period of bevacizumab was observed (P<.01. The present study indicates that bevacizumab treatment needs to be maintained because discontinuous schedules tend to trigger tumor regrowth, and increase tumor resistance and CSC heterogeneity.
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
Designing a prototype of the ITER pulse scheduling system
International Nuclear Information System (INIS)
Yamamoto, T.; Yonekawa, I.; Ohta, K.; Hosoyama, H.; Hashimoto, Y.; Wallander, A.; Winter, A.; Sugie, T.; Kusama, Y.; Kawano, Y.; Yoshino, R.
2012-01-01
Highlights: ► We designed a prototype of the ITER pulse scheduling system. ► Structure of ITER pulse schedules was designed. ► Validation and automatic value assignment functions were adopted. ► A prototype will be implemented in 2011. - Abstract: A prototype of the ITER pulse scheduling system that prepares and manages parameters for ITER plasma operations has been designed. Based on the analyzed requirements on the system, structure of the parameters and necessary functions were determined. Segment and module structures were tuned to the ITER requirements. Three types of validations assure sanity of the parameters. The design limits check and the operation window check verify whether the values of the parameters do not exceed the limits. The consistency check calculates dependency among parameters in accordance with logics described in a scripting language. The ITER pulse scheduling system provides interface with a physics model and simulator. Some abstract physics parameters are converted to engineering parameters with the physics simulation. The results of simulation such as plasma characteristics of specified parameters are also shown to the researchers. The tool to specify the parameters is data-driven. Therefore, it is flexible for changes of number of the parameters. A prototype is being implemented in 2011. Using the prototype, this design will be verified and refined. The evaluation of the prototype will be a basis of the final production of the ITER pulse scheduling system.
Parents' Family Time and Work Schedules: The Split-Shift Schedule in Spain
Gracia, P.; Kalmijn, M.
2016-01-01
This study used data on couples from the 2003 Spanish Time Use Survey (N = 1,416) to analyze how work schedules are associated with family, couple, parent–child, and non-family leisure activities. Spain is clearly an interesting case for the institutionalized split-shift schedule, a long lunch break
Energy Technology Data Exchange (ETDEWEB)
Morales Fusco, P.; Pedrielli, G.; Zhou, C.; Hay Lee, L.; Peng Chew, E.
2016-07-01
In most large port cities, the challenge of inter-terminal transfers (ITT) prevails due to the long distance between multiple terminals. The quantity of containers requiring movement between terminals as they connect from pre-carrier to on-carrier is increasing with the formation of the mega-alliances. The paper proposes a continuous time mathematical programming model to optimize the deployment and schedule of trucks and barges to minimize the number of operating transporters, their makespan, costs and the distance travelled by the containers by choosing the right combination of transporters and container movements while fulfilling time window restrictions imposed on reception of the containers. A multi-step routing problem is developed where transporters can travel from one terminal to another and/or load or unload containers from a specific batch at each step. The model proves successful in identifying the costless schedule and means of transportation. And a sensibility analysis over the parameters used is provided. (Author)
Scheduled Operation of PV Power Station Considering Solar Radiation Forecast Error
Takayama, Satoshi; Hara, Ryoichi; Kita, Hiroyuki; Ito, Takamitsu; Ueda, Yoshinobu; Saito, Yutaka; Takitani, Katsuyuki; Yamaguchi, Koji
Massive penetration of photovoltaic generation (PV) power stations may cause some serious impacts on a power system operation due to their volatile and unpredictable output. Growth of uncertainty may require larger operating reserve capacity and regulating capacity. Therefore, in order to utilize a PV power station as an alternative for an existing power plant, improvement in controllability and adjustability of station output become very important factor. Purpose of this paper is to develop the scheduled operation technique using a battery system (NAS battery) and the meteorological forecast. The performance of scheduled operation strongly depends on the accuracy of solar radiation forecast. However, the solar radiation forecast contains error. This paper proposes scheduling method and rescheduling method considering the trend of forecast error. More specifically, the forecast error scenario is modeled by means of the clustering analysis of the past actual forecast error. Validity and effectiveness of the proposed method is ascertained through computational simulations using the actual PV generation data monitored at the Wakkanai PV power station and solar radiation forecast data provided by the Japan Weather Association.
Medications for Sleep Schedule Adjustments in Athletes.
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.
Analyzing scheduling in the food-processing industry
DEFF Research Database (Denmark)
Akkerman, Renzo; van Donk, Dirk Pieter
2009-01-01
Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry......-specific characteristics induce specific and complex scheduling problems. Based on ideas about decomposition of the scheduling task and the production process, we develop an analysis methodology for scheduling problems in food processing. This combines an analysis of structural (technological) elements of the production...... process with an analysis of the tasks of the scheduler. This helps to understand, describe, and structure scheduling problems in food processing, and forms a basis for improving scheduling and applying methods developed in literature. It also helps in evaluating the organisational structures...
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.
Directory of Open Access Journals (Sweden)
Qiao Wei
2017-01-01
Full Text Available Deep neural networks (DNNs have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling data-parallel computation jobs like DNN over containerized clusters is critical for job performance, system throughput, and resource utilization. It becomes even more challenging with the complex workloads. We propose a scheduling method called Deep Learning Task Allocation Priority (DLTAP which performs scheduling decisions in a distributed manner, and each of scheduling decisions takes aggregation degree of parameter sever task and worker task into account, in particularly, to reduce cross-node network transmission traffic and, correspondingly, decrease the DNN training time. We evaluate the DLTAP scheduling method using a state-of-the-art distributed DNN training framework on 3 benchmarks. The results show that the proposed method can averagely reduce 12% cross-node network traffic, and decrease the DNN training time even with the cluster of low-end servers.
Future aircraft networks and schedules
Shu, Yan
2011-07-01
Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents
Logan, J. R.; Pulvermacher, M. K.
1991-01-01
Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.
Immunization Schedules for Infants and Children
... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Infants and Children (Birth through 6 ... any questions please talk to your doctor. 2018 Immunization Schedule Recommended Vaccinations for Infants and Children Schedule ...
Gain Scheduling of Observer-Based Controllers with Integral Action
DEFF Research Database (Denmark)
Trangbæk, Klaus; Stoustrup, Jakob; Bendtsen, Jan Dimon
2006-01-01
This paper presents a method for continuous gain scheduling of observer-based controllers with integral action. Given two stabilising controllers for a given system, explicit state space formulae are presented, allowing to change gradually from one controller to the other while preserving...
National Research Council Canada - National Science Library
Swaminathan, Vishnu; Chakrabarty, Krishnendu
2005-01-01
We investigate the effect of voltage-switching on task execution times and energy consumption for dual-speed hard real-time systems, and present a new approach for scheduling workloads containing periodic tasks...
Using Optimization Models for Scheduling in Enterprise Resource Planning Systems
Directory of Open Access Journals (Sweden)
Frank Herrmann
2016-03-01
Full Text Available Companies often use specially-designed production systems and change them from time to time. They produce small batches in order to satisfy specific demands with the least tardiness. This imposes high demands on high-performance scheduling algorithms which can be rapidly adapted to changes in the production system. As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System (in the SAP system for example or can be connected to it. In a real-world application of a flow shop with special restrictions this approach is successfully used on a standard personal computer. Thus, the main implication is that optimal scheduling with a commercially-available tool, incorporated in an Enterprise Resource Planning System, may be the best approach.
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
Directory of Open Access Journals (Sweden)
Denis Pinha
2016-11-01
Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.
A Formal Product-Line Engineering Approach for Schedulers
Orhan, Güner; Aksit, Mehmet; Rensink, Arend; Jololian, Leon; Robbins, David E.; Fernandes, Steven L.
2017-01-01
Scheduling techniques have been applied to a large category of software systems, such as, processor scheduling in operating systems, car scheduling in elevator systems, facility scheduling at airports, antenna scheduling in radar systems, scheduling of events, control signals and data in
International Nuclear Information System (INIS)
Choi, Chang Woong; Lee, Tae Joon; Kim, Joon Yun; Cho, Yun Ho; Hah, Jong Hyun
1993-07-01
This report was to development the computerized schedule and progress control system for the master schedule of KMRR project with ARTEMIS 7000/386 CM (Ver. 7.4.2.) based on project management theory (PERT/CPM, PDM, and S-curve). This system has been efficiently used for KMRR master schedule and will be utilized for the detail scheduling of KMRR project. (Author) 23 refs., 26 figs., 52 tabs
Energy Technology Data Exchange (ETDEWEB)
Choi, Chang Woong; Lee, Tae Joon; Kim, Joon Yun; Cho, Yun Ho; Hah, Jong Hyun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1993-07-01
This report was to development the computerized schedule and progress control system for the master schedule of KMRR project with ARTEMIS 7000/386 CM (Ver. 7.4.2.) based on project management theory (PERT/CPM, PDM, and S-curve). This system has been efficiently used for KMRR master schedule and will be utilized for the detail scheduling of KMRR project. (Author) 23 refs., 26 figs., 52 tabs.
Remote container monitoring and surveillance systems
International Nuclear Information System (INIS)
Resnik, W.M.; Kadner, S.P.
1995-01-01
Aquila Technologies Group is developing a monitoring and surveillance system to monitor containers of nuclear materials. The system will both visually and physically monitor the containers. The system is based on the combination of Aquila's Gemini All-Digital Surveillance System and on Aquila's AssetLAN trademark asset tracking technology. This paper discusses the Gemini Digital Surveillance system as well as AssetLAN technology. The Gemini architecture with emphasis on anti-tamper security features is also described. The importance of all-digital surveillance versus other surveillance methods is also discussed. AssetLAN trademark technology is described, emphasizing the ability to continually track containers (as assets) by location utilizing touch memory technology. Touch memory technology provides unique container identification, as well as the ability to store and retrieve digital information on the container. This information may relate to container maintenance, inspection schedules, and other information. Finally, this paper describes the combination of the Gemini system with AssetLAN technology, yielding a self contained, container monitoring and area/container surveillance system. Secure container fixture design considerations are discussed. Basic surveillance review functions are also discussed
78 FR 21818 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I
2013-04-12
..., methamphetamine, and MDMA, Schedule I and II substances. These effects included elevated body temperature... of reuptake of monoamines, and in vivo studies (microdialysis, locomotor activity, body temperature.... Yet another commenter claimed that Schedule I placement would ``cripple efforts at learning,'' make it...
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance
Rustogi, Kabir; Strusevich, Vitaly A.
2015-01-01
We study single machine scheduling problems with linear time-dependent deterioration effects and maintenance activities. Maintenance periods (MPs) are included into the schedule, so that the machine, that gets worse during the processing, can be restored to a better state. We deal with a job-independent version of the deterioration effects, that is, all jobs share a common deterioration rate. However, we introduce a novel extension to such models and allow the deterioration rates to change af...
Tramp Ship Routing and Scheduling - Incorporating Additional Complexities
DEFF Research Database (Denmark)
Vilhelmsen, Charlotte
to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. This thesis therefore aims at developing new mathematical models and solution methods...... for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...
Decentralized Ground Staff Scheduling
DEFF Research Database (Denmark)
Sørensen, M. D.; Clausen, Jens
2002-01-01
scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...... depends on the actual stand allocation but also on the number of zones and the layout of these. A mathematical model of the problem is proposed, which integrates the stand allocation and the staff scheduling. A heuristic solution method is developed and applied on a real case from British Airways, London...
Schedule control in Ling Ao nuclear power project
International Nuclear Information System (INIS)
Xie Ahai
2007-01-01
Ling Ao Nuclear Power Station (LANP) is first one built up by self-reliance in China with power capacity 990x2 MWe. The results of quality control, schedule control and cost control are satisfactory. The commercial operation days of Unit 1 and Unit 2 were 28th May 2002 and 8th Jan. 2003 respectively, which were 48 days and 66 days in advance of the project schedule. This paper presents the practices of self-reliance schedule control system in LANP. The paper includes 10 sections: schedule control system; targets of schedule control; schedule control at early stage of project; construction schedule; scheduling practice; Point curves; schedule control of design and procurement; a good practice of construction schedule control on site; commissioning and startup schedule; schedule control culture. Three figures are attached. The main contents of the self-reliance schedule control system are as follows: to draw up reasonable schedules and targets; to setup management mechanism and procedures; to organize powerful project management team; to establish close monitoring system; to provide timely progress reports and statistics information. Five kinds of schedule control targets are introduced, i.e. bar-chart schedule; milesones; Point curves; interface management; hydraulic test schedule of auxiliary piping loops; EMR/EMC/EESR issuance schedules. Six levels of bar-chart schedules were adopted in LANP, but the bar-chart schedules were not satisfactory for complicated erection condition on site, even using six levels of schedules. So a kind of Point curves was developed and their advantages are explained. Scheduling method of three elements: activity, duration, logic, which was adopted in LANP, is introduced. The duration of each piping activities in LANP level 2 project schedule was calculated based on the relevant working Point quantities. The analysis and adjustment of Point curves are illustrated, i.e. balance of monthly quantities; possible production in the peakload
Multiuser switched diversity scheduling schemes
Shaqfeh, Mohammad; Alnuweiri, Hussein M.; Alouini, Mohamed-Slim
2012-01-01
Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.
Multiuser switched diversity scheduling schemes
Shaqfeh, Mohammad
2012-09-01
Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.
DEFF Research Database (Denmark)
Hansen, Anders Dohn; Clausen, Jens
This paper presents the Steel Plate Storage Yard Crane Scheduling Problem. The task is to generate a schedule for two gantry cranes sharing tracks. The schedule must comply with a number of constraints and at the same time be cost efficient. We propose some ideas for a two stage planning...
Scheduling algorithms for automatic control systems for technological processes
Chernigovskiy, A. S.; Tsarev, R. Yu; Kapulin, D. V.
2017-01-01
Wide use of automatic process control systems and the usage of high-performance systems containing a number of computers (processors) give opportunities for creation of high-quality and fast production that increases competitiveness of an enterprise. Exact and fast calculations, control computation, and processing of the big data arrays - all of this requires the high level of productivity and, at the same time, minimum time of data handling and result receiving. In order to reach the best time, it is necessary not only to use computing resources optimally, but also to design and develop the software so that time gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine/multiprocessor systems are applied. Some of basic task scheduling methods for the multi-machine process control systems are considered in this paper, their advantages and disadvantages come to light, and also some usage considerations, in case of the software for automatic process control systems developing, are made.
Robinson, Candice L; Romero, José R; Kempe, Allison; Pellegrini, Cynthia; Szilagyi, Peter
2018-02-09
In October 2017, the Advisory Committee on Immunization Practices (ACIP) approved the Recommended Immunization Schedule for Children and Adolescents Aged 18 Years or Younger - United States, 2018. The 2018 child and adolescent immunization schedule summarizes ACIP recommendations, including several changes from the 2017 immunization schedules, in three figures and footnotes to the figures. These documents can be found on the CDC immunization schedule website (https://www.cdc.gov/vaccines/schedules/index.html). These immunization schedules are approved by ACIP (https://www.cdc.gov/vaccines/acip/index.html), the American Academy of Pediatrics (https://www.aap.org), the American Academy of Family Physicians (https://www.aafp.org), and the American College of Obstetricians and Gynecologists (https://www.acog.org). Health care providers are advised to use the figures and the footnotes together. The full ACIP recommendations for each vaccine, including contraindications and precautions, can be found at https://www.cdc.gov/vaccines/hcp/acip-recs/index.html. Providers should be aware that changes in recommendations for specific vaccines can occur between annual updates to the childhood/adolescent immunization schedules. If errors or omissions are discovered within the child and adolescent schedule, CDC posts revised versions on the CDC immunization schedule website.
The triangle scheduling problem
Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard
2017-01-01
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to
A System for Automatically Generating Scheduling Heuristics
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.
Seol, Ye-In; Kim, Young-Kuk
2014-01-01
Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.
Resource allocation in IT projects: using schedule optimization
Directory of Open Access Journals (Sweden)
Michael Chilton
2014-01-01
Full Text Available Resource allocation is the process of assigning resources to tasks throughout the life of a project. Despite sophisticated software packages devoted to keeping track of tasks, resources and resource assignments, it is often the case that project managers find some resources over-allocated and therefore unable to complete the assigned work in the allotted amount of time. Most scheduling software has provisions for leveling resources, but the techniques for doing so simply add time to the schedule and may cause delays in tasks that are critical to the project in meeting deadlines. This paper presents a software application that ensures that resources are properly balanced at the beginning of the project and eliminates the situation in which resources become over-allocated. It can be used in a multi-project environment and reused throughout the project as tasks, resource assignments and availability, and the project scope change. The application utilizes the bounded enumeration technique to formulate an optimal schedule for which both the task sequence and resource availability are taken into account. It is run on a database server to reduce the running time and make it a viable application for practitioners.
Optimal load scheduling in commercial and residential microgrids
Ganji Tanha, Mohammad Mahdi
Residential and commercial electricity customers use more than two third of the total energy consumed in the United States, representing a significant resource of demand response. Price-based demand response, which is in response to changes in electricity prices, represents the adjustments in load through optimal load scheduling (OLS). In this study, an efficient model for OLS is developed for residential and commercial microgrids which include aggregated loads in single-units and communal loads. Single unit loads which include fixed, adjustable and shiftable loads are controllable by the unit occupants. Communal loads which include pool pumps, elevators and central heating/cooling systems are shared among the units. In order to optimally schedule residential and commercial loads, a community-based optimal load scheduling (CBOLS) is proposed in this thesis. The CBOLS schedule considers hourly market prices, occupants' comfort level, and microgrid operation constraints. The CBOLS' objective in residential and commercial microgrids is the constrained minimization of the total cost of supplying the aggregator load, defined as the microgrid load minus the microgrid generation. This problem is represented by a large-scale mixed-integer optimization for supplying single-unit and communal loads. The Lagrangian relaxation methodology is used to relax the linking communal load constraint and decompose the independent single-unit functions into subproblems which can be solved in parallel. The optimal solution is acceptable if the aggregator load limit and the duality gap are within the bounds. If any of the proposed criteria is not satisfied, the Lagrangian multiplier will be updated and a new optimal load schedule will be regenerated until both constraints are satisfied. The proposed method is applied to several case studies and the results are presented for the Galvin Center load on the 16th floor of the IIT Tower in Chicago.
Artificial intelligence approaches to astronomical observation scheduling
Johnston, Mark D.; Miller, Glenn
1988-01-01
Automated scheduling will play an increasing role in future ground- and space-based observatory operations. Due to the complexity of the problem, artificial intelligence technology currently offers the greatest potential for the development of scheduling tools with sufficient power and flexibility to handle realistic scheduling situations. Summarized here are the main features of the observatory scheduling problem, how artificial intelligence (AI) techniques can be applied, and recent progress in AI scheduling for Hubble Space Telescope.
Okun, Michael S; Foote, Kelly D; Wu, Samuel S; Ward, Herbert E; Bowers, Dawn; Rodriguez, Ramon L; Malaty, Irene A; Goodman, Wayne K; Gilbert, Donald M; Walker, Harrison C; Mink, Jonathan W; Merritt, Stacy; Morishita, Takashi; Sanchez, Justin C
2013-01-01
To collect the information necessary to design the methods and outcome variables for a larger trial of scheduled deep brain stimulation (DBS) for Tourette syndrome. We performed a small National Institutes of Health-sponsored clinical trials planning study of the safety and preliminary efficacy of implanted DBS in the bilateral centromedian thalamic region. The study used a cranially contained constant-current device and a scheduled, rather than the classic continuous, DBS paradigm. Baseline vs 6-month outcomes were collected and analyzed. In addition, we compared acute scheduled vs acute continuous vs off DBS. A university movement disorders center. Five patients with implanted DBS. A 50% improvement in the Yale Global Tic Severity Scale (YGTSS) total score. RESULTS Participating subjects had a mean age of 34.4 (range, 28-39) years and a mean disease duration of 28.8 years. No significant adverse events or hardware-related issues occurred. Baseline vs 6-month data revealed that reductions in the YGTSS total score did not achieve the prestudy criterion of a 50% improvement in the YGTSS total score on scheduled stimulation settings. However, statistically significant improvements were observed in the YGTSS total score (mean [SD] change, -17.8 [9.4]; P=.01), impairment score (-11.3 [5.0]; P=.007), and motor score (-2.8 [2.2]; P=.045); the Modified Rush Tic Rating Scale Score total score (-5.8 [2.9]; P=.01); and the phonic tic severity score (-2.2 [2.6]; P=.04). Continuous, off, and scheduled stimulation conditions were assessed blindly in an acute experiment at 6 months after implantation. The scores in all 3 conditions showed a trend for improvement. Trends for improvement also occurred with continuous and scheduled conditions performing better than the off condition. Tic suppression was commonly seen at ventral (deep) contacts, and programming settings resulting in tic suppression were commonly associated with a subjective feeling of calmness. This study provides
Planning and scheduling - A schedule's performance
International Nuclear Information System (INIS)
Whitman, N.M.
1993-01-01
Planning and scheduling is a process whose time has come to PSI Energy. With an awareness of the challenges ahead, individuals must look for ways to enhance the corporate competitiveness. Working toward this goal means that each individual has to dedicate themselves to this more competitive corporate environment. Being competitive may be defined as the ability of each employee to add value to the corporation's economic well being. The timely and successful implementation of projects greatly enhances competitiveness. Those projects that do not do well often suffer from lack of proper execution - not for lack of talent or strategic vision. Projects are consumers of resources such as cash and people. They produce a return when completed and will generate a better return when properly completed utilizing proven project management techniques. Completing projects on time, within budget and meeting customer expectations is the way a corporation builds it's future. This paper offers suggestions on implementing planning and scheduling and provides a review of results in the form of management reports
Alternative Work Schedules: Definitions
Journal of the College and University Personnel Association, 1977
1977-01-01
The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…
Gender Inequity in Education and Employment in the Scheduled Castes and Tribes of India.
Dunn, Dana
1993-01-01
Using ethnographic and statistical data, this paper presents a descriptive profile of scheduled caste and tribe women's status in Indian society. Findings indicate that relative to men, women in these groups have far more limited access to both educational and employment resources. (Contains 73 references.) (MDH)
Planning and Scheduling of Airline Operations
Directory of Open Access Journals (Sweden)
İlkay ORHAN
2010-02-01
Full Text Available The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: flight scheduling, aircraft scheduling, crew scheduling and disruptions management. These aforementioned scheduling and planning problems faced by all airline companies in the airline sector were examined in detail. Studies reveal that companies using the advanced methods might gain significant cost reductions. However, even then, the time required for solving large scale problems may not satisfy the decision quality desired by decision makers. In such cases, using modern decision methods integrated with advanced technologies offer companies an opportunity for significant cost-advantages.
Development of Watch Schedule Using Rules Approach
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.
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.
Technology for planning and scheduling under complex constraints
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.
Jaap, John; Muery, Kim
2000-01-01
Scheduling engines are found at the core of software systems that plan and schedule activities and resources. A Request-Oriented Scheduling Engine (ROSE) is one that processes a single request (adding a task to a timeline) and then waits for another request. For the International Space Station, a robust ROSE-based system would support multiple, simultaneous users, each formulating requests (defining scheduling requirements), submitting these requests via the internet to a single scheduling engine operating on a single timeline, and immediately viewing the resulting timeline. ROSE is significantly different from the engine currently used to schedule Space Station operations. The current engine supports essentially one person at a time, with a pre-defined set of requirements from many payloads, working in either a "batch" scheduling mode or an interactive/manual scheduling mode. A planning and scheduling process that takes advantage of the features of ROSE could produce greater customer satisfaction at reduced cost and reduced flow time. This paper describes a possible ROSE-based scheduling process and identifies the additional software component required to support it. Resulting changes to the management and control of the process are also discussed.
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.
NRC comprehensive records disposition schedule
International Nuclear Information System (INIS)
1983-05-01
Effective January 1, 1982, NRC will institute records retention and disposal practives in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 24 which apply to housekeeping or facilitative records. NRCS-I applies to records common to all or most NRC offices; NRCS-II applies to program records as found in the various offices of the Commission, Atomic Safety and Licensing Board Panel, and the Atomic Safety and Licensing Appeal Panel; NRCS-III applies to records accumulated by the Advisory Committee on Reactor Safeguards; and NRCS-IV applies to records accumulated in the various NRC offices under the Executive Director for Operations. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability
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.
Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments
Directory of Open Access Journals (Sweden)
Kairong Duan
2018-05-01
Full Text Available Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs. When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA. We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time.
CMS multicore scheduling strategy
International Nuclear Information System (INIS)
Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison
2014-01-01
In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.
76 FR 39159 - Schedule for Rating Disabilities; The Digestive System
2011-07-05
... of this change is to incorporate medical advances that have occurred since the last review, insert current medical terminology, and provide clear criteria. DATES: Comments must be received by VA on or... the rating schedule, and implement current medical criteria and terminology that reflect recent...
Scheduling lessons learned from the Autonomous Power System
Ringer, Mark J.
1992-01-01
The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.
Golias, Mihalis M.
2011-01-01
Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
DEFF Research Database (Denmark)
Pop, Traian; Pop, Paul; Eles, Petru
2005-01-01
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organized in a hierarchy. In this paper, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems....... Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example....
Sport Tournament Automated Scheduling System
Raof R. A. A; Sudin S.; Mahrom N.; Rosli A. N. C
2018-01-01
The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calc...
40 CFR 141.702 - Sampling schedules.
2010-07-01
... serving at least 10,000 people must submit their sampling schedule for the initial round of source water... submitting the sampling schedule that EPA approves. (3) Systems serving fewer than 10,000 people must submit... analytical result for a scheduled sampling date due to equipment failure, loss of or damage to the sample...
2012-11-30
... applications for Federal tax incentives contained in Section 47 of the Internal Revenue Code (referred to... through the NPS's Web site at http://www.nps.gov/tps/tax-incentives.htm . The new fee schedule applies... preservation tax certification, and such funds shall be available until expended without further appropriation...
Singh, Mendi P S S; Gupta, Rasik B; Yadav, Rajiv; Sharma, Ravendra K; Shanmugam, Rajasubramaniam
2016-08-01
This study was carried out to ascertain the allelic frequency of α(+)-thalassemia (α(+)-thal) in Scheduled caste and scheduled tribe populations of the Damoh district of Madhya Pradesh, India. Random blood samples of Scheduled tribe (267) and Scheduled caste (168), considering the family as a sampling unit, were analyzed for the presence of the -α(3.7) (rightward) (NG_000006.1: g.34164_37967del3804) and -α(4.2) (leftward) (AF221717) deletions. α(+)-Thal was significantly higher in the Scheduled tribals (77.9%) as compared to the scheduled caste population (9.0%). About 58.0% scheduled tribals carried at least one chromosome with the -α(3.7) deletion and 20.0% scheduled tribals carried the -α(4.2) deletion. Frequency for the -α(3.7) allele was 0.487 in the scheduled tribal populations in comparison to 0.021 in scheduled castes. Allelic frequency for -α(4.2) was 0.103 and 0.024, respectively, in the above communities. No Hardy-Weinberg equilibrium for α-thal gene (p population, indicating the presence of selection pressures in favor of α-thal mutation and adaptation.
Routine environmental monitoring schedule, calendar year 1995
International Nuclear Information System (INIS)
Schmidt, J.W.; Markes, B.M.; McKinney, S.M.
1994-12-01
This document provides Bechtel Hanford, Inc. (BHI) and Westinghouse Hanford Company (WHC) a schedule of monitoring and sampling routines for the Operational Environmental Monitoring (OEM) program during calendar year (CY) 1995. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near-Field Monitoring and may depend on the site history, radiological status, use and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1995
The effect of dynamic scheduling and routing in a solid waste management system
International Nuclear Information System (INIS)
Johansson, Ola M.
2006-01-01
Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From the study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators
Capriotti, Matthew R; Turkel, Jennifer E; Johnson, Rachel A; Espil, Flint M; Woods, Douglas W
2017-01-01
Chronic tic disorders (CTDs) involve motor and/or vocal tics that often cause substantial distress and impairment. Differential reinforcement of other behavior (DRO) schedules of reinforcement produce robust, but incomplete, reductions in tic frequency in youth with CTDs; however, a more robust reduction may be needed to affect durable clinical change. Standard, fixed-amount DRO schedules have not commonly yielded such reductions, so we evaluated a novel, progressive-amount DRO schedule, based on its ability to facilitate sustained abstinence from functionally similar behaviors. Five youth with CTDs were exposed to periods of baseline, fixed-amount DRO (DRO-F), and progressive-amount DRO (DRO-P). Both DRO schedules produced decreases in tic rate and increases in intertic interval duration, but no systematic differences were seen between the two schedules on any dimension of tic occurrence. The DRO-F schedule was generally preferred to the DRO-P schedule. Possible procedural improvements and other future directions are discussed. © 2016 Society for the Experimental Analysis of Behavior.
Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2005
Energy Technology Data Exchange (ETDEWEB)
Bisping, Lynn E.
2005-01-19
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. This document contains the calendar year 2005 schedules for the routine and non-routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project.
Combinations of response-reinforcer relations in periodic and aperiodic schedules.
Kuroda, Toshikazu; Cançado, Carlos R X; Lattal, Kennon A; Elcoro, Mirari; Dickson, Chata A; Cook, James E
2013-03-01
Key pecking of 4 pigeons was studied under a two-component multiple schedule in which food deliveries were arranged according to a fixed and a variable interfood interval. The percentage of response-dependent food in each component was varied, first in ascending (0, 10, 30, 70 and 100%) and then in descending orders, in successive conditions. The change in response rates was positively related to the percentage of response-dependent food in each schedule component. Across conditions, positively accelerated and linear patterns of responding occurred consistently in the fixed and variable components, respectively. These results suggest that the response-food dependency determines response rates in periodic and aperiodic schedules, and that the temporal distribution of food determines response patterns independently of the response-food dependency. Running rates, but not postfood pauses, also were positively related to the percentage of dependent food in each condition, in both fixed and variable components. Thus, the relation between overall response rate and the percentage of dependent food was mediated by responding that occurred after postfood pausing. The findings together extend previous studies wherein the dependency was either always present or absent, and increase the generality of the effects of variations in the response-food dependency from aperiodic to periodic schedules. © Society for the Experimental Analysis of Behavior.
Directory of Open Access Journals (Sweden)
Will Lunniss
2014-04-01
Full Text Available In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP and earliest deadline first (EDF. While they have been studied in great detail before, they have not been compared when taking into account cache related pre-emption delays (CRPD. Memory and cache are split into a number of blocks containing instructions and data. During a pre-emption, cache blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicted blocks, CRPD are introduced which then affect the schedulability of the task. In this paper we compare FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis. We find that when CRPD is accounted for, the performance gains offered by EDF over FP, while still notable, are diminished. Furthermore, we find that under scenarios that cause relatively high CRPD, task layout optimisation techniques can be applied to allow FP to schedule tasksets at a similar processor utilisation to EDF. Thus making the choice of the task layout in memory as important as the choice of scheduling algorithm. This is very relevant for industry, as it is much cheaper and simpler to adjust the task layout through the linker than it is to switch the scheduling algorithm.
Interactive Dynamic Mission Scheduling for ASCA
Antunes, A.; Nagase, F.; Isobe, T.
The Japanese X-ray astronomy satellite ASCA (Advanced Satellite for Cosmology and Astrophysics) mission requires scheduling for each 6-month observation phase, further broken down into weekly schedules at a few minutes resolution. Two tools, SPIKE and NEEDLE, written in Lisp and C, use artificial intelligence (AI) techniques combined with a graphic user interface for fast creation and alteration of mission schedules. These programs consider viewing and satellite attitude constraints as well as observer-requested criteria and present an optimized set of solutions for review by the planner. Six-month schedules at 1 day resolution are created for an oversubscribed set of targets by the SPIKE software, originally written for HST and presently being adapted for EUVE, XTE and AXAF. The NEEDLE code creates weekly schedules at 1 min resolution using in-house orbital routines and creates output for processing by the command generation software. Schedule creation on both the long- and short-term scale is rapid, less than 1 day for long-term, and one hour for short-term.
Comparison of Different Approaches to the Cutting Plan Scheduling
Directory of Open Access Journals (Sweden)
Peter Bober
2011-10-01
Full Text Available Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial optimization problem. In this respect, various approaches and methods are used to arrive to a viable solution. The paper reports three approaches represented by three discreet optimization methods. The first one is back-tracing algorithm and serves as a reference to verify functionality of the other two ones. The second method is optimization using genetic algorithms, and the third one presents heuristic approach to optimization based on anticipated properties of an optimal solution. Research results indicate that genetic algorithms are demanding to calculate though not dependant on the selected objective function. Heuristic algorithm is fast but dependant upon anticipated properties of the optimal solution. Hence, at change of the objective function it has to be changed. When the scheduling by genetic algorithms is solvable in a sufficiently short period of time, it is more appropriate from the practical point than the heuristic algorithm. The back-tracing algorithm usually does not provide a result in a feasible period of time.
Automated scheduling and planning from theory to practice
Ozcan, Ender; Urquhart, Neil
2013-01-01
Solving scheduling problems has long presented a challenge for computer scientists and operations researchers. The field continues to expand as researchers and practitioners examine ever more challenging problems and develop automated methods capable of solving them. This book provides 11 case studies in automated scheduling, submitted by leading researchers from across the world. Each case study examines a challenging real-world problem by analysing the problem in detail before investigating how the problem may be solved using state of the art techniques.The areas covered include aircraft scheduling, microprocessor instruction scheduling, sports fixture scheduling, exam scheduling, personnel scheduling and production scheduling. Problem solving methodologies covered include exact as well as (meta)heuristic approaches, such as local search techniques, linear programming, genetic algorithms and ant colony optimisation.The field of automated scheduling has the potential to impact many aspects of our lives...
2014-09-01
and disadvantages ; for example, although the majority of fire departments in the United States abide by the 24/48- schedule, this schedule also leads...costs. The local bargaining group also falls into these criteria. The local bargaining unit must be agreeable to the policy changes. They cannot... agreeable to the local bargaining group particularly when it is addressed in an article of the current bargaining agreement. Additionally, the local
PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING
DEFF Research Database (Denmark)
Andersson, Niclas; Christensen, Knud
2007-01-01
The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... that will be used in this study. LBS is a scheduling method that rests upon the theories of line-of-balance and which uses the graphic representation of a flowline chart. As such, LBS is adapted for planning and management of workflows and, thus, may provide a solution to the identified shortcomings of CPM. Even...
Schedule and staffing of a nuclear power project
International Nuclear Information System (INIS)
Polliart, A.J.; Csik, B.
1977-01-01
Establishment of construction schedule: a) preliminary construction schedule; b) PERT (Program Evaluation Review Techniques) analytical method; c) identify key milestone target dates; d) inter-action by participants and contribution to support revised construction schedule. - Construction schedule control: a) ability to update and modify construction schedule; b) alternate plans to circumvent restraints (problems); c) critical path activity-controls; d) continuous review and report system. - Updating construction site reports to include: 1) progress, 2) accomplishments, 3) potential problems and alternate plans; b) progress reports on related support services; c) total assessment of participating groups on schedule; d) information required by management for decisions. - Typical causes for delays in project schedule. (orig.) [de
Directory of Open Access Journals (Sweden)
Alexandr Victorovich Budylskiy
2014-06-01
Full Text Available This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.
Online Scheduling in Manufacturing A Cumulative Delay Approach
Suwa, Haruhiko
2013-01-01
Online scheduling is recognized as the crucial decision-making process of production control at a phase of “being in production" according to the released shop floor schedule. Online scheduling can be also considered as one of key enablers to realize prompt capable-to-promise as well as available-to-promise to customers along with reducing production lead times under recent globalized competitive markets. Online Scheduling in Manufacturing introduces new approaches to online scheduling based on a concept of cumulative delay. The cumulative delay is regarded as consolidated information of uncertainties under a dynamic environment in manufacturing and can be collected constantly without much effort at any points in time during a schedule execution. In this approach, the cumulative delay of the schedule has the important role of a criterion for making a decision whether or not a schedule revision is carried out. The cumulative delay approach to trigger schedule revisions has the following capabilities for the ...
Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques
Stottler, D.
There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.
Limited Preemptive Scheduling in Real-time Systems
Thekkilakattil, Abhilash
2016-01-01
Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when scheduling real-time tasks, mainly in the form of preemption overheads and blocking, that potentially compromise timeliness guarantees. The high preemption overheads in preemptive real-time scheduling may imply high resource utilization, often requiring significant over-provisioning, e.g., pessimistic Worst Case Execution Time (WCET) approximations. Non-preemptive scheduling, on the other hand...
2011-12-06
... proposed changes to the Schedule of Fees for Consular Services (Schedule) for nonimmigrant visa and border... (Machine-Readable Visas or MRVs) and adult Border Crossing Cards (BCCs). The rule also provides new tiers... these visas under the current cost structure. The Department endeavors to recover the cost of providing...
Energy Technology Data Exchange (ETDEWEB)
1990-11-15
Stittco Utilities, a company distributing propane in Manitoba, applied to the Manitoba Public Utilities Board for an interim order authorizing an increase in rates for all domestic and commercial customers in 3 Manitoba localities. The rate increase requested is based on the increase in the commodity price of propane and related changes in freight rates. If approved, the average rate will increase by ca 28% for residential customers and 27% for commercial customers. With the expectation that the price of propane would decrease in the near future, Stittco proposed to base its rates on a propane price lower than the current market price, in an effort to retain existing customers. Stittco also proposed to establish a variance account, in which the difference between the cost of propane built into the rates and the actual market price would be accumulated. From time to time Stittco would apply to adjust the rate schedule to refund overages or collect shortfalls contained in this variance account. It is Stittco's intention to cancel its new propane supply contract when propane prices stabilize and enter into a new fixed-price contract. Stittco would then apply for a new rate schedule based on the long-term price of propane. Based on the evidence, the Board decided that a prima facie case has been made showing a 105% increase in Stittco's cost of product and delivery, and that this increase should be passed through to Stittco customers effective November 16, 1990. Status reports were required for the variance account starting December 1990.
National contingency plan product schedule data base
International Nuclear Information System (INIS)
Putukian, J.; Hiltabrand, R.R.
1993-01-01
During oil spills there are always proposals by the technical community and industry to use chemical agents to help in oil spill cleanups. Federal Clean Water Act regulations require that any chemical agents that the federal on-scene coordinator (FOSC) wants to use for oil cleanup be listed on the US Environmental Protection Agency (EPA) National Contingency Plan (NCP) Product Schedule. Chemical countermeasures are among the most controversial, complex, and time-critical issues facing decision-making officials choosing response methods to use on coastal oil spills. There are situations in which dispersants are likely to be one of the most appropriate counter-measure strategies. Dispersants are most effective when applied to fresh oil, and their effectiveness dramatically decreases as the oil weathers, which can begin in as little as 24 hours. To logistically implement dispersant use, a decision would need to be made within roughly the first 4 hours after the release. Most of the information that the FOSC needs to make the determination to use a specific chemical agent exists in manuals, EPA bulletins, and the published literature. This information is not in an easy-to-use format under field emergency conditions. Hence the need to collect and disseminate the information in an automated data base. The sources for the information in this data base are the following. Published results of tests performed by Environment Canada; EPA bulletins associated with the NCP Product Schedule; Published results of tests by the chemical industry. The data base resides on a Macintosh computer and contains information about 70 NCP products, including dispersants, surface collecting agents, and biological additives. It contains information on physical properties, toxicity, heavy metal content, safety precautions, use conditions, etc
Utilization Bound of Non-preemptive Fixed Priority Schedulers
Park, Moonju; Chae, Jinseok
It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.
On the number of different dynamics in Boolean networks with deterministic update schedules.
Aracena, J; Demongeot, J; Fanchon, E; Montalva, M
2013-04-01
Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.
Integrated Job Scheduling and Network Routing
DEFF Research Database (Denmark)
Gamst, Mette; Pisinger, David
2013-01-01
We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resou...... indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc.......We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...
Estimating exponential scheduling preferences
DEFF Research Database (Denmark)
Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid
2015-01-01
of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal......Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... utility of being at the origin. Another issue is that models with the exponential marginal utility formulation suffer from empirical identification problems. Though our results are not decisive, they partly support the constant-affine specification, in which the value of travel time variability...
Group Elevator Peak Scheduling Based on Robust Optimization Model
Directory of Open Access Journals (Sweden)
ZHANG, J.
2013-08-01
Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.
Scheduling Accessory Assists Patients with Cognitive Disorders
2007-01-01
Recom Technologies Inc. received initial funding from NASA to research the commercial potential of an artificially intelligent planning reaction model to serve as a tool to help individuals suffering from various forms and levels of brain impairment. In 1993, the chief of the Artificial Intelligence Research Branch at Ames Research Center suggested collaborative research with Santa Clara Valley Medical Center. This partnership led to further development of the technology and funding to support clinical research from the U.S. Department of Education's National Institute on Disability and Rehabilitation Research. In 1996, Attention Control Systems Inc. was founded to market the finished device, called the Planning and Execution Assistant and Trainer (PEAT). PEAT is a pocket-sized PDA-like device with a graphical display, touchscreen controls, an electronic calendar, an address book, and a built-in phone, that cues users to start or stop scheduled activities, monitors their progress, and adjusts schedules as necessary in response to delays or calendar changes. It uses an automatic planning model developed for NASA to adjust daily plans when a situation changes. PEAT is sold as a complete system that includes software, hardware, documentation, and technical support. In addition to the flagship Pocket PEAT device, there is PEAT Phone, PC PEAT, and PEAT Link. Clinical studies of PEAT continue at Santa Clara Valley Medical Center
Job shop scheduling problem with late work criterion
Piroozfard, Hamed; Wong, Kuan Yew
2015-05-01
Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.
VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.
Directory of Open Access Journals (Sweden)
Vasileios Thanasias
Full Text Available Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.
VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.
Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi
2016-01-01
Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.
Simulation of less master production schedule nervousness model
Herrera , Carlos; Thomas , André
2009-01-01
International audience; In production decision making systems, Master Production Schedule (MPS) states the requirements for individual end items by date and quantity. The solution sensitivity to demand forecast changes, unforeseen supplier and production problem occurrences, is known as nervousness. This feature cause undesirable effects at tactical and operational levels. Some of these effects are production and inventory cost increases and, also, negative impacts on overall and labor produc...
MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING
Directory of Open Access Journals (Sweden)
Ladislav Rosocha
2015-07-01
Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.
Practical principles in appointment scheduling
Kuiper, A.; Mandjes, M.
2015-01-01
Appointment schedules aim at achieving a proper balance between the conflicting interests of the service provider and her clients: a primary objective of the service provider is to fully utilize her available time, whereas clients want to avoid excessive waiting times. Setting up schedules that
Sport Tournament Automated Scheduling System
Directory of Open Access Journals (Sweden)
Raof R. A. A
2018-01-01
Full Text Available The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calculating the scores of each tournament. The problem of scheduling the matches of a round robin and knock-out phase in a sport league are given focus. The problem is defined formally and the computational complexity is being noted. A solution algorithm is presented using a two-step approach. The first step is the creation of a tournament pattern and is based on known graph-theoretic method. The second one is an assignment problem and it is solved using a constraint based depth-first branch and bound procedure that assigns actual teams to numbers in the pattern. As a result, the scheduling process and knock down phase become easy for the tournament organizer and at the same time increasing the level of reliability.
Comparison of a constraint directed search to a genetic algorithm in a scheduling application
International Nuclear Information System (INIS)
Abbott, L.
1993-01-01
Scheduling plutonium containers for blending is a time-intensive operation. Several constraints must be taken into account; including the number of containers in a dissolver run, the size of each dissolver run, and the size and target purity of the blended mixture formed from these runs. Two types of algorithms have been used to solve this problem: a constraint directed search and a genetic algorithm. This paper discusses the implementation of these two different approaches to the problem and the strengths and weaknesses of each algorithm
van Oostrum, J.M.; van Houdenhoven, M.; Hurink, Johann L.; Hans, Elias W.; Wullink, Gerhard; Kazemier, G.
2005-01-01
This paper addresses the problem of operating room scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time consuming tedious and complex task. The stochasticity of the durations of surgical procedures complicates
Iles, E. J.; McCallum, L.; Lovell, J. E. J.; McCallum, J. N.
2018-02-01
As we move into the next era of geodetic VLBI, the scheduling process is one focus for improvement in terms of increased flexibility and the ability to react with changing conditions. A range of simulations were conducted to ascertain the impact of scheduling on geodetic results such as Earth Orientation Parameters (EOPs) and station coordinates. The potential capabilities of new automated scheduling modes were also simulated, using the so-called 'dynamic scheduling' technique. The primary aim was to improve efficiency for both cost and time without losing geodetic precision, particularly to maximise the uses of the Australian AuScope VLBI array. We show that short breaks in observation will not significantly degrade the results of a typical 24 h experiment, whereas simply shortening observing time degrades precision exponentially. We also confirm the new automated, dynamic scheduling mode is capable of producing the same standard of result as a traditional schedule, with close to real-time flexibility. Further, it is possible to use the dynamic scheduler to augment the 3 station Australian AuScope array and thereby attain EOPs of the current global precision with only intermittent contribution from 2 additional stations. We thus confirm automated, dynamic scheduling bears great potential for flexibility and automation in line with aims for future continuous VLBI operations.
Scheduling nursing personnel on a microcomputer.
Liao, C J; Kao, C Y
1997-01-01
Suggests that with the shortage of nursing personnel, hospital administrators have to pay more attention to the needs of nurses to retain and recruit them. Also asserts that improving nurses' schedules is one of the most economic ways for the hospital administration to create a better working environment for nurses. Develops an algorithm for scheduling nursing personnel. Contrary to the current hospital approach, which schedules nurses on a person-by-person basis, the proposed algorithm constructs schedules on a day-by-day basis. The algorithm has inherent flexibility in handling a variety of possible constraints and goals, similar to other non-cyclical approaches. But, unlike most other non-cyclical approaches, it can also generate a quality schedule in a short time on a microcomputer. The algorithm was coded in C language and run on a microcomputer. The developed software is currently implemented at a leading hospital in Taiwan. The response to the initial implementation is quite promising.
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...
Vehicle and driver scheduling for public transit.
2009-08-01
The problem of driver scheduling involves the construction of a legal set of shifts, including allowance : of overtime, which cover the blocks in a particular vehicle schedule. A shift is the work scheduled to be performed by : a driver in one day, w...
A hybrid job-shop scheduling system
Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas
1992-01-01
The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.
Brief-stimulus presentations on multiform tandem schedules
Reed, Phil
1994-01-01
Three experiments examined the influence of a brief stimulus (a light) on the behavior of food-deprived rats whose lever pressing on tandem schedules comprising components of different schedule types resulted in food presentation. In Experiment 1, either a tandem variable-ratio variable-interval or a tandem variable-interval variable-ratio schedule was used. The variable-interval requirement in the tandem variable-ratio variable-interval schedule was yoked to the time taken to complete the va...
Mathematical programming and financial objectives for scheduling projects
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...
The Composition of the Master Schedule
Thomas, Cynthia C.; Behrend, Dirk; MacMillan, Daniel S.
2010-01-01
Over a period of about four months, the IVS Coordinating Center (IVSCC) each year composes the Master Schedule for the IVS observing program of the next calendar year. The process begins in early July when the IVSCC contacts the IVS Network Stations to request information about available station time as well as holiday and maintenance schedules for the upcoming year. Going through various planning stages and a review process with the IVS Observing Program Committee (OPC), the final version of the Master Schedule is posted by early November. We describe the general steps of the composition and illustrate them with the example of the planning for the Master Schedule of the 2010 observing year.
Developing optimal nurses work schedule using integer programming
Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena
2017-08-01
Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.
A theory of behaviour on progressive ratio schedules, with applications in behavioural pharmacology.
Bradshaw, C M; Killeen, P R
2012-08-01
Mathematical principles of reinforcement (MPR) provide the theoretical basis for a family of models of schedule-controlled behaviour. A model of fixed-ratio schedule performance that was applied to behaviour on progressive ratio (PR) schedules showed systematic departures from the data. This study aims to derive a new model from MPR that will account for overall and running response rates in the component ratios of PR schedules, and their decline toward 0, the breakpoint. The role of pausing is represented in a real-time model containing four parameters: T (0) and k are the intercept and slope of the linear relation between post-reinforcement pause duration and the prior inter-reinforcer interval; a (specific activation) measures the incentive value of the reinforcer; δ (response time) sets biomechanical limits on response rate. Running rate is predicted to decrease with negative acceleration as ratio size increments, overall rate to increase and then decrease. Differences due to type of progression are explained as hysteresis in the control by reinforcement rates. Re-analysis of extant data focuses on the effects of acute treatment with antipsychotic drugs, lesions of the nucleus accumbens core, and destruction of orexinergic neurones of the lateral hypothalamus. The new model resolves some anomalies evident in earlier analyses, and provides new insights to the results of these interventions. Because they can render biologically relevant parameters, mathematical models can provide greater power in interpreting the effects of interventions on the processes underlying schedule-controlled behaviour than is possible for first-order data such as the breakpoint.
77 FR 41258 - FOIA Fee Schedule Update
2012-07-13
... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...
76 FR 43819 - FOIA Fee Schedule Update
2011-07-22
... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...
75 FR 7411 - Schedule of Water Charges
2010-02-19
... DELAWARE RIVER BASIN COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River... Administrative Manual--Part III--Basin Regulations--Water Supply Charges to revise the schedule of water charges... commenter and the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please...
Prescribed Travel Schedules for Fatigue Management
Whitmire, Alexandra; Johnston, Smith; Lockley, Steven
2011-01-01
The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.
Scheduling multimedia services in cloud computing environment
Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing
2018-02-01
Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.
Scheduling nurses’ shifts at PGI Cikini Hospital
Nainggolan, J. C. T.; Kusumastuti, R. D.
2018-03-01
Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.
Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems
DEFF Research Database (Denmark)
Pop, Traian; Pop, Paul; Eles, Petru
2008-01-01
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, we address design problems that are characteristic to such hierarchically scheduled systems: assignment...... of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system...
Flow shop scheduling with heterogeneous workers
Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier
2014-01-01
We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the labor integration of persons with disabilities, an important aim not only for these centers but for any company d...
An improved scheduling algorithm for linear networks
Bader, Ahmed; Alouini, Mohamed-Slim; Ayadi, Yassin
2017-01-01
In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.
An improved scheduling algorithm for linear networks
Bader, Ahmed
2017-02-09
In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.
Mechanisms for scheduling games with selfish players
Hoeksma, R.P.
2015-01-01
Many challenges in operations research involve optimization. In particular, scheduling treats the optimal planning of tasks. This thesis focuses on machine scheduling models, where a number of tasks, called jobs, need to be scheduled on one or more machines. The outcome is determined by which job is
The Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times
DEFF Research Database (Denmark)
Fonseca, Joao Filipe Paiva; Larsen, Allan; van der Hurk, Evelien
In this talk, we deal with a generalization of the well-known Vehicle Scheduling Problem(VSP) that we call Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times (SVSPSP-FDT). The SVSPSP-FDT generalizes the VSP because the original timetables of the trips can...... be changed (i.e., shifted and stretched) in order to minimize a new objective function that aims at minimizing the operational costs plus the waiting times of the passengers at transfer points. Contrary to most generalizations of the VSP, the SVSPSP-FDT establishes the possibility of changing trips' dwell...... times at important transfer points based on expected passenger ows. We introduce a compact mixed integer linear formulation of the SVSPSP-FDT able to address small instances. We also present a meta-heuristic approach to solve medium/large instances of the problem. The e ectiveness of the proposed...
Energy Technology Data Exchange (ETDEWEB)
Cardoso, Goncalo [Technical Univ. of Lisbon (Portugal); Stadler, Michael [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Center for Energy and Innovation Technologies (Austria); Bozchalui, Mohammed C. [NEC Laboratories American Inc., Irving, TX (United States); Sharma, Ratnesh [NEC Laboratories American Inc., Irving, TX (United States); Marnay, Chris [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Barbosa-Povoa, Ana [Technical Univ. of Lisbon (Portugal); Ferrao, Paulo [Technical Univ. of Lisbon (Portugal)
2013-12-06
The large scale penetration of electric vehicles (EVs) will introduce technical challenges to the distribution grid, but also carries the potential for vehicle-to-grid services. Namely, if available in large enough numbers, EVs can be used as a distributed energy resource (DER) and their presence can influence optimal DER investment and scheduling decisions in microgrids. In this work, a novel EV fleet aggregator model is introduced in a stochastic formulation of DER-CAM [1], an optimization tool used to address DER investment and scheduling problems. This is used to assess the impact of EV interconnections on optimal DER solutions considering uncertainty in EV driving schedules. Optimization results indicate that EVs can have a significant impact on DER investments, particularly if considering short payback periods. Furthermore, results suggest that uncertainty in driving schedules carries little significance to total energy costs, which is corroborated by results obtained using the stochastic formulation of the problem.
An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems
Directory of Open Access Journals (Sweden)
Chandramouli Anandaraman
2011-10-01
Full Text Available Job Shop Scheduling Problem (JSSP and Flow Shop Scheduling Problem (FSSP are strong NP-complete combinatorial optimization problems among class of typical production scheduling problems. An improved Sheep Flock Heredity Algorithm (ISFHA is proposed in this paper to find a schedule of operations that can minimize makespan. In ISFHA, the pairwise mutation operation is replaced by a single point mutation process with a probabilistic property which guarantees the feasibility of the solutions in the local search domain. A Robust-Replace (R-R heuristic is introduced in place of chromosomal crossover to enhance the global search and to improve the convergence. The R-R heuristic is found to enhance the exploring potential of the algorithm and enrich the diversity of neighborhoods. Experimental results reveal the effectiveness of the proposed algorithm, whose optimization performance is markedly superior to that of genetic algorithms and is comparable to the best results reported in the literature.
GSA eLibrary Schedules and Contracts
General Services Administration — GSA eLibrary (formerly Schedules e-Library) is the online source for the latest contract award information for: GSA Schedules; Department of Veterans Affairs (VA)...
Minimizing tardiness for job shop scheduling under uncertainties
Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki
2016-01-01
International audience; —Many disturbances can occur during the execution of a manufacturing scheduling process. To cope with this drawback , flexible solutions are proposed based on the offline and the online phase of the schedule. Groups of permutable operations is one of the most studied flexible scheduling methods bringing flexibility as well as quality to a schedule. The online phase of this method is based on a human-machine system allowing to choose in real-time one schedule from a set...
2006-09-26
In March 2006, the President signed the Combat Methamphetamine Epidemic Act of 2005, which establishes new requirements for retail sales of over-the-counter (nonprescription) products containing the List I chemicals ephedrine, pseudoephedrine, and phenylpropanolamine. The three chemicals can be used to manufacture methamphetamine illegally. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements. This action establishes daily and 30-day limits on the sales of scheduled listed chemical products to individuals and requires recordkeeping on most sales.
14 CFR 399.81 - Unrealistic or deceptive scheduling.
2010-01-01
... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Unrealistic or deceptive scheduling. 399.81... Unrealistic or deceptive scheduling. (a) It is the policy of the Board to consider unrealistic scheduling of... to the advertising of scheduled performance, it is the policy of the Board to regard as an unfair or...
LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION
Prakhar Ojha; Siddhartha R Thota; Vani M; Mohit P Tahilianni
2015-01-01
An operating system scheduler is expected to not allow processor stay idle if there is any process ready or waiting for its execution. This problem gains more importance as the numbers of processes always outnumber the processors by large margins. It is in this regard that schedulers are provided with the ability to preempt a running process, by following any scheduling algorithm, and give us an illusion of simultaneous running of several processes. A process which is allowed t...
Topology-based hierarchical scheduling using deficit round robin
DEFF Research Database (Denmark)
Yu, Hao; Yan, Ying; Berger, Michael Stubert
2009-01-01
according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow...... protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack...
33 CFR 401.58 - Pleasure craft scheduling.
2010-07-01
... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Pleasure craft scheduling. 401.58... OF TRANSPORTATION SEAWAY REGULATIONS AND RULES Regulations Seaway Navigation § 401.58 Pleasure craft scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in...
Step-by-step cyclic processes scheduling
DEFF Research Database (Denmark)
Bocewicz, G.; Nielsen, Izabela Ewa; Banaszak, Z.
2013-01-01
Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro......Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research...... is to provide a declarative model enabling to state a constraint satisfaction problem aimed at AGVs fleet scheduling subject to assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured...... orders, the main objective is to provide the declarative framework aimed at conditions allowing one to calculate the AGVs fleet schedule in online mode. An illustrative example of the relevant algebra-like driven step-by-stem cyclic scheduling is provided....
Scheduling of Irrigation and Leaching Requirements
Directory of Open Access Journals (Sweden)
Amer Hassan Al-haddad
2015-03-01
Full Text Available Iraq depends mainly on Tigris and Euphrates Rivers to provide high percentage of agricultural water use for thousands years. At last years, Iraq is suffering from shortage in water resources due to global climate changes and unfair water politics of the neighboring countries, which affected the future of agriculture plans for irrigation, added to that the lack of developed systems of water management in the irrigation projects and improper allocation of irrigation water, which reduces water use efficiency and lead to losing irrigation water and decreasing in agricultural yield. This study aims at studying the usability of irrigation and leaching scheduling within the irrigating projects and putting a complete annual or seasonal irrigation program as a solution for the scarcity of irrigation water, the increase of irrigation efficiency, lessening the salinity in the projects and preparing an integral irrigation calendar through field measurements of soil physical properties and chemical for project selected and compared to the results of the irrigation scheduling and leaching with what is proposed by the designers. The process is accomplished by using a computer program which was designed by Water Resources Department at the University of Baghdad, with some modification to generalize it and made it applicable to various climatic zone and different soil types. Study area represented by large project located at the Tigris River, and this project was (Al-Amara irrigation project. Sufficient samples of project's soil were collected so as to identify soil physical and chemical properties and the salinity of soil and water as well as identifying the agrarian cycles virtually applied to this project. Finally, a comparison was conducted between the calculated water quantities and the suggested ones by the designers. The research results showed that using this kind of scheduling (previously prepared irrigation and leaching scheduling with its properties
Low-Feedback Opportunistic Scheduling Schemes for Wireless Networks with Heterogenous Users
Rashid, Faraan
2012-07-01
Efficient implementation of resource sharing strategies in a multi-user wireless environment can improve the performance of a network significantly. In this thesis we study various scheduling strategies for wireless networks and handle the problem of opportunistically scheduling transmissions using channel aware schemes. First we propose a scheme that can handle users with asymmetric channel conditions and is opportunistic in the sense that it exploits the multi-user diversity of the network. The scheme requires the users to have a priori knowledge of their channel distributions. The associated overhead is limited meaning it offers reduced feedback load, that does not scale with the increasing number of users. The main technique used to shrink the feedback load is the contention based distributed implementation of a splitting algorithm that does not require explicit feedback to the scheduler from every user. The users find the best among themselves, in a distributed manner, while requiring just a ternary broadcast feedback from the scheduler at the end of each mini-slot. In addition, it can also handle fairness constraints in time and throughput to various degrees. Next we propose another opportunistic scheduler that offers most of the benefits of the previously proposed scheme but is more practical because it can also handle heterogenous users whose channel distributions are unknown. This new scheme actually reduces the complexity and is also more robust for changing traffic patterns. Finally we extend both these schemes to the scenario where there are fixed thresholds, this enables us to handle opportunistic scheduling in practical systems that can only transmit over finite number of discrete rates with the additional benefit that full feedback session, even from the selected user, is never required.
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
Directory of Open Access Journals (Sweden)
Atif Shahzad
2016-02-01
Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.
Decay-usage scheduling in multiprocessors
Epema, D.H.J.
1998-01-01
Decay-usage scheduling is a priority-aging time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this article we deal with
Quality-aware scheduling for key-value data stores
Xu, Chen
2015-01-01
This book comprehensively illustrates quality-ware scheduling in key-value stores. In addition, it provides scheduling strategies and a prototype framework of quality-aware scheduler as well as a demonstration of online applications. The book offers a rich blend of theory and practice which is suitable for students, researchers and practitioners interested in distributed systems, NoSQL key-value stores and scheduling.
HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler
Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.
2012-01-01
HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.
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....
Multiple quay cranes scheduling for double cycling in container terminals.
Chu, Yanling; Zhang, Xiaoju; Yang, Zhongzhen
2017-01-01
Double cycling is an efficient tool to increase the efficiency of quay crane (QC) in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high.
Multiple quay cranes scheduling for double cycling in container terminals.
Directory of Open Access Journals (Sweden)
Yanling Chu
Full Text Available Double cycling is an efficient tool to increase the efficiency of quay crane (QC in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high.
Nonblocking Scheduling for Web Service Transactions
DEFF Research Database (Denmark)
Alrifai, Mohammad; Balke, Wolf-Tilo; Dolog, Peter
2007-01-01
. In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service......For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...... schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others...
A Procedure for scheduling and setting processing priority of MC requests
Balcar, Stepan
2013-01-01
My project contains designing and programming a base of an open system, which should help with the scheduling Monte Carlo production requests needed by the CMS physicists for data analysis within the CMS collaboration. A primary requirement was to create web interface that would be portable and independent of the control logic of the system. Another point of the project was to make a scheduler for the Monte Carlo production planning and to design and program interfaces between the various logical blocks of the system. Introduction Many research groups in CERN which specialize in different areas of particle physics works with CMS. They are mostly scientists working at universities or research institutes in their countries. Their research consists in constructing models of elementary particles and subsequent experimental verification of the behavior of these models. All these groups of people create MC production requests which are to be executed using computing resources located at CERN and other institutes. T...
Toward an Autonomous Telescope Network: the TBT Scheduler
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.
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.
Modelling altered fractionation schedules
International Nuclear Information System (INIS)
Fowler, J.F.
1993-01-01
The author discusses the conflicting requirements of hyperfractionation and accelerated fractionation used in radiotherapy, and the development of computer modelling to predict how to obtain an optimum of tumour cell kill without exceeding normal-tissue tolerance. The present trend is to shorten hyperfractionated schedules from 6 or 7 weeks to give overall times of 4 or 5 weeks as in new schedules by Herskovic et al (1992) and Harari (1992). Very high doses are given, much higher than can be given when ultrashort schedules such as CHART (12 days) are used. Computer modelling has suggested that optimum overall times, to yield maximum cell kill in tumours ((α/β = 10 Gy) for a constant level of late complications (α/β = 3 Gy) would be X or X-1 weeks, where X is the doubling time of the tumour cells in days (Fowler 1990). For median doubling times of about 5 days, overall times of 4 or 5 weeks should be ideal. (U.K.)
International Nuclear Information System (INIS)
1994-08-01
This document provides a detailed leak detection test plan and schedule for the pipelines that comprise the active, singly contained, portion of the liquid low-level waste (LLLW) system at the Oak Ridge National Laboratory (ORNL). This plan was prepared in response to the requirements of the Federal Facility Agreement for the Oak Ridge Reservation (FFA) between the U.S. Department of Energy (DOE), the U.S. Environmental Protection Agency (EPA) and the Tennessee Department of Environment and Conservation (TDEC). The LLLW system is an interconnected complex of tanks and pipelines. The FFA distinguishes four categories of tank and pipeline systems within this complex: new or replacement tank systems with secondary containment (Category A), existing tank systems with secondary containment (Category B), existing tank systems without secondary containment (Category C), and tank systems that have been removed from service (Category D). The FFA specifically requires that DOE demonstrate that the Category C systems are not leaking. This plan and schedule addresses testing of the Category C pipelines and the pipelines which are part of Category B tank systems that do not fully meet the requirements for secondary containment as listed in the FFA. A key feature of the plan is that it is based on the use of performance standards for the conduct of release detection testing, and on the use of methods whose performance has been evaluated and shown to meet those standards. Another feature of the plan is that it is based in part on relevant portions of current federal EPA regulations applicable to underground storage tanks and pipelines (UST systems) that store and transfer petroleum products and other hazardous substances. While the FFA does not require that the testing at ORNL follow these regulations, the regulations do provide industry- and regulator-accepted performance standards, as well as a schedule for repeated testing of UST components
Cloud Service Scheduling Algorithm Research and Optimization
Directory of Open Access Journals (Sweden)
Hongyan Cui
2017-01-01
Full Text Available We propose a cloud service scheduling model that is referred to as the Task Scheduling System (TSS. In the user module, the process time of each task is in accordance with a general distribution. In the task scheduling module, we take a weighted sum of makespan and flowtime as the objective function and use an Ant Colony Optimization (ACO and a Genetic Algorithm (GA to solve the problem of cloud task scheduling. Simulation results show that the convergence speed and output performance of our Genetic Algorithm-Chaos Ant Colony Optimization (GA-CACO are optimal.
A reduced feedback proportional fair multiuser scheduling scheme
Shaqfeh, Mohammad
2011-12-01
Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed and ordered scheduling mechanism. A slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we propose a novel proportional fair multiuser switched-diversity scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the per-user feedback thresholds. We demonstrate by numerical examples that our reduced feedback proportional fair scheduler operates within 0.3 bits/sec/Hz from the achievable rates by the conventional full feedback proportional fair scheduler in Rayleigh fading conditions. © 2011 IEEE.
Where do we stand with fuzzy project scheduling?
Bonnal, Pierre; Lacoste, Germain
2004-01-01
Fuzzy project scheduling has interested several researchers in the past two decades; about 20 articles have been written on this issue. Contrary to stochastic project-scheduling approaches that are used by many project schedulers, and even if the axiomatic associated to the theory of probabilities is not always compatible with decision-making situations, fuzzy project-scheduling approaches that are most suited to these situations have been kept in the academic sphere. This paper starts by recalling the differences one can observe between uncertainty and imprecision. Then most of the published research works that have been done in this field are summarized. Finally, a framework for addressing the resource-constrained fuzzy project- scheduling problem is proposed. This framework uses temporal linguistic descriptors, which might become very interesting features to the project-scheduling practitioners.
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.
Responsive versus scheduled feeding for preterm infants.
Watson, Julie; McGuire, William
2015-10-13
Feeding preterm infants in response to their hunger and satiation cues (responsive, cue-based, or infant-led feeding) rather than at scheduled intervals might enhance infants' and parents' experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. To assess the effect of feeding preterm infants on a responsive basis versus feeding prescribed volumes at scheduled intervals on growth, duration of hospital stay, and parental satisfaction. We used the standard search strategy of the Cochrane Neonatal Review Group. This included searches of the Cochrane Central Register of Controlled Trials (CENTRAL, The Cochrane Library, Issue 9, 2015), MEDLINE (1966 to September 2015), EMBASE (1980 to September 2015), and CINAHL (1982 to September 2015), conference proceedings, previous reviews, and trial registries. Randomised controlled trials (RCTs) or quasi-RCTs that compared a policy of feeding preterm infants on a responsive basis versus feeding at scheduled intervals. Two review authors assessed trial eligibility and risk of bias and undertook data extraction independently. We analysed the treatment effects in the individual trials and reported the risk ratio and risk difference for dichotomous data and mean difference (MD) for continuous data, with respective 95% confidence intervals (CIs). We used a fixed-effect model in meta-analyses and explored the potential causes of heterogeneity in sensitivity analyses. We found nine eligible RCTs including 593 infants in total. These trials compared responsive with scheduled interval regimens in preterm infants in the transition phase from intragastric tube to oral feeding. The trials were generally small and contained various methodological weaknesses including lack of blinding and incomplete assessment of all randomised participants. Meta-analyses, although limited by data quality and availability, suggest that responsive feeding
Hamilton, Carl Kenneth Gonzaga
2017-01-01
The National Aeronautics and Space Administration has several centers and facilities located near the coast that are undoubtedly susceptible to climate change. One of those facilities is Wallops Flight Facility on the Eastern Shore of Virginia which is separated into three areas: Main Base, Mainland, and the Island. Wallops Island has numerous buildings and assets that are vulnerable to flood inundation, intense storms, and storm surge. The shoreline of Wallops Island is prone to beach erosion and is slated for another beach replenishment project in 2019. In addition, current climate projections for NASAs centers and facilities, conducted by the Climate Adaptation Science Investigators, warn of inevitable increases in annual temperature, precipitation, sea level rise, and extreme events such as heat waves. The aforementioned vulnerabilities Wallops Island faces in addition to the projections of future climate change reveal an urgency for NASA to adjust how new buildings at its centers and facilities near the coast are built to adapt to the inevitable effects of climate change. Although the agency has made strides to mitigate the effects of climate change by incorporating L.E.E.D. into new buildings that produce less greenhouse gas, the strides for the agency to institute clear climate adaptation policies for the buildings at its centers and facilities near the coast seem to lag behind. As NASA continues to formulate formidable climate change adaptation plans for its centers and facilities, an architectural trend that should be examined for its potential to replace several old buildings at Wallops Island is shipping containers buildings. Shipping containers or Intermodal Steel Building Units offer an array of benefits such as strength, durability, versatility, modular, and since they can be upcycled, they are also eco-friendly. Some disadvantages of shipping containers are they contain harmful chemicals, insulation must be added, fossil fuels must be used to
Scheduled, intermittent stimulation of the thalamus reduces tics in Tourette syndrome.
Rossi, P Justin; Opri, Enrico; Shute, Jonathan B; Molina, Rene; Bowers, Dawn; Ward, Herbert; Foote, Kelly D; Gunduz, Aysegul; Okun, Michael S
2016-08-01
Personalized, scheduled deep brain stimulation in Tourette syndrome (TS) may permit clinically meaningful tic reduction while reducing side effects and increasing battery life. Here, we evaluate scheduled DBS applied to TS at two-year follow-up. Five patients underwent bilateral centromedian thalamic (CM) region DBS. A cranially contained constant-current device delivering stimulation on a scheduled duty cycle, as opposed to the standard continuous DBS paradigm was utilized. Baseline vs. 24-month outcomes were collected and analyzed, and a responder analysis was performed. A 40% improvement in the Modified Rush Tic Rating Scale (MRTRS) total score or Yale Global Tic Severity Scale (YGTSS) total score defined a full responder. Three of the 4 patients followed to 24 months reached full responder criteria and had a mean stimulation time of 1.85 h per day. One patient lost to follow-up evaluated at the last time point (month 18) was a non-responder. Patients exhibited improvements in MRTRS score beyond the improvements previously reported for the 6 month endpoint; on average, MRTRS total score was 15.6% better at 24 months than at 6 months and YGTSS total score was 14.8% better. Combining the patients into a single cohort revealed significant improvements in the MRTRS total score (-7.6 [5.64]; p = 0.02). Electrical stimulation of the centromedian thalamic region in a scheduled paradigm was effective in suppressing tics, particularly phonic tics. Full responders were able to achieve the positive DBS effect with a mean of 2.3 ± 0.9 (SEM) hours of DBS per day. Copyright © 2016 Elsevier Ltd. All rights reserved.
Robust, Gain-Scheduled Control of Wind Turbines
DEFF Research Database (Denmark)
Østergaard, Kasper Zinck
Wind turbines are today large and efficient machines, which are combined into wind farms operating on par with conventional power plants. When looking back, this is significantly different from the status only a few years ago, when wind turbines were sold mainly to private people. This change...... in turbine owners has resulted in a new focus on operational reliability instead of turbine size. This research deals with investigating model-based gain-scheduling control of wind turbines by use of linear parameter varying (LPV) methods. The numerical challenges grow quickly with the model size...
Environmental damage schedules: community judgments of importance and assessments of losses
Ratana Chuenpagdee; Jack L. Knetsch; Thomas C. Brown
2001-01-01
Available methods of valuing environmental changes are often limited in their applicability to current issues such as damage assessment and implementing regulatory controls, or may otherwise not provide reliable readings of community preferences. An alternative is to base decisions on predetermined fixed schedules of sanctions, restrictions, damage awards, and other...
Mission Operations Planning and Scheduling System (MOPSS)
Wood, Terri; Hempel, Paul
2011-01-01
MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.
Lamont, M
2014-01-01
The scheduling limits for a typical long year taking into account technical stops, machine development, spe- cial physics runs are presented. An attempt is then made to outline a ten year post LS1 schedule taking into account the disparate requirements outlined in the previous talks in this session. The demands on the planned long shutdowns and the impact of these demands on their proposed length will be discussed. The option of using ion running as a pre-shutdown cool-down period will be addressed.
Sherry, Lance; Ferguson, John; Hoffman, Karla; Donohue, George; Beradino, Frank
2012-01-01
This report describes the Airline Fleet, Route, and Schedule Optimization Model (AFRS-OM) that is designed to provide insights into airline decision-making with regards to markets served, schedule of flights on these markets, the type of aircraft assigned to each scheduled flight, load factors, airfares, and airline profits. The main inputs to the model are hedged fuel prices, airport capacity limits, and candidate markets. Embedded in the model are aircraft performance and associated cost factors, and willingness-to-pay (i.e. demand vs. airfare curves). Case studies demonstrate the application of the model for analysis of the effects of increased capacity and changes in operating costs (e.g. fuel prices). Although there are differences between airports (due to differences in the magnitude of travel demand and sensitivity to airfare), the system is more sensitive to changes in fuel prices than capacity. Further, the benefits of modernization in the form of increased capacity could be undermined by increases in hedged fuel prices
Staffing, overtime, and shift scheduling project
International Nuclear Information System (INIS)
Lewis, P.M.
1989-01-01
Recent events at the Peach Bottom nuclear power plant have demonstrated the need to establish a quantifiable basis for assessing the safety significance of long work hours on nuclear power plant operators. The incidents at TMI-2, Chernobyl, and Bhopal, which all occurred during the late evening/night shift, further highlight the importance of the relationship between shift scheduling and performance. The objective of this project is to estimate, using statistical analysis on data from the nuclear industry, the effects on safety of staffing levels, overtime, and shift scheduling for operators and maintenance personnel. Regarding staffing levels, the Nuclear Regulatory Commission (NRC) currently has no explicit regulation concerning the minimum acceptable levels of staffing in a plant that has an operating license. The NRC has no systematic method for collecting data on the number of licensed operators on the operating crews. In 1982 the NRC recommended that plants write into their technical specifications a model policy on overtime. Currently, 77 nuclear power plant units have the model policy or a modification of it written into their technical specifications; 33 units have no policy on overtime. The model policy sets limits on overtime for safety related personnel, although these limits can be exceeded with plant manger approval. The US nuclear power industry has three types of shift schedules: (1) forward-rotating 8-hour/day shift schedules, (2) backward-rotating 8-hour/day schedules, and (3) 12-hour/day schedules
Realistic Scheduling Mechanism for Smart Homes
Directory of Open Access Journals (Sweden)
Danish Mahmood
2016-03-01
Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.
Scheduling Network Traffic for Grid Purposes
DEFF Research Database (Denmark)
Gamst, Mette
This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...
Scheduling job shop - A case study
Abas, M.; Abbas, A.; Khan, W. A.
2016-08-01
The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.
Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling
Directory of Open Access Journals (Sweden)
Tomáš Macák
2016-01-01
Full Text Available Time management has a crucial role in organizations and also in our personal lives. Managerial scheduling is an important tool for the time management, especially It can serve as a tool for the first phase, of time management - namely for effective planning. This paper focusses on finding the best possible setting for determining significant the best layout for activities according to the criteria of urgency and importance using a modified steepest ascent method, which can be referred as dynamic scheduling. This term indicates the nature of the method; wherein the experimental design space is changed to look for the best conditions for adjustment factors influencing a managerial process. Existing methods for layout optimization mentioned in the literature and conventionally implemented in practice have only shown local optima.
Modeling the Cray memory scheduler
Energy Technology Data Exchange (ETDEWEB)
Wickham, K.L.; Litteer, G.L.
1992-04-01
This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.
Robust Optimization for Household Load Scheduling with Uncertain Parameters
Directory of Open Access Journals (Sweden)
Jidong Wang
2018-04-01
Full Text Available Home energy management systems (HEMS face many challenges of uncertainty, which have a great impact on the scheduling of home appliances. To handle the uncertain parameters in the household load scheduling problem, this paper uses a robust optimization method to rebuild the household load scheduling model for home energy management. The model proposed in this paper can provide the complete robust schedules for customers while considering the disturbance of uncertain parameters. The complete robust schedules can not only guarantee the customers’ comfort constraints but also cooperatively schedule the electric devices for cost minimization and load shifting. Moreover, it is available for customers to obtain multiple schedules through setting different robust levels while considering the trade-off between the comfort and economy.
The robust schedule - A link to improved workflow
DEFF Research Database (Denmark)
Lindhard, Søren; Wandahl, Søren
2012-01-01
-down the contractors, and force them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In attempt to improve productivity three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have been...... analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule to tight. A too tight schedule is inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors interacting and dependable....... The result is a chaotic, complex and uncontrolled construction site. Furthermore, strict time limits entail the workflow to be optimized under non-optimal conditions. Even though productivity seems to be increasing, productivity per man-hour is decreasing resulting in increased cost. To increase productivity...
Shiftwork Scheduling for the 1990s.
Coleman, Richard M.
1989-01-01
The author discusses the problems of scheduling shift work, touching on such topics as employee desires, health requirements, and business needs. He presents a method for developing shift schedules that addresses these three areas. Implementation hints are also provided. (CH)
U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...
DEFF Research Database (Denmark)
Neumann, Frank; Witt, Carsten
2015-01-01
combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...
CARMENES instrument control system and operational scheduler
Garcia-Piquer, Alvaro; Guàrdia, Josep; Colomé, Josep; Ribas, Ignasi; Gesa, Lluis; Morales, Juan Carlos; Pérez-Calpena, Ana; Seifert, Walter; Quirrenbach, Andreas; Amado, Pedro J.; Caballero, José A.; Reiners, Ansgar
2014-07-01
visibility, sky background, required time sampling coverage) and the dynamic change of the system conditions (i.e., weather, system conditions). Off-line and on-line strategies are integrated into a single tool for a suitable transfer of the target prioritization made by the science team to the real-time schedule that will be used by the instrument operators. A suitable solution will be expected to increase the efficiency of telescope operations, which will represent an important benefit in terms of scientific return and operational costs. We present the operational scheduling tool designed for CARMENES, which is based on two algorithms combining a global and a local search: Genetic Algorithms and Hill Climbing astronomy-based heuristics, respectively. The algorithm explores a large amount of potential solutions from the vast search space and is able to identify the most efficient ones. A planning solution is considered efficient when it optimizes the objectives defined, which, in our case, are related to the reduction of the time that the telescope is not in use and the maximization of the scientific return, measured in terms of the time coverage of each target in the survey. We present the results obtained using different test cases.
PHENIX WBS notes. Cost and schedule review copy
Energy Technology Data Exchange (ETDEWEB)
1994-02-01
The Work Breakdown Structure (WBS) Book begins with this Overview section, which contains the high-level summary cost estimate, the cost profile, and the global construction schedule. The summary cost estimate shows the total US cost and the cost in terms of PHENIX construction funds for building the PHENIX detector. All costs in the WBS book are shown in FY 1993 dollars. Also shown are the institutional and foreign contributions, the level of pre-operations funding, and the cost of deferred items. Pie charts are presented at PHENIX WBS level 1 and 2 that show this information. The PHENIX construction funds are shown broken down to PHENIX WBS level 3 items per fiscal year, and the resulting profile is compared to the RHIC target profile. An accumulated difference of the two profiles is also shown. The PHENIX global construction schedule is presented at the end of the Overview section. Following the Overview are sections for each subsystem. Each subsystem section begins with a summary cost estimate, cost profile, and critical path. The total level 3 cost is broken down into fixed costs (M&S), engineering costs (EDIA) and labor costs. Costs are further broken down in terms of PHENIX construction funds, institutional and foreign contributions, pre-operations funding, and deferred items. Also shown is the contingency at level 3 and the level 4 breakdown of the total cost. The cost profile in fiscal years is shown at level 3. The subsystem summaries are followed by the full cost estimate and schedule sheets for that subsystem. These detailed sheets are typically carried down to level 7 or 8. The cost estimate Total, M&S, EDIA, and Labor breakdowns, as well as contingency, for each WBS entry.
Planning construction of integrative schedule management for nuclear power project
International Nuclear Information System (INIS)
Zeng Zhenglin; Wang Wenying; Peng Fei
2012-01-01
This paper introduces the planning construction of integrative schedule management for Nuclear Power Project. It details schedule management system and the requirement of schedulers and the mode of three schedule management flats. And analysis it combing with the implementation of construction water and all special schedules before FCD to further propose the improving and researching direction for the integrative schedule management. (authors)
Energy Technology Data Exchange (ETDEWEB)
Bonet, L.; Ferrer, P.; Castel, J. R.; Intrigliolo, D. S.
2010-07-01
Irrigation scheduling is often performed based on a soil water balance, where orchard evapotranspiration is estimated using the reference evapotranspiration (ETo) times the crop coefficient (Kc). This procedure, despite being widely spread, has some uncertainties. Because of this, plant and soil water status monitoring could be alternatively or complementarity used to schedule irrigation. The usefulness of capacitance probes was evaluated during several seasons in large irrigation districts where irrigation practices were changed over years from the ETo * Kc model to the analysis of soil water status trend. This area corresponds to drip irrigated orchards planted with citrus, peach, nectarine and persimmon. Around 25% less irrigation was applied with no substantial yield penalty when the information provided by capacitance probes was correctly applied for irrigation management. On the other hand, the usefulness of stem dendrometers for continuously monitoring plant water status was evaluated in a young plum experimental orchard. Over two years, irrigation was scheduled using exclusively trunk shrinkage via the signal intensity approach by means of a baseline equation previously obtained in the orchard. Results showed that it was not always possible to schedule irrigation based on the trunk shrinkage signal intensity due to the temporal changes in the reference values that occurred as trees aged. Overall, results obtained are discussed in terms of the possible extrapolation at field level of both capacitance probes and stem dendrometers. Advantages and drawbacks of each technique are analyzed and discussed. (Author) 34 refs.
Spent nuclear fuel project integrated schedule plan
International Nuclear Information System (INIS)
Squires, K.G.
1995-01-01
The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel
Spent nuclear fuel project integrated schedule plan
Energy Technology Data Exchange (ETDEWEB)
Squires, K.G.
1995-03-06
The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel.
Agent-based scheduling for aircraft deicing
Mao, X.; Ter Mors, A.W.; Roos, N.; Witteveen, C.
2006-01-01
The planning and scheduling of the deicing and anti-icing activities is an important and challenging part of airport departure planning. Deicing planning has to be done in a highly dynamic environment involving several autonomous and self-interested parties. Traditional centralized scheduling
Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool
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.
On the Importance of Morphing Deformation Scheduling for Actuation Force and Energy
Directory of Open Access Journals (Sweden)
Roeland De Breuker
2016-11-01
Full Text Available Morphing aircraft offer superior properties as compared to non-morphing aircraft. They can achieve this by adapting their shape depending on the requirements of various conflicting flight conditions. These shape changes are often associated with large deformations and strains, and hence dedicated morphing concepts are developed to carry out the required changes in shape. Such intricate mechanisms are often heavy, which reduces, or even completely cancels, the performance increase of the morphing aircraft. Part of this weight penalty is determined by the required actuators and associated batteries, which are mainly driven by the required actuation force and energy. Two underexposed influences on the actuation force and energy are the flight condition at which morphing should take place and the order of the morphing manoeuvres, also called morphing scheduling. This paper aims at highlighting the importance of both influences by using a small Unmanned Aerial Vehicle (UAV with different morphing mechanisms as an example. The results in this paper are generated using a morphing aircraft analysis and design code that was developed at the Delft University of Technology. The importance of the flight condition and a proper morphing schedule is demonstrated by investigating the required actuation forces for various flight conditions and morphing sequences. More importantly, the results show that there is not necessarily one optimal flight condition or morphing schedule and a tradeoff needs to be made.
Integrated multi-resource planning and scheduling in engineering project
Directory of Open Access Journals (Sweden)
Samer Ben Issa
2017-01-01
Full Text Available Planning and scheduling processes in project management are carried out sequentially in prac-tice, i.e. planning project activities first without visibility of resource limitation, and then schedul-ing the project according to these pre-planned activities. This is a need to integrate these two pro-cesses. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called “the Minimum Moments of Resources Required around X-Y axes (MMORR”, we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.
Diverse task scheduling for individualized requirements in cloud manufacturing
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.
Directory of Open Access Journals (Sweden)
A. M. Bronnikov
2017-01-01
Full Text Available The avionics concept of the maintenance-free on-board equipment implies the absence of necessity to maintain onboard systems between scheduled maintenance, preserving the required operational and technical characteristics; it should be achieved by automatic diagnosis of the technical condition and the application of active means of ensuring a failsafe design, allowing to change the structure of the system to maintain its functions in case of failure. It is supposed that such equipment will reduce substantially and in the limit eliminate traditional maintenance of aircraft between scheduled maintenance, ensuring maximum readiness for use, along with improving safety. The paper proposes a methodology for evaluating the efficiency of maintenance-free between scheduled maintenance aircraft system with homogeneous redundancy. The excessive redundant elements allow the system to accumulate failures which are repaired during the routine maintenance. If the number of failures of any reserve is approaching a critical value, the recovery of the on-board system (elimination of all failures is carried out between scheduled maintenance by conducting rescue and recovery operations. It is believed that service work leads to the elimination of all failures and completely updates the on-board system. The process of system operational status changes is described with the discrete-continuous model in the flight time. The average losses in the sorties and the average cost of operation are used as integrated efficiency indicators of system operation. For example, the evaluation of the operation efficiency of formalized on-board system with homogeneous redundancy demonstrates the efficiency of the proposed methodology and the possibility of its use while analyzing the efficiency of the maintenance-free operation equipment between scheduled periods. As well as a comparative analysis of maintenance-free operation efficiency of the on-board system with excessive
2013-05-16
The Deputy Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cannabinoids under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48). This action is based on a finding by the Deputy Administrator that the placement of these synthetic cannabinoids and their salts, isomers and salts of isomers into Schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the full effect of the CSA and the Controlled Substances Import and Export Act (CSIEA) and their implementing regulations including criminal, civil and administrative penalties, sanctions and regulatory controls of Schedule I substances will be imposed on the manufacture, distribution, possession, importation, and exportation of these synthetic cannabinoids.
Interoceanic canal excavation scheduling via computer simulation
Energy Technology Data Exchange (ETDEWEB)
Baldonado, Orlino C [Holmes and Narver, Inc., Los Angeles, CA (United States)
1970-05-15
The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)
Interoceanic canal excavation scheduling via computer simulation
International Nuclear Information System (INIS)
Baldonado, Orlino C.
1970-01-01
The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)
46 CFR 525.2 - Terminal schedules.
2010-10-01
... domestic law and international conventions and agreements adopted by the United States; such terminal... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule that...
Robust scheduling in an uncertain environment
Wilson, M.
2016-01-01
This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway industry companies. The focus therefore lies on scheduling of maintenance operations on rolling stock
Directory of Open Access Journals (Sweden)
Changyun Liu
2017-01-01
Full Text Available A multisensor scheduling algorithm based on the hybrid task decomposition and modified binary particle swarm optimization (MBPSO is proposed. Firstly, aiming at the complex relationship between sensor resources and tasks, a hybrid task decomposition method is presented, and the resource scheduling problem is decomposed into subtasks; then the sensor resource scheduling problem is changed into the match problem of sensors and subtasks. Secondly, the resource match optimization model based on the sensor resources and tasks is established, which considers several factors, such as the target priority, detecting benefit, handover times, and resource load. Finally, MBPSO algorithm is proposed to solve the match optimization model effectively, which is based on the improved updating means of particle’s velocity and position through the doubt factor and modified Sigmoid function. The experimental results show that the proposed algorithm is better in terms of convergence velocity, searching capability, solution accuracy, and efficiency.
2011-11-28
This final rule with comment period addresses changes to the physician fee schedule and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. It also addresses, implements or discusses certain statutory provisions including provisions of the Patient Protection and Affordable Care Act, as amended by the Health Care and Education Reconciliation Act of 2010 (collectively known as the Affordable Care Act) and the Medicare Improvements for Patients and Providers Act (MIPPA) of 2008. In addition, this final rule with comment period discusses payments for Part B drugs; Clinical Laboratory Fee Schedule: Signature on Requisition; Physician Quality Reporting System; the Electronic Prescribing (eRx) Incentive Program; the Physician Resource-Use Feedback Program and the value modifier; productivity adjustment for ambulatory surgical center payment system and the ambulance, clinical laboratory, and durable medical equipment prosthetics orthotics and supplies (DMEPOS) fee schedules; and other Part B related issues.
Solving project scheduling problems by minimum cut computations
Möhring, R.H.; Schulz, A.S.; Stork, F.; Uetz, Marc Jochen
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in
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
International Nuclear Information System (INIS)
Cardoso, G.; Stadler, M.; Bozchalui, M.C.; Sharma, R.; Marnay, C.; Barbosa-Póvoa, A.; Ferrão, P.
2014-01-01
The large scale penetration of electric vehicles (EVs) will introduce technical challenges to the distribution grid, but also carries the potential for vehicle-to-grid services. Namely, if available in large enough numbers, EVs can be used as a distributed energy resource (DER) and their presence can influence optimal DER investment and scheduling decisions in microgrids. In this work, a novel EV fleet aggregator model is introduced in a stochastic formulation of DER-CAM [1], an optimization tool used to address DER investment and scheduling problems. This is used to assess the impact of EV interconnections on optimal DER solutions considering uncertainty in EV driving schedules. Optimization results indicate that EVs can have a significant impact on DER investments, particularly if considering short payback periods. Furthermore, results suggest that uncertainty in driving schedules carries little significance to total energy costs, which is corroborated by results obtained using the stochastic formulation of the problem. - Highlights: • This paper introduces a new EV aggregator model in the DER-CAM model and expands it with a stochastic formulation. • The model is used to analyze the impact of EVs in DER investment decisions in a large office building. • The uncertainty in EV driving patterns is considered through scenarios based on data from a daily commute driving survey. • Results indicate that EVs have a significant impact in optimal DER decisions, particularly when looking at short payback periods. • Furthermore, results indicate that uncertainty in EV driving schedules has little impact on DER investment decisions
Hanoa, Rolf; Baste, Valborg; Kooij, Arne; Sommervold, Linda; Moen, Bente Elisabeth
2011-01-01
This study was performed among coal miners in the remote location Svea, Spitsbergen. The shift schedule used to be 7 d on and 7 d off. The aim of this study was to investigate possible changes in health after a voluntary implementation of a new shift schedule, with periods of 14 d on and 14 d off, for 74 percent of the workers in 2007. A questionnaire was distributed to all employees before and two times after the new shift schedule, comprising questions on type of work, shift schedule, pain, sleep, stress and coping. Ninety nine percent of the employees responded; 274 in 2006, 307 in 2007 and 312 in 2008. Work neither in the 14/14 shift nor 7/7 shift was related to any change in the health after these two years. The coping index for workers in the 14/14 shift improved.
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.
Adaptive track scheduling to optimize concurrency and vectorization in GeantV
International Nuclear Information System (INIS)
Apostolakis, J; Brun, R; Carminati, F; Gheata, A; Novak, M; Wenzel, S; Bandieramonte, M; Bitzes, G; Canal, P; Elvira, V D; Jun, S Y; Lima, G; Licht, J C De Fine; Duhem, L; Sehgal, R; Shadura, O
2015-01-01
The GeantV project is focused on the R and D of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. This work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results. (paper)
76 FR 28194 - Proposed FOIA Fee Schedule Update
2011-05-16
... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY... publishing its proposed Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from... on the proposed fee schedule should be mailed or delivered to the Office of the General Counsel...
75 FR 27228 - Proposed FOIA Fee Schedule Update
2010-05-14
... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY... publishing its proposed Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from... on the proposed fee schedule should be mailed or delivered to the Office of the General Counsel...
Institute of Scientific and Technical Information of China (English)
MA Feng-cai; ZHANG Qun
2009-01-01
In this paper, daily production scheduling is studied based on the Third Steelmaking Plant of Wuhan Iron and steel corporation (WISCO). To make sure the daily production plan is feasible, method of casting gToup is established, and the compatibility between two converters and three continuous casting devices in the Third Steelmaking Plant of WISCO is analyzed. The process flow chart of daily production scheduling is given in this paper. Then, algorithms and procedures for the simulation of daily production plan is developed. Using the actual data from the Third Steelmaking Plant, the feasible daily steelmaking plan and cast plan are given. The plan contains 7 groups of cast plan, figured out 54 converters, and a- bout 13,500 tons steel.
On Coding of Scheduling Information in OFDM
Gunnarsson, Fredrik; Moosavi, Reza; Eriksson, Jonas; Larsson, Erik G.; Wiberg, Niklas; Frenger, Pål
2009-01-01
Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The...
Trustable Virtual Machine Scheduling in a Cloud
Hermenier , Fabien; Henrio , Ludovic
2017-01-01
International audience; In an Infrastructure As A Service (IaaS) cloud, the scheduler deploys VMs to servers according to service level objectives (SLOs). Clients and service providers must both trust the infrastructure. In particular they must be sure that the VM scheduler takes decisions that are consistent with its advertised behaviour. The difficulties to master every theoretical and practical aspects of a VM scheduler implementation leads however to faulty behaviours that break SLOs and ...
Management of Temporal Constraints for Factory Scheduling.
1987-06-01
consistency of scheduling decisions were implemented in both the ISIS [Fox 84] and SOJA [LePape 85a] scheduling systems. More recent work with the...kinds of time propagation systems: the symbolic and the numeric ones. Symbolic systems combine relationships with a temporal logic a la Allen [Allen 81...maintains consistency by narrowing time windows associated with activities as decisions are made, and SOJA [LePape 85b] guarantees a schedule’s
Gain scheduling controller for pitch control of a TRMS system
Bhagyalakshmi, R.; Rashmi, GP; Jaganatha Pandian, B.
2017-11-01
Gain scheduling is a control technique which is applied for the control of non-linear systems by using a family of linear controllers at different operating points so as to increase the range of operation of the process. The dynamics of any nonlinear system changes with respect to operating points. These operating points are characterized by one or more variables known as scheduling variables. In such cases, we linearize the system at different equilibrium points. Due to the high amount of non-linearities and complexity in the aerodynamic design, modelling of other unmanned aerial vehicles have been replaced here with twin rotor system. The linearized system is then controlled by using PID controllers which are designed with respect to the obtained operating points. Linearizing of the non-linear system, designing and tuning of PID are being implemented using different MATLAB functions.
7 CFR 305.23 - Steam sterilization treatment schedules.
2010-01-01
... 7 Agriculture 5 2010-01-01 2010-01-01 false Steam sterilization treatment schedules. 305.23... Steam sterilization treatment schedules. Treatment schedule Temperature( °F) Pressure Exposure period (minutes) Directions T303-b-1 10 lbs 20 Use 28″ vacuum. Steam sterilization is not practical for treatment...
77 FR 33980 - Proposed FOIA Fee Schedule Update
2012-06-08
... 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Notice... the Board's proposed FOIA Fee Schedule Update published in the Federal Register of June 1, 2012. The...: The FOIA requires each Federal agency covered by the Act to specify a schedule of fees applicable to...
Residency Applicants Prefer Online System for Scheduling Interviews
Directory of Open Access Journals (Sweden)
Wills, Charlotte
2015-03-01
Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.
A dynamic approach to vehicle scheduling
D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)
2001-01-01
textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our
21 CFR 1308.13 - Schedule III.
2010-04-01
... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and... opposite it. (b) Stimulants. Unless specifically excepted or unless listed in another schedule, any... a stimulant effect on the central nervous sxstem, including its salts, isomers (whether optical...
Modeling Change in Project Duration and Completion
DEFF Research Database (Denmark)
Wiltshire, Travis; Butner, Jonathan E.; Pirtle, Zachary
2017-01-01
In complex work domains and organizations, understanding scheduleing dynamics can ensure objectives are reached and delays are mitigated. In the current paper, we examine the scheduling dynamics for NASA’s Exploration Flight Test 1 (EFT-1) activities. For this examination, we specifically modeled...... simultaneous change in percent complete and estimated duration for a given project as they were included in monthly reports over time. In short, we utilized latent change score mixture modeling to extract the attractor dynamics within the scheduling data. We found three primarily patterns: an attractor at low...
Scheduling Diet for Diabetes Mellitus Patients using Genetic Algorithm
Syahputra, M. F.; Felicia, V.; Rahmat, R. F.; Budiarto, R.
2017-01-01
Diabetes Melitus (DM) is one of metabolic diseases which affects on productivity and lowers the human resources quality. This disease can be controlled by maintaining and regulating balanced and healthy lifestyle especially for daily diet. However, nowadays, there is no system able to help DM patient to get any information of proper diet. Therefore, an approach is required to provide scheduling diet every day in a week with appropriate nutrition for DM patients to help them regulate their daily diet for healing this disease. In this research, we calculate the number of caloric needs using Harris-Benedict equation and propose genetic algorithm for scheduling diet for DM patient. The results show that the greater the number of individuals, the greater the more the possibility of changes in fitness score approaches the best fitness score. Moreover, the greater the created generation, the more the opportunites to obtain best individual with fitness score approaching 0 or equal to 0.
Optimal Temporal Decoupling in Task Scheduling with Preferences
Endhoven, L.; Klos, T.B.; Witteveen, C.
2011-01-01
Multi-agent planning and scheduling concerns finding a joint plan to achieve some set of common goals with several independent agents each aiming to find a plan or schedule for their part of the goals. To avoid conflicts in these individual plans or schedules decoupling is used. Such a decoupling
Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports
Directory of Open Access Journals (Sweden)
Jiantong Zhang
2017-01-01
Full Text Available With the development of seaborne logistics, the international trade of goods transported in refrigerated containers is growing fast. Refrigerated containers, also known as reefers, are used in transportation of temperature sensitive cargo, such as perishable fruits. This trend brings new challenges to terminal managers, that is, how to efficiently arrange mechanics to plug and unplug power for the reefers (i.e., tasks at yards. This work investigates the reefer mechanics scheduling problem at container ports. To minimize the sum of the total tardiness of all tasks and the total working distance of all mechanics, we formulate a mathematical model. For the resolution of this problem, we propose a DE algorithm which is combined with efficient heuristics, local search strategies, and parameter adaption scheme. The proposed algorithm is tested and validated through numerical experiments. Computational results demonstrate the effectiveness and efficiency of the proposed algorithm.
Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler
Directory of Open Access Journals (Sweden)
Supriya Raheja
2016-01-01
Full Text Available Fuzzy based CPU scheduler has become of great interest by operating system because of its ability to handle imprecise information associated with task. This paper introduces an extension to the fuzzy based round robin scheduler to a Vague Logic Based Round Robin (VBRR scheduler. VBRR scheduler works on 2-layered framework. At the first layer, scheduler has a vague inference system which has the ability to handle the impreciseness of task using vague logic. At the second layer, Vague Logic Based Round Robin (VBRR scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. An optimum time quantum reduces the overhead on scheduler by reducing the unnecessary context switches which lead to improve the overall performance of system. The work is simulated using MATLAB and compared with the conventional round robin scheduler and the other two fuzzy based approaches to CPU scheduler. Given simulation analysis and results prove the effectiveness and efficiency of VBRR scheduler.
Request-Driven Schedule Automation for the Deep Space Network
Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Call, Jared; Mercado, Marisol
2010-01-01
The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.
PLAN-IT - Scheduling assistant for solar system exploration
International Nuclear Information System (INIS)
Dias, W. C.; Henricks, J. A.; Wong, J. C.; California Institute of Technology, Pasadena)
1987-01-01
A frame-based expert scheduling system shell, PLAN-IT, is developed for spacecraft scheduling in the Request Integration Phase, using the Comet Rendezvous Asteroid Flyby (CRAF) mission as a development base. Basic, structured, and expert scheduling techniques are reviewed. Data elements such as activity representation and resource conflict representation are discussed. Resource constraints include minimum and maximum separation times between activities, percentage of time pointed at specific targets, and separation time between targeted intervals of a given activity. The different scheduling technique categories and the rationale for their selection are also considered. 13 references
Directory of Open Access Journals (Sweden)
Gamal El Afandi
2010-09-01
Full Text Available Irrigation scheduling was used to increase water productivity of wheat (Triticum aestivum L.-maize (Zea mays L. rotation under two climate change scenarios. Three wheat varieties and two maize hybrids were planted at in a 2-yr field experiment. CropSyst model was calibrated and validated for the collected field data, then was used to assess the impact of two climate change scenarios (A2 and B2 and three adaptation strategies (early sowing changing, irrigation schedule and the interaction between them in the year of 2038s. The results revealed that A2 reduced yield more than B2 scenario for both crops. High yield reduction in wheat-maize rotation could be expected under climate change conditions, where wheat and maize yield will be reduced by an average of 41 and 56%, respectively. The most effective adaptation strategy for wheat was sowing 3 wk earlier and irrigation every 21 d, with irrigation water saving and no yield improvement under A2 scenario in both growing seasons. Whereas under B2 scenario yield improvement by 2% occurred with 3% saving in the applied irrigation water in the 1st growing season and in the 2nd growing season yield could improved by 8% with less than 1% increase in the applied irrigation water and higher water productivity. Changing irrigation schedule was an effective adaptation option for maize, where yield improvement could occur under both climate change scenarios in both growing seasons by up to 9% with less than 3% increase in the applied irrigation water and higher water productivity.
Interactive Anticipatory Scheduling for Two Military Applications
National Research Council Canada - National Science Library
Howe, Adele
2003-01-01
...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...
Planning and Scheduling for Environmental Sensor Networks
Frank, J. D.
2005-12-01
Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.
Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok
2018-04-16
Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.
Project Scheduling Based on Risk of Gas Transmission Pipe
Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.
2018-03-01
The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.
Parental work schedules and child overweight and obesity.
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
5 CFR 950.801 - Campaign schedule.
2010-01-01
... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...
A NEW APPROACH TO CLASS SCHEDULING. FINAL REPORT.
CANTER, JOHN; AND OTHERS
AN INVESTIGATION OF THE USE OF A PROTOTYPE DEVICE FOR CLASS SCHEDULING WAS MADE. THE BEEKLEY INSITE DEVICE THAT WAS STUDIED USES THE "PEEK-A-BOO" PRINCIPLE OF MATCHING COMPUTER TAPES. A TEST GROUP OF 149 GRADUATE STUDENTS WAS USED. THEIR DESIRED SCHEDULES WERE MATCHED AUTOMATICALLY AGAINST A PROPOSED MASTER SCHEDULE TO EVALUATE THE…
Unifying practice schedules in the timescales of motor learning and performance.
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.
Recommendations for NRC policy on shift scheduling and overtime at nuclear power plants
Energy Technology Data Exchange (ETDEWEB)
Lewis, P.M.
1985-07-01
This report contains the Pacific Northwest Laboratory's (PNL's) recommendations to the US Nuclear Regulatory Commission (NRC) for an NRC policy on shift scheduling and hours of work (including overtime) for control room operators and other safety-related personnel in nuclear power plants. First, it is recommended that NRC make three additions to its present policy on overtime: (1) limit personnel to 112 hours of work in a 14-day period, 192 hours in 28 days, and 2260 hours in one year; exceeding these limits would require plant manager approval; (2) add a requirement that licensees obtain approval from NRC if plant personnel are expected to exceed 72 hours of work in a 7-day period, 132 hours in 14 days, 228 hours in 28 days, and 2300 hours in one year; and (3) make the policy a requirement, rather than a nonbinding recommendation. Second, it is recommended that licensees be required to obtain NRC approval to adopt a routine 12-hour/day shift schedule. Third, it is recommended that NRC add several nonbinding recommendations concerning routine 8-hour/day schedules. Finally, because additional data can strengthen the basis for future NRC policy on overtime, five methods are suggested for collecting data on overtime and its effects. 44 refs., 10 tabs.
Recommendations for NRC policy on shift scheduling and overtime at nuclear power plants
International Nuclear Information System (INIS)
Lewis, P.M.
1985-07-01
This report contains the Pacific Northwest Laboratory's (PNL's) recommendations to the US Nuclear Regulatory Commission (NRC) for an NRC policy on shift scheduling and hours of work (including overtime) for control room operators and other safety-related personnel in nuclear power plants. First, it is recommended that NRC make three additions to its present policy on overtime: (1) limit personnel to 112 hours of work in a 14-day period, 192 hours in 28 days, and 2260 hours in one year; exceeding these limits would require plant manager approval; (2) add a requirement that licensees obtain approval from NRC if plant personnel are expected to exceed 72 hours of work in a 7-day period, 132 hours in 14 days, 228 hours in 28 days, and 2300 hours in one year; and (3) make the policy a requirement, rather than a nonbinding recommendation. Second, it is recommended that licensees be required to obtain NRC approval to adopt a routine 12-hour/day shift schedule. Third, it is recommended that NRC add several nonbinding recommendations concerning routine 8-hour/day schedules. Finally, because additional data can strengthen the basis for future NRC policy on overtime, five methods are suggested for collecting data on overtime and its effects. 44 refs., 10 tabs
Cost effective shift schedules enhance utility operations
International Nuclear Information System (INIS)
Coleman, R.M.
1995-01-01
This article describes how new shift scheduling concepts can save utility operations millions of dollars every year and yet maintain safety and improve employee morale. The key to scheduling is to define and match the work load. This includes discretionary as well as daily, weekly, and yearly core work loads. In most power plants the overall work load (including maintenance, operations, materials handling, etc.) on day shift is greater than on other shifts, hence an unbalanced schedule would be appropriate
Gain-Scheduled Model Predictive Control of Wind Turbines using Laguerre Functions
DEFF Research Database (Denmark)
Adegas, Fabiano Daher; Wisniewski, Rafal; Larsen, Lars Finn Sloth
2014-01-01
This paper presents a systematic approach to design gain-scheduled predictive controllers for wind turbines. The predictive control law is based on Laguerre functions to parameterize control signals and a parameter-dependent cost function that is analytically determined from turbine data....... These properties facilitate the design of speed controllers by placement of the closed-loop poles (when constraints are not active) and systematic adaptation towards changes in the operating point. Vibration control of undamped modes is achieved by imposing a certain degree of stability to the closed-loop system....... The approach can be utilized to the design of new controllers and to represent existing gain-scheduled controllers as predictive controllers. The numerical example and simulations illustrate the design of a speed controller augmented with active damping of the tower fore-aft displacement....
A New Approach to the Container Positioning Problem
DEFF Research Database (Denmark)
Ahmt, Jonas; Sigtenbjerggaard, Jonas Skott; Lusby, Richard Martin
Programming model that not only improves on earlier attempts at this problem, but also better reflects reality. In particular, the proposed model adopts a preference to reshuffle containers in line with a just-in-time concept, as it is assumed that data is more accurate the closer to a container’s scheduled...... for solving larger instances of the problem. We show that this new formulation drastically outperforms previous attempts at the problem through a direct comparison on instances available in the literature. Furthermore, we also show that the rolling horizon based heuristic can further reduce the solution time......In this paper the Container Positioning Problem is revisited. This problem arises at busy container terminals and requires one to minimize the use of block cranes in handling the containers that must wait at the terminal until their next means of transportation. We propose a new Mixed Integer...
Multiple-Machine Scheduling with Learning Effects and Cooperative Games
Directory of Open Access Journals (Sweden)
Yiyuan Zhou
2015-01-01
Full Text Available Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.
Work Scheduling by Use of Worker Model in Consideration of Learning by On-The-Job Training
Tateno, Toshitake; Shimizu, Keiko
This paper deals with a method of scheduling manual work in consideration of learning by on-the-job training (OJT). In skilled work such as maintenance of trains and airplanes, workers must learn many tasks by OJT. While the work processing time of novice workers is longer than that of experts, the time will be reduced with repeated OJT. Therefore, OJT is important for maintaining the skill level and the long-term work efficiency of an organization. In order to devise a schedule considering OJT, the scheduler must incorporate a management function of workers to trace dynamically changing work experience. In this paper, after the relationship between scheduling problems and worker management problems is defined, a simulation method, in which a worker model and an agent-based mechanism are utilized, is proposed to derive the optimal OJT strategy toward high long-term performance. Finally, we present some case studies showing the effectiveness of OJT planning based on the simulation.
State Teacher Salary Schedules. Policy Analysis
Griffith, Michael
2016-01-01
In the United States most teacher compensation issues are decided at the school district level. However, a group of states have chosen to play a role in teacher pay decisions by instituting statewide teacher salary schedules. Education Commission of the States has found that 17 states currently make use of teacher salary schedules. This education…
Cost-efficient scheduling of FAST observations
Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi
2018-03-01
A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.
Ma, Chao; Liu, Yan; Tang, Jihai; Jia, Haimei; Qin, Wei; Su, Ying; Wang, Huaqing; Hao, Lixin
2018-01-29
China has used 3 different mumps-containing vaccines (MuCV) since 1990: monovalent mumps vaccine, measles-mumps (MM) vaccine, and measles-mumps-rubella (MMR) vaccine, and one dose MuCV (using MMR at 18 months) has been included in the EPI since 2007. MuCV effectiveness has been of concern following large-scale mumps outbreaks. In 2015, an outbreak of mumps occurred in a primary school, which allow us assess vaccine effectiveness of different MuCVs. All children in the school were studied as a retrospective cohort. Vaccination histories and case information were obtained from vaccination records and clinic/hospital logs. Parental questionnaires were used to confirm students' illnesses and calculate attack rate (AR). VE was assessed using the formula, VE = (AR in unvaccinated students- AR in the vaccinated students) / (AR in unvaccinated students). VEs of different type of MuCV were compared. In total, 283 students were identified as clinical mumps among the 2370 students, and 1908 students were included for MuCV VE assessment. 213 (including 21 [8.9%] patients) were 2-dose MuCV recipients (AR: 9.9%), 1165 (including 123 [51.9%] patients) were 1-dose recipients (AR: 10.6%), and 530 (including 93 [39.2%] patients) were unvaccinated (AR: 17.5%). VE was 44% for 2 doses and 40% for one dose. For one-MuCV-dose students, estimated mumps VE was 63% for vaccinated within 3 years (between vaccination and this outbreak); 50% for vaccinated within 3 to 5 years; and 34% for vaccinated more than 5 years. Comparing VE by vaccine type and 5-year interval since vaccination, VE for MMR was 60%, which was consistently higher than VE for monovalent mumps vaccine (22%) and MM (2%). This outbreak was associated with low and declining 1-dose MuCV effectiveness. China's immunization program should evaluate the potential of a 2-dose MMR schedule to adequately control mumps.
Schedulability of Herschel revisited using statistical model checking
DEFF Research Database (Denmark)
David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel
2015-01-01
-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...... and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...
Trewin, Brendan J; Kay, Brian H; Darbro, Jonathan M; Hurst, Tim P
2013-12-01
Extended drought conditions in south-east Queensland during the early 2000s have resulted in a culture of water harvesting and legislated water restrictions. Aedes notoscriptus is a container-breeding mosquito vector of Ross River and Barmah Forest viruses. From 2008-2009, the larval habitats and seasonal abundance of domestic container-breeding mosquitoes were recorded from three suburbs of Brisbane. A knowledge, attitudes and practice questionnaire was administered to householders. A low-cost, desktop methodology was used to predict the proportion of shaded premises compared with front-of-property estimates. We highlight changes in the frequency of container categories for A. notoscriptus as a response to human behavioural changes to drought. Garden accoutrements, discarded household items and water storage containers accounted for 66.2% (525/793) of positive containers and 77.5% (73 441/94 731) of all immature mosquitoes. Of all household premises surveyed, 52.6% (550/1046) contained rainwater tanks and 29.4% (308/1046) harvested water in other containers, contrasting with a previous 1995 survey where neither category was observed. Both Premise Condition Index and shade directly correlated with positive premises. Human response to drought has resulted in new habitats for domestic container-breeding mosquitoes. This recent trend of prolific water storage is similar to earlier years (1904-1943) in Brisbane when Aedes aegypti was present and dengue epidemics occurred.
The Synthesis of a Hardware Scheduler for Non-Manifest Loops
Mansour, O.; Molenkamp, Egbert; Krol, Th.
This paper addresses the hardware implementation of a dynamic scheduler for non-manifest data dependent periodic loops. Static scheduling techniques which are known to give near optimal scheduling-solutions for manifest loops, fail at scheduling non-manifest loops, since they lack the run time
Response-reinforcer dependency and resistance to change.
Cançado, Carlos R X; Abreu-Rodrigues, Josele; Aló, Raquel Moreira; Hauck, Flávia; Doughty, Adam H
2018-01-01
The effects of the response-reinforcer dependency on resistance to change were studied in three experiments with rats. In Experiment 1, lever pressing produced reinforcers at similar rates after variable interreinforcer intervals in each component of a two-component multiple schedule. Across conditions, in the fixed component, all reinforcers were response-dependent; in the alternative component, the percentage of response-dependent reinforcers was 100, 50 (i.e., 50% response-dependent and 50% response-independent) or 10% (i.e., 10% response-dependent and 90% response-independent). Resistance to extinction was greater in the alternative than in the fixed component when the dependency in the former was 10%, but was similar between components when this dependency was 100 or 50%. In Experiment 2, a three-component multiple schedule was used. The dependency was 100% in one component and 10% in the other two. The 10% components differed on how reinforcers were programmed. In one component, as in Experiment 1, a reinforcer had to be collected before the scheduling of other response-dependent or independent reinforcers. In the other component, response-dependent and -independent reinforcers were programmed by superimposing a variable-time schedule on an independent variable-interval schedule. Regardless of the procedure used to program the dependency, resistance to extinction was greater in the 10% components than in the 100% component. These results were replicated in Experiment 3 in which, instead of extinction, VT schedules replaced the baseline schedules in each multiple-schedule component during the test. We argue that the relative change in dependency from Baseline to Test, which is greater when baseline dependencies are high rather than low, could account for the differential resistance to change in the present experiments. The inconsistencies in results across the present and previous experiments suggest that the effects of dependency on resistance to change are
Multiresource allocation and scheduling for periodic soft real-time applications
Gopalan, Kartik; Chiueh, Tzi-cker
2001-12-01
Real-time applications that utilize multiple system resources, such as CPU, disks, and network links, require coordinated scheduling of these resources in order to meet their end-to-end performance requirements. Most state-of-the-art operating systems support independent resource allocation and deadline-driven scheduling but lack coordination among multiple heterogeneous resources. This paper describes the design and implementation of an Integrated Real-time Resource Scheduler (IRS) that performs coordinated allocation and scheduling of multiple heterogeneous resources on the same machine for periodic soft real-time application. The principal feature of IRS is a heuristic multi-resource allocation algorithm that reserves multiple resources for real-time applications in a manner that can maximize the number of applications admitted into the system in the long run. At run-time, a global scheduler dispatches the tasks of the soft real-time application to individual resource schedulers according to the precedence constraints between tasks. The individual resource schedulers, which could be any deadline based schedulers, can make scheduling decisions locally and yet collectively satisfy a real-time application's performance requirements. The tightness of overall timing guarantees is ultimately determined by the properties of individual resource schedulers. However, IRS maximizes overall system resource utilization efficiency by coordinating deadline assignment across multiple tasks in a soft real-time application.
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH
Directory of Open Access Journals (Sweden)
Sukho Oh
2018-04-01
Full Text Available Time Slotted Channel Hopping (TSCH is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.
Distributed Research Project Scheduling Based on Multi-Agent Methods
Directory of Open Access Journals (Sweden)
Constanta Nicoleta Bodea
2011-01-01
Full Text Available Different project planning and scheduling approaches have been developed. The Operational Research (OR provides two major planning techniques: CPM (Critical Path Method and PERT (Program Evaluation and Review Technique. Due to projects complexity and difficulty to use classical methods, new approaches were developed. Artificial Intelligence (AI initially promoted the automatic planner concept, but model-based planning and scheduling methods emerged later on. The paper adresses the project scheduling optimization problem, when projects are seen as Complex Adaptive Systems (CAS. Taken into consideration two different approaches for project scheduling optimization: TCPSP (Time- Constrained Project Scheduling and RCPSP (Resource-Constrained Project Scheduling, the paper focuses on a multiagent implementation in MATLAB for TCSP. Using the research project as a case study, the paper includes a comparison between two multi-agent methods: Genetic Algorithm (GA and Ant Colony Algorithm (ACO.
Construction schedules slack time minimizing
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.
PHENIX Work Breakdown Structure. Cost and schedule review copy
Energy Technology Data Exchange (ETDEWEB)
1994-02-01
The Work Breakdown Structure (WBS) Book begins with this Overview section, which contains the high-level summary cost estimate, the cost profile, and the global construction schedule. The summary cost estimate shows the total US cost and the cost in terms of PHENIX construction funds for building the PHENIX detector. All costs in the WBS book are shown in FY 1993 dollars. Also shown are the institutional and foreign contributions, the level of pre-operations funding, and the cost of deferred items. Pie charts are presented at PHENIX WBS level 1 and 2 that show this information. The PHENIX construction funds are shown broken down to PHENIX WBS level 3 items per fiscal year, and the resulting profile is compared to the RHIC target profile. An accumulated difference of the two profiles is also shown. The PHENIX global construction schedule is presented at the end of the Overview section. Following the Overview are sections for each subsystem. Each subsystem section begins with a summary cost estimate, cost profile, and critical path. The total level 3 cost is broken down into fixed costs (M&S), engineering costs (EDIA) and labor costs. Costs are further broken down in terms of PHENIX construction funds, institutional and foreign contributions, pre-operations funding, and deferred items. Also shown is the contingency at level 3 and the level 4 breakdown of the total cost. The cost profile in fiscal years is shown at level 3. The subsystem summaries are followed by the full cost estimate and schedule sheets for that subsystem. These detailed sheets are typically carried down to level 7 or 8. The cost estimate shows Total, M&S, EDIA, and Labor breakdowns, as well as contingency, for each WBS entry.
Efficient Load Scheduling Method For Power Management
Directory of Open Access Journals (Sweden)
Vijo M Joy
2015-08-01
Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.
Courts, Scheduled Damages, and Medical Malpractice Insurance
DEFF Research Database (Denmark)
Bertoli, Paola; Grembi, Veronica
We assess the impact of the introduction of schedules of non-economic damages (i.e. tiered caps systems) on the behavior of insurers operating in the medical liability market for hospitals while controlling the performance of the judicial system, measured as court backlog. Using a difference......-in-differences strategy on Italian data, we find that the introduction of schedules increases the presence of insurers (i.e. medical liability market attractiveness) only in inefficient judicial districts. In the same way, court inefficiency is attractive to insurers for average values of schedules penetration...... of the market, with an increasing positive impact of inefficiency as the territorial coverage of schedules increases. Finally, no significant impact is registered on paid premiums. Our analysis sheds light on a complex set of elements affecting the decisions of insurers in malpractice markets. The analysis...
Using a best-practice perioperative governance structure to implement better block scheduling.
Heiser, Randy
2013-01-01
Achieving, developing, and maintaining a well-functioning OR scheduling system requires a well-designed perioperative governance structure. Traditional OR/surgery committees, consisting mainly of surgeons, have tried to provide this function but often have not succeeded. An OR governance model should be led by an OR executive committee that functions as a board of directors for the surgery program and works closely with the surgery department medical director and an OR advisory committee. Ideally, the OR executive committee should develop a block schedule that includes a mix of block, open, and urgent or emergent OR access, because this combination is most effective for improving OR use and adapting to changes in surgical procedure volume. Copyright © 2013 AORN, Inc. Published by Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
T. K. Jana
2015-09-01
Full Text Available There is an ever increasing need of providing quick, yet improved solution to dynamic scheduling by better responsiveness following simple coordination mechanism to better adapt to the changing environments. In this endeavor, a cognitive agent based approach is proposed to deal with machine failure. A Multi Agent based Holonic Adaptive Scheduling (MAHoAS architecture is developed to frame the schedule by explicit communication between the product holons and the resource holons in association with the integrated process planning and scheduling (IPPS holon under normal situation. In the event of breakdown of a resource, the cooperation is sought by implicit communication. Inspired by the cognitive behavior of human being, a cognitive decision making scheme is proposed that reallocates the incomplete task to another resource in the most optimized manner and tries to expedite the processing in view of machine failure. A metamorphic algorithm is developed and implemented in Oracle 9i to identify the best candidate resource for task re-allocation. Integrated approach to process planning and scheduling realized under Multi Agent System (MAS framework facilitates dynamic scheduling with improved performance under such situations. The responsiveness of the resources having cognitive capabilities helps to overcome the adverse consequences of resource failure in a better way.
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.
PLACEMENT APPLICATIONS SCHEDULING LECTURE IN INTERNATIONAL PROGRAM UNIKOM BASED ANDROID
Directory of Open Access Journals (Sweden)
Andri Sahata Sitanggang
2017-12-01
Full Text Available One who determines life of a classroom namely mapping scheduling courses especially at college. The process scheduling has included time or schedule of a class of available, room available, lecture who is scheduled for, and schedule for lecturer going to teach. Hopefully with a scheduling it will facilitate the students and teachers in obtaining information lecture schedule. With the emergence of the android application ( is implanted in mobile phones , the public can now use the internet so fast that is based .So with that researchers give one a technology based solutions to build android application .This is because one of the technology has given the functions which may make it easier for students and university lecturers in terms of access to information. In building this application used method of the prototype consisting 2 access namely access user and admin , where module user consisting of modules register , login , scheduling module , while for admin given module login , register and arrangement information scheduling courses both the administration and lecturers .Application made will be integrated with internet so that this program is real-time application.
Gain Scheduling for the Orion Launch Abort Vehicle Controller
McNamara, Sara J.; Restrepo, Carolina I.; Madsen, Jennifer M.; Medina, Edgar A.; Proud, Ryan W.; Whitley, Ryan J.
2011-01-01
One of NASAs challenges for the Orion vehicle is the control system design for the Launch Abort Vehicle (LAV), which is required to abort safely at any time during the atmospheric ascent portion of ight. The focus of this paper is the gain design and scheduling process for a controller that covers the wide range of vehicle configurations and flight conditions experienced during the full envelope of potential abort trajectories from the pad to exo-atmospheric flight. Several factors are taken into account in the automation process for tuning the gains including the abort effectors, the environmental changes and the autopilot modes. Gain scheduling is accomplished using a linear quadratic regulator (LQR) approach for the decoupled, simplified linear model throughout the operational envelope in time, altitude and Mach number. The derived gains are then implemented into the full linear model for controller requirement validation. Finally, the gains are tested and evaluated in a non-linear simulation using the vehicles ight software to ensure performance requirements are met. An overview of the LAV controller design and a description of the linear plant models are presented. Examples of the most significant challenges with the automation of the gain tuning process are then discussed. In conclusion, the paper will consider the lessons learned through out the process, especially in regards to automation, and examine the usefulness of the gain scheduling tool and process developed as applicable to non-Orion vehicles.
ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS
Directory of Open Access Journals (Sweden)
Alexey S. Dobrynin
2014-01-01
Full Text Available Tasks of time-schedule construction (JSSP in various fields of human activities have an important theoretical and practical significance. The main feature of these tasks is a timing requirement, describing allowed planning time periods and periods of downtime. This article describes implementation variations of the work scheduling algorithm under timing requirements for the tasks of industrial time-schedules construction, and service activities.
Tail-robust scheduling using Limited Processor Sharing.
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
International Nuclear Information System (INIS)
Kim, Dong Yun; Seong, Poong Hyun
1996-01-01
In this study, we proposed a fuzzy gain scheduler with intelligent learning algorithm for a reactor control. In the proposed algorithm, we used the gradient descent method to learn the rule bases of a fuzzy algorithm. These rule bases are learned toward minimizing an objective function, which is called a performance cost function. The objective of fuzzy gain scheduler with intelligent learning algorithm is the generation of adequate gains, which minimize the error of system. The condition of every plant is generally changed as time gose. That is, the initial gains obtained through the analysis of system are no longer suitable for the changed plant. And we need to set new gains, which minimize the error stemmed from changing the condition of a plant. In this paper, we applied this strategy for reactor control of nuclear power plant (NPP), and the results were compared with those of a simple PI controller, which has fixed gains. As a result, it was shown that the proposed algorithm was superior to the simple PI controller
DEFF Research Database (Denmark)
Andersson, Niclas; Christensen, Knud
on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...
Designing a fuzzy scheduler for hard real-time systems
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.
Common project energy change. The schedule to the success
International Nuclear Information System (INIS)
Bartosch, Ulrich; Hennicke, Peter; Weiger, Hubert
2014-01-01
The energy change is the most important common work of the German after-war history. And it offers a unique collective field of learning, how the socio-ecological transformation can be converted in practice. If the energy change succeeds in an industrial country like Germany, many other countries can follow this example. The Bund fuer Umwelt und Naturschutz Deutschland (BUND) and the Vereinigung Deutscher Wissenschaftler (VDW) show as editors, what now must be done in order that the energy change becomes a success. Because currently threatens the energy change to be slowed down by the policy and talked to death by many stakeholders in the industry. This book demonstrates why the energy change is necessary and how it can succeed. It shows what has to be done and wants to use the existing enthusiasm in order to lead the common project energy change jointly to success. What is needed is a long-term policy that finally takes the reduction of energy consumption in attack.