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

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

Science.gov (United States)

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

2018-02-09

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

Self-scheduling and bidding strategies of thermal units with stochastic emission constraints

International Nuclear Information System (INIS)

Laia, R.; Pousinho, H.M.I.; Melíco, R.; Mendes, V.M.F.

2015-01-01

Highlights: • The management of thermal power plants is considered for different emission allowance levels. • The uncertainty on electricity price is considered by a set of scenarios. • A stochastic MILP approach allows devising the bidding strategies and hedging against price uncertainty and emission allowances. - Abstract: This paper is on the self-scheduling problem for a thermal power producer taking part in a pool-based electricity market as a price-taker, having bilateral contracts and emission-constrained. An approach based on stochastic mixed-integer linear programming approach is proposed for solving the self-scheduling problem. Uncertainty regarding electricity price is considered through a set of scenarios computed by simulation and scenario-reduction. Thermal units are modelled by variable costs, start-up costs and technical operating constraints, such as: forbidden operating zones, ramp up/down limits and minimum up/down time limits. A requirement on emission allowances to mitigate carbon footprint is modelled by a stochastic constraint. Supply functions for different emission allowance levels are accessed in order to establish the optimal bidding strategy. A case study is presented to illustrate the usefulness and the proficiency of the proposed approach in supporting biding strategies

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

Science.gov (United States)

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

2018-02-09

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

Distributed continuous energy scheduling for dynamic virtual power plants

International Nuclear Information System (INIS)

Niesse, Astrid

2015-01-01

This thesis presents DynaSCOPE as distributed control method for continuous energy scheduling for dynamic virtual power plants (DVPP). DVPPs aggregate the flexibility of distributed energy units to address current energy markets. As an extension of the Virtual Power Plant concept they show high dynamics in aggregation and operation of energy units. Whereas operation schedules are set up for all energy units in a day-ahead planning procedure, incidents may render these schedules infeasible during execution, like deviation from prognoses or outages. Thus, a continuous scheduling process is needed to ensure product fulfillment. With DynaSCOPE, software agents representing single energy units solve this problem in a completely distributed heuristic approach. Using a stepped concept, several damping mechanisms are applied to allow minimum disturbance while continuously trying to fulfill the product as contracted at the market.

Comparison of 2-Dose and 3-Dose 9-Valent Human Papillomavirus Vaccine Schedules in the United States: A Cost-effectiveness Analysis.

Science.gov (United States)

Laprise, Jean-François; Markowitz, Lauri E; Chesson, Harrell W; Drolet, Mélanie; Brisson, Marc

2016-09-01

A recent clinical trial using the 9-valent human papillomavirus virus (HPV) vaccine has shown that antibody responses after 2 doses are noninferior to those after 3 doses, suggesting that 2 and 3 doses may have comparable vaccine efficacy. We used an individual-based transmission-dynamic model to compare the population-level effectiveness and cost-effectiveness of 2- and 3-dose schedules of 9-valent HPV vaccine in the United States. Our model predicts that if 2 doses of 9-valent vaccine protect for ≥20 years, the additional benefits of a 3-dose schedule are small as compared to those of 2-dose schedules, and 2-dose schedules are likely much more cost-efficient than 3-dose schedules. © The Author 2016. Published by Oxford University Press for the Infectious Diseases Society of America. All rights reserved. For permissions, e-mail journals.permissions@oup.com.

46 CFR 525.2 - Terminal schedules.

Science.gov (United States)

2010-10-01

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

Interprovider Communication Using a Scheduled Provider Alert-Response Communication System in 3 Inpatient Neurology Units.

Science.gov (United States)

Siegler, James E; Finegan, Dan; Kasner, Scott E; Price, Raymond S

2017-10-01

Nonemergent communications between nursing staff and residents often occur randomly throughout the workday at teaching institutions, resulting in inefficiency and interruptions of scheduled resident educational conferences or periods of overnight rest. The aim of this study was to determine whether a quality improvement communication strategy can reduce interruptive notifications during scheduled resident didactic sessions. We conducted a prospective, mixed-methods trial of a communication strategy between nurses and residents in 3 neurology units of an academic institution. We measured content and volume of notifications from nurses to residents during scheduled conferences and overnight and categorized these notifications according to levels of urgency. We implemented an intervention requiring multidisciplinary evening work rounds between the on-call resident and charge nurse and batching of nonemergent communications. Survey data were collected. The total census during the 6-month study period was 728 patients. Of the 704 resident-reported nursing notifications, 50% could be safely deferred until change of shift. After the intervention, there was a 52% decrement of notifications (0.52 vs 0.25 notifications per patient, P communication system reduced interruptive calls during educational conferences and overnight by half. This intervention was perceived as safe and effective and resulted in higher satisfaction among participants.

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

Optimal load scheduling in commercial and residential microgrids

Science.gov (United States)

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.

A General State-Space Formulation for Online Scheduling

Directory of Open Access Journals (Sweden)

Dhruv Gupta

2017-11-01

Full Text Available We present a generalized state-space model formulation particularly motivated by an online scheduling perspective, which allows modeling (1 task-delays and unit breakdowns; (2 fractional delays and unit downtimes, when using discrete-time grid; (3 variable batch-sizes; (4 robust scheduling through the use of conservative yield estimates and processing times; (5 feedback on task-yield estimates before the task finishes; (6 task termination during its execution; (7 post-production storage of material in unit; and (8 unit capacity degradation and maintenance. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings. Finally, we demonstrate the effectiveness of this model on a case study from the field of bio-manufacturing.

Developing an efficient scheduling template of a chemotherapy treatment unit: A case study.

Science.gov (United States)

Ahmed, Z; Elmekkawy, Ty; Bates, S

2011-01-01

This study was undertaken to improve the performance of a Chemotherapy Treatment Unit by increasing the throughput and reducing the average patient's waiting time. In order to achieve this objective, a scheduling template has been built. The scheduling template is a simple tool that can be used to schedule patients' arrival to the clinic. A simulation model of this system was built and several scenarios, that target match the arrival pattern of the patients and resources availability, were designed and evaluated. After performing detailed analysis, one scenario provide the best system's performance. A scheduling template has been developed based on this scenario. After implementing the new scheduling template, 22.5% more patients can be served. 1. CancerCare Manitoba is a provincially mandated cancer care agency. It is dedicated to provide quality care to those who have been diagnosed and are living with cancer. MacCharles Chemotherapy unit is specially built to provide chemotherapy treatment to the cancer patients of Winnipeg. In order to maintain an excellent service, it tries to ensure that patients get their treatment in a timely manner. It is challenging to maintain that goal because of the lack of a proper roster, the workload distribution and inefficient resource allotment. In order to maintain the satisfaction of the patients and the healthcare providers, by serving the maximum number of patients in a timely manner, it is necessary to develop an efficient scheduling template that matches the required demand with the availability of resources. This goal can be reached using simulation modelling. Simulation has proven to be an excellent modelling tool. It can be defined as building computer models that represent real world or hypothetical systems, and hence experimenting with these models to study system behaviour under different scenarios.1, 2 A study was undertaken at the Children's Hospital of Eastern Ontario to identify the issues behind the long waiting

State Teacher Salary Schedules. Policy Analysis

Science.gov (United States)

Griffith, Michael

2016-01-01

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

Optimal Algorithms and a PTAS for Cost-Aware Scheduling

NARCIS (Netherlands)

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

2015-01-01

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

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

Components installation. Scheduling techniques applied at Framatome for the French nuclear program

International Nuclear Information System (INIS)

Cremese, G.

1982-09-01

The first scheduling objective is a timely delivery of heavy components manufactured by FRAMATOME factories: reactor vessel, steam generators and pressurizer. The second scheduling function is the preparation and updating of overall and detailed schedules for the coordination and follow-up of: design activities, progress at equipment suppliers, construction and erection activities of sub-contractors, test and start-up tasks by FRAMATOME and customer teams, and maintenance operations by FRAMATOME teams. I shall first describe the schedules for the contract first unit then show how the following units of the contract are scheduled in their turn

14 CFR 375.50 - Transit flights; scheduled international air service operations.

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Transit flights; scheduled international... WITHIN THE UNITED STATES Transit Flights § 375.50 Transit flights; scheduled international air service... to the International Air Services Transit Agreement in transit across the United States may not be...

Thermal Unit Commitment Scheduling Problem in Utility System by Tabu Search Embedded Genetic Algorithm Method

Directory of Open Access Journals (Sweden)

C. Christober Asir Rajan

2008-06-01

Full Text Available The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal unit commitment in the power system for the next H hours. A 66-bus utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 24, 57 and 175 buses. Numerical results are shown comparing the cost solutions and computation time obtained by different intelligence and conventional methods.

12 CFR 404.9 - Schedule of fees.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Schedule of fees. 404.9 Section 404.9 Banks and Banking EXPORT-IMPORT BANK OF THE UNITED STATES INFORMATION DISCLOSURE Procedures for Disclosure of Records Under the Freedom of Information Act. § 404.9 Schedule of fees. (a) General. Ex-Im Bank shall...

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

12 CFR 404.16 - Schedule of fees.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Schedule of fees. 404.16 Section 404.16 Banks and Banking EXPORT-IMPORT BANK OF THE UNITED STATES INFORMATION DISCLOSURE Access to Records Under the Privacy Act of 1974 § 404.16 Schedule of fees. (a) Search and review. Ex-Im Bank shall not charge for...

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

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.

31 CFR 223.14 - Schedules of single risks.

Science.gov (United States)

2010-07-01

... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Schedules of single risks. 223.14 Section 223.14 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL... UNITED STATES § 223.14 Schedules of single risks. During the months of January, April, July, and October...

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

Science.gov (United States)

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

2016-08-01

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

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

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

2013-01-01

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

Time-constrained project scheduling with adjacent resources

NARCIS (Netherlands)

Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

Time-constrained project scheduling with adjacent resources

NARCIS (Netherlands)

Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

2008-01-01

We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

Harmonized Tariff Schedule of the United States (2015) - Revision 1

Data.gov (United States)

US International Trade Commission — This dataset is the 2015 Harmonized Tariff Schedule Revision 1 effective July 1, 2015. It provides the applicable tariff rates and statistical categories for all...

Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

Science.gov (United States)

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

2016-02-01

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

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

Scheduling of head-dependent cascaded reservoirs considering discharge ramping constraints and start/stop of units

Energy Technology Data Exchange (ETDEWEB)

Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)

2010-10-15

This paper is on the problem of short-term hydro scheduling (STHS), particularly concerning head-dependent reservoirs under competitive environment. We propose a novel method, based on mixed-integer nonlinear programming (MINLP), for optimising power generation efficiency. This method considers hydroelectric power generation as a nonlinear function of water discharge and of the head. The main contribution of this paper is that discharge ramping constraints and start/stop of units are also considered, in order to obtain more realistic and feasible results. The proposed method has been applied successfully to solve two case studies based on Portuguese cascaded hydro systems, providing a higher profit at an acceptable computation time in comparison with classical optimisation methods based on mixed-integer linear programming (MILP). (author)

Sensor Transmission Power Schedule for Smart Grids

Science.gov (United States)

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

2017-11-01

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

Preventive Maintenance Scheduling for Multicogeneration Plants with Production Constraints Using Genetic Algorithms

Directory of Open Access Journals (Sweden)

Khaled Alhamad

2015-01-01

Full Text Available This paper describes a method developed to schedule the preventive maintenance tasks of the generation and desalination units in separate and linked cogeneration plants provided that all the necessary maintenance and production constraints are satisfied. The proposed methodology is used to generate two preventing maintenance schedules, one for electricity and the other for distiller. Two types of crossover operators were adopted, 2-point and 4-point. The objective function of the model is to maximize the available number of operational units in each plant. The results obtained were satisfying the problem parameters. However, 4-point slightly produce better solution than 2-point ones for both electricity and water distiller. The performance as well as the effectiveness of the genetic algorithm in solving preventive maintenance scheduling is applied and tested on a real system of 21 units for electricity and 21 units for water. The results presented here show a great potential for utility applications for effective energy management over a time horizon of 52 weeks. The model presented is an effective decision tool that optimizes the solution of the maintenance scheduling problem for cogeneration plants under maintenance and production constraints.

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

Science.gov (United States)

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

2015-03-17

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

Improved merit order and augmented Lagrange Hopfield network for short term hydrothermal scheduling

International Nuclear Information System (INIS)

Vo Ngoc Dieu; Ongsakul, Weerakorn

2009-01-01

This paper proposes an improved merit order (IMO) combined with an augmented Lagrangian Hopfield network (ALHN) for solving short term hydrothermal scheduling (HTS) with pumped-storage hydro plants. The proposed IMO-ALHN consists of a merit order based on the average production cost of generating units enhanced by heuristic search algorithm for finding unit scheduling and a continuous Hopfield neural network with its energy function based on augmented Lagrangian relaxation for solving constrained economic dispatch (CED). The proposed method is applied to solve the HTS problem in five stages including thermal, hydro and pumped-storage unit commitment by IMO and heuristic search, constraint violations repairing by heuristic search and CED by ALHN. The proposed method is tested on the 24-bus IEEE RTS with 32 units including 4 fuel-constrained, 4-hydro, and 2 pumped-storage units scheduled over a 24-h period. Test results indicate that the proposed IMO-ALHN is efficient for hydrothermal systems with various constraints.

12 CFR 407.3 - Procedures applicable to regularly scheduled meetings.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Procedures applicable to regularly scheduled meetings. 407.3 Section 407.3 Banks and Banking EXPORT-IMPORT BANK OF THE UNITED STATES REGULATIONS GOVERNING PUBLIC OBSERVATION OF EX-IM BANK MEETINGS § 407.3 Procedures applicable to regularly scheduled...

Location-based Scheduling

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

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

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

Science.gov (United States)

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

2015-01-01

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

Future aircraft networks and schedules

Science.gov (United States)

Shu, Yan

2011-07-01

Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

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

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

International Nuclear Information System (INIS)

Derrickson, W.B.

1984-01-01

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

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

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

1998-01-01

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

21 CFR 1308.15 - Schedule V.

Science.gov (United States)

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

76 FR 6635 - Records Schedules; Availability and Request for Comments

Science.gov (United States)

2011-02-07

...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

75 FR 8751 - Records Schedules; Availability and Request for Comments

Science.gov (United States)

2010-02-25

...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

75 FR 11200 - Records Schedules; Availability and Request for Comments

Science.gov (United States)

2010-03-10

...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML..., this public notice lists the organizational unit(s) accumulating the records or indicates agency- wide...

76 FR 22924 - Records Schedules; Availability and Request for Comments

Science.gov (United States)

2011-04-25

...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

Optimizing Fire Department Operations Through Work Schedule Analysis, Alternative Staffing, and Nonproductive Time Reduction

Science.gov (United States)

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

Hydrothermal self-scheduling problem in a day-ahead electricity market

International Nuclear Information System (INIS)

Bisanovic, Smajo; Dlakic, Muris; Hajro, Mensur

2008-01-01

This paper addresses the self-scheduling problem of determining the unit commitment status for power generation companies before submitting the hourly bids in a day-ahead market. The hydrothermal model is formulated as a deterministic optimization problem where expected profit is maximized using the 0/1 mixed-integer linear programming technique. This approach allows precise modelling of non-convex variable cost functions and non-linear start-up cost functions of thermal units, non-concave power-discharge characteristics of hydro units, ramp rate limits of thermal units and minimum up and down time constraints for both hydro and thermal units. Model incorporates long-term bilateral contracts with contracted power and price patterns, as well as forecasted market hourly prices for day-ahead auction. Solution is achieved using the homogeneous interior point method for linear programming as state of the art technique, with a branch and bound optimizer for integer programming. The effectiveness of the proposed model in optimizing the generation schedule is demonstrated through the case studies and their analysis. (author)

Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

Science.gov (United States)

Jin, Junchen

2016-01-01

The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality. PMID:27436998

Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

Directory of Open Access Journals (Sweden)

Jiaxi Wang

2016-01-01

Full Text Available The shunting schedule of electric multiple units depot (SSED is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality.

20 CFR 25.202 - How is the Special Schedule applied for Japanese seamen?

Science.gov (United States)

2010-04-01

... Japanese seamen? 25.202 Section 25.202 Employees' Benefits OFFICE OF WORKERS' COMPENSATION PROGRAMS... How is the Special Schedule applied for Japanese seamen? (a) The special schedule of compensation... United States or Canada by direct-hire Japanese seamen who are neither citizens nor residents of the...

Surgical scheduling: a lean approach to process improvement.

Science.gov (United States)

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.

Optimal scheduling of coproduction with a storage

International Nuclear Information System (INIS)

Ravn, H.F.; Rygard, J.M.

1993-02-01

We consider the problem of optimal scheduling of a system with combined heat and heat (CHP) units and a heat storege. The purpose of the heat storage is to permit a partial decoupling of the variations in the demand for heat and electrical power. We formulate the problem of optimal scheduling as that of minimizing the total costs over the planning period. The heat demand from the district heating system and the ''shadow prices'' for the electrical power system are taken as externally given parameters. The resulting model is solved by dynamic programming. We describe implementation details and we give examples of result of the optimization. (au) (12 refs.)

Parental nonstandard work schedules during infancy and children's BMI trajectories

Directory of Open Access Journals (Sweden)

Afshin Zilanawala

2017-09-01

Full Text Available Background: Empirical evidence has demonstrated adverse associations between parental nonstandard work schedules (i.e., evenings, nights, or weekends and child developmental outcomes. However, there are mixed findings concerning the relationship between parental nonstandard employment and children's body mass index (BMI, and few studies have incorporated information on paternal work schedules. Objective: This paper investigated BMI trajectories from early to middle childhood (ages 3-11 by parental work schedules at 9 months of age, using nationally representative cohort data from the United Kingdom. This study is the first to examine the link between nonstandard work schedules and children's BMI in the United Kingdom. Methods: We used data from the Millennium Cohort Study (2001‒2013, n = 13,021 to estimate trajectories in BMI, using data from ages 3, 5, 7, and 11 years. Joint parental work schedules and a range of biological, socioeconomic, and psychosocial covariates were assessed in the initial interviews at 9 months. Results: Compared to children in two-parent families where parents worked standard shifts, we found steeper BMI growth trajectories for children in two-parent families where both parents worked nonstandard shifts and children in single-parent families whose mothers worked a standard shift. Fathers' shift work, compared to standard shifts, was independently associated with significant increases in BMI. Conclusions: Future public health initiatives focused on reducing the risk of rapid BMI gain in childhood can potentially consider the disruptions to family processes resulting from working nonstandard hours. Contribution: Children in families in which both parents work nonstandard schedules had steeper BMI growth trajectories across the first decade of life. Fathers' nonstandard shifts were independently associated with increases in BMI.

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

Energy Technology Data Exchange (ETDEWEB)

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

1986-08-01

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

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

Directory of Open Access Journals (Sweden)

Mihai-Victor Micea

2017-06-01

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

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

Science.gov (United States)

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

2017-06-26

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

Stochastic risk-averse coordinated scheduling of grid integrated energy storage units in transmission constrained wind-thermal systems within a conditional value-at-risk framework

International Nuclear Information System (INIS)

Hemmati, Reza; Saboori, Hedayat; Saboori, Saeid

2016-01-01

In recent decades, wind power resources have been integrated in the power systems increasingly. Besides confirmed benefits, utilization of large share of this volatile source in power generation portfolio has been faced system operators with new challenges in terms of uncertainty management. It is proved that energy storage systems are capable to handle projected uncertainty concerns. Risk-neutral methods have been proposed in the previous literature to schedule storage units considering wind resources uncertainty. Ignoring risk of the cost distributions with non-desirable properties may result in experiencing high costs in some unfavorable scenarios with high probability. In order to control the risk of the operator decisions, this paper proposes a new risk-constrained two-stage stochastic programming model to make optimal decisions on energy storage and thermal units in a transmission constrained hybrid wind-thermal power system. Risk-aversion procedure is explicitly formulated using the conditional value-at-risk measure, because of possessing distinguished features compared to the other risk measures. The proposed model is a mixed integer linear programming considering transmission network, thermal unit dynamics, and storage devices constraints. The simulations results demonstrate that taking the risk of the problem into account will affect scheduling decisions considerably depend on the level of the risk-aversion. - Highlights: • Risk of the operation decisions is handled by using risk-averse programming. • Conditional value-at-risk is used as risk measure. • Optimal risk level is obtained based on the cost/benefit analysis. • The proposed model is a two-stage stochastic mixed integer linear programming. • The unit commitment is integrated with ESSs and wind power penetration.

FOREST HARVEST SCHEDULING PLAN INTEGRATED TO THE ROAD NETWORK

Directory of Open Access Journals (Sweden)

Pedro Henrique Belavenutti Martins da Silva

2016-03-01

Full Text Available In industrial forest plantations, the spatial distribution of management units for harvest scheduling influences the timber production cost and the non-renewable resources consumption, due to issues related to transport logistic. In this context, this research aimed to formulate Integer Linear Programming (ILP by means of the application of Floyd-Warshall network optimization algorithm to generate timber production routes, minimizing the production costs resulting from harvest activities and forest road maintenance. Then, scenarios were simulated considering different minimal harvest ages for Pinus spp. and Eucalyptus spp. stands. The planning horizon was five years with annual periodicity. The study area was 23,330 hectares of forests, located in Paraná state (southern Brazil. We compared the simulated scenarios according to the following parameter indicators: harvest income, building road network and the production unit cost. The decreasing of the minimal harvest age reduces the mean production of management units scheduled to be harvested, in other hand, it requires fewer roads to be built, and consequently increases the production unit cost. The solutions obtained by using ILP models presented an optimality gap lower than 0.1%.

Sleep scheduling with expected common coverage in wireless sensor networks

OpenAIRE

Bulut, Eyuphan; Korpeoglu, Ibrahim

2011-01-01

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, proces...

Next Generation CANDU: Conceptual Design for a Short Construction Schedule

International Nuclear Information System (INIS)

Hopwood, Jerry M.; Love, Ian J.W.; Elgohary, Medhat; Fairclough, Neville

2002-01-01

Atomic Energy of Canada Ltd. (AECL) has very successful experience in implementing new construction methods at the Qinshan (Phase III) twin unit CANDU 6 plant in China. This paper examines the construction method that must be implemented during the conceptual design phase of a project if short construction schedules are to be met. A project schedule of 48 months has been developed for the nth unit of NG (Next Generation) CANDU with a 42 month construction period from 1. Concrete to In-Service. An overall construction strategy has been developed involving paralleling project activities that are normally conducted in series. Many parts of the plant will be fabricated as modules and be installed using heavy lift cranes. The Reactor Building (RB), being on the critical path, has been the focus of considerable assessment, looking at alternative ways of applying the construction strategy to this building. A construction method has been chosen which will result in excess of 80% of internal work being completed as modules or as very streamlined traditional construction. This method is being further evaluated as the detailed layout proceeds. Other areas of the plant have been integrated into the schedule and new construction methods are being applied to these so that further modularization and even greater paralleling of activities will be achieved. It is concluded that the optimized construction method is a requirement, which must be implemented through all phases of design to make a 42 month construction schedule a reality. If the construction methods are appropriately chosen, the schedule reductions achieved will make nuclear more competitive. (authors)

Nursing teamwork, staff characteristics, work schedules, and staffing.

Science.gov (United States)

Kalisch, Beatrice J; Lee, Hyunhwa

2009-01-01

This study aimed to explore whether and how staff characteristics, staffing, and scheduling variables are associated with the level of teamwork in nursing staff on acute care hospital patient units. This was a cross-sectional study with a sample of 1,758 nursing staff members from two different hospitals on 38 patient care units who completed the Nursing Teamwork Survey in 2008. This study focused on nursing teams who are stationed on a particular patient care unit (as opposed to visitors to the units). The return rate was 56.9%. The sample was made up of 77.4% nurses (registered nurses and licensed practical nurses), 11.9% assistive personnel, and 7.9% unit secretaries. Teamwork varied by unit and service type, with the highest scores occurring in pediatrics and maternity and the lowest scores on the medical-surgical and emergency units. Staff with less than 6 months of experience, those working 8- or 10-hour shifts (as opposed to 12 hours or a combination of 8 and 12 hours), part-time staff (as opposed to full time), and those working on night shift had higher teamwork scores. The higher teamwork scores were also associated with no or little overtime. The higher perception of the adequacy of staffing and the fewer patients cared for on a previous shift, the higher the teamwork scores. There is a relationship between selected staff characteristics, aspects of work schedules, staffing, and teamwork. Nursing staff want to work where teamwork is high, and perceptions of good staffing lead to higher teamwork. Higher teamwork scores correlated with those who worked less overtime.

Short-term bulk energy storage system scheduling for load leveling in unit commitment: modeling, optimization, and sensitivity analysis

Science.gov (United States)

Hemmati, Reza; Saboori, Hedayat

2016-01-01

Energy storage systems (ESSs) have experienced a very rapid growth in recent years and are expected to be a promising tool in order to improving power system reliability and being economically efficient. The ESSs possess many potential benefits in various areas in the electric power systems. One of the main benefits of an ESS, especially a bulk unit, relies on smoothing the load pattern by decreasing on-peak and increasing off-peak loads, known as load leveling. These devices require new methods and tools in order to model and optimize their effects in the power system studies. In this respect, this paper will model bulk ESSs based on the several technical characteristics, introduce the proposed model in the thermal unit commitment (UC) problem, and analyze it with respect to the various sensitive parameters. The technical limitations of the thermal units and transmission network constraints are also considered in the model. The proposed model is a Mixed Integer Linear Programming (MILP) which can be easily solved by strong commercial solvers (for instance CPLEX) and it is appropriate to be used in the practical large scale networks. The results of implementing the proposed model on a test system reveal that proper load leveling through optimum storage scheduling leads to considerable operation cost reduction with respect to the storage system characteristics. PMID:27222741

Short-term bulk energy storage system scheduling for load leveling in unit commitment: modeling, optimization, and sensitivity analysis.

Science.gov (United States)

Hemmati, Reza; Saboori, Hedayat

2016-05-01

Energy storage systems (ESSs) have experienced a very rapid growth in recent years and are expected to be a promising tool in order to improving power system reliability and being economically efficient. The ESSs possess many potential benefits in various areas in the electric power systems. One of the main benefits of an ESS, especially a bulk unit, relies on smoothing the load pattern by decreasing on-peak and increasing off-peak loads, known as load leveling. These devices require new methods and tools in order to model and optimize their effects in the power system studies. In this respect, this paper will model bulk ESSs based on the several technical characteristics, introduce the proposed model in the thermal unit commitment (UC) problem, and analyze it with respect to the various sensitive parameters. The technical limitations of the thermal units and transmission network constraints are also considered in the model. The proposed model is a Mixed Integer Linear Programming (MILP) which can be easily solved by strong commercial solvers (for instance CPLEX) and it is appropriate to be used in the practical large scale networks. The results of implementing the proposed model on a test system reveal that proper load leveling through optimum storage scheduling leads to considerable operation cost reduction with respect to the storage system characteristics.

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

Science.gov (United States)

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

1986-09-01

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

Unit commitment with probabilistic reserve: An IPSO approach

International Nuclear Information System (INIS)

Lee, Tsung-Ying; Chen, Chun-Lung

2007-01-01

This paper presents a new algorithm for solution of the nonlinear optimal scheduling problem. This algorithm is named the iteration particle swarm optimization (IPSO). A new index, called iteration best, is incorporated into particle swarm optimization (PSO) to improve the solution quality and computation efficiency. IPSO is applied to solve the unit commitment with probabilistic reserve problem of a power system. The outage cost as well as fuel cost of thermal units was considered in the unit commitment program to evaluate the level of spinning reserve. The optimal scheduling of on line generation units was reached while minimizing the sum of fuel cost and outage cost. A 48 unit power system was used as a numerical example to test the new algorithm. The optimal scheduling of on line generation units could be reached in the testing results while satisfying the requirement of the objective function

The complexity of scheduling trees with communication delays

NARCIS (Netherlands)

Lenstra, J.K.; Veldhorst, M.; Veltman, B.

1996-01-01

We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm for

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

Science.gov (United States)

2017-05-03

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

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

Design Principles and Algorithms for Air Traffic Arrival Scheduling

Science.gov (United States)

Erzberger, Heinz; Itoh, Eri

2014-01-01

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

50 CFR 86.101 - What is the Service schedule to adopt the National Framework?

Science.gov (United States)

2010-10-01

... 50 Wildlife and Fisheries 6 2010-10-01 2010-10-01 false What is the Service schedule to adopt the National Framework? 86.101 Section 86.101 Wildlife and Fisheries UNITED STATES FISH AND WILDLIFE SERVICE... schedule to adopt the National Framework? The Secretary of the Interior adopted the National Framework on...

Optimization of design and erection methods to minimize the construction time-schedule of EPR plants

International Nuclear Information System (INIS)

Pierrat, Michel; L'Huby, Yvan; Decelle, Alain

1999-01-01

This paper presents the results of the investigations made during the Basic Design of the EPR project (European Pressurized water Reactor) to shorten the construction schedule. A 57 months construction schedule can be reached for the first unit. The investigations concern both design and construction methods. (author)

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

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.

78 FR 15046 - Certain Pasta From Italy and Turkey; Revised Schedule for the Subject Reviews

Science.gov (United States)

2013-03-08

... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 701-TA-365-366 and 731-TA-734-735 (Third Review)] Certain Pasta From Italy and Turkey; Revised Schedule for the Subject Reviews AGENCY: United States... pasta from Italy and Turkey (78 FR 9937, February 12, 2013). The Commission is revising its schedule as...

Systematic Evaluation of Stochastic Methods in Power System Scheduling and Dispatch with Renewable Energy

Energy Technology Data Exchange (ETDEWEB)

Wang, Yishen [Univ. of Washington, Seattle, WA (United States); Argonne National Lab. (ANL), Argonne, IL (United States); Zhou, Zhi [Argonne National Lab. (ANL), Argonne, IL (United States); Liu, Cong [Argonne National Lab. (ANL), Argonne, IL (United States); Electric Reliability Council of Texas (ERCOT), Austin, TX (United States); Botterud, Audun [Argonne National Lab. (ANL), Argonne, IL (United States)

2016-08-01

As more wind power and other renewable resources are being integrated into the electric power grid, the forecast uncertainty brings operational challenges for the power system operators. In this report, different operational strategies for uncertainty management are presented and evaluated. A comprehensive and consistent simulation framework is developed to analyze the performance of different reserve policies and scheduling techniques under uncertainty in wind power. Numerical simulations are conducted on a modified version of the IEEE 118-bus system with a 20% wind penetration level, comparing deterministic, interval, and stochastic unit commitment strategies. The results show that stochastic unit commitment provides a reliable schedule without large increases in operational costs. Moreover, decomposition techniques, such as load shift factor and Benders decomposition, can help in overcoming the computational obstacles to stochastic unit commitment and enable the use of a larger scenario set to represent forecast uncertainty. In contrast, deterministic and interval unit commitment tend to give higher system costs as more reserves are being scheduled to address forecast uncertainty. However, these approaches require a much lower computational effort Choosing a proper lower bound for the forecast uncertainty is important for balancing reliability and system operational cost in deterministic and interval unit commitment. Finally, we find that the introduction of zonal reserve requirements improves reliability, but at the expense of higher operational costs.

Project management with dynamic scheduling baseline scheduling, risk analysis and project control

CERN Document Server

Vanhoucke, Mario

2013-01-01

The topic of this book is known as dynamic scheduling, and is used to refer to three dimensions of project management and scheduling: the construction of a baseline schedule and the analysis of a project schedule's risk as preparation of the project control phase during project progress. This dynamic scheduling point of view implicitly assumes that the usability of a project's baseline schedule is rather limited and only acts as a point of reference in the project life cycle.

Generation-Side Power Scheduling in a Grid-Connected DC Microgrid

DEFF Research Database (Denmark)

Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Meng, Lexuan

2015-01-01

In this paper, a constrained mixed-integer programming model for scheduling the active power supplied by the generation units in storage-based DC microgrids is presented. The optimization problem minimizes operating costs taking into account a two-stage mode operation of the energy storage system...... so that a more accurate model for optimization of the microgrid operation can be obtained. The model is used in a particular grid-connected DC microgrid that includes two renewable energy sources and an energy storage system which supply a critical load. The results of the scheduling process...

NASA scheduling technologies

Science.gov (United States)

Adair, Jerry R.

1994-01-01

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

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

International Nuclear Information System (INIS)

Huse, Einar Staale

1998-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1999-12-31

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

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

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1998-12-31

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

Optimal Scheduling of a Multi-Carrier Energy Hub Supplemented By Battery Energy Storage Systems

DEFF Research Database (Denmark)

Javadi, Mohammad Sadegh; Anvari-Moghaddam, Amjad; Guerrero, Josep M.

2017-01-01

This paper introduces a management model for optimal scheduling of a multi-carrier energy hub. In the proposed hub, three types of assets are considered: dispersed generating systems (DGs) such as micro-combined heat and power (mCHP) units, storage devices such as battery-based electrical storage...... systems (ESSs), and heating/cooling devices such as electrical heater, heat-pumps and absorption chillers. The optimal scheduling and management of the examined energy hub assets in line with electrical transactions with distribution network is modeled as a mixed-integer non-linear optimization problem....... In this regard, optimal operating points of DG units as well as ESSs are calculated based on a cost-effective strategy. Degradation cost of ESSs is also taken into consideration for short-term scheduling. Simulation results demonstrate that including well-planned energy storage options together with optimal...

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

Science.gov (United States)

Hakim, L.; Bakhtiar, T.; Jaharuddin

2017-01-01

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

Strategic bidding of generating units in competitive electricity market with considering their reliability

International Nuclear Information System (INIS)

Soleymani, S.; Ranjbar, A.M.; Shirani, A.R.

2008-01-01

In the restructured power systems, they are typically scheduled based on the offers and bids to buy and sell energy and ancillary services (AS) subject to operational and security constraints. Generally, no account is taken of unit reliability when scheduling it. Therefore generating units have no incentive to improve their reliability. This paper proposes a new method to obtain the equilibrium points for reliability and price bidding strategy of units when the unit reliability is considered in the scheduling problem. The proposed methodology employs the supply function equilibrium (SFE) for modeling a unit's bidding strategy. Units change their bidding strategies and improve their reliability until Nash equilibrium points are obtained. GAMS (general algebraic modeling system) language has been used to solve the market scheduling problem using DICOPT optimization software with mixed integer non-linear programming. (author)

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

Science.gov (United States)

2010-07-22

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

Fewer intensive care unit refusals and a higher capacity utilization by using a cyclic surgical case schedule

NARCIS (Netherlands)

van Houdenhoven, Mark; van Oostrum, Jeroen M.; Wullink, Gerhard; Hans, Elias W.; Hurink, Johann L.; Bakker, Jan; Kazemier, Geert

Purpose: Mounting health care costs force hospital managers to maximize utilization of scarce resources and simultaneously improve access to hospital services. This article assesses the benefits of a cyclic case scheduling approach that exploits a master surgical schedule (MSS). An MSS maximizes

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

Science.gov (United States)

Richards, Stephen F.

1991-01-01

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

Stochastic risk-constrained short-term scheduling of industrial cogeneration systems in the presence of demand response programs

International Nuclear Information System (INIS)

Alipour, Manijeh; Mohammadi-Ivatloo, Behnam; Zare, Kazem

2014-01-01

Highlights: • Short-term self-scheduling problem of customers with CHP units is conducted. • Power demand and pool prices are forecasted using ARIMA models. • Risk management problem is conducted by implementing CVaR methodology. • The demand response program is implemented in self-scheduling problem of CHP units. • Non-convex feasible operation region in different types of CHP units is modeled. - Abstract: This paper presents a stochastic programming framework for solving the scheduling problem faced by an industrial customer with cogeneration facilities, conventional power production system, and heat only units. The power and heat demands of the customer are supplied considering demand response (DR) programs. In the proposed DR program, the responsive load can vary in different time intervals. In the paper, the heat-power dual dependency characteristic in different types of CHP units is taken into account. In addition, a heat buffer tank, with the ability of heat storage, has been incorporated in the proposed framework. The impact of the market and load uncertainties on the scheduling problem is characterized through a stochastic programming formulation. Autoregressive integrated moving average (ARIMA) technique is used to generate the electricity price and the customer demand scenarios. The daily and weekly seasonalities of demand and market prices are taken into account in the scenario generation procedure. The conditional value-at-risk (CVaR) methodology is implemented in order to limit the risk of expected profit due to market price and load forecast volatilities

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

NARCIS (Netherlands)

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

2010-01-01

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

15 CFR 714.1 - Annual declaration requirements for plant sites that produce a Schedule 3 chemical in excess of...

Science.gov (United States)

2010-01-01

... plant sites that produce a Schedule 3 chemical in excess of 30 metric tons. 714.1 Section 714.1 Commerce... SCHEDULE 3 CHEMICALS § 714.1 Annual declaration requirements for plant sites that produce a Schedule 3... in the production of a chemical in any units within the same plant through chemical reaction...

Unit Commitment for Systems With Significant Wind Penetration

DEFF Research Database (Denmark)

Tuohy, Aidan; Meibom, Peter; Denny, E.

2009-01-01

The stochastic nature of wind alters the unit commitment and dispatch problem. By accounting for this uncertainty when scheduling the system, more robust schedules are produced, which should, on average, reduce expected costs. In this paper, the effects of stochastic wind and load on the unit...... commitment and dispatch of power systems with high levels of wind power are examined. By comparing the costs, planned operation and performance of the schedules produced, it is shown that stochastic optimization results in less costly, of the order of 0.25%, and better performing schedules than deterministic...... optimization. The impact of planning the system more frequently to account for updated wind and load forecasts is then examined. More frequent planning means more up to date forecasts are used, which reduces the need for reserve and increases performance of the schedules. It is shown that mid-merit and peaking...

Speeding up IA mechanically-steered multistatic radar scheduling with GP-GPUs

CSIR Research Space (South Africa)

Focke, RW

2016-07-01

Full Text Available In this paper, the authors investigate speeding up the execution time of Interval Algebra (IA) mechanically-steered multistatic and multisite radar scheduling using a general-purpose graphical processing unit (GP-GPU). Multistatic/multisite radar...

Organization of the construction and schedule of realization

International Nuclear Information System (INIS)

Szerovay, Antal; Vogel, Oszkar

1988-01-01

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

Web Publishing Schedule

Science.gov (United States)

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

Flexible work schedules, older workers, and retirement.

Science.gov (United States)

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.

Simulating an Isochronal Scheduled Inspection System for the P-3 Orion

National Research Council Canada - National Science Library

Jones, Jeffrey

1998-01-01

...) for the United States Navy's P-3 Orion. Implementation of ISIS, which is based solely upon calendar time, has been proposed to replace the present system of scheduled inspections that are based upon both calendar time and flight hours...

Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns

Science.gov (United States)

Majerowicz, Walt; Shinn, Stephen A.

2016-01-01

This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.

Cyclic delivery scheduling to customers with different priorities

Directory of Open Access Journals (Sweden)

Katarzyna Zofia Gdowska

2013-12-01

Full Text Available Background: In this paper a cyclic delivery scheduling problem for customers with different priorities is presented. Shops, which are provided with deliveries, are occasionally located in places which are crucial for the proper flow of traffic. In such places coordination of deliveries is crucial; therefore it allows to completely eliminate the phenomenon of the simultaneous arrivals of suppliers. Methods: In this paper the cyclic delivery scheduling problem for customers with different priorities was presented. To this theoretical problem a mix integer programming model was developed. Specific approach to the cyclic delivery scheduling problem is inspired by timetabling problem for urban public transport. Results: Mixed integer programming model was employed for solving four cases of cyclic delivery scheduling problem for customers with different priorities. When the value of the synchronization priority assigned to a single customer raised then the total number of synchronizations in the whole network decreased. In order to compare solutions a synchronization rate was utilized. A simple factor was utilized - the proportion of number of synchronizations of deliveries to a given customer to the total number of synchronizations obtained for the whole network. When the value of synchronization priority raised then the value of synchronization rate of this customer improved significantly. Conclusions: The mixed integer programming model for the cyclic delivery scheduling problem for customers with different priorities presented in this paper can be utilized for generating schedules of serving customers located in places where only one delivery can be received and unloaded at one go and where there is no space for other suppliers to wait in a queue. Such a schedule can be very useful for organizing deliveries to small shops united in a franchising network, since they operate in a way that is very similar to the network presented in this paper

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

Science.gov (United States)

2010-07-01

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

ATLAS construction schedule

CERN Multimedia

Kotamaki, M

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

78 FR 70274 - United States Travel and Tourism Advisory Board: Meeting of the United States Travel and Tourism...

Science.gov (United States)

2013-11-25

... DEPARTMENT OF COMMERCE International Trade Administration United States Travel and Tourism Advisory Board: Meeting of the United States Travel and Tourism Advisory Board AGENCY: International Trade... the schedule and agenda for an open meeting of the United States Travel and Tourism Advisory Board...

78 FR 3398 - United States Travel and Tourism Advisory Board: Meeting of the United States Travel and Tourism...

Science.gov (United States)

2013-01-16

... DEPARTMENT OF COMMERCE International Trade Administration United States Travel and Tourism Advisory Board: Meeting of the United States Travel and Tourism Advisory Board AGENCY: International Trade... the schedule and agenda for an open meeting of the United States Travel and Tourism Advisory Board...

Stochastic multiobjective self-scheduling of a power producer in joint energy and reserves markets

International Nuclear Information System (INIS)

Vahidinasab, V.; Jadid, S.

2010-01-01

This paper presents a stochastic multiobjective model for self-scheduling of a power producer which participates in the day-ahead joint energy and reserves markets. The objective of a power producer is to compromise the conflicting objectives of payoff maximization and gaseous emissions minimization when committing its generation of thermal units. The proposed schedule will be used by the power producers to decide on emission quota arbitrage opportunities and for strategic bidding to the energy and reserves market. The paper analyzes a scenario-based multiobjective model in which random distributions, such as price forecasting inaccuracies as well as forced outage of generating units are modeled as scenarios tree using a combined fuzzy c-mean/Monte-Carlo simulation (FCM/MCS) method. With the above procedure the stochastic multiobjective self-scheduling problem is converted into corresponding deterministic problems. Then a multiobjective mathematical programming (MMP) approach based on ε-constraint method is implemented for each deterministic scenario. Piecewise linearized fuel and emission cost functions are applied for computational efficiency and the model is formulated as a mixed-integer programming (MIP) problem. Numerical simulations for a power producer with 21 thermal units are discussed to demonstrate the performance of the proposed approach in increasing expected payoffs by adjusting the emission quota arbitrage opportunities. (author)

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

Optimal scheduling for distribution network with redox flow battery storage

International Nuclear Information System (INIS)

Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

2016-01-01

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

Information Flow Scheduling in Concurrent Multi-Product Development Based on DSM

Science.gov (United States)

Sun, Qing-Chao; Huang, Wei-Qiang; Jiang, Ying-Jie; Sun, Wei

2017-09-01

Multi-product collaborative development is adopted widely in manufacturing enterprise, while the present multi-project planning models don't take technical/data interactions of multiple products into account. To decrease the influence of technical/data interactions on project progresses, the information flow scheduling models based on the extended DSM is presented. Firstly, information dependencies are divided into four types: series, parallel, coupling and similar. Secondly, different types of dependencies are expressed as DSM units, and the extended DSM model is brought forward, described as a block matrix. Furthermore, the information flow scheduling methods is proposed, which involves four types of operations, where partitioning and clustering algorithm are modified from DSM for ensuring progress of high-priority project, merging and converting is the specific computation of the extended DSM. Finally, the information flow scheduling of two machine tools development is analyzed with example, and different project priorities correspond to different task sequences and total coordination cost. The proposed methodology provides a detailed instruction for information flow scheduling in multi-product development, with specially concerning technical/data interactions.

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

Stochastic profit-based scheduling of industrial virtual power plant using the best demand response strategy

International Nuclear Information System (INIS)

Nosratabadi, Seyyed Mostafa; Hooshmand, Rahmat-Allah; Gholipour, Eskandar

2016-01-01

Highlights: • VPPs and IVPPs are defined for energy management of aggregated generations. • IVPP can manage industrial microgrid containing some relevant load and generation. • A stochastic modeling is proposed to schedule optimal generations in competition market. • Wind generation and day-ahead and spot market prices are considered to be stochastic. • A new DRL program selection scheme is presented in the scheduling procedure. - Abstract: One of the main classified microgrids in a power system is the industrial microgrid. Due to its behaviors and the heavy loads, its energy management is challengeable. Virtual Power Plant (VPP) can be an important concept in managing such problems in this kind of grids. Here, a transmission power system is considered as a Regional Electric Company (REC) and the VPPs comprising Distributed Generation (DG) units and Demand Response Loads (DRLs) are determined in this system. This paper focuses on Industrial VPP (IVPP) and its management. An IVPP can be determined as a management unit comprising generations and loads in an industrial microgrid. Since the scheduling procedure for these units is very important for their participation in a short-term electric market, a stochastic formulation is proposed for power scheduling in VPPs especially in IVPPs in this paper. By introducing the DRL programs and using the proposed modeling, the operator can select the best DRL program for each VPP in a scheduling procedure. In this regard, a suitable approach is presented to determine the proposed formulation and its solution in a Mixed Integer Non-Linear Programming (MINLP). To validate the performance of the proposed method, the IEEE Reliability Test System (IEEE-RTS) is considered to apply the method on it, while some challenging aspects are presented.

Second-order schedules of token reinforcement with pigeons: effects of fixed- and variable-ratio exchange schedules.

Science.gov (United States)

Foster, T A; Hackenberg, T D; Vaidya, M

2001-09-01

Pigeons' key pecks produced food under second-order schedules of token reinforcement, with light-emitting diodes serving as token reinforcers. In Experiment 1, tokens were earned according to a fixed-ratio 50 schedule and were exchanged for food according to either fixed-ratio or variable-ratio exchange schedules, with schedule type varied across conditions. In Experiment 2, schedule type was varied within sessions using a multiple schedule. In one component, tokens were earned according to a fixed-ratio 50 schedule and exchanged according to a variable-ratio schedule. In the other component, tokens were earned according to a variable-ratio 50 schedule and exchanged according to a fixed-ratio schedule. In both experiments, the number of responses per exchange was varied parametrically across conditions, ranging from 50 to 400 responses. Response rates decreased systematically with increases in the fixed-ratio exchange schedules, but were much less affected by changes in the variable-ratio exchange schedules. Response rates were consistently higher under variable-ratio exchange schedules than tinder comparable fixed-ratio exchange schedules, especially at higher exchange ratios. These response-rate differences were due both to greater pre-ratio pausing and to lower local rates tinder the fixed-ratio exchange schedules. Local response rates increased with proximity to food under the higher fixed-ratio exchange schedules, indicative of discriminative control by the tokens.

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

Energy Technology Data Exchange (ETDEWEB)

Moss, A E

1966-09-01

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

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

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

Voltage Scheduling Droop Control for State-of-Charge Balance of Distributed Energy Storage in DC Microgrids

DEFF Research Database (Denmark)

Li, Chendan; Dragicevic, Tomislav; Aldana, Nelson Leonardo Diaz

2014-01-01

Due to higher power quality, lower conversion loss, and more DC loads, there has been an increasing awareness on DC microgrid. Previous emphasis has been on equal power sharing among different units in the DC microgrid, while overlooking the coordination of the energy storage units to maintain...... the State-of-Charge balance. In this paper, a new droop method based on voltage scheduling for State-of-Charge balance is proposed to keep the SoC balance for the energy storage units. The proposed method has the advantage of avoiding the stability problem existed in traditional methods based on droop gain...... scheduling. Simulation experiment is taken in Matlab on a DC microgrid with two distributed energy storage units. The simulation results show that the proposed method has successfully achieved SoC balance during the load changes while maintaining the DC bus voltage within the allowable range....

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

Science.gov (United States)

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

1995-01-01

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

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

Optimal hydro scheduling and offering strategies considering price uncertainty and risk management

International Nuclear Information System (INIS)

Catalão, J.P.S.; Pousinho, H.M.I.; Contreras, J.

2012-01-01

Hydro energy represents a priority in the energy policy of Portugal, with the aim of decreasing the dependence on fossil fuels. In this context, optimal hydro scheduling acquires added significance in moving towards a sustainable environment. A mixed-integer nonlinear programming approach is considered to enable optimal hydro scheduling for the short-term time horizon, including the effect of head on power production, start-up costs related to the units, multiple regions of operation, and constraints on discharge variation. As new contributions to the field, market uncertainty is introduced in the model via price scenarios and risk management is included using Conditional Value-at-Risk to limit profit volatility. Moreover, plant scheduling and pool offering by the hydro power producer are simultaneously considered to solve a realistic cascaded hydro system. -- Highlights: ► A mixed-integer nonlinear programming approach is considered for optimal hydro scheduling. ► Market uncertainty is introduced in the model via price scenarios. ► Risk management is included using conditional value-at-risk. ► Plant scheduling and pool offering by the hydro power producer are simultaneously considered. ► A realistic cascaded hydro system is solved.

A Two-Level Task Scheduler on Multiple DSP System for OpenCL

Directory of Open Access Journals (Sweden)

Li Tian

2014-04-01

Full Text Available This paper addresses the problem that multiple DSP system does not support OpenCL programming. With the compiler, runtime, and the kernel scheduler proposed, an OpenCL application becomes portable not only between multiple CPU and GPU, but also between embedded multiple DSP systems. Firstly, the LLVM compiler was imported for source-to-source translation in which the translated source was supported by CCS. Secondly, two-level schedulers were proposed to support efficient OpenCL kernel execution. The DSP/BIOS is used to schedule system level tasks such as interrupts and drivers; however, the synchronization mechanism resulted in heavy overhead during task switching. So we designed an efficient second level scheduler especially for OpenCL kernel work-item scheduling. The context switch process utilizes the 8 functional units and cross path links which was superior to DSP/BIOS in the aspect of task switching. Finally, dynamic loading and software managed CACHE were redesigned for OpenCL running on multiple DSP system. We evaluated the performance using some common OpenCL kernels from NVIDIA, AMD, NAS, and Parboil benchmarks. Experimental results show that the DSP OpenCL can efficiently exploit the computing resource of multiple cores.

Optimal power system generation scheduling by multi-objective genetic algorithms with preferences

International Nuclear Information System (INIS)

Zio, E.; Baraldi, P.; Pedroni, N.

2009-01-01

Power system generation scheduling is an important issue both from the economical and environmental safety viewpoints. The scheduling involves decisions with regards to the units start-up and shut-down times and to the assignment of the load demands to the committed generating units for minimizing the system operation costs and the emission of atmospheric pollutants. As many other real-world engineering problems, power system generation scheduling involves multiple, conflicting optimization criteria for which there exists no single best solution with respect to all criteria considered. Multi-objective optimization algorithms, based on the principle of Pareto optimality, can then be designed to search for the set of nondominated scheduling solutions from which the decision-maker (DM) must a posteriori choose the preferred alternative. On the other hand, often, information is available a priori regarding the preference values of the DM with respect to the objectives. When possible, it is important to exploit this information during the search so as to focus it on the region of preference of the Pareto-optimal set. In this paper, ways are explored to use this preference information for driving a multi-objective genetic algorithm towards the preferential region of the Pareto-optimal front. Two methods are considered: the first one extends the concept of Pareto dominance by biasing the chromosome replacement step of the algorithm by means of numerical weights that express the DM' s preferences; the second one drives the search algorithm by changing the shape of the dominance region according to linear trade-off functions specified by the DM. The effectiveness of the proposed approaches is first compared on a case study of literature. Then, a nonlinear, constrained, two-objective power generation scheduling problem is effectively tackled

Secure Autonomous Automated Scheduling (SAAS). Rev. 1.1

Science.gov (United States)

Walke, Jon G.; Dikeman, Larry; Sage, Stephen P.; Miller, Eric M.

2010-01-01

This report describes network-centric operations, where a virtual mission operations center autonomously receives sensor triggers, and schedules space and ground assets using Internet-based technologies and service-oriented architectures. For proof-of-concept purposes, sensor triggers are received from the United States Geological Survey (USGS) to determine targets for space-based sensors. The Surrey Satellite Technology Limited (SSTL) Disaster Monitoring Constellation satellite, the UK-DMC, is used as the space-based sensor. The UK-DMC's availability is determined via machine-to-machine communications using SSTL's mission planning system. Access to/from the UK-DMC for tasking and sensor data is via SSTL's and Universal Space Network's (USN) ground assets. The availability and scheduling of USN's assets can also be performed autonomously via machine-to-machine communications. All communication, both on the ground and between ground and space, uses open Internet standards

76 FR 72721 - Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty...

Science.gov (United States)

2011-11-25

...)] Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty and... galvanized steel wire, provided for in subheading 7217.20 of the Harmonized Tariff Schedule of the United... merchandise as galvanized steel wire which is a cold- drawn carbon quality steel product in coils, of solid...

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

Science.gov (United States)

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

2017-03-01

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

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

Joint optimization scheduling for water conservancy projects in complex river networks

Directory of Open Access Journals (Sweden)

Qin Liu

2017-01-01

Full Text Available In this study, we simulated water flow in a water conservancy project consisting of various hydraulic structures, such as sluices, pumping stations, hydropower stations, ship locks, and culverts, and developed a multi-period and multi-variable joint optimization scheduling model for flood control, drainage, and irrigation. In this model, the number of sluice holes, pump units, and hydropower station units to be opened were used as decision variables, and different optimization objectives and constraints were considered. This model was solved with improved genetic algorithms and verified using the Huaian Water Conservancy Project as an example. The results show that the use of the joint optimization scheduling led to a 10% increase in the power generation capacity and a 15% reduction in the total energy consumption. The change in the water level was reduced by 0.25 m upstream of the Yundong Sluice, and by 50% downstream of pumping stations No. 1, No. 2, and No. 4. It is clear that the joint optimization scheduling proposed in this study can effectively improve power generation capacity of the project, minimize operating costs and energy consumption, and enable more stable operation of various hydraulic structures. The results may provide references for the management of water conservancy projects in complex river networks.

Scheduling with Time Lags

NARCIS (Netherlands)

X. Zhang (Xiandong)

2010-01-01

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

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

Directory of Open Access Journals (Sweden)

Michael Short

2017-07-01

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

Automated Scheduling Via Artificial Intelligence

Science.gov (United States)

Biefeld, Eric W.; Cooper, Lynne P.

1991-01-01

Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

Schedule Analytics

Science.gov (United States)

2016-04-30

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2003-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2000-01-01

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

A recursive economic dispatch algorithm for assessing the cost of thermal generator schedules

International Nuclear Information System (INIS)

Wong, K.P.; Doan, K.

1992-01-01

This paper develops an efficient, recursive algorithm for determining the economic power dispatch of thermal generators within the unit commitment environment. A method for incorporating the operation limits of all on-line generators and limits due to ramping generators is developed in the paper. The developed algorithm is amenable for computer implementation using the artificial intelligence programming language, Prolog. The performance of the developed algorithm is demonstrated through its application to evaluate the costs of dispatching 13 thermal generators within a generator schedule in a 24-hour schedule horizon

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

Research on Power System Scheduling Improving Wind Power Accommodation Considering Thermal Energy Storage and Flexible Load

Science.gov (United States)

Zou, Chenlu; Cui, Xue; Wang, Heng; Zhou, Bin; Liu, Yang

2018-01-01

In the case of rapid development of wind power and heavy wind curtailment, the study of wind power accommodation of combined heat and power system has become the focus of attention. A two-stage scheduling model contains of wind power, thermal energy storage, CHP unit and flexible load were constructed. This model with the objective function of minimizing wind curtailment and the operation cost of units while taking into account of the total coal consumption of units, constraint of thermal energy storage and electricity-heat characteristic of CHP. This paper uses MICA to solve the problem of too many constraints and make the solution more feasible. A numerical example showed that the two stage decision scheduling model can consume more wind power, and it could provide a reference for combined heat and power system short-term operation

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

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

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

Programming and organisation of unit outages

International Nuclear Information System (INIS)

Hadjidakis, Y.; Cezard, C.; Audierne, J.

1997-01-01

The unit outages are scheduled every 12 to 18 months for fuel reloading. The success of these shutdowns, with the whole of objectives (duration, dosimetry, costs), with maintaining the safety level, is an important stake for the competitiveness of the enterprise. In this article are described the planning, the experience return and the organisation of scheduled shutdowns which have contribute to the improvement of availability. (N.C.)

31 CFR 560.534 - Importation into the United States of, and dealings in, certain foodstuffs and carpets authorized.

Science.gov (United States)

2010-07-01

... Policy § 560.534 Importation into the United States of, and dealings in, certain foodstuffs and carpets... under chapters 2-23 of the Harmonized Tariff Schedule of the United States; (2) Carpets and other... 9706.00.0060 of the Harmonized Tariff Schedule of the United States. (b) United States persons...

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

International Nuclear Information System (INIS)

Shirazi, Elham; Zakariazadeh, Alireza; Jadid, Shahram

2015-01-01

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

NASA Schedule Management Handbook

Science.gov (United States)

2011-01-01

The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

Optimal short-term operation schedule of a hydropower plant in a competitive electricity market

International Nuclear Information System (INIS)

Perez-Diaz, Juan I.; Wilhelmi, Jose R.; Arevalo, Luis A.

2010-01-01

This paper presents a dynamic programming model to solve the short-term scheduling problem of a hydropower plant that sells energy in a pool-based electricity market with the objective of maximizing the revenue. This is a nonlinear and non-concave problem subject to strong technical and strategic constraints, and in which discrete and continuous variables take part. The model described in this paper determines, in each hour of the planning horizon (typically from one day to one week), both the optimal number of units in operation (unit commitment) and the power to be generated by the committed units (generation dispatch). The power generated by each unit is considered as a nonlinear function of the actual water discharge and volume of the associated reservoir. The dependence of the units' efficiency and operating limits with the available gross head is also accounted for in this model. The application of this model to a real hydropower plant demonstrates its capabilities in providing the operation schedule that maximizes the revenue of the hydro plant while satisfying several constraints of different classes. In addition, the use of this model as a supporting tool to estimate the economic feasibility of a hydropower plant development project is also analyzed in the paper. (author)

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.

The role of the production scheduling system in rescheduling

Science.gov (United States)

Kalinowski, K.; Grabowik, C.; Kempa, W.; Paprocka, I.

2015-11-01

The paper presents the rescheduling problem in the context of cooperation between production scheduling system (PSS) and other units in an integrated manufacturing environment - decision makers and software systems. The main aim is to discuss the PSS functionality for maximizing automation of the rescheduling process, reducing the response time and improving the quality of generated solutions. PSSs operate in the meeting of tactical and operational level of planning and control, and play an important role in the production preparation and control. On the basis of information about orders, technology and production system state (e.g. resources availability) they prepare and/or update a detailed plan of production flow - a schedule. All necessary data for scheduling and rescheduling are usually collected in other systems both from organizational and technical production preparation, e.g. ERP, PLM, MES, CAPP or others, as well as they are entered directly by the decision- makers/operators. Data acquired in this way are often incomplete and inconsistent. Therefore the existing rescheduling software works according to interactive method - rather support but does not replace the human decision maker in tasks planning. When rescheduling, due to the limited amount of time to make a decision this interaction is particularly important. An additional problem arises in data acquisition, in the process of data exchanging between systems or in the identification of new data sources and their processing. Different approaches to rescheduling were characterized, including those solutions, where all these operations are carried out by an autonomous system and those in which scheduling is performed only upon request from the outside, for the newly created scheduling data representing the current state of the production system.

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

Freight railway operator timetabling and engine scheduling

DEFF Research Database (Denmark)

Bach, Lukas; Gendreau, M.; Wøhlk, Sanne

2015-01-01

In this paper we consider timetable design at a European freight railway operator. The timetable is designed by choosing the time of service for customer unit train demands among a set of discrete points. These discrete points are all found within the a time-window. The objective of the model...... is to minimize cost while adhering to constraints regarding infrastructure usage, demand coverage, and engine availability. The model is solved by a column generation scheme where feasible engine schedules are designed in a label setting algorithm with time-dependent cost and service times....

Project Schedule Simulation

DEFF Research Database (Denmark)

Mizouni, Rabeb; Lazarova-Molnar, Sanja

2015-01-01

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

Adapting immunisation schedules for children undergoing chemotherapy.

Science.gov (United States)

Fernández-Prada, María; Rodríguez-Martínez, María; García-García, Rebeca; García-Corte, María Dolores; Martínez-Ortega, Carmen

2018-02-01

Children undergoing chemotherapy for cancer have special vaccination needs after completion of the treatment. The aim of this study was to evaluate the adaptation of post-chemotherapy vaccination schedules. An observational study was performed on a retrospective cohort that included all children aged from 0 to 14 years, who completed chemotherapy in a tertiary hospital between 2009 and 2015. Inclusion and exclusion criteria were applied. Immunisation was administered in accordance with the guidelines of the Vaccine Advisory Committee of the Spanish Association of Paediatrics. Primary Care immunisation and clinical records of the Preventive Medicine and Public Health Department were reviewed. Of the 99 children who had received chemotherapy, 51 (70.6% males) were included in the study. As regards the type of tumour, 54.9% had a solid organ tumour, and 45.1% had a haematological tumour. Post-chemotherapy immunisation was administered to 70.6%. The most common vaccines received were: diphtheria-tetanus-pertussis or diphtheria-tetanus (54.9%), meningococcus C (41.2%), and seasonal influenza (39.2%). The rate of adaptation of the immunisation schedule after chemotherapy was 9.8%. The pneumococcal conjugate vaccine against 7v or 13v was administered to 21.6% of study subjects. However, only 17.6% received polysaccharide 23v. None received vaccination against hepatitis A. No statistically significant differences were observed between adherence to immunisation schedules and type of tumour (P=.066), gender (P=.304), or age (P=.342). Post-chemotherapy immunisation of children with cancer is poor. The participation of health professionals in training programs and referral of paediatric cancer patients to Vaccine Units could improve the rate of schedule adaptation and proper immunisation of this population. Copyright © 2016 Elsevier España, S.L.U. and Sociedad Española de Enfermedades Infecciosas y Microbiología Clínica. All rights reserved.

Scheduling theory, algorithms, and systems

CERN Document Server

Pinedo, Michael L

2016-01-01

This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

How Home Health Nurses Plan Their Work Schedules: A Qualitative Descriptive Study.

Science.gov (United States)

Irani, Elliane; Hirschman, Karen B; Cacchione, Pamela Z; Bowles, Kathryn H

2018-06-12

To describe how home health nurses plan their daily work schedules and what challenges they face during the planning process. Home health nurses are viewed as independent providers and value the nature of their work because of the flexibility and autonomy they hold in developing their work schedules. However, there is limited empirical evidence about how home health nurses plan their work schedules, including the factors they consider during the process and the challenges they face within the dynamic home health setting. Qualitative descriptive design. Semi-structured interviews were conducted with 20 registered nurses who had greater than 2 years of experience in home health and were employed by one of the three participating home health agencies in the mid-Atlantic region of the United States. Data were analyzed using conventional content analysis. Four themes emerged about planning work schedules and daily itineraries: identifying patient needs to prioritize visits accordingly, partnering with patients to accommodate their preferences, coordinating visit timing with other providers to avoid overwhelming patients, and working within agency standards to meet productivity requirements. Scheduling challenges included readjusting the schedule based on patient needs and staffing availability, anticipating longer visits, and maintaining continuity of care with patients. Home health nurses make autonomous decisions regarding their work schedules while considering specific patient and agency factors, and overcome challenges related to the unpredictable nature of providing care in a home health setting. Future research is needed to further explore nurse productivity in home health and improve home health work environments. Home health nurses plan their work schedules to provide high quality care that is patient-centered and timely. The findings also highlight organizational priorities to facilitate continuity of care and support nurses while alleviating the burnout

Impact of modules on the ACR construction schedule

International Nuclear Information System (INIS)

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

2003-01-01

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

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

Directory of Open Access Journals (Sweden)

Ann Medaille

2011-03-01

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

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

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

A multi-criteria model for maintenance job scheduling

Directory of Open Access Journals (Sweden)

Sunday A. Oke

2007-12-01

Full Text Available This paper presents a multi-criteria maintenance job scheduling model, which is formulated using a weighted multi-criteria integer linear programming maintenance scheduling framework. Three criteria, which have direct relationship with the primary objectives of a typical production setting, were used. These criteria are namely minimization of equipment idle time, manpower idle time and lateness of job with unit parity. The mathematical model constrained by available equipment, manpower and job available time within planning horizon was tested with a 10-job, 8-hour time horizon problem with declared equipment and manpower available as against the required. The results, analysis and illustrations justify multi-criteria consideration. Thus, maintenance managers are equipped with a tool for adequate decision making that guides against error in the accumulated data which may lead to wrong decision making. The idea presented is new since it provides an approach that has not been documented previously in the literature.

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

Directory of Open Access Journals (Sweden)

Yi Tang

2017-11-01

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

76 FR 72719 - Certain Stilbenic Optical Brightening Agents From China and Taiwan; Scheduling of the Final Phase...

Science.gov (United States)

2011-11-25

... Optical Brightening Agents From China and Taiwan; Scheduling of the Final Phase of Antidumping... whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in the United States is materially retarded, by reason of less-than-fair-value...

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

Science.gov (United States)

2012-07-18

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

Multi-core processing and scheduling performance in CMS

International Nuclear Information System (INIS)

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

2012-01-01

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

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

Science.gov (United States)

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

2008-01-01

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

Approximating Preemptive Stochastic Scheduling

OpenAIRE

Megow Nicole; Vredeveld Tjark

2009-01-01

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

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

Science.gov (United States)

2017-10-26

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

77 FR 50160 - Steel Wire Garment Hangers From Taiwan and Vietnam; Scheduling of the Final Phase of...

Science.gov (United States)

2012-08-20

...)] Steel Wire Garment Hangers From Taiwan and Vietnam; Scheduling of the Final Phase of Countervailing Duty...(b) of the Act (19 U.S.C. 1673d(b)) to determine whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in the United...

Schedule-Aware Workflow Management Systems

Science.gov (United States)

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

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

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

75 FR 25925 - United States Mint

Science.gov (United States)

2010-05-10

... Committee May 25, 2010 Public Meeting. SUMMARY: Pursuant to United States Code, Title 31, section 5135(b)(8... scheduled for May 25, 2010. Date: May 25, 2010. Time: 9 a.m. to 12 p.m. Location: 8th Floor Board Room, United States Mint, 801 9th Street, NW., Washington, DC 20220. Subject: Review and discuss obverse and...

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

NARCIS (Netherlands)

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

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

Immunization Schedules for Adults

Science.gov (United States)

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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

Generator scheduling under competitive environment using Memory Management Algorithm

Directory of Open Access Journals (Sweden)

A. Amudha

2013-09-01

Full Text Available This paper presents a new approach for Real-Time Application of Profit Based Unit Commitment using Memory Management Algorithm. The main objective of the restructured system is to maximize its own profit without the responsibility of satisfying the forecasted demand. The Profit Based Unit Commitment (PBUC is solved by Memory Management Algorithm (MMA in Real-Time Application. MMA approach is introduced in this paper considering power and reserve generation. The proposed method MMA uses Best Fit and Worst Fit allocation for generator scheduling in order to receive the maximum profit by considering the softer demand. Also, this method gives an idea regarding how much power and reserve should be sold in markets. The proposed approach has been tested on a power system with 2, 3, and 10 generating units. Simulation results of the proposed approach have been compared with the existing methods.

Nontraditional work schedules for pharmacists.

Science.gov (United States)

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

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

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

SI units in radiation protection

International Nuclear Information System (INIS)

Herrmann, D.

1976-10-01

In the field of radiation protection all hitherto used units for activity, activity concentrations, exposure, absorbed dose, and dose rates have to be replaced by SI units during the next years. For this purpose graphs and conversion tables are given as well as recommendations on unit combinations preferentially to be used. As to the dose equivalent, it is suggested to introduce a new special unit being 100 times greater than the rem, instead of maintaining the rem or using the gray for both absorbed dose and dose equivalent. Measures and time schedule relating to the gradual transition to SI units in measuring techniques, training, and publishing et cetera are explained. (author)

An evolutionary programming based simulated annealing method for solving the unit commitment problem

Energy Technology Data Exchange (ETDEWEB)

Christober Asir Rajan, C. [Department of EEE, Pondicherry Engineering College, Pondicherry 605014 (India); Mohan, M.R. [Department of EEE, Anna University, Chennai 600 025 (India)

2007-09-15

This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimisation technique for solving unit commitment Problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status (''flat start''). Here the parents are obtained from a pre-defined set of solution's, i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit's minimum down times. And SA improves the status. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consists of 10, 26, 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the Evolutionary Programming method and other conventional methods like Dynamic Programming, Lagrangian Relaxation and Simulated Annealing and Tabu Search in reaching proper unit commitment. (author)

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

Science.gov (United States)

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

2016-06-01

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

Cleaning Schedule Operations in Heat Exchanger Networks

Directory of Open Access Journals (Sweden)

Huda Hairul

2018-01-01

Full Text Available Heat exchanger networks have been known to be the essential parts in the chemical industries. Unfortunately, since the performance of heat exchanger can be decreasing in transferring the heat from hot stream into cold stream due to fouling, then cleaning the heat exchanger is needed to restore its initial performance periodically. A process of heating crude oil in a refinery plant was used as a case study. As many as eleven heat exchangers were used to heat crude oil before it was heated by a furnace to the temperature required to the crude unit distillation column. The purpose of this study is to determine the cleaning schedule of heat exchanger on the heat exchanger networks due to the decrease of the overall heat transfer coefficient by various percentage of the design value. A close study on the process of heat exchanger cleaning schedule in heat exchanger networks using the method of decreasing overall heat transfer coefficient as target. The result showed that the higher the fouling value the more often the heat exchanger is cleaned because the overall heat transfer coefficient decreases quickly.

76 FR 68271 - To Modify the Harmonized Tariff Schedule of the United States

Science.gov (United States)

2011-11-03

... the Convention and do not run counter to the national economic interest of the United States. I have... United States obligations under the Convention and do not run counter to the national economic interest of the United States. 7. On June 6, 2003, the United States and Chile entered into the United States...

Profit-based conventional resource scheduling with renewable energy penetration

Science.gov (United States)

Reddy, K. Srikanth; Panwar, Lokesh Kumar; Kumar, Rajesh; Panigrahi, B. K.

2017-08-01

Technological breakthroughs in renewable energy technologies (RETs) enabled them to attain grid parity thereby making them potential contenders for existing conventional resources. To examine the market participation of RETs, this paper formulates a scheduling problem accommodating energy market participation of wind- and solar-independent power producers (IPPs) treating both conventional and RETs as identical entities. Furthermore, constraints pertaining to penetration and curtailments of RETs are restructured. Additionally, an appropriate objective function for profit incurred by conventional resource IPPs through reserve market participation as a function of renewable energy curtailment is also proposed. The proposed concept is simulated with a test system comprising 10 conventional generation units in conjunction with solar photovoltaic (SPV) and wind energy generators (WEG). The simulation results indicate that renewable energy integration and its curtailment limits influence the market participation or scheduling strategies of conventional resources in both energy and reserve markets. Furthermore, load and reliability parameters are also affected.

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

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

Science.gov (United States)

Butt, Muhammad Arif; Akram, Muhammad

2016-01-01

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

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

NARCIS (Netherlands)

Gracia, P.; Kalmijn, M.

2016-01-01

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

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

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

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

Science.gov (United States)

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

2017-11-01

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

Conception of Self-Construction Production Scheduling System

Science.gov (United States)

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

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

Range Scheduling Aid (RSA)

Science.gov (United States)

Logan, J. R.; Pulvermacher, M. K.

1991-01-01

Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

78 FR 13380 - Silicomanganese From India, Kazakhstan, and Venezuela; Scheduling of Full Five-Year Reviews...

Science.gov (United States)

2013-02-27

... From India, Kazakhstan, and Venezuela; Scheduling of Full Five-Year Reviews Concerning the Antidumping Duty Orders on Silicomanganese From India, Kazakhstan, and Venezuela AGENCY: United States..., Kazakhstan, and Venezuela would be likely to lead to continuation or recurrence of material injury within a...

Schedule optimization study implementation plan

International Nuclear Information System (INIS)

1993-11-01

This Implementation Plan is intended to provide a basis for improvements in the conduct of the Environmental Restoration (ER) Program at Hanford. The Plan is based on the findings of the Schedule Optimization Study (SOS) team which was convened for two weeks in September 1992 at the request of the U.S. Department of Energy (DOE) Richland Operations Office (RL). The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit (OU) Remedial Investigation/Feasibility Study (RI/FS) Work Plan. The SOS team was comprised of independent professionals from other federal agencies and the private sector experienced in environmental restoration within the federal system. The objective of the team was to examine reasons for the lengthy RI/FS process and recommend ways to expedite it. The SOS team issued their Final Report in December 1992. The report found the most serious impediments to cleanup relate to a series of management and policy issues which are within the control of the three parties managing and monitoring Hanford -- the DOE, U.S. Environmental Protection Agency (EPA), and the State of Washington Department of Ecology (Ecology). The SOS Report identified the following eight cross-cutting issues as the root of major impediments to the Hanford Site cleanup. Each of these eight issues is quoted from the SOS Report followed by a brief, general description of the proposed approach being developed

Immunization Schedules for Infants and Children

Science.gov (United States)

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

A Formal Product-Line Engineering Approach for Schedulers

NARCIS (Netherlands)

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

2017-01-01

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

Case scheduling preferences of one Surgeon's cataract surgery patients.

Science.gov (United States)

Dexter, Franklin; Birchansky, Lee; Bernstein, James M; Wachtel, Ruth E

2009-02-01

The increase in the number of operating rooms nationwide in the United States may reflect preferences of patients for scheduling of outpatient surgery. Yet, little is known of the importance that patients place on scheduling convenience and flexibility. Fifty cataract surgery patients seen by a surgeon at his main office during a 6-mo period responded to a marketing survey. All the patients had Medicare insurance and supplemental insurance permitting surgery at any facility. A telephone questionnaire included four vignettes describing different choices in the scheduling of cataract surgery. Respondents were asked how far they would be willing to travel for one option instead of another. For example, "Your surgery will be on Thursday in three weeks at 2 pm. You can drink water until 9 am. You arrive at 10 am, because your surgery might start early. If you travel farther, you would arrive at 8 am for 9 am surgery." The median (50th percentile) additional travel time was 60 min (lower 95% confidence bound >or=52 min) for each of four options: to receive care on a day chosen by the patient instead of assigned by the physician, to receive care at a single site instead of both the surgeon's office and a surgery center at a different location, to combine the examination and the surgery into a single visit instead of two visits, and to have surgery in the morning instead of the afternoon. The patients of this ophthalmologist placed a high value on convenience and flexibility in scheduling their surgery. In general, this would be achievable only if many operating rooms were available each morning.

Robust and Flexible Scheduling with Evolutionary Computation

DEFF Research Database (Denmark)

Jensen, Mikkel T.

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

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

International Nuclear Information System (INIS)

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

1993-07-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

1993-07-01

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

Fuzzy-Logic-Based Gain-Scheduling Control for State-of-Charge Balance of Distributed Energy Storage Systems for DC Microgrids

DEFF Research Database (Denmark)

Aldana, Nelson Leonardo Diaz; Dragicevic, Tomislav; Vasquez, Juan Carlos

2014-01-01

-charge or deep-discharge in one of the energy storage units. Primary control in a microgrid is responsible for power sharing among units; and droop control is typically used in this stage. This paper proposes a modular and decentralized gain-scheduling control strategy based on fuzzy logic that ensures balanced...

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

Science.gov (United States)

2013-04-12

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

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

NASA Instrument Cost/Schedule Model

Science.gov (United States)

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

2011-01-01

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

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

Excellence through outage planning and scheduling

International Nuclear Information System (INIS)

Ferriole, G.

1987-01-01

The Nuclear and Fossil Generation Division of Electricite de France (EdF) has been the largest nuclear plant operating utility in France since 1984. The size of the units, their standardization, and extensive operating experience were favorable parameters leading to the development of a very complete maintenance organization. Electricite de France believes in the importance of well-defined maintenance concepts. These maintenance concepts contribute to outage performance by requiring a careful consideration of work to be done and by defining the techniques and means of accomplishing this work. In addition to maintenance concepts and careful planning and scheduling, good outage management is achieved through the motivation and dedication of the people involved. It is the key to good operational results

The triangle scheduling problem

NARCIS (Netherlands)

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

2017-01-01

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

Influence of the Emissions Trading Scheme on generation scheduling

International Nuclear Information System (INIS)

Kockar, Ivana; McDonald, James R.; Conejo, Antonio J.

2009-01-01

The paper investigates the effects of emissions constraints and Emissions Trading Scheme (ETS) on the generation scheduling outcome. ETS is a cap-and-trade market mechanism that has been introduced in European Union in order to facilitate CO 2 emissions management. This scheme gives generators certain amount of CO 2 allowances which they can use to cover emissions produced during energy generation. In a current setting, most of the allowances are given for free. However, under ETS generators also have an opportunity to buy and sell CO 2 allowances on the market. Since generation power outputs are bounded by the amount of CO 2 emissions that they are allowed to produce over time, it is becoming increasingly important for generating units to manage their allocations in the most profitable way and decide when and how much of permissions to spent to produce electricity. The method proposed here allows for modeling of this new limitation by including costs of buying and selling of CO 2 allowance in the generation scheduling procedure. It also introduces additional emissions constraints in the problem formulation. Although CO 2 permissions and energy are traded in separate markets, the proposed formulation permits analysis on how emission caps and emission market prices can influence market outcome. The method is illustrated on a 5-unit system. Given examples compare (i) a base-case when all generators have made a decision to use portions of their total free allocations that do not cause any shortfall during the investigated time period; (ii) two cases when the least expensive generators' decisions on the amount of free allowances they are willing to use during the considered period are insufficient. In all cases generators also submit prices at which they expect to be able to ''top-up'' or sell allowances on the market, however, only in the second and third case the ''buying'' option becomes active and affects generation scheduling and total costs. In addition, the

A System for Automatically Generating Scheduling Heuristics

Science.gov (United States)

Morris, Robert

1996-01-01

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

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

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

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

Multi-area unit commitment with ramp-rate limits

International Nuclear Information System (INIS)

Wang, C.; Shahidehpour, S.M.

1992-01-01

This paper reports that there are two tasks considered in power system generation scheduling. One is the unit commitment which determines the unit start up and shut down schedules in order to minimize the system fuel expenditure. The other is the economic dispatch which assigns the system load demand to the committed generating units for minimizing the power generation cost. The economic operation attracts a great deal of attention as a modest reduction in percentage fuel cost leads to a large saving in the system operation costs. Many studies for power system generation scheduling have successfully applied various mathematical algorithms such as Lagrangian relaxation, dynamic programming, and artificial intelligence techniques e.g., expert systems, artificial neural networks (ANN), etc. The AI techniques have incorporated the system practical operational policies in the mathematical techniques to improve system models considerably. The mechanism of ANN simulates the learning process of the human brain. One class of ANN learns the knowledge through examples, or training facts, composed by various inputs and their corresponding outputs. The extent of the intelligibility of ANN depends upon the diversity of the training facts. For an input which is not in the training facts, the trained ANN can estimate an output based on its previous knowledge about the problem

Artificial intelligence approaches to astronomical observation scheduling

Science.gov (United States)

Johnston, Mark D.; Miller, Glenn

1988-01-01

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

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

International Nuclear Information System (INIS)

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

2013-01-01

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

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

Science.gov (United States)

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

2007-01-01

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

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

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

Alternative Work Schedules: Definitions

Science.gov (United States)

Journal of the College and University Personnel Association, 1977

1977-01-01

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

Planning and Scheduling of Airline Operations

Directory of Open Access Journals (Sweden)

İlkay ORHAN

2010-02-01

Full Text Available The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: flight scheduling, aircraft scheduling, crew scheduling and disruptions management. These aforementioned scheduling and planning problems faced by all airline companies in the airline sector were examined in detail. Studies reveal that companies using the advanced methods might gain significant cost reductions. However, even then, the time required for solving large scale problems may not satisfy the decision quality desired by decision makers. In such cases, using modern decision methods integrated with advanced technologies offer companies an opportunity for significant cost-advantages.

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

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

Technology for planning and scheduling under complex constraints

Science.gov (United States)

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

1997-02-01

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

Management of planned unit outages

International Nuclear Information System (INIS)

Brune, W.

1984-01-01

Management of planned unit outages at the Bruno Leuschner Nuclear Power Plant is based on the experience gained with Soviet PWR units of the WWER type over a period of more than 50 reactor-years. For PWR units, planned outages concentrate almost exclusively on annual refuellings and major maintenance of the power plant facilities involved. Planning of such major maintenance work is based on a standardized basic network plan and a catalogue of standardized maintenance and inspection measures. From these, an overall maintenance schedule of the unit and partial process plans of the individual main components are derived (manually or by computer) and, in the temporal integration of major maintenance at every unit, fixed starting times and durations are determined. More than 75% of the maintenance work at the Bruno Leuschner Nuclear Power Plant is carried out by the plant's own maintenance personnel. Large-scale maintenance of every unit is controlled by a special project head. He is assisted by commissioners, each of whom is responsible for his own respective item. A daily control report is made. The organizational centre is a central office which works in shifts around the clock. All maintenance orders and reports of completion pass through this office; thus, the overall maintenance schedule can be corrected daily. To enforce the proposed operational strategy, suitable accompanying technical measures are required with respect to effective facility monitoring and technical diagnosis, purposeful improvement of particularly sensitive components and an increase in the effectiveness of maintenance work by special technologies and devices. (author)

77 FR 34997 - Xanthan Gum From Austria and China; Institution of Antidumping Duty Investigations and Scheduling...

Science.gov (United States)

2012-06-12

... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 731-TA-1202-1203 (Preliminary)] Xanthan Gum From Austria and China; Institution of Antidumping Duty Investigations and Scheduling of Preliminary... industry in the United States is materially retarded, by reason of imports from Austria and/or China of...

Greedy and metaheuristics for the offline scheduling problem in grid computing

DEFF Research Database (Denmark)

Gamst, Mette

In grid computing a number of geographically distributed resources connected through a wide area network, are utilized as one computations unit. The NP-hard offline scheduling problem in grid computing consists of assigning jobs to resources in advance. In this paper, five greedy heuristics and two....... All heuristics solve instances with up to 2000 jobs and 1000 resources, thus the results are useful both with respect to running times and to solution values....

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.

Economic power schedule and transactive energy through an intelligent centralized energy management system for a DC residential distribution system

DEFF Research Database (Denmark)

Yue, Jingpeng; Hu, Zhijian; Li, Chendan

2017-01-01

and the demand side. The utilization of distributed generation (DG) requires an economic operation, stability, and an environmentally friendly approach in the whole DC system. This paper not only presents an optimization schedule and transactive energy (TE) approach through a centralized energy management system...... is aligned with the command of the unit power schedule. In this work, a DC RDS is used as a case study to demonstrate the process, the RDS is associated with unit economic models, and a cost minimization objective is proposed that is to be achieved based on the real-time electrical price. The results show...... that the proposed framework and methods will help the targeted DC residential system to reduce the total cost and reach stability and efficiency....

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

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

Scheduling lessons learned from the Autonomous Power System

Science.gov (United States)

Ringer, Mark J.

1992-01-01

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

CARMENES instrument control system and operational scheduler

Science.gov (United States)

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

The main goal of the CARMENES instrument is to perform high-accuracy measurements of stellar radial velocities (1m/s) with long-term stability. CARMENES will be installed in 2015 at the 3.5 m telescope in the Calar Alto Observatory (Spain) and it will be equipped with two spectrographs covering from the visible to the near-infrared. It will make use of its near-IR capabilities to observe late-type stars, whose peak of the spectral energy distribution falls in the relevant wavelength interval. The technology needed to develop this instrument represents a challenge at all levels. We present two software packages that play a key role in the control layer for an efficient operation of the instrument: the Instrument Control System (ICS) and the Operational Scheduler. The coordination and management of CARMENES is handled by the ICS, which is responsible for carrying out the operations of the different subsystems providing a tool to operate the instrument in an integrated manner from low to high user interaction level. The ICS interacts with the following subsystems: the near-IR and visible channels, composed by the detectors and exposure meters; the calibration units; the environment sensors; the front-end electronics; the acquisition and guiding module; the interfaces with telescope and dome; and, finally, the software subsystems for operational scheduling of tasks, data processing, and data archiving. We describe the ICS software design, which implements the CARMENES operational design and is planned to be integrated in the instrument by the end of 2014. The CARMENES operational scheduler is the second key element in the control layer described in this contribution. It is the main actor in the translation of the survey strategy into a detailed schedule for the achievement of the optimization goals. The scheduler is based on Artificial Intelligence techniques and computes the survey planning by combining the static constraints that are known a priori (i.e., target

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

40 CFR 141.702 - Sampling schedules.

Science.gov (United States)

2010-07-01

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

Two-stage stochastic day-ahead optimal resource scheduling in a distribution network with intensive use of distributed energy resources

DEFF Research Database (Denmark)

Sousa, Tiago; Ghazvini, Mohammad Ali Fotouhi; Morais, Hugo

2015-01-01

The integration of renewable sources and electric vehicles will introduce new uncertainties to the optimal resource scheduling, namely at the distribution level. These uncertainties are mainly originated by the power generated by renewables sources and by the electric vehicles charge requirements....... This paper proposes a two-state stochastic programming approach to solve the day-ahead optimal resource scheduling problem. The case study considers a 33-bus distribution network with 66 distributed generation units and 1000 electric vehicles....

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

Security-constrained self-scheduling of generation companies in day-ahead electricity markets considering financial risk

International Nuclear Information System (INIS)

Amjady, Nima; Vahidinasab, Vahid

2013-01-01

Highlights: ► A security-constrained self-scheduling is presented. ► The proposed framework takes into account the uncertainty of the predicted market prices. ► We model the risk and profit tradeoff of a GENCO based on an efficient multi-objective model. ► Unit commitment and inter-temporal constraints of generators are considered in an MIP model. ► Simulation results are presented on the IEEE 30-bus and IEEE 118-bus test systems. - Abstract: In this paper, a new security-constrained self-scheduling framework incorporating the transmission flow limits in both steady state conditions and post-contingent states is presented to produce efficient bidding strategy for generation companies (GENCOs) in day-ahead electricity markets. Moreover, the proposed framework takes into account the uncertainty of the predicted market prices and models the risk and profit tradeoff of a GENCO based on an efficient multi-objective model. Furthermore, unit commitment and inter-temporal constraints of generators are considered in the suggested model converting it to a mixed-integer programming (MIP) optimization problem. Sensitivity of the proposed framework with respect to both the level of the market prices and adopted risk level is also evaluated in the paper. Simulation results are presented on the IEEE 30-bus and IEEE 118-bus test systems illustrating the performance of the proposed self-scheduling model.

Interactive Dynamic Mission Scheduling for ASCA

Science.gov (United States)

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

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

BR-SIPP: PETROBRAS Integrated Scheduling System; BR-SIPP: Sistema Integrado de Progamacao de Producao da PETROBRAS

Energy Technology Data Exchange (ETDEWEB)

Pereira, Cristiane S.; Joly, Marcel; Hassimotto, Marcelo K.; Magalhaes, Marcus Vinicius O. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil)

2008-07-01

The lack of a computational aided technology to support short-term scheduling activity in the oil and petrochemical sector has been identified as one of the major obstacles to the harmonic integration of production objectives subsequent to the implementation of the advanced control systems and the consolidation of important benefits at the process unit level. Such technology refers to an analytical tool able to capture plant operational information consistent with the scheduling layer demands, modeling the production system economic performance, and providing mechanisms to consider commercial, operation and technological uncertainties. In this context, PETROBRAS has continuously dedicated effort to develop, implement and enhance its own refinery scheduling solution. Nowadays at its second version, the PETROBRAS Integrated Scheduling System (BR-SIPP - INPI grant 00067400) has become the focus of corporate care, given its critical role on the link between planning objectives and plant operations, according to the hierarchical decision strategy currently adopted by PETROBRAS. This paper presents an overview of the tool and illustrates some real-world applications and main realized benefits. (author)

Automated scheduling and planning from theory to practice

CERN Document Server

Ozcan, Ender; Urquhart, Neil

2013-01-01

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

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

Online Scheduling in Manufacturing A Cumulative Delay Approach

CERN Document Server

Suwa, Haruhiko

2013-01-01

Online scheduling is recognized as the crucial decision-making process of production control at a phase of “being in production" according to the released shop floor schedule. Online scheduling can be also considered as one of key enablers to realize prompt capable-to-promise as well as available-to-promise to customers along with reducing production lead times under recent globalized competitive markets. Online Scheduling in Manufacturing introduces new approaches to online scheduling based on a concept of cumulative delay. The cumulative delay is regarded as consolidated information of uncertainties under a dynamic environment in manufacturing and can be collected constantly without much effort at any points in time during a schedule execution. In this approach, the cumulative delay of the schedule has the important role of a criterion for making a decision whether or not a schedule revision is carried out. The cumulative delay approach to trigger schedule revisions has the following capabilities for the ...

Limited Preemptive Scheduling in Real-time Systems

OpenAIRE

Thekkilakattil, Abhilash

2016-01-01

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

Scheduling algorithms for saving energy and balancing load

Energy Technology Data Exchange (ETDEWEB)

Antoniadis, Antonios

2012-08-03

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

77 FR 6582 - Ferrovanadium and Nitrided Vanadium From Russia; Scheduling of a Full Five-Year Review

Science.gov (United States)

2012-02-08

... Nitrided Vanadium From Russia; Scheduling of a Full Five-Year Review AGENCY: United States International... Russia would be likely to lead to continuation or recurrence of material injury within a reasonably foreseeable time. For further information concerning the conduct of this review and rules of general...

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

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

Science.gov (United States)

2012-11-09

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

Utilization Bound of Non-preemptive Fixed Priority Schedulers

Science.gov (United States)

Park, Moonju; Chae, Jinseok

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

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

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

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

2015-01-01

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

[A unit for the care of acute headache attacks. A new experience in our milieu].

Science.gov (United States)

Zukerman, E; Lima, J G; Hannuch, S N; Nothen, M R; Carvalho, D de S

1989-01-01

This paper presents the aims of the first unit for treatment of headache crisis in a Brazilian Medical School. The differences between this unit and a neurological emergency unit and the therapeutic schedules are discussed.

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.

Joint optimization of CQI calculation and interference mitigation for user scheduling in MIMO-OFDM systems

KAUST Repository

Sadek, Mirette; Aï ssa, Sonia

2011-01-01

In MIMO-OFDM multiuser systems, user scheduling is employed as a means of multiple access. In a downlink scenario, users that share the same subcarriers of an OFDM symbol are separated through precoding in order to achieve space division multiple access (SDMA). User scheduling techniques rely on channel knowledge at the transmitter, namely, the so-called channel quality indicator (CQI). In this paper, we implement a leakage-based precoding algorithm whose purpose is twofold. First, it is used to compute a reliable CQI based on a group of precoding vectors that are adapted to the channel. Then, it implements user scheduling through using the optimum vectors for precoding, thus minimizing interference among users. We also introduce the concept of resource block size adaptivity. The resource block (RB) is defined as the least unit in an OFDM symbol that a user can be assigned to. We propose a variable RB size that adapts to the channel conditions. © 2011 IEEE.

Joint optimization of CQI calculation and interference mitigation for user scheduling in MIMO-OFDM systems

KAUST Repository

Sadek, Mirette

2011-05-01

In MIMO-OFDM multiuser systems, user scheduling is employed as a means of multiple access. In a downlink scenario, users that share the same subcarriers of an OFDM symbol are separated through precoding in order to achieve space division multiple access (SDMA). User scheduling techniques rely on channel knowledge at the transmitter, namely, the so-called channel quality indicator (CQI). In this paper, we implement a leakage-based precoding algorithm whose purpose is twofold. First, it is used to compute a reliable CQI based on a group of precoding vectors that are adapted to the channel. Then, it implements user scheduling through using the optimum vectors for precoding, thus minimizing interference among users. We also introduce the concept of resource block size adaptivity. The resource block (RB) is defined as the least unit in an OFDM symbol that a user can be assigned to. We propose a variable RB size that adapts to the channel conditions. © 2011 IEEE.

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

Cure Schedule for Stycast 2651/Catalyst 9.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

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

Job shop scheduling problem with late work criterion

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

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

MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

Directory of Open Access Journals (Sweden)

Ladislav Rosocha

2015-07-01

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

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

Sport Tournament Automated Scheduling System

Directory of Open Access Journals (Sweden)

Raof R. A. A

2018-01-01

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

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

NARCIS (Netherlands)

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

2005-01-01

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

78 FR 14508 - Notice of Affirmation of Addition of a Treatment Schedule for Methyl Bromide Fumigation of...

Science.gov (United States)

2013-03-06

... contacting the Animal and Plant Health Inspection Service, Plant Protection and Quarantine, Manuals Unit, 92... the Plant Protection and Quarantine Treatment Manual a treatment schedule for methyl bromide..., 2013, we are affirming the addition to the Plant Protection and Quarantine Treatment Manual of the...

Scheduling nursing personnel on a microcomputer.

Science.gov (United States)

Liao, C J; Kao, C Y

1997-01-01

Suggests that with the shortage of nursing personnel, hospital administrators have to pay more attention to the needs of nurses to retain and recruit them. Also asserts that improving nurses' schedules is one of the most economic ways for the hospital administration to create a better working environment for nurses. Develops an algorithm for scheduling nursing personnel. Contrary to the current hospital approach, which schedules nurses on a person-by-person basis, the proposed algorithm constructs schedules on a day-by-day basis. The algorithm has inherent flexibility in handling a variety of possible constraints and goals, similar to other non-cyclical approaches. But, unlike most other non-cyclical approaches, it can also generate a quality schedule in a short time on a microcomputer. The algorithm was coded in C language and run on a microcomputer. The developed software is currently implemented at a leading hospital in Taiwan. The response to the initial implementation is quite promising.

Vehicle and driver scheduling for public transit.

Science.gov (United States)

2009-08-01

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

A hybrid job-shop scheduling system

Science.gov (United States)

Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas

1992-01-01

The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.

Brief-stimulus presentations on multiform tandem schedules

OpenAIRE

Reed, Phil

1994-01-01

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

Time and Energy Efficient DVS Scheduling for Real-Time Pinwheel Tasks

OpenAIRE

Da-Ren, Chen; Young-Long, Chen; You-Shyang, Chen

2014-01-01

Dynamic voltage/frequency scaling (DVFS) is one of the most effective techniques for reducing energy use. In this paper, we focus on the pinwheel task model to develop a variable voltage processor with d discrete voltage/speed levels. Depending on the granularity of execution unit to which voltage scaling is applied, DVFS scheduling can be defined in two categories: (i) inter-task DVFS and (ii) intra-task DVFS. In the periodic pinwheel task model, we modified the definitions of both intra- an...

Mathematical programming and financial objectives for scheduling projects

CERN Document Server

Kimms, Alf

2001-01-01

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

BINARY PARTICLE SWARM OPTIMIZATION APPROACH FOR RANDOM GENERATION OUTAGE MAINTENANCE SCHEDULING

Directory of Open Access Journals (Sweden)

K. Suresh

2013-01-01

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

Evaluating the effectiveness of mixed-integer linear programming for day-ahead hydro-thermal self-scheduling considering price uncertainty and forced outage rate

International Nuclear Information System (INIS)

Esmaeily, Ali; Ahmadi, Abdollah; Raeisi, Fatima; Ahmadi, Mohammad Reza; Esmaeel Nezhad, Ali; Janghorbani, Mohammadreza

2017-01-01

A new optimization framework based on MILP model is introduced in the paper for the problem of stochastic self-scheduling of hydrothermal units known as HTSS Problem implemented in a joint energy and reserve electricity market with day-ahead mechanism. The proposed MILP framework includes some practical constraints such as the cost due to valve-loading effect, the limit due to DRR and also multi-POZs, which have been less investigated in electricity market models. For the sake of more accuracy, for hydro generating units’ model, multi performance curves are also used. The problem proposed in this paper is formulated using a model on the basis of a stochastic optimization technique while the objective function is maximizing the expected profit utilizing MILP technique. The suggested stochastic self-scheduling model employs the price forecast error in order to take into account the uncertainty due to price. Besides, LMCS is combined with roulette wheel mechanism so that the scenarios corresponding to the non-spinning reserve price and spinning reserve price as well as the energy price at each hour of the scheduling are generated. Finally, the IEEE 118-bus power system is used to indicate the performance and the efficiency of the suggested technique. - Highlights: • Characterizing the uncertainties of price and FOR of units. • Replacing the fixed ramping rate constraints with the dynamic ones. • Proposing linearized model for the valve-point effects of thermal units. • Taking into consideration the multi-POZs relating to the thermal units. • Taking into consideration the multi-performance curves of hydroelectric units.

Stress-reducing preventive maintenance model for a unit under stressful environment

International Nuclear Information System (INIS)

Park, J.H.; Chang, Woojin; Lie, C.H.

2012-01-01

We develop a preventive maintenance (PM) model for a unit operated under stressful environment. The PM model in this paper consists of a failure rate model and two cost models to determine the optimal PM scheduling which minimizes a cost rate. The assumption for the proposed model is that stressful environment accelerates the failure of the unit and periodic maintenances reduce stress from outside. The failure rate model handles the maintenance effect of PM using improvement and stress factors. The cost models are categorized into two failure recognition cases: immediate failure recognition and periodic failure detection. The optimal PM scheduling is obtained by considering the trade-off between the related cost and the lifetime of a unit in our model setting. The practical usage of our proposed model is tested through a numerical example.

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

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

2017-08-01

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

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

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

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

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

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

Prescribed Travel Schedules for Fatigue Management

Science.gov (United States)

Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

2011-01-01

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

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

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

2018-02-01

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

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

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

2018-03-01

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

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

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

Flow shop scheduling with heterogeneous workers

OpenAIRE

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

2014-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

21 CFR 113.83 - Establishing scheduled processes.

Science.gov (United States)

2010-04-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-06

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

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

Directory of Open Access Journals (Sweden)

Chandramouli Anandaraman

2011-10-01

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

GSA eLibrary Schedules and Contracts

Data.gov (United States)

General Services Administration — GSA eLibrary (formerly Schedules e-Library) is the online source for the latest contract award information for: GSA Schedules; Department of Veterans Affairs (VA)...

Minimizing tardiness for job shop scheduling under uncertainties

OpenAIRE

Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

2016-01-01

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

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

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

1992-05-01

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

78 FR 9937 - Certain Pasta From Italy and Turkey Scheduling of Full Five-Year Reviews Concerning the...

Science.gov (United States)

2013-02-12

...)] Certain Pasta From Italy and Turkey Scheduling of Full Five-Year Reviews Concerning the Countervailing and Antidumping Duty Orders on Certain Pasta From Italy and Turkey AGENCY: United States International Trade... whether revocation of the countervailing and antidumping duty orders on certain pasta from Italy and...

76 FR 50252 - Gray Portland Cement and Cement Clinker From Japan; Scheduling of an Expedited Five-Year Review...

Science.gov (United States)

2011-08-12

... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-461 (Third Review)] Gray Portland Cement and Cement Clinker From Japan; Scheduling of an Expedited Five-Year Review Concerning the Antidumping Duty Order on Gray Portland Cement and Cement Clinker From Japan AGENCY: United States International...

14 CFR 399.81 - Unrealistic or deceptive scheduling.

Science.gov (United States)

2010-01-01

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

Kozloduy NPP units 5 and 6 modernization program. Measures implementation in outages

International Nuclear Information System (INIS)

Naydenov, N.; Mignone, O.

2004-01-01

The units 5 and 6 modernization program is a highly demanding program composed by many plant modifications and studies about plant conditions. The program measures implementation during the units outages represents a challenge by the need to compromise shut down duration with the workload related to measures installation. The units shutdown duration should be kept to the planned duration. In parallel, contractors work has to be organized, planned and performed to allow successful measures completion. In accordance with the contract requirements, contractors prepare installation documents which comprise all activities to be performed during the installation and testing of the measures. The subcontractors complement these installation documents with the project organization and execution documents, which include the manpower skills, qualifications, work orders, and other important installation instructions and information. Contractors prepared detailed installation schedules, and these were integrated by Parsons E and C in the Integrated installation schedule. The integrated schedule proved to be useful to identify possible area usage conflicts and manpower overlapping, with appropriate results for electrical, instrumentation and control work, and for the utilization of the polar crane in the containment building. Contractors installation schedules were updated on a weekly basis, showing variances versus the target, and manpower histograms for the resource loading. Organization of contractors work was supported by KNPP plant outage meetings, in which status and problems were addressed, and solution and/or corrective actions defined for further implementation. KNPP meetings were planned on a daily basis for most relevant or critical measures, or on a weekly basis for less intensive measures. KNPP meetings proved to be an excellent communication tool for keeping the measures under control and monitoring KNPP defined personnel responsible for authorizing changes, in

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

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

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)

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

1990-01-01

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

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

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

2013-01-01

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

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

KAUST Repository

Celik, Abdulkadir

2016-09-12

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

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

Generation risk assessment in volatile conditions with wind, hydro, and natural gas units

International Nuclear Information System (INIS)

Sahin, Cem; Shahidehpour, Mohammad; Erkmen, Ismet

2012-01-01

Highlights: ► Stochastic price-based unit commitment (PBUC) for a generation company (GENCO). ► Water inflow, wind, and NG interruption uncertainties are considered. ► Diversification of assets and bilateral contracts enhance payoff and decrease financial risk. ► The utilization of NG in the risk-neutral GENCO case increases as the wind uncertainty increases. ► NG utilization is lowered by the algorithm to decrease in risk-considered case. -- Abstract: This paper studies a generating company (GENCO)’s midterm (a few months to a year) scheduling payoffs and risks in volatile operating conditions. The proposed algorithm considers the integration of intermittent wind units into a GENCO’s generation assets and coordinates the GENCO’s hourly wind generation schedule with that of natural gas (NG) units (with volatile gas prices) and hydro units (with water inflow forecast) for maximizing the GENCO’s payoff. The proposed midterm GENCO model applies market price forecasts to the risk-constrained stochastic price-based unit commitment (PBUC) for calculating the GENCO’s risk in energy and ancillary services markets. The proposed PBUC minimizes the cost of (a) NG contracts, storage, startup and shutdown, (b) startup and shutdown of cascaded hydro units, and (c) penalty for defaulting on the scheduled power delivery. Simulation results show that the diversification of generating assets including bilateral contracts (BCs) could enhance the GENCO’s midterm planning by increasing the expected payoff and decreasing the financial risk.

Resource utilization in surgery after the revision of surgical fee schedule in Japan.

Science.gov (United States)

Nakata, Yoshinori; Yoshimura, Tatsuya; Watanabe, Yuichi; Otake, Hiroshi; Oiso, Giichiro; Sawa, Tomohiro

2015-01-01

The purpose of this paper is to examine whether the current surgical reimbursement system in Japan reflects resource utilization after the revision of fee schedule in 2014. The authors collected data from all the surgical procedures performed at Teikyo University Hospital from April 1 through September 30, 2014. The authors defined the decision-making unit as a surgeon with the highest academic rank in the surgery. Inputs were defined as the number of medical doctors who assisted surgery, and the time of operation from skin incision to closure. An output was defined as the surgical fee. The authors calculated surgeons' efficiency scores using data envelopment analysis. The efficiency scores of each surgical specialty were significantly different (p=0.000). This result demonstrates that the Japanese surgical reimbursement scales still fail to reflect resource utilization despite the revision of surgical fee schedule.

Decay-usage scheduling in multiprocessors

NARCIS (Netherlands)

Epema, D.H.J.

1998-01-01

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

A Monte-Carlo-Based Method for the Optimal Placement and Operation Scheduling of Sewer Mining Units in Urban Wastewater Networks

Directory of Open Access Journals (Sweden)

Eleftheria Psarrou

2018-02-01

Full Text Available Pressures on water resources, which have increased significantly nowadays mainly due to rapid urbanization, population growth and climate change impacts, necessitate the development of innovative wastewater treatment and reuse technologies. In this context, a mid-scale decentralized technology concerning wastewater reuse is that of sewer mining. It is based on extracting wastewater from a wastewater system, treating it on-site and producing recycled water applicable for non-potable uses. Despite the technology’s considerable benefits, several challenges hinder its implementation. Sewer mining disturbs biochemical processes inside sewers and affects hydrogen sulfide build-up, resulting in odor, corrosion and health-related problems. In this study, a tool for optimal sewer mining unit placement aiming to minimize hydrogen sulfide production is presented. The Monte-Carlo method coupled with the Environmental Protection Agency’s Storm Water Management Model (SWMM is used to conduct multiple simulations of the network. The network’s response when sewage is extracted from it is also examined. Additionally, the study deals with optimal pumping scheduling. The overall methodology is applied in a sewer network in Greece providing useful results. It can therefore assist in selecting appropriate locations for sewer mining implementation, with the focus on eliminating hydrogen sulfide-associated problems while simultaneously ensuring that higher water needs are satisfied.

76 FR 23835 - Solid Urea From Russia and Ukraine; Scheduling of Full Five-Year Reviews Concerning the...

Science.gov (United States)

2011-04-28

... Urea From Russia and Ukraine; Scheduling of Full Five-Year Reviews Concerning the Antidumping Duty Orders on Solid Urea From Russia and Ukraine AGENCY: United States International Trade Commission. ACTION... of the antidumping duty orders on solid urea from Russia and Ukraine would be likely to lead to...

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

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

Schedulability Analysis for Java Finalizers

DEFF Research Database (Denmark)

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

2010-01-01

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

Nonblocking Scheduling for Web Service Transactions

DEFF Research Database (Denmark)

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

2007-01-01

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

Optimal Scheduling of Distributed Energy Resources and Responsive Loads in Islanded Microgrids Considering Voltage and Frequency Security Constraints

DEFF Research Database (Denmark)

Vahedipour-Dahraie, Mostafa; Najafi, Hamid Reza; Anvari-Moghaddam, Amjad

2018-01-01

in islanded MGs with regard to voltage and frequency security constraints. Based on the proposed model, scheduling of the controllable units in both supply and demand sides is done in a way not only to maximize the expected profit of MG operator (MGO), but also to minimize the energy payments of customers...... on the system’s performance in terms of voltage and frequency stability. Moreover, optimal coordination of DERs and responsive loads can increase the expected profit of MGO significantly. The effectiveness of the proposed scheduling approach is verified on an islanded MG test system over a 24-h period....

Short term hydroelectric power system scheduling with wind turbine generators using the multi-pass iteration particle swarm optimization approach

International Nuclear Information System (INIS)

Lee, T.-Y.

2008-01-01

This paper uses multi-pass iteration particle swarm optimization (MIPSO) to solve short term hydroelectric generation scheduling of a power system with wind turbine generators. MIPSO is a new algorithm for solving nonlinear optimal scheduling problems. A new index called iteration best (IB) is incorporated into particle swarm optimization (PSO) to improve solution quality. The concept of multi-pass dynamic programming is applied to modify PSO further and improve computation efficiency. The feasible operational regions of the hydro units and pumped storage plants over the whole scheduling time range must be determined before applying MIPSO to the problem. Wind turbine power generation then shaves the power system load curves. Next, MIPSO calculates hydroelectric generation scheduling. It begins with a coarse time stage and searching space and refines the time interval between two time stages and the search spacing pass by pass (iteration). With the cooperation of agents called particles, the near optimal solution of the scheduling problem can be effectively reached. The effects of wind speed uncertainty were also considered in this paper. The feasibility of the new algorithm is demonstrated by a numerical example, and MIPSO solution quality and computation efficiency are compared to those of other algorithms

Flexible Work Schedules. ERIC Digest.

Science.gov (United States)

Kerka, Sandra

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

Cost and schedule reduction for next-generation Candu

International Nuclear Information System (INIS)

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

2002-01-01

construction costs through more efficient work planning and use of materials, through reduced re-work and through more precise configuration management. Full-scale exploitation of AECL's electronic engineering and project management tools enables further reductions in cost. The Candu fuel-channel reactor type offers inherent manufacturing and construction advantages through the application of a simple, low-pressure low-temperature reactor vessel along with modular fuel channel technology. This leads to cost benefits and total project schedule benefits. As a result, the targets which AECL has set for replication units - overnight capital cost of $1000 US/kW and total project schedule (engineering/manufacturing/construction/commissioning) of 48 months, have been shown to be achievable for the reference NG Candu design. (authors)

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

Science.gov (United States)

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Toward an Autonomous Telescope Network: the TBT Scheduler

Science.gov (United States)

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

2015-09-01

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

Modelling altered fractionation schedules

International Nuclear Information System (INIS)

Fowler, J.F.

1993-01-01

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

Comment on “Short-term combined economic emission scheduling of hydrothermal power systems with cascaded reservoirs using differential evolution” by K.K. Mandal and N. Chakaborty [Energy Convers. Manage. 50 (2009) 97–104

International Nuclear Information System (INIS)

Ahmadi, Abdollah; Nezhad, Ali Esmaeel

2015-01-01

This paper discusses the short-term combined economic emission scheduling of hydrothermal power systems with cascaded reservoirs [Energy Convers Manage. 50 (2009) 97–104], while differential evolution algorithm has been employed to solve the optimization problem. However, this problem is subjected to several constraints like the generation limitations of generating units. The solutions reported in the original paper do not satisfy the constraint on the initial and final reservoir storage volumes of hydro units as well as the constraint on the generated power by such units, which should be positive at any time of the scheduling period. Thus, this paper intends to prove this issue and solve the problem using Normal Boundary Intersection (NBI) method, in order to propose the correct solutions satisfying all the constraints of the short-term hydrothermal scheduling problem

Pittsburgh International Airport - Scheduled Passenger Traffic

Data.gov (United States)

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

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

KAUST Repository

Shaqfeh, Mohammad

2011-12-01

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

Where do we stand with fuzzy project scheduling?

CERN Document Server

Bonnal, Pierre; Lacoste, Germain

2004-01-01

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

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

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

Mission Operations Planning and Scheduling System (MOPSS)

Science.gov (United States)

Wood, Terri; Hempel, Paul

2011-01-01

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

The ACR: Advanced design features for a short construction schedule

International Nuclear Information System (INIS)

Elgohary, M.; Fairclough, N.

2003-01-01

Building on the successful CANDU construction at Qinshan, the ACR-700 is designed with constructability considerations as a major requirement during all project phases from the concept design stage to the detail design stage. A project schedule of 48 months has been developed for the nth ACR unit with a 36 months construction period from First Concrete to Fuel Load. This paper describes some of the advanced design features implemented in the reactor building design in order to achieve this short construction period. These features include large volume concrete pours, prefabricated rebar, composite structures, prefabricated permanent formwork and significant modularization and prefabrication

Post LS1 schedule

CERN Document Server

Lamont, M

2014-01-01

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

Realistic Scheduling Mechanism for Smart Homes

Directory of Open Access Journals (Sweden)

Danish Mahmood

2016-03-01

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

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

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

Scheduling job shop - A case study

Science.gov (United States)

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

2016-08-01

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

78 FR 76856 - Silicon Metal From Russia; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty...

Science.gov (United States)

2013-12-19

... Russia; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Silicon Metal From Russia AGENCY: United States International Trade Commission. ACTION: Notice. SUMMARY: The Commission... silicon metal from Russia would be likely to lead to continuation or recurrence of material injury within...

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.

Long term scheduling technique for wastewater minimisation in multipurpose batch processes

CSIR Research Space (South Africa)

Nonyane, DR

2012-05-01

Full Text Available (2011) xxx?xxx Contents lists available at SciVerse ScienceDirect Applied Mathematical Modelling doi:10.1016/j.apm.2011.08.007 The effect of industrial activities on freshwater resources has become more apparent in the past few decades. This has led... journal homepage: www.elsevier .com/locate /apm e, T. Majozi, Long term scheduling technique for wastewater minimisation in multipurpose :10.1016/j.apm.2011.08.007 Nomenclature Sets P {p|p = time point} J {j|j = unit} C {c|c = contaminant} Sin {sin...

Economic power schedule and transactive energy through an intelligent centralized energy management system for a DC residential distribution system

DEFF Research Database (Denmark)

Yue, Jingpeng; Hu, Zhijian; Li, Chendan

2017-01-01

Direct current (DC) residential distribution systems (RDS) consisting of DC living homes will be a significant integral part of future green transmission. Meanwhile, the increasing number of distributed resources and intelligent devices will change the power flow between the main grid...... (CEMS), but also a control approach to implement and ensure DG output voltages to various DC buses in a DC RDS. Based on data collection, prediction and a certain objectives, the expert system in a CEMS can work out the optimization schedule, after this, the voltage droop control for steady voltage...... is aligned with the command of the unit power schedule. In this work, a DC RDS is used as a case study to demonstrate the process, the RDS is associated with unit economic models, and a cost minimization objective is proposed that is to be achieved based on the real-time electrical price. The results show...

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

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

The robust schedule - A link to improved workflow

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2012-01-01

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

Shiftwork Scheduling for the 1990s.

Science.gov (United States)

Coleman, Richard M.

1989-01-01

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

CMS Records Schedule

Data.gov (United States)

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

Planning construction of integrative schedule management for nuclear power project

International Nuclear Information System (INIS)

Zeng Zhenglin; Wang Wenying; Peng Fei

2012-01-01

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

Spent nuclear fuel project integrated schedule plan

International Nuclear Information System (INIS)

Squires, K.G.

1995-01-01

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

Spent nuclear fuel project integrated schedule plan

Energy Technology Data Exchange (ETDEWEB)

Squires, K.G.

1995-03-06

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

Agent-based scheduling for aircraft deicing

NARCIS (Netherlands)

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

2006-01-01

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

Theoretical Investigation of Combined Use of PSO, Tabu Search and Lagrangian Relaxation methods to solve the Unit Commitment Problem

Directory of Open Access Journals (Sweden)

Sahbi Marrouchi

2018-02-01

Full Text Available Solving the Unit Commitment problem (UCP optimizes the combination of production units operations and determines the appropriate operational scheduling of each production units to satisfy the expected consumption which varies from one day to one month. Besides, each production unit is conducted to constraints that render this problem complex, combinatorial and nonlinear. In this paper, we proposed a new strategy based on the combination three optimization methods: Tabu search, Particle swarm optimization and Lagrangian relaxation methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.

Knowledge-based scheduling of arrival aircraft

Science.gov (United States)

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

1995-01-01

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

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.

Work schedule flexibility is associated with emotional exhaustion among registered nurses in Swiss hospitals: A cross-sectional study.

Science.gov (United States)

Dhaini, Suzanne R; Denhaerynck, Kris; Bachnick, Stefanie; Schwendimann, René; Schubert, Maria; De Geest, Sabina; Simon, Michael

2018-06-01

Emotional exhaustion among healthcare workers is a widely investigated, well-recognized problem, the incidence of which has recently been linked to work environment factors, particularly work/family conflict. However, another environmental feature that may be equally influential, but that is more amenable to nurse manager action, remains less recognized: shift schedule flexibility. This study's main purposes were to assess variations in work schedule flexibility between Swiss acute care hospital units, and to investigate associations between psychosocial work environment (e.g. work schedule flexibility) and self-reported emotional exhaustion among registered nurses. This is a secondary analysis of data collected for the multi-center observational cross-sectional Match RN study, which included a national sample of 23 hospitals and 1833 registered nurses across Switzerland. Overall, self-reported work schedule flexibility among registered nurses was limited: 32% of participants reported little or no influence in planning their own shifts. Work schedule flexibility (β -0.11; CI -0.16; -0.06) and perceived nurse manager ability (β -0.30; CI -0.49; -0.10) were negatively related to self-reported emotional exhaustion. Work-family conflict (β 0.39; CI 0.33; 0.45) was positively correlated to emotional exhaustion. The study results indicate that managerial efforts to improve working environments, including special efforts to improve work schedule flexibility, might play an important role in promoting nurses' emotional health. Copyright © 2018 Elsevier Ltd. All rights reserved.

Diverse task scheduling for individualized requirements in cloud manufacturing

Science.gov (United States)

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

2018-03-01

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

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

Science.gov (United States)

2013-05-16

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

Interoceanic canal excavation scheduling via computer simulation

Energy Technology Data Exchange (ETDEWEB)

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

1970-05-15

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

Interoceanic canal excavation scheduling via computer simulation

International Nuclear Information System (INIS)

Baldonado, Orlino C.

1970-01-01

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

Robust scheduling in an uncertain environment

NARCIS (Netherlands)

Wilson, M.

2016-01-01

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

A cloud-based electronic medical record for scheduling, tracking, and documenting examinations and treatment of retinopathy of prematurity.

Science.gov (United States)

Arnold, Robert W; Jacob, Jack; Matrix, Zinnia

2012-01-01

Screening by neonatologists and staging by ophthalmologists is a cost-effective intervention, but inadvertent missed examinations create a high liability. Paper tracking, bedside schedule reminders, and a computer scheduling and reminder program were compared for speed of input and retrospective missed examination rate. A neonatal intensive care unit (NICU) process was then programmed for cloud-based distribution for inpatient and outpatient retinopathy of prematurity monitoring. Over 11 years, 367 premature infants in one NICU were prospectively monitored. The initial paper system missed 11% of potential examinations, the Windows server-based system missed 2%, and the current cloud-based system missed 0% of potential inpatient and outpatient examinations. Computer input of examinations took the same or less time than paper recording. A computer application with a deliberate NICU process improved the proportion of eligible neonates getting their scheduled eye examinations in a timely manner. Copyright 2012, SLACK Incorporated.

Integrated Waste Treatment Unit GFSI Risk Management Plan

International Nuclear Information System (INIS)

W. A. Owca

2007-01-01

This GFSI Risk Management Plan (RMP) describes the strategy for assessing and managing project risks for the Integrated Waste Treatment Unit (IWTU) that are specifically within the control and purview of the U.S. Department of Energy (DOE), and identifies the risks that formed the basis for the DOE contingency included in the performance baseline. DOE-held contingency is required to cover cost and schedule impacts of DOE activities. Prior to approval of the performance baseline (Critical Decision-2) project cost contingency was evaluated during a joint meeting of the Contractor Management Team and the Integrated Project Team for both contractor and DOE risks to schedule and cost. At that time, the contractor cost and schedule risk value was $41.3M and the DOE cost and schedule risk contingency value is $39.0M. The contractor cost and schedule risk value of $41.3M was retained in the performance baseline as the contractor's management reserve for risk contingency. The DOE cost and schedule risk value of $39.0M has been retained in the performance baseline as the DOE Contingency. The performance baseline for the project was approved in December 2006 (Garman 2006). The project will continue to manage to the performance baseline and change control thresholds identified in PLN-1963, ''Idaho Cleanup Project Sodium-Bearing Waste Treatment Project Execution Plan'' (PEP)

Solving project scheduling problems by minimum cut computations

NARCIS (Netherlands)

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

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

Fractionation schedules for cancers of the head and neck

International Nuclear Information System (INIS)

Harari, Paul M.

1995-01-01

Purpose/Objective: This refresher course reviews current research activity and treatment results in the field of radiation therapy fractionation. The presentation emphasizes worldwide studies of altered fractionation, highlighting head and neck cancer as the primary teaching model. Basic radiobiological principles guiding the development of altered fractionation regimens, and advancing the understanding of fractionation effects on normal and tumor tissue are reviewed. A 'standard' prescription of 2 Gy x 35 fractions = 70 Gy may not provide the optimal balance between primary tumor control and late normal tissue effects for all patients with squamous cell carcinoma of the head and neck. The last decade has witnessed the treatment of thousands of head and neck cancer patients with curative radiotherapy using altered fractination schedules designed to improve overall treatment results. Although the number of different fractionation regimens currently being investigated continues to increase, the common guiding principles behind their design are relatively simple. Common fractionation terminology (i.e., accelerated hyperfractionation) will be reviewed, as well as a brief summary of radiobiological concepts pertaining to tumor potential doubling time, tumor proliferation kinetics, overall treatment time and fraction size-dependence of acute and late tissue effects. Several well known head and neck fractionation schedules from around the world (Manchester Christie Hospital-United Kingdom, Princess Margaret Hospital-Canada, Massachusetts General Hospital-USA, MD Anderson Hospital-USA, University of Florida-USA, Mount Vernon Hospital CHART-United Kingdom, RTOG and EORTC trials-USA and Europe) will be summarized with regard to design-rationale, treatment technique and results. The design of several current cooperative group trials investigating altered head and neck fractionation will be presented, as well as concepts prompting the pilot evaluation of several brand new

DMEPOS Fee Schedule

Data.gov (United States)

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

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

International Nuclear Information System (INIS)

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

2014-01-01

The large scale penetration of electric vehicles (EVs) will introduce technical challenges to the distribution grid, but also carries the potential for vehicle-to-grid services. Namely, if available in large enough numbers, EVs can be used as a distributed energy resource (DER) and their presence can influence optimal DER investment and scheduling decisions in microgrids. In this work, a novel EV fleet aggregator model is introduced in a stochastic formulation of DER-CAM [1], an optimization tool used to address DER investment and scheduling problems. This is used to assess the impact of EV interconnections on optimal DER solutions considering uncertainty in EV driving schedules. Optimization results indicate that EVs can have a significant impact on DER investments, particularly if considering short payback periods. Furthermore, results suggest that uncertainty in driving schedules carries little significance to total energy costs, which is corroborated by results obtained using the stochastic formulation of the problem. - Highlights: • This paper introduces a new EV aggregator model in the DER-CAM model and expands it with a stochastic formulation. • The model is used to analyze the impact of EVs in DER investment decisions in a large office building. • The uncertainty in EV driving patterns is considered through scenarios based on data from a daily commute driving survey. • Results indicate that EVs have a significant impact in optimal DER decisions, particularly when looking at short payback periods. • Furthermore, results indicate that uncertainty in EV driving schedules has little impact on DER investment decisions

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

International Nuclear Information System (INIS)

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

2014-01-01

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

Designing of vague logic based multilevel feedback queue scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-03-01

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

76 FR 28194 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2011-05-16

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

75 FR 27228 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2010-05-14

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

77 FR 50713 - Steel Wire Garment Hangers From Taiwan and Vietnam; (Corrected Notice) Scheduling of the Final...

Science.gov (United States)

2012-08-22

...)] Steel Wire Garment Hangers From Taiwan and Vietnam; (Corrected Notice) Scheduling of the Final Phase of...) under section 735(b) of the Act (19 U.S.C. 1673d(b)) to determine whether an industry in the United States is materially injured or threatened with material injury, or the establishment of an industry in...

A Study of an Appointment Scheduling System for Outpatients at the United States Air Force Academy Hospital.

Science.gov (United States)

1988-07-30

8a. NAME OF FUNDING/SPONSORING 8b. OFFICE SYMBOL 9. PROCUREMENT INSTRUMENT IDENTIFICATION NUMBER ORGANIZATION (If applicable) 8c. ADDRESS (City, State...Services are provided in General Dentistry, Oral Surgery, Periodontics, Prosthodontics, Endodontics , and Orthodontics (MHR 1987, 4-5). The hospital also...appointment D. Shields 4 clerks using a rotary wheel file. Schedules were forwarded to outpatien records to pull the patient record prior to the clinic

A decentralized scheduling algorithm for time synchronized channel hopping

Directory of Open Access Journals (Sweden)

Andrew Tinka

2011-09-01

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

On Coding of Scheduling Information in OFDM

OpenAIRE

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

2009-01-01

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

Trustable Virtual Machine Scheduling in a Cloud

OpenAIRE

Hermenier , Fabien; Henrio , Ludovic

2017-01-01

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

Management of Temporal Constraints for Factory Scheduling.

Science.gov (United States)

1987-06-01

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

7 CFR 305.23 - Steam sterilization treatment schedules.

Science.gov (United States)

2010-01-01

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

77 FR 33980 - Proposed FOIA Fee Schedule Update

Science.gov (United States)

2012-06-08

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

An Integrated and Optimal Joint Scheduling of Energy Resources to Feed Electrical, Thermal and Potable Water Demands in Remote Area

Directory of Open Access Journals (Sweden)

R. Ghaffarpour

2016-12-01

Full Text Available The continuous spread of distributed energy resources (DERs such as combined heating and power (CHP, diesel generators, boilers and renewable energy sources provide an effective solution to energy related problems to serve the power and heat demands with minimum cost. Moreover, the DERs may play a significant role for supplying power and heat in rural areas, where grid electricity is not available. Also, some dry areas may face water scarcity and salinity problems. So, one important solution is the use of DERs to drive desalination units in order to solve water scarcity and salinity problems. In this study, the optimal scheduling of DERs and reverse osmosis (RO desalination unit that feed the required electric, thermal and potable water demands are determined. The present paper describes the operation constraints and cost function of components of the system in detail. Operation constraints of generation units as well as feasible region of operation CHP in dual dependency characteristic are taken into account. To confirm the performance of the proposed model the approach is tested on a realistic remote area over a 24-h period. The results show that the economical scheduling of DERs and desalination units can be obtained using proposed methodology by implementing the proposed formulation.

Residency Applicants Prefer Online System for Scheduling Interviews

Directory of Open Access Journals (Sweden)

Wills, Charlotte

2015-03-01

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

Genetic algorithm to solve the problems of lectures and practicums scheduling

Science.gov (United States)

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

2018-02-01

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

A dynamic approach to vehicle scheduling

NARCIS (Netherlands)

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

2001-01-01

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

21 CFR 1308.13 - Schedule III.

Science.gov (United States)

2010-04-01

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

29 CFR 825.202 - Intermittent leave or reduced leave schedule.

Science.gov (United States)

2010-07-01

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

Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

Directory of Open Access Journals (Sweden)

Yi Han

2013-01-01

Full Text Available This paper presents a shuffled frog leaping algorithm (SFLA for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.

Optimal Temporal Decoupling in Task Scheduling with Preferences

NARCIS (Netherlands)

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

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-01-01

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

Request-Driven Schedule Automation for the Deep Space Network

Science.gov (United States)

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

2010-01-01

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

H. B. Robinson Plant, Unit 2. Annual operating report for 1976

International Nuclear Information System (INIS)

1977-01-01

The unit achieved a good performance record through the year, experiencing only short duration shutdowns or power reductions. Information is presented concerning operations, maintenance, shutdowns, and occupational radiation exposures. In November there was a scheduled refueling lasting 40 days. After a start-up physics test program, the unit achieved 100 percent power on December 22, 1976

PLAN-IT - Scheduling assistant for solar system exploration

International Nuclear Information System (INIS)

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

1987-01-01

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

Management Matters. Changing to Flexible Scheduling

Science.gov (United States)

Pappas, Marjorie L.

2005-01-01

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

DME Prosthetics Orthotics, and Supplies Fee Schedule

Data.gov (United States)

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

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

Science.gov (United States)

Centers for Disease Control and Prevention, 2010

2010-01-01

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

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

Preparing nuclear power plant units for operation

International Nuclear Information System (INIS)

Hudcovic, R.; Telgarsky, K.; Kmosena, J.

1984-01-01

The factors are listed which have to be taken into consideration for planning the unit operation, i.e., the implementation of planned repairs, checks of equipment and refuellings. All basic input data were evaluated as the basic for drawing up the schedule of routine repairs and overhauls for the coming period. (E.S.)

Planning and Scheduling for Environmental Sensor Networks

Science.gov (United States)

Frank, J. D.

2005-12-01

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

The contract for the completion and commissioning of Cernavoda NPP - Unit

International Nuclear Information System (INIS)

2001-01-01

On May 18, 2001 the commercial contract for the completion and commissioning of the Cernavoda NPP Unit 2 has been signed by Nuclearelectrica National Company (SNN SA) and its partners, AECL-Canada and ANSALDO-Italy. This contract represents a continuation of the cooperation with AECL-Canada (the owner of the licence and the designer of the nuclear part of Cernavoda NPP Unit1) and ANSALDO-Italy (the designer of the conventional part of Cernavoda NPP Unit1). The completion is scheduled to last for 54 months (4.5 years) since the date the contract takes effect and the nuclear reactor start-up (the first criticality) is scheduled for the 49 th month. The total negotiated cost for the completion was estimated to amount to 689 million dollars, against the 750 million dollars initially estimated. The works at the site will be managed by an integrated staff team of specialized personnel form AECL-Canada (111 positions), ANSALDO-Italy (72 positions) and Romania (1200 positions)

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

Science.gov (United States)

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

2018-04-16

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

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

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

2018-03-01

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

Parental work schedules and child overweight and obesity.

Science.gov (United States)

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

2012-04-01

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

5 CFR 950.801 - Campaign schedule.

Science.gov (United States)

2010-01-01

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

A NEW APPROACH TO CLASS SCHEDULING. FINAL REPORT.

Science.gov (United States)

CANTER, JOHN; AND OTHERS

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

Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units

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)

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

Sleep pattern and decision-making in physicians from mobile emergency care service with 12-h work schedules.

Science.gov (United States)

Castro, Eleni de Araújo Sales; de Almondes, Katie Moraes

2018-06-01

Shift work schedules are biological standpoint worse because compel the body to anticipate periods of wakefulness and sleep and thus eventually cause a disruption of biological rhythms. The objective of this study is to evaluate the sleep pattern and decision-making in physicians working in mobile units of emergency attention undergoing day shift and rotating shift. The study included 26 physicians. The instruments utilized were a sociodemographic questionnaire, the Pittsburgh Sleep Quality Index, the Sleep Habits Questionnaire, the Epworth Sleepiness Scale and Chronotype Identification Questionnaire of Horne-Ostberg, the Iowa Gambling Task (IGT) and hypothetical scenarios of decision-making created according to the Policy-Capturing Technique. For inclusion and exclusion criteria, the participants answered the Chalder Fatigue Scale, the Beck Anxiety Inventory, the Beck Depression Inventory and the Inventory of Stress Symptoms for adults of Lipp. It was found good sleep quality for physicians on day shift schedule and bad sleep quality for physicians on rotating shift schedule. The IGT measure showed no impairment in decision-making, but the hypothetical scenarios revealed impairment decision-making during the shift for both schedules. Good sleep quality was related to a better performance in decision-making. Good sleep quality seems to influence a better performance in decision-making.

Multiple-Machine Scheduling with Learning Effects and Cooperative Games

Directory of Open Access Journals (Sweden)

Yiyuan Zhou

2015-01-01

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

Efficient Academic Scheduling at the U.S. Naval Academy

National Research Council Canada - National Science Library

Zane, David

2003-01-01

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

SOFIA's Choice: Automating the Scheduling of Airborne Observations

Science.gov (United States)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

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

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1997-01-01

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

Main summaries of construction of the Rovno NPP third unit

International Nuclear Information System (INIS)

Smoktij, I.P.; Tsetsenko, I.K.

1987-01-01

The main technical and economic indices attained at the Rovno and Zaporozhe NPPs are considered. The estimated costs of the main installations of the building site, organizations participating in construction, labor forces at different building sections, duration of different stages of construction, actual labor costs associated with the reactor unit, volumes of construction and installation work, the construction schedule for the Rovno Unit-3 are given

A PSO based Artificial Neural Network approach for short term unit commitment problem

Directory of Open Access Journals (Sweden)

AFTAB AHMAD

2010-10-01

Full Text Available Unit commitment (UC is a non-linear, large scale, complex, mixed-integer combinatorial constrained optimization problem. This paper proposes, a new hybrid approach for generating unit commitment schedules using swarm intelligence learning rule based neural network. The training data has been generated using dynamic programming for machines without valve point effects and using genetic algorithm for machines with valve point effects. A set of load patterns as inputs and the corresponding unit generation schedules as outputs are used to train the network. The neural network fine tunes the best results to the desired targets. The proposed approach has been validated for three thermal machines with valve point effects and without valve point effects. The results are compared with the approaches available in the literature. The PSO-ANN trained model gives better results which show the promise of the proposed methodology.

Cost-efficient scheduling of FAST observations

Science.gov (United States)

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

2018-03-01

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

Project schedule and cost estimate report

International Nuclear Information System (INIS)

1988-03-01

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

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

Hidden power system inflexibilities imposed by traditional unit commitment formulations

International Nuclear Information System (INIS)

Morales-España, Germán; Ramírez-Elizondo, Laura; Hobbs, Benjamin F.

2017-01-01

Highlights: • Quality and accuracy of traditional-energy- and power-based UCs are evaluated. • Real-time performance evaluation simulating “perfect” stochastic UCs. • Ideal energy-based stochastic UC formulations impose hidden system inflexibilities. • A deterministic power-based UC may outperform an ideal energy-based stochastic UC. • Power-based UC overcomes flaws of energy-based UC: lower cost and wind curtailment. - Abstract: Approximations made in traditional day-ahead unit commitment model formulations can result in suboptimal or even infeasible schedules for slow-start units and inaccurate predictions of actual costs and wind curtailment. With increasing wind penetration, these errors will become economically more significant. Here, we consider inaccuracies from three approximations: the use of hourly intervals in which energy production from each generator is modeled as being constant; the disregarding of startup and shutdown energy trajectories; and optimization based on expected wind profiles. The results of unit commitment formulations with those assumptions are compared to models that: (1) use a piecewise-linear power profiles of generation, load and wind, instead of the traditional stepwise energy profiles; (2) consider startup/shutdown trajectories; and (3) include many possible wind trajectories in a stochastic framework. The day-ahead hourly schedules of slow-start generators are then evaluated against actual wind and load profiles using a model real-time dispatch and quick-start unit commitment with a 5 min time step. We find that each simplification usually causes expected generation costs to increase by several percentage points, and results in significant understatement of expected wind curtailment and, in some cases, load interruptions. The inclusion of startup and shutdown trajectories often yielded the largest improvements in schedule performance.

The Synthesis of a Hardware Scheduler for Non-Manifest Loops

NARCIS (Netherlands)

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

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

Multiresource allocation and scheduling for periodic soft real-time applications

Science.gov (United States)

Gopalan, Kartik; Chiueh, Tzi-cker

2001-12-01

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

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

Directory of Open Access Journals (Sweden)

Sukho Oh

2018-04-01

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

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

Science.gov (United States)

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

2011-09-26

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

Modeling the transient security constraints of natural gas network in day-ahead power system scheduling

DEFF Research Database (Denmark)

Yang, Jingwei; Zhang, Ning; Kang, Chongqing

2017-01-01

The rapid deployment of gas-fired generating units makes the power system more vulnerable to failures in the natural gas system. To reduce the risk of gas system failure and to guarantee the security of power system operation, it is necessary to take the security constraints of natural gas...... accurately, they are hard to be embedded into the power system scheduling model, which consists of algebraic equations and inequations. This paper addresses this dilemma by proposing an algebraic transient model of natural gas network which is similar to the branch-node model of power network. Based...... pipelines into account in the day-ahead power generation scheduling model. However, the minute- and hour-level dynamic characteristics of gas systems prevents an accurate decision-making simply with the steady-state gas flow model. Although the partial differential equations depict the dynamics of gas flow...

Distributed Research Project Scheduling Based on Multi-Agent Methods

Directory of Open Access Journals (Sweden)

Constanta Nicoleta Bodea

2011-01-01

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

Construction schedules slack time minimizing

Science.gov (United States)

Krzemiński, Michał

2017-07-01

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

Fuzzy generation scheduling for a generation company (GenCo) with large scale wind farms

International Nuclear Information System (INIS)

Siahkali, H.; Vakilian, M.

2010-01-01

Wind power is a promising alternative in power generation because of its tremendous environmental and social benefits. Generation scheduling (GS) is more important in a power system integrating wind farms. Unlike conventional power generation sources, wind power generators supply intermittent power because of uncertainty in resource. This paper presents a fuzzy approach to the generation scheduling problem of a GenCo considering uncertainties in parameters or constraints such as load, reserve and available wind power generation. The modeling of constraints is an important issue in power system scheduling. A fuzzy optimization approach is an approach that can be used to obtain the generation scheduling under an uncertain environment. In this paper, a fuzzy optimization-based method is developed to solve power system GS problem with fuzzy objective and constraints. The crisp formulation of this GS problem is firstly defined and is rearranged by introduction of a membership function of some constraints and objective function. Then, this fuzzy optimization problem is converted to a crisp optimization and solved using GAMS software by mixed integer nonlinear programming. Employing the fuzzy optimization GS, it is expected that in practice a higher profit would be achieved in the operation and cost management of a real power system with large scale wind farms in different level of constraints' satisfaction. The proposed approach is applied to a sample system (including six conventional units and two wind farms) and the results are compared with the results of crisp solution. This approach is also applied to a larger test case to demonstrate the robustness of this fuzzy optimization method.

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

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

Medicare program; payment policies under the physician fee schedule, five-year review of work relative value units, clinical laboratory fee schedule: signature on requisition, and other revisions to part B for CY 2012. Final rule with comment period.

Science.gov (United States)

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.

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

The optimal scheduling of decentralised co-generation plants in microgrids; Optimale Einsatzplanung von Kraft-Waerme-Kopplungsanlagen in Microgrids

Energy Technology Data Exchange (ETDEWEB)

Gunkel, David [TU Dresden (Germany). Lehrstuhl fuer Energiewirtschaft; Hess, Tobias; Schegner, Peter [TU Dresden (Germany). Inst. fuer Elektrische Energieversorgung und Hochspannungstechnik

2011-07-01

The daily operational scheduling of decentralised unit is an important optimization task of power systems. This proceeding deals with planning of small scaled co-generation power units for district heating in a microgrid. This power system can be mathematically formulated and solved by an optimization algorithm. The solution process consists of a unit commitment and dispatch. The starting unit commitment is characterised by a mixed integer nonlinear problem defining the on-off-state of all units. Subsequently, the dispatch distributes the generation requirements to every committed unit considering thermal demand. The dispatching is based on a mixed integer linear problem. Additionally, it presents a way for flexible reducing the outage reserve related to the operational condition. The given microgrid operates in an islanding mode. The method can also be applied in a grid connected model considering the possible requirements of a grid operator. (orig.)

PLACEMENT APPLICATIONS SCHEDULING LECTURE IN INTERNATIONAL PROGRAM UNIKOM BASED ANDROID

Directory of Open Access Journals (Sweden)

Andri Sahata Sitanggang

2017-12-01

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

ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS

Directory of Open Access Journals (Sweden)

Alexey S. Dobrynin

2014-01-01

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

Tail-robust scheduling using Limited Processor Sharing.

NARCIS (Netherlands)

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

2010-01-01

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

The application of artificial intelligence to astronomical scheduling problems

Science.gov (United States)

Johnston, Mark D.

1992-01-01

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

Designing a fuzzy scheduler for hard real-time systems

Science.gov (United States)

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

1992-01-01

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

User interface issues in supporting human-computer integrated scheduling

Science.gov (United States)

Cooper, Lynne P.; Biefeld, Eric W.

1991-01-01

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

Some extensions of the discrete lotsizing and scheduling problem

NARCIS (Netherlands)

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

1991-01-01

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

Unit Commitment Towards Decarbonized Network Facing Fixed and Stochastic Resources Applying Water Cycle Optimization

Directory of Open Access Journals (Sweden)

Heba-Allah I. ElAzab

2018-05-01

Full Text Available This paper presents a trustworthy unit commitment study to schedule both Renewable Energy Resources (RERs with conventional power plants to potentially decarbonize the electrical network. The study has employed a system with three IEEE thermal (coal-fired power plants as dispatchable distributed generators, one wind plant, one solar plant as stochastic distributed generators, and Plug-in Electric Vehicles (PEVs which can work either loads or generators based on their charging schedule. This paper investigates the unit commitment scheduling objective to minimize the Combined Economic Emission Dispatch (CEED. To reduce combined emission costs, integrating more renewable energy resources (RER and PEVs, there is an essential need to decarbonize the existing system. Decarbonizing the system means reducing the percentage of CO2 emissions. The uncertain behavior of wind and solar energies causes imbalance penalty costs. PEVs are proposed to overcome the intermittent nature of wind and solar energies. It is important to optimally integrate and schedule stochastic resources including the wind and solar energies, and PEVs charge and discharge processes with dispatched resources; the three IEEE thermal (coal-fired power plants. The Water Cycle Optimization Algorithm (WCOA is an efficient and intelligent meta-heuristic technique employed to solve the economically emission dispatch problem for both scheduling dispatchable and stochastic resources. The goal of this study is to obtain the solution for unit commitment to minimize the combined cost function including CO2 emission costs applying the Water Cycle Optimization Algorithm (WCOA. To validate the WCOA technique, the results are compared with the results obtained from applying the Dynamic Programming (DP algorithm, which is considered as a conventional numerical technique, and with the Genetic Algorithm (GA as a meta-heuristic technique.

The applicability of knowledge-based scheduling to the utilities industry

International Nuclear Information System (INIS)

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

1992-01-01

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

Microcomputer-based workforce scheduling for hospital porters.

Science.gov (United States)

Lin, C K

1999-01-01

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

Car painting process scheduling with harmony search algorithm

Science.gov (United States)

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

2018-02-01

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

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

Science.gov (United States)

Matyska, Ludek; Ruda, Miroslav; Toth, Simon

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

Dynamic Scheduling for Cloud Reliability using Transportation Problem

OpenAIRE

P. Balasubramanie; S. K. Senthil Kumar

2012-01-01

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

5 CFR 532.513 - Flexible and compressed work schedules.

Science.gov (United States)

2010-01-01

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

Distributing Flexibility to Enhance Robustness in Task Scheduling Problems

NARCIS (Netherlands)

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

2013-01-01

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

ESSOPE: Towards S/C operations with reactive schedule planning

Science.gov (United States)

Wheadon, J.

1993-01-01

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

Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission.

Science.gov (United States)

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

2017-06-09

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

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.

Heuristic Approach for Balancing Shift Schedules

International Nuclear Information System (INIS)

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

2005-01-01

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

Job schedul in Grid batch farms

International Nuclear Information System (INIS)

Gellrich, Andreas

2014-01-01

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

Bridging the Gap Between Planning and Scheduling

Science.gov (United States)

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

2000-01-01

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

Real-time systems scheduling fundamentals

CERN Document Server

Chetto, Maryline

2014-01-01

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

Endogenous scheduling preferences and congestion

DEFF Research Database (Denmark)

Fosgerau, Mogens; Small, Kenneth

2010-01-01

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

Optimal distribution of reactivity excess in a system of reactors operating at a variable loading schedule

International Nuclear Information System (INIS)

Bolsunov, A.A.; Zagrebaev, A.M.; Naumov, V.I.

1979-01-01

Considered is the task of reactivity excess distribution optimization in the system of reactors for the purpose of minimazing the summary power production losses at the fixed loading schedule. Mathematical formulation of the task is presented. Given are the curves, characterizing the dependence of possible degree of the reactor power drop on reactivity excees for non-stationary Xe poisoning at different nominal density of neutron flux. Analyzing the results, it is concluded that in case, when the reactors differ only in neutron flux density the reactor with lower neutron flux density should be involved in the variable operation schedule first as the poisoning of this reactor will be less, and therefore, the losses of the system power production will be less. It is advisable to reserve the reactivity excess in the reactor with greater power or in the reactor with higher burnup rate. It is stressed that the obtained results of the optimization task solution point out the possibility of obtaining the certain ecomonic effect and permit to correct the requirements on mobility of separate power units at system approach to NPP operation in a variable loading schedule

Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

Directory of Open Access Journals (Sweden)

Maria Drakaki

2017-02-01

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

Best Speed Fit EDF Scheduling for Performance Asymmetric Multiprocessors

Directory of Open Access Journals (Sweden)

Peng Wu

2017-01-01