WorldWideScience

Sample records for benefits schedule rebates

  1. Footing the bill: the introduction of Medicare Benefits Schedule rebates for podiatry services in Australia

    Directory of Open Access Journals (Sweden)

    Short Anthony J

    2009-12-01

    Full Text Available Abstract The introduction of Medicare Benefits Schedule items for allied health professionals in 2004 was a pivotal event in the public funding of non-medical primary care services. This commentary seeks to provide supplementary discussion of the article by Menz (Utilisation of podiatry services in Australia under the Medicare Enhanced Primary Care program, 2004-2008 Journal of Foot and Ankle Research 2009, 2:30, by placing these findings within the context of the podiatry profession, clinical decision making and the broader health workforce and government policy.

  2. Pharma rebates, pharmacy benefit managers and employer outcomes.

    Science.gov (United States)

    Ali, Ozden Gür; Mantrala, Murali

    2010-12-01

    Corporate employers contract with pharmacy benefit managers (PBMs) with the goals of lowering their employee prescription drug coverage costs while maintaining health care quality. However, little is known about how employer-PBM contract elements and brand drugmakers' rebates combine to influence a profit-maximizing PBM's actions, and the impact of those actions on the employer's outcomes. To shed more light on these issues, the authors build and analyze a mathematical simulation model of a competitive pharmaceutical market comprised of one generic and two branded drugs, and involving a PBM contracted by a corporate employer to help it lower prescription drug costs while achieving a minimum desired quality of health care for its employees. The brand drugmakers' rebate offers, the PBM's assignment of drugs to formulary tiers, and the resulting employer outcomes under varying contracts and pharma brand marketing mix environmental scenarios are analyzed to provide insights. The findings include that the pharma brands offer rebates for the PBM's ability to move prescription share away from the unpreferred brand, but reduce these offers when the PBM's contract requires it to proactively influence physicians to prescribe the generic drug alternative. Further, Pareto optimal contracts that provide the highest health benefit for a given employer cost budget for the employer are analyzed to provide managerial implications. They are found to involve strong PBM influence on physician prescribing to discourage unpreferred brands, as well as high patient copayment requirements for unpreferred brands to align the patient prescription fill probability with the formulary, while other copayment requirements provide an instrument to determine the level of desired health benefit-cost tradeoff.

  3. Medicaid Drug Rebate Program Data

    Data.gov (United States)

    U.S. Department of Health & Human Services — Product Data for Drugs in the Medicaid Drug Rebate Program. The rebate drug product data file contains the active drugs that have been reported by participating drug...

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

    Science.gov (United States)

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

    2015-09-21

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

  5. Export Restructuring on Rebates Change

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    @@ Again, the Chinese governmenthas recently adjusted the export tax rebates upon 2831 categories of goods, accounting for 37% of the nation's total export products. Export rebates on most products have decreased by 2% to 4%, and some have had an even steeper reduction. For instance,the export tax rebate has plummeted from 11% or 13% to zero on cement and chemical products, which are called "high-energy-consumption.

  6. Tax Rebate Winners and Losers

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    COVER STORY China, long hailed as the cheap manufacturing capital of the world, is putting financial pressure on parts of this very industry. Tax rebates favorable to textile, iron and steel industries, for example, are being cast aside and picked up by hi-tech and medical industries. While this may be a partial remedy to alleviate China’s colossal trade surplus-which irritates international neighbors-and clean up the environment, many small manufacturers are feeling the heat. Industries with high added-value are clearly winners of the new trade policies, and agriculture is too, as the government continues its efforts to boost the rural economy. But in the long run, if textile and other low-tech manufacturing can use the current rebate policy as a stimulus to add more value to their products, even they might look back and see the new trade era as more win-win than they originally thought.

  7. Space Surveillance Network Scheduling Under Uncertainty: Models and Benefits

    Science.gov (United States)

    Valicka, C.; Garcia, D.; Staid, A.; Watson, J.; Rintoul, M.; Hackebeil, G.; Ntaimo, L.

    2016-09-01

    Advances in space technologies continue to reduce the cost of placing satellites in orbit. With more entities operating space vehicles, the number of orbiting vehicles and debris has reached unprecedented levels and the number continues to grow. Sensor operators responsible for maintaining the space catalog and providing space situational awareness face an increasingly complex and demanding scheduling requirements. Despite these trends, a lack of advanced tools continues to prevent sensor planners and operators from fully utilizing space surveillance resources. One key challenge involves optimally selecting sensors from a network of varying capabilities for missions with differing requirements. Another open challenge, the primary focus of our work, is building robust schedules that effectively plan for uncertainties associated with weather, ad hoc collections, and other target uncertainties. Existing tools and techniques are not amenable to rigorous analysis of schedule optimality and do not adequately address the presented challenges. Building on prior research, we have developed stochastic mixed-integer linear optimization models to address uncertainty due to weather's effect on collection quality. By making use of the open source Pyomo optimization modeling software, we have posed and solved sensor network scheduling models addressing both forms of uncertainty. We present herein models that allow for concurrent scheduling of collections with the same sensor configuration and for proactively scheduling against uncertain ad hoc collections. The suitability of stochastic mixed-integer linear optimization for building sensor network schedules under different run-time constraints will be discussed.

  8. Industrial Forecasts after Export Rebates Adjustment

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    @@ On June 19, 2007, the Circular of the Ministry of Finance and the State Administration of Taxation concerning Lowering the Export Rebate Rates for Some Commodities was published, which finally proved the early rumor of tax rebate adjustment to be true.According to the Circular, the export rebate rates for some commodities have been adjusted upon approval of the State Council and the new rates have become in force since July 1, 2007.

  9. State Clean Energy Practices: Renewable Energy Rebates

    Energy Technology Data Exchange (ETDEWEB)

    Lantz, E.; Doris, E.

    2009-03-01

    This report functions as a primer for renewable energy rebate programs. It highlights the impacts of specific renewable energy rebate programs on renewable energy markets around the country, as well as rebate program impacts on overarching energy policy drivers. It also discusses lessons learned, challenges, ideal applications, keys to success, and complementary and alternative policies. Results indicate that rebate programs can have a strong deployment impact on emerging renewable energy markets. This report focuses on renewable energy rebate programs, which are being analyzed as part of the State Clean Energy Policies Analysis (SCEPA) project. SCEPA is being used to quantify the impacts of existing state policies, and to identify crucial policy attributes and their potential applicability to other states.

  10. State Clean Energy Practices. Renewable Energy Rebates

    Energy Technology Data Exchange (ETDEWEB)

    Lantz, Eric [National Renewable Energy Lab. (NREL), Golden, CO (United States); Doris, Elizabeth [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2009-03-01

    This report functions as a primer for renewable energy rebate programs. It highlights the impacts of specific renewable energy rebate programs on renewable energy markets around the country, as well as rebate program impacts on overarching energy policy drivers. It also discusses lessons learned, challenges, ideal applications, keys to success, and complementary and alternative policies. Results indicate that rebate programs can have a strong deployment impact on emerging renewable energy markets. This report focuses on renewable energy rebate programs, which are being analyzed as part of the State Clean Energy Policies Analysis (SCEPA) project. SCEPA is being used to quantify the impacts of existing state policies, and to identify crucial policy attributes and their potential applicability to other states.

  11. Export Rebates on Grain Finished

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    @@ According to the State Statistics Bureau, China's consumer price index (CPI) jumped by 6.9 percent year-on-year last November, approaching the high levels seen at the end of 1996, one of the largest areas of increase was the price of grain,which rose by 6.6 percent. There is no doubt the growth in CPI can be mainly attributed to soaring food prices and the diffusion effect of oil price adjustments. Large orders for grain exports have put Chinese grain suppliers under tremendous pressure. In order to solve this problem, the Finance Ministry and State Administration of Taxation together announced that 84 categories of export tax rebates on major types of grain will be eliminated.

  12. Export Rebates on Grain Finished

    Institute of Scientific and Technical Information of China (English)

    Liu; Xinwen

    2008-01-01

      According to the State Statistics Bureau, China's consumer price index (CPI) jumped by 6.9 percent year-on-year last November, approaching the high levels seen at the end of 1996, one of the largest areas of increase was the price of grain,which rose by 6.6 percent. There is no doubt the growth in CPI can be mainly attributed to soaring food prices and the diffusion effect of oil price adjustments. Large orders for grain exports have put Chinese grain suppliers under tremendous pressure. In order to solve this problem, the Finance Ministry and State Administration of Taxation together announced that 84 categories of export tax rebates on major types of grain will be eliminated.……

  13. Potential Rebates Saved by HHS Determinations

    Data.gov (United States)

    U.S. Department of Health & Human Services — These estimates are provided from 2010 data. Final amount of rebates will vary with market conditions and may be lower as insurance companies lower premiums for...

  14. Uptake of Medicare Benefits Schedule Items by Psychologists and Other Mental Health Practitioners

    Science.gov (United States)

    Whiteford, Harvey A.; Doessel, Darrel P.; Sheridan, Judith S.

    2008-01-01

    This paper provides a background to the mental health policy changes introduced by the Council of Australian Governments (COAG) in 2006. It then considers a major Australian Government COAG reform, the revision of the Medicare Benefits Schedule (MBS), by analysing the month-by-month utilisation of the available time-series data for the 17-month…

  15. Estimation of Airline Benefits from Avionics Upgrade under Preferential Merge Re-sequence Scheduling

    Science.gov (United States)

    Kotegawa, Tatsuya; Cayabyab, Charlene Anne; Almog, Noam

    2013-01-01

    Modernization of the airline fleet avionics is essential to fully enable future technologies and procedures for increasing national airspace system capacity. However in the current national airspace system, system-wide benefits gained by avionics upgrade are not fully directed to aircraft/airlines that upgrade, resulting in slow fleet modernization rate. Preferential merge re-sequence scheduling is a best-equipped-best-served concept designed to incentivize avionics upgrade among airlines by allowing aircraft with new avionics (high-equipped) to be re-sequenced ahead of aircraft without the upgrades (low-equipped) at enroute merge waypoints. The goal of this study is to investigate the potential benefits gained or lost by airlines under a high or low-equipped fleet scenario if preferential merge resequence scheduling is implemented.

  16. Applying for Export Tax Rebates In China

    Institute of Scientific and Technical Information of China (English)

    RICHARD; HOFFMANN

    2009-01-01

    As the world financial crisis has taken hold, China’s Central Government moved to increase the value-added tax (VAT) refund rates on several industries in an effort to boost production. For example, China has increased the tax rebate on textiles at least four times over the past six months, most

  17. Consumer Motivation: A New Focus for Rebate Redemption.

    Science.gov (United States)

    Tat, Peter K.; Cornwell, T. Bettina

    1991-01-01

    A study of 220 users and 198 nonusers of manufacturers' rebates found 3 motivational factors that predicted use: (1) consumers' price consciousness; (2) perceived time and effort to redeem rebates; and (3) perceived satisfaction from saving money. Recommendations for more effective redemptions resulted. (SK)

  18. New Tax Rebate Policy Favorable to Aluminum Processing Industry

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    <正>China has made the decision to increase export tax rebate rate for part of the non-ferrous products from April 1, 2009, among which the export tax rebate for aluminum alloy hollow profiles and other aluminum alloy profiles goes up to 13%. The new policy is a piece of good news for aluminum processing

  19. Pros and Cons: Export Rebate Up or Down

    Institute of Scientific and Technical Information of China (English)

    Zhao Fei

    2011-01-01

    July is coming. Rumor is going around. What happened? It is known to us that early July is always the preferred date for the Chinese government to change the export rebates. Recently, the rumor on lowering the export rebate rate of textile and apparel pro

  20. Efficiency Benefits Using the Terminal Area Precision Scheduling and Spacing System

    Science.gov (United States)

    Thipphavong, Jane; Swenson, Harry N.; Lin, Paul; Seo, Anthony Y.; Bagasol, Leonard N.

    2011-01-01

    NASA has developed a capability for terminal area precision scheduling and spacing (TAPSS) to increase the use of fuel-efficient arrival procedures during periods of traffic congestion at a high-density airport. Sustained use of fuel-efficient procedures throughout the entire arrival phase of flight reduces overall fuel burn, greenhouse gas emissions and noise pollution. The TAPSS system is a 4D trajectory-based strategic planning and control tool that computes schedules and sequences for arrivals to facilitate optimal profile descents. This paper focuses on quantifying the efficiency benefits associated with using the TAPSS system, measured by reduction of level segments during aircraft descent and flight distance and time savings. The TAPSS system was tested in a series of human-in-the-loop simulations and compared to current procedures. Compared to the current use of the TMA system, simulation results indicate a reduction of total level segment distance by 50% and flight distance and time savings by 7% in the arrival portion of flight (200 nm from the airport). The TAPSS system resulted in aircraft maintaining continuous descent operations longer and with more precision, both achieved under heavy traffic demand levels.

  1. Optimal Tax-Timing and Asset Allocation when Tax Rebates on Capital Losses are Limited

    DEFF Research Database (Denmark)

    Marekwica, Marcel

    2012-01-01

    This article studies the portfolio problem with realization-based capital gain taxation when limited amounts of losses qualify for tax rebate payments, as is the case under current US tax law. When the tax rate applicable to realized losses exceeds that on realized capital gains, it can be optimal...... to realize capital gains immediately and pay capital gain taxes to regain the option to use potential future losses against a higher tax rate. This incentive adds an entirely new and as yet unstudied dimension to the portfolio problem. It causes risk averse investors to hold more equity and attain higher...... welfare levels than is the case when trading under a tax system that seeks to collect the same amount of taxes, but does not allow for tax rebate payments. This is because the benefit to these investors from having their losses subsidized is greater than the suffering from having profits taxed at a higher...

  2. Arbitrage Rebate Compliance: Recent IRS Scrutiny of School Districts.

    Science.gov (United States)

    Given, Lynda K.; Gurrola, George E.; Richardson, James R.

    2002-01-01

    Describes rules and procedures school districts must follow to comply with IRS arbitrage and rebate rules and exceptions on profits derived from investing yields of tax-exempt bonds in a higher yielding account. Describes consequences of noncompliance and seven ways to be prepared for an IRS audit--for example, answering the IRS promptly. (PKP)

  3. Revision of the Export Tax Rebate Policy for Manganese

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    <正>According to a newly released circular by the Finance Ministry and the State Administration of Taxation, the export tax rebate policy for the manganese products under the tax code No. 811100100 is eliminated as from August 1, 2005. These products mainly include un-wrought manganese, manganese scrap and manganese powder.

  4. Rebates to Incentivize Healthy Nutrition Choices in the Supplemental Nutrition Assistance Program.

    Science.gov (United States)

    Olsho, Lauren E W; Klerman, Jacob A; Bartlett, Susan H; Logan, Christopher W

    2017-02-01

    Price incentives, or rebates, have been proposed as one promising strategy for improving diet quality among Supplemental Nutrition Assistance Program participants. This paper explores the existing evidence on effectiveness of rebates in this program. In particular, this paper considers findings from a recent RCT of Supplemental Nutrition Assistance Program rebates, the U.S. Department of Agriculture Healthy Incentives Pilot, in the context of the broader literature on rebate strategies. The paper concludes that rebates have a moderate impact on food intake, at moderate cost relative to alternative interventions. There is further evidence that implicit promotional effects may contribute to impacts of rebate interventions, beyond the impacts of price effects alone. However, existing studies on complementary effects of explicit promotion have been limited by relatively small sample sizes and correspondingly low power to detect differences. This appears to be a promising area for future research.

  5. Adjusting export tax rebates to reduce the environmental impacts of trade: Lessons from China.

    Science.gov (United States)

    Song, Peng; Mao, Xianqiang; Corsetti, Gabriel

    2015-09-15

    Export tax rebates are an important policy instrument for stimulating exports, which many developing countries make use of. However, excessive export tax rebates and inappropriate structural arrangements can lead to over-production in highly polluting industries and cause the environment to deteriorate. This paper, taking China as the study case, tests and verifies the statistical significance of the causal relationship between export tax rebates and pollution emissions. With a computable general equilibrium modeling, the current study further analyzes the effectiveness of export tax rebate adjustments aimed at alleviating environmental pressure for different time periods. It is found that before 2003, export tax rebates primarily promoted exports and boosted foreign exchange reserves, and highly polluting sectors enjoyed above-average export tax rebates, which led to increased pollution emissions. Between 2003 and 2010, the export tax rebate system was reformed to reduce support for the highly polluting export sectors, which led to decreases in emissions. Canceling export tax rebates for highly polluting sectors is shown to be the most favorable policy choice for improving the environmental performance of China's international trade. This study can serve as reference for other developing countries which similarly rely on export tax rebates, so that they can adjust their policies so as to combine economic growth with pollution control.

  6. An integrated modeling framework for real-time irrigation scheduling: the benefit of spectroscopy and weather forecasts

    Science.gov (United States)

    Brook, Anna; Polinova, Maria; Housh, Mashor

    2016-04-01

    Agriculture and agricultural landscapes are increasingly under pressure to meet the demands of a constantly increasing human population and globally changing food patterns. At the same time, there is rising concern that climate change and food security will harm agriculture in many regions of the world (Nelson et al., 2009). Facing those treats, majority of Mediterranean countries had chosen irrigated agriculture. For crop plants water is one of the most important inputs, as it is responsible for crop growth, production and it ensures the efficiency of other inputs (e.g. seeds, fertilizers and pesticide) but its use is in competition with other local sectors (e.g. industry, urban human use). Thus, well-timed availability of water is vital to agriculture for ensured yields. The increasing demand for irrigation has necessitated the need for optimal irrigation scheduling techniques that coordinate the timing and amount of irrigation to optimally manage the water use in agriculture systems. The irrigation scheduling problem can be challenging as farmers try to deal with different conflicting objectives of maximizing their yield while minimizing irrigation water use. Another challenge in the irrigation scheduling problem is attributed to the uncertain factors involved in the plant growth process during the growing season. Most notable, the climatic factors such as evapotranspiration and rainfall, these uncertain factors add a third objective to the farmer perspective, namely, minimizing the risk associated with these uncertain factors. Nevertheless, advancements in weather forecasting reduced the uncertainty level associated with future climatic data. Thus, climatic forecasts can be reliably employed to guide optimal irrigation schedule scheme when coupled with stochastic optimization models (Housh et al., 2012). Many studies have concluded that optimal irrigation decisions can provide substantial economic value over conventional irrigation decisions (Wang and Cai 2009

  7. Some pain, no gain: experiences with the no-claim rebate in the Dutch health care system.

    Science.gov (United States)

    Holland, J; Van Exel, N J A; Schut, F T; Brouwer, W B F

    2009-10-01

    To contain expenditures in an increasingly demand driven health care system, in 2005 a no-claim rebate was introduced in the Dutch health insurance system. Since demand-side cost sharing is a very controversial issue, the no-claim rebate was launched as a consumer friendly bonus system to reward prudent utilization of health services. Internationally, the introduction of a mandatory no-claim rebate in a social health insurance scheme is unprecedented. Consumers were entitled to an annual rebate of 255 eruos if no claims were made. During the year, all health care expenses except for GP visits and maternity care were deducted from the rebate until the rebate became zero. In this article, we discuss the rationale of the no-claim rebate and the available evidence of its effect. Using a questionnaire in a convenience sample, we examined people's knowledge, attitudes, and sensitivity to the incentive scheme. We find that only 4% of respondents stated that they would reduce consumption because of the no-claim rebate. Respondents also indicated that they were willing to accept a high loss of rebate in order to use a medical treatment. However, during the last month of the year many respondents seemed willing to postpone consumption until the next year in order to keep the rebate of the current year intact. A small majority of respondents considered the no-claim rebate to be unfair. Finally, we briefly discuss why in 2008 the no-claim rebate was replaced by a mandatory deductible.

  8. Foot and ankle surgery in Australia: a descriptive analysis of the Medicare Benefits Schedule database, 1997–2006

    Directory of Open Access Journals (Sweden)

    Menz Hylton B

    2008-09-01

    Full Text Available Abstract Background Foot and ankle problems are highly prevalent in the general community and a substantial proportion of people seek surgical treatment to alleviate foot pain and deformity. However, the epidemiology of foot and ankle surgery has not been examined in detail. Therefore, the aim of this study was to examine patterns and costs of private sector foot surgery provision in Australia. Methods Data pertaining to all foot and ankle surgical procedures for the calendar years 1997–2006 were extracted from the Australian Medicare Benefits Schedule (MBS database and were cross-tabulated by sex and age. Descriptive analyses were undertaken to assess sex and age differences in the number and type of procedures performed and to assess for temporal trends over the ten year assessment period. The total cost to Medicare of subsiding surgeons' fees in 2006 was also determined. Results During the 1997–2006 period, 996,477 surgical procedures were performed on the foot and ankle by private surgeons in Australia. Approximately equal numbers of procedures were performed on males (52% and females (48%. However, males were more likely to undergo toenail, ankle, clubfoot, tarsal coalition and congenital vertical talus surgery, whereas females were more likely to undergo lesser toe, first metatarsophalangeal joint (MPJ, neuroma, heel, rearfoot and lesser MPJ surgery. The total number of procedures was stable over the assessment period, however there was a relative increase in the number of procedures performed on people aged over 55 years. The total contribution of Medicare to subsiding surgeons' fees for procedures performed in 2006 was $14 M. Conclusion Foot and ankle surgery accounts for a considerable degree of healthcare expenditure in Australia, and the number of procedures in those aged over 55 years is increasing. Given the ageing demographics of the Australian population, the future public health and economic impact of foot morbidity is likely

  9. Demand response scheme based on lottery-like rebates

    KAUST Repository

    Schwartz, Galina A.

    2014-08-24

    In this paper, we develop a novel mechanism for reducing volatility of residential demand for electricity. We construct a reward-based (rebate) mechanism that provides consumers with incentives to shift their demand to off-peak time. In contrast to most other mechanisms proposed in the literature, the key feature of our mechanism is its modest requirements on user preferences, i.e., it does not require exact knowledge of user responsiveness to rewards for shifting their demand from the peak to the off-peak time. Specifically, our mechanism utilizes a probabilistic reward structure for users who shift their demand to the off-peak time, and is robust to incomplete information about user demand and/or risk preferences. We approach the problem from the public good perspective, and demonstrate that the mechanism can be implemented via lottery-like schemes. Our mechanism permits to reduce the distribution losses, and thus improve efficiency of electricity distribution. Finally, the mechanism can be readily incorporated into the emerging demand response schemes (e.g., the time-of-day pricing, and critical peak pricing schemes), and has security and privacy-preserving properties.

  10. Benefits and challenges of health information systems for operations research: an illustrative example to improve surgical scheduling.

    Science.gov (United States)

    Chow, Vincent S; Huang, Wenhai; Puterman, Martin L

    2009-01-01

    Operations research (OR) is playing an increasing role in the support of many health care initiatives. However one of the main challenges facing OR practitioners is the availability and the integrity of operations data. Hospital information systems (HIS) are often designed with a clinical or accounting focus and may lack the data necessary for operational studies. In this paper, we illustrate the data processing methods and data challenges faced by our team during a study of surgical scheduling practices at the Vancouver Island Health Authority. We also provide some general recommendations to improve HIS from an operations perspective. In general, more integration between operations researchers and HIS specialists are required to support ongoing operational improvements in the health care sector.

  11. Some pain, no gain: experiences with the no-claim rebate in the Dutch health care system

    NARCIS (Netherlands)

    J. Holland; N.J.A. van Exel (Job); F.T. Schut (Erik); W.B.F. Brouwer (Werner)

    2009-01-01

    textabstractTo contain expenditures in an increasingly demand driven health care system, in 2005 a no-claim rebate was introduced in the Dutch health insurance system. Since demand-side cost sharing is a very controversial issue, the no-claim rebate was launched as a consumer friendly bonus system t

  12. Export Rebate for 11 Copper Products Are Adjusted Upward, Which May Lead to Improvement in Industry Product Structure

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    On December 31,2014,the Ministry of Finance and the State Administration of Taxation published the"Notice on Adjusting Some Products’Export Rebate Rate".Among products related to non ferrous metals,beginning from January 1,2015,rebate rates of11 copper products would be increased(see attached table).Wherein,5 are copper bar and

  13. 77 FR 68886 - Rate for Use in Federal Debt Collection and Discount and Rebate Evaluation

    Science.gov (United States)

    2012-11-16

    ... this rate by agencies as a comparison point in evaluating the cost-effectiveness of a cash discount. In... with Federal Cash Management systems and is based on investment rates set for purposes of Public Law 95... Fiscal Service Rate for Use in Federal Debt Collection and Discount and Rebate Evaluation...

  14. 34 CFR 365.16 - What requirements apply to refunds and rebates?

    Science.gov (United States)

    2010-07-01

    ... 34 Education 2 2010-07-01 2010-07-01 false What requirements apply to refunds and rebates? 365.16 Section 365.16 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF... How Does the Secretary Make a Grant to a State? § 365.16 What requirements apply to refunds...

  15. Una aproximación a la programación en lógica rebatible

    OpenAIRE

    García, Alejandro Javier

    1995-01-01

    El objetivo de este trabajo es describir un lenguaje de programación en lógica rebatible como una extensión de la programación en lógica convencional. Para ello se utilizarán los programas lógicos rebatibles (PLR), los cuales están formados por dos tipos de cláusulas: las cláusulas de programa extendido [4] que permiten inferir tanto información positiva como negativa, y las cláusulas de programa rebatible [11] que a diferencia de las anteriores representan información tentativa que puede ser...

  16. Output-based rebating of carbon taxes in the neighbor’s backyard

    OpenAIRE

    Böhringer, Christoph; Bye, Brita; Fæhn, Taran; Rosendahl , Knut Einar

    2014-01-01

    We investigate how carbon taxes combined with output-based rebating (OBR) in an open economy perform in interaction with the carbon policies of a large neighboring trading partner. Analytical results suggest that whether the purpose of the OBR policy is to compensate firms for carbon tax burdens or to maximize welfare (accounting for global emission reductions), the second-best OBR rate should be positive in most cases. Further, it should fall with the introduction of carbon taxation in the n...

  17. Output-based rebating of carbon taxes in the neighbor's backyard. Competitiveness, leakage and welfare

    OpenAIRE

    Christoph Böhringer; Brita Bye; Taran Fæhn; Knut Einar Rosendahl

    2014-01-01

    We investigate how carbon taxes combined with output-based rebating (OBR) in an open economy perform in interaction with the carbon policies of a large neighboring trading partner. Analytical results suggest that whether the purpose of the OBR policy is to compensate firms for carbon tax burdens or to maximize welfare (accounting for global emission reductions), the second-best OBR rate should be positive in most cases. Further, it should fall with the introduction of carbon taxation in the n...

  18. Earnings Increased 500 Million Yuan Thanks to the Rise of Export Tax Rebate for Aluminium and Copper Products

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    <正>In mid-November,the Ministry of Finance and the State Administration of Taxation issued a tax circular Notification on Raising Export Tax Rebate Rate of the Value-added Tax for Com- modities including Labor-intensive Products, raising the export tax rebate rate by 9% and 13% respectively for refined copper tubes with a outer diameter no more than 25mm and non- alloy aluminium products including rectangular plates,sheets and strips.This is the first time China has adjusted the export tax for nonfer- rous metal products.The adjustment will have a direct positive effect on improving the busi-

  19. Ethnography of Cool Roof Retrofits: The Role of Rebates in the Materials Selection Process

    Energy Technology Data Exchange (ETDEWEB)

    Mazur-Stommen, Susan [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2011-02-01

    In the summer of 2010, ethnographic research was conducted with nine households in the Bay Area and Sacramento region. The purpose of this task was to collect methodologically grounded insights into how and why consumers chose the cool roofing material they selected. These nine households comprised fifteen respondents, and their dependents. They were selected from among a pool of respondents to a mail solicitation of all Sacramento Municipal Utility District and Pacific Gas and Electric customers who had received a rebate for their cool roof retrofit. Consumers are uniformly happy with their cool roof retrofits. Consumers typically stayed very close to the aesthetic of the original roof style. Price was not a primary concern, while longevity was paramount. Consumers did not use roofing price, nor energy savings (with one exception), in tracking return on investment through energy savings. The utility rebate had little role to play in terms of incentivizing customers to choose cool materials. Contractors were critical partners in the decision-­making process.

  20. 78 FR 65430 - Notice of Rate To Be Used for Federal Debt Collection, and Discount and Rebate Evaluation

    Science.gov (United States)

    2013-10-31

    ...-effectiveness of a cash discount. In addition, this rate is to be used in determining when agencies should pay...: The rate reflects the current value of funds to the Treasury for use in connection with Federal Cash... Fiscal Service Notice of Rate To Be Used for Federal Debt Collection, and Discount and Rebate...

  1. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  2. Price rebate in the business relations and the consequences on the company outcome

    Directory of Open Access Journals (Sweden)

    Anton, C.

    2012-01-01

    Full Text Available The development of the company’s activity in a competition economic environment, featured by continuous dynamics generates more and more complex problems and for solving these problems, the manager searches solutions meant to lead to the attainment of the set goals. Thus, the most important strategy to attain higher financial performances is the efficient management of the relation with the clients. Moreover, studies and analyses are required concerning the volume of the commercial transactions with strategic partners, developing a price rebate policy meant to make clients loyal. This paper aims at identifying the most appropriate communication and collaboration methods between the client and the company and at setting the type of granted commercial facilities, so that the outcome of the carried out activity attains the proposed level.

  3. Monetary Transfers in the U.S.: How Efficient Are Tax Rebates?

    Directory of Open Access Journals (Sweden)

    Diego E. Vacaflores

    2013-11-01

    Full Text Available Recent debate on the effectiveness of tax rebates has concentrated on the degree to which they can affect economic activity, which depends on the methodology, the state of the economy, and the underlying assumptions. A better approach to assess the effectiveness of these monetary transfers is by comparing this method to alternative policies—like the traditional monetary injections through the financial intermediaries. A limited participation model calibrated to the U.S. economy is used to show that the higher the proportion of the monetary injection channeled through the consumers—instead of banks—leads to a less vigorous recovery of output but softens the detrimental effect on the utility of the representative household from the inherent inflationary pressure. This result is robust to the relative importance of the injection (utilization of resources and alternative utility functions.

  4. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

    Personnel scheduling can become a particularly difficult optimisation problem due to human factors. And yet: people working in healthcare, transportation and other round the clock service regimes perform their duties based on a schedule that was often manually constructed. The unrewarding manual scheduling task deserves more attention from the timetabling community so as to support computation of fair and good quality results. The present abstract touches upon a set of particular characterist...

  5. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1999. Thesis (Master's) -- Bilkent University, 1999. Includes bibliographical references. Distributed Scheduling (DS) is a new paradigm that enables the local decisionmakers make their own schedules by considering local objectives and constraints within the boundaries and the overall objective of the whole system. Local schedules from different parts of the system are...

  6. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

    no task is scheduled with overlap. Let numpi be the total number of preemptions and idle slots of size at most to that are introduced. We see that if...no usable block remains on Qm-*, then numpi < m-k. Otherwise, numpi ! m-k-1. If j>n when this procedure terminates, then all tasks have been scheduled

  7. Government Subsidy for Remanufacturing or Carbon Tax Rebate: Which Is Better for Firms and a Low-Carbon Economy

    Directory of Open Access Journals (Sweden)

    Tong Shu

    2017-01-01

    Full Text Available The government as a policy maker wishing to promote remanufacturing and proper disposal of hazardous old products which are harmful to environment has taken many actions, ranging from carbon regulation and financial incentives such as trade-in subsidy. However, carbon tax can result in loss of profit for firms to some degree, so the government has to give other subsidy to balance the profits and carbon emission. Thus, this article investigates two subsidy mechanisms: remanufacturing subsidy or tax rebate. The optimal pricing and production decision under these policies are examined. Our results show that carbon tax has a great impact on pricing strategies. Trade-in subsidy can encourage customers to replace their existing products with new and remanufactured products. Both remanufacture subsidy and tax rebate are beneficial to manufacturer and can further promote remanufacturing development.

  8. A Review on Export Rebate System in China%对我国出口退税制度的评析

    Institute of Scientific and Technical Information of China (English)

    任建; 谢璐

    2012-01-01

    This paper makes an analysis on the three export rebate policy adjustments in China, and clarifies primary problems existing in present export rebate policy, and finally puts forward some counter- measures and suggestions for improving export re- bate system and enhancing export rebate efficiency.%本文对我国1994年以来的3次出口退税政策调整进行分析,并梳理了目前出口退税政策存在的主要问题,提出了完善出口退税制度、提升出口退税成效的对策和建议。

  9. 中国对高新技术产品出口实行全额退税%Full export tax rebate to be granted to high-tech products

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    @@ Chinese deputy minister of commerce Wei Jianguo recently disclosed that following the resumption of a 17% tax rebate to the export of high-tech products last year, China would implement full export tax rebate to computer, software and other high-tech products this year.

  10. Reactive Scheduling in Multipurpose Batch Plants

    Science.gov (United States)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

    Scheduling is an important operation in process industries for improving resource utilization resulting in direct economic benefits. It has a two-fold objective of fulfilling customer orders within the specified time as well as maximizing the plant profit. Unexpected disturbances such as machine breakdown, arrival of rush orders and cancellation of orders affect the schedule of the plant. Reactive scheduling is generation of a new schedule which has minimum deviation from the original schedule in spite of the occurrence of unexpected events in the plant operation. Recently, Shaik & Floudas (2009) proposed a novel unified model for short-term scheduling of multipurpose batch plants using unit-specific event-based continuous time representation. In this paper, we extend the model of Shaik & Floudas (2009) to handle reactive scheduling.

  11. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

    This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a

  12. The Experimental Analysis of the Phenomena Rebating Newly Issuing Shares%新股折价现象的实证分析

    Institute of Scientific and Technical Information of China (English)

    靳云汇; 杨文

    2003-01-01

    Through the cross section analysis of the first day transnormal yields of newly issuing shares in Shanghai Stock Market, the paper tests the applicability in China of the theory of the transcendental uncertain hypothesis of rebating newly issuing shares, the credit standing hypothesis of investment banks, the signal hypothesis and the market atmosphere hypothesis respectively.

  13. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

    Full Text Available The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this paper we present an extended set of simplified scheduling constraints which allows easy scheduling of underwater acoustic communication. We also present two algorithms for scheduling communications, i.e. a centralized scheduling approach and a distributed scheduling approach. The centralized approach achieves the highest throughput while the distributed approach aims to minimize the computation and communication overhead. We further show how the centralized scheduling approach can be extended with transmission dependencies to reduce the end-to-end delay of packets. We evaluate the performance of the centralized and distributed scheduling approaches using simulation. The centralized approach outperforms the distributed approach in terms of throughput, however we also show the distributed approach has significant benefits in terms of communication and computational overhead required to setup the schedule. We propose a novel way of estimating the performance of scheduling approaches using the ratio of modulation time and propagation delay. We show the performance is largely dictated by this ratio, although the number of links to be scheduled also has a minor impact on the performance.

  14. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

    Full Text Available We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

  15. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

    This "how-to-do-it" manual on the intricacies of school scheduling offers both technical information and common sense advice about the process of secondary school scheduling. The first of six chapters provides an overview of scheduling; chapter 2 examines specific considerations for scheduling; chapter 3 surveys the scheduling models and their…

  16. Noncontingent reinforcement: a further examination of schedule effects during treatment.

    Science.gov (United States)

    Wallace, Michele D; Iwata, Brian A; Hanley, Gregory P; Thompson, Rachel H; Roscoe, Eileen M

    2012-01-01

    We conducted 2 studies to determine whether dense and thin NCR schedules exert different influences over behavior and whether these influences change as dense schedules are thinned. In Study 1, we observed that thin as well as dense NCR schedules effectively decreased problem behavior exhibited by 3 individuals. In Study 2, we compared the effects of 2 NCR schedules in multielement designs, one with and the other without an extinction (EXT) component, while both schedules were thinned. Problem behavior remained low as the NCR schedule with EXT was thinned, but either (a) did not decrease initially or (b) subsequently increased as the NCR schedule without EXT was thinned. These results suggest that dense schedules of NCR decrease behavior by altering its motivating operation but that extinction occurs as the NCR schedule is thinned. The benefits and limitations of using dense or thin NCR schedules are discussed.

  17. 20 CFR 614.12 - Schedules of remuneration.

    Science.gov (United States)

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Schedules of remuneration. 614.12 Section 614... COMPENSATION FOR EX-SERVICEMEMBERS Administration of UCX Program § 614.12 Schedules of remuneration. (a... Defense, a Schedule of Remuneration specifying the pay and allowances for each pay grade of members of...

  18. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

    We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with light...

  19. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun;

    2014-01-01

    This paper presents a compositional approach for schedula- bility analysis of hierarchical systems, which enables to prove more sys- tems schedulable by having richer and more detailed scheduling models. We use a lightweight method (statistical model checking) for design ex- ploration, easily...... assuring high confidence in the correctness of the model. A satisfactory design can be proved schedulable using the computation costly method (symbolic model checking). In order to analyze a hierar- chical scheduling system compositionally, we introduce the notion of a stochastic supplier modeling...... the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  20. Immunization Schedules for Adults

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  1. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  2. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

    Explains that favorable market and working conditions influence the scheduling of school construction projects. Facility planners, architects, and contractors are advised to develop a realistic time schedule for the entire project. (MLF)

  3. Reinforcement learning in scheduling

    Science.gov (United States)

    Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad

    1994-01-01

    The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.

  4. DSN Scheduling Engine

    Science.gov (United States)

    Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline

    2008-01-01

    The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.

  5. Load-shift incentives for household demand response: Evaluation of hourly dynamic pricing and rebate schemes in a wind-based electricity system

    DEFF Research Database (Denmark)

    Katz, Jonas; Møller Andersen, Frits; Morthorst, Poul Erik

    2016-01-01

    under scenarios with large shares of wind power in a Danish case study. Our results indicate strategies that could be favourable in ensuring high adoption of products and efficient response by households. We find that simple pricing schemes, though economically less efficient, could become important......Applying a partial equilibrium model of the electricity market we analyse effects of exposing household electricity customers to retail products with variable pricing. Both short-term and long-term effects of exposing customers to hourly spot market prices and a simpler rebate scheme are analysed...

  6. 78 FR 59098 - Proposed Collection; Comment Request for Form 5300 and Schedule Q (Form 5300)

    Science.gov (United States)

    2013-09-25

    ..., Application for Determination for Employee Benefit Plan, and Schedule Q (Form 5300), Elective Determination... Determination for Employee Benefit Plan (Form 5300), and Elective Determination Requests (Schedule Q (Form 5300... Code sections 401(a) and 501(a) set out requirements for qualification of employee benefit trusts...

  7. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  8. Application of fee-rebate system to foster urban waste reduction and recovery; Aplicacion de sistemas de bonificacion-penalizacion para incentivar la reduccion y el reciclaje en mancomunidades

    Energy Technology Data Exchange (ETDEWEB)

    Puig Ventosa, I.

    2002-07-01

    Waste management facilities are often shared among different municipalities as a way to manage wastes more efficiently. Usually, management costs are assigned to each municipality considering population or total waste amount, regardless of important environmental aspects such as per capita waste generation or results in composting and recycling. This article presents a fee bate (fee + rebate) system aimed to foster urban waste reduction and recovery. The proposal suggests that municipalities achieving better results in their waste management performance (from an ecological viewpoint) be recompensed with a rebate obtained from a fee charged to those municipalities taking less care of the environment. (Author) 7 refs.

  9. Tax Rebates and Employment: A Cointegration Study Based on China’s Export Data%出口退税与就业增进——基于我国数据的协整研究

    Institute of Scientific and Technical Information of China (English)

    谢建国; 吴春燕

    2012-01-01

    Based on an export decision process,this paper establishes a mod-el to study the employment impact of export tax rebates.Using China’s export tax rebates data of 1985-2009,the paper examines the effect of China’s export tax rebate policy on employment levels,and the results show that China’s ex-port tax rebate policy significantly promoted the growth of employment.It fur-ther decomposes the export rebates into tariff rebates and VAT rebates to study the impact of different categories of export tax rebates on domestic employment,and the results remained stable.Results also show that domestic investment,FDI,and exchange rate depreciation significantly promoted the growth of employment,but technology improvement restrained the growth of employment.Results show that China’s technology development is still the labor-saving rather than capi-tal-saving technological progress.%在一个出口决策模型的基础之上,建立了一个出口退税的就业影响模型。并采用我国1985-2009年的数据,研究了出口退税政策对我国就业水平的影响,结果显示:我国的出口退税政策显著促进了国内就业的增长。进一步把出口退税分解为增值税退还与关税退还两部分,研究了不同类别出口退税对国内就业的影响,结果仍然稳定。结果同时表明:国内投资、FDI以及汇率贬值显著促进了国内就业的增长,而技术水平的提升则抑制了国内就业的增长,这一结果说明,我国的技术发展选择的仍然是劳动节约型而非资本节约型技术进步。

  10. Interval Scheduling: A Survey

    NARCIS (Netherlands)

    Kolen, A.W.J.; Lenstra, J.K.; Papadimitriou, C.H.; Spieksma, F.C.R.

    2007-01-01

    In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability o

  11. Scheduling for Responsive Grids

    CERN Document Server

    Germain-Renaud, C; Moscicki,JT; Texier, R

    2008-01-01

    Grids are facing the challenge of seamless integration of the Grid power into everyday use. One critical component for this integration is responsiveness, the capacity to support on-demand computing and interactivity. Grid scheduling is involved at two levels in order to provide responsiveness: the policy level and the implementation level. The main contributions of this paper are as follows. First, we present a detailed analysis of the performance of the EGEE Grid with respect to responsiveness. Second, we examine two user-level schedulers located between the general scheduling layer and the application layer. These are the DIANE (distributed analysis environment) framework, a general-purpose overlay system, and a specialized, embedded scheduler for gPTM3D, an interactive medical image analysis application. Finally, we define and demonstrate a virtualization scheme, which achieves guaranteed turnaround time, schedulability analysis, and provides the basis for differentiated services. Both methods target a br...

  12. Balancing Authority Cooperation Concepts - Intra-Hour Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Hunsaker, Matthew; Samaan, Nader; Milligan, Michael; Guo, Tao; Liu, Guangjuan; Toolson, Jacob

    2013-03-29

    The overall objective of this study was to understand, on an Interconnection-wide basis, the effects intra-hour scheduling compared to hourly scheduling. Moreover, the study sought to understand how the benefits of intra-hour scheduling would change by altering the input assumptions in different scenarios. This report describes results of three separate scenarios with differing key assumptions and comparing the production costs between hourly scheduling and 10-minute scheduling performance. The different scenarios were chosen to provide insight into how the estimated benefits might change by altering input assumptions. Several key assumptions were different in the three scenarios, however most assumptions were similar and/or unchanged among the scenarios.

  13. Análisis de la semántica declarativa trivaluada GS para la programación en lógica rebatible básica

    OpenAIRE

    Cecchi, Laura; Simari, Guillermo Ricardo

    2000-01-01

    El objetivo de este trabajo es presentar un análisis del conjunto de las consecuencias de un programa lógico rebatible. Como resultado inmediato surge un teorema en el que se prueba que la semántica GS es sensata y completa con respecto a la semántica operacional.

  14. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

    Full Text Available This study examined the effects of a tri-schedule on the academic achievement of students in a high school. The tri-schedule consists of traditional, 4x4 block, and hybrid schedules running at the same time in the same high school. Effectiveness of the schedules was determined from the state mandated test of basic skills in reading, language, and mathematics. Students who were in a particular schedule their freshman year were tested at the beginning of their sophomore year. A statistical ANCOVA test was performed using the schedule types as independent variables and cognitive skill index and GPA as covariates. For reading and language, there was no statistically significant difference in test results. There was a statistical difference mathematics-computation. Block mathematics is an ideal format for obtaining more credits in mathematics, but the block format does little for mathematics achievement and conceptual understanding. The results have content specific implications for schools, administrations, and school boards who are considering block scheduling adoption.

  15. Research on Benefit Distribution Mechanism of Farmers’ Specialized Cooperative Economic Organization

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    On the basis of conducting survey in Jiaonan City,the thesis analyzes benefit distribution mechanism of farmers’ specialized cooperative economic organizations:firstly,the benefit correlation is mainly the contract correlation;secondly,the profit distribution is mainly the dividend;thirdly,patronage refund has many connotations;fourthly,the public accumulation has not yet been quantified to individual;fifthly,the government support capital is ill-defined.Based on these,the measures are put forward in order to improve benefit distribution pattern of farmers’ specialized cooperative economic organizations:firstly,reform structure of property rights and realize farmers’ ownership;secondly,change mode of decision-making,and realize farmers’ control;thirdly,increase turnover rebate and realize farmers’ benefiting;fourthly,quantify public accumulation and government support fund.

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

  17. Distributed job scheduling in MetaCentrum

    Science.gov (United States)

    Tóth, Šimon; Ruda, Miroslav

    2015-05-01

    MetaCentrum - The Czech National Grid provides access to various resources across the Czech Republic. The utilized resource management and scheduling system is based on a heavily modified version of the Torque Batch System. This open source resource manager is maintained in a local fork and was extended to facilitate the requirements of such a large installation. This paper provides an overview of unique features deployed in MetaCentrum. Notably, we describe our distributed setup that encompasses several standalone independent servers while still maintaining full cooperative scheduling across the grid. We also present the benefits of our virtualized infrastructure that enables our schedulers to dynamically request ondemand virtual machines, that are then used to facilitate the varied requirements of users in our system, as well as enabling support for user requested virtual clusters that can be further interconnected using a private VLAN.

  18. Load-shift incentives for household demand response: Evaluation of hourly dynamic pricing and rebate schemes in a wind-based electricity system

    DEFF Research Database (Denmark)

    Katz, Jonas; Møller Andersen, Frits; Morthorst, Poul Erik

    2016-01-01

    Applying a partial equilibrium model of the electricity market we analyse effects of exposing household electricity customers to retail products with variable pricing. Both short-term and long-term effects of exposing customers to hourly spot market prices and a simpler rebate scheme are analysed...... under scenarios with large shares of wind power in a Danish case study. Our results indicate strategies that could be favourable in ensuring high adoption of products and efficient response by households. We find that simple pricing schemes, though economically less efficient, could become important...... in an early phase to initialise the development of household demand response. At a later point, when long-term dynamics take effect, a larger effort should be made to shift consumers onto real-time rates, and an increased focus on overall adoption of variable pricing will be required. Another finding...

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

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

  1. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  2. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... 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...

  3. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.

  4. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  5. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

    Given a set J of jobs, where each job j is associated with release date r j , deadline d j and processing time p j , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length p j between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any given time. This is one of the basic settings in the resource-minimization job scheduling, and the classical randomized rounding technique of Raghavan and Thompson provides an O(logn/loglogn)-approximation for it. This result has been recently improved to an O(sqrt{log n})-approximation, and moreover an efficient algorithm for scheduling all jobs on O((OPT)^2) machines has been shown. We build on this prior work to obtain a constant factor approximation algorithm for the problem.

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

  7. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  8. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

    The schedule for the installation of the PAR slurry loop experiment in the South Facility of the ORR has been reviewed and revised. The design, fabrications and Installation is approximately two weeks behind schedule at this time due to many factors; however, indications are that this time can be made up. Design is estimated to be 75% complete, fabrication 32% complete and installation 12% complete.

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

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

  11. Developing scheduling benchmark tests for the Space Network

    Science.gov (United States)

    Moe, Karen L.; Happell, Nadine; Brady, Sean

    1993-01-01

    A set of benchmark tests were developed to analyze and measure Space Network scheduling characteristics and to assess the potential benefits of a proposed flexible scheduling concept. This paper discusses the role of the benchmark tests in evaluating alternative flexible scheduling approaches and defines a set of performance measurements. The paper describes the rationale for the benchmark tests as well as the benchmark components, which include models of the Tracking and Data Relay Satellite (TDRS), mission spacecraft, their orbital data, and flexible requests for communication services. Parameters which vary in the tests address the degree of request flexibility, the request resource load, and the number of events to schedule. Test results are evaluated based on time to process and schedule quality. Preliminary results and lessons learned are addressed.

  12. Handling Deafness Problem of Scheduled Multi-Channel Polling MACs

    Science.gov (United States)

    Jiang, Fulong; Liu, Hao; Shi, Longxing

    Combining scheduled channel polling with channel diversity is a promising way for a MAC protocol to achieve high energy efficiency and performance under both light and heavy traffic conditions. However, the deafness problem may cancel out the benefit of channel diversity. In this paper, we first investigate the deafness problem of scheduled multi-channel polling MACs with experiments. Then we propose and evaluate two schemes to handle the deafness problem. Our experiment shows that deafness is a significant reason for performance degradation in scheduled multi-channel polling MACs. A proper scheme should be chosen depending on the traffic pattern and the design objective.

  13. 出口退税政策对我国家具出口的影响分析%Effects of China's Export Tax Rebate Policy on Furniture Export

    Institute of Scientific and Technical Information of China (English)

    侯方森; 安欣

    2012-01-01

    The export tax rebate policy affects furniture exports in many aspects, and it is also one of the measures that China has adopted to implement resource strategies and industrial development strategies. Many scholars analyzed the macro and micro impacts of the export tax rebate policy. Since 2006, Chinese Government adjusted the tax rebate for furniture export for several times. This paper used monthly data from 2005 to 2011 to empirically analyze the relationship between furniture export tax rebate rate and furniture export value. The results were that the export tax rebate rate followed a regular change and showed a down- ward trend before October 2008, so enterprises had accurate estimate of the trend and relied much on export tax rebate. After October 2008, the dependence of export value on the export tax rebate rate has been gradually decreasing while early exports have become one of main factors which enterprises should take into consideration. The policy suggestions proposed in the paper were to strengthen the stability of the export tax rebate policy and promote the technology innovation in furniture enterprises.%出口退税政策影响到家具出口的多个方面,同时也是国家实施资源战略和产业发展战略的措施之一。很多研究者从理论方面分析了出口退税政策的宏观和微观影响。2006年以后,国家对家具出口退税进行了多次调整。文中运用2005至2011年的月度数据实证分析了家具出口退税率和家具出口额之间的关系,认为在2008年10月之前出口退税率的变化很有规律且一直呈下行趋势,企业对其变化趋势有较准确的估计,所以家具出口额对出口退税率比较依赖;但2008年10月之后,出口额对出口退税率的依赖性逐渐减小,而前期的出口额成了企业制定出口计划的重要因素。提出的政策建议是加强出口退税政策的稳定性并促进家具企业的技术创新等。

  14. Class Schedules--Computer Loaded or Student Self-Scheduled?

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

    In the two-step process of student scheduling, the initial phase of course selection is the most important. At Chesterton High School in Indiana, student self-scheduling is preferred over computer loading. (Author/MLF)

  15. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  16. Childhood Vaccine Schedule

    Science.gov (United States)

    Skip Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... as pneumonia, blood infections, and bacterial meningitis Rotavirus vaccine (three ... in babies and young children 4 Months DTaP, Hib, IPV, PCV, RV 6 ...

  17. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

    Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

  18. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

    Franses, Philip; Post, Gerhard; Burke, Edmund; De Causmaecker, Patrick

    2003-01-01

    We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We d

  19. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Calero Yzquierdo, Antonio [Madrid, CIEMAT; Hernandez, Jose [Madrid, CIEMAT; Holzman, Burt [Fermilab; Majewski, Krista [Fermilab; McCrea, Alison [UC, San Diego

    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.

  20. Model Migration Schedules

    OpenAIRE

    1981-01-01

    This report draws on the fundamental regularity exhibited by age profiles of migration all over the world to develop a system of hypothetical model schedules that can be used in multiregional population analyses carried out in countries that lack adequate migration data.

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

  2. Cloud Task Scheduling for Load Balancing based on Intelligent Strategy

    Directory of Open Access Journals (Sweden)

    Arabi E. keshk

    2014-04-01

    Full Text Available Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm for load balancing compared with different scheduling algorithms has been proposed. Ant Colony Optimization (ACO is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. The main contribution of our work is to balance the system load while trying to minimizing the make span of a given tasks set. The load balancing factor, related to the job finishing rate, is proposed to make the job finishing rate at different resource being similar and the ability of the load balancing will be improved. The proposed scheduling strategy was simulated using Cloudsim toolkit package. Experimental results showed that, the proposed algorithm outperformed scheduling algorithms that are based on the basic ACO or Modified Ant Colony Optimization (MACO.

  3. Incremental Scheduling Engines for Human Exploration of the Cosmos

    Science.gov (United States)

    Jaap, John; Phillips, Shaun

    2005-01-01

    As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

  4. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

    Full Text Available In this paper the authors propose modified proportional share scheduling algorithm considering the characteristics of continuous media such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and decreases the number of context switching. Proposed scheduling algorithm is evaluated using several numerical tests under various conditions, especially overloaded situation.

  5. Flexible Software for Flexible Scheduling

    Science.gov (United States)

    Economou, Frossie; Jenness, Tim; Tilanus, Remo P. J.; Hirst, Paul; Adamson, Andy J.; Rippa, Mathew; Delorey, Kynan K.; Isaak, Kate G.

    The JAC Observation Management Project (OMP) provides software for the James Clerk Maxwell (JCMT) and the United Kingdom Infrared (UKIRT) telescopes that manages the life-cycle of flexibly scheduled observations. Its aim is to increase observatory efficiency under flexible (queue) scheduled observing, without depriving the principal investigator (PI) of the flexibility associated with classical scheduling.

  6. Revisiting conjugate schedules.

    Science.gov (United States)

    MacAleese, Kenneth R; Ghezzi, Patrick M; Rapp, John T

    2015-07-01

    The effects of conjugate reinforcement on the responding of 13 college students were examined in three experiments. Conjugate reinforcement was provided via key presses that changed the clarity of pictures displayed on a computer monitor in a manner proportional to the rate of responding. Experiment 1, which included seven parameters of clarity change per response, revealed that responding decreased as the percentage clarity per response increased for all five participants. These results indicate that each participant's responding was sensitive to intensity change, which is a parameter of conjugate reinforcement schedules. Experiment 2 showed that responding increased during conjugate reinforcement phases and decreased during extinction phases for all four participants. Experiment 3 also showed that responding increased during conjugate reinforcement and further showed that responding decreased during a conjugate negative punishment condition for another four participants. Directions for future research with conjugate schedules are briefly discussed.

  7. A Study of the Mechanism for Distribution of Benefits Based on Vertical Coordination in Agriculture

    Institute of Scientific and Technical Information of China (English)

    Tuzhan WANG

    2016-01-01

    Currently,the mechanism for distribution of benefits based on vertical coordination in the area of agricultural products can be divided into some types such as market price regulation,contract agreement,and dividend distribution according to trading volume or shares,and internal profit of enterprise. There are differences in operating characteristics,advantages and adaptation between different mechanisms. And contract agreement can be subdivided into guaranteed price,market protection price,market protection price + preferential services,and market protection price + secondary rebates. Taking the citrus processing industry in Zhongxian County for example,it is recommended to learn from the Taiwan experience to strengthen the linking between citrus cooperatives,and develop the order mode as well as the " market protection price + preferential services" mechanism for distribution of benefits.

  8. Multiprocessor scheduling for real-time systems

    CERN Document Server

    Baruah, Sanjoy; Buttazzo, Giorgio

    2015-01-01

    This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems.  The authors derive new, abstract models of real-time tasks that capture accurately the salient features of real application systems that are to be implemented on multiprocessor platforms, and identify rules for mapping application systems onto the most appropriate models.  New run-time multiprocessor scheduling algorithms are presented, which are demonstrably better than those currently used, both in terms of run-time efficiency and tractability of off-line analysis.  Readers will benefit from a new design and analysis framework for multiprocessor real-time systems, which will translate into a significantly enhanced ability to provide formally verified, safety-critical real-time systems at a significantly lower cost.

  9. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. 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 multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  10. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

    Bartal, Y. [Tel-Aviv Univ. (Israel); Leonardi, S.; Marchetti-Spaccamela, A. [Universita di Roma (Italy); Sgall, J. [Mathematical Inst., Zitna (Czechoslovakia)] [and others

    1996-12-31

    We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds, in particular for m = 2 we give an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.

  11. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connection. We think that OS should become intelligent to distinguish between different processes and allocate resources, including CPU, to those processes which need them most. In this work, as a first step to make the OS aware of the current state of the system, we consider process dependencies and interprocess communications. We are developing a model, which considers the need to satisfy interactive users and other possible remote users or customers, by making scheduling decisions based on process dependencies and interproce...

  12. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

    Full Text Available Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, and Priority scheduling algorithm.

  13. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

    Full Text Available This paper deals with the representation of scheduling results and it introduces a new tool for visualization and simulation in time scheduling called VISIS. The purpose of this tool is to provide an environment for visualization, e.g. in production line scheduling. The simulation also proposes a way to simulate the influence of a schedule on a user defined system, e.g. for designing filters in digital signal processing. VISIS arises from representing scheduling results using the well-known Gantt chart. The application is implemented in the Matlab programming environment using Simulink and the Virtual Reality toolbox. 

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

  15. Therapeutic Benefits of Cannabis: A Patient Survey

    OpenAIRE

    2014-01-01

    Clinical research regarding the therapeutic benefits of cannabis (“marijuana”) has been almost non-existent in the United States since cannabis was given Schedule I status in the Controlled Substances Act of 1970. In order to discover the benefits and adverse effects perceived by medical cannabis patients, especially with regards to chronic pain, we hand-delivered surveys to one hundred consecutive patients who were returning for yearly re-certification for medical cannabis use in Hawai‘i.

  16. System Level Analysis of Dynamic User-Centric Scheduling for a Flexible 5G Design

    DEFF Research Database (Denmark)

    Pedersen, Klaus I.; Niparko, Maciej; Steiner, Jens;

    2016-01-01

    In this paper we present our latest findings on dynamic user-centric scheduling for a flexible 5G radio design, capable of serving users with highly diverse QoS requirements. The benefits of being able to schedule users with different transmission time intervals (TTIs) are demonstrated...... to the conclusion that a future 5G design shall include support for dynamic scheduling with different TTI sizes to achieve the best performance....

  17. Applications of optimal mathematic-physical models in metallurgical manufacture scheduling system at Baosteel

    Institute of Scientific and Technical Information of China (English)

    Jian Qiu; Naiyuan Tian; Zhixin Lu; Guowei Sun

    2003-01-01

    The transfer of mass flow between ironmaking and steelmaking process at Baoshan Iron and Steel Co. Ltd. has been analyzed. The mathematic-physical models of transport scheduling for hot metal manufacturing have been researched combined with the practical problem in the metallurgical manufacture procedure. Taking into account these models, the scheduling software has been designed, programmed and tested on-line. The new automation system of production scheduling has been implemented successfully at Baosteel, which produces a great economic benefit.

  18. Dynamic Extra Buses Scheduling Strategy in Public Transport

    Directory of Open Access Journals (Sweden)

    Bin Yu

    2015-06-01

    Full Text Available This paper presents a dynamic extra buses scheduling strategy to improve the transit service of transit routes. In this strategy, in order to decide when to dispatch an extra bus, the service reliability of transit route is assessed firstly. A model aimed at maximizing the benefit of the extra buses scheduling strategy is constructed to determine how many stops extra buses need to skip from the terminal to accommodate passengers at the following stops. A heuristic algorithm is defined and implemented to estimate the service reliability of transit route and to optimize the initial stop of extra buses scheduling strategy. Finally, the strategy is tested on two examples: a simple and a real-life transit route in the Dalian city in China. The results show that the extra buses scheduling strategy based on terminal stops with a reasonable threshold can save 8.01% waiting time of passengers.

  19. Renewable Portfolio Standards: Costs and Benefits (Poster)

    Energy Technology Data Exchange (ETDEWEB)

    Bird, L.; Heeter, J.; Barbose, G.; Weaver, S.; Flores, F.; Kuskova-Burns, K.; Wiser, R.

    2014-10-01

    This report summarizes state-level RPS costs to date, and considers how those costs may evolve going forward given scheduled increases in RPS targets and cost containment mechanisms. The report also summarizes RPS benefits estimates, based on published studies for individual states and discusses key methodological considerations.

  20. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

    There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days.These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.

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

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

  3. Adaptive scheduling of batch servers in flow shops

    NARCIS (Netherlands)

    van der Zee, D.J.

    2002-01-01

    Batch servicing is a common way of benefiting from economies of scale in manufacturing operations. Good examples of production systems that allow for batch processing are ovens found in the aircraft industry and in semiconductor manufacturing. In this paper we study the issue of dynamic scheduling o

  4. Who benefits?

    DEFF Research Database (Denmark)

    Hjorth, Frederik Georg

    2016-01-01

    Cross-border welfare rights for citizens of European Union member states are intensely contested, yet there is limited research into voter opposition to such rights, sometimes denoted ‘welfare chauvinism’. We highlight an overlooked aspect in scholarly work: the role of stereotypes about...... beneficiaries of cross-border welfare. We present results from an original large-scale survey experiment (N=2525) among Swedish voters, randomizing exposure to cues about recipients' country of origin and family size. Consistent with a model emphasizing the role of stereotypes, respondents react to cues about...... recipient identity. These effects are strongest among respondents high in ethnic prejudice and economic conservatism. The findings imply that stereotypes about who benefits from cross-border welfare rights condition public support for those rights....

  5. 77 FR 34854 - Prevailing Rate Systems; Special Wage Schedules for Nonappropriated Fund Automotive Mechanics

    Science.gov (United States)

    2012-06-12

    ... for advising OPM on matters concerning the pay of FWS employees. These NAF set-aside pay practices are... special schedules. Effect on Employee Benefits The flat rate pay plan would not change how premium...

  6. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

    The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.

  7. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    In a modern society, manpower can be both a scarce and an expensive resource. Skilled personnel is usually in high demand and accounts for a significant part of total expenses in many companies. When the work is divided in shifts, a roster is compiled to allocate these to the employees. The roste......In a modern society, manpower can be both a scarce and an expensive resource. Skilled personnel is usually in high demand and accounts for a significant part of total expenses in many companies. When the work is divided in shifts, a roster is compiled to allocate these to the employees....... The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction...... among the employees, sophisticated scheduling methods are required. When approaching the day of operation, the detail level of the planning becomes finer. With a given allocation of shifts to employees, the focus is turned to tasks scheduling within those shifts. The objective is to assign as much work...

  8. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

    package DON Department of the Navy F&R Fix and Relax GAMS General Algebraic Modeling System LCS Littoral Combat Ship LCSRON Littoral Combat Ship...but that can be acceptable depending on the scheduler needs. F&R produces superior long-term schedules when compared to a similar-length RH schedule...LEFT BLANK 29 IV. MODEL IMPLEMENTATION LCSS is implemented with the General Algebraic Modeling System (GAMS) using the GAMS/CPLEX (GAMS, 2014

  9. Prioritizing sleep for healthy work schedules

    Directory of Open Access Journals (Sweden)

    Takahashi Masaya

    2012-03-01

    Full Text Available Abstract Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work. Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules.

  10. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

    Full Text Available Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93–97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.

  11. The benefits of interleaved and blocked study: different tasks benefit from different schedules of study.

    Science.gov (United States)

    Carvalho, Paulo F; Goldstone, Robert L

    2015-02-01

    Research on how information should be studied during inductive category learning has identified both interleaving of categories and blocking by category as beneficial for learning. Previous work suggests that this mixed evidence can be reconciled by taking into account within- and between-category similarity relations. In this article, we present a new moderating factor. Across two experiments, one group of participants studied categories actively (by studying the objects without correct category assignment and actively figuring out what the category was), either interleaved or blocked. Another group studied the same categories passively (objects and correct category assignment were simultaneously provided). Results from a subsequent generalization task show that whether interleaved or blocked study results in better learning depends on whether study is active or passive. One account of these results is that different presentation sequences and tasks promote different patterns of attention to stimulus components. Passive learning and blocking promote attending to commonalities within categories, while active learning and interleaving promote attending to differences between categories.

  12. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  13. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  14. Visually Exploring Transportation Schedules.

    Science.gov (United States)

    Palomo, Cesar; Guo, Zhan; Silva, Cláudio T; Freire, Juliana

    2016-01-01

    Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at trip- and station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.

  15. Rebater e chutar: efeitos de intervenções referenciadas na análise do comportamento em aulas de educação física

    OpenAIRE

    Limão, Juliana Inhesta [UNESP

    2011-01-01

    Esta pesquisa investigou um período de intervenção em aulas de educação física, sob a mediação teórica da Análise do Comportamento, com o intuito de ensinar e desenvolver os comportamentos motores de chutar e rebater. Participaram do estudo 60 crianças de seis anos de idade, de três escolas municipais do ensino fundamental de Bauru. Cada escola constituiu um grupo: Grupo Experimental (GE), com aulas planejadas pelo professor da escola e pela pesquisadora, com base nas técnicas de ensino-apren...

  16. Extensiones a la programación en lógica rebatible para modelar reglas con disyunciones en la cabeza: aplicaciones al razonamiento con ontologías potencialmente inconsistentes

    OpenAIRE

    Gómez, Sergio Alejandro; Simari, Guillermo Ricardo

    2012-01-01

    Esta propuesta de investigación se basa en el estudio de las posibilidades de extender la sintaxis del lenguaje de la Programación en Lógica Rebatible (DeLP) para permitir la representación de disyunciones en la cabeza de las reglas y, luego, redefinir acordemente las nociones de construcción de argumentos, ataque, derrota, garantía y resultados de consultas. Este nuevo marco argumentativo permitirá modelar el razonamiento sobre ontologías Description Logics que posean disyunciones en el miem...

  17. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

    When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two...

  18. Multiuser Switched Diversity Scheduling Schemes

    CERN Document Server

    Shaqfeh, Mohammad; 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 sys...

  19. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

    AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

  20. The GBT Dynamic Scheduling System: A New Scheduling Paradigm

    Science.gov (United States)

    O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

    2009-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

  1. Design and Scheduling of Microgrids using Benders Decomposition

    Energy Technology Data Exchange (ETDEWEB)

    Nagarajan, Adarsh; Ayyanar, Raja

    2016-11-21

    The distribution feeder laterals in a distribution feeder with relatively high PV generation as compared to the load can be operated as microgrids to achieve reliability, power quality and economic benefits. However, renewable resources are intermittent and stochastic in nature. A novel approach for sizing and scheduling an energy storage system and microturbine for reliable operation of microgrids is proposed. The size and schedule of an energy storage system and microturbine are determined using Benders' decomposition, considering PV generation as a stochastic resource.

  2. FMEF Electrical single line diagram and panel schedule verification process

    Energy Technology Data Exchange (ETDEWEB)

    FONG, S.K.

    1998-11-11

    Since the FMEF did not have a mission, a formal drawing verification program was not developed, however, a verification process on essential electrical single line drawings and panel schedules was established to benefit the operations lock and tag program and to enhance the electrical safety culture of the facility. The purpose of this document is to provide a basis by which future landlords and cognizant personnel can understand the degree of verification performed on the electrical single lines and panel schedules. It is the intent that this document be revised or replaced by a more formal requirements document if a mission is identified for the FMEF.

  3. The GBT Dynamic Scheduling System: The Observers' Perspective

    Science.gov (United States)

    Braatz, J.; Balser, D. A.; Bignell, C.; Clark, M.; Harnett, J.; McCarty, M.; Marganian, P.; O'Neil, K.; Shelton, A.

    2009-09-01

    To make the most efficient use of telescope time, the NRAO is implementing a Dynamic Scheduling System (DSS) for the Robert C. Byrd Green Bank Telescope (GBT). The DSS aims to match observing projects to the weather and other observing conditions, without sacrificing observers' interactive control of their experiments. To meet this goal, the DSS schedules people, not observing scripts. Each observer can then attend to the observation, control the telescope, and modify the observing program, if necessary, in real time. Observing under the DSS is often done remotely, by necessity. Every day, the DSS generates a new schedule for the 24-hour period beginning one day hence. Observers therefore must be prepared to run observations with 24 to 48 hours notice. Being available and ready to observe on short notice requires that observers adopt a new mindset, unlike their experiences with other telescopes. While it may be an inconvenience for some, the benefits of the DSS are substantial, the primary one being that astronomers are almost assured of observing in appropriate weather and getting high quality data. The DSS gives observers the opportunity to black out time ranges to avoid for scheduling, so the telescope schedule can fit around other demands. In addition to the scheduling algorithms, the DSS team has developed a set of software tools to help observers manage their projects, to notify observers of scheduling news, and to help observers anticipate when their projects will get scheduled. In this contribution we will report observers' experiences from the first tests of the GBT DSS, which took place from June 1 to September 30, 2008.

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

  5. Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum

    CERN Document Server

    Mostafa, Samih Mohemmed

    2010-01-01

    Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling cri-teria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important benefits of using (CTQ) approach: minimizing the average waiting time of the tasks, consequently minimizing the average turnaround time, and keeping the number of context switches as low as possible, consequently minimizing the scheduling overhead. In this paper, we consider the scheduling problem for preemptive tasks, where the time costs of these tasks are known a priori. Our experimental results demonstrate that CTQ can provide much lower scheduling overhead and better scheduling criteria.

  6. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  7. Bulletin publication schedule

    CERN Document Server

    Publications Section, DG-CO Group

    2011-01-01

    The final edition (Nos 51-52/2011 and 1-2-3/2012) of the Bulletin this year will be published on Friday 16 December and will cover events at CERN from 19 December 2011 to 19 January 2012. Announcements for publication in this issue should reach the Communication Group or the Staff Association, as appropriate, by noon on Tuesday 13 December. Bulletin publication schedule for 2012 The table below lists the 2012 publication dates for the paper version of the Bulletin and the corresponding deadlines for the submission of announcements. Please note that all announcements must be submitted by 12.00 noon on Tuesdays at the latest.   Bulletin No. Week number Submission of announcements (before 12.00 midday) Bulletin Web version Bulletin Printed version 4-5   Tuesday 17 January Fridays 20 and 27 January Wednesday25 January 6-7   Tuesday 31 January Fridays 3 and 10 February Wednesday 8 February 8-9 Tuesday 14 February Fridays 17 and 24 february Wednesday 22 Februa...

  8. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

    Introduction The endgame of CMS installation in the underground cavern is in full swing, with several major milestones having been passed since the last CMS week. The Tracker was installed inside the Vactank just before the CERN end-of-year shutdown. Shortly after the reopening in 2008, the two remaining endcap disks, YE-2 and YE-1, were lowered, marking the completion of eight years of assembly in the surface building SX5. The remaining tasks, before the detector can be closed for the Cosmic Run At Four Tesla (CRAFT), are the installation of the thermal shields, the cabling of the negative endcap, the cabling of the tracker and the beam pipe installation. In addition to these installation tasks, a test closure of the positive endcap is planned just before the installation of the central beam pipe. The schedule is tight and complicated but the goal to close CMS by the end of May for a cosmic test with magnetic field remains feasible. Safety With all large components now being underground, the shortage...

  9. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

    We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is $3-2\\sqrt{2}$ and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the chargin...

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

  11. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

    Any sports league needs a schedule of play, and such a schedule can be important, as it may influence the outcome of the sports competition itself and since it may have an impact on the interests of all parties involved. As in many other sports leagues and countries, the interest for Belgian soccer has increased over the last years. This paper describes our experiences in scheduling the highest Belgian soccer league. We describe how we automated and improved the way in which the calendar is ...

  12. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... A-Z > Exercise: Benefits of Exercise: Health Benefits In This Topic Health Benefits Benefits for Everyday Life ... Try Exercise: How to Stay Active The information in this topic was provided by the National Institute ...

  13. Tramp Ship Routing and Scheduling - Models, Methods and Opportunities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

    and scheduling. This includes a review on existing literature, modelling approaches, solution methods as well as an analysis of the current status and future opportunities of research within tramp ship routing and scheduling. We argue that rather than developing new solution methods for the basic routing...... to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. The aim of this paper is to provide a comprehensive introduction to tramp ship routing...... and scheduling problem, focus should now be on extending this basic problem to include additional real-world complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new...

  14. Executive Schedule C System (ESCS)

    Data.gov (United States)

    Office of Personnel Management — Used to store information on Federal employees in the Senior Executive Service (SES) and appointed employees in the Schedule C System. Every four years, just after...

  15. The GBT Dynamic Scheduling System

    Science.gov (United States)

    McCarty, M. T.; Balser, D. S.; Braatz, J.; Clark, M. H.; Condon, J.; Creager, R. E.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2012-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS), in use since September, 2009, was designed to maximize observing efficiency while preserving telescope flexibility and data quality without creating undue adversity for the observers. Using observing criteria; observer availability and qualifications for remote observing; three-dimensional weather forecasts; and telescope state, the DSS software optimally schedules observers 24 to 48 hours in advance for a telescope that has a wide-range of capabilities and a geographical location with variable weather patterns. The DSS project was closed October 28, 2011 and will now enter a continuing maintenance and enhancement phase. Recent improvements include a new resource calendar for incorporating telescope maintenance activities, a sensitivity calculator that leverages the scheduling algorithms to facilitate consistent tools for proposal preparation, improved support for monitoring observations, scheduling of high frequency continuum and spectral line observations for both sparse and fully sampled array receivers, and additional session parameters for observations having special requirements.

  16. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

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

  18. 75 FR 61840 - Proposed Collection; Comment Request for Form 5300 and Schedule Q (Form 5300)

    Science.gov (United States)

    2010-10-06

    ..., Application for Determination for Employee Benefit Plan, and Schedule Q (Form 5300), Elective Determination...: Application for Determination for Employee Benefit Plan (Form 5300), and Elective Determination Requests...: Internal Revenue Code sections 401(a) and 501(a) set out requirements for qualification of employee...

  19. 20 CFR 656.15 - Applications for labor certification for Schedule A occupations.

    Science.gov (United States)

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Applications for labor certification for Schedule A occupations. 656.15 Section 656.15 Employees' Benefits EMPLOYMENT AND TRAINING ADMINISTRATION... scholarly articles in the field for which certification is sought, in international professional journals...

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

    visibility, sky background, required time sampling coverage) and the dynamic change of the system conditions (i.e., weather, system conditions). Off-line and on-line strategies are integrated into a single tool for a suitable transfer of the target prioritization made by the science team to the real-time schedule that will be used by the instrument operators. A suitable solution will be expected to increase the efficiency of telescope operations, which will represent an important benefit in terms of scientific return and operational costs. We present the operational scheduling tool designed for CARMENES, which is based on two algorithms combining a global and a local search: Genetic Algorithms and Hill Climbing astronomy-based heuristics, respectively. The algorithm explores a large amount of potential solutions from the vast search space and is able to identify the most efficient ones. A planning solution is considered efficient when it optimizes the objectives defined, which, in our case, are related to the reduction of the time that the telescope is not in use and the maximization of the scientific return, measured in terms of the time coverage of each target in the survey. We present the results obtained using different test cases.

  1. Runway Scheduling Using Generalized Dynamic Programming

    Science.gov (United States)

    Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

    2011-01-01

    A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

  2. A Market-Based Approach to Multi-factory Scheduling

    Science.gov (United States)

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

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

  3. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  4. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  5. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector theta cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector theta has been derived by using the Youla parameterization...

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

    NARCIS (Netherlands)

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

    2008-01-01

    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 ope

  7. 20 CFR 404.1519n - Informing the medical source of examination scheduling, report content, and signature requirements.

    Science.gov (United States)

    2010-04-01

    ... scheduling, report content, and signature requirements. 404.1519n Section 404.1519n Employees' Benefits... medical source of examination scheduling, report content, and signature requirements. The medical sources... report containing all of the elements in paragraph (c). (e) Signature requirements. All...

  8. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  9. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

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

  11. Batch Scheduling a Fresh Approach

    Science.gov (United States)

    Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler

  12. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... please turn Javascript on. Exercise: Benefits of Exercise Health Benefits One of the Healthiest Things You Can ... yourself. Studies have shown that exercise provides many health benefits and that older adults can gain a ...

  13. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Ravn, Anders P.;

    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 ...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.......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...

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

  15. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

    We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system's different demands.

  16. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    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.

  17. Feature-based telescope scheduler

    Science.gov (United States)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  18. Risk Averse Closed-Loop Supply Chain Coordination with Rebate and Penalty Contracts%基于回馈和惩罚的风险厌恶闭环供应链协调研究

    Institute of Scientific and Technical Information of China (English)

    蒋杰辉

    2015-01-01

    A closed -loop supply chain model composed of a single risk -averse supplier and a single risk -averse retailer is proposed under Conditional Calue -at-Risk (CVaR)criterion and demand uncertainty,further research focused on whether rebate and penalty contracts could realize the risk averse closed-loop supply chain coordination and optimization.%文中运用条件风险值(CVaR)度量准则建立了基于随机需求下由一个风险厌恶型的销售商和一个风险厌恶型的制造商组成的闭环供应链决策模型,探讨了回馈和惩罚契约能否实现风险厌恶闭环供应链的协调。

  19. Two-machine flow shop scheduling integrated with preventive maintenance planning

    Science.gov (United States)

    Wang, Shijin; Liu, Ming

    2016-02-01

    This paper investigates an integrated optimisation problem of production scheduling and preventive maintenance (PM) in a two-machine flow shop with time to failure of each machine subject to a Weibull probability distribution. The objective is to find the optimal job sequence and the optimal PM decisions before each job such that the expected makespan is minimised. To investigate the value of integrated scheduling solution, computational experiments on small-scale problems with different configurations are conducted with total enumeration method, and the results are compared with those of scheduling without maintenance but with machine degradation, and individual job scheduling combined with independent PM planning. Then, for large-scale problems, four genetic algorithm (GA) based heuristics are proposed. The numerical results with several large problem sizes and different configurations indicate the potential benefits of integrated scheduling solution and the results also show that proposed GA-based heuristics are efficient for the integrated problem.

  20. Efficient Resource Utilization Algorithm (ERUA for Service Request Scheduling in Cloud

    Directory of Open Access Journals (Sweden)

    Ramkumar N

    2013-04-01

    Full Text Available Cloud computing provides us with the massive pool of resources in terms of pay-as-you-use policy. Cloud delivers these resources on demand through the use of network resources under different load conditions. As the users will be charged based on their usage the effective utilization of resources poses a major challenge. To accomplish this, a service request scheduling algorithm which reduces the waiting time of the task in the scheduler and maximizes the Quality of Service (QoS is needed. Our proposed algorithm named Effective Resource Utilization Algorithm (ERUA is based on 3-tier cloud architecture (Consumer, Service Provider and the Resource Provider which benefits both the user (QoS and the service provider (Cost through effective schedule reallocation based on utilization ratio leading to better resource utilization. Performance analysis made with the existing scheduling techniques shows that our algorithm gives out a more optimized schedule and enhances the efficiency rate.

  1. Electronics Environmental Benefits Calculator

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Electronics Environmental Benefits Calculator (EEBC) was developed to assist organizations in estimating the environmental benefits of greening their purchase,...

  2. Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

    In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at the transmitter for pages of information. Multiple requests may be for the same page. When a page is transmitted, all requests for that page receive the transmission simulteneously. The speed the transmitter sends data at can be dynamically scaled to conserve energy. We consider the problem of minimizing flow time plus energy, the most popular scheduling metric considered in the standard scheduling model when the scheduler is energy aware. We will assume that the power consumed is modeled by an arbitrary convex function. For this problem there is a $\\Omega(n)$ lower bound. Due to the lower bound, we consider the resource augmentation model of Gupta \\etal \\cite{GuptaKP10}. Using resource augmentation, we give a scalable algorithm. Our result also gives a scalable non-clairvoyant algorithm for minimizing weighted flow time plus energ...

  3. Smart self-scheduling of Gencos with thermal and energy storage units under price uncertainty

    OpenAIRE

    Soroudi, Alireza

    2013-01-01

    This paper provides a self-scheduling tool for price taker Gencos. This methodology is based on Robust Optimization (RO) to deal with the uncertainties of market price values in the day-ahead electricity pool market. The Genco is assumed to be the entity who decides about the operating schedules of its thermal units and Compressed Air Energy Storage units. The benefits of Genco brought by smart grid technology and energy storage systems are investigated in this work. The applicability of the ...

  4. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (United States)

    Jackson, Justin Patrick

    solves this problem. The algorithm is correct, complete, outputs time optimal schedules, and has low average-case time complexity. Separation of the task assignment and task scheduling problems is exploited here to ameliorate the effects of an incomplete communication network. The mission-modeling conditions that allow this and the benefits gained are discussed in detail. It is shown that the distributed task assignment and task scheduling algorithms developed here can operate concurrently and maintain their correctness, completeness, and optimality properties.

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

  6. Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

    Science.gov (United States)

    Stottler, D.

    There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

  7. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

    In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on ...

  8. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the US Department of Energy (DOE). This document contains the planned 1996 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project.

  9. A scheduling model for astronomy

    Science.gov (United States)

    Solar, M.; Michelon, P.; Avarias, J.; Garces, M.

    2016-04-01

    Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.

  10. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption and le...

  11. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  12. Overcoming barriers to scheduling embedded generation to support distribution networks

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-07-01

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

  13. New Algorithm for FMS Scheduling Based on Multiagent System Architecture

    Institute of Scientific and Technical Information of China (English)

    Li Gaozheng; Huang Xiaoping; Ding Han

    2001-01-01

    Redefined benefit-driven function is used to study the dynamic scheduling of FMS based on multiagent architecture. Each agent is dedicated to a work center, i.e. a set of the manufacturing system. In one hand, each agent selects locally and dynamically the dispatching rule(DR) that seems to be most suited to the operating conditions, production objectives and current shop status. On the other hand, each task should bring certain amount of benefit for the manufacturer. So, it is reasonable to have the dynamic scheduling of FMS relying upon multiagent architecture using the benefit-driven function as a strategy. Well, today's manufacturing corporation, especially the high & new technology one and deep machining one, the cost of their products is mainly determined by how much the knowledge is input From this viewpoint, we redefined the benefit-driven function. In the end, this approach is compared with other existing DRs on a job-shop problem, already used in other research works.

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

  15. An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Jianhui Mou

    2014-01-01

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

  16. Web-Enabled Framework for Real-Time Scheduler Simulator: A Teaching Too

    Directory of Open Access Journals (Sweden)

    C. Yaashuwanth

    2010-01-01

    Full Text Available Problem statement: A Real-Time System (RTS is one which controls an environment by receiving data, processing it, and returning the results quickly enough to affect the functioning of the environment at that time. The main objective of this research was to develop an architectural model for the simulation of real time tasks to implement in distributed environment through web, and to make comparison between various scheduling algorithms. The proposed model can be used for preprogrammed scheduling policies for uniprocessor systems. This model provided user friendly Graphical User Interface (GUI. Approach: Though a lot of scheduling algorithms have been developed, just a few of them are available to be implemented in real-time applications. In order to use, test and evaluate a scheduling policy it must be integrated into an operating system, which is a complex task. Simulation is another alternative to evaluate a scheduling policy. Unfortunately, just a few real-time scheduling simulators have been developed to date and most of them require the use of a specific simulation language. Results: Task ID, deadline, priority, period, computation time and phase are the input task attributes to the scheduler simulator and chronograph imitating the real-time execution of the input task set and computational statistics of the schedule are the output. Conclusion: The Web-enabled framework proposed in this study gave the developer to evaluate the schedulability of the real time application. Numerous benefits were quoted in support of the Web-based deployment. The proposed framework can be used as an invaluable teaching tool. Further, the GUI of the framework will allow for easy comparison of the framework of existing scheduling policies and also simulate the behavior and verify the suitability of custom defined schedulers for real-time applications.

  17. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  18. 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...... for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear...... scheduling methods, have proven to be well suited for projects of a repetitive nature, such as building projects. As the repetitive or linear scheduling methods may include locations or places, they are also referred to by the comprehensive term of location-based scheduling (LBS), which is the concept...

  19. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

    This paper provides a classification of real scheduling problems. Various ways have been examined and described on the problem. Scheduling problem faces a tremendous challenges and difficulties in order to meet the preferences of the consumer. Dealing with scheduling problem is complicated, inefficient and time-consuming. This study aims to develop a mathematical model for scheduling the operating theatre during peak and off peak time. Scheduling problem is a well known optimization problem and the goal is to find the best possible optimal solution. In this paper, we used integer linear programming technique for scheduling problem in a high level of synthesis. In addition, time and resource constrained scheduling was used. An optimal result was fully obtained by using the software GLPK/AMPL. This model can be adopted to solve other scheduling problems, such as the Lecture Theatre, Cinemas and Work Shift.

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

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

  2. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

    In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.

  3. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

    training syllabus . 14. SUBJECT TERMS Scheduling, optimization, flight training, Advance Strike Training, pilot 15. NUMBER OF...SKEDSOs that can help them increase throughput of students in the advanced strike training syllabus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii...instructor pilots with student naval aviators to achieve syllabus events. The schedule is built manually each day by squadron scheduling officers (SKEDSOs

  4. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Scheduled airlines. 122.63 Section 122.63 Customs... AIR COMMERCE REGULATIONS Clearance of Aircraft and Permission To Depart § 122.63 Scheduled airlines... scheduled airlines covered by this subpart. (a) Clearance at other than airport of final departure....

  5. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  6. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

    ... COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Notice... Regulations--Water Supply Charges to revise the schedule of water charges. DATES: The Commission will hold a... the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please contact...

  7. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations..., the Board's General Manager will update the FOIA Fee Schedule once every 12 months. The previous...

  8. Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

    NARCIS (Netherlands)

    Heemstra de Groot, Sonia M.; Herrmann, Otto E.

    1990-01-01

    A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality crite

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

  10. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-10-01

    This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

  11. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  13. JIST: Just-In-Time Scheduling Translation for Parallel Processors

    Directory of Open Access Journals (Sweden)

    Giovanni Agosta

    2005-01-01

    Full Text Available The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JIST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JITcompiler. Further optimizations are discussed.

  14. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  15. Medicare Hospice Benefits

    Science.gov (United States)

    CENTERS for MEDICARE & MEDICAID SERVICES Medicare Hospice Benefits This official government booklet includes information about Medicare hospice benefits: Who’s eligible for hospice care What services are included in hospice ...

  16. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... version of this page please turn Javascript on. Exercise: Benefits of Exercise Health Benefits One of the Healthiest Things You ... activity campaign from the National Institute on Aging. Exercise or Physical Activity? Some people may wonder what ...

  17. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... Exercise: Benefits of Exercise Health Benefits One of the Healthiest Things You Can Do Like most people, ... active on a regular basis is one of the healthiest things you can do for yourself. Studies ...

  18. Routine environmental monitoring schedule, calendar year 1995

    Energy Technology Data Exchange (ETDEWEB)

    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.

  19. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... 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...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

  20. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... version of this page please turn Javascript on. Exercise: Benefits of Exercise Health Benefits One of the Healthiest Things You Can Do ... can do for yourself. Studies have shown that exercise provides many health benefits and that older adults can gain a lot ...

  1. Exercise: Benefits of Exercise

    Science.gov (United States)

    ... version of this page please turn Javascript on. Exercise: Benefits of Exercise Health Benefits One of the Healthiest Things You Can Do ... can do for yourself. Studies have shown that exercise provides many health benefits and that older adults can gain a lot ...

  2. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

    Directory of Open Access Journals (Sweden)

    Behnam Barzegar

    2012-01-01

    Full Text Available Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job-shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP-hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN that is based on gravitational search algorithm (GSA. In the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

  3. Fault Tolerant PLBGSA: Precedence Level Based Genetic Scheduling Algorithm for P2P Grid

    Directory of Open Access Journals (Sweden)

    Piyush Chauhan

    2013-01-01

    Full Text Available Due to monetary limitation, small organizations cannot afford high end supercomputers to solve highly complex tasks. P2P (peer to peer grid computing is being used nowadays to break complex task into subtasks in order to solve them on different grid resources. Workflows are used to represent these complex tasks. Finishing such complex task in a P2P grid requires scheduling subtasks of workflow in an optimized manner. Several factors play their part in scheduling decisions. The genetic algorithm is very useful in scheduling DAG (directed acyclic graph based task. Benefit of a genetic algorithm is that it takes into consideration multiple criteria while scheduling. In this paper, we have proposed a precedence level based genetic algorithm (PLBGSA, which yields schedules for workflows in a decentralized fashion. PLBGSA is compared with existing genetic algorithm based scheduling techniques. Fault tolerance is a desirable trait of a P2P grid scheduling algorithm due to the untrustworthy nature of grid resources. PLBGSA handles faults efficiently.

  4. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo;

    Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker cons...... consumption and the impact on the remaining network and the customer service level. The model is applied to 4 real cases from Maersk Line. Solutions are comparable or superior to those chosen by operations managers. Cost savings of up to 58% may be achieved....

  5. Scheduling of an aircraft fleet

    Science.gov (United States)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

    Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

  6. Community benefit activities of private, nonprofit hospitals.

    Science.gov (United States)

    Bazzoli, Gloria J; Clement, Jan P; Hsieh, Hui-Min

    2010-12-01

    The definition of hospital community benefits has been intensely debated for many years. Recently, consensus has developed about one group of activities being central to community benefits because of its focus on care for the poor and on needed community services for which any payments received are low relative to costs. Disagreements continue, however, about the treatment of bad debt expense and Medicare shortfalls. A recent revision of the Internal Revenue Service's Form 990 Schedule H, which is required of all nonprofit hospitals, highlights the agreed-on set of activities but does not dismiss the disputed items. Our study is the first to apply definitions used in the new IRS form to assess how conclusions about the adequacy of nonprofit hospital community benefits could be affected if bad debt expenses and Medicare shortfalls are included or excluded. Specifically, we examine 2005 financial data for California and Florida hospitals. Overall, we find that conclusions about community benefit adequacy are very different depending on which definition of community benefits is used. We provide thoughts on new directions for the current policy debate about the treatment of bad debts and Medicare shortfalls in light of these findings.

  7. 77 FR 67743 - Federal Employees Health Benefits Program Coverage for Certain Intermittent Employees

    Science.gov (United States)

    2012-11-14

    ... RIN 3206-AM74 Federal Employees Health Benefits Program Coverage for Certain Intermittent Employees... Personnel Management (OPM) is issuing an interim final rule to amend the Federal Employees Health Benefits Program (FEHBP) regulations to make certain employees who work on intermittent schedules eligible to...

  8. Greedy Maximal Scheduling in Wireless Networks

    CERN Document Server

    Li, Qiao

    2010-01-01

    In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.

  9. Fair Scheduling in Networks Through Packet Election

    CERN Document Server

    Jagabathula, Srikanth

    2008-01-01

    We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of service. Existing work on fairness for constrained networks concentrates on flow based fairness. As a main result, we describe a notion of packet based fairness by establishing an analogy with the ranked election problem: packets are voters, schedules are candidates and each packet ranks the schedules based on its priorities. We then obtain a scheduling algorithm that achieves the described notion of fairness by drawing upon ...

  10. Minimally disruptive schedule repair for MCM missions

    Science.gov (United States)

    Molineaux, Matthew; Auslander, Bryan; Moore, Philip G.; Gupta, Kalyan M.

    2015-05-01

    Mine countermeasures (MCM) missions entail planning and operations in very dynamic and uncertain operating environments, which pose considerable risk to personnel and equipment. Frequent schedule repairs are needed that consider the latest operating conditions to keep mission on target. Presently no decision support tools are available for the challenging task of MCM mission rescheduling. To address this capability gap, we have developed the CARPE system to assist operation planners. CARPE constantly monitors the operational environment for changes and recommends alternative repaired schedules in response. It includes a novel schedule repair algorithm called Case-Based Local Schedule Repair (CLOSR) that automatically repairs broken schedules while satisfying the requirement of minimal operational disruption. It uses a case-based approach to represent repair strategies and apply them to new situations. Evaluation of CLOSR on simulated MCM operations demonstrates the effectiveness of case-based strategy. Schedule repairs are generated rapidly, ensure the elimination of all mines, and achieve required levels of clearance.

  11. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview......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...

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

    This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site.

  13. Steps Toward Optimal Competitive Scheduling

    Science.gov (United States)

    Frank, Jeremy; Crawford, James; Khatib, Lina; Brafman, Ronen

    2006-01-01

    This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a

  14. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  15. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

    Full Text Available In this study, we present a literature review, classification schemes and analysis of methodology for scheduling problems on Batch Processing machine (BP with both processing time and job size constraints which is also regarded as Two-Dimensional (TD scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, with details of the basic algorithms and other significant results.

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

  17. Transit Benefit Program Data -

    Data.gov (United States)

    Department of Transportation — This data set contains information about any US government agency participating in the transit benefits program, funding agreements, individual participating Federal...

  18. Logical Link Control and Channel Scheduling for Multichannel Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jun Li

    2012-08-01

    Full Text Available With recent developments in terrestrial wireless networks and advances in acoustic communications, multichannel technologies have been proposed to be used in underwater networks to increase data transmission rate over bandwidth-limited underwater channels. Due to high bit error rates in underwater networks, an efficient error control technique is critical in the logical link control (LLC sublayer to establish reliable data communications over intrinsically unreliable underwater channels. In this paper, we propose a novel protocol stack architecture featuring cross-layer design of LLC sublayer and more efficient packetto- channel scheduling for multichannel underwater sensor networks. In the proposed stack architecture, a selective-repeat automatic repeat request (SR-ARQ based error control protocol is combined with a dynamic channel scheduling policy at the LLC sublayer. The dynamic channel scheduling policy uses the channel state information provided via cross-layer design. It is demonstrated that the proposed protocol stack architecture leads to more efficient transmission of multiple packets over parallel channels. Simulation studies are conducted to evaluate the packet delay performance of the proposed cross-layer protocol stack architecture with two different scheduling policies: the proposed dynamic channel scheduling and a static channel scheduling. Simulation results show that the dynamic channel scheduling used in the cross-layer protocol stack outperforms the static channel scheduling. It is observed that, when the dynamic channel scheduling is used, the number of parallel channels has only an insignificant impact on the average packet delay. This confirms that underwater sensor networks will benefit from the use of multichannel communications.

  19. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  20. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

    In the view of staff shortages and the huge inventory of products in the current market, we put forward a personnel scheduling model in the target of closing to the delivery date considering the parallelism. Then we designed a scheduling algorithm based on genetic algorithm and proposed a flexible parallel decoding method which take full use of the personal capacity. Case study results indicate that the flexible personnel scheduling considering the order-shop scheduling, machine automatic capabilities and personnel flexible in the target of closing to the delivery date optimize the allocation of human resources, then maximize the efficiency.

  1. An Efficient SJRR CPU Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Saeeda Bibi

    2010-05-01

    Full Text Available CPU Scheduling is a vital discipline which helps us gain deep insight into the complex set of policies and mechanisms used to govern the order in which tasks are executed by the processor. This article proposes an efficient Shortest Job Round Robin (SJRR CPU Scheduling algorithm having better average waiting time (AWT and average turnaround time (ATT as compared to other CPU Scheduling techniques. The primary objective of this algorithm is to optimize system performance according to the criteria deemed most important by system designers. Included in this work, is a simulation that compares the proposed algorithms with some well known practices to CPU scheduling.

  2. Therapeutic benefits of cannabis: a patient survey.

    Science.gov (United States)

    Webb, Charles W; Webb, Sandra M

    2014-04-01

    Clinical research regarding the therapeutic benefits of cannabis ("marijuana") has been almost non-existent in the United States since cannabis was given Schedule I status in the Controlled Substances Act of 1970. In order to discover the benefits and adverse effects perceived by medical cannabis patients, especially with regards to chronic pain, we hand-delivered surveys to one hundred consecutive patients who were returning for yearly re-certification for medical cannabis use in Hawai'i. The response rate was 94%. Mean and median ages were 49.3 and 51 years respectively. Ninety-seven per cent of respondents used cannabis primarily for chronic pain. Average pain improvement on a 0-10 pain scale was 5.0 (from 7.8 to 2.8), which translates to a 64% relative decrease in average pain. Half of all respondents also noted relief from stress/anxiety, and nearly half (45%) reported relief from insomnia. Most patients (71%) reported no adverse effects, while 6% reported a cough or throat irritation and 5% feared arrest even though medical cannabis is legal in Hawai'i. No serious adverse effects were reported. These results suggest that Cannabis is an extremely safe and effective medication for many chronic pain patients. Cannabis appears to alleviate pain, insomnia, and may be helpful in relieving anxiety. Cannabis has shown extreme promise in the treatment of numerous medical problems and deserves to be released from the current Schedule I federal prohibition against research and prescription.

  3. Hospital benefit segmentation.

    Science.gov (United States)

    Finn, D W; Lamb, C W

    1986-12-01

    Market segmentation is an important topic to both health care practitioners and researchers. The authors explore the relative importance that health care consumers attach to various benefits available in a major metropolitan area hospital. The purposes of the study are to test, and provide data to illustrate, the efficacy of one approach to hospital benefit segmentation analysis.

  4. Wellbeing or welfare benefits

    DEFF Research Database (Denmark)

    Handlos, Line Neerup; Kristiansen, Maria; Nørredam, Marie Louise

    2016-01-01

    This debate article debunks the myth that migrants are driven primarily by the size of the welfare benefits in the host country, when they decide where to migrate to. We show that instead of welfare benefits, migrants are driven by a desire for safety, wellbeing, social networks and opportunities...

  5. Dosing Schedules for Pneumococcal Conjugate Vaccine

    Science.gov (United States)

    2014-01-01

    Since second generation pneumococcal conjugate vaccines (PCVs) targeting 10 and 13 serotypes became available in 2010, the number of national policy makers considering these vaccines has steadily increased. An important consideration for a national immunization program is the timing and number of doses—the schedule—that will best prevent disease in the population. Data on disease epidemiology and the efficacy or effectiveness of PCV schedules are typically considered when choosing a schedule. Practical concerns, such as the existing vaccine schedule, and vaccine program performance are also important. In low-income countries, pneumococcal disease and deaths typically peak well before the end of the first year of life, making a schedule that provides PCV doses early in life (eg, a 6-, 10- and 14-week schedule) potentially the best option. In other settings, a schedule including a booster dose may address disease that peaks in the second year of life or may be seen to enhance a schedule already in place. A large and growing body of evidence from immunogenicity studies, as well as clinical trials and observational studies of carriage, pneumonia and invasive disease, has been systematically reviewed; these data indicate that schedules of 3 or 4 doses all work well, and that the differences between these regimens are subtle, especially in a mature program in which coverage is high and indirect (herd) effects help enhance protection provided directly by a vaccine schedule. The recent World Health Organization policy statement on PCVs endorsed a schedule of 3 primary doses without a booster or, as a new alternative, 2 primary doses with a booster dose. While 1 schedule may be preferred in a particular setting based on local epidemiology or practical considerations, achieving high coverage with 3 doses is likely more important than the specific timing of doses. PMID:24336059

  6. 10 CFR 51.15 - Time schedules.

    Science.gov (United States)

    2010-01-01

    ... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... 10 Energy 2 2010-01-01 2010-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... NEPA review in accordance with any time schedule established under this section. (b) As specified in...

  7. Dishabituation Produces Interactions during Multiple Schedules

    Science.gov (United States)

    McSweeney, Frances K.; Kowal, Benjamin P.; Murphy, Eric S.; Isava, Duane M.

    2004-01-01

    McSweeney and Weatherly (1998) argued that differential habituation to the reinforcer contributes to the behavioral interactions observed during multiple schedules. The present experiment confirmed that introducing dishabituators into one component of a multiple schedule increases response rate in the other, constant, component. During baseline,…

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

  9. Scheduling Algorithm for Complex Product Development

    Institute of Scientific and Technical Information of China (English)

    LIUMin; ZHANGLong; WUCheng

    2004-01-01

    This paper describes the Complex product development project scheduling problem (CPDPSP) with a great number of activities, complicated resource, precedence and calendar constraints. By the conversion of precedence constraint relations, the CPDPSP is simplified. Then, according to the predictive control principle, we propose a new scheduling algorithm Based on prediction (BoP-procedure). In order to get the problem characteristics coming from resource status and precedence constraints of the scheduling problem at the scheduling time, a sub-project is constructed on the basis of a sub-AoN (Activity on node) graph of the project. Then, we use the modified GDH-procedure to solve the sub-project scheduling problem and to obtain the maximum feasible active subset for determining the activity group which satisfies resource, precedence and calendar constraints and has the highest scheduling priority at the scheduling time. Additionaily, we make a great number of numerical computations and compare the performance of BoP-procedure algorithm with those of other scheduling algorithms. Computation results show that the BoP-procedure algorithm is more suitable for the CPDPSP. At last, we discuss briefly future research work in the CPDPSP.

  10. NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    XIE Zhiqiang; YE Guangjie; ZHANG Dali; TAN Guangyu

    2008-01-01

    Considering the complex constraint between operations in nonstandard job shop scheduling problem (NJSSP), critical path of job manufacturing tree is determined according to priority scheduling function constructed. Operations are divided into dependent operations and independent operations with the idea of subsection, and corresponding scheduling strategy is put forward according to operation characteristic in the segment and the complementarities of identical function machines. Forward greedy rule is adopted mainly for dependent operations to make operations arranged in the right position of machine selected, then each operation can be processed as early as possible, and the total processing time of job can be shortened as much as possible. For independent operations optimum scheduling rule is adopted mainly, the inserting position of operations will be determined according to the gap that the processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal gap. Experiments show, under the same conditions, the result that operations are scheduled according to the object function constructed, and the scheduling strategy adopted is better than the result that operations are scheduled according to efficiency scheduling algorithm.

  11. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc

    2016-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the processing times of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated

  12. Downlink Scheduling in Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Anwar Hossain

    2015-06-01

    Full Text Available This is an investigated research article on resource block scheduling of Long Term Evolution (LTE. LTE is one of the evolutions of the Universal Mobile Telecommunication System (UMTS. It provides internet access to mobile users through smart phone, laptop and other android devices. LTE offers a high speed data and multimedia services. It supports data rates up to 100 Mbps in the downlink and 50 Mbps in the uplink transmission. Our research investigation was aim to the downlink scheduling. We have considered The Best CQI scheduling algorithm and the Round Robin scheduling algorithm. The implementation, analysis and comparison of these scheduling algorithms have been performed through MATLAB simulator. We have analyzed the impact of the scheduling schemes on the throughput and the fairness of both scheduling schemes. Here we have proposed a new scheduling algorithm that achieves a compromise between the throughput and the fairness. Orthogonal Frequency Division Multiplexing (OFDM has been adopted as the downlink transmission scheme. We have considered the impact of the channel delay on the throughput. In addition, MIMO transceiver systems have been implemented to increase the throughput

  13. Scheduling in high performance buffered crossbar switches

    NARCIS (Netherlands)

    Mhamdi, L.

    2007-01-01

    High performance routers are the basic building blocks of the Internet. Most high performance routers built today use crossbars and a centralized scheduler. Due to their high scheduling complexity, crossbar-based routers are not scalable and cannot keep pace with the explosive growth of the Internet

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

  15. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Classification schedules. 2..., DEPARTMENT OF COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Classification § 2.85 Classification schedules. (a) International classification system. Section 6.1 of this chapter sets forth the...

  16. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

    Slomp, J.; Gaalman, G.J.C.; Ahmad, M.M.; Sullivan, W.G.; Migliore, H.; Randhawa, S.

    1998-01-01

    The existence of a well-designed scheduling procedure is a major condition for an effective integration of a flexible manufacturing cell (FMC) in the material flow of a firm. This paper shows the presence and relative importance of three parameter types in the scheduling of operations on a flexible

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

  18. 5 CFR 293.511 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Medical File System Records § 293.511 Retention schedule. (a) Temporary EMFS records must... accordance with General Records Schedule (GRS) 1, item 21, issued by the National Archives and Records Administration (NARA). (b) Occupational Medical Records considered to be long-term records must be maintained...

  19. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

    Obinna Nnamani, Christantus; Anioke, Chidera Linda; Ikechukwu Ani, Cosmas

    2016-11-01

    In long-term evolution (LTE) downlink transmission, modified least weighted delay first (MLWDF) scheduler is a quality of service (QoS) aware scheduling scheme for real-time (RT) services. Nevertheless, MLWDF performs below optimal among the trade-off between strict delay and loss restraints of RT and non-RT traffic flows, respectively. This is further worsened with the implementation of hybrid automatic retransmission request (HARQ). As these restraints grow unabated with increasing number of user demands, the performance of MLWDF further reduces. In order to ameliorate this situation, there is a need to directly incorporate the variations in user demands and HARQ implementation as parameters to the MLWDF scheduler. In this work, an improvement to the MLWDF scheduler is proposed. The improvement entails adding two novel parameters that characterise user demand and HARQ implementation. The scheduler was tested using varying three classes of service in QoS class identifiers (QCIs) table standardised by Third Generation Partnership Project for LTE network to characterise different services. It was also tested on the basis of packet prioritisation. The proposed scheduler was simulated with LTE-SIM simulator and compared with the MLWDF and proportional fairness schedulers. In terms of delay, throughput and packet loss ratio; the proposed scheduler increased overall system performance.

  20. On green routing and scheduling problem

    CERN Document Server

    Touati, Nora

    2012-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  1. On green routing and scheduling problem

    OpenAIRE

    Touati, Nora; Jost, Vincent

    2011-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  2. Shaping Academic Task Engagement with Percentile Schedules

    Science.gov (United States)

    Athens, Elizabeth S.; Vollmer, Timothy R.; St. Peter Pipkin, Claire C.

    2007-01-01

    The purpose of this study was to examine the use of percentile schedules as a method of quantifying the shaping procedure in an educational setting. We compared duration of task engagement during baseline measurements for 4 students to duration of task engagement during a percentile schedule. As a secondary purpose, we examined the influence on…

  3. Performance analysis of active schedules in identical parallel machine

    Institute of Scientific and Technical Information of China (English)

    Changjun WANG; Yugeng XI

    2007-01-01

    Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs' dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

  4. Throughput Gain Using Threshold-Based Multiuser Scheduling in WiMAX OFDMA

    Directory of Open Access Journals (Sweden)

    Sulyman AhmedIyanda

    2011-01-01

    Full Text Available This paper presents the analysis of the throughput enhancement possible using threshold-based multiuser scheduling in WiMAX OFDMA. We consider a point-to-multipoint (PMP WiMAX network where base station (BS schedules downlink packets for simultaneous transmissions to multiple users using the WiMAX OFDMA system. WiMAX OFDMA standard specifies several subcarrier permutation options, such as the partial usage of subcarriers (PUSC, full usage of subcarrier (FUSC, and the band adaptive modulation and coding (band-AMC among others, for mapping the physical subcarriers into logical subchannels assigned to users by the BS schedulers. In this paper, we propose the use of threshold testing prior to the process of subchannel assignment to users by the BS scheduler, as a means of throughput enhancement. In the proposed threshold-based multiuser scheduling scheme, the BS scheduler selects at any time instant users whose channel gains in the available subchannels equal or exceed a predetermined energy threshold. Thus, only users who can maximize BS throughput on the available subchannels are assigned data transmission opportunities which enhance the BS data rate, albeit at the expense of fairness to users. We quantify the throughput enhancement of the proposed system and illustrate its benefits by numerical simulations.

  5. Scheduler Vulnerabilities and Attacks in Cloud Computing

    CERN Document Server

    Zhou, Fangfei; Desnoyers, Peter; Sundaram, Ravi

    2011-01-01

    In hardware virtualization a hypervisor provides multiple Virtual Machines (VMs) on a single physical system, each executing a separate operating system instance. The hypervisor schedules execution of these VMs much as the scheduler in an operating system does, balancing factors such as fairness and I/O performance. As in an operating system, the scheduler may be vulnerable to malicious behavior on the part of users seeking to deny service to others or maximize their own resource usage. Recently, publically available cloud computing services such as Amazon EC2 have used virtualization to provide customers with virtual machines running on the provider's hardware, typically charging by wall clock time rather than resources consumed. Under this business model, manipulation of the scheduler may allow theft of service at the expense of other customers, rather than merely reallocating resources within the same administrative domain. We describe a flaw in the Xen scheduler allowing virtual machines to consume almost...

  6. Approximation algorithm for multiprocessor parallel job scheduling

    Institute of Scientific and Technical Information of China (English)

    陈松乔; 黄金贵; 陈建二

    2002-01-01

    Pk|fix|Cmax problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k≥3. This paper focuses on the case of k=3. Some new observations and new techniques for P3|fix|Cmax problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P3|fix|Cmax problem, and improves the previous best ratio of 7/6 by M.X.Goemans.

  7. Garbage Collection Scheduling of Aperiodic Tasks

    Institute of Scientific and Technical Information of China (English)

    Ning Zhang; Guang-Ze Xiong

    2009-01-01

    In the previous work of garbage collection (GC) models, scheduling analysis was given based on an assumption that there were no aperiodic mutator tasks. However, it is not true in practical real-time systems. The GC algorithm which can schedule aperiodic tasks is proposed, and the variance of live memory is analyzed. In this algorithm, active tasks are deferred to be processed by GC until the states of tasks become inactive, and the saved sporadic server time can be used to schedule aperiodic tasks. Scheduling the sample task sets demonstrates that this algorithm in this paper can schedule aperiodic tasks and decrease GC work. Thus, the GC algorithm proposed is more flexible and portable.

  8. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

    Alessandri, Jérôme; Cançado, Carlos R X

    2015-12-01

    The generalized matching equation provides a good description of response allocation in concurrent schedules of positive reinforcement in nonhumans as well as in humans. The present experiment was conducted to further investigate the allocation of responding under concurrent schedules of negative reinforcement (i.e., timeouts from pressing a force cell) in humans. Each of three participants was exposed to different reinforcement ratios (9:1, 1:1 and 1:9) in the terminal links of a concurrent-chains schedule of negative reinforcement. The allocation of responding under this schedule was well described by the generalized matching equation, for each participant. These results replicate previous findings obtained with nonhumans and humans under concurrent schedules of positive reinforcement. In addition, they extend the results reported by Alessandri and Rivière (2013) showing that human behavior maintained by timeouts from an effortful response is sensitive to changes in relative reinforcement ratios as well as relative delays of reinforcement.

  9. Dynamic Scheduling of Flexible Job Shops

    Institute of Scientific and Technical Information of China (English)

    SHAHID Ikramullah Butt; SUN Hou-fang

    2007-01-01

    Aim of this research is to minimize makespan in the flexible job shop environment by the use of genetic algorithms and scheduling rules.Software is developed using genetic algorithms and scheduling rules based on certain constraints such as non-preemption of jobs,recirculation,set up times,non-breakdown of machines etc.Purpose of the software is to develop a schedule for flexible job shop environment,which is a special case of job shop scheduling problem.Scheduling algorithm used in the software is verified and tested by using MT10 as benchmark problem,presented in the flexible job shop environment at the end.LEKIN(R) software results are also compared with results of the developed software by the use of MT10 benchmark problem to show that the latter is a practical software and can be used successfully at BIT Training Workshop.

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

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

  12. Unemployment Benefit Exhaustion

    DEFF Research Database (Denmark)

    Filges, Trine; Pico Geerdsen, Lars; Knudsen, Anne-Sofie Due

    2015-01-01

    studies for final analysis and interpretation. Twelve studies could be included in the data synthesis. Results: We found clear evidence that the prospect of exhaustion of benefits results in a significantly increased incentive for finding work. Discussion: The theoretical suggestion that the prospect......This systematic review studied the impact of exhaustion of unemployment benefits on the exit rate out of unemployment and into employment prior to benefit exhaustion or shortly thereafter. Method: We followed Campbell Collaboration guidelines to prepare this review, and ultimately located 12...... of exhaustion of benefits results in an increased incentive for finding work has been confirmed empirically by measures from seven different European countries, the United States, and Canada. The results are robust in the sense that sensitivity analyses evidenced no appreciable changes in the results. We found...

  13. Attitude Formation of Benefits Satisfaction: Knowledge and Fit of Benefits

    OpenAIRE

    Gery Markova, Foard Jones

    2011-01-01

    Using the theoretical framework of the Theory of Reasoned Action [6], we examine benefits satisfactionas an attitude formed by the beliefs about benefits (i.e., benefits knowledge) and the perceived value ofthese benefits (i.e., fit of benefits to individual needs). We use questionnaires to gather data from arandom sample of 591 employees in a large county agency in the South-eastern United States. The datasupport that knowledge of benefits is associated with enhanced benefits satisfaction an...

  14. Benefits for handicapped children

    CERN Multimedia

    2003-01-01

    The introduction of long-term care benefits within the CERN Health Insurance Scheme requires the coordination of the benefits foreseen for handicapped children. Measures were adopted by the Management following the recommendation made by the Standing Concertation Committee on 26 March 2003. A document clarifying these measures is available on the Web at the following address: http://humanresources.web.cern.ch/humanresources/external/soc/Social_affairs/social_affairs.asp Social Affairs Service 74201

  15. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction and Schedule After nearly seven months of concentrated effort, the installation of services on YB0 moved off the CMS critical path in late November. In line with v36 planning provisions, the additional time needed to finish this challeng¬ing task was accommodated by reducing sequential dependencies between assembly tasks, putting more tasks (especially heavy logistic movements) in parallel with activities on, or within, the central wheel. Thus the lowering of wheels YB-1 and YB -2 and of disk YE-3 is already complete, the latter made possible, in the shadow of YB0 work, by inverting the order of the 3 endcap disks in the surface building. Weather conditions permitting, the Tracker will be transported to point 5 during CMS week for insertion in EB before CERN closes. The lowering of the last two disks will take place mid- and end-of January, respectively. Thus central beampipe installation can be confidently planned to start in February as foreseen, allowing closure of CMS in time for CRA...

  16. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Despite the holiday season affecting available manpower, many key internal milestones have been passed over the summer, thanks to the dedication and commitment of the team at point 5. In particular, the installation on, and within, YB0 has progressed steadily through several potentially difficult phases. The v36 planning contingency of lowering YB-1 and YB-1 wheels on schedule in October, before Tracker installation, will be executed in order to give more time to complete YB0 services work, whilst still being consistent with completion of heavy lowering by the end of 2007. Safety In the underground areas the peak level of activity and parallel work has been reached and this will continue for the coming months. Utmost vigilance is required of everybody working underground and this must be maintained. However, it is encouraging to note that the compliance with safety rules is, in general, good. More and more work will be carried out from scaffolding and mobile access platforms. (cherry-picke...

  17. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Since the lowering of YB0 in February, less spectacular but nonetheless crucial progress has been made along the critical path to CMS completion. The YB0 has been aligned with the beamline to a fraction of a mm, and the HCAL has been fully installed. Cabling scaffolding for YB0 services has been built and one half (-z end) of the ECAL barrel has been installed. The YB0 services installation has begun, with two of the major technical challenges delaying bulk installation, namely PP1 detailed design, manufacture and installation plus Tracker cooling pipe insulation, now apparently solved. Significant difficulties in detailed design, integration and procurement of cable ducts remain. Despite this, the design of the +end is close to complete, and Tracker power cable installation on two sectors of the +end is well advanced. A new master schedule, v36.0, is being prepared to account for the updated actual situation at point 5 and for the revised LHC machine planning. Safety The enormous amount of...

  18. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

    Full Text Available We present a design of a complete and practical scheduler for the 3GPP Long Term Evolution (LTE downlink by integrating recent results on resource allocation, fast computational algorithms, and scheduling. Our scheduler has low computational complexity. We define the computational architecture and describe the exact computations that need to be done at each time step (1 milliseconds. Our computational framework is very general, and can be used to implement a wide variety of scheduling rules. For LTE, we provide quantitative performance results for our scheduler for full buffer, streaming video (with loose delay constraints, and live video (with tight delay constraints. Simulations are performed by selectively abstracting the PHY layer, accurately modeling the MAC layer, and following established network evaluation methods. The numerical results demonstrate that queue- and channel-aware QoS schedulers can and should be used in an LTE downlink to offer QoS to a diverse mix of traffic, including delay-sensitive flows. Through these results and via theoretical analysis, we illustrate the various design tradeoffs that need to be made in the selection of a specific queue-and-channel-aware scheduling policy. Moreover, the numerical results show that in many scenarios strict prioritization across traffic classes is suboptimal.

  19. Use of Data Mining in Scheduler Optimization

    CERN Document Server

    Anderson, George; Nelwamondo, Fulufhelo V

    2010-01-01

    The operating system's role in a computer system is to manage the various resources. One of these resources is the Central Processing Unit. It is managed by a component of the operating system called the CPU scheduler. Schedulers are optimized for typical workloads expected to run on the platform. However, a single scheduler may not be appropriate for all workloads. That is, a scheduler may schedule a workload such that the completion time is minimized, but when another type of workload is run on the platform, scheduling and therefore completion time will not be optimal; a different scheduling algorithm, or a different set of parameters, may work better. Several approaches to solving this problem have been proposed. The objective of this survey is to summarize the approaches based on data mining, which are available in the literature. In addition to solutions that can be directly utilized for solving this problem, we are interested in data mining research in related areas that have potential for use in operat...

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

  1. Observing of chain-schedule stimuli.

    Science.gov (United States)

    Slezak, Jonathan M; Anderson, Karen G

    2014-06-01

    A classical-conditioning account of the processes maintaining behavior under chained schedules entails a backward transmission of conditioned-reinforcement effects. Assessing this process in traditional chain schedules is limited because the response maintained by stimulus onset accompanied by each link in a chain schedule may also be maintained by the primary reinforcer. In the present experiment, an observing response was used to measure the conditioned-reinforcing effects of stimuli associated with a three-link chain variable-time (VT) food schedule, and resistance-to-change tests (extinction and prefeeding) were implemented to examine if a backward transmission of reinforcement effects occur. Four pigeons served as subjects. Observing was maintained by the production of stimuli correlated with links of a three-link chain VT schedule with the middle-link stimulus maintaining the highest rate of observing, followed by the initial-link stimulus and the terminal-link stimulus maintaining the lowest observing rate. Results from resistance-to-change tests of extinction and prefeeding were not supportive of a backward transmission of reinforcement effects and in general, the pattern of resistance-to-change was forward. Based on past and current research, it appears that a backward pattern of relative rate decreases in responses maintained by stimuli correlated with a chain schedule due to disruption (i.e., extinction and prefeeding) is not a ubiquitous process that is evident within different chain-schedule arrangements.

  2. STATUS OF SCHEDULE TRIBES IN ANDHRA PRADESH

    Directory of Open Access Journals (Sweden)

    Dr. P. Subramanyachary

    2013-01-01

    Full Text Available Schedule Tribes (ST’s are Indian population groups that are explicitly recognized by the constitution of India order 1950. The order lists 744 tribes across 22 states in its first schedule. In Andhra Pradesh 33 types of Schedule Tribes are living in 8 districts. ST’s are 6.6% are in total population of Andhra Pradesh. They have rich heritage along with their innocent life style. As they are living in hill areas and forests they have some peculiar characters like indications of primitive traits, distinctive culture, and shyness of contact with other communities, geographical isolation, backwardness etc. So, for their development central and state governments are implementing different programmes and schemes since 1951. After the Ministry of Tribal affairs were constituted in 1999, there is more focus on development of Schedule Tribes in Indian society especially in Andhra Pradesh. The persisting problems like low literacy and high drop-outs, inadequate health services, lack of nutrition food, extreme poverty, and ineffective implementation of schemes etc are putting them away from economic development. Hence, there should be more commitment by both central and state government and local bodies to develop Schedule Tribes in the society. As literacy is 37% NGO’s and other voluntary organizations have to play key role to bring awareness among schedule tribes regarding programs and scheme for their development. Awareness and participation of Schedule Tribes in the implementation of policies leads to prosperity of ST community in the state as well as country.

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

  4. Optimal radiotherapy dose schedules under parametric uncertainty

    Science.gov (United States)

    Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

    2016-01-01

    We consider the effects of parameter uncertainty on the optimal radiation schedule in the context of the linear-quadratic model. Our interest arises from the observation that if inter-patient variability in normal and tumor tissue radiosensitivity or sparing factor of the organs-at-risk (OAR) are not accounted for during radiation scheduling, the performance of the therapy may be strongly degraded or the OAR may receive a substantially larger dose than the allowable threshold. This paper proposes a stochastic radiation scheduling concept to incorporate inter-patient variability into the scheduling optimization problem. Our method is based on a probabilistic approach, where the model parameters are given by a set of random variables. Our probabilistic formulation ensures that our constraints are satisfied with a given probability, and that our objective function achieves a desired level with a stated probability. We used a variable transformation to reduce the resulting optimization problem to two dimensions. We showed that the optimal solution lies on the boundary of the feasible region and we implemented a branch and bound algorithm to find the global optimal solution. We demonstrated how the configuration of optimal schedules in the presence of uncertainty compares to optimal schedules in the absence of uncertainty (conventional schedule). We observed that in order to protect against the possibility of the model parameters falling into a region where the conventional schedule is no longer feasible, it is required to avoid extremal solutions, i.e. a single large dose or very large total dose delivered over a long period. Finally, we performed numerical experiments in the setting of head and neck tumors including several normal tissues to reveal the effect of parameter uncertainty on optimal schedules and to evaluate the sensitivity of the solutions to the choice of key model parameters.

  5. 出口退税政策与出口型外贸企业现金流运行均衡管理研究%A Research on Export Tax Rebate Policy and Balanced Management of Cash Flow of Export-oriented Foreign Trade Enterprises

    Institute of Scientific and Technical Information of China (English)

    陶云龙; 施汉忠; 章贵桥

    2014-01-01

    The previous studies on export tax rebate pay much more attention to the regulatory role of export tax rebate policy in macro-economy,there is little research literature on how the policy conducts and affects cash flow of microscopic export enter-prises. The paper starts from analyzing and comparing the export tax rebate policy before and after the financial crisis,based on this,then it analyzes how the export tax rebate policy adjusted comprehensively affects cash flow run of microscopic export-ori-ented foreign trade enterprises. It tentatively explores the rules and characteristics of cash flow of China’s export-oriented for-eign trade enterprises based on the export tax rebate policy after the financial crisis, in order to generalize and summarize the general characteristics of how the export tax rebate policy conducts and influences cash flow of export-oriented foreign trade en-terprises. The paper also puts forward different cash flow management measures and strategies for different situations in order to provide some insights for export-oriented foreign trade enterprises to achieve balanced management of cash flow and prevent the drying up risk of cash flow in the post-crisis era.%对于出口退税研究以往较多关注出口退税政策对宏观经济调控作用,但其如何传导及影响微观出口型企业现金流,学者们对此领域的研究文献却不多见,文章分析与比较了危机前后的出口退税政策,并以此展开研究,分析调整后的出口退税政策如何综合作用于微观外贸出口型企业现金流运行。尝试性探索金融危机后基于我国出口退税政策特质出口型外贸企业现金流运行规律与特征,以期归纳与总结出出口退税政策如何传导并作用于出口型外贸企业现金流运行的一般特性,并针对性提出不同现金流管理措施与策略,以期为后危机时代外贸出口型企业实现现金流运行均衡管理,防范现金流运行

  6. Schedule Uncertainty Control: A Literature Review

    Science.gov (United States)

    Jun-yan, Liu

    Risk control on project schedule is one of the focus problems in the academic circle and the practical area all the time. Lots of research about risk control on project schedule have been fulfilled and many achievements have appeared in recent several decades. The literature on the techniques of schedule uncertainty control was reviewed. A summary analysis on those chievements is presented such as CPM, PERT, MC, BBN, and so on and in light of that summary analysis a deep discussion in terms of advantages and disadvantages of existing research has been analyzed, so that researchers can continue to refine their research.

  7. Multiprocessor Scheduling Using Parallel Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nourah Al-Angari

    2012-07-01

    Full Text Available Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance. The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.

  8. NEWS OF THE NATIONAL IMMUNIZATION SCHEDULE

    Directory of Open Access Journals (Sweden)

    O. V. Shamsheva

    2014-01-01

    Full Text Available The article presents the changes Immunization Schedule Russia introduced in 2014. In new Schedule now is the vaccination against pneumococcal disease for all children of 2 months with revaccination at 4 and 15 months old; excluded from the Schedule second revaccination against tuberculosis. At risk groups to be vaccinated against the flu, entered pregnant women and persons subject to military conscription. Recommendations on use of vaccines containing relevant antigens for the Russian Federation, to provide maximum effectiveness of immunization and vaccines that do not contain preservatives in children under 1 year of age. Offered to create a council of experts in the field of vaccinology and vaccine prevention

  9. Proposed Schedule for Fenton Hill Experiments

    Energy Technology Data Exchange (ETDEWEB)

    Albright, James N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Brown, Donald W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    1990-10-22

    To help in planning Fenton Hill experimental operations in concert with preparations for the Long-Term Flow Test (LTFT) next summer, the following schedule is proposed. This schedule fits some of the realities of the next few months, including the Laboratory closure during the Holidays, the seismic monitoring tests in Roswell, and the difficulties of operating during the winter months. Whenever possible, cyclic pumping operations during the colder months will be scheduled so that the pump will be on during the late evening and early morning hours to prevent freezeup.

  10. Scheduling and Subcontracting under Parallel Machines

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; TANG Guo-chun

    2012-01-01

    In this paper,we study a model on joint decisions of scheduling and subcontracting,in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.

  11. New schedulability analysis for WiDom

    OpenAIRE

    Vahabi, Maryam; Andersson, Björn

    2010-01-01

    WiDom is a wireless prioritized medium access control (MAC) protocol which offers a very large number of priority levels. Hence, it brings the potential for employing non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom with lower overhead (we call it: WiDo...

  12. Concurrent Scheduling of Event-B Models

    CERN Document Server

    Boström, Pontus; Sere, Kaisa; Waldén, Marina; 10.4204/EPTCS.55.11

    2011-01-01

    Event-B is a refinement-based formal method that has been shown to be useful in developing concurrent and distributed programs. Large models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. We explore how schedules can be designed so that their application results in a correctness-preserving refinement step. For practical application, two patterns for schedule introduction are provided, together with their associated proof obligations. We demonstrate our method by applying it on the dining philosophers problem.

  13. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

    This paper deals with the problem of simultaneously scheduling machines and a number of autonomous mobile robots in a flexible manufacturing system (FMS). Besides capability of transporting materials between machines, the considered mobile robots are different from other material handling devices...... in terms of their advanced ability to perform tasks at machines by using their manipulation arms. The mobile robots thus have to be scheduled in relation to scheduling of machines so as to increase the efficiency of the overall system. The performance criterion is to minimize time required to complete all...

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

  15. Optimal Power Scheduling for a Grid-Connected Hybrid PV-Wind-Battery Microgrid System

    DEFF Research Database (Denmark)

    Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Savaghebi, Mehdi

    2016-01-01

    In this paper, a lineal mathematical model is proposed to schedule optimally the power references of the distributed energy resources in a grid-connected hybrid PVwind-battery microgrid. The optimization of the short term scheduling problem is addressed through a mixed-integer linear programming...... mathematical model, wherein the cost of energy purchased from the main grid is minimized and profits for selling energy generated by photovoltaic arrays are maximized by considering both physical constraints and requirements for a feasible deployment in the real system. The optimization model is tested...... by using a real-time simulation of the model and uploaded it in a digital control platform. The results show the economic benefit of the proposed optimal scheduling approach in two different scenarios....

  16. Simulation and Analysis of Node Scheduling Schemes in IEEE 802.17 Standard

    Directory of Open Access Journals (Sweden)

    Mohsen Ashourian

    2007-09-01

    Full Text Available The Resilient Packet Ring (RPR architecture, known as the IEEE 802.17 standard, has received attention in the last year. The Priority Queue (PQ algorithm is recommended as the scheduling scheme for RPR, which always gives priority to the transit buffer. Using this scheduling scheme in RPR, the high priority traffic, such as video packets waiting to access the ring at congested node in the transmit buffer, suffer large delays and unsteady delay jitters. In this, we propose new scheduling schemes base on Deficit Round-Robin (DRR algorithm and compare it with the original schemes. To assess the efficiency of the system we simulate the network with 10 node attachments in the OPNET simulator and consider the efficiency of the new scheme. Using this scheme, the QoS of traffic transmission on the congested node can be significantly improved. Real time video traffic can benefit from such schemes.

  17. A model program to reduce patient failure to keep scheduled medical appointments.

    Science.gov (United States)

    Schmalzried, Hans D; Liszak, Joseph

    2012-06-01

    Community health center clinics that rely on scheduled appointments lose revenue and time when patients do not keep their appointments. Various approaches have been used to improve the rate of patient appointments kept. This article provides a model intervention program developed by a quality improvement committee at a Northwest Ohio community health center that is credited with significantly reducing rates of patient failure to keep scheduled medical and dental clinic appointments. The approach of this intervention program is different from others in that it was primarily designed to help patients learn how to become part of the solution to the problem. Community health center staff accomplishes this through engaging patients in a respectful and courteous manner and helping them understand the importance of their involvement in maintaining an efficient scheduling process to benefit all patients. Data collected from outpatient appointment records before and after implementation of the program indicate that missed appointments dropped to less than half the pre-intervention rate.

  18. 出口退税、行业集中度与出口行业“盯市”行为研究%A Research of Export Tax Rebates, Industry Concentration and the Behavior of Pricing to Market(PTM)

    Institute of Scientific and Technical Information of China (English)

    项后军; 何康; 宋申栋

    2016-01-01

    本文以金融危机前后曾出现的出口退税较大调整为背景,应用面板平滑转换模型( PSTR)对出口行业“盯市”(依市定价)程度与出口退税、行业集中度之间的关系展开探讨。研究结果表明,就行业集中度而言,无论危机前还是危机后始终对出口行业的PTM行为产生影响,且均与PTM存在平滑转变的非线性关系;出口退税仅在危机后的大幅提升后才对PTM影响显著,并表现为突变的快速向下的门限效应,而危机前对PTM并无影响;与出口退税相比,行业集中度对PTM的影响虽非立竿见影但却是缓慢且持久的。%Using the more recently developed panel threshold regression models , this paper investigates the nonlinear re-lationship between Pricing to market ( PTM) of export prices on industry level and concentration ratio of industry and nonlinear relationship between Pricing to market ( PTM) of export prices on industry level and export tax rebates under two different eco -nomic backgrounds.The results of the study include the following four points.First, PTM before the financial crisis is differ-ent from PTM after the financial crisis.Secondly , in terms of industry concentration , industry concentration always exercises a great influence on PTM under different economic backgrounds , and there is a nonlinear relationship between PTM and industry concentration under different economic backgrounds.Thirdly, In terms of export tax rebates , there is neither linear nor nonlin-ear relationship between PTM and export tax rebates before financial crisis while export tax refund has significant effects on PTM after financial crisis.There is a threshold effect between PTM and export tax refund after financial crisis.Finally, Com-pared with the export tax rebate , industry concentration has more significant effect on PTM.

  19. Physician Fee Schedule Carrier Specific Files

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Centers for Medicare and Medicaid Services (CMS) has condensed all 56 Physician Fee Schedule (PFS) carrier specific pricing files into one zip file. It is...

  20. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ...) Inservice training plans for enforcement personnel will be developed within 18 months of plan approval. (f... Inspection Scheduling System will be fully implemented and in operation March 31, 1975....

  1. The GBT Dynamic Scheduling System: An Update

    Science.gov (United States)

    Clark, M. H.; Balser, D. S.; Braatz, J.; Condon, J.; Creager, R. E.; McCarty, M. T.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2011-07-01

    The Robert C. Byrd Green Bank Telescope's (GBT) Dynamic Scheduling System (DSS), in production use since September 2009, was designed to maximize observing efficiency while maintaining the GBT's flexibility, improving data quality, and minimizing any undue adversity for the observers. Using observing criteria, observer availability and qualifications, three-dimensional weather forecasts, and telescope state, the DSS software is capable of optimally scheduling observers 24 to 48 hours in advance on a telescope having a wide-range of capabilities in a geographical location with variable weather patterns. Recent improvements for the GBT include an expanded frequency coverage (0.390-90 GHz), proper treatment of fully sampled array receivers, increasingly diverse observing criteria, the ability to account for atmospheric instability from clouds, and new tools for scheduling staff to control and interact with generated schedules and the underlying database.

  2. NASA Deep Space Network Operations Scheduling

    Science.gov (United States)

    Enari, D. M.

    The functioning of the Deep Space Network Operations Scheduling, Jet Propulsion Laboratory, CA is reviewed. The primary objectives of the Operations Scheduling are: to schedule the worldwide global allocation of ground communications, tracking facilities, and equipment; and to provide deep space telecommunications for command, tracking, telemetry, and control in support of flight mission operations and tests. Elements of the earth set are Deep Space Stations (DSS) which provide the telecommunications link between the earth and spacecraft; NASA Communications Network; Network Data Processing Area; Network Operations Control Area which provides operational direction to the DSS; Mission Control and Computing systems; and Mission Support areas which provide flight control of the spacecraft. Elements of the space set include mission priorities and requirements which determine the spacecraft queue for allocating network resources. Scheduling is discussed in terms of long-range (3 years), mid-range (8 weeks), and short-range (2 weeks).

  3. Alternative Work Schedules Increase Employee Satisfaction.

    Science.gov (United States)

    Turney, John R.; Cohen, Stanley L.

    1983-01-01

    Facets of alternative work schedules (AWS) are discussed: importance of employee control, possible negative consequences, AWS handbook, time monitoring systems, and treatment of exceptions. AWS' effect on productivity and motivation is examined. (SK)

  4. Onboard Autonomous Scheduling Intelligence System Project

    Data.gov (United States)

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

  5. Individualized Project Physics in a Modular Schedule.

    Science.gov (United States)

    Cange, Francis

    1985-01-01

    Project Physics is taught at Gibault High School (Waterloo, IL) using a modular schedule and learning activity packets. A description of the course, instructional strategies used, and the learning activity packets is provided. (JN)

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

  7. Oversubscribed Mission Scheduler Conflict Resolution System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The allocation and scheduling of limited communication assets to an increasing number of satellites and other spacecraft remains a complex and challenging problem....

  8. Home Appliance Load Scheduling with SEMIAH

    DEFF Research Database (Denmark)

    Jacobsen, Rune Hylsberg; Ghasem Azar, Armin; Zhang, Qi;

    2015-01-01

    The European research project SEMIAH aims at designing a scalable infrastructure for residential demand response. This paper presents the progress towards a centralized load scheduling algorithm for controlling home appliances taking power grid constraints and satisfaction of consumers into account....

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

  10. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2000-01-27

    This document contains the CY2000 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.

  11. Intelligent Feedback Scheduling of Control Tasks

    Directory of Open Access Journals (Sweden)

    Fatin I. Telchy

    2014-12-01

    Full Text Available an efficient feedback scheduling scheme based on the proposed Feed Forward Neural Network (FFNN scheme is employed to improve the overall control performance while minimizing the overhead of feedback scheduling which exposed using the optimal solutions obtained offline by mathematical optimization methods. The previously described FFNN is employed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. The proposed intelligent scheduler will be examined with different optimization algorithms. An inverted pendulum cost function is used in these experiments. Then, simulation of three inverted pendulums as intelligent Real Time System (RTS is described in details. Numerical simulation results demonstrates that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling

  12. RESOURCE SCHEDULING IN CLOUD ENVIRONMET: A SURVEY

    Directory of Open Access Journals (Sweden)

    Neeraj Mangla

    2016-06-01

    Full Text Available Cloud Computing offers the avant-garde services at a stretch that are too attractive for any cloud user to ignore. With its growing application and popularization, IT companies are rapidly deploying distributed data centers globally, posing numerous challenges in terms of scheduling of resources under different administrative domains. This perspective brings out certain vital factors for efficient scheduling of resources providing a wide genre of characteristics, diversity in context of level of service agreements and that too with user-contingent elasticity. In this paper, a comprehensive survey of research related to various aspects of cloud resource scheduling is provided. A comparative analysis of various resource scheduling techniques focusing on key performance parameters like Energy efficiency, Virtual Machine allocation and migration, Cost-effectiveness and Service-Level Agreement is also presented.

  13. 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 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...... instances with 1,000 jobs and 1,000 machines covering 24 hours of scheduling activity on a Grid network. The algorithm is also compared to simulations of a real-life Grid, and results show that the solution quality significantly increases when solving the problem to optimality. The promising results...

  14. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1990-01-01

    The optimization of space operations is examined in the light of optimization heuristics for computer algorithms and iterative search techniques. Specific attention is given to the search concepts known collectively as intelligent perturbation algorithms (IPAs) and their application to crew/resource allocation problems. IPAs iteratively examine successive schedules which become progressively more efficient, and the characteristics of good perturbation operators are listed. IPAs can be applied to aerospace systems to efficiently utilize crews, payloads, and resources in the context of systems such as Space-Station scheduling. A program is presented called the MFIVE Space Station Scheduling Worksheet which generates task assignments and resource usage structures. The IPAs can be used to develop flexible manifesting and scheduling for the Industrial Space Facility.

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

  16. Parallel Machine Scheduling with Special Jobs

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS (first come, first served), SWSC (special window for special customers), and FFFS (first fit, first served) algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 and FFFS has a competitive ratio of , and these bounds are tight.

  17. Schedule Sales Query Report Generation System

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

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

    KAUST Repository

    Rashid, Faraan

    2012-07-01

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

  19. Heuristic Based Task Scheduling In Grid

    Directory of Open Access Journals (Sweden)

    Manpreet Singh

    2012-09-01

    Full Text Available Grid computing is concerned with coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Efficient scheduling of complex applications in a grid environment reveals several challenges due to its high heterogeneity, dynamic behavior and space shared utilization. Objectives of scheduling algorithms are increase in system throughput, efficiency and reduction in task completion time. The main focus of this paper is to highlight the merits of resource and task selection technique based on certain heuristics.

  20. Coordinating, Scheduling, Processing and Analyzing IYA09

    Science.gov (United States)

    Gipson, John; Behrend, Dirk; Gordon, David; Himwich, Ed; MacMillan, Dan; Titus, Mike; Corey, Brian

    2010-01-01

    The IVS scheduled a special astrometric VLBI session for the International Year of Astronomy 2009 (IYA09) commemorating 400 years of optical astronomy and 40 years of VLBI. The IYA09 session is the most ambitious geodetic session to date in terms of network size, number of sources, and number of observations. We describe the process of designing, coordinating, scheduling, pre-session station checkout, correlating, and analyzing this session.

  1. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

    This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit

  2. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    GANTT, D.A.

    2000-01-12

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FETF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This revision reflects the 19 Oct 1999 baseline.

  3. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    BOWEN, W.W.

    1999-11-08

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FFTF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This document reflects the 1 Oct 1999 baseline.

  4. Self-Healing Distributed Scheduling Platform

    OpenAIRE

    Frincu M.E.; Villegas N.M.; Petcu D.; Muller H.A.; Rouvoy R.

    2011-01-01

    International audience; Distributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behaviour of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behaviour of distributed scheduling platforms and to achieve business and user objectives. In this paper we propose a self-adaptive distributed scheduling platf...

  5. Revised data taking schedule with ion beams

    CERN Document Server

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

    2009-01-01

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

  6. Critical Machine Based Scheduling -A Review

    Science.gov (United States)

    Vivek, P.; Saravanan, R.; Chandrasekaran, M.; Pugazhenthi, R.

    2017-03-01

    This article aims to identify the natural occurrence of the critical machines in scheduling. The exciting scheduling in the real time manufacturing environment is focused on considering equal weight-age of all the machines, but very few researchers were considered the real time constraint(s) like processor/ machine/ workstation availability, etc.,. This article explores the gap between the theory and practices by identifying the critical machine in scheduling and helps the researcher to find the suitable problem in their case study environment. Through the literature survey, it is evident that, in scheduling the occurrence of the critical machine is in nature. The critical machine is found in various names and gives a various range of weight-age based on the particular manufacturing environment and it plays a vital role in scheduling which includes one or more circumstances of occurrence in the production environment. Very few researchers were reported that in manufacturing environment, the critical machine occurrence is in nature, but most of the researchers were focused to optimize the manufacturing environment by only reducing the cycle time. In real-time manufacturing environment, the scheduling of critical machine(s) was keenly monitored and some weight-age was considered.

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

  8. Optimal Schedules in Multitask Motor Learning.

    Science.gov (United States)

    Lee, Jeong Yoon; Oh, Youngmin; Kim, Sung Shin; Scheidt, Robert A; Schweighofer, Nicolas

    2016-04-01

    Although scheduling multiple tasks in motor learning to maximize long-term retention of performance is of great practical importance in sports training and motor rehabilitation after brain injury, it is unclear how to do so. We propose here a novel theoretical approach that uses optimal control theory and computational models of motor adaptation to determine schedules that maximize long-term retention predictively. Using Pontryagin's maximum principle, we derived a control law that determines the trial-by-trial task choice that maximizes overall delayed retention for all tasks, as predicted by the state-space model. Simulations of a single session of adaptation with two tasks show that when task interference is high, there exists a threshold in relative task difficulty below which the alternating schedule is optimal. Only for large differences in task difficulties do optimal schedules assign more trials to the harder task. However, over the parameter range tested, alternating schedules yield long-term retention performance that is only slightly inferior to performance given by the true optimal schedules. Our results thus predict that in a large number of learning situations wherein tasks interfere, intermixing tasks with an equal number of trials is an effective strategy in enhancing long-term retention.

  9. Force dynamics in fixed-ratio schedules.

    Science.gov (United States)

    Pinkston, Jonathan W; McBee, Lindsey N

    2014-03-01

    Fixed-ratio schedules are widely used in behavioral research. Although fixed-ratio schedules often conjure up relationships to work and effort, little is known about effort-related measures in these schedules. Early research had shown that force and effort of operant behavior vary systematically during the execution of ratio schedules, and the goal of the present study was to revisit early research on force dynamics in fixed-ratio schedules. Four rats earned sucrose by pressing an isometric force transducer. Presses produced sucrose after ten or twenty responses. In general, the force of responses increased then decreased systematically across the ratio. The possibility that decreases in force during ratio execution was due to a trade-off with the differential reinforcement of short inter-response times (IRT) was investigated in an additional condition where sucrose was made available according to a tandem fixed-ratio 19 inter-response (IRT)> t schedule. The tandem IRT requirement did not eliminate decreasing trends in force across the ratio; unexpectedly, the tandem requirement did eliminate increases in force early in the ratio, which may reflect sequence-level organization operating in the control of force dynamics.

  10. Stochastic Modeling of Airlines' Scheduled Services Revenue

    Science.gov (United States)

    Hamed, M. M.

    1999-01-01

    Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers are able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

  11. Social Security and Medicare Benefits

    Data.gov (United States)

    Social Security Administration — Annual cash benefits and rehabilitation benefits paid in each year from the Old-Age and Survivors Insurance, and Disability Insurance Trust Funds, and benefits paid...

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

  13. An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

    Science.gov (United States)

    Moore, J. E.

    1975-01-01

    An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

  14. Exercise: Benefits of Exercise

    Medline Plus

    Full Text Available ... show that people with arthritis, heart disease, or diabetes benefit from regular exercise. Exercise also helps people ... or difficulty walking. To learn about exercise and diabetes, see "Exercise and Type 2 Diabetes" from Go4Life®, ...

  15. PENSION FUND BENEFITS SERVICE

    CERN Document Server

    Benefits Service

    2002-01-01

    Please note that from now on, our offices will be opened to members and beneficiaries on Tuesday, Wednesday and Thursday from 10 to 12 a.m. and from 3 to 5 p.m. We are otherwise available but by appointment only. Benefits Service 5-1-030 tel. 79194 / 72738

  16. PENSION FUND BENEFITS SERVICE

    CERN Multimedia

    Benefits Service

    2002-01-01

    Please note that from now on, our offices (5-1-030) will be opened to members and beneficiaries on Tuesday, Wednesday and Thursday from 10 to 12 a.m. and from 3 to 5 p.m. We are otherwise available but by appointment only. Benefits Service (tel. 79194 / 72738)

  17. Benefits at risk

    DEFF Research Database (Denmark)

    Lassen, Jesper; Sandøe, Peter

    2007-01-01

    Herbicide resistant GM plants have been promoted as a tool in the development of more environment-friendly agriculture. The environmental benefits here, however, depend not only on farmer's acceptance of GM crops as such, but also on their willingness to use herbicides in accordance with altered...

  18. More Benefits of Automation.

    Science.gov (United States)

    Getz, Malcolm

    1988-01-01

    Describes a study that measured the benefits of an automated catalog and automated circulation system from the library user's point of view in terms of the value of time saved. Topics discussed include patterns of use, access time, availability of information, search behaviors, and the effectiveness of the measures used. (seven references)…

  19. Public services, personal benefits

    NARCIS (Netherlands)

    Bob Kuhry; Evert Pommer; Jedid-Jah Jonker; John Stevens

    2006-01-01

    Original title: Publieke productie & persoonlijk profijt. This report looks in detail at the costs of public services (such as care, education, public administration and safety) and the benefits that citizens derive from the government expenditure involved in delivering those services. In 2003,

  20. The Benefits of Latin?

    Science.gov (United States)

    Holliday, Lisa R.

    2012-01-01

    Classicists have long claimed that the study of Latin has benefits that exceed knowledge of the language itself, and in the current economic times, these claims are made with urgency. Indeed, many contend that Latin improves English grammar and writing skills, cognitive abilities, and develops transferable skills necessary for success in the…

  1. Dynamic Fair Priority Optimization Task Scheduling Algorithm in Cloud Computing: Concepts and Implementations

    Directory of Open Access Journals (Sweden)

    Deepika Saxena

    2016-02-01

    Full Text Available Cloud computing has become buzzword today. It is a digital service where dynamically scalable and virtualized resources are provided as a service over internet. Task scheduling is premier research topic in cloud computing. It is always a challenging task to map variety of complex task on various available heterogenous resources in scalable and efficient way. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates benefit-fairness algorithm based on weighted-fair Queuing model which is much more efficient than simple priority queuing. In proposed algorithm, we have classified and grouped all tasks as deadline based and minimum cost based constraints and after dynamic optimization, priority of fairness is applied. Here different priority queue (high, mid, low are implemented in round-robin fashion as per weights assign to them .We recompile the CloudSim and simulate the proposed algorithm and results of this algorithm is compared with sequential task scheduling and simple constraints (cost and deadline based task scheduling algorithm. The experimental results indicates that proposed algorithm is, not only beneficial to user and service provider, but also provides better efficiency and fairness at priority level, i.e. benefit at system level.

  2. Economic impact of price forecasting inaccuracies on self-scheduling of generation companies

    Energy Technology Data Exchange (ETDEWEB)

    Mohammadi-Ivatloo, B.; Ehsan, M. [Center of Excellence in Power System Management and Control, Department of Electrical Engineering, Sharif University of Technology, Tehran (Iran, Islamic Republic of); Zareipour, H. [Power and Energy Systems Group, Department of Electrical and Computer Engineering, University of Calgary, Alberta (Canada); Amjady, N. [Department of Electrical Engineering, University of Semnan, Semnan (Iran, Islamic Republic of)

    2011-02-15

    This paper studies the economic impact of using inaccurate price forecasts on self-scheduling of generation companies (GenCos) in a competitive electricity market. Four alternative sets of price forecasts are used in this study which have different levels of accuracy. The economic impact of price forecast inaccuracies is calculated by comparing the economic benefits of the GenCos in two self-scheduling scenarios. In the first scenario, electricity market price forecasts are used to optimally schedule the GenCos' next day operation. In the second scenario, perfect price forecasts, i.e., actual market prices, are used for self-scheduling of the GenCos. Two indices are utilized to quantify the differences in the economic benefits of the GenCos under the two scenarios. Simulation results are provided and discussed for two typical and inherently different GenCos, i.e., a hydro-based producer and a thermal-based producer. (author)

  3. WHEAT GRASS HEALTH BENEFITS

    Directory of Open Access Journals (Sweden)

    Akula Annapurna

    2013-10-01

    Full Text Available Nutraceutical is a food or food product that provides health and medical benefits, including the preventionand treatment of disease. Nutraceuticals are the products typically claim to prevent chronic diseases, improve health,delay the aging process, and increase life expectancy.Let us know something about one such nutraceutical.Wheatgrass is a commonly found herb in India contains enzymes like protease, cytrochrome, amylase, lipase,transhydrogenase and SOD (super oxide dismutase. Besides these enzymes, it also contains all the essential aminoacids especially alanine, asparatic acid, glutamic acid, arginine and serine, which are helpful in providing good amountof protein in body which builds and repair tissues. Wheatgrass contains chlorophyll and flavonoids in good amount.It also contains vitamins like vitamin A, vitamin C, and vitamin E and minerals like iron, calcium and magnesium.Chlorophyll has been shown to build red blood cells quickly,cures anemia, normalise blood pressure by dilating theblood vessels. Chlorophyll has been shown to produce an unfavourable environment for bacterial growth in the bodyand therefore effective in increasing the body's resistance to illness. Probably the most important benefit ofwheatgrass is, it is a cancer fighting agent. Many people strongly believe that the benefits of wheatgrass on cancerare real and that consuming wheat grass can help in the treatment and even in the prevention of cancer. Wheatgrassproduces an immunization effect against many dietary carcinogens..Additional benefits of wheatgrass are bettercomplexion and a healthy glow. The slowing of graying hair is also a benefit believed to come from wheatgrass. Wecan grow wheat grass in small cups, pots and trays very conveniently in our homes, so that we will have fresh juiceand powder with minimum cost.

  4. Real Time Scheduling Services for Distributed RT-CORBA Applications

    Directory of Open Access Journals (Sweden)

    Bineta Tresa Mathew

    2012-12-01

    Full Text Available Distributed computing environment is flexible to control in complex embedded systems and their software components gain complexity when these systems are equipped with many microcontrollers and software object which covers diverse platforms, this system is called as DRE system. These DRE systems need new inter-object communication solution thus QoS-enabled middleware services and mechanisms have begun to emerge. Real-time application domain benefit from flexible and open distributed architectures, such as those defined by the CORBA specification. CORBA is well-suited to conventional request/response applications, but not suited to real-time applications due to the lack of QoS features and performance optimizations. The paper shows the design and implementation of the high performance scheduling technique for the real time applications domain with CORBA systems. Four different algorithms are compared by using attributes of real time tasks constraints based on CORBA specification such as RMS, MLF, MUF and EDF.

  5. How travellers’ schedule their trips under uncertain travel times

    DEFF Research Database (Denmark)

    Hjorth, Katrine

    Travel times play an important role when people decide where, when and how much to travel. But travel times are not always predictable from the traveller’s point of view: They may vary from day to day due to demand fluctuations, weather conditions, accidents and other unforeseen events that cause...... road capacity to decrease. We refer to this uncertainty as travel time variability (TTV). TTV is likely to affect how travellers schedule their trips, since it affects their probability of arriving late at their destination. We would like to account for TTV in traffic models and cost-benefit analyses......, but in practice there are limits to the kinds of behaviour that can be accommodated in such applications. For that reason, we are not solely interested in explaining travellers’ behaviour, but also in whether this behaviour can be approximated by behavioural models that are simple enough to be applied in traffic...

  6. Stochastic Optimal Scheduling of Residential Appliances with Renewable Energy Sources

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Hongyu; Pratt, Annabelle; Chakraborty, Sudipta

    2015-07-03

    This paper proposes a stochastic, multi-objective optimization model within a Model Predictive Control (MPC) framework, to determine the optimal operational schedules of residential appliances operating in the presence of renewable energy source (RES). The objective function minimizes the weighted sum of discomfort, energy cost, total and peak electricity consumption, and carbon footprint. A heuristic method is developed for combining different objective components. The proposed stochastic model utilizes Monte Carlo simulation (MCS) for representing uncertainties in electricity price, outdoor temperature, RES generation, water usage, and non-controllable loads. The proposed model is solved using a mixed integer linear programming (MILP) solver and numerical results show the validity of the model. Case studies show the benefit of using the proposed optimization model.

  7. 5 CFR 610.121 - Establishment of work schedules.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Establishment of work schedules. 610.121 Section 610.121 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS HOURS OF DUTY Weekly and Daily Scheduling of Work Work Schedules § 610.121 Establishment of work schedules....

  8. Store-Forward and its implications for Proportional Scheduling

    NARCIS (Netherlands)

    Walton, N.S.

    2014-01-01

    The Proportional Scheduler was recently proposed as a scheduling algorithm for multi-hop switch networks. For these networks, the BackPressure scheduler is the classical benchmark. For networks with fixed routing, the Proportional Scheduler is maximum stable, myopic and, furthermore, will alleviate

  9. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

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

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  10. 77 FR 33980 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2012-06-08

    ... NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear... the SUPPLEMENTARY INFORMATION to the Board's proposed FOIA Fee Schedule Update published in the... update the FOIA Fee Schedule once every 12 months. Previous Fee Schedule Updates were published in...

  11. University Benefits Survey. Part I (All Benefits Excluding Pensions).

    Science.gov (United States)

    University of Western Ontario, London.

    Results of a 1984 survey of benefits, excluding pensions, for 17 Ontario, Canada, universities are presented. Information is provided on the following areas: questions on general benefits, such as insurance plans, communication of benefits, proposed changes in benefits, provision of life and dismemberment insurance, and maternity leave policy;…

  12. Benefits Assessment for Tactical Runway Configuration Management Tool

    Science.gov (United States)

    Oseguera-Lohr, Rosa; Phojanamongkolkij, Nipa; Lohr, Gary; Fenbert, James W.

    2013-01-01

    The Tactical Runway Configuration Management (TRCM) software tool was developed to provide air traffic flow managers and supervisors with recommendations for airport configuration changes and runway usage. The objective for this study is to conduct a benefits assessment at Memphis (MEM), Dallas Fort-Worth (DFW) and New York's John F. Kennedy (JFK) airports using the TRCM tool. Results from simulations using the TRCM-generated runway configuration schedule are compared with results using historical schedules. For the 12 days of data used in this analysis, the transit time (arrival fix to spot on airport movement area for arrivals, or spot to departure fix for departures) for MEM departures is greater (7%) than for arrivals (3%); for JFK, there is a benefit for arrivals (9%) but not for departures (-2%); for DFW, arrivals show a slight benefit (1%), but this is offset by departures (-2%). Departure queue length benefits show fewer aircraft in queue for JFK (29%) and MEM (11%), but not for DFW (-13%). Fuel savings for surface operations at MEM are seen for both arrivals and departures. At JFK there are fuel savings for arrivals, but these are offset by increased fuel use for departures. In this study, no surface fuel benefits resulted for DFW. Results suggest that the TRCM algorithm requires modifications for complex surface traffic operations that can cause taxi delays. For all three airports, the average number of changes in flow direction (runway configuration) recommended by TRCM was many times greater than the historical data; TRCM would need to be adapted to a particular airport's needs, to limit the number of changes to acceptable levels. The results from this analysis indicate the TRCM tool can provide benefits at some high-capacity airports. The magnitude of these benefits depends on many airport-specific factors and would require adaptation of the TRCM tool; a detailed assessment is needed prior to determining suitability for a particular airport.

  13. THE BENEFITS OF NEUROECONOMICS

    Directory of Open Access Journals (Sweden)

    Michał Krawczyk

    2011-06-01

    Full Text Available This paper serves as a brief introduction into the methods, results and problems of the new interdisciplinary field of neuroecomics (and its relatives. The focus is on the practical benefits that may result from it for the economic profession. These primarily involve the possibility of setting new promising research directions and providing novel tools raising hopes of enabling direct observation of human preference. The author also discusses methodological and ethical challenges that neuroeconomics is or will soon be facing

  14. WHEAT GRASS HEALTH BENEFITS

    OpenAIRE

    Akula Annapurna

    2013-01-01

    Nutraceutical is a food or food product that provides health and medical benefits, including the preventionand treatment of disease. Nutraceuticals are the products typically claim to prevent chronic diseases, improve health,delay the aging process, and increase life expectancy.Let us know something about one such nutraceutical.Wheatgrass is a commonly found herb in India contains enzymes like protease, cytrochrome, amylase, lipase,transhydrogenase and SOD (super oxide dismutase). Besides the...

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

  16. A scheduling framework applied to digital publishing workflows

    Science.gov (United States)

    Lozano, Wilson; Rivera, Wilson

    2006-02-01

    This paper presents the advances in developing a dynamic scheduling technique suitable for automating digital publishing workflows. Traditionally scheduling in digital publishing has been limited to timing criteria. The proposed scheduling strategy takes into account contingency and priority fluctuations. The new scheduling algorithm, referred to as QB-MUF, gives high priority to jobs with low probability of failing according to artifact recognition and workflow modeling critera. The experimental results show the suitability and efficiency of the scheduling strategy.

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

  18. Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-01-01

    This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.

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

    NARCIS (Netherlands)

    Oostrum, van J.M.; Houdenhoven, van M.; Hurink, J.L.; Hans, E.W.; Wullink, G.; 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 t

  20. 78 FR 26701 - Schedules of Controlled Substances: Placement of Lorcaserin Into Schedule IV

    Science.gov (United States)

    2013-05-08

    ... may lead to limited physical or psychological dependence relative to drugs in Schedule III. On the... psychological dependence relative to the drugs or other substances in Schedule III. This finding is based on the... significant additional manpower, capital investment, or recordkeeping burdens. The only additional...

  1. Buying Commercial: Gaining the Cost/Schedule Benefits for Defense Systems

    Science.gov (United States)

    2009-02-01

    Center for Strategic and International Studies Gen Michael Carns (ret.) Private Consultant Dr. Steve Cross Georgia Technology Research Institute Dr...ER ENC E I 25 Terms of Reference B IO G R A PH IC A L SK ET C H E S F O R T AS K F O R C E ME...School of Public Affairs at the University of Texas. 30 I B IO G R A PH IC AL S KET C H E S F O R T A SK F O R C E M EM BER S General

  2. Effects of mammography screening under different screening schedules: Model estimates of potential benefits and harms

    NARCIS (Netherlands)

    J.S. Mandelblatt (Jeanne); K.A. Cronin (Kathleen); S. Bailey (Stephanie); D.A. Berry (Donald); H.J. de Koning (Harry); G. Draisma (Gerrit); H. Huang (Hailiang); S.J. Lee (Stephanie Joi); M.F. Munsell (Mark); S.K. Plevritis (Sylvia); P.M. Ravdin (P.); C.B. Schechter (Clyde); B. Sigal (Bronislava); M.A. Stoto (Michael); N.K. Stout (Natasha); N.T. van Ravesteyn (Nicolien); J. Venier (John); M. Zelen (Marvin); E. Feuer (Eric)

    2009-01-01

    textabstractBackground: Despite trials of mammography and widespread use, optimal screening policy is controversial. Objective: To evaluate U.S. breast cancer screening strategies. Design: 6 models using common data elements. Data Sources: National data on age-specific incidence, competing mortality

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

  4. 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-d...... questions whether schedules of non-economic damages, as well as other limitations on compensations to medical malpractice victims, are an effective way to improve the payoff of health care providers.......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...

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

  6. SDRAM bus schedule of HDTV video decoder

    Science.gov (United States)

    Wang, Hui; He, Yan L.; Yu, Lu

    2001-12-01

    In this paper, a time division multiplexed task scheduling (TDM) is designed for HDTV video decoder is proposed. There are three tasks: to fetch decoded data from SDRAM for displaying (DIS), read the reference data from SDRAM for motion compensating (REF) and write the motion compensated data back to SDRAM (WB) on the bus. The proposed schedule is based on the novel 4 banks interlaced SDRAM storage structure which results in less overhead on read/write time. Two SDRAM of 64M bits (4Bank×512K×32bit) are used. Compared with two banks, the four banks storage strategy read/write data with 45% less time. Therefore the process data rates for those three tasks are reduced. TDM is developed by round robin scheduling and fixed slot allocating. There are both MB slot and task slot. As a result the conflicts on bus are avoided, and the buffer size is reduced 48% compared with the priority bus scheduling. Moreover, there is a compacted bus schedule for the worst case of stuffing owning to the reduced executing time on tasks. The size of buffer is reduced and the control logic is simplified.

  7. Communication contention in APN list scheduling algorithm

    Institute of Scientific and Technical Information of China (English)

    TANG XiaoYong; LI KenLi; PADUA Divid

    2009-01-01

    Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. This paper investigates the Incorporation of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network. In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application.

  8. Hybrid Scheduling Model for Independent Grid Tasks

    Directory of Open Access Journals (Sweden)

    J. Shanthini

    2015-01-01

    Full Text Available Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of makespan, which measures the machine utilization. In this paper, we propose a hybrid scheduling algorithm for scheduling independent grid tasks with the objective of reducing total weighted tardiness of grid tasks. Tardiness is to measure the due date performance, which has a direct impact on cost for executing the jobs. In this paper we propose BG_ATC algorithm which is a combination of best gap (BG search and Apparent Tardiness Cost (ATC indexing algorithm. Furthermore, we implemented these two algorithms in two different phases of the scheduling process. In addition to that, the comparison was made on results with various benchmark algorithms and the experimental results show that our algorithm outperforms the benchmark algorithms.

  9. Scheduling Future Water Supply Investments Under Uncertainty

    Science.gov (United States)

    Huskova, I.; Matrosov, E. S.; Harou, J. J.; Kasprzyk, J. R.; Reed, P. M.

    2014-12-01

    Uncertain hydrological impacts of climate change, population growth and institutional changes pose a major challenge to planning of water supply systems. Planners seek optimal portfolios of supply and demand management schemes but also when to activate assets whilst considering many system goals and plausible futures. Incorporation of scheduling into the planning under uncertainty problem strongly increases its complexity. We investigate some approaches to scheduling with many-objective heuristic search. We apply a multi-scenario many-objective scheduling approach to the Thames River basin water supply system planning problem in the UK. Decisions include which new supply and demand schemes to implement, at what capacity and when. The impact of different system uncertainties on scheme implementation schedules are explored, i.e. how the choice of future scenarios affects the search process and its outcomes. The activation of schemes is influenced by the occurrence of extreme hydrological events in the ensemble of plausible scenarios and other factors. The approach and results are compared with a previous study where only the portfolio problem is addressed (without scheduling).

  10. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

    Full Text Available Purpose: In order to better serve the transport demand of urban area by rail, target at the Ur-ban Rail Train Stop Schedule problem.Design/methodology/approach: Bi-level mathematical programming model and game relation was used.Findings: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed when game relation between train Stop Schedule and passenger transfer choice is considered.Research limitations/implications: The research is still in progress. Practical implications: ChongQing urban rail line 2 was taken as an example, the practical application of the model has proved its feasibility and efficiency.Originality/value: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed. The upper level model is Stop Schedule targeting at the optimal profit from the operators side. The lower level model is passenger routing aims to minimize total travel time. According to its features, the bi-level model is integrated in order to be directly solvable by optimizing software.

  11. Trade Surplus Drops,more Rebate Cutting?

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Almost everyone was surprised when the China Customs released the latest export and import statistics on April, 10th:6.87 billion US dollars,China’s favorable balance of trade in March.But only one month earlier,the trade surplus

  12. Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks

    KAUST Repository

    Douik, Ahmed

    2016-03-28

    © 2015 IEEE. In the context of resource allocation in cloud- radio access networks, recent studies assume either signal-level or scheduling-level coordination. This paper, instead, considers a hybrid level of coordination for the scheduling problem in the downlink of a multi-cloud radio- access network, so as to benefit from both scheduling policies. Consider a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and therefore allows joint signal processing between them. Across the multiple clouds, however, only scheduling-level coordination is permitted, as it requires a lower level of backhaul communication. The frame structure of every BS is composed of various time/frequency blocks, called power- zones (PZs), and kept at fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled, at most, to a single cloud, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs\\' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The scheduling problem is, then, shown to be equivalent to a maximum- weight independent set problem in the constructed graph, in which each vertex symbolizes an association of cloud, user, BS and PZ, with a weight representing the utility of that association. Simulation results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

  13. 77 FR 74699 - Self-Regulatory Organizations; NASDAQ OMX PHLX LLC; Notice of Filing and Immediate Effectiveness...

    Science.gov (United States)

    2012-12-17

    ... of Proposed Rule Change Relating to Rebates and Fees for Adding and Removing Liquidity December 11... Pricing Schedule entitled ``Rebates and Fees for Adding and Removing Liquidity in Select Symbols'' in...) Increase the Customer Complex Order Rebate for Adding Liquidity from $0.30 to $0.32 per contract,...

  14. Dispatch Scheduling to Maximize Exoplanet Detection

    Science.gov (United States)

    Johnson, Samson; McCrady, Nate; MINERVA

    2016-01-01

    MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.

  15. Scheduling jobs that arrive over time

    Energy Technology Data Exchange (ETDEWEB)

    Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Stein, C. [Dartmouth Coll., Hanover, NH (United States); Wein, J. [Polytechnic Univ., Brooklyn, NY (United States). Dept. of Computer Science

    1995-04-06

    A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time. We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.

  16. Optimal Scheduling of Domestic Appliances via MILP

    Directory of Open Access Journals (Sweden)

    Zdenek Bradac

    2014-12-01

    Full Text Available This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP formulation of the problem is presented. This model is verified by several problem instances. Realistic scenarios based on the real price tariffs commercially available in the Czech Republic are calculated. The results obtained by solving the optimization problem are compared with a simulation of the ripple control service currently used by many domestic consumers in the Czech Republic.

  17. An introduction to optimal satellite range scheduling

    CERN Document Server

    Vázquez Álvarez, Antonio José

    2015-01-01

    The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, ...

  18. Deterministic Real-time Thread Scheduling

    CERN Document Server

    Yun, Heechul; Sha, Lui

    2011-01-01

    Race condition is a timing sensitive problem. A significant source of timing variation comes from nondeterministic hardware interactions such as cache misses. While data race detectors and model checkers can check races, the enormous state space of complex software makes it difficult to identify all of the races and those residual implementation errors still remain a big challenge. In this paper, we propose deterministic real-time scheduling methods to address scheduling nondeterminism in uniprocessor systems. The main idea is to use timing insensitive deterministic events, e.g, an instruction counter, in conjunction with a real-time clock to schedule threads. By introducing the concept of Worst Case Executable Instructions (WCEI), we guarantee both determinism and real-time performance.

  19. Scheduling support for transactional memory contention management

    DEFF Research Database (Denmark)

    Maldonado, Walther; Marler, Patrick; Felber, Pascal

    2010-01-01

    Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on >multiple cores when the data access pattern behaves "well," i.e., when few conflicts are induced. In contrast, data patterns with frequent write......-management has been proposed for increasing TM efficiency under high-contention [2, 5, 19]. However, only user-level schedulers have been considered. In this work, we propose, implement and evaluate several novel kernel-level scheduling support mechanisms for TM contention management. We also investigate...... kernels. Our experimental evaluation demonstrates that lightweight kernel-level scheduling support significantly reduces the number of aborts while improving transaction throughput on various workloads....

  20. Load scheduling for decentralized CHP plants

    DEFF Research Database (Denmark)

    Nielsen, Henrik Aalborg, orlov 31.07.2008; Madsen, Henrik; Nielsen, Torben Skov

    This report considers load scheduling for decentralized combined heat and power plants where the revenue from selling power to the transmission company and the fuel cost may be time-varying. These plants produce both heat and power with a fixed ratio between these outputs. A heat storage facility...... be uncertain and dependent on time. It is suggested to use a combination of background knowledge of the operator and computer tools to solve the scheduling problem. More specificly it is suggested that the plant is equipped with (i) an automatic on-line system for forecasting the heat demand, (ii......) an interactive decision support tool by which optimal schedules can be found given the forecasts or user-defined modifications of the forecasts, and (iii) an automatic on-line system for monitoring when conditions have changed so that rescheduling is appropriate. In this report the focus is on methods applicable...

  1. A CLASS OF GENERALIZED MULTIPROCESSOR SCHEDULING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    YANG Xiaoguang

    2000-01-01

    The paper discusses a class of generalized multiprocessor scheduling problems which is to arrange some independent jobs on almost identical processors. Different from the classical multiprocessor scheduling, each job may only be processed by some processors,not all. In this paper, we first prove that the problems of minimization makespan and minimization total weighted completion time can be solved by the polynomial algorithms if all processing time are unit time. Then for arbitrary processing time, we try to analyze the worst performance of list schedule (LS) method and longest processing time(LPT) method when there are only two machines involved. We show that the bounds for LS and LPT are exactly two.

  2. Effects of 4X4 Block Scheduling

    Directory of Open Access Journals (Sweden)

    R. Brian Cobb

    1999-02-01

    Full Text Available The effects of a 4 X 4 block scheduling program in a middle school on a variety of student measures were investigated. These measures included standardized achievement tests in mathematics, reading, and writing, cumulative and semester grades in middle school and high school, attendance rates, and enrollment rates in advanced high school courses (in mathematics only. The block scheduling program had been in effect for four years allowing analyses of current middle and high school students who had experienced a minimum of one and one-half years of block scheduling while in middle school. The primary research design was a post-test only, matched pairs design. Students were matched on school characteristics, gender, ethnicity, grade level, and 5th grade standardized reading scores. Results were relatively consistent with the extant literature and generally positive.

  3. Methods and benefits of experimental seismic evaluation of nuclear power plants. Final report

    Energy Technology Data Exchange (ETDEWEB)

    1979-07-01

    This study reviews experimental techniques, instrumentation requirements, safety considerations, and benefits of performing vibration tests on nuclear power plant containments and internal components. The emphasis is on testing to improve seismic structural models. Techniques for identification of resonant frequencies, damping, and mode shapes, are discussed. The benefits of testing with regard to increased damping and more accurate computer models are oulined. A test plan, schedule and budget are presented for a typical PWR nuclear power plant.

  4. Research on schedulers for astronomical observatories

    Science.gov (United States)

    Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian

    2012-09-01

    The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.

  5. Developing benefits management

    DEFF Research Database (Denmark)

    Laursen, Markus

    if they do realize the value of their IT investments (Bradley, 2010; Hunter & Westerman, 2009; Legris & Collerette, 2006), although the relationship between IT and business performance has been known for many years (Melville et al., 2004; Kohli & Grover, 2008). A starting point for any organization is thus......An old quote goes “Rome wasn’t built in a day” which is similar to the practices comprehended by benefits management (BM) in today’s organizations; they mature as organizations improve practices (Ward & Daniel, 2012). The implication is that many organizations are still not realizing or are unsure...

  6. Linear Time Algorithms for Parallel Machine Scheduling

    Institute of Scientific and Technical Information of China (English)

    Zhi Yi TAN; Yong HE

    2007-01-01

    This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems.The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio.Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.

  7. Scheduling of Development Projects with Uncertain Iterations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper studies the scheduling of design projects in concurrent development process with uncertain num ber of feedback revisions. An optimization based methodology that combines heuristic algorithm, artificial intelligence (fuzzy, genetic algorithm) and scheduling theory is developed. In the algorithm, weighting values of some key factors are defined by genetic algorithm. In addition, fuzzy logic is used to decide the ability coefficients of different roles taken by designers. Moreover, the process of pre-release and feedback revision is realized. Simulation example is a fraction of practical development project, and satisfied results are obtained.

  8. Workshop Scheduling in the MRO Context

    Science.gov (United States)

    Rupp, Benjamin; Pauli, Dirk; Feller, Sebastian; Skyttä, Manu

    2010-09-01

    Scheduling is an important task in production planning, as it can significantly increase the productivity of a workshop. In this paper we concentrate on a job-shop problem which arises at workshops of typical MRO service providers. An MRO does not only need to minimize the production time (the makespan) and maximize the plant utilization, it also needs to maximize the service and protection level of its stock. Hence, it has several objective functions which usually contradict each other. In this paper we present the novel CTO algorithm which helps to find a schedule regarding the mentioned objective functions.

  9. Scheduling projects with multiskill learning effect.

    Science.gov (United States)

    Zha, Hong; Zhang, Lianying

    2014-01-01

    We investigate the project scheduling problem with multiskill learning effect. A new model is proposed to deal with the problem, where both autonomous and induced learning are considered. In order to obtain the optimal solution, a genetic algorithm with specific encoding and decoding schemes is introduced. A numerical example is used to illustrate the proposed model. The computational results show that the learning effect cannot be neglected in project scheduling. By means of determining the level of induced learning, the project manager can balance the project makespan with total cost.

  10. Long-term home care scheduling

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

    In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans spanning several days such that a high quality of service is maintained and the overall cost is kept as low as possible. A solution to the problem...... provides detailed information on visits and visit times for each employee on each of the covered days. We propose a branch-and-price algorithm for the long-term home care scheduling problem. The pricing problem generates one-day plans for an employee, and the master problem merges the plans with respect...

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

  12. Real-time systems scheduling 2 focuses

    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 it is responsible for software execution in a timely manner. This book, the second of two volumes on the subject, brings together knowledge on specific topics and discusses the recent advances for some of them.  It addresses foundations as well as the latest advances and findings in real-time scheduling, giving comprehensive references to important papers, but the chapters are short and not overloaded with co

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

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

  15. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru;

    2008-01-01

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

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

  17. Social Security's special minimum benefit.

    Science.gov (United States)

    Olsen, K A; Hoffmeyer, D

    Social Security's special minimum primary insurance amount (PIA) provision was enacted in 1972 to increase the adequacy of benefits for regular long-term, low-earning covered workers and their dependents or survivors. At the time, Social Security also had a regular minimum benefit provision for persons with low lifetime average earnings and their families. Concerns were rising that the low lifetime average earnings of many regular minimum beneficiaries resulted from sporadic attachment to the covered workforce rather than from low wages. The special minimum benefit was seen as a way to reward regular, low-earning workers without providing the windfalls that would have resulted from raising the regular minimum benefit to a much higher level. The regular minimum benefit was subsequently eliminated for workers reaching age 62, becoming disabled, or dying after 1981. Under current law, the special minimum benefit will phase out over time, although it is not clear from the legislative history that this was Congress's explicit intent. The phaseout results from two factors: (1) special minimum benefits are paid only if they are higher than benefits payable under the regular PIA formula, and (2) the value of the regular PIA formula, which is indexed to wages before benefit eligibility, has increased faster than that of the special minimum PIA, which is indexed to inflation. Under the Social Security Trustees' 2000 intermediate assumptions, the special minimum benefit will cease to be payable to retired workers attaining eligibility in 2013 and later. Their benefits will always be larger under the regular benefit formula. As policymakers consider Social Security solvency initiatives--particularly proposals that would reduce benefits or introduce investment risk--interest may increase in restoring some type of special minimum benefit as a targeted protection for long-term low earners. Two of the three reform proposals offered by the President's Commission to Strengthen

  18. Intermittent Metronomic Drug Schedule Is Essential for Activating Antitumor Innate Immunity and Tumor Xenograft Regression

    Directory of Open Access Journals (Sweden)

    Chong-Sheng Chen

    2014-01-01

    Full Text Available Metronomic chemotherapy using cyclophosphamide (CPA is widely associated with antiangiogenesis; however, recent studies implicate other immune-based mechanisms, including antitumor innate immunity, which can induce major tumor regression in implanted brain tumor models. This study demonstrates the critical importance of drug schedule: CPA induced a potent antitumor innate immune response and tumor regression when administered intermittently on a 6-day repeating metronomic schedule but not with the same total exposure to activated CPA administered on an every 3-day schedule or using a daily oral regimen that serves as the basis for many clinical trials of metronomic chemotherapy. Notably, the more frequent metronomic CPA schedules abrogated the antitumor innate immune and therapeutic responses. Further, the innate immune response and antitumor activity both displayed an unusually steep dose-response curve and were not accompanied by antiangiogenesis. The strong recruitment of innate immune cells by the 6-day repeating CPA schedule was not sustained, and tumor regression was abolished, by a moderate (25% reduction in CPA dose. Moreover, an ~20% increase in CPA dose eliminated the partial tumor regression and weak innate immune cell recruitment seen in a subset of the every 6-day treated tumors. Thus, metronomic drug treatment must be at a sufficiently high dose but also sufficiently well spaced in time to induce strong sustained antitumor immune cell recruitment. Many current clinical metronomic chemotherapeutic protocols employ oral daily low-dose schedules that do not meet these requirements, suggesting that they may benefit from optimization designed to maximize antitumor immune responses.

  19. Analyzing Job Aware Scheduling Algorithm in Hadoop for Heterogeneous Cluster

    Directory of Open Access Journals (Sweden)

    Mayuri A Mehta

    2015-12-01

    Full Text Available A scheduling algorithm is required to efficiently manage cluster resources in a Hadoop cluster, thereby to increase resource utilization and to reduce response time. The job aware scheduling algorithm schedules non-local map tasks of jobs based on job execution time, earliest deadline first or workload of the job. In this paper, we present the performance evaluation of the job aware scheduling algorithm using MapReduce WordCount benchmark. The experimental results are compared with matchmaking scheduling algorithm. The results show that the job aware scheduling algorithm reduces average waiting time and memory wastage considerably as compared to matchmaking algorithm.

  20. Study/Services Installation/Implementation Schedule Analysis

    Science.gov (United States)

    1989-11-16

    Scheduled Morbach AB, GE 078 8 08-19-91 08-28-91 Scheduled RheinMain (MAC) 170 8 09-03-91 09-12-91 Scheduled Templehof (MAC) 171 8 09-17-91 09-26-91...94 Scheduled Sembach AB, GE 378 3 01-20-94 01-24-94 Scheduled RheinMain (MAC) 388 3 01-27-94 01-31-94 Scheduled Templehof (MAC) 389 3 02-03-94 02-07

  1. University Benefits Survey. Part 1 (All Benefits Excluding Pensions).

    Science.gov (United States)

    University of Western Ontario, London.

    Results of a 1983 survey of benefits, excluding pensions, for 17 Ontario, Canada, universities are presented. Information is provided on the following areas: whether the university self-administers insurance plans, communication of benefits, proposed changes in benefits, provision of life and dismemberment insurance, maternity leave policy,…

  2. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria-Eugenia; Hillegersberg, van Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This partn

  3. Scheduling constrained tools using heuristic techniques

    Science.gov (United States)

    Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani

    2015-12-01

    One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.

  4. Crane Scheduling on a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper

    2002-01-01

    OSS produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. Two gantry cranes carry out this task. The planning task is now to create a schedule of movements for the 2 cranes...

  5. 44 CFR 72.3 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Fee schedule. 72.3 Section 72.3 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND... initial fee, if necessary, will be published as a notice in the Federal Register. (b) For requests...

  6. 29 CFR 1952.371 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... inspectors and voluntary compliance personnel will be developed within 6 months of plan approval. (j) The... both safety and health personnel will be reviewed and revised to accurately reflect job functions..., 1977. (m) An inspection scheduling system will be developed for the health program within 6 months...

  7. Reinventing Crew Scheduling at Netherlands Railways

    NARCIS (Netherlands)

    M. Fischetti (Matteo); L.G. Kroon (Leo); G. Timmer (Gerrit); M.J.C.M. Vromans (Michiel); E.J.W. Abbink (Erwin)

    2004-01-01

    textabstractIn this paper we describe the successful application of a sophisticated Operations Research model and the corresponding solution techniques for scheduling the 6,500+ drivers and conductors of the Dutch railway operator NS Reizigers (Netherlands Railways). In 2001 the drivers and conducto

  8. Scheduling parallel jobs with linear speedup

    NARCIS (Netherlands)

    Grigoriev, A.; Uetz, M.J.; Erlebach, T.; Persiano, P.

    2006-01-01

    We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of $k$ units of that resource can be allocated to the jobs at any time, and the more

  9. Decision support system for vehicle scheduling

    Directory of Open Access Journals (Sweden)

    C. Gaindric

    1999-08-01

    Full Text Available A decision support system (DSS is described to form schedules of traffic from a central warehouse to a set of consumers by cyclic routes. The system may be used by dispatchers at transportation enterprises. The system structure, short description of modules, and algorithms solving the originating problems are presented.

  10. 40 CFR 52.1335 - Compliance schedules.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 4 2010-07-01 2010-07-01 false Compliance schedules. 52.1335 Section 52.1335 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED... Effective date Final compliance date Pilot Knob Pelleting Co Pilot Knob, MO V(10 CSR 10-3.050) Oct. 19,...

  11. Advance Resource Provisioning in Bulk Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet

    2012-10-01

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

  12. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

    Kleunen, van Wouter; Meratnia, Nirvana; Havinga, Paul J.M.

    2013-01-01

    The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this p

  13. Scheduling in Engineering, Project, and Production Management

    OpenAIRE

    Chien-Ho Ko

    2015-01-01

    This issue presents five papers selected from the 2013 (4th) International Conference on Engineering, Project, and Production Management (EPPM2013) held in Bangkok, Thailand. Three of the papers deal with scheduling problems faced in project and production management, while the remaining two focus on engineering management issues.

  14. Cross layer scheduling algorithm for LTE Downlink

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Yan, Ying; Dittmann, Lars

    2012-01-01

    . This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions regarding the channel conditions and the size of transmission buffers and different QoS demands. The simulation results show that the new algorithm improves the resource...

  15. 29 CFR 4901.32 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... this section. (b) Charges for duplication of records. Charges applicable under this subpart for... of duplication. (c) Other charges. The scheduled fees, set forth in paragraphs (a) and (b) of this section, for furnishing records made available for inspection and duplication represent the direct...

  16. 76 FR 10233 - Schedule of Water Charges

    Science.gov (United States)

    2011-02-24

    ... COMMISSION 18 CFR Part 420 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Final...--Water Supply Charges. Accordingly, the Commission's water charging rates for consumptive use and non.... FOR FURTHER INFORMATION CONTACT: For questions about the water charging program, please contact...

  17. Scheduling sport tournaments using constraint logic programming

    NARCIS (Netherlands)

    Schaerf, A.

    1997-01-01

    We tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally define the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The first step is the creation of a tournament pattern and is based on known

  18. 78 FR 37246 - January 2013 Pay Schedules

    Science.gov (United States)

    2013-06-20

    ...: Tameka Gillis, Pay and Leave, Employee Services, U.S. Office of Personnel Management; (202) 606-2858; FAX... or ST employees covered by a certified SL/ST performance appraisal system and $165,300 (level III of the Executive Schedule) for SL or ST employees covered by an SL/ST performance appraisal system...

  19. Crane Scheduling for a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper; Clausen, Jens

    2002-01-01

    Odense Steel Shipyard produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. This paper considers the problem of scheduling two cranes that carry out the movements of plates...

  20. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

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

    2001-01-01

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

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

  2. From schedule push to reality pull

    NARCIS (Netherlands)

    Reep, Frans van der

    2009-01-01

    The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to s

  3. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P. [Oak Ridge National Lab., TN (United States)

    1998-03-01

    The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has four irradiation experiments in reactor, and five experiments in the design or construction stages. Postirradiation examination and testing is in progress on ten experiments.

  4. LTE uplink scheduling - Flow level analysis

    NARCIS (Netherlands)

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

    2011-01-01

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

  5. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

    OpenAIRE

    Gennady A. Berketov

    2015-01-01

    The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed ...

  6. Scheduling in Engineering, Project, and Production Management

    Directory of Open Access Journals (Sweden)

    Chien-Ho Ko

    2015-01-01

    Full Text Available This issue presents five papers selected from the 2013 (4th International Conference on Engineering, Project, and Production Management (EPPM2013 held in Bangkok, Thailand. Three of the papers deal with scheduling problems faced in project and production management, while the remaining two focus on engineering management issues.

  7. Effects of industrialization on working schedules.

    Science.gov (United States)

    Kogi, K

    1976-12-01

    Recent increase in industrialization has resulted in attention being drawn to diversity of working schedules and their interrelation with content of work. The results of joint research revealed that adaptation to industrial jobs is made difficult because of urban conditions and modern work-control systems, such as workers in flexible-working-time systems who apparently favored regular daily working cycles. Long overtime work in smaller undertakings and the spread of shift systems are two important features of industrial work schedules, each being dominant among skilled and non-skilled jobs. Another important facet is the problem of intra-shift work-rest schedules significant for machine operations and vigilance tasks. It is suggested that phases of work that become intolerable are correlated with unnatural work rhythms. More emphasis should thus be laid on both phase-shifted work and non-self-governing work, the key factor being the relevance of attained data to real work in the whole course of schedules of work and rest.

  8. 5 CFR 293.404 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Performance File System Records § 293.404 Retention schedule. (a)(1) Except as provided... in this system, including transfer with the employee who changes positions, shall be as agencies... performance-related documents five years old or less shall be forwarded in the Employee Performance File...

  9. Execution Time Estimation for Workflow Scheduling

    NARCIS (Netherlands)

    Chirkin, A.M.; Belloum, A..S.Z.; Kovalchuk, S.V.; Makkes, M.X.

    2014-01-01

    Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the randomness of the workflow components and th

  10. 76 FR 46856 - Mail Classification Schedule Change

    Science.gov (United States)

    2011-08-03

    ... Mail Classification Schedule Change AGENCY: Postal Regulatory Commission. ACTION: Notice. SUMMARY: The Commission is noticing a recently-filed Postal Service request regarding classification changes to Priority... classification changes pursuant to 39 CFR 3020.90 and 3020.91 concerning Priority Mail packaging.\\1\\ \\1\\...

  11. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P. [Oak Ridge National Lab., TN (United States)

    1998-09-01

    The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has one irradiation experiment in reactor and five experiments in the design or construction stages. Postirradiation examination and testing is in progress on ten experiments.

  12. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

    Rowcliffe, A.F.; Grossbeck, M.L. [Oak Ridge National Lab., TN (United States)

    1997-04-01

    To provide an updated summary of the status of irradiation experiments for the neutron-interactive materials program. The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has two irradiation experiments in reactor; and 8 experiments in the planning or design stages. Postirradiation examination and testing is in progress on 18 experiments.

  13. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  14. Minimizing metastatic risk in radiotherapy fractionation schedules

    Science.gov (United States)

    Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin

    2015-11-01

    Metastasis is the process by which cells from a primary tumor disperse and form new tumors at distant anatomical locations. The treatment and prevention of metastatic cancer remains an extremely challenging problem. This work introduces a novel biologically motivated objective function to the radiation optimization community that takes into account metastatic risk instead of the status of the primary tumor. In this work, we consider the problem of developing fractionated irradiation schedules that minimize production of metastatic cancer cells while keeping normal tissue damage below an acceptable level. A dynamic programming framework is utilized to determine the optimal fractionation scheme. We evaluated our approach on a breast cancer case using the heart and the lung as organs-at-risk (OAR). For small tumor α /β values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger α /β values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the α /β values of the OARs, and the normal tissue sparing factors. Interestingly, in contrast to standard models, hypo-fractionated and semi-hypo-fractionated schedules (large initial doses with doses tapering off with time) were suggested even with large tumor α/β values. Numerical results indicate the potential for significant reduction in metastatic risk.

  15. Physician Fee Schedule National Payment Amount File

    Data.gov (United States)

    U.S. Department of Health & Human Services — The significant size of the Physician Fee Schedule Payment Amount File-National requires that database programs (e.g., Access, dBase, FoxPro, etc.) be used to read...

  16. 42 CFR 447.76 - Public schedule.

    Science.gov (United States)

    2010-10-01

    ...) Current premiums, enrollment fees, or similar fees. (2) Current cost sharing charges. (3) The aggregate limit on premiums and cost sharing or just cost sharing. (4) Mechanisms for making payments for required... Cost Sharing Under Section 1916a § 447.76 Public schedule. (a) The State must make available to...

  17. Parental Work Schedules and Adolescent Risky Behaviors

    Science.gov (United States)

    Han, Wen-Jui; Miller, Daniel P.; Waldfogel, Jane

    2010-01-01

    Using a large contemporary data set (the National Longitudinal Survey of Youth-Child Supplement), the authors examined the effects of parental work schedules on adolescent risky behaviors at age 13 or 14 and the mechanisms that might explain them. Structural equation modeling suggests mothers who worked more often at night spent significantly less…

  18. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

    The Large Synoptic Survey Telescope (LSST) will be a highly robotic facility, demanding a very high efficiency during its operation. To achieve this, the LSST Scheduler has been envisioned as an autonomous software component of the Observatory Control System (OCS), that selects the sequence of targets in real time. The Scheduler will drive the survey using optimization of a dynamic cost function of more than 200 parameters. Multiple science programs produce thousands of candidate targets for each observation, and multiple telemetry measurements are received to evaluate the external and the internal conditions of the observatory. The design of the LSST Scheduler started early in the project supported by Model Based Systems Engineering, detailed prototyping and scientific validation of the survey capabilities required. In order to build such a critical component, an agile development path in incremental releases is presented, integrated to the development plan of the Operations Simulator (OpSim) to allow constant testing, integration and validation in a simulated OCS environment. The final product is a Scheduler that is also capable of running 2000 times faster than real time in simulation mode for survey studies and scientific validation during commissioning and operations.

  19. Detailed Performance and Waiting-Time Predictability Analysis of Scheduling Options in On-Demand Video Streaming

    Directory of Open Access Journals (Sweden)

    Alsmirat MohammadA

    2010-01-01

    Full Text Available The number of on-demand video streams that can be supported concurrently is highly constrained by the stringent requirements of real-time playback and high transfer rates. To address this problem, stream merging techniques utilize the multicast facility to increase resource sharing. The achieved resource sharing depends greatly on how the waiting requests are scheduled for service. We investigate the effectiveness of the recently proposed cost-based scheduling in detail and analyze opportunities for further tunings and enhancements. In particular, we analyze alternative ways to compute the delivery cost. In addition, we propose a new scheduling policy, called Predictive Cost-Based Scheduling (PCS, which applies a prediction algorithm to predict future scheduling decisions and then uses the prediction results to potentially alter its current scheduling decisions. Moreover, we propose an enhancement technique, called Adaptive Regular Stream Triggering (ART, which significantly enhances stream merging behavior by selectively delaying the initiation of full-length video streams. We analyze the effectiveness of the proposed strategies in terms of their performance effectiveness and impacts on waiting-time predictability through extensive simulation. The results show that significant performance benefits as well as better waiting-time predictability can be attained.

  20. Artificial intelligence for the CTA Observatory scheduler

    Science.gov (United States)

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

    2014-08-01

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

  1. NASA Benefits Earth

    Science.gov (United States)

    Robinson, Julie A.

    2009-01-01

    This slide presentation reviews several ways in which NASA research has benefited Earth and made life on Earth better. These innovations include: solar panels, recycled pavement, thermometer pill, invisible braces for straightening teeth, LASIK, aerodynamic helmets and tires for bicycles, cataract detection, technology that was used to remove Anthrax spores from mail handling facilities, study of atomic oxygen erosion of materials has informed the restoration of artwork, macroencapsulation (a potential mechanism to deliver anti cancer drugs to specific sites), and research on a salmonella vaccine. With research on the International Space Station just beginning, there will be opportunities for entrepreneurs and other government agencies to access space for their research and development. As well as NASA continuing its own research on human health and technology development.

  2. Making benefit transfers work

    DEFF Research Database (Denmark)

    Bateman, I.J.; Brouwer, R.; Ferrini, S.

    We develop and test guidance principles for benefits transfers. These argue that when transferring across relatively similar sites, simple mean value transfers are to be preferred but that when sites are relatively dissimilar then value function transfers will yield lower errors. The paper also...... provides guidance on the appropriate specification of transferable value functions arguing that these should be developed from theoretical rather than ad-hoc statistical principles. These principles are tested via a common format valuation study of water quality improvements across five countries. Results...... support our various hypotheses providing a set of principles for future transfer studies. The application also considers new ways of incorporating distance decay, substitution and framing effects within transfers and presents a novel water quality ladder....

  3. Making benefit transfers work

    DEFF Research Database (Denmark)

    Bateman, I. J.; Brouwer, R.; Ferrini, S.

    2011-01-01

    We develop and test guidance principles for benefits transfers. These argue that when transferring across relatively similar sites, simple mean value transfers are to be preferred but that when sites are relatively dissimilar then value function transfers will yield lower errors. The paper also...... provides guidance on the appropriate specification of transferable value functions arguing that these should be developed from theoretical rather than ad-hoc statistical principles. These principles are tested via a common format valuation study of water quality improvements across five countries. Results...... support our various hypotheses providing a set of principles for future transfer studies. The application also considers new ways of incorporating distance decay, substitution and framing effects within transfers and presents a novel water quality ladder....

  4. Predicting Anthracycline Benefit

    DEFF Research Database (Denmark)

    Bartlett, John M S; McConkey, Christopher C; Munro, Alison F

    2015-01-01

    as measured with a centromere enumeration probe (CEP17) predicted sensitivity to anthracyclines, we report here an individual patient-level pooled analysis of data from five trials comparing anthracycline-based chemotherapy with CMF (cyclophosphamide, methotrexate, and fluorouracil) as adjuvant chemotherapy.......6% (TOP2A) of 3,846 patient cases with available tissue. Both CEP17and TOP2A treatment-by-marker interactions remained significant in adjusted analyses for recurrence-free and overall survival, whereas HER2 did not. A combined CEP17 and TOP2A-adjusted model predicted anthracycline benefit across all five...... trials for both recurrence-free (hazard ratio, 0.64; 95% CI, 0.51 to 0.82; P = .001) and overall survival (hazard ratio, 0.66; 95% CI, 0.51 to 0.85; P = .005). CONCLUSION: This prospectively planned individual-patient pooled analysis of patient cases from five adjuvant trials confirms that patients whose...

  5. China Benefits from FDI

    Institute of Scientific and Technical Information of China (English)

    华民

    2007-01-01

    While China’s opening up policy has brought about rapid economic growth,it has also resulted in a certain loss of welfare.Many scholars have debated this issue extensively from different perspectives.An article entitled"An Open Economy Calls for New Development Theories"by Zhang Youwen (published in the Sept.2006 issue of China Economist) proposed a"new approach to opening up"-a reflection of the views held by some Chinese scholars. Disagreeing with these views,the author of this article believes that China should give more consideration to her resource endowment and economic growth stages and evaluate scientifically the benefits of"opening up".

  6. Medicare Prescription Drug Benefit Manual

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Part D Prescription Drug Benefit Manual (PDBM) is user guide to Part D Prescription Drug Program. It includes information on general provisions, benefits,...

  7. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    Directory of Open Access Journals (Sweden)

    Aftab Hameed Memon

    2011-07-01

    Full Text Available Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class, G6 (B class and G5 (C class were used in investigation. Data was analyzed by Statistical package SPSS to find the means and rank. Average index method was adapted to for the level of features of resource scheduling implementation and barrier to resource-driven scheduling. It is significant 59.65% firms are implementing resource-driven scheduling as partial. Also methods of project scheduling and resource options adopted were investigated. A Significant majority of construction firms (approximately 65% adopt Microsoft project for scheduling. Study showed that the features of resource scheduling are being implemented at Medium Level. Lack of understanding / awareness of concepts, lack of genuine commitment, lack of coordination of key personnel and Lack of coordination of constructors consultants were found major factors that affect resource-driven scheduling. While, expensive to prepare is most contributing factor, no enforcement on schedules from authority, difficult to prepare and hurdles by personnel/authorities were found as major constraints in implementing resource driven scheduling.

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

  9. An Analysis of Shuttle Crew Scheduling Violations

    Science.gov (United States)

    Bristol, Douglas

    2012-01-01

    From the early years of the Space Shuttle program, National Aeronautics and Space Administration (NASA) Shuttle crews have had a timeline of activities to guide them through their time on-orbit. Planners used scheduling constraints to build timelines that ensured the health and safety of the crews. If a constraint could not be met it resulted in a violation. Other agencies of the federal government also have scheduling constraints to ensure the safety of personnel and the public. This project examined the history of Space Shuttle scheduling constraints, constraints from Federal agencies and branches of the military and how these constraints may be used as a guide for future NASA and private spacecraft. This was conducted by reviewing rules and violations with regard to human aerospace scheduling constraints, environmental, political, social and technological factors, operating environment and relevant human factors. This study includes a statistical analysis of Shuttle Extra Vehicular Activity (EVA) related violations to determine if these were a significant producer of constraint violations. It was hypothesized that the number of SCSC violations caused by EVA activities were a significant contributor to the total number of violations for Shuttle/ISS missions. Data was taken from NASA data archives at the Johnson Space Center from Space Shuttle/ISS missions prior to the STS-107 accident. The results of the analysis rejected the null hypothesis and found that EVA violations were a significant contributor to the total number of violations. This analysis could help NASA and commercial space companies understand the main source of constraint violations and allow them to create constraint rules that ensure the safe operation of future human private and exploration missions. Additional studies could be performed to evaluate other variables that could have influenced the scheduling violations that were analyzed.

  10. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

    Broadcasts and timelines are the primary mechanism of information exchange in online social platforms today. Services like Facebook, Twitter and Instagram have enabled ordinary people to reach large audiences spanning cultures and countries, while their massive popularity has created increasingly competitive marketplaces of attention. Timing broadcasts to capture the attention of such geographically diverse audiences has sparked interest from many startups and social marketing gurus. However, formal study is lacking on both the timing and frequency problems. In this thesis, we introduce, motivate and solve the broadcast scheduling problem of specifying the timing and frequency of publishing content to maximise the attention received. We validate and quantify three interacting behavioural phenomena to parametrise social platform users: information overload, bursty circadian rhythms and monotony aversion, which is defined here for the first time. Our analysis of the influence of monotony refutes the common assumption that posts on social network timelines are consumed piecemeal independently. Instead, we reveal that posts are consumed in chunks, which has important consequences for any future work considering human behaviour over social network timelines. Our quantification of monotony aversion is also novel, and has applications to problems in various domains such as recommender list diversification, user satiation and variety-seeking consumer behaviour. Having studied the underlying behavioural phenomena, we link schedules, timelines, attention and behaviour by formalising a timeline information exchange process. Our formulation gives rise to a natural objective function that quantifies the expected collective attention an arrangement of posts on a timeline will receive. We apply this formulation as a case-study on real-data from Twitter, where we estimate behavioural parameters, calculate the attention potential for different scheduling strategies and, using the

  11. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-07-01

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

  12. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-06-01

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

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

  14. Benefit / Cost priorities : achieving commensurability

    NARCIS (Netherlands)

    Wedley, W.C.; Choo, E.U.; Wijnmalen, D.J.D.

    2003-01-01

    Traditional Benefit/Cost analysis requires benefits and costs to be expressed in a common currency, usually dollars. More recently, benefits and costs have been expressed and compared as relative priorities. This process has been criticized because there is no guarantee that the two sources of prior

  15. Variable scheduling to mitigate channel losses in energy-efficient body area networks.

    Science.gov (United States)

    Tselishchev, Yuriy; Boulis, Athanassios; Libman, Lavy

    2012-11-02

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

  16. Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

    KAUST Repository

    Douik, Ahmed

    2015-12-01

    This paper addresses the joint coordinated scheduling and power control problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZ). The paper considers the problem of scheduling users to PZs and determining their power levels (PL), by maximizing the weighted sum-rate under the practical constraints that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximumweight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed crosslayer scheme provides appreciable performance improvement as compared to schemes from recent literature.

  17. Coordinated scheduling for the downlink of cloud radio-access networks

    KAUST Repository

    Douik, Ahmed S.

    2015-09-11

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

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

    Directory of Open Access Journals (Sweden)

    Lavy Libman

    2012-11-01

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

  19. Computerized Staffing and Scheduling of PRN Nursing Personnel

    OpenAIRE

    Veranth, Martha M; Cheson, Christine

    1984-01-01

    A computerized system developed at LDS Hospital in Salt Lake City, Utah for staffing and scheduling PRN nursing personnel is described. Pre- and post-implementation staffing and scheduling activities are compared.

  20. 41 CFR 51-8.12 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... rate includes the cost of operating the central processing unit (CPU), and the computer operator's... MATERIALS § 51-8.12 Fee schedule. (a) This schedule sets forth fees to be charged for processing...

  1. Algorithms for Assembly-Type Flowshop Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    An assembly-type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.

  2. A PSL Ontology-based Shop Floor Dynamical Scheduler Design

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-da; XU He; PENG Gao-liang; LIU Wen-jian; Khalil Alipour

    2008-01-01

    Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical scheduler is presented in this paper.The workflow and function modules of the scheduler are discussed in detail.A multi-step adaptive scheduling strategy and a process specification language,which is an ontology-based representation of process plan,are utilized in the proposed scheduler.The scheduler acquires the dispatching rule from the knowledge base and uses the build in on-line simulator to evaluate the obtained rule.These technologies enable the scheduler to improve its fine-tune ability and effectively transfer process information into other heterogeneous information systems in a shop floor.The effectiveness of the suggested structure will be demonstrated via its application in the scheduling system of a manufacturing enterprise.

  3. Self-controlled KR schedules: does repetition order matter?

    Science.gov (United States)

    Patterson, Jae T; Carter, Michael J; Hansen, Steve

    2013-08-01

    The impact of an experimenter-defined repetition schedule on the utility of a self-controlled KR context during motor skill acquisition was examined. Participants were required to learn three novel spatial-temporal tasks in either a random or blocked repetition schedule with or without the opportunity to control their KR. Results from the retention period showed that participants provided control over their KR schedule in a random repetition schedule demonstrated superior learning. However, performance measures from the transfer test showed that, independent of repetition schedule, learners provided the opportunity to control their KR schedule demonstrated superior transfer performance compared to their yoked counterparts. The dissociated impact of repetition schedule and self-controlled KR schedules on retention and transfer is discussed.

  4. 75 FR 72838 - Notice of Tribal Consultations; Schedule Update

    Science.gov (United States)

    2010-11-26

    ... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF THE INTERIOR National Indian Gaming Commission Notice of Tribal Consultations; Schedule Update AGENCY: National Indian Gaming Commission, Department of Interior. ACTION: Notice of tribal consultations; schedule...

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

  6. Forecasting and optimal probabilistic scheduling of surplus gas systems in iron and steel industry

    Institute of Scientific and Technical Information of China (English)

    李磊; 李红娟

    2015-01-01

    To make full use of the gas resource, stabilize the pipe network pressure, and obtain higher economic benefits in the iron and steel industry, the surplus gas prediction and scheduling models were proposed. Before applying the forecasting techniques, a support vector classifier was first used to classify the data, and then the filtering was used to create separate trend and volatility sequences. After forecasting, the Markov chain transition probability matrix was introduced to adjust the residual. Simulation results using surplus gas data from an iron and steel enterprise demonstrate that the constructed SVC-HP-ENN-LSSVM-MC prediction model prediction is accurate, and that the classification accuracy is high under different conditions. Based on this, the scheduling model was constructed for surplus gas operating, and it has been used to investigate the comprehensive measures for managing the operational probabilistic risk and optimize the economic benefit at various working conditions and implementations. It has extended the concepts of traditional surplus gas dispatching systems, and provides a method for enterprises to determine optimal schedules.

  7. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    OpenAIRE

    Aftab Hameed Memon; Rosli Mohammad Zin

    2011-01-01

    Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class), G6 (B c...

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

  9. Probability distribution fitting of schedule overruns in construction projects

    OpenAIRE

    P E D Love; C-P Sing; WANG, X; Edwards, D.J.; H Odeyinka

    2013-01-01

    The probability of schedule overruns for construction and engineering projects can be ascertained using a ‘best fit’ probability distribution from an empirical distribution. The statistical characteristics of schedule overruns occurring in 276 Australian construction and engineering projects were analysed. Skewness and kurtosis values revealed that schedule overruns are non-Gaussian. Theoretical probability distributions were then fitted to the schedule overrun data; including the Kolmogorov–...

  10. Contingency and stimulus change in chained schedules of reinforcement

    OpenAIRE

    Catania, A. Charles; Yohalem, Rona; Silverman, Philip J.

    1980-01-01

    Higher rates of pecking were maintained by pigeons in the middle component of three-component chained fixed-interval schedules than in that component of corresponding multiple schedules (two extinction components followed by a fixed-interval component). This rate difference did not occur in equivalent tandem and mixed schedules, in which a single stimulus was correlated with the three components. The higher rates in components of chained schedules demonstrate a reinforcing effect of the stimu...

  11. STUDY ON SHIFT SCHEDULE AND SIMULATION OF AUTOMATIC TRANSMISSION

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    From the point of view of saving energy, a new shift schedule and auto-controlling strategy for automatic transmission are proposed. In order to verify this shift schedule,a simulation program using a software package of Matlab/Simulink is developed. The simulation results show the shift schedule is correct. This shift schedule has enriched the theory of vehicle automatic maneuvering and will improve the efficiency of hydrodynanic drive system of the vehicle.

  12. Mentoring practices benefiting pediatric nurses.

    Science.gov (United States)

    Weese, Meghan M; Jakubik, Louise D; Eliades, Aris B; Huth, Jennifer J

    2015-01-01

    Previous studies examining predictors of pediatric nurse protégé mentoring benefits demonstrated that protégé perception of quality was the single best predictor of mentoring benefits. The ability to identify the mentoring practices that predict specific benefits for individual nurses provides a better understanding of how mentoring relationships can be leveraged within health care organizations promoting mutual mentoring benefits. This descriptive correlational, non-experimental study of nurses at a northeast Ohio, Magnet® recognized, free-standing pediatric hospital advances nursing science by demonstrating how mentoring practices benefit pediatric nurse protégés.

  13. Stochastic Reinforcement Benefits Skill Acquisition

    Science.gov (United States)

    Dayan, Eran; Averbeck, Bruno B.; Richmond, Barry J.; Cohen, Leonardo G.

    2014-01-01

    Learning complex skills is driven by reinforcement, which facilitates both online within-session gains and retention of the acquired skills. Yet, in ecologically relevant situations, skills are often acquired when mapping between actions and rewarding outcomes is unknown to the learning agent, resulting in reinforcement schedules of a stochastic…

  14. Cardiovascular benefits of exercise

    Directory of Open Access Journals (Sweden)

    Agarwal SK

    2012-06-01

    Full Text Available Shashi K AgarwalMedical Director, Agarwal Health Center, NJ, USAAbstract: Regular physical activity during leisure time has been shown to be associated with better health outcomes. The American Heart Association, the Centers for Disease Control and Prevention and the American College of Sports Medicine all recommend regular physical activity of moderate intensity for the prevention and complementary treatment of several diseases. The therapeutic role of exercise in maintaining good health and treating diseases is not new. The benefits of physical activity date back to Susruta, a 600 BC physician in India, who prescribed exercise to patients. Hippocrates (460–377 BC wrote “in order to remain healthy, the entire day should be devoted exclusively to ways and means of increasing one's strength and staying healthy, and the best way to do so is through physical exercise.” Plato (427–347 BC referred to medicine as a sister art to physical exercise while the noted ancient Greek physician Galen (129–217 AD penned several essays on aerobic fitness and strengthening muscles. This article briefly reviews the beneficial effects of physical activity on cardiovascular diseases.Keywords: exercise, cardiovascular disease, lifestyle changes, physical activity, good health

  15. HEALTH BENEFITS OF BARLEY

    Directory of Open Access Journals (Sweden)

    Akula Annapurna

    2013-09-01

    Full Text Available Prevalence of lifestyle diseases is increasing day by day. Mostly the younger generation do not have much awareness about healthy nutritional supplements. One such important cereal grain not used mostly by youngsters is barley It is a good old grain with so many health benefits like weight reduction, decreasing blood pressure, blood cholesterol, blood glucose in Type 2 diabetes and preventing colon cancer. It is easily available and cheap grain. It contains both soluble and insoluble fiber, protein, vitamins B and E, minerals selenium, magnesium and iron, copper, flavonoids and anthocynins. Barley contains soluble fiber, beta glucan binds to bile acids in the intestines and thereby decreasing plasma cholesterol levels. Absorbed soluble fiber decreases cholesterol synthesis by liver and cleansing blood vessels. Insoluble fiber provides bulkiness in the intestines, thereby satiety. decreased appetite. It promotes intestinal movements relieving constipation, cleansing colonic harmful bacteria and reduced incidence of colonic cancer. It is a good source of niacin ,reducing LDL levels and increasing HDL levels. Selenium and vitamin E providing beneficial antioxidant effects. Magnesium, a cofactor for many carbohydrate metabolism enzymes and high fiber content contributes for its blood glucose reducing effect in Type 2 diabetes. It is having good diuretic activity and is useful in urinary tract infections. Barley contains gluten, contraindicated in celiac disease.

  16. Project scheduling and staffing with a multi-skilled workforce

    OpenAIRE

    Maenhout, Broos; Vanhoucke, Mario

    2011-01-01

    When scheduling projects assumptions are made with respect to the personnel resource availability. In personnel scheduling problems assumptions are made with respect to the staffing requirements. We explore how to integrate these two scheduling problems for making strategic project staffing decisions. More precisely, we determine the number of personnel and required skill mix to complete a project.

  17. 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... scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in... transit by contacting the lock personnel using the direct-line phone and make the lockage fee payment...

  18. Effects of modeling versus instructions on sensitivity to reinforcement schedules.

    OpenAIRE

    Neef, Nancy A.; Marckel, Julie; Ferreri, Summer; Jung, Sunhwa; Nist, Lindsay; Armstrong, Nancy

    2004-01-01

    This study examined the effects of modeling versus instructions on the choices of 3 typically developing children and 3 children with attention deficit hyperactivity disorder (ADHD) whose academic responding showed insensitivity to reinforcement schedules. During baseline, students chose between successively presented pairs of mathematics problems associated with different variable-interval schedules of reinforcement. After responding proved insensitive to the schedules, sessions were precede...

  19. 48 CFR 52.236-15 - Schedules for Construction Contracts.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Schedules for Construction....236-15 Schedules for Construction Contracts. As prescribed in 36.515, insert the following clause: Schedules for Construction Contracts (APR 1984) (a) The Contractor shall, within five days after the...

  20. 48 CFR 436.575 - Maximum workweek-construction schedule.

    Science.gov (United States)

    2010-10-01

    ...-construction schedule. 436.575 Section 436.575 Federal Acquisition Regulations System DEPARTMENT OF AGRICULTURE... Maximum workweek-construction schedule. The contracting officer shall insert the clause at 452.236-75, Maximum Workweek-Construction Schedule, if the clause at FAR 52.236-15 is used and the contractor's...

  1. Play Ball!--The Scheduling of Sports Officials.

    Science.gov (United States)

    Evans, James R.; And Others

    1984-01-01

    Discusses use of the computer to solve the specific scheduling problems in assigning umpires to American League baseball games and assigning crews of officials to Atlantic Coast Conference football and basketball games. Scheduling variables that complicate the process and make manual scheduling almost impossible are described. (MBR)

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

  3. 40 CFR 300.905 - NCP Product Schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 27 2010-07-01 2010-07-01 false NCP Product Schedule. 300.905 Section... PLAN Use of Dispersants and Other Chemicals § 300.905 NCP Product Schedule. (a) Oil Discharges. (1) EPA..., called the NCP Product Schedule, may be obtained from the Emergency Response Division (5202-G),...

  4. 24 CFR 982.517 - Utility allowance schedule.

    Science.gov (United States)

    2010-04-01

    ... reasonable accommodation in accordance with 24 CFR part 8 to make the program accessible to and usable by the... 24 Housing and Urban Development 4 2010-04-01 2010-04-01 false Utility allowance schedule. 982.517... Payment § 982.517 Utility allowance schedule. (a) Maintaining schedule. (1) The PHA must maintain...

  5. Solving project scheduling problems by minimum cut computations

    NARCIS (Netherlands)

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

    2003-01-01

    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 manufactur

  6. 41 CFR 101-5.104-4 - Scheduling feasibility studies.

    Science.gov (United States)

    2010-07-01

    ... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and buildings... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Scheduling...

  7. 76 FR 28194 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2011-05-16

    ... SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety... (FOIA) Fee Schedule Update and solicits comments from interested organizations and individual members of... regulations, the Board's General Manager will update the FOIA Fee Schedule once every 12 months. Previous...

  8. 77 FR 32433 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2012-06-01

    ... NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear... Freedom of Information Act (FOIA) Fee Schedule Update and solicits comments from interested organizations...) of the Board's regulations, the Board's General Manager will update the FOIA Fee Schedule once...

  9. 75 FR 27228 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2010-05-14

    ... SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety... (FOIA) Fee Schedule Update and solicits comments from interested organizations and individual members of... regulations, the Board's General Manager will update the FOIA Fee Schedule once every 12 months. Previous...

  10. Optimizing Flight Schedules by an Automated Decision Support System

    Science.gov (United States)

    2014-03-01

    As a result of this, constructing the solution model in a language which is easy to enhance is critical. VBA is a powerful language for easy and quick...Flight Schedule Model ...............................................................................................45 Manual Assignments by...Scheduling Model .............................................................................62 Contribution of scheduling model to air force(s

  11. Managerial implications and suitability of a master surgical scheduling approach

    NARCIS (Netherlands)

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

    2008-01-01

    textabstractMaster surgical scheduling can improve manageability and efficiency of operating room departments. This approach cyclically executes a master surgical schedule of surgery types. These surgery types need to be constructed with low variability to be efficient. Each surgery type is schedule

  12. Helping Children Understand Routines and Classroom Schedules. What Works Briefs.

    Science.gov (United States)

    Ostrosky, M. M.; Jung, E. Y.; Hemmeter, M. L.; Thomas, D.

    Studies have documented that schedules and routines influence children's emotional, cognitive, and social development. Predictable and consistent schedules in preschool classrooms help children feel secure and comfortable. Also, schedules and routines help children understand the expectations of the environment and reduce the frequency of behavior…

  13. User interface issues in supporting human-computer integrated scheduling

    Science.gov (United States)

    Cooper, Lynne P.; Biefeld, Eric W.

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

  14. 40 CFR 798.6500 - Schedule-controlled operant behavior.

    Science.gov (United States)

    2010-07-01

    ... modify some class of behavior by reinforcement or punishment. (3) Schedule of reinforcement. A schedule of reinforcement specifies the relation between behavioral responses and the delivery of reinforcers... under schedules of reinforcement. Operant behavior tests may be used to evaluate many other aspects...

  15. 回馈与惩罚契约下闭环供应链应对突发事件协调性研究%The Impact of Emergencies on the Closed-loop Supply Chain Coordination under Rebate and Penalty Contracts

    Institute of Scientific and Technical Information of China (English)

    覃艳华; 曹细玉

    2012-01-01

    of their life cycle. In the end of each sales season, the manufacturer recycles and processes rubbish products so that they can be reused as a new product to satisfy the retailer's ordering demand. This paper first analyzes the coordination function of a closed-loop supply chain with rebate and penalty contract, and then discusses the impact of emergencies on the closed-loop supply chain coordination under market demand disruption. Finally, this paper explores how to carry out closed-loop supply chain coordination under disruption and effectively cope with emergencies. Four main conclusions are derived as follows; (1 ) Under the stochastic market demand, the closed-loop supply chain can be carried out with rebate and penalty contracts; (2) The optimal ordering quantity will be changed, and the optimal reclaiming price will not change under market demand disruption; (3) When market demand is changed by emergencies, the closed-loop supply chain cannot carry out with original rebate and penalty contract. The closed-loop supply chain coordination may be hampered by market demand disruption; and (4) An adjusted rebate and penalty contract can coordinate the closed-loop supply chain and enable it to cope with emergencies.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2012-07-01

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

  17. Improved Squeaky Wheel Optimisation for Driver Scheduling

    CERN Document Server

    Aickelin, Uwe; Li, Jingpeng

    2008-01-01

    This paper presents a technique called Improved Squeaky Wheel Optimisation for driver scheduling problems. It improves the original Squeaky Wheel Optimisations effectiveness and execution speed by incorporating two additional steps of Selection and Mutation which implement evolution within a single solution. In the ISWO, a cycle of Analysis-Selection-Mutation-Prioritization-Construction continues until stopping conditions are reached. The Analysis step first computes the fitness of a current solution to identify troublesome components. The Selection step then discards these troublesome components probabilistically by using the fitness measure, and the Mutation step follows to further discard a small number of components at random. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Prioritization step to first produce priorities that determine an order by which the following Construction step then schedul...

  18. The Dynamical Kernel Scheduler - Part 1

    CERN Document Server

    Adelmann, Andreas; Suter, Andreas

    2015-01-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software using these hardware accelerators introduces additional challenges for the developer such as exposing additional parallelism, dealing with different hardware designs and using multiple development frameworks in order to use devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between host application and different hardware accelerators. DKS handles the communication between the host and device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated in OPAL (Object-or...

  19. Real-Time Scheduling via Reinforcement Learning

    CERN Document Server

    Glaubius, Robert; Gill, Christopher; Smart, William D

    2012-01-01

    Cyber-physical systems, such as mobile robots, must respond adaptively to dynamic operating conditions. Effective operation of these systems requires that sensing and actu- ation tasks are performed in a timely manner. Additionally, execution of mission specific tasks such as imaging a room must be bal- anced against the need to perform more gen- eral tasks such as obstacle avoidance. This problem has been addressed by maintaining relative utilization of shared resources among tasks near a user-specified target level. Pro- ducing optimal scheduling strategies requires complete prior knowledge of task behavior, which is unlikely to be available in practice. Instead, suitable scheduling strategies must be learned online through interaction with the system. We consider the sample com- plexity of reinforcement learning in this do- main, and demonstrate that while the prob- lem state space is countably infinite, we may leverage the problem's structure to guarantee efficient learning.

  20. A Network Simulation Tool for Task Scheduling

    Directory of Open Access Journals (Sweden)

    Ondřej Votava

    2012-01-01

    Full Text Available Distributed computing may be looked at from many points of view. Task scheduling is the viewpoint, where a distributed application can be described as a Directed Acyclic Graph and every node of the graph is executed independently. There are, however, data dependencies and the nodes have to be executed in a specified order. Hence the parallelism of the execution is limited. The scheduling problem is difficult and therefore heuristics are used. However, many inaccuracies are caused by the model used for the system, in which the heuristics are being tested. In this paper we present a tool for simulating the execution of the distributed application on a “real” computer network, and try to tell how the executionis influenced compared to the model.