WorldWideScience

Sample records for blood order schedule

  1. Maximum surgical blood ordering schedules for revision lower limb arthroplasty.

    Science.gov (United States)

    Mahadevan, Devendra; Challand, Christopher; Clarke, Andrew; Keenan, Jonathan

    2011-05-01

    Effective utilisation of blood products is fundamental. The introduction of maximum surgical blood ordering schedules (MSBOS) for operations has been shown to improve transfusion services. A retrospective analysis was undertaken to establish an evidence-based MSBOS for revision total hip replacement (THR) and total knee revision (TKR). The impact of this schedule on blood conservation was analysed. A retrospective analysis was undertaken on 397 patients who underwent revision THR and TKR over a 4-year period. The cross-match-to-transfusion ratio (CTR) and transfusion index (TI) were calculated. A MSBOS protocol was created based on the TIs and its' impact on transfusion services was assessed prospectively on 125 patients by comparing CTRs. In revision THR, TI was 1.19 for elective cases, 1.55 for emergency cases and 2.35 for infected cases. There was no difference in TI for revisions of cemented and uncemented components. Single component THR revision required less transfusion. In revision TKR, TI was 0.31 for elective cases, 2.0 for emergency cases and 1.23 for cases with infection. The introduction of the MSBOS protocol had resulted in a considerable improvement in blood ordering. Reductions in the CTR were seen for all types of revision surgery, but most evident in elective revision THR (3.24-2.18) and elective revision TKR (7.95-1.2). Analysis confirmed that excessive cross-matching occurred for revision lower limb arthroplasty. The introduction of our MSBOS protocol promoted blood conservation and compliance with established national guidelines.

  2. Surgical blood order equation in femoral fracture surgery

    NARCIS (Netherlands)

    Kajja, I.; Bimenya, G. S.; Eindhoven, G. B.; ten Duis, H. Jan; Sibinga, C. T. S.

    Aim: This study aimed at establishing the clinical utility of the surgical blood order equation (SBOE) in patients undergoing femoral fracture surgery. Background: A blood ordering schedule defines the perioperative blood use in elective surgery. It lists the number of units of blood required for

  3. Perioperative blood ordering optimization process using information from an anesthesia information management system.

    Science.gov (United States)

    Rinehart, Joseph B; Lee, Tiffany C; Kaneshiro, Kayleigh; Tran, Minh-Ha; Sun, Coral; Kain, Zeev N

    2016-04-01

    As part of ongoing perioperative surgical home implantation process, we applied a previously published algorithm for creation of a maximum surgical blood order schedule (MSBOS) to our operating rooms. We hypothesized that using the MSBOS we could show a reduction in unnecessary preoperative blood testing and associated costs. Data regarding all surgical cases done at UC Irvine Health's operating rooms from January 1, 2011, to January 1, 2014 were extracted from the anesthesia information management systems (AIMS). After the data were organized into surgical specialties and operative sites, blood order recommendations were generated based on five specific case characteristics of the group. Next, we assessed current ordering practices in comparison to actual blood utilization to identify potential areas of wastage and performed a cost analysis comparing the annual hospital costs from preoperative blood orders if the blood order schedule were to be followed to historical practices. Of the 19,138 patients who were categorized by the MSBOS as needing no blood sample, 2694 (14.0%) had a type and screen (T/S) ordered and 1116 (5.8%) had a type and crossmatch ordered. Of the 6073 procedures where MSBOS recommended only a T/S, 2355 (38.8%) had blood crossmatched. The cost analysis demonstrated an annual reduction in actual hospital costs of $57,335 with the MSBOS compared to historical blood ordering practices. We showed that the algorithm for development of a multispecialty blood order schedule is transferable and yielded reductions in preoperative blood product screening at our institution. © 2016 AABB.

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

    Science.gov (United States)

    2017-05-03

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

  5. Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving

    NARCIS (Netherlands)

    Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze

    2015-01-01

    Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem

  6. Declarative Modeling for Production Order Portfolio Scheduling

    Directory of Open Access Journals (Sweden)

    Banaszak Zbigniew

    2014-12-01

    Full Text Available A declarative framework enabling to determine conditions as well as to develop decision-making software supporting small- and medium-sized enterprises aimed at unique, multi-project-like and mass customized oriented production is discussed. A set of unique production orders grouped into portfolio orders is considered. Operations executed along different production orders share available resources following a mutual exclusion protocol. A unique product or production batch is completed while following a given activity’s network order. The problem concerns scheduling a newly inserted project portfolio subject to constraints imposed by a multi-project environment The answers sought are: Can a given project portfolio specified by its cost and completion time be completed within the assumed time period in a manufacturing system in hand? Which manufacturing system capability guarantees the completion of a given project portfolio ordered under assumed cost and time constraints? The considered problems regard finding a computationally effective approach aimed at simultaneous routing and allocation as well as batching and scheduling of a newly ordered project portfolio subject to constraints imposed by a multi-project environment. The main objective is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multi-project-like and mass customized oriented production scheduling. Multiple illustrative examples are discussed.

  7. Using Scheduled Ordering to Improve the Performance of Distribution Supply Chains

    OpenAIRE

    Lucy Gongtao Chen; Srinagesh Gavirneni

    2010-01-01

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

  8. Optimizing preoperative blood ordering with data acquired from an anesthesia information management system.

    Science.gov (United States)

    Frank, Steven M; Rothschild, James A; Masear, Courtney G; Rivers, Richard J; Merritt, William T; Savage, Will J; Ness, Paul M

    2013-06-01

    The maximum surgical blood order schedule (MSBOS) is used to determine preoperative blood orders for specific surgical procedures. Because the list was developed in the late 1970s, many new surgical procedures have been introduced and others improved upon, making the original MSBOS obsolete. The authors describe methods to create an updated, institution-specific MSBOS to guide preoperative blood ordering. Blood utilization data for 53,526 patients undergoing 1,632 different surgical procedures were gathered from an anesthesia information management system. A novel algorithm based on previously defined criteria was used to create an MSBOS for each surgical specialty. The economic implications were calculated based on the number of blood orders placed, but not indicated, according to the MSBOS. Among 27,825 surgical cases that did not require preoperative blood orders as determined by the MSBOS, 9,099 (32.7%) had a type and screen, and 2,643 (9.5%) had a crossmatch ordered. Of 4,644 cases determined to require only a type and screen, 1,509 (32.5%) had a type and crossmatch ordered. By using the MSBOS to eliminate unnecessary blood orders, the authors calculated a potential reduction in hospital charges and actual costs of $211,448 and $43,135 per year, respectively, or $8.89 and $1.81 per surgical patient, respectively. An institution-specific MSBOS can be created, using blood utilization data extracted from an anesthesia information management system along with our proposed algorithm. Using these methods to optimize the process of preoperative blood ordering can potentially improve operating room efficiency, increase patient safety, and decrease costs.

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

    Science.gov (United States)

    2017-10-26

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

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

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

    Science.gov (United States)

    2013-05-16

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

  12. Order of blood draw

    DEFF Research Database (Denmark)

    Cornes, Michael; van Dongen-Lases, Edmée; Grankvist, Kjell

    2017-01-01

    does occur if order of draw is not followed during blood collection and when performing venipuncture under less than ideal circumstances, thus putting patient safety at risk. Moreover, given that order of draw is not difficult to follow and knowing that ideal phlebotomy conditions and protocols...... Medicine Working Group for the Preanalytical Phase (EFLM WG-PRE) provides an overview and summary of the literature with regards to order of draw in venous blood collection. Given the evidence presented in this article, the EFLM WG-PRE herein concludes that a significant frequency of sample contamination...

  13. Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Cheng Chen

    2014-01-01

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

  14. Blood and Diversity

    Science.gov (United States)

    ... Drive Biomedical Services Hospital Partners Blood Products Blood Banking Resources Order Blood Products Invoice Central Case Reports ... app (over 1 million downloads and counting!) and online scheduler make it quick to set up your ...

  15. Studies of wheel-running reinforcement: parameters of Herrnstein's (1970) response-strength equation vary with schedule order.

    Science.gov (United States)

    Belke, T W

    2000-05-01

    Six male Wistar rats were exposed to different orders of reinforcement schedules to investigate if estimates from Herrnstein's (1970) single-operant matching law equation would vary systematically with schedule order. Reinforcement schedules were arranged in orders of increasing and decreasing reinforcement rate. Subsequently, all rats were exposed to a single reinforcement schedule within a session to determine within-session changes in responding. For each condition, the operant was lever pressing and the reinforcing consequence was the opportunity to run for 15 s. Estimates of k and R(O) were higher when reinforcement schedules were arranged in order of increasing reinforcement rate. Within a session on a single reinforcement schedule, response rates increased between the beginning and the end of a session. A positive correlation between the difference in parameters between schedule orders and the difference in response rates within a session suggests that the within-session change in response rates may be related to the difference in the asymptotes. These results call into question the validity of parameter estimates from Herrnstein's (1970) equation when reinforcer efficacy changes within a session.

  16. Scheduled transplantation of human umbilical cord blood to severe combined immunodeficient mice

    International Nuclear Information System (INIS)

    Wu Jianqiu; Yang Yunfang; Jin Zhijun; Cai Jianming; Yang Rujun; Xiang Yingsong

    2000-01-01

    Objective: To explore a new method for developing the efficiency of human umbilical cord blood (UCB) cells engraftment, and further understand the growth characteristic of hematopoietic stem cells (HSC) in vivo. Methods: Sublethally irradiated severe combined immunodeficient (SCID) mice were transplanted i.v. with UCB cells which had been cryo-preserved at -80 degree C. The human cells in recipient mice were detected by flow cytometry and CFU-GM assay. Results: In contrast to the single transplantation, scheduled engraftment of similar numbers of UCB cells resulted in a proportionally obvious increase in the percentages of CD45 + , CD34 + cells produced in SCID mouse bone marrow (BM). When the donor cells were reduced to 20 percent, an identical reconstitution of both hematopoietic and part of immunologic functions was achieved. Conclusion: Scheduled engraftment improves the repopulating ability of HSC, which would provide a novel way for clinical cord blood engraftment in adult objects

  17. Saving Blood and Reducing Costs: Updating Blood Transfusion Practice in Lower Limb Arthroplasty

    LENUS (Irish Health Repository)

    Fenelon, C

    2018-04-01

    Our aim was to quantify blood transfusion rates in lower limb arthroplasty following the introduction of a multimodal enhanced recovery programme (ERP). We then sought to update the maximum surgical blood ordering schedule (MSBOS) and calculate cost savings achieved.

  18. An order insertion scheduling model of logistics service supply chain considering capacity and time factors.

    Science.gov (United States)

    Liu, Weihua; Yang, Yi; Wang, Shuqing; Liu, Yang

    2014-01-01

    Order insertion often occurs in the scheduling process of logistics service supply chain (LSSC), which disturbs normal time scheduling especially in the environment of mass customization logistics service. This study analyses order similarity coefficient and order insertion operation process and then establishes an order insertion scheduling model of LSSC with service capacity and time factors considered. This model aims to minimize the average unit volume operation cost of logistics service integrator and maximize the average satisfaction degree of functional logistics service providers. In order to verify the viability and effectiveness of our model, a specific example is numerically analyzed. Some interesting conclusions are obtained. First, along with the increase of completion time delay coefficient permitted by customers, the possible inserting order volume first increases and then trends to be stable. Second, supply chain performance reaches the best when the volume of inserting order is equal to the surplus volume of the normal operation capacity in mass service process. Third, the larger the normal operation capacity in mass service process is, the bigger the possible inserting order's volume will be. Moreover, compared to increasing the completion time delay coefficient, improving the normal operation capacity of mass service process is more useful.

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

    International Nuclear Information System (INIS)

    Vo Ngoc Dieu; Ongsakul, Weerakorn

    2009-01-01

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

  20. Schedules of controlled substances: extension of temporary placement of UR-144, XLR11, and AKB48 in schedule I of the Controlled Substances Act. Final order.

    Science.gov (United States)

    2015-05-15

    The Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to extend the temporary placement of (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48), including their salts, isomers, and salts of isomers whenever the existence of such salts, isomers, and salts of isomers is possible, in schedule I of the Controlled Substances Act. The current final order temporarily placing UR-144, XLR11, and AKB48 in schedule I is due to expire on May 15, 2015. This final order will extend the temporary scheduling of UR-144, XLR11, and AKB48 to May 15, 2016, or until the permanent scheduling action for these three substances is completed, whichever occurs first.

  1. U.S. Army Engineering and Support Center, Huntsville, Price Reasonableness Determinations for Federal Supply Schedule Orders for Supplies Need Improvement

    Science.gov (United States)

    2016-03-29

    Army Engineering and Support Center, Huntsville, Price Reasonableness Determinations for Federal Supply Schedule Orders for Supplies Need...0207.000) │ i Results in Brief U.S. Army Engineering and Support Center, Huntsville, Price Reasonableness Determinations for Federal Supply Schedule...officers made determinations of fair and reasonable pricing for General Services Administration Federal supply schedule orders awarded for purchases

  2. Schedules of Controlled Substances: Temporary Placement of Six Synthetic Cannabinoids (5F-ADB, 5F-AMB, 5F-APINACA, ADB-FUBINACA, MDMB-CHMICA and MDMB-FUBINACA) into Schedule I. Temporary Scheduling Order.

    Science.gov (United States)

    2017-04-10

    The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule six synthetic cannabinoids: methyl 2-(1-(5-fluoropentyl)-1H-indazole-3-carboxamido)-3,3-dimethylbutanoate [5F-ADB; 5F-MDMB-PINACA]; methyl 2-(1-(5-fluoropentyl)-1H-indazole-3-carboxamido)-3-methylbutanoate [5F-AMB]; N-(adamantan-1-yl)-1-(5-fluoropentyl)-1H-indazole-3-carboxamide [5F-APINACA, 5F-AKB48]; N-(1-amino-3,3-dimethyl-1-oxobutan-2-yl)-1-(4-fluorobenzyl)-1H-indazole-3-carboxamide [ADB-FUBINACA]; methyl 2-(1-(cyclohexylmethyl)-1H-indole-3-carboxamido)-3,3-dimethylbutanoate [MDMB-CHMICA, MMB-CHMINACA] and methyl 2-(1-(4-fluorobenzyl)-1H-indazole-3-carboxamido)-3,3-dimethylbutanoate [MDMB-FUBINACA], and their optical, positional, and geometric isomers, salts, and salts of isomers into schedule I pursuant to the temporary scheduling provisions of the Controlled Substances Act. This action is based on a finding by the Administrator that the placement of these synthetic cannabinoids into schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, 5F-ADB, 5F-AMB, 5F-APINACA, ADB-FUBINACA, MDMB-CHMICA or MDMB-FUBINACA.

  3. Maximizing Total Profit in Two-agent Problem of Order Acceptance and Scheduling

    Directory of Open Access Journals (Sweden)

    Mohammad Reisi-Nafchi

    2017-03-01

    Full Text Available In competitive markets, attracting potential customers and keeping current customers is a survival condition for each company. So, paying attention to the requests of customers is important and vital. In this paper, the problem of order acceptance and scheduling has been studied, in which two types of customers or agents compete in a single machine environment. The objective is maximizing sum of the total profit of first agent's accepted orders and the total revenue of second agent. Therefore, only the first agent has penalty and its penalty function is lateness and the second agent's orders have a common due date and this agent does not accept any tardy order. To solve the problem, a mathematical programming, a heuristic algorithm and a pseudo-polynomial dynamic programming algorithm are proposed. Computational results confirm the ability of solving all problem instances up to 70 orders size optimally and also 93.12% of problem instances up to 150 orders size by dynamic programming.

  4. A Time Scheduling Model of Logistics Service Supply Chain Based on the Customer Order Decoupling Point: A Perspective from the Constant Service Operation Time

    Science.gov (United States)

    Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

    2014-01-01

    In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC. PMID:24715818

  5. A time scheduling model of logistics service supply chain based on the customer order decoupling point: a perspective from the constant service operation time.

    Science.gov (United States)

    Liu, Weihua; Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

    2014-01-01

    In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC.

  6. Self-certification and employee training of mail-order distributors of scheduled listed chemical products. Interim final rule with request for comment.

    Science.gov (United States)

    2011-04-13

    On October 12, 2010, the President signed the Combat Methamphetamine Enhancement Act of 2010 (MEA). It establishes new requirements for mail-order distributors of scheduled listed chemical products. Mail-order distributors must now self-certify to DEA in order to sell scheduled listed chemical products at retail. Sales at retail are those sales intended for personal use; mail-order distributors that sell scheduled listed chemical products not intended for personal use, e.g., sale to a university, are not affected by the new law. This self-certification must include a statement that the mail-order distributor understands each of the requirements that apply under part 1314 and agrees to comply with these requirements. Additionally, mail-order distributors are now required to train their employees prior to self certification. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements and other existing regulations related to self-certification.

  7. Patients' and clinicians' views on the optimum schedules for self-monitoring of blood pressure: a qualitative focus group and interview study.

    Science.gov (United States)

    Grant, Sabrina; Hodgkinson, James A; Milner, Siobhan L; Martin, Una; Tompson, Alice; Hobbs, Fd Richard; Mant, Jonathan; McManus, Richard J; Greenfield, Sheila M

    2016-11-01

    Self-monitoring of blood pressure is common but guidance on how it should be carried out varies and it is currently unclear how such guidance is viewed. To explore patients' and healthcare professionals' (HCPs) views and experiences of the use of different self-monitoring regimens to determine what is acceptable and feasible, and to inform future recommendations. Thirteen focus groups and four HCP interviews were held, with a total of 66 participants (41 patients and 25 HCPs) from primary and secondary care with and without experience of self-monitoring. Standard and shortened self-monitoring protocols were both considered. Focus groups and interviews were recorded, transcribed verbatim, and analysed using the constant comparative method. Patients generally supported structured schedules but with sufficient flexibility to allow adaptation to individual routine. They preferred a shorter (3-day) schedule to longer (7-day) regimens. Although HCPs could describe benefits for patients of using a schedule, they were reluctant to recommend a specific schedule. Concerns surrounded the use of different schedules for diagnosis and subsequent monitoring. Appropriate education was seen as vital by all participants to enable a self-monitoring schedule to be followed at home. There is not a 'one size fits all approach' to developing the optimum protocol from the perspective of users and those implementing it. An approach whereby patients are asked to complete the minimum number of readings required for accurate blood pressure estimation in a flexible manner seems most likely to succeed. Informative advice and guidance should incorporate such flexibility for patients and professionals alike. © British Journal of General Practice 2016.

  8. Integrated model for pricing, delivery time setting, and scheduling in make-to-order environments

    Science.gov (United States)

    Garmdare, Hamid Sattari; Lotfi, M. M.; Honarvar, Mahboobeh

    2018-03-01

    Usually, in make-to-order environments which work only in response to the customer's orders, manufacturers for maximizing the profits should offer the best price and delivery time for an order considering the existing capacity and the customer's sensitivity to both the factors. In this paper, an integrated approach for pricing, delivery time setting and scheduling of new arrival orders are proposed based on the existing capacity and accepted orders in system. In the problem, the acquired market demands dependent on the price and delivery time of both the manufacturer and its competitors. A mixed-integer non-linear programming model is presented for the problem. After converting to a pure non-linear model, it is validated through a case study. The efficiency of proposed model is confirmed by comparing it to both the literature and the current practice. Finally, sensitivity analysis for the key parameters is carried out.

  9. Proposed maximum surgical blood ordering schedule for common orthopedic surgeries in a Tertiary Health - Care Center in Northern India

    Directory of Open Access Journals (Sweden)

    Sonam Kumari

    2017-01-01

    CONCLUSIONS: MSBOS based on the past blood utilization records for different surgeries and keeping patients variables in consideration wherever required would provide an efficient way of blood utilization and appropriate management of blood bank resources.

  10. Blood Clotting and Pregnancy

    Medline Plus

    Full Text Available ... Emerging Immunotherapies Registration Schedule & Program Meeting on Lymphoma Biology Registration Schedule & Program Abstracts 60th ASH Annual Meeting & ... Malignancies Consultative Hematology Course ASH Meeting on Lymphoma Biology ASH Workshop on Genome Editing Publications Blood Blood ...

  11. SOME BIOCHEMICAL BLOOD CONSTANTS EVOLUTION IN REPORT TO THE TRAINING SCHEDULE STAGE IN SPORT HORSES

    Directory of Open Access Journals (Sweden)

    FLAVIA BOCHIS

    2008-10-01

    Full Text Available To determine whether a clinical examination was adequate to assess the fitness of horses in a fence course riding, and to characterize the relationship between a clinical assessment of the horse's fitness, training schedule stage and its blood biochemistry, 22 horses were monitored before (S1, during training, immediately after warming-up (S2 and after an E level fence obstacle course ride (S3. The blood samples were taken from the jugular vein in the above three mentioned phases, for the determination of total protein (g/dl, nitrogen (mg/dl, glucose (mg/dl, lactic acid (nmol/l, calcium (mg/dl, cholesterol (mg/dl and phosphorus (mg/dl. The intend of the paper is to present the obtained results as a reference study for the appropriate use by clinicians, sport horses owners and trainers in view to have a solid base in evaluation, for the adequate protection of health and welfare of the jumper horses competitors.

  12. Effect of order of draw of blood samples during phlebotomy on routine biochemistry results.

    Science.gov (United States)

    Sulaiman, Raashda A; Cornes, Michael P; Whitehead, Simon J; Othonos, Nadia; Ford, Clare; Gama, Rousseau

    2011-11-01

    To investigate whether incorrect order of draw of blood samples during phlebotomy causes in vitro potassium ethylenediaminetetraacetic acid EDTA (kEDTA) contamination of blood samples. Serum kEDTA, potassium, calcium, magnesium, alkaline phosphatase, zinc and iron concentrations were measured in blood samples drawn before and after collecting blood into kEDTA containing sample tubes by an experienced phlebotomist using the Sarstedt Safety Monovette system. EDTA was undetectable in all samples. The concentrations of other analytes were similar in blood samples drawn before and after collection of the EDTA blood sample. Order of draw of blood samples using the Sarstedt Safety Monovette system has no effect on serum biochemistry results, when samples are taken by an experienced phlebotomist.

  13. 77 FR 42762 - Scheduling of an Expedited Five-Year Review Concerning the Antidumping Duty Order on Folding Gift...

    Science.gov (United States)

    2012-07-20

    ... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-921 (Second Review)] Scheduling of an Expedited Five-Year Review Concerning the Antidumping Duty Order on Folding Gift Boxes From China AGENCY... folding gift boxes from China would be likely to lead to continuation or recurrence of material injury...

  14. Blood Glucose Levels and Problem Behavior

    Science.gov (United States)

    Valdovinos, Maria G.; Weyand, David

    2006-01-01

    The relationship between varying blood glucose levels and problem behavior during daily scheduled activities was examined. The effects that varying blood glucose levels had on problem behavior during daily scheduled activities were examined. Prior research has shown that differing blood glucose levels can affect behavior and mood. Results of this…

  15. The Impact of an Electronic Ordering System on Blood Bank Specimen Rejection Rates.

    Science.gov (United States)

    Forest, Stefanie K; Shirazi, Maryam; Wu-Gall, Charlotte; Stotler, Brie A

    2017-01-01

    To evaluate the impact that an electronic ordering system has on the rate of rejection of blood type and screen testing samples and the impact on the number of ABO blood-type discrepancies over a 4-year period. An electronic ordering system was implemented in May 2011. Rejection rates along with reasons for rejection were tracked between January 2010 and December 2013. A total of 40,104 blood samples were received during this period, of which 706 (1.8%) were rejected for the following reasons: 382 (54.0%) unsigned samples, 235 (33.0%) mislabeled samples, 57 (8.0%) unsigned requisitions, 18 (2.5%) incorrect tubes, and 14 (1.9%) ABO discrepancies. Of the samples, 2.5% were rejected in the year prior to implementing the electronic ordering system compared with 1.2% in the year following implementation ( P  blood sample rejection. © American Society for Clinical Pathology, 2017. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com

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

    Science.gov (United States)

    Richards, Stephen F.

    1991-01-01

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

  17. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

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

  18. Multiuser switched diversity scheduling schemes

    KAUST Repository

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

    2012-01-01

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

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

  20. Blood Clotting and Pregnancy

    Medline Plus

    Full Text Available ... Schedule & Program Registration Receipts Abstracts View all meetings Publications Blood Current Issue First Edition Abstracts Blood Advances ... reflect the most recent scientific research View all publications For Patients Blood Basics Blood Disorders Anemia Bleeding ...

  1. Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS

    Directory of Open Access Journals (Sweden)

    Arun Gupta

    2016-07-01

    Full Text Available The flow-shop scheduling problem (FSP has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed. Some of these techniques offer excellent effectiveness and efficiency at the expense of substantial implementation efforts and being extremely complicated. This paper brings out the application of a Multi-Criteria Decision Making (MCDM method known as techniques for order preference by similarity to an ideal solution (TOPSIS using different weighting schemes in flow-shop environment. The objective function is identification of a job sequence which in turn would have minimum makespan (total job completion time. The application of the proposed method to flow shop scheduling is presented and explained with a numerical example. The results of the proposed TOPSIS based technique of FSP are also compared on the basis of some benchmark problems and found compatible with the results obtained from other standard procedures.

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

  3. Risk factors for blood transfusion in patients undergoing high-order Cesarean delivery.

    Science.gov (United States)

    Spiegelman, Jessica; Mourad, Mirella; Melka, Stephanie; Gupta, Simi; Lam-Rachlin, Jennifer; Rebarber, Andrei; Saltzman, Daniel H; Fox, Nathan S

    2017-11-01

    The objective was to identify risk factors associated with blood transfusion in patients undergoing high-order Cesarean delivery (CD). This was a retrospective cohort study of patients undergoing third or more CD by a single maternal-fetal medicine practice between 2005 and 2016. We compared risk factors between women who did and did not receive a red blood cell transfusion during the operation or before discharge. Repeat analysis was performed after excluding women with placenta previa. A total of 514 patients were included, 18 of whom (3.5%; 95% confidence interval [CI], 2.2%-5.5%) received a blood transfusion. Placenta previa was the most significant risk factor for transfusion (61.1% of patients who received a transfusion vs. 1% of patients who did not; p blood transfusion. After women who had placenta previa were excluded, the incidence of blood transfusion was seven of 498 (1.4%; 95% CI, 0.7%-2.9%). Risk factors significantly associated with blood transfusion in the absence of previa were prophylactic anticoagulation during pregnancy and having labored. The incidence of transfusion in patients with no placenta previa, no anticoagulation, and no labor was 0.7% (95% CI, 0.3%-2.1%). Placenta previa was the most predictive risk factor for transfusion with a positive predictive value of 68.8% and a negative predictive value of 98.4%. In patients undergoing a third or more CD, only placenta previa, prophylactic anticoagulation during pregnancy, and having labored are independently associated with requiring a blood transfusion. These data can be used to guide physician ordering of prepared blood products preoperatively. © 2017 AABB.

  4. Integrated test schedule for buried waste integrated demonstration

    International Nuclear Information System (INIS)

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

    1992-05-01

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

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

    Science.gov (United States)

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

    2016-08-01

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

  6. The order of draw of blood specimens into additive containing tubes not affect potassium and calcium measurements.

    Science.gov (United States)

    Majid, A; Heaney, D C; Padmanabhan, N; Spooner, R

    1996-12-01

    The effect of order of draw when taking blood into tubes containing additive was investigated in 47 medical inpatients; 12 of these patients acted as a control group. The samples were analysed in the order in which they were withdrawn. The results of potassium and calcium concentrations did not differ significantly between groups. Manufacturers recommend a specific order of draw when taking blood using vacuum based blood collection systems, which are routinely used in many hospitals. The results of this study, however, show that order of draw has no effect on calcium or potassium concentrations.

  7. A reduced feedback proportional fair multiuser scheduling scheme

    KAUST Repository

    Shaqfeh, Mohammad

    2011-12-01

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

  8. The order of draw of blood specimens into additive containing tubes not affect potassium and calcium measurements.

    OpenAIRE

    Majid, A; Heaney, D C; Padmanabhan, N; Spooner, R

    1996-01-01

    The effect of order of draw when taking blood into tubes containing additive was investigated in 47 medical inpatients; 12 of these patients acted as a control group. The samples were analysed in the order in which they were withdrawn. The results of potassium and calcium concentrations did not differ significantly between groups. Manufacturers recommend a specific order of draw when taking blood using vacuum based blood collection systems, which are routinely used in many hospitals. The resu...

  9. Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

    Directory of Open Access Journals (Sweden)

    Jae-Gon Kim

    2015-01-01

    Full Text Available Lot-order assignment is to assign items in lots being processed to orders to fulfill the orders. It is usually performed periodically for meeting the due dates of orders especially in a manufacturing industry with a long production cycle time such as the semiconductor manufacturing industry. In this paper, we consider the lot-order assignment problem (LOAP with the objective of minimizing the total tardiness of the orders with distinct due dates. We show that we can solve the LOAP optimally by finding an optimal sequence for the single-machine total tardiness scheduling problem with nonnegative time-dependent processing times (SMTTSP-NNTDPT. Also, we address how the priority rules for the SMTTSP can be modified to those for the SMTTSP-NNTDPT to solve the LOAP. In computational experiments, we discuss the performances of the suggested priority rules and show the result of the proposed approach outperforms that of the commercial optimization software package.

  10. Blood Clotting and Pregnancy

    Medline Plus

    Full Text Available ... an immediate impact on your practice Summit on Emerging Immunotherapies Registration Schedule & Program Meeting on Lymphoma Biology ... blood clots are treated with an anticoagulant, a medicine that prevents the blood from clotting. Certain anticoagulants ...

  11. Milk composition and blood metabolic profile from holstein cows at different calving orders and lactation stages

    Directory of Open Access Journals (Sweden)

    Mariana Borges de Castro Dias

    2017-07-01

    Full Text Available This study aimed to evaluate milk composition and metabolic profile of Holstein cows at different calving orders in the beginning, middle, and end of lactation. One hundred ten Holstein cows were housed in a free stall system receiving the same diet and were grouped according to calving order (first, second, third, and fourth calving and days in milk (DIM: early (1-90 DIM, middle (91-180 DIM, and end of lactation (over 181 DIM for comparing milk yield, milk composition, and blood metabolic profile between the calving orders within the same lactation period. These parameters were also evaluated between lactation periods of the cows in different calving orders. The calving order, in any lactation stage, had no influence on milk yield per day and blood biochemical profile of Holstein cows receiving the same diet. However, calving order in all stages of lactation influenced milk composition. The first, second, third, and fourth calving order had no effect on the blood biochemical profile of Holstein cows, in any lactation stage. On the other hand, the different stages of lactation influenced milk yield and milk composition of Holstein cows.

  12. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1997-01-01

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

  13. 77 FR 75075 - Schedules of Controlled Substances: Placement of Lorcaserin Into Schedule IV

    Science.gov (United States)

    2012-12-19

    ... marketing lorcaserin as a Schedule IV substance will decrease its abuse, as opposed to marketing it as an... for marketing by FDA as an addition to a reduced-calorie diet and exercise, for chronic weight... to Section 3(d)(1) of Executive Order 12866 and the principles reaffirmed in Executive Order 13563...

  14. Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

    Directory of Open Access Journals (Sweden)

    Hendra Achmadi

    2010-06-01

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

  15. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

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

    2013-01-01

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

  16. Reduction in unnecessary red blood cell folate testing by restricting computerized physician order entry in the electronic health record.

    Science.gov (United States)

    MacMillan, Thomas E; Gudgeon, Patrick; Yip, Paul M; Cavalcanti, Rodrigo B

    2018-05-02

    Red blood cell folate is a laboratory test with limited clinical utility. Previous attempts to reduce physician ordering of unnecessary laboratory tests, including folate, have resulted in only modest success. The objective of this study was to assess the effectiveness and impacts of restricting red blood cell folate ordering in the electronic health record. This was a retrospective observational study from January 2010 to December 2016 at a large academic healthcare network in Toronto, Canada. All inpatients and outpatients who underwent at least 1 red blood cell folate or vitamin B12 test during the study period were included. Red blood cell folate ordering was restricted to clincians in gastroenterology and hematology and was removed from other physicians' computerized order entry screen in the electronic health record in June 2013. Red blood cell folate testing decreased by 94.4% during the study, from a mean of 493.0 (SD 48.0) tests/month before intervention to 27.6 (SD 10.3) tests/month after intervention (P<.001). Restricting red blood cell folate ordering in the electronic health record resulted in a large and sustained reduction in red blood cell folate testing. Significant cost savings estimated at over a quarter-million dollars (CAD) over three years were achieved. There was no significant clinical impact of the intervention on the diagnosis of folate deficiency. Copyright © 2018. Published by Elsevier Inc.

  17. Blood shortage situation: An audit of red blood cells order and ...

    African Journals Online (AJOL)

    The objective of this work is to audit blood utilization by different specialties in the hospital using the Cross-match ratio as a guide to achieving effective transfusion practices. This was a prospective study. The blood bank of University Teaching Hospital in Benin City, Nigeria was used for the study. We analysed all blood ...

  18. Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission.

    Science.gov (United States)

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

    2017-06-09

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

  19. Cloud Computing Task Scheduling Based on Cultural Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Li Jian-Wen

    2016-01-01

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

  20. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

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

    1986-01-01

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

  1. Order of draw practices in venous blood sampling at clinical biochemistry departments in the Danish health care system

    DEFF Research Database (Denmark)

    Jacobsen, Katja Kemp; Brandt, Ida; Christensen, Anne Vindahl

    2018-01-01

    the procedures in venous blood sampling among clinical biochemistry departments to assess the uniformity of order of blood draw and adherence to international guidelines in the Danish health care system. METHODS: We collected venous order of draw procedures from 49 clinical biochemistry departments at 22 public...... 15189:2012 accreditation (p = .57). CONCLUSIONS: Venous order of draw procedures is diverse at Danish clinical biochemistry departments and show moderate adherence to international guidelines....

  2. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

  4. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn R.K.; van der Heijden, Matthijs C.; van Harten, Aart

    2004-01-01

    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule

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

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

    Directory of Open Access Journals (Sweden)

    Lianfei Yu

    2017-01-01

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

  7. Study on multi-objective flexible job-shop scheduling problem considering energy consumption

    Directory of Open Access Journals (Sweden)

    Zengqiang Jiang

    2014-06-01

    Full Text Available Purpose: Build a multi-objective Flexible Job-shop Scheduling Problem(FJSP optimization model, in which the makespan, processing cost, energy consumption and cost-weighted processing quality are considered, then Design a Modified Non-dominated Sorting Genetic Algorithm (NSGA-II based on blood variation for above scheduling model.Design/methodology/approach: A multi-objective optimization theory based on Pareto optimal method is used in carrying out the optimization model. NSGA-II is used to solve the model.Findings: By analyzing the research status and insufficiency of multi-objective FJSP, Find that the difference in scheduling will also have an effect on energy consumption in machining process and environmental emissions. Therefore, job-shop scheduling requires not only guaranteeing the processing quality, time and cost, but also optimizing operation plan of machines and minimizing energy consumption.Originality/value: A multi-objective FJSP optimization model is put forward, in which the makespan, processing cost, energy consumption and cost-weighted processing quality are considered. According to above model, Blood-Variation-based NSGA-II (BVNSGA-II is designed. In which, the chromosome mutation rate is determined after calculating the blood relationship between two cross chromosomes, crossover and mutation strategy of NSGA-II is optimized and the prematurity of population is overcome. Finally, the performance of the proposed model and algorithm is evaluated through a case study, and the results proved the efficiency and feasibility of the proposed model and algorithm.

  8. Integrated Production-Distribution Scheduling Problem with Multiple Independent Manufacturers

    Directory of Open Access Journals (Sweden)

    Jianhong Hao

    2015-01-01

    Full Text Available We consider the nonstandard parts supply chain with a public service platform for machinery integration in China. The platform assigns orders placed by a machinery enterprise to multiple independent manufacturers who produce nonstandard parts and makes production schedule and batch delivery schedule for each manufacturer in a coordinate manner. Each manufacturer has only one plant with parallel machines and is located at a location far away from other manufacturers. Orders are first processed at the plants and then directly shipped from the plants to the enterprise in order to be finished before a given deadline. We study the above integrated production-distribution scheduling problem with multiple manufacturers to maximize a weight sum of the profit of each manufacturer under the constraints that all orders are finished before the deadline and the profit of each manufacturer is not negative. According to the optimal condition analysis, we formulate the problem as a mixed integer programming model and use CPLEX to solve it.

  9. SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

    Directory of Open Access Journals (Sweden)

    A. Alle

    2002-03-01

    Full Text Available The problems of scheduling and optimization of operational conditions in multistage, multiproduct continuous plants with intermediate storage are simultaneously addressed. An MINLP model, called TSPFLOW, which is based on the TSP formulation for product sequencing, is proposed to schedule the operation of such plants. TSPFLOW yields a one-order-of-magnitude CPU time reduction as well as the solution of instances larger than those formerly reported (Pinto and Grossmann, 1994. Secondly, processing rates and yields are introduced as additional optimization variables in order to state the simultaneous problem of scheduling with operational optimization. Results show that trade-offs are very complex and that the development of a straightforward (rule of thumb method to optimally schedule the operation is less effective than the proposed approach.

  10. SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

    Directory of Open Access Journals (Sweden)

    Alle A.

    2002-01-01

    Full Text Available The problems of scheduling and optimization of operational conditions in multistage, multiproduct continuous plants with intermediate storage are simultaneously addressed. An MINLP model, called TSPFLOW, which is based on the TSP formulation for product sequencing, is proposed to schedule the operation of such plants. TSPFLOW yields a one-order-of-magnitude CPU time reduction as well as the solution of instances larger than those formerly reported (Pinto and Grossmann, 1994. Secondly, processing rates and yields are introduced as additional optimization variables in order to state the simultaneous problem of scheduling with operational optimization. Results show that trade-offs are very complex and that the development of a straightforward (rule of thumb method to optimally schedule the operation is less effective than the proposed approach.

  11. 76 FR 20518 - Self-Certification and Employee Training of Mail-Order Distributors of Scheduled Listed Chemical...

    Science.gov (United States)

    2011-04-13

    ... regulated sellers--i.e., retail stores and mobile retail vendors--of scheduled listed chemical products. To... scheduled listed chemical products at retail. Sales at retail are those sales intended for personal use... available for public inspection online at http://www.regulations.gov and in the Drug Enforcement...

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

  13. Joint opportunistic scheduling and network coding for bidirectional relay channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-07-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users\\' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.

  14. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

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

    2013-01-01

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

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

  16. Scheduling nurses’ shifts at PGI Cikini Hospital

    Science.gov (United States)

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

    2018-03-01

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

  17. Flow-shop scheduling problem under uncertainties: Review and trends

    OpenAIRE

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

    2017-01-01

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

  18. BloodLink: Computer-based Decision Support for Blood Test Ordering; Assessment of the effect on physicians' test-ordering behavior

    NARCIS (Netherlands)

    M.A.M. van Wijk (Marc)

    2000-01-01

    textabstractRequesting blood tests is an important aspect of the health care delivered by the general practitioner in The Netherlands. About three to four percent of the patients encounters with Dutch general practitioners result in the physician requesting blood tests, which is lower than in many

  19. Application of Tabu Search Algorithm in Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Betrianis Betrianis

    2010-10-01

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

  20. Analysis of blood transfusion predictors in patients undergoing elective oesophagectomy for cancer

    Directory of Open Access Journals (Sweden)

    Welch Neil T

    2008-01-01

    Full Text Available Abstract Background Oesophagectomy for cancers is a major operation with significant blood loss and usage. Concerns exist about the side effects of blood transfusion, cost and availability of donated blood. We are not aware of any previous study that has evaluated predictive factors for perioperative blood transfusion in patients undergoing elective oesophagectomy for cancer. This study aimed to audit the pattern of blood crossmatch and to evaluate factors predictive of transfusion requirements in oesophagectomy patients. Methods Data was collected from the database of all patients who underwent oesophagectomy for cancer over a 2-year period. Clinico-pathological data collected included patients demographics, clinical factors, tumour histopathological data, preoperative and discharge haemoglobin levels, total blood loss, number of units of blood crossmatched pre-, intra- and postoperatively, number of blood units transfused, crossmatched units reused for another patient and number of blood units wasted. Clinico-pathological variables were evaluated and logistic regression analysis was performed to determine which factors were predictive of blood transfusion. Results A total of 145 patients with a male to female ratio of 2.5:1 and median age of 68 (40–85 years were audited. The mean preoperative haemoglobin (Hb was 13.0 g/dl. 37% of males (Hb 70 years, Hb level Conclusion The cohort of patients audited was over-crossmatched. The identified independent predictors of blood transfusion should be considered in preoperative blood ordering for oesophagectomy patients. This study has directly led to a reduction in the maximum surgical blood-ordering schedule for oesophagectomy to 2 units and a reaudit is underway.

  1. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-05-27

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  2. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad; Alnuweiri, Hussein; Alouini, Mohamed-Slim; Zafar, Ammar

    2013-01-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  3. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

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

    1998-01-01

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

  4. Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    Maria Drakaki

    2017-02-01

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

  5. Best Speed Fit EDF Scheduling for Performance Asymmetric Multiprocessors

    Directory of Open Access Journals (Sweden)

    Peng Wu

    2017-01-01

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

  6. Blood Clotting and Pregnancy

    Medline Plus

    Full Text Available ... 1-4, 2018 Abstracts Registration Schedule and Program Housing Get Email Updates View all meetings Publications Blood ... vein thrombosis (DVT). Pulmonary embolism (PE) is a life-threatening event that occurs when a DVT breaks ...

  7. Blood Clotting and Pregnancy

    Medline Plus

    Full Text Available ... an immediate impact on your practice Summit on Emerging Immunotherapies Registration Schedule & Program Meeting on Lymphoma Biology ... you are interested in learning more about blood diseases and disorders, here are a few other resources ...

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

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

  10. Review of job shop scheduling research and its new perspectives under Industry 4.0

    OpenAIRE

    Zhang, Jian; Ding, Guofu; Zou, Yisheng; Qin, Sheng-feng; Fu, Jianlin

    2017-01-01

    Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to t...

  11. Hanford Site Environmental Surveillance Master Sampling Schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    2000-01-01

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

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

  13. Generic Formal Framework for Compositional Analysis of Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; Hyun Kim, Jin; Thi Xuan Phan, Linh

    We present a compositional framework for the specification and analysis of hierarchical scheduling systems (HSS). Firstly we provide a generic formal model, which can be used to describe any type of scheduling system. The concept of Job automata is introduced in order to model job instantiation...

  14. Flow shop scheduling algorithm to optimize warehouse activities

    Directory of Open Access Journals (Sweden)

    P. Centobelli

    2016-01-01

    Full Text Available Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities.

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

    Science.gov (United States)

    Hakim, L.; Bakhtiar, T.; Jaharuddin

    2017-01-01

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

  16. Modeling and optimization of tissue 10B concentration and dosimetry for arbitrary BPA-F infusion schedules in humans

    International Nuclear Information System (INIS)

    Kiger, W.S. III; Newton, T.H.; Palmer, M.R.

    2000-01-01

    Separate compartmental models have been derived for the concentration of 10 B resulting from BPA-F infusion in the central vascular space (i.e., blood or, more appropriately, plasma) and in glioblastoma multiforme and normal brain. By coupling the model for the temporal variation of 10 B concentration in the central vascular space with that for tissue, the dynamic behavior of the 10 B concentration and the resulting dosimetry in the relevant tissues and blood may be predicted for arbitrary infusion schedules. This coupled model may be used as a tool for identifying the optimal time for BNCT irradiation and optimal BPA-F infusion schedule (i.e., temporal targeting) in humans without the need for expensive and time-consuming pharmacokinetic studies for every infusion schedule considered. This model was used to analyze the concentration profiles resulting from a wide range of infusion schedules and their implications for dosimetry. (author)

  17. Sharing Data for Production Scheduling Using the ISA-95 Standard

    Energy Technology Data Exchange (ETDEWEB)

    Harjunkoski, Iiro, E-mail: iiro.harjunkoski@de.abb.com; Bauer, Reinhard [ABB Corporate Research, Industrial Software and Applications, Ladenburg (Germany)

    2014-10-21

    In the development and deployment of production scheduling solutions, one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment, and other resources are necessary for producing a realistic short-term production plan. Currently, a widely accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data exchange for scheduling solutions.

  18. Sharing Data for Production Scheduling Using the ISA-95 Standard

    International Nuclear Information System (INIS)

    Harjunkoski, Iiro; Bauer, Reinhard

    2014-01-01

    In the development and deployment of production scheduling solutions, one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment, and other resources are necessary for producing a realistic short-term production plan. Currently, a widely accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data exchange for scheduling solutions.

  19. Sharing data for production scheduling using the ISA-95 standard

    Directory of Open Access Journals (Sweden)

    Iiro eHarjunkoski

    2014-10-01

    Full Text Available In the development and deployment of production scheduling solutions one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment and other resources are necessary for producing a realistic short-term production plan. Currently, a widely-accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data-exchange for scheduling solutions.

  20. Car painting process scheduling with harmony search algorithm

    Science.gov (United States)

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

    2018-02-01

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

  1. Automatic scheduling of maintenance work in nuclear power plants

    International Nuclear Information System (INIS)

    Kasahara, T.; Nishizawa, Y.; Kato, K.; Kiguchi, T.

    1987-01-01

    An automatic scheduling method for maintenance work in nuclear power plants has been developed using an AI technique. The purpose of this method is to help plant operators by adjusting the time schedule of various kinds of maintenance work so that incorrect ordering or timing of plant manipulations does not cause undersirable results, such as a plant trip. The functions of the method were tested by off-line simulations. The results show that the method can produce a satisfactory schedule of plant component manipulations without interference between the tasks and plant conditions

  2. Scheduling and Topology Design in Networks with Directional Antennas

    Science.gov (United States)

    2017-05-19

    Scheduling and Topology Design in Networks with Directional Antennas Thomas Stahlbuhk, Nathaniel M. Jones, Brooke Shrader Lincoln Laboratory...controllers must choose which pairs of nodes should communicate in order to establish a topology over which traffic can be sent. Additionally...interacting effects of topology design and transmission scheduling in wireless networks, in particular focusing on networks where nodes are divided into

  3. Interhospital Variability in Perioperative Red Blood Cell Ordering Patterns in United States Pediatric Surgical Patients.

    Science.gov (United States)

    Thompson, Rachel M; Thurm, Cary W; Rothstein, David H

    2016-10-01

    To evaluate perioperative red blood cell (RBC) ordering and interhospital variability patterns in pediatric patients undergoing surgical interventions at US children's hospitals. This is a multicenter cross-sectional study of children aged blood type and crossmatch were included when done on the day before or the day of the surgical procedure. The RBC transfusions included were those given on the day of or the day after surgery. The type and crossmatch-to-transfusion ratio (TCTR) was calculated for each surgical procedure. An adjusted model for interhospital variability was created to account for variation in patient population by age, sex, race/ethnicity, payer type, and presence/number of complex chronic conditions (CCCs) per patient. A total of 357 007 surgical interventions were identified across all participating hospitals. Blood type and crossmatch was performed 55 632 times, and 13 736 transfusions were provided, for a TCTR of 4:1. There was an association between increasing age and TCTR (R(2) = 0.43). Patients with multiple CCCs had lower TCTRs, with a stronger relationship (R(2) = 0.77). There was broad variability in adjusted TCTRs among hospitals (range, 2.5-25). The average TCTR in US children's hospitals was double that of adult surgical data, and was associated with wide interhospital variability. Age and the presence of CCCs markedly influenced this ratio. Studies to evaluate optimal preoperative RBC ordering and standardization of practices could potentially decrease unnecessary costs and wasted blood. Copyright © 2016 Elsevier Inc. All rights reserved.

  4. Comparing Book- and Tablet-Based Picture Activity Schedules: Acquisition and Preference.

    Science.gov (United States)

    Giles, Aimee; Markham, Victoria

    2017-09-01

    Picture activity schedules consist of a sequence of images representing the order of tasks for a person to complete. Although, picture activity schedules have traditionally been presented in a book format, recently picture activity schedules have been evaluated on technological devices such as an iPod™ touch. The present study compared the efficiency of picture activity schedule acquisition on book- and tablet-based modalities. In addition, participant preference for each modality was assessed. Three boys aged below 5 years with a diagnosis of autism participated. Participants were taught to follow the schedules using both modalities. Following mastery of each modality of picture activity schedule, a concurrent-chains preference assessment was conducted to evaluate participant preference for each modality. Differences in acquisition rates across the two modalities were marginal. Preference for book- or tablet-based schedules was idiosyncratic across participants.

  5. Manufacturing scheduling systems an integrated view on models, methods and tools

    CERN Document Server

    Framinan, Jose M; Ruiz García, Rubén

    2014-01-01

    The book is devoted to the problem of manufacturing scheduling, which is the efficient allocation of jobs (orders) over machines (resources) in a manufacturing facility. It offers a comprehensive and integrated perspective on the different aspects required to design and implement systems to efficiently and effectively support manufacturing scheduling decisions. Obtaining economic and reliable schedules constitutes the core of excellence in customer service and efficiency in manufacturing operations. Therefore, scheduling forms an area of vital importance for competition in manufacturing companies. However, only a fraction of scheduling research has been translated into practice, due to several reasons. First, the inherent complexity of scheduling has led to an excessively fragmented field in which different sub problems and issues are treated in an independent manner as goals themselves, therefore lacking a unifying view of the scheduling problem. Furthermore, mathematical brilliance and elegance has sometime...

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

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  7. Task-specific shell for scheduling problems, ARES[sub TM]/SCH. Scheduling mondai muke task tokka shell ARES[sub TM]/SCH

    Energy Technology Data Exchange (ETDEWEB)

    Kojima, S; Narimatsu, K [Toshiba Corp., Tokyo (Japan)

    1994-08-01

    An Expert System (ES) Shell (developed by Toshiba Corp.) which applies to the scheduling of production plan and operation plan is introduced. It describes that this tool is equipped with flowchart editor and constraint condition editor which mention the knowledge related to scheduling method, and that the former expresses scheduling procedure knowledge in the form of flowchart by combining basic tasks prepared beforehand, and the latter expresses constraint conditions which should be satisfied by the schedule, and knowledge related to the priority order which should be considered in-between in the form of IF-THEN Rule which is very close to Japanese. In addition, the knowledge is equipped with knowledge debugging system which conducts debugging while executing the knowledge. It adds that by using this tool, the manhour required for the development and maintenance of ES can be reduced considerably. 2 refs., 3 figs.

  8. Interruption of scheduled, automatic feeding and reduction of excess energy intake in toddlers.

    Science.gov (United States)

    Ciampolini, Mario; Brenna, J Thomas; Giannellini, Valerio; Bini, Stefania

    2013-01-01

    Childhood obesity due to the consumption of excess calories is a severe problem in developed countries. In a previous investigation on toddlers, hospital laboratory measurements showed an association of food-demand behavior with constant lower blood glucose before meals than for scheduled meals. We hypothesize that maternal scheduling of meals for toddlers results in excess energy intake compared to feeding only on demand (previously "on request"). We tested the cross-sectional null hypothesis of no difference in energy intake between scheduled (automatic) and demanded meals (administered after evaluation) in 24 mother-toddler (21 months old at entry) pairs with chronic, nonspecific diarrhea presenting at a clinic. We tested the same hypothesis in a subset of 14 toddlers by measuring the resting (sleeping) metabolic rate 4 hours after lunch, as well as the total daily energy expenditure (TEE) in 10 toddlers. We trained mothers to recognize meal demands (as in the previous investigation) and to provide food in response, but required no blood glucose measurements before meals. Energy intake was assessed by a 10-day food diary, resting metabolic rate (RMR) by respiratory analyses (indirect calorimetry) in 14 toddlers, and TEE by doubly labeled water in 10 toddlers. Their blood parameters, anthropometry, and number of days with diarrhea were assessed before training and 50 days after training. RMR decreased from 58.6 ± 7.8 to 49.0 ± 9.1 kcal/kg/d (P kcal/kg/d (P kcal/kg/d (P < 0.001). The height Z-score increased significantly, while weight growth was normal. Toddlers entering the study over the median RMR decreased their RMR significantly more than those below the median RMR (P < 0.01). Scheduled meal suspension induces meal demand frequency to increase. Demanded meals are associated with significantly lower energy intake, RMR, and TEE than scheduled meals. Feeding on demand may be an effective skill in a strategy for reducing excess energy intake in the long term

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  10. Blood transfusion requirement during caesarean delivery: Risk factors

    African Journals Online (AJOL)

    Background: Group specific blood is often cross-matched ready for all patients scheduled for caesarean section in anticipation of haemorrhage during the surgery. This study was conducted to determine the risk factors for blood transfusion during anaesthesia for caesarean section. Methods: This was a prospective ...

  11. Multiresource allocation and scheduling for periodic soft real-time applications

    Science.gov (United States)

    Gopalan, Kartik; Chiueh, Tzi-cker

    2001-12-01

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

  12. 76 FR 18262 - January 2011 Pay Schedules

    Science.gov (United States)

    2011-04-01

    ... an OPM memorandum, CPM 2009-27. (See http://www.opm.gov/oca/compmemo/index.asp .) Executive Order... Schedule ($165,300 in 2011, the same level as in 2010). On December 27, 2010, OPM issued a memorandum (CPM...

  13. A Review Of Fault Tolerant Scheduling In Multicore Systems

    Directory of Open Access Journals (Sweden)

    Shefali Malhotra

    2015-05-01

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

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

    Science.gov (United States)

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

    1986-09-01

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

  15. Medicare program; replacement of reasonable charge methodology by fee schedules for parenteral and enteral nutrients, equipment, and supplies. Final rule.

    Science.gov (United States)

    2001-08-28

    This final rule implements fee schedules for payment of parenteral and enteral nutrition (PEN) items and services furnished under the prosthetic device benefit, defined in section 1861(s)(8) of the Social Security Act. The authority for establishing these fee schedules is provided by the Balanced Budget Act of 1997, which amended the Social Security Act at section 1842(s). Section 1842(s) of the Social Security Act specifies that statewide or other area wide fee schedules may be implemented for the following items and services still subject to the reasonable charge payment methodology: medical supplies; home dialysis supplies and equipment; therapeutic shoes; parenteral and enteral nutrients, equipment, and supplies; electromyogram devices; salivation devices; blood products; and transfusion medicine. This final rule describes changes made to the proposed fee schedule payment methodology for these items and services and provides that the fee schedules for PEN items and services are effective for all covered items and services furnished on or after January 1, 2002. Fee schedules will not be implemented for electromyogram devices and salivation devices at this time since these items are not covered by Medicare. In addition, fee schedules will not be implemented for medical supplies, home dialysis supplies and equipment, therapeutic shoes, blood products, and transfusion medicine at this time since the data required to establish these fee schedules are inadequate.

  16. Time-critical multirate scheduling using contemporary real-time operating system services

    Science.gov (United States)

    Eckhardt, D. E., Jr.

    1983-01-01

    Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.

  17. A Nth-order linear algorithm for extracting diffuse correlation spectroscopy blood flow indices in heterogeneous tissues

    Energy Technology Data Exchange (ETDEWEB)

    Shang, Yu; Yu, Guoqiang, E-mail: guoqiang.yu@uky.edu [Department of Biomedical Engineering, University of Kentucky, Lexington, Kentucky 40506 (United States)

    2014-09-29

    Conventional semi-infinite analytical solutions of correlation diffusion equation may lead to errors when calculating blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements in tissues with irregular geometries. Very recently, we created an algorithm integrating a Nth-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in homogenous tissues with arbitrary geometries for extraction of BFI (i.e., αD{sub B}). The purpose of this study is to extend the capability of the Nth-order linear algorithm for extracting BFI in heterogeneous tissues with arbitrary geometries. The previous linear algorithm was modified to extract BFIs in different types of tissues simultaneously through utilizing DCS data at multiple source-detector separations. We compared the proposed linear algorithm with the semi-infinite homogenous solution in a computer model of adult head with heterogeneous tissue layers of scalp, skull, cerebrospinal fluid, and brain. To test the capability of the linear algorithm for extracting relative changes of cerebral blood flow (rCBF) in deep brain, we assigned ten levels of αD{sub B} in the brain layer with a step decrement of 10% while maintaining αD{sub B} values constant in other layers. Simulation results demonstrate the accuracy (errors < 3%) of high-order (N ≥ 5) linear algorithm in extracting BFIs in different tissue layers and rCBF in deep brain. By contrast, the semi-infinite homogenous solution resulted in substantial errors in rCBF (34.5% ≤ errors ≤ 60.2%) and BFIs in different layers. The Nth-order linear model simplifies data analysis, thus allowing for online data processing and displaying. Future study will test this linear algorithm in heterogeneous tissues with different levels of blood flow variations and noises.

  18. A Nth-order linear algorithm for extracting diffuse correlation spectroscopy blood flow indices in heterogeneous tissues

    International Nuclear Information System (INIS)

    Shang, Yu; Yu, Guoqiang

    2014-01-01

    Conventional semi-infinite analytical solutions of correlation diffusion equation may lead to errors when calculating blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements in tissues with irregular geometries. Very recently, we created an algorithm integrating a Nth-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in homogenous tissues with arbitrary geometries for extraction of BFI (i.e., αD B ). The purpose of this study is to extend the capability of the Nth-order linear algorithm for extracting BFI in heterogeneous tissues with arbitrary geometries. The previous linear algorithm was modified to extract BFIs in different types of tissues simultaneously through utilizing DCS data at multiple source-detector separations. We compared the proposed linear algorithm with the semi-infinite homogenous solution in a computer model of adult head with heterogeneous tissue layers of scalp, skull, cerebrospinal fluid, and brain. To test the capability of the linear algorithm for extracting relative changes of cerebral blood flow (rCBF) in deep brain, we assigned ten levels of αD B in the brain layer with a step decrement of 10% while maintaining αD B values constant in other layers. Simulation results demonstrate the accuracy (errors < 3%) of high-order (N ≥ 5) linear algorithm in extracting BFIs in different tissue layers and rCBF in deep brain. By contrast, the semi-infinite homogenous solution resulted in substantial errors in rCBF (34.5% ≤ errors ≤ 60.2%) and BFIs in different layers. The Nth-order linear model simplifies data analysis, thus allowing for online data processing and displaying. Future study will test this linear algorithm in heterogeneous tissues with different levels of blood flow variations and noises.

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

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet; Kosar, Tevfik

    2010-05-20

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

  20. Artificial intelligence techniques for scheduling Space Shuttle missions

    Science.gov (United States)

    Henke, Andrea L.; Stottler, Richard H.

    1994-01-01

    Planning and scheduling of NASA Space Shuttle missions is a complex, labor-intensive process requiring the expertise of experienced mission planners. We have developed a planning and scheduling system using combinations of artificial intelligence knowledge representations and planning techniques to capture mission planning knowledge and automate the multi-mission planning process. Our integrated object oriented and rule-based approach reduces planning time by orders of magnitude and provides planners with the flexibility to easily modify planning knowledge and constraints without requiring programming expertise.

  1. Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

    Science.gov (United States)

    Zoch, David R.

    1991-01-01

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

  2. On Multiple Users Scheduling Using Superposition Coding over Rayleigh Fading Channels

    KAUST Repository

    Zafar, Ammar

    2013-02-20

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

  3. Job shop scheduling with makespan objective: A heuristic approach

    Directory of Open Access Journals (Sweden)

    Mohsen Ziaee

    2014-04-01

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

  4. Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2009

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2009-01-20

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory for the U.S. Department of Energy. Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 450.1 and DOE Order 5400.5. This document contains the calendar year 2009 schedule for the routine collection of samples for the Surface Environmental Surveillance Project and Drinking Water Monitoring Project. Each section includes sampling locations, sampling frequencies, sample types, and analyses to be performed. In some cases, samples are scheduled on a rotating basis. If a sample will not be collected in 2009, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2009.

  5. Hanford site environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1998-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1 open-quotes General Environmental Protection Program,close quotes and DOE Order 5400.5, open-quotes Radiation Protection of the Public and the Environment.close quotes The sampling methods are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 2, U.S. Department of Energy, Richland, Washington. This document contains the 1998 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section of this document describes the planned sampling schedule for a specific media (air, surface water, biota, soil and vegetation, sediment, and external radiation). Each section includes the sample location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be planned for 1998 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing sample locations

  6. Request-Driven Schedule Automation for the Deep Space Network

    Science.gov (United States)

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

    2010-01-01

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

  7. Blood shortage situation: An audit of red blood cells order and ...

    African Journals Online (AJOL)

    PRECIOUS

    2009-11-02

    Nov 2, 2009 ... The objective of this work is to audit blood utilization by different specialties in the hospital using the. Cross-match ratio .... years, pre-operative haemoglobin of < 11 g/dl, locally advanced tumour, peri- .... Quality assurance of.

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

    Science.gov (United States)

    Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

    2018-04-01

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

  9. Goal programming for cyclical auxiliary police scheduling at UiTM Cawangan Perlis

    Science.gov (United States)

    Mustapar, Wasilatul Effah; Nasir, Diana Sirmayunie Mohd; Nor, Nor Azriani Mohamad; Abas, Sharifah Fhahriyah Syed

    2017-11-01

    Constructing a good and fair schedule for shift workers poses a great challenge as it requires a lot of time and effort. In this study, goal programming has been applied on scheduling to achieve the hard and soft constraints for a cyclical schedule that would ease the head of auxiliary police at building new schedules. To accomplish this goal, shift types were assigned in order to provide a fair schedule that takes into account the auxiliary police's policies and preferences. The model was run using Lingo software. Three out of four goals set for the study were achieved. In addition, the results considered an equal allocation for every auxiliary police, namely 70% for total duty and 30% for the day. Furthermore, the schedule was able to cyclically generate another 10 sets schedule. More importantly, the model has provided unbiased scheduling of auxiliary policies which led to high satisfaction in auxiliary police management.

  10. Changes in Blood Pressure and Heart Rate during Fixed-Interval Responding in Squirrel Monkeys

    Science.gov (United States)

    DeWeese, Jo

    2009-01-01

    Episodic and sustained increases in heart rate and mean arterial blood pressure can occur with recurring patterns of schedule-controlled behavior. Most previous studies were conducted under fixed-ratio schedules, which maintained a consistent high rate of responding that alternated with periods of no responding during times when the schedule was…

  11. Scheduling Production Orders, Taking into Account Delays and Waste

    Directory of Open Access Journals (Sweden)

    Dylewski Robert

    2014-09-01

    Full Text Available The article addresses the problem of determining the sequence of entering orders for production in a flexible manufacturing system implementing technological operations of cutting sheet metal. Adopting a specific ranking of production orders gives rise to the vector of delays and waste in the form of incompletely used sheets. A new method was postulated for determining the optimal sequence of orders in terms of two criteria: the total cost of delays and the amount of production waste. The examples illustrate the advantages of the proposed method compared with the popular heuristic principles.

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

    Science.gov (United States)

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

    2017-09-01

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

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

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

  15. Real-Time Scheduling for Preventing Information Leakage with Preemption Overheads

    Directory of Open Access Journals (Sweden)

    BAEK, H.

    2017-05-01

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

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

  17. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

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

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

    Science.gov (United States)

    2010-07-22

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

  19. Cloud computing task scheduling strategy based on improved differential evolution algorithm

    Science.gov (United States)

    Ge, Junwei; He, Qian; Fang, Yiqiu

    2017-04-01

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

  20. Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

    KAUST Repository

    Zafar, Ammar

    2012-09-16

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

  1. Direct block scheduling technology: Analysis of Avidity

    Directory of Open Access Journals (Sweden)

    Felipe Ribeiro Souza

    Full Text Available Abstract This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit. Each block is analyzed individually in order to define the best target period. This methodology presents an improvement of the classical methodology derived from Lerchs-Grossmann's initial proposition improved by Whittle. This paper presents the differences between these methodologies, specially focused on the algorithms' avidity. Avidity is classically defined by the voracious search algorithms, whereupon some of the most famous greedy algorithms are Branch and Bound, Brutal Force and Randomized. Strategies based on heuristics can accentuate the voracity of the optimizer system. The applied algorithm use simulated annealing combined with Tabu Search. The most avid algorithm can select the most profitable blocks in early periods, leading to higher present value in the first periods of mine operation. The application of discount factors to blocks on the Lerchs-Grossmann's final pit has an accentuated effect with time, and this effect may make blocks scheduled for the end of the mine life unfeasible, representing a trend to a decrease in reported reserves.

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

    Directory of Open Access Journals (Sweden)

    Mihai-Victor Micea

    2017-06-01

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

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

    Science.gov (United States)

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

    2017-06-26

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

  4. Locomotive Schedule Optimization for Da-qin Heavy Haul Railway

    Directory of Open Access Journals (Sweden)

    Ruiye Su

    2015-01-01

    Full Text Available The main difference between locomotive schedule of heavy haul railways and that of regular rail transportation is the number of locomotives utilized for one train. One heavy-loaded train usually has more than one locomotive, but a regular train only has one. This paper develops an optimization model for the multilocomotive scheduling problem (MLSP through analyzing the current locomotive schedule of Da-qin Railway. The objective function of our paper is to minimize the total number of utilized locomotives. The MLSP is nondeterministic polynomial (NP hard. Therefore, we convert the multilocomotive traction problem into a single-locomotive traction problem. Then, the single-locomotive traction problem (SLTP can be converted into an assignment problem. The Hungarian algorithm is applied to solve the model and obtain the optimal locomotive schedule. We use the variance of detention time of locomotives at stations to evaluate the stability of locomotive schedule. In order to evaluate the effectiveness of the proposed optimization model, case studies for 20 kt and 30 kt heavy-loaded combined trains on Da-qin Railway are both conducted. Compared to the current schedules, the optimal schedules from the proposed models can save 62 and 47 locomotives for 20 kt and 30 kt heavy-loaded combined trains, respectively. Therefore, the effectiveness of the proposed model and its solution algorithm are both valid.

  5. Flow-shop scheduling problem under uncertainties: Review and trends

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

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

  6. Interruption of scheduled, automatic feeding and reduction of excess energy intake in toddlers

    Directory of Open Access Journals (Sweden)

    Ciampolini M

    2013-01-01

    Full Text Available Mario Ciampolini,1 J Thomas Brenna,2 Valerio Giannellini,3 Stefania Bini11Preventive Gastroenterology Unit, Department of Paediatrics, Università di Firenze, Florence, Italy; 2Division of Nutritional Sciences, Cornell University, Ithaca, NY, USA; 3Department of Pharmaceutical Sciences, Università di Firenze, Florence, ItalyBackground: Childhood obesity due to the consumption of excess calories is a severe problem in developed countries. In a previous investigation on toddlers, hospital laboratory measurements showed an association of food-demand behavior with constant lower blood glucose before meals than for scheduled meals. We hypothesize that maternal scheduling of meals for toddlers results in excess energy intake compared to feeding only on demand (previously “on request”.Objective: We tested the cross-sectional null hypothesis of no difference in energy intake between scheduled (automatic and demanded meals (administered after evaluation in 24 mother–toddler (21 months old at entry pairs with chronic, nonspecific diarrhea presenting at a clinic. We tested the same hypothesis in a subset of 14 toddlers by measuring the resting (sleeping metabolic rate 4 hours after lunch, as well as the total daily energy expenditure (TEE in 10 toddlers.Methods: We trained mothers to recognize meal demands (as in the previous investigation and to provide food in response, but required no blood glucose measurements before meals. Energy intake was assessed by a 10-day food diary, resting metabolic rate (RMR by respiratory analyses (indirect calorimetry in 14 toddlers, and TEE by doubly labeled water in 10 toddlers. Their blood parameters, anthropometry, and number of days with diarrhea were assessed before training and 50 days after training.Results: RMR decreased from 58.6 ± 7.8 to 49.0 ± 9.1 kcal/kg/d (P < 0.001 and TEE decreased from 80.1 ± 6.9 to 67.8 ± 10.0 kcal/kg/d (P < 0.001. Energy intake decreased from 85.7 ± 15.3 to 70.3 ± 15.8 kcal

  7. Discrete Blood Glucose Control in Diabetic Göttingen Minipigs

    Directory of Open Access Journals (Sweden)

    Berno J.E. Misgeld

    2016-07-01

    Full Text Available Despite continuous research effort, patients with type 1 diabetes mellitus (T1D experience difficulties in daily adjustments of their blood glucose concentrations. New technological developments in the form of implanted intravenous infusion pumps and continuous blood glucose sensors might alleviate obstacles for the automatic adjustment of blood glucose concentration. These obstacles consist, for example, of large time-delays and insulin storage effects for the subcutaneous/interstitial route. Towards the goal of an artificial pancreas, we present a novel feedback controller approach that combines classical loop-shaping techniques with gain-scheduling and modern H ∞ -robust control approaches. A disturbance rejection design is proposed in discrete frequency domain based on the detailed model of the diabetic Göttingen minipig. The model is trimmed and linearised over a large operating range of blood glucose concentrations and insulin sensitivity values. Controller parameters are determined for each of these operating points. A discrete H ∞ loop-shaping compensator is designed to increase robustness of the artificial pancreas against general coprime factor uncertainty. The gain scheduled controller uses subcutaneous insulin injection as a control input and determines the controller input error from intravenous blood glucose concentration measurements, where parameter scheduling is achieved by an estimator of the insulin sensitivity parameter. Thus, only one controller stabilises a family of animal models. The controller is validated in silico with a total number of five Göttingen Minipig models, which were previously obtained by experimental identification procedures. Its performance is compared with an experimentally tested switching PI-controller.

  8. Blood test ordering for unexplained complaints in general practice: the VAMPIRE randomised clinical trial protocol. [ISRCTN55755886

    NARCIS (Netherlands)

    van Bokhoven, Marloes A.; Koch, Hèlen; van der Weijden, Trudy; Grol, Richard P. T. M.; Bindels, Patrick J. E.; Dinant, Geert-Jan

    2006-01-01

    BACKGROUND: General practitioners (GPs) frequently order blood tests when they see patients presenting with unexplained complaints. Due to the low prevalence of serious pathology in general practice, the risk of false-positive test results is relatively high. This may result in unnecessary further

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

    NARCIS (Netherlands)

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

    2010-01-01

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

  10. Comparison of heuristics for an economic lot scheduling problem with deliberated coproduction

    Directory of Open Access Journals (Sweden)

    Pilar I. Vidal-Carreras

    2009-12-01

    Full Text Available We built on the Economic Lot Scheduling Problem Scheduling (ELSP literature by making some modifications in order to introduce new constraints which had not been thoroughly studied with a view to simulating specific real situations. Specifically, our aim is to propose and simulate different scheduling policies for a new ELSP variant: Deliberated Coproduction. This problem comprises a product system in an ELSP environment in which we may choose if more than one product can be produced on the machine at a given time. We expressly consider the option of coproducing two products whose demand is not substitutable. In order to draw conclusions, a simulation model and its results were developed in the article by employing modified Bomberger data which include two items that could be produced simultaneously.

  11. Mathematical models for a batch scheduling problem to minimize earliness and tardiness

    Directory of Open Access Journals (Sweden)

    Basar Ogun

    2018-05-01

    Full Text Available Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of customer orders in the environment of lean manufacturing. The problem is to optimize partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components. Design/methodology/approach: Three different mathematical models for minimization of total earliness and tardiness of customer orders are developed to provide on-time completion of customer orders and also, to avoid from inventory of final products. The first model is a non-linear integer programming model while the second is a linearized version of the first. Finally, to solve larger sized instances of the problem, an alternative linear integer model is presented. Findings: Computational study using a suit set of test instances showed that the alternative linear integer model is able to solve all test instances in varying sizes within quite shorter computer times comparing to the other two models. It was also showed that the alternative model can solve moderate sized real-world problems. Originality/value: The problem under study differentiates from existing batch scheduling problems in the literature since it includes new circumstances which may arise in real-world applications. This research, also, contributes the literature of batch scheduling problem by presenting new optimization models.

  12. Manufacturing Technology Support (MATES). Delivery Order 0002: Business Practices Assessment (BPA) Development

    Science.gov (United States)

    2008-03-01

    order fulfillment visibility, Kanban deployment, inventory count can be made visually, machines and tool labeling, costs, preventive maintenance...order fulfillment, computer scheduling versus Kanban , pull versus push systems, flow time efficiencies, back room costs of scheduling, MRP costs

  13. Downlink scheduling using non-orthogonal uplink beams

    KAUST Repository

    Eltayeb, Mohammed E.

    2014-04-01

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

  14. Downlink scheduling using non-orthogonal uplink beams

    KAUST Repository

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

    2014-01-01

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

  15. Fractional order models of viscoelasticity as an alternative in the analysis of red blood cell (RBC) membrane mechanics.

    Science.gov (United States)

    Craiem, Damian; Magin, Richard L

    2010-01-20

    New lumped-element models of red blood cell mechanics can be constructed using fractional order generalizations of springs and dashpots. Such 'spring-pots' exhibit a fractional order viscoelastic behavior that captures a wide spectrum of experimental results through power-law expressions in both the time and frequency domains. The system dynamics is fully described by linear fractional order differential equations derived from first order stress-strain relationships using the tools of fractional calculus. Changes in the composition or structure of the membrane are conveniently expressed in the fractional order of the model system. This approach provides a concise way to describe and quantify the biomechanical behavior of membranes, cells and tissues.

  16. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

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

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

  17. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

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

    2008-01-01

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

  18. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

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

  19. Patient blood management -- the GP's guide.

    Science.gov (United States)

    Minck, Sandra; Robinson, Kathryn; Saxon, Ben; Spigiel, Tracey; Thomson, Amanda

    2013-05-01

    There is accumulating evidence of a strong association between blood transfusion and adverse patient outcomes. Patient blood management aims to achieve improved patient outcomes by avoiding unnecessary exposure to blood products through effective conservation and management of a patient's own blood. To introduce the general practitioner's role in patient blood management. There are a number of ways in which GPs can contribute to patient blood management, particularly in the care of patients scheduled for elective surgery. These include awareness, identification, investigation and management of patients with or at risk of anaemia; assessment of the adequacy of iron stores in patients undergoing planned procedures in which substantial blood loss is anticipated; awareness and assessment of medications and complementary medicines that might increase bleeding risk; and awareness of and ability to discuss with patients, the possible risks associated with blood transfusion and alternatives that may be available.

  20. Low-Energy Real-Time OS Using Voltage Scheduling Algorithm for Variable Voltage Processors

    OpenAIRE

    Okuma, Takanori; Yasuura, Hiroto

    2001-01-01

    This paper presents a real-time OS based on $ mu $ITRON using proposed voltage scheduling algorithm for variable voltage processors which can vary supply voltage dynamically. The proposed voltage scheduling algorithms assign voltage level for each task dynamically in order to minimize energy consumption under timing constraints. Using the presented real-time OS, running tasks with low supply voltage leads to drastic energy reduction. In addition, the presented voltage scheduling algorithm is ...

  1. Hypergraph+: An Improved Hypergraph-Based Task-Scheduling Algorithm for Massive Spatial Data Processing on Master-Slave Platforms

    Directory of Open Access Journals (Sweden)

    Bo Cheng

    2016-08-01

    Full Text Available Spatial data processing often requires massive datasets, and the task/data scheduling efficiency of these applications has an impact on the overall processing performance. Among the existing scheduling strategies, hypergraph-based algorithms capture the data sharing pattern in a global way and significantly reduce total communication volume. Due to heterogeneous processing platforms, however, single hypergraph partitioning for later scheduling may be not optimal. Moreover, these scheduling algorithms neglect the overlap between task execution and data transfer that could further decrease execution time. In order to address these problems, an extended hypergraph-based task-scheduling algorithm, named Hypergraph+, is proposed for massive spatial data processing. Hypergraph+ improves upon current hypergraph scheduling algorithms in two ways: (1 It takes platform heterogeneity into consideration offering a metric function to evaluate the partitioning quality in order to derive the best task/file schedule; and (2 It can maximize the overlap between communication and computation. The GridSim toolkit was used to evaluate Hypergraph+ in an IDW spatial interpolation application on heterogeneous master-slave platforms. Experiments illustrate that the proposed Hypergraph+ algorithm achieves on average a 43% smaller makespan than the original hypergraph scheduling algorithm but still preserves high scheduling efficiency.

  2. Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

    KAUST Repository

    Celik, Abdulkadir; Kamal, Ahmed E.

    2016-01-01

    the homogeneity assumption. Based on these, a prioritized ordering heuristic is developed to order channels under the spectrum, energy, and spectrum-energy limited regimes. After that, a scheduling and assignment heuristic is proposed and is shown to perform very

  3. Analysis of Sleep-Mode Downlink Scheduling Operations in EPON Systems

    OpenAIRE

    Yan, Ying; Dittmann, Lars

    2011-01-01

    Energy management strategy has been considered as an important component in the future Ethernet Passive Optical Networks (EPONs). In this paper, a sleeping mode operation is studied, and a downlink packet scheduling scheme is analyzed to preserve energy consumption and maintain the required QoS. This paper proposes a novel sleep-mode downlink packet scheduling scheme in order to enhance the sleep control function. Simulation results confirm that the proposed approach offers effective power ma...

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

    Directory of Open Access Journals (Sweden)

    Maikel L. van Eck

    2017-10-01

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

  5. Master schedule for CY-1982 Hanford environmental surveillance routine program

    International Nuclear Information System (INIS)

    Blumer, P.J.; Sula, M.J.; Eddy, P.A.

    1981-12-01

    This report provides the current schedule of data collection for the routine environmental surveillance program at the Hanford Site. The environmental surveillance program objectives are to evaluate and report the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5484.1. The routine sampling schedule provided does not include samples which are planned to be collected during FY-1982 in support of special studies or for quality control purposes. In addition, the routine program outlined in this schedule is subject to modification during the year in response to changes in Site operations, program requirements, or unusual sample results. Sampling schedules are presented for the following: air; Columbia River; sanitary water; surface water; ground water; foodstuffs; wildlife; soil and vegetation; external radiation measurements; portable instrument surveys; and surveillance of waste disposal sites

  6. One System for Blood Program Information Management

    Science.gov (United States)

    Gero, Michael G.; Klickstein, Judith S.; Hurst, Timm M.

    1980-01-01

    A system which integrates the diverse functions of a Blood Program within one structure is being assembled at the American National Red Cross Blood Services, Northeast Region. When finished, it will provide technical support for collection scheduling, donor recruitment, recordkeeping, laboratory processing, inventory management, HLA typing and matching, distribution, and administration within the Program. By linking these applications, a reporting structure useful to top management will be provided.

  7. DEVELOPMENT OF A MAINTENANCE SCHEDULING MODEL FOR ...

    African Journals Online (AJOL)

    ... of minor maintenance, for each machine within this time span. In order to minimize the total cost of repairs and production. A numerical application of this development model in a case study is presented. Key words: Maintenance, modeling, scheduling, optimization. [Global Jnl Engineering Res. Vol.1(2) 2002: 107-118] ...

  8. Web Publishing Schedule

    Science.gov (United States)

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

  9. On the number of different dynamics in Boolean networks with deterministic update schedules.

    Science.gov (United States)

    Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

    2013-04-01

    Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

  10. Scheduling of resource-constrained projects

    CERN Document Server

    Klein, Robert

    2000-01-01

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

  11. A Nth-order linear algorithm for extracting diffuse correlation spectroscopy blood flow indices in heterogeneous tissues.

    Science.gov (United States)

    Shang, Yu; Yu, Guoqiang

    2014-09-29

    Conventional semi-infinite analytical solutions of correlation diffusion equation may lead to errors when calculating blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements in tissues with irregular geometries. Very recently, we created an algorithm integrating a N th-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in homogenous tissues with arbitrary geometries for extraction of BFI (i.e., αD B ). The purpose of this study is to extend the capability of the N th-order linear algorithm for extracting BFI in heterogeneous tissues with arbitrary geometries. The previous linear algorithm was modified to extract BFIs in different types of tissues simultaneously through utilizing DCS data at multiple source-detector separations. We compared the proposed linear algorithm with the semi-infinite homogenous solution in a computer model of adult head with heterogeneous tissue layers of scalp, skull, cerebrospinal fluid, and brain. To test the capability of the linear algorithm for extracting relative changes of cerebral blood flow (rCBF) in deep brain, we assigned ten levels of αD B in the brain layer with a step decrement of 10% while maintaining αD B values constant in other layers. Simulation results demonstrate the accuracy (errors model simplifies data analysis, thus allowing for online data processing and displaying. Future study will test this linear algorithm in heterogeneous tissues with different levels of blood flow variations and noises.

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

    Science.gov (United States)

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

    2016-01-01

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

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

  14. Fractional order models of viscoelasticity as an alternative in the analysis of red blood cell (RBC) membrane mechanics

    International Nuclear Information System (INIS)

    Craiem, Damian; Magin, Richard L

    2010-01-01

    New lumped-element models of red blood cell mechanics can be constructed using fractional order generalizations of springs and dashpots. Such 'spring-pots' exhibit a fractional order viscoelastic behavior that captures a wide spectrum of experimental results through power-law expressions in both the time and frequency domains. The system dynamics is fully described by linear fractional order differential equations derived from first order stress–strain relationships using the tools of fractional calculus. Changes in the composition or structure of the membrane are conveniently expressed in the fractional order of the model system. This approach provides a concise way to describe and quantify the biomechanical behavior of membranes, cells and tissues. (perspective)

  15. Hanford Site Environmental Surveillance Master Sampling Schedule for Calendar Year 2008

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2008-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by Pacific Northwest National Laboratory for the U.S. Department of Energy. Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 450.1, "Environmental Protection Program," and DOE Order 5400.5, "Radiation Protection of the Public and the Environment." The environmental surveillance sampling design is described in the "Hanford Site Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office." This document contains the calendar year 2008 schedule for the routine collection of samples for the Surface Environmental Surveillance Project and Drinking Water Monitoring Project. Each section includes sampling locations, sampling frequencies, sample types, and analyses to be performed. In some cases, samples are scheduled on a rotating basis. If a sample will not be collected in 2008, the anticipated year for collection is provided. Maps showing approximate sampling locations are included for media scheduled for collection in 2008.

  16. Size-based scheduling to improve web performance

    NARCIS (Netherlands)

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

    2003-01-01

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

  17. Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

    Science.gov (United States)

    Cruz-Chávez, Marco Antonio

    2015-11-01

    This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.

  18. A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

    Science.gov (United States)

    Xie, Zhiqiang; Shao, Xia; Xin, Yu

    2016-01-01

    To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

  19. Changed nursing scheduling for improved safety culture and working conditions - patients' and nurses' perspectives.

    Science.gov (United States)

    Kullberg, Anna; Bergenmar, Mia; Sharp, Lena

    2016-05-01

    To evaluate fixed scheduling compared with self-scheduling for nursing staff in oncological inpatient care with regard to patient and staff outcomes. Various scheduling models have been tested to attract and retain nursing staff. Little is known about how these schedules affect staff and patients. Fixed scheduling and self-scheduling have been studied to a small extent, solely from a staff perspective. We implemented fixed scheduling on two of four oncological inpatient wards. Two wards kept self-scheduling. Through a quasi-experimental design, baseline and follow-up measurements were collected among staff and patients. The Safety Attitudes Questionnaire was used among staff, as well as study-specific questions for patients and staff. Fixed scheduling was associated with less overtime and fewer possibilities to change shifts. Self-scheduling was associated with more requests from management for short notice shift changes. The type of scheduling did not affect patient-reported outcomes. Fixed scheduling should be considered in order to lower overtime. Further research is necessary and should explore patient outcomes to a greater extent. Scheduling is a core task for nurse managers. Our study suggests fixed scheduling as a strategy for managers to improve the effective use of resources and safety. © 2016 John Wiley & Sons Ltd.

  20. An Improved Scheduling Technique for Time-Triggered Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    1999-01-01

    clock synchronization and mode changes. We have improved the quality of the schedules by introducing a new priority function that takes into consideration the communication protocol. Communication has been optimized through packaging messages into slots with a properly selected order and lengths......In this paper we present an improved scheduling technique for the synthesis of time-triggered embedded systems. Our system model captures both the flow of data and that of control. We have considered communication of data and conditions for a time-triggered protocol implementation that supports...

  1. Time-Dependent Drug Administration in Hypertension and its Effect on Blood Pressure Variability

    OpenAIRE

    Magdás Annamária; Podoleanu Cristian; Tusa Anna-Boróka; Găburoi Adina; Incze Alexandru

    2017-01-01

    Background: Optimizing blood pressure variability seems to represent a new therapeutic target in the management of hypertension. It is emphasized that scheduling at least one antihypertensive agent at bedtime, has the ability to reduce blood pressure.

  2. Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

    International Nuclear Information System (INIS)

    Kim, Woojoong; Ryu, Dongsoo; Jung, Youngsoo

    2014-01-01

    Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation

  3. Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Woojoong, E-mail: minidung@nate.com [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Ryu, Dongsoo, E-mail: energyboy@khnp.co.kr [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Jung, Youngsoo, E-mail: yjung97@mju.ac.kr [College of Architecture, Myongji University, Yongin 449-728 (Korea, Republic of)

    2014-04-01

    Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation.

  4. Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Noor Hasnah Moin

    2015-01-01

    Full Text Available The job shop scheduling problem (JSSP is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover (EPPX is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.

  5. Multi-objective scheduling of electric vehicles in smart distribution system

    International Nuclear Information System (INIS)

    Zakariazadeh, Alireza; Jadid, Shahram; Siano, Pierluigi

    2014-01-01

    Highlights: • Environmental/economic operational scheduling of electric vehicles. • The Vehicle to Grid capability and the actual patterns of drivers are considered. • A novel conceptual model for an electric vehicle management system is proposed. - Abstract: When preparing for the widespread adoption of Electric Vehicles (EVs), an important issue is to use a proper EVs’ charging/discharging scheduling model that is able to simultaneously consider economic and environmental goals as well as technical constraints of distribution networks. This paper proposes a multi-objective operational scheduling method for charging/discharging of EVs in a smart distribution system. The proposed multi-objective framework, based on augmented ε-constraint method, aims at minimizing the total operational costs and emissions. The Vehicle to Grid (V2G) capability as well as the actual patterns of drivers are considered in order to generate the Pareto-optimal solutions. The Benders decomposition technique is used in order to solve the proposed optimization model and to convert the large scale mixed integer nonlinear problem into mixed-integer linear programming and nonlinear programming problems. The effectiveness of the proposed resources scheduling approach is tested on a 33-bus distribution test system over a 24-h period. The results show that the proposed EVs’ charging/discharging method can reduce both of operation cost and air pollutant emissions

  6. Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

    KAUST Repository

    Zafar, Ammar

    2013-09-01

    In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

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

    Science.gov (United States)

    2010-07-01

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

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

  9. Dynamic Appliances Scheduling in Collaborative MicroGrids System

    Science.gov (United States)

    Bilil, Hasnae; Aniba, Ghassane; Gharavi, Hamid

    2017-01-01

    In this paper a new approach which is based on a collaborative system of MicroGrids (MG’s), is proposed to enable household appliance scheduling. To achieve this, appliances are categorized into flexible and non-flexible Deferrable Loads (DL’s), according to their electrical components. We propose a dynamic scheduling algorithm where users can systematically manage the operation of their electric appliances. The main challenge is to develop a flattening function calculus (reshaping) for both flexible and non-flexible DL’s. In addition, implementation of the proposed algorithm would require dynamically analyzing two successive multi-objective optimization (MOO) problems. The first targets the activation schedule of non-flexible DL’s and the second deals with the power profiles of flexible DL’s. The MOO problems are resolved by using a fast and elitist multi-objective genetic algorithm (NSGA-II). Finally, in order to show the efficiency of the proposed approach, a case study of a collaborative system that consists of 40 MG’s registered in the load curve for the flattening program has been developed. The results verify that the load curve can indeed become very flat by applying the proposed scheduling approach. PMID:28824226

  10. 48 CFR 8.405-2 - Ordering procedures for services requiring a statement of work.

    Science.gov (United States)

    2010-10-01

    ... criteria (e.g., experience and past performance), to schedule contractors that offer services that will...) Orders at, or below, the micro-purchase threshold. Ordering activities may place orders at, or below, the micro-purchase threshold with any Federal Supply Schedule contractor that can meet the agency's needs...

  11. Hanford Site Environmental Surveillance Master Sampling Schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1999-01-01

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

  12. A Study on the Optimum Bucket Size for Master Scheduling : For the Case of Hierarchically tured Products

    OpenAIRE

    木内, 正光

    2010-01-01

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

  13. Modelling a Nurse Shift Schedule with Multiple Preference Ranks for Shifts and Days-Off

    Directory of Open Access Journals (Sweden)

    Chun-Cheng Lin

    2014-01-01

    Full Text Available When it comes to nurse shift schedules, it is found that the nursing staff have diverse preferences about shift rotations and days-off. The previous studies only focused on the most preferred work shift and the number of satisfactory days-off of the schedule at the current schedule period but had few discussions on the previous schedule periods and other preference levels for shifts and days-off, which may affect fairness of shift schedules. As a result, this paper proposes a nurse scheduling model based upon integer programming that takes into account constraints of the schedule, different preference ranks towards each shift, and the historical data of previous schedule periods to maximize the satisfaction of all the nursing staff's preferences about the shift schedule. The main contribution of the proposed model is that we consider that the nursing staff’s satisfaction level is affected by multiple preference ranks and their priority ordering to be scheduled, so that the quality of the generated shift schedule is more reasonable. Numerical results show that the planned shifts and days-off are fair and successfully meet the preferences of all the nursing staff.

  14. Problem specific heuristics for group scheduling problems in cellular manufacturing

    OpenAIRE

    Neufeld, Janis Sebastian

    2016-01-01

    The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem spec...

  15. Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network

    Directory of Open Access Journals (Sweden)

    Kazuhiko Hiramoto

    2018-01-01

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

  16. Time-Dependent Drug Administration in Hypertension and its Effect on Blood Pressure Variability

    Directory of Open Access Journals (Sweden)

    Magdás Annamária

    2017-06-01

    Full Text Available Background: Optimizing blood pressure variability seems to represent a new therapeutic target in the management of hypertension. It is emphasized that scheduling at least one antihypertensive agent at bedtime, has the ability to reduce blood pressure.

  17. Optimizing donor scheduling before recruitment: An effective approach to increasing apheresis platelet collections.

    Science.gov (United States)

    Lokhandwala, Parvez M; Shike, Hiroko; Wang, Ming; Domen, Ronald E; George, Melissa R

    2018-01-01

    Typical approach for increasing apheresis platelet collections is to recruit new donors. Here, we investigated the effectiveness of an alternative strategy: optimizing donor scheduling, prior to recruitment, at a hospital-based blood donor center. Analysis of collections, during the 89 consecutive months since opening of donor center, was performed. Linear regression and segmented time-series analyses were performed to calculate growth rates of collections and to test for statistical differences, respectively. Pre-intervention donor scheduling capacity was 39/month. In the absence of active donor recruitment, during the first 29 months, the number of collections rose gradually to 24/month (growth-rate of 0.70/month). However, between month-30 and -55, collections exhibited a plateau at 25.6 ± 3.0 (growth-rate of -0.09/month) (pcollection days/week (month-72). Consequently, the scheduling capacity increased to 130/month. Post-interventions, apheresis platelet collections between month-56 and -81 exhibited a spontaneous renewed growth at a rate of 0.62/month (pcollections. Apheresis platelet collections plateau at nearly 2/3rd of the scheduling capacity. Optimizing the scheduling capacity prior to active donor recruitment is an effective strategy to increase platelet collections at a hospital-based donor center.

  18. Multiple R&D projects scheduling optimization with improved particle swarm algorithm.

    Science.gov (United States)

    Liu, Mengqi; Shan, Miyuan; Wu, Juan

    2014-01-01

    For most enterprises, in order to win the initiative in the fierce competition of market, a key step is to improve their R&D ability to meet the various demands of customers more timely and less costly. This paper discusses the features of multiple R&D environments in large make-to-order enterprises under constrained human resource and budget, and puts forward a multi-project scheduling model during a certain period. Furthermore, we make some improvements to existed particle swarm algorithm and apply the one developed here to the resource-constrained multi-project scheduling model for a simulation experiment. Simultaneously, the feasibility of model and the validity of algorithm are proved in the experiment.

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

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

    DEFF Research Database (Denmark)

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

    2006-01-01

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

  1. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

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

  2. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

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

  3. 21 CFR 1305.21 - Requirements for electronic orders.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Requirements for electronic orders. 1305.21... I AND II CONTROLLED SUBSTANCES Electronic Orders § 1305.21 Requirements for electronic orders. (a) To be valid, the purchaser must sign an electronic order for a Schedule I or II controlled substance...

  4. Evaluating irrigation scheduling of hydroponic tomato in Navarra, Spain

    NARCIS (Netherlands)

    Lizarraga, H.J.; Boesveld, H.; Huibers, F.P.; Robles, H.

    2003-01-01

    The correct supply of water and nutrients is important in hydroponic growing systems in order to use water efficiently, avoid stress situations, and control production. The present study was conducted to evaluate two irrigation scheduling techniques for hydroponic tomato production in Navarra,

  5. Perceptions of randomized security schedules.

    Science.gov (United States)

    Scurich, Nicholas; John, Richard S

    2014-04-01

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

  6. Proposing New Heuristic Approaches for Preventive Maintenance Scheduling

    Directory of Open Access Journals (Sweden)

    majid Esmailian

    2013-08-01

    Full Text Available The purpose of preventive maintenance management is to perform a series of tasks that prevent or minimize production breakdowns and improve reliability of production facilities. An important objective of preventive maintenance management is to minimize downtime of production facilities. In order to accomplish this objective, personnel should efficiently allocate resources and determine an effective maintenance schedule. Gopalakrishnan (1997 developed a mathematical model and four heuristic approaches to solve the preventive maintenance scheduling problem of assigning skilled personnel to work with tasks that require a set of corresponding skills. However, there are several limitations in the prior work in this area of research. The craft combination problem has not been solved because the craft combination is assumed as given. The craft combination problem concerns the computation of all combinations of assigning multi skilled workers to accomplishment of a particular task. In fact, determining craft combinations is difficult because of the exponential number of craft combinations that are possible. This research provides a heuristic approach for determining the craft combination and four new heuristic approach solution for the preventive maintenance scheduling problem with multi skilled workforce constraints. In order to examine the new heuristic approach and to compare the new heuristic approach with heuristic approach of Gopalakrishnan (1997, 81 standard problems have been generated based on the criterion suggested by from Gopalakrishnan (1997. The average solution quality (SQ of the new heuristic approaches is 1.86% and in old heuristic approaches is 8.32%. The solution time of new heuristic approaches are shorter than old heuristic approaches. The solution time of new heuristic approaches is 0.78 second and old heuristic approaches is 6.43 second, but the solution time of mathematical model provided by Gopalakrishnan (1997 is 152 second.

  7. Safe transition to surgery: working differently to make blood transfusion process safer for elective surgery.

    Science.gov (United States)

    Badjie, Karafa S W; Rogers, James C; Jenkins, Sarah M; Bundy, Kevin L; Stubbs, James R; Cima, Robert R

    2015-09-01

    Our institutional policy allows patients who are scheduled for elective surgery with no history of a pregnancy or blood transfusion in the preceding 3 months to have a presurgical sample (PSS) collected and tested up to 56 days before their scheduled surgery; however, our PSS TS completion rate in eligible patients before the morning of surgery was 83%. In 2011, a team was charged to develop a standardized process along with other process improvements while ensuring no increase in transfusion-related events. The team followed the DMAIC framework in appraising the effectiveness and efficiency of the current state process including baseline data collection such as PSS TS completion rate, number of eligible patients needing a PSS TS on the day of surgery, benchmarking, SSBO utilization, and future state mapping. First quarter (Q1) 2011 versus Q1 2012 postimplementation results showed significant improvements of the process including a 53% decrease in PSS TS on the day of surgery; a 13% increase in PSS TS completion before the morning of surgery; a 26% reduction in total XM RBCs; and a 58.8% reduction in XM RBCs not issued, plus a 47% decrease in RBC wastage. Q1 2011 versus Q1 2013 showed a 41% reduction in total XM RBCs and an 88.4% reduction in XM RBCs not issued but overall RBCs issued versus returned increased slightly and represents a future opportunity for improvement. The redesigned, transformational process eliminated SSBO and improved ordering process and PSS TS completion rate as well as blood product ordering and utilization. © 2015 AABB.

  8. Prioritizing sleep for healthy work schedules

    Science.gov (United States)

    2012-01-01

    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. PMID:22738292

  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. Prioritizing sleep for healthy work schedules.

    Science.gov (United States)

    Takahashi, Masaya

    2012-03-13

    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.

  11. Hanford Environmental Monitoring Program schedule for samples, analyses, and measurements for calendar year 1985

    International Nuclear Information System (INIS)

    Blumer, P.J.; Price, K.R.; Eddy, P.A.; Carlile, J.M.V.

    1984-12-01

    This report provides the CY 1985 schedule of data collection for the routine Hanford Surface Environmental Monitoring and Ground-Water Monitoring Programs at the Hanford Site. The purpose is to evaluate and report the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5484.1. The routine sampling schedule provided herein does not include samples scheduled to be collected during FY 1985 in support of special studies, special contractor support programs, or for quality control purposes. In addition, the routine program outlined in this schedule is subject to modification during the year in response to changes in site operations, program requirements, or unusual sample results

  12. Production planning and scheduling in refinery industry

    International Nuclear Information System (INIS)

    Persson, Jan.

    1999-01-01

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

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

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

  15. A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Hamed Piroozfard

    2016-01-01

    Full Text Available Scheduling is considered as an important topic in production management and combinatorial optimization in which it ubiquitously exists in most of the real-world applications. The attempts of finding optimal or near optimal solutions for the job shop scheduling problems are deemed important, because they are characterized as highly complex and NP-hard problems. This paper describes the development of a hybrid genetic algorithm for solving the nonpreemptive job shop scheduling problems with the objective of minimizing makespan. In order to solve the presented problem more effectively, an operation-based representation was used to enable the construction of feasible schedules. In addition, a new knowledge-based operator was designed based on the problem’s characteristics in order to use machines’ idle times to improve the solution quality, and it was developed in the context of function evaluation. A machine based precedence preserving order-based crossover was proposed to generate the offspring. Furthermore, a simulated annealing based neighborhood search technique was used to improve the local exploitation ability of the algorithm and to increase its population diversity. In order to prove the efficiency and effectiveness of the proposed algorithm, numerous benchmarked instances were collected from the Operations Research Library. Computational results of the proposed hybrid genetic algorithm demonstrate its effectiveness.

  16. Analysis of Sleep-Mode Downlink Scheduling Operations in EPON Systems

    DEFF Research Database (Denmark)

    Yan, Ying; Dittmann, Lars

    2011-01-01

    Energy management strategy has been considered as an important component in the future Ethernet Passive Optical Networks (EPONs). In this paper, a sleeping mode operation is studied, and a downlink packet scheduling scheme is analyzed to preserve energy consumption and maintain the required Qo......S. This paper proposes a novel sleep-mode downlink packet scheduling scheme in order to enhance the sleep control function. Simulation results confirm that the proposed approach offers effective power management on the basis of the traffic conditions. The trade-off between network performances and the power...

  17. Economic-environmental energy and reserve scheduling of smart distribution systems: A multiobjective mathematical programming approach

    International Nuclear Information System (INIS)

    Zakariazadeh, Alireza; Jadid, Shahram; Siano, Pierluigi

    2014-01-01

    Highlights: • Environmental/economical scheduling of energy and reserve. • Simultaneous participation of loads in both energy and reserve scheduling. • Aggregate wind generation and demand uncertainties in a stochastic model. • Stochastic scheduling of energy and reserve in a distribution system. • Demand response providers’ participation in energy and reserve scheduling. - Abstract: In this paper a stochastic multi-objective economical/environmental operational scheduling method is proposed to schedule energy and reserve in a smart distribution system with high penetration of wind generation. The proposed multi-objective framework, based on augmented ε-constraint method, is used to minimize the total operational costs and emissions and to generate Pareto-optimal solutions for the energy and reserve scheduling problem. Moreover, fuzzy decision making process is employed to extract one of the Pareto-optimal solutions as the best compromise non-dominated solution. The wind power and demand forecast errors are considered in this approach and the reserve can be furnished by the main grid as well as distributed generators and responsive loads. The consumers participate in both energy and reserve markets using various demand response programs. In order to facilitate small and medium loads participation in demand response programs, a Demand Response Provider (DRP) aggregates offers for load reduction. In order to solve the proposed optimization model, the Benders decomposition technique is used to convert the large scale mixed integer non-linear problem into mixed-integer linear programming and non-linear programming problems. The effectiveness of the proposed scheduling approach is verified on a 41-bus distribution test system over a 24-h period

  18. Postulated licensing schedule for an independent spent-fuel-storage installation

    International Nuclear Information System (INIS)

    Ludwick, J.D.

    1982-11-01

    A review of licensing requirements, processes, and anticipated actions for independent spent fuel storage installations (ISFSIs) was conducted in order to develop an estimated schedule and sequence of events for licensing a new ISFSI. This estimate will be useful to potential ISFSI owners in planning for the licensing of their facilities. It is concluded that, although many uncertainties exist with respect to such things as legal appeals, about 29 months are estimated to elapse between license application and license issuance for an ISFSI. This estimate is in reasonable agreement with a previous time estimate for licensing an ISFSI, and, taking into account the special circumstances involved, with the actual licensing schedule for the GE-Morris ISFSI. However, individual portions of the licensing schedule from each case studied sometimes vary significantly

  19. Blood Donation Process

    Science.gov (United States)

    ... Drive Biomedical Services Hospital Partners Blood Products Blood Banking Resources Order Blood Products Invoice Central Case Reports ... Speed up your donation by completing a RapidPass® online or on the Blood Donor app on the ...

  20. A note on simulated annealing to computer laboratory scheduling ...

    African Journals Online (AJOL)

    The concepts, principles and implementation of simulated Annealing as a modem heuristic technique is presented. Simulated Annealing algorithm is used in solving real life problem of Computer Laboratory scheduling in order to maximize the use of scarce and insufficient resources. KEY WORDS: Simulated Annealing ...

  1. Streaming system scheduling for Xeon Phi

    OpenAIRE

    Faltín, Tomáš

    2017-01-01

    Task scheduling in operating system area is a well-known problem on traditional system architectures (NUMA, SMP). Unfortunately, it does not perform well on emerging many-core architectures, especially on Intel Xeon Phi. We collected all publicly available information about the architecture of Xeon Phi. After that, we benchmarked the Xeon Phi in order to find the missing information about its architecture. We focused especially on the information about cores and memory controllers. These are ...

  2. Overlap Algorithms in Flexible Job-shop Scheduling

    Directory of Open Access Journals (Sweden)

    Celia Gutierrez

    2014-06-01

    Full Text Available The flexible Job-shop Scheduling Problem (fJSP considers the execution of jobs by a set of candidate resources while satisfying time and technological constraints. This work, that follows the hierarchical architecture, is based on an algorithm where each objective (resource allocation, start-time assignment is solved by a genetic algorithm (GA that optimizes a particular fitness function, and enhances the results by the execution of a set of heuristics that evaluate and repair each scheduling constraint on each operation. The aim of this work is to analyze the impact of some algorithmic features of the overlap constraint heuristics, in order to achieve the objectives at a highest degree. To demonstrate the efficiency of this approach, experimentation has been performed and compared with similar cases, tuning the GA parameters correctly.

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

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

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

  4. An Extended Genetic Algorithm for Distributed Integration of Fuzzy Process Planning and Scheduling

    Directory of Open Access Journals (Sweden)

    Shuai Zhang

    2016-01-01

    Full Text Available The distributed integration of process planning and scheduling (DIPPS aims to simultaneously arrange the two most important manufacturing stages, process planning and scheduling, in a distributed manufacturing environment. Meanwhile, considering its advantage corresponding to actual situation, the triangle fuzzy number (TFN is adopted in DIPPS to represent the machine processing and transportation time. In order to solve this problem and obtain the optimal or near-optimal solution, an extended genetic algorithm (EGA with innovative three-class encoding method, improved crossover, and mutation strategies is proposed. Furthermore, a local enhancement strategy featuring machine replacement and order exchange is also added to strengthen the local search capability on the basic process of genetic algorithm. Through the verification of experiment, EGA achieves satisfactory results all in a very short period of time and demonstrates its powerful performance in dealing with the distributed integration of fuzzy process planning and scheduling (DIFPPS.

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

    Science.gov (United States)

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

    2016-02-01

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

  6. First-order differential-delay equation for the baroreflex predicts the 0.4-Hz blood pressure rhythm in rats.

    Science.gov (United States)

    Burgess, D E; Hundley, J C; Li, S G; Randall, D C; Brown, D R

    1997-12-01

    We have described a 0.4-Hz rhythm in renal sympathetic nerve activity (SNA) that is tightly coupled to 0.4-Hz oscillations in blood pressure in the unanesthetized rat. In previous work, the relationship between SNA and fluctuations in mean arterial blood pressure (MAP) was described by a set of two first-order differential equations. We have now modified our earlier model to test the feasibility that the 0.4-Hz rhythm can be explained by the baroreflex without requiring a neural oscillator. In this baroreflex model, a linear feedback term replaces the sympathetic drive to the cardiovascular system. The time delay in the feedback loop is set equal to the time delay on the efferent side, approximately 0.5 s (as determined in the initial model), plus a time delay of 0.2 s on the afferent side for a total time delay of approximately 0.7 s. A stability analysis of this new model yields feedback resonant frequencies close to 0.4 Hz. Because of the time delay in the feedback loop, the proportional gain may not exceed a value on the order of 10 to maintain stability. The addition of a derivative feedback term increases the system's stability for a positive range of derivative gains. We conclude that the known physiological time delay for the sympathetic portion of the baroreflex can account for the observed 0.4-Hz rhythm in rat MAP and that the sensitivity of the baroreceptors to the rate of change in blood pressure, as well as average blood pressure, would enhance the natural stability of the baroreflex.

  7. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

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

  8. Modeling and simulation of blood collection systems.

    Science.gov (United States)

    Alfonso, Edgar; Xie, Xiaolan; Augusto, Vincent; Garraud, Olivier

    2012-03-01

    This paper addresses the modeling and simulation of blood collection systems in France for both fixed site and mobile blood collection with walk in whole blood donors and scheduled plasma and platelet donors. Petri net models are first proposed to precisely describe different blood collection processes, donor behaviors, their material/human resource requirements and relevant regulations. Petri net models are then enriched with quantitative modeling of donor arrivals, donor behaviors, activity times and resource capacity. Relevant performance indicators are defined. The resulting simulation models can be straightforwardly implemented with any simulation language. Numerical experiments are performed to show how the simulation models can be used to select, for different walk in donor arrival patterns, appropriate human resource planning and donor appointment strategies.

  9. Scheduling Aircraft Landings under Constrained Position Shifting

    Science.gov (United States)

    Balakrishnan, Hamsa; Chandran, Bala

    2006-01-01

    Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

  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. Relationship of Cord Blood Immunoglobulin E and Maternal Immunoglobulin E with Birth Order and Maternal History of Allergy in Albanian Mother/Neonate Pairs.

    Science.gov (United States)

    Latifi-Pupovci, Hatixhe; Lokaj-Berisha, Violeta; Lumezi, Besa

    2017-10-15

    Previous studies reported that familial factors such as birth order and mothers atopy might influence cord blood levels and development of allergies. The aim of the study was to evaluate the relationship of cord blood IgE and maternal IgE with birth order and mothers history of allergy in Albanian mother/neonate pairs. Study population represented 291 mother-infant pairs. Mothers were interviewed with a questionnaire for personal history of allergy and pregnancy history whereas serum IgE levels were determined using sandwich IRMA assay. The mean level of cIgE in neonates with detectable levels was 1.59 (n = 78). No significant difference in means of cIgE was found between first born and later born neonates (p = 0.232) and between neonates of mothers with a negative and positive history of allergy (p = 0.125). Also, no significant difference was found between means of mIgE by birth order, whereas there was a significant difference of mIgE between mothers with and without a history of allergy (p = 0.01). In a group of neonates with detectable cIgE levels, maternal IgE levels were moderately correlated with cIgE levels. Cord blood IgE is not affected by birth order and mothers history of allergy, whereas mothers IgE are affected by the history of allergy but not by birth order.

  12. Schedule Analytics

    Science.gov (United States)

    2016-04-30

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

  13. Cyclic delivery scheduling to customers with different priorities

    Directory of Open Access Journals (Sweden)

    Katarzyna Zofia Gdowska

    2013-12-01

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

  14. Preemptive scheduling with rejection

    NARCIS (Netherlands)

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

    2003-01-01

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

  15. Preemptive scheduling with rejection

    NARCIS (Netherlands)

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

    2000-01-01

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

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

  17. Uncertainty management by relaxation of conflicting constraints in production process scheduling

    Science.gov (United States)

    Dorn, Juergen; Slany, Wolfgang; Stary, Christian

    1992-01-01

    Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

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

    NARCIS (Netherlands)

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

    2014-01-01

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

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

    NARCIS (Netherlands)

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

    2011-01-01

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

  20. VNS (Variable Neighbourhood Search) applied to batch sequencing in operational scheduling of pipeline network; VNS (Variable Neighbourhood Search) aplicado ao sequenciamento de bateladas do 'scheduling' de operacoes de uma malha dutoviaria

    Energy Technology Data Exchange (ETDEWEB)

    Yamamoto, Lia; Arruda, Lucia Valeria Ramos de; Libert, Nikolas [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    This work presents the VNS heuristic technique applied on batches ordering in a real network of petroleum derivatives distribution. These ordering have great influence in operational scheduling of a pipeline network. The operational scheduling purposes the efficient utilization of the resources, resulting on a better performance. Due to the great complexity of the real network problem and the necessity of its resolution in little computational time, it was adopted a problem subdivision in assignment of resources, sequencing and timing. In the resources assignment stage, it is considered the production/consumption functions and the products tankages to determine the total batches, including its volume, flow rate and the time-windows to satisfy the demand. These data are used in the sequencing stage, where a VNS based model determines the batches ordering. In a final step, the last block, realize the temporisation considering the network operational constraints. This work shows the results from the optimization of the sequencing stage which aims the improvement of the solution quality of scheduling. (author)

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

  2. Interval algebra - an effective means of scheduling surveillance radar networks

    CSIR Research Space (South Africa)

    Focke, RW

    2015-05-01

    Full Text Available Interval Algebra provides an effective means to schedule surveillance radar networks, as it is a temporal ordering constraint language. Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion...

  3. Interval algebra: an effective means of scheduling surveillance radar networks

    CSIR Research Space (South Africa)

    Focke, RW

    2015-05-01

    Full Text Available Interval Algebra provides an effective means to schedule surveillance radar networks, as it is a temporal ordering constraint language. Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion...

  4. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1992-03-01

    Title 44 United States Code, ''Public Printing and Documents,'' regulations cited in the General Services Administration's (GSA) ''Federal Information Resources Management Regulations'' (FIRMR), Part 201-9, ''Creation, Maintenance, and Use of Records,'' and regulation issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter XII, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 2, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 2 totally reorganizes the records schedules from a functional arrangement to an arrangement by the host office. A subject index and a conversion table have also been developed for the NRC schedules to allow staff to identify the new schedule numbers easily and to improve their ability to locate applicable schedules

  5. 21 CFR 1314.155 - Suspension pending final order.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Suspension pending final order. 1314.155 Section 1314.155 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE RETAIL SALE OF SCHEDULED LISTED CHEMICAL PRODUCTS Order to Show Cause § 1314.155 Suspension pending final order. (a) The...

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

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-06-01

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

  7. 76 FR 57681 - Modification of Interlibrary Loan Fee Schedule

    Science.gov (United States)

    2011-09-16

    ... through the National Technical Information Service (NTIS) or payment through the Online Computer Library... in order to support the current cost of providing the service and will enable customers to estimate... Service 7 CFR Part 505 RIN 0518-8AA04 Modification of Interlibrary Loan Fee Schedule AGENCY: Agricultural...

  8. Myoglobin blood test

    Science.gov (United States)

    Serum myoglobin; Heart attack - myoglobin blood test; Myositis - myoglobin blood test; Rhabdomyolysis - myoglobin blood test ... too high, it can damage the kidneys. This test is ordered when your health care provider suspects ...

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

  10. Distributed scheduling for autonomous vehicles by reinforcement learning; Kyoka gakushu ni yoru mujin hansosha no bunsangata scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Unoki, T.; Suetake, N. [Oki Electric Industry Co. Ltd., Tokyo (Japan)

    1997-08-20

    In this paper, we propose an autonomous vehicle scheduling schema in large physical distribution terminals publicly used as the next generation wide area physical distribution bases. This schema uses Learning Automaton for vehicles scheduling based on Contract Net Protocol, in order to obtain useful emergent behaviors of agents in the system based on the local decision-making of each agent. The state of the automaton is updated at each instant on the basis of new information that includes the arrival estimation time of vehicles. Each agent estimates the arrival time of vehicles by using Bayesian learning process. Using traffic simulation, we evaluate the schema in various simulated environments. The result shows the advantage of the schema over when each agent provides the same criteria from the top down, and each agent voluntarily generates criteria via interactions with the environment, playing an individual role in tie system. 22 refs., 5 figs., 2 tabs.

  11. A Survey on Transfusion Status in Orthopedic Surgery at a Trauma Center

    Directory of Open Access Journals (Sweden)

    Mehran Soleimanha

    2016-01-01

    Full Text Available Background: Increased costs and mortality associated with inappropriate blood transfusions have led to investigations about blood request and blood transfusion techniques. We investigated the transfusion status in patients who underwent orthopedic surgery in Poursina Hospital (Rasht, Iran to optimizing blood usage and determine if a scheduled transfusion program for every orthopedic surgery could improve blood transfusion management. Method: In this descriptive-prospective study, all orthopedic surgeries in Poursina Hospital, Rasht, between April to June 2013 were reviewed. All patient information was recorded, including: demographics, type of surgery, hemoglobin level, cross-match test, duration of surgery, and blood loss, and transfusion. Based on the one-way ANOVA and independent samples test analysis, cross-match to transfusion ratio and transfusion possibility, the transfusion index, and maximal surgical blood order schedule were calculated to determine blood transfusion status. Results: Among 872 selected orthopedic surgery candidates, 318 of them were cross-matched and among those, 114 patients received a blood transfusion. In this study, the cross-match to transfusion ratio was 6.4, transfusion possibility 36.47%, transfusion index 0.6, and maximal surgical blood order schedule 0.9. Conclusion: We found that blood ordering was moderately higher than the standard; so it is highly recommended to focus on the knowledge of evidence based on transfusion and standard guidelines for blood transfusion to avoid over-ordering.

  12. Outage scheduling and implementation

    International Nuclear Information System (INIS)

    Allison, J.E.; Segall, P.; Smith, R.R.

    1986-01-01

    Successful preparation and implementation of an outage schedule and completion of scheduled and emergent work within an identified critical path time frame is a result of careful coordination by Operations, Work Control, Maintenance, Engineering, Planning and Administration and others. At the Fast Flux Test Facility (FFTF) careful planning has been responsible for meeting all scheduled outage critical paths

  13. QTL influencing blood pressure maps to the region of PPH1 on chromosome 2q31-34 in Old Order Amish.

    Science.gov (United States)

    Hsueh, W C; Mitchell, B D; Schneider, J L; Wagner, M J; Bell, C J; Nanthakumar, E; Shuldiner, A R

    2000-06-20

    Hypertension is a major risk factor for coronary heart disease, stroke, congestive heart failure, renal insufficiency, and peripheral vascular disease. Although the genetic contribution to variation in blood pressure is well recognized, the specific genes involved are mostly unknown. We carried out a genome-wide scan to identify loci influencing blood pressure in the Old Order Amish population of Lancaster County, Pennsylvania. Blood pressures were measured in 694 adult participants from families recruited without regard to blood pressure. We performed a quantitative linkage analysis by using 357 microsatellite markers. In multipoint analysis, strong evidence for linkage was observed with both diastolic (lod=3.36; P=0.00004) and to a lesser extent systolic (lod=1.64; P=0.003) blood pressure in the region of chromosome 2q31-34. Peak evidence for linkage occurred at map positions 217 and 221 cM from pter for diastolic and systolic blood pressure, respectively. A gene linked to familial primary pulmonary hypertension has recently been mapped to this same region, suggesting the intriguing hypothesis that other (attenuated) mutations in this same gene may influence variation in systolic and diastolic blood pressure in this population.

  14. A stochastic model for forecast consumption in master scheduling

    NARCIS (Netherlands)

    Weeda, P.J.; Weeda, P.J.

    1994-01-01

    This paper describes a stochastic model for the reduction of the initial forecast in the Master Schedule (MS) of an MRP system during progress of time by the acceptance of customer orders. Results are given for the expectation and variance of the number of yet unknown deliveries as a function of

  15. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

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

  16. Gastrin blood test

    Science.gov (United States)

    Peptic ulcer - gastrin blood test ... A blood sample is needed . ... in the stomach, gastrin is released into the blood. As the acid ... provider may order this test if you have signs or symptoms of a ...

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

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

  19. Bilevel Fuzzy Chance Constrained Hospital Outpatient Appointment Scheduling Model

    Directory of Open Access Journals (Sweden)

    Xiaoyang Zhou

    2016-01-01

    Full Text Available Hospital outpatient departments operate by selling fixed period appointments for different treatments. The challenge being faced is to improve profit by determining the mix of full time and part time doctors and allocating appointments (which involves scheduling a combination of doctors, patients, and treatments to a time period in a department optimally. In this paper, a bilevel fuzzy chance constrained model is developed to solve the hospital outpatient appointment scheduling problem based on revenue management. In the model, the hospital, the leader in the hierarchy, decides the mix of the hired full time and part time doctors to maximize the total profit; each department, the follower in the hierarchy, makes the decision of the appointment scheduling to maximize its own profit while simultaneously minimizing surplus capacity. Doctor wage and demand are considered as fuzzy variables to better describe the real-life situation. Then we use chance operator to handle the model with fuzzy parameters and equivalently transform the appointment scheduling model into a crisp model. Moreover, interactive algorithm based on satisfaction is employed to convert the bilevel programming into a single level programming, in order to make it solvable. Finally, the numerical experiments were executed to demonstrate the efficiency and effectiveness of the proposed approaches.

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

    Science.gov (United States)

    Ahmed, Z; Elmekkawy, Ty; Bates, S

    2011-01-01

    time of a emergency room.3 A 20---day field observation revealed that the availability of the staff physician and interaction affects the patient wait time. Jyväskylä et al.4 used simulation to test different process scenarios, allocate resources and perform activity---based cost analysis in the Emergency Department (ED) at the Central Hospital. The simulation also supported the study of a new operational method, named "triage-team" method without interrupting the main system. The proposed triage team method categorises the entire patient according to the urgency to see the doctor and allows the patient to complete the necessary test before being seen by the doctor for the first time. The simulation study showed that it will decrease the throughput time of the patient and reduce the utilisation of the specialist and enable the ordering all the tests the patient needs right after arrival, thus quickening the referral to treatment. Santibáñez et al.5 developed a discrete event simulation model of British Columbia Cancer Agency"s ambulatory care unit which was used to study the impact of scenarios considering different operational factors (delay in starting clinic), appointment schedule (appointment order, appointment adjustment, add---ons to the schedule) and resource allocation. It was found that the best outcomes were obtained when not one but multiple changes were implemented simultaneously. Sepúlveda et al.6 studied the M. D. Anderson Cancer Centre Orlando, which is a cancer treatment facility and built a simulation model to analyse and improve flow process and increase capacity in the main facility. Different scenarios were considered like, transferring laboratory and pharmacy areas, adding an extra blood draw room and applying different scheduling techniques of patients. The study shows that by increasing the number of short---term (four hours or less) patients in the morning could increase chair utilisation. Discrete event simulation also helps improve a

  1. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

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

  2. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1982-07-01

    Effective January 1, 1982, NRC will institute records retention and disposal practices in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 22 which apply to housekeeping or facilitative records. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  3. Day-ahead resource scheduling of a renewable energy based virtual power plant

    International Nuclear Information System (INIS)

    Zamani, Ali Ghahgharaee; Zakariazadeh, Alireza; Jadid, Shahram

    2016-01-01

    Highlights: • Simultaneous energy and reserve scheduling of a VPP. • Aggregate uncertainties of electricity prices, renewable generation and load demand. • Develop a stochastic scheduling model using the point estimate method. - Abstract: The evolution of energy markets is accelerating in the direction of a greater reliance upon distributed energy resources (DERs). To manage this increasing two-way complexity, virtual power plants (VPPs) are being deployed today all over the world. In this paper, a probabilistic model for optimal day ahead scheduling of electrical and thermal energy resources in a VPP is proposed where participation of energy storage systems and demand response programs (DRPs) are also taken into account. In the proposed model, energy and reserve is simultaneously scheduled considering the uncertainties of market prices, electrical demand and intermittent renewable power generation. The Point Estimate Method (PEM) is applied in order to model the uncertainties of VPP’s scheduling problem. Moreover, the optimal reserve scheduling of VPP is presented which efficiently decreases VPP’s risk facing the unexpected fluctuations of uncertain parameters at the power delivery time. The results demonstrated that implementation of demand response programs (DRPs) would decrease total operation costs of VPP as well as its dependency on the upstream network.

  4. Tranexamic acid reduces blood loss and blood transfusions in primary total hip arthroplasty: a prospective randomized double-blind study in 40 patients

    DEFF Research Database (Denmark)

    Husted, Henrik; Blønd, Lars; Sonne-Holm, Stig

    2003-01-01

    INTRODUCTION: We performed a prospective, randomized, double-blind study on 40 patients scheduled for primary total hip arthroplasty due to arthrosis or osteonecrosis to determine the effect of tranexamic acid on per- and postoperative blood losses and on the number of blood transfusions needed...... blood losses at removal of the drain 24 hours after the operation and the number of blood transfusions. RESULTS: Patients receiving tranexamic acid had a mean peroperative blood loss of 480 mL versus 622 mL in patients receiving placebo (p = 0.3), a postoperative blood loss of 334 mL versus 609 mL (p...... = 0.001), a total blood loss of 814 mL versus 1231 mL (p = 0.001) and a total need for 4 blood transfusions versus 25 (p = 0.04). No patient in either group had symptoms of deep venous thrombosis, pulmonary embolism or prolonged wound drainage. INTERPRETATION: Transemic acid is effective in reducing...

  5. Optimization of workflow scheduling in Utility Management System with hierarchical neural network

    Directory of Open Access Journals (Sweden)

    Srdjan Vukmirovic

    2011-08-01

    Full Text Available Grid computing could be the future computing paradigm for enterprise applications, one of its benefits being that it can be used for executing large scale applications. Utility Management Systems execute very large numbers of workflows with very high resource requirements. This paper proposes architecture for a new scheduling mechanism that dynamically executes a scheduling algorithm using feedback about the current status Grid nodes. Two Artificial Neural Networks were created in order to solve the scheduling problem. A case study is created for the Meter Data Management system with measurements from the Smart Metering system for the city of Novi Sad, Serbia. Performance tests show that significant improvement of overall execution time can be achieved by Hierarchical Artificial Neural Networks.

  6. Multiuser switched scheduling systems with per-user threshold and post-user selection

    KAUST Repository

    Nam, Haewoon

    2010-06-01

    A multiuser switched diversity scheduling scheme with per-user feedback threshold is proposed in this paper. Unlike the conventional multiuser switched diversity scheduling scheme where a single threshold is used by all the users in order to determine whether to transmit a feedback, the proposed scheme deploys per-user threshold, where each user uses a potentially different threshold than other users thresholds. This paper first provides a generic analytical framework for the optimal feedback thresholds in a closed form. Then we investigates the impact of user sequence strategies and post selection strategies on the performance of the multiuser switched scheduling scheme with per-user threshold. Numerical and simulation results show that the proposed scheme provides a higher system capacity compared to the conventional scheme. © 2010 IEEE.

  7. Multiuser switched scheduling systems with per-user threshold and post-user selection

    KAUST Repository

    Nam, Haewoon; Alouini, Mohamed-Slim

    2010-01-01

    A multiuser switched diversity scheduling scheme with per-user feedback threshold is proposed in this paper. Unlike the conventional multiuser switched diversity scheduling scheme where a single threshold is used by all the users in order to determine whether to transmit a feedback, the proposed scheme deploys per-user threshold, where each user uses a potentially different threshold than other users thresholds. This paper first provides a generic analytical framework for the optimal feedback thresholds in a closed form. Then we investigates the impact of user sequence strategies and post selection strategies on the performance of the multiuser switched scheduling scheme with per-user threshold. Numerical and simulation results show that the proposed scheme provides a higher system capacity compared to the conventional scheme. © 2010 IEEE.

  8. Resource-Optimal Scheduling Using Priced Timed Automata

    DEFF Research Database (Denmark)

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

    2004-01-01

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

  9. Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation.

    Energy Technology Data Exchange (ETDEWEB)

    Brown, Nathanael J. K.; Arguello, Bryan; Nozick, Linda Karen; Xu, Ningxiong [Cornell

    2017-03-01

    This paper focuses on scheduling antennas to track satellites using a heuristic method. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The performance of the algorithm is established using several illustrative problems.

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

    Directory of Open Access Journals (Sweden)

    Zhi Yang

    2016-01-01

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

  11. Proportional fair scheduling algorithm based on traffic in satellite communication system

    Science.gov (United States)

    Pan, Cheng-Sheng; Sui, Shi-Long; Liu, Chun-ling; Shi, Yu-Xin

    2018-02-01

    In the satellite communication network system, in order to solve the problem of low system capacity and user fairness in multi-user access to satellite communication network in the downlink, combined with the characteristics of user data service, an algorithm study on throughput capacity and user fairness scheduling is proposed - Proportional Fairness Algorithm Based on Traffic(B-PF). The algorithm is improved on the basis of the proportional fairness algorithm in the wireless communication system, taking into account the user channel condition and caching traffic information. The user outgoing traffic is considered as the adjustment factor of the scheduling priority and presents the concept of traffic satisfaction. Firstly,the algorithm calculates the priority of the user according to the scheduling algorithm and dispatches the users with the highest priority. Secondly, when a scheduled user is the business satisfied user, the system dispatches the next priority user. The simulation results show that compared with the PF algorithm, B-PF can improve the system throughput, the business satisfaction and fairness.

  12. Resource-constrained project scheduling problem: review of past and recent developments

    Directory of Open Access Journals (Sweden)

    Farhad Habibi

    2018-01-01

    Full Text Available The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

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

  14. Challenges encountered during an accelerated cogeneration plant construction and commissioning schedule

    International Nuclear Information System (INIS)

    Good, R.L.; Cox, T.P.; Vallejo, J.M.

    1988-01-01

    A decision was made in 1986 to proceed with a 110 magawatt grassroots cogeneration plant to supply the steam and electrical requirements of a large, integrated petrochemical manufacturing facility. Though some preliminary engineering had been done and long delivery equipment purchase orders had been let in the summer of 1986, detailed engineering did not commence until late October and construction until mid-December, 1986. Federal income tax consideration required that the project be in service prior to the end of 1987. This eleven month construction, commissioning, and start up schedule was achieved with 100 per cent operation occurring on December 22, 1987. Numerous challenges were met by the lean Project Team during this accelerated schedule. This paper discusses the development of: Project Team Staffing, Operator and Maintenance Staffing and Training, Commissioning Schedules and Staffing, solutions to Significant Technical Problems

  15. Two-Stage Multi-Objective Collaborative Scheduling for Wind Farm and Battery Switch Station

    OpenAIRE

    Zhe Jiang; Xueshan Han; Zhimin Li; Wenbo Li; Mengxia Wang; Mingqiang Wang

    2016-01-01

    In order to deal with the uncertainties of wind power, wind farm and electric vehicle (EV) battery switch station (BSS) were proposed to work together as an integrated system. In this paper, the collaborative scheduling problems of such a system were studied. Considering the features of the integrated system, three indices, which include battery swapping demand curtailment of BSS, wind curtailment of wind farm, and generation schedule tracking of the integrated system are proposed. In additio...

  16. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

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

  17. Tainted blood

    DEFF Research Database (Denmark)

    Deleuran, Ida; Sheikh, Zainab Afshan; Hoeyer, Klaus

    2015-01-01

    The existing literature on donor screening in transfusion medicine tends to distinguish between social concerns about discrimination and medical concerns about safety. In this article, we argue that the bifurcation into social and medical concerns is problematic. We build our case on a qualitative...... study of the historical rise and current workings of safety practices in the Danish blood system. Here, we identify a strong focus on contamination in order to avoid 'tainted blood', at the expense of working with risks that could be avoided through enhanced blood monitoring practices. Of further...... significance to this focus are the social dynamics found at the heart of safety practices aimed at avoiding contamination. We argue that such dynamics need more attention, in order to achieve good health outcomes in transfusion medicine. Thus, we conclude that, to ensure continuously safe blood systems, we...

  18. Vectorization of a penalty function algorithm for well scheduling

    Science.gov (United States)

    Absar, I.

    1984-01-01

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

  19. Scheduling at the Los Alamos Neutron Science Center (LANSCE)

    International Nuclear Information System (INIS)

    Gallegos, F.R.

    1999-01-01

    The centerpieces of the Los Alamos Neutron Science Center (LANSCE) are a half-mile long 800-MeV proton linear accelerator and proton storage ring. The accelerator, storage ring, and target stations provide the protons and spallation neutrons that are used in the numerous basic research and applications experimental programs supported by the US Department of Energy. Experimental users, facility maintenance personnel, and operations personnel must work together to achieve the most program benefit within defined budget and resource constraints. In order to satisfy the experimental users programs, operations must provide reliable and high quality beam delivery. Effective and efficient scheduling is a critical component to achieve this goal. This paper will detail how operations scheduling is presently executed at the LANSCE accelerator facility

  20. Schedule-Aware Workflow Management Systems

    Science.gov (United States)

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

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

  1. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

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

  2. Optimal load scheduling in commercial and residential microgrids

    Science.gov (United States)

    Ganji Tanha, Mohammad Mahdi

    Residential and commercial electricity customers use more than two third of the total energy consumed in the United States, representing a significant resource of demand response. Price-based demand response, which is in response to changes in electricity prices, represents the adjustments in load through optimal load scheduling (OLS). In this study, an efficient model for OLS is developed for residential and commercial microgrids which include aggregated loads in single-units and communal loads. Single unit loads which include fixed, adjustable and shiftable loads are controllable by the unit occupants. Communal loads which include pool pumps, elevators and central heating/cooling systems are shared among the units. In order to optimally schedule residential and commercial loads, a community-based optimal load scheduling (CBOLS) is proposed in this thesis. The CBOLS schedule considers hourly market prices, occupants' comfort level, and microgrid operation constraints. The CBOLS' objective in residential and commercial microgrids is the constrained minimization of the total cost of supplying the aggregator load, defined as the microgrid load minus the microgrid generation. This problem is represented by a large-scale mixed-integer optimization for supplying single-unit and communal loads. The Lagrangian relaxation methodology is used to relax the linking communal load constraint and decompose the independent single-unit functions into subproblems which can be solved in parallel. The optimal solution is acceptable if the aggregator load limit and the duality gap are within the bounds. If any of the proposed criteria is not satisfied, the Lagrangian multiplier will be updated and a new optimal load schedule will be regenerated until both constraints are satisfied. The proposed method is applied to several case studies and the results are presented for the Galvin Center load on the 16th floor of the IIT Tower in Chicago.

  3. Effects of Strength Training Sessions Performed with Different Exercise Orders and Intervals on Blood Pressure and Heart Rate Variability.

    Science.gov (United States)

    Lemos, Sandro; Figueiredo, Tiago; Marques, Silvio; Leite, Thalita; Cardozo, Diogo; Willardson, Jeffrey M; Simão, Roberto

    2018-01-01

    This study compared the effect of a strength training session performed at different exercise orders and rest intervals on blood pressure and heart rate variability (HRV). Fifteen trained men performed different upper body exercise sequences [large to small muscle mass (SEQA) and small to large muscle mass (SEQB)] in randomized order with rest intervals between sets and exercises of 40 or 90 seconds. Fifteen repetition maximum loads were tested to control the training intensity and the total volume load. The results showed, significant reductions for systolic blood pressure (SBP) for all sequences compared to baseline and, post-exercise: SEQA90 at 20, 30, 40, 50 and 60 minutes; SEQA40 and SEQB40 at 20 minutes and SEQB90 at 10, 20, 30, 40, 50 and 60 minutes. For diastolic blood pressure (DBP), significant reductions were found for three sequences compared to baseline and, post-exercise: SEQA90 and SEQA40 at 50 and 60 minutes; SEQB40 at 10, 30 and 60 minutes. For HRV, there were significant differences in frequency domain for all sequences compared to baseline. In conclusion, when performing upper body strength training sessions, it is suggested that 90 second rest intervals between sets and exercises promotes a post-exercise hypotensive response in SBP. The 40 second rest interval between sets and exercises was associated with greater cardiac stress, and might be contraindicated when working with individuals that exhibit symptoms of cardiovascular disease.

  4. SPANR planning and scheduling

    Science.gov (United States)

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

    2001-07-01

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

  5. Self-scheduling with Microsoft Excel.

    Science.gov (United States)

    Irvin, S A; Brown, H N

    1999-01-01

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

  6. [Effect of low-intensity 900 MHz frequency electromagnetic radiation on rat liver and blood serum enzyme activities].

    Science.gov (United States)

    Nersesova, L S; Petrosian, M S; Gazariants, M G; Mkrtchian, Z S; Meliksetian, G O; Pogosian, L G; Akopian, Zh I

    2014-01-01

    The comparative analysis of the rat liver and blood serum creatine kinase, alanine aminotransferase, aspartate aminotransferase, alkaline phosphatase and purine nucleoside phosphorylase post-radiation activity levels after a total two-hour long single and fractional exposure of the animals to low-intensity 900 MHz frequency electromagnetic field showed that the most sensitive enzymes to the both schedules of radiation are the liver creatine kinase, as well as the blood serum creatine kinase and alkaline phosphatase. According to the comparative analysis of the dynamics of changes in the activity level of the liver and blood serum creatine kinase, alanine aminotransferase, aspartate aminotransferase and purine nucleoside phosphorylase, both single and fractional radiation schedules do not affect the permeability of a hepatocyte cell membrane, but rather cause changes in their energetic metabolism. The correlation analysis of the post-radiation activity level changes of the investigated enzymes did not reveal a clear relationship between them. The dynamics of post-radiation changes in the activity of investigated enzyme levels following a single and short-term fractional schedules of radiation did not differ essentially.

  7. Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments

    Directory of Open Access Journals (Sweden)

    Nazia Anwar

    2018-01-01

    Full Text Available Scientific workflow applications are collections of several structured activities and fine-grained computational tasks. Scientific workflow scheduling in cloud computing is a challenging research topic due to its distinctive features. In cloud environments, it has become critical to perform efficient task scheduling resulting in reduced scheduling overhead, minimized cost and maximized resource utilization while still meeting the user-specified overall deadline. This paper proposes a strategy, Dynamic Scheduling of Bag of Tasks based workflows (DSB, for scheduling scientific workflows with the aim to minimize financial cost of leasing Virtual Machines (VMs under a user-defined deadline constraint. The proposed model groups the workflow into Bag of Tasks (BoTs based on data dependency and priority constraints and thereafter optimizes the allocation and scheduling of BoTs on elastic, heterogeneous and dynamically provisioned cloud resources called VMs in order to attain the proposed method’s objectives. The proposed approach considers pay-as-you-go Infrastructure as a Service (IaaS clouds having inherent features such as elasticity, abundance, heterogeneity and VM provisioning delays. A trace-based simulation using benchmark scientific workflows representing real world applications, demonstrates a significant reduction in workflow computation cost while the workflow deadline is met. The results validate that the proposed model produces better success rates to meet deadlines and cost efficiencies in comparison to adapted state-of-the-art algorithms for similar problems.

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

    Directory of Open Access Journals (Sweden)

    Antonio Gordillo

    2014-10-01

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

  9. Web server for priority ordered multimedia services

    Science.gov (United States)

    Celenk, Mehmet; Godavari, Rakesh K.; Vetnes, Vermund

    2001-10-01

    In this work, our aim is to provide finer priority levels in the design of a general-purpose Web multimedia server with provisions of the CM services. The type of services provided include reading/writing a web page, downloading/uploading an audio/video stream, navigating the Web through browsing, and interactive video teleconferencing. The selected priority encoding levels for such operations follow the order of admin read/write, hot page CM and Web multicasting, CM read, Web read, CM write and Web write. Hot pages are the most requested CM streams (e.g., the newest movies, video clips, and HDTV channels) and Web pages (e.g., portal pages of the commercial Internet search engines). Maintaining a list of these hot Web pages and CM streams in a content addressable buffer enables a server to multicast hot streams with lower latency and higher system throughput. Cold Web pages and CM streams are treated as regular Web and CM requests. Interactive CM operations such as pause (P), resume (R), fast-forward (FF), and rewind (RW) have to be executed without allocation of extra resources. The proposed multimedia server model is a part of the distributed network with load balancing schedulers. The SM is connected to an integrated disk scheduler (IDS), which supervises an allocated disk manager. The IDS follows the same priority handling as the SM, and implements a SCAN disk-scheduling method for an improved disk access and a higher throughput. Different disks are used for the Web and CM services in order to meet the QoS requirements of CM services. The IDS ouput is forwarded to an Integrated Transmission Scheduler (ITS). The ITS creates a priority ordered buffering of the retrieved Web pages and CM data streams that are fed into an auto regressive moving average (ARMA) based traffic shaping circuitry before being transmitted through the network.

  10. An Organizational and Qualitative Approach to Improving University Course Scheduling

    Science.gov (United States)

    Hill, Duncan L.

    2010-01-01

    Focusing on the current timetabling process at the University of Toronto Mississauga (UTM), I apply David Wesson's theoretical framework in order to understand (1) how increasing enrollment interacts with a decentralized timetabling process to limit the flexibility of course schedules and (2) the resultant impact on educational quality. I then…

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

    NARCIS (Netherlands)

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

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

  12. Innovative Production Scheduling with Customer Satisfaction Based Measurement for the Sustainability of Manufacturing Firms

    Directory of Open Access Journals (Sweden)

    Sang-Oh Shim

    2017-12-01

    Full Text Available Scheduling problems for the sustainability of manufacturing firms in the era of the fourth industrial revolution is addressed in this research. In terms of open innovation, innovative production scheduling can be defined as scheduling using big data, cyber-physical systems, internet of things, cloud computing, mobile network, and so on. In this environment, one of the most important things is to develop an innovative scheduling algorithm for the sustainability of manufacturing firms. In this research, a flexible flowshop scheduling problem is considered with the properties of sequence-dependent setup and different process plans for jobs. In a flexible flowshop, there are serial workstations with multiple pieces of equipment that are able to process multiple lots simultaneously. Since the scheduling in this workshop is known to be extremely difficult, it is important to devise an efficient and effective scheduling algorithm. In this research, a heuristic algorithm is proposed based on a few dispatching rules and economic lot size model with the objective of minimizing total tardiness of orders. For the purposes of performance evaluation, a simulation study is conducted on randomly generated problem instances. The results imply that our proposed method outperforms the existing ones, and greatly enhances the sustainability of manufacturing firms.

  13. Immunization Schedules for Adults

    Science.gov (United States)

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

  14. Instant Childhood Immunization Schedule

    Science.gov (United States)

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

  15. Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

    OpenAIRE

    Lingna He; Qingshui Li; Linan Zhu

    2012-01-01

    In order to replace the traditional Internet software usage patterns and enterprise management mode, this paper proposes a new business calculation mode- cloud computing, resources scheduling strategy is the key technology in cloud computing, Based on the study of cloud computing system structure and the mode of operation, The key research for cloud computing the process of the work scheduling and resource allocation problems based on ant colony algorithm , Detailed analysis and design of the...

  16. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

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

  17. Detecting autologous blood transfusions: a comparison of three passport approaches and four blood markers

    DEFF Research Database (Denmark)

    Mørkeberg, J; Sharpe, K; Belhage, B

    2011-01-01

    Blood passport has been suggested as an indirect tool to detect various kinds of blood manipulations. Autologous blood transfusions are currently undetectable, and the objective of this study was to examine the sensitivities of different blood markers and blood passport approaches in order to det...

  18. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

  19. Plan and schedule for disposition and regulatory compliance for miscellaneous streams. Revision 1

    International Nuclear Information System (INIS)

    1994-12-01

    On December 23, 1991, the U.S. Department of Energy, Richland Operations Office (RL) and the Washington State Department of Ecology (Ecology) agreed to adhere to the provisions of Department of Ecology Consent Order No. DE 91NM-177 (Consent Order). The Consent Order lists regulatory milestones for liquid effluent streams at the Hanford Site to comply with the permitting requirements of Washington Administrative Code (WAC) 173-216 (State Waste Discharge Permit Program) or WAC 173-218 (Washington Underground Injection Control Program) where applicable. Hanford Site liquid effluent streams discharging to the soil column have been categorized in the Consent Order as follows: Phase I Streams Phase II Streams Miscellaneous Streams. Phase I and Phase II Streams are addressed in two RL reports: open-quotes Plan and Schedule to Discontinue Disposal of Contaminated Liquids into the Soil Column at the Hanford Siteclose quotes (DOE-RL 1987), and open-quotes Annual Status of the Report of the Plan and Schedule to Discontinue Disposal of Contaminated Liquids into the Soil Column at the Hanford Siteclose quotes. Miscellaneous Streams are those liquid effluent streams discharged to the ground that are not categorized as Phase I or Phase II Streams. Miscellaneous Streams discharging to the soil column at the Hanford Site are subject to the requirements of several milestones identified in the Consent Order. This document provides a plan and schedule for the disposition of Miscellaneous Streams. The disposition process for the Miscellaneous Streams is facilitated using a decision tree format. The decision tree and corresponding analysis for determining appropriate disposition of these streams is presented in this document

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

    KAUST Repository

    Nam, Haewoon

    2013-01-01

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

  1. Optimal methodology for a machining process scheduling in spot electricity markets

    International Nuclear Information System (INIS)

    Yusta, J.M.; Torres, F.; Khodr, H.M.

    2010-01-01

    Electricity spot markets have introduced hourly variations in the price of electricity. These variations allow the increase of the energy efficiency by the appropriate scheduling and adaptation of the industrial production to the hourly cost of electricity in order to obtain the maximum profit for the industry. In this article a mathematical optimization model simulates costs and the electricity demand of a machining process. The resultant problem is solved using the generalized reduced gradient approach, to find the optimum production schedule that maximizes the industry profit considering the hourly variations of the price of electricity in the spot market. Different price scenarios are studied to analyze the impact of the spot market prices for electricity on the optimal scheduling of the machining process and on the industry profit. The convenience of the application of the proposed model is shown especially in cases of very high electricity prices.

  2. A Hybrid Scheduler for Many Task Computing in Big Data Systems

    Directory of Open Access Journals (Sweden)

    Vasiliu Laura

    2017-06-01

    Full Text Available With the rapid evolution of the distributed computing world in the last few years, the amount of data created and processed has fast increased to petabytes or even exabytes scale. Such huge data sets need data-intensive computing applications and impose performance requirements to the infrastructures that support them, such as high scalability, storage, fault tolerance but also efficient scheduling algorithms. This paper focuses on providing a hybrid scheduling algorithm for many task computing that addresses big data environments with few penalties, taking into consideration the deadlines and satisfying a data dependent task model. The hybrid solution consists of several heuristics and algorithms (min-min, min-max and earliest deadline first combined in order to provide a scheduling algorithm that matches our problem. The experimental results are conducted by simulation and prove that the proposed hybrid algorithm behaves very well in terms of meeting deadlines.

  3. Combinations of response-reinforcer relations in periodic and aperiodic schedules.

    Science.gov (United States)

    Kuroda, Toshikazu; Cançado, Carlos R X; Lattal, Kennon A; Elcoro, Mirari; Dickson, Chata A; Cook, James E

    2013-03-01

    Key pecking of 4 pigeons was studied under a two-component multiple schedule in which food deliveries were arranged according to a fixed and a variable interfood interval. The percentage of response-dependent food in each component was varied, first in ascending (0, 10, 30, 70 and 100%) and then in descending orders, in successive conditions. The change in response rates was positively related to the percentage of response-dependent food in each schedule component. Across conditions, positively accelerated and linear patterns of responding occurred consistently in the fixed and variable components, respectively. These results suggest that the response-food dependency determines response rates in periodic and aperiodic schedules, and that the temporal distribution of food determines response patterns independently of the response-food dependency. Running rates, but not postfood pauses, also were positively related to the percentage of dependent food in each condition, in both fixed and variable components. Thus, the relation between overall response rate and the percentage of dependent food was mediated by responding that occurred after postfood pausing. The findings together extend previous studies wherein the dependency was either always present or absent, and increase the generality of the effects of variations in the response-food dependency from aperiodic to periodic schedules. © Society for the Experimental Analysis of Behavior.

  4. Research and Applications of Shop Scheduling Based on Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Hang ZHAO

    Full Text Available ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.

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

    International Nuclear Information System (INIS)

    Shirazi, Elham; Zakariazadeh, Alireza; Jadid, Shahram

    2015-01-01

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

  6. The role of the production scheduling system in rescheduling

    Science.gov (United States)

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

    2015-11-01

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

  7. Resource planning and scheduling of payload for satellite with particle swarm optimization

    Science.gov (United States)

    Li, Jian; Wang, Cheng

    2007-11-01

    The resource planning and scheduling technology of payload is a key technology to realize an automated control for earth observing satellite with limited resources on satellite, which is implemented to arrange the works states of various payloads to carry out missions by optimizing the scheme of the resources. The scheduling task is a difficult constraint optimization problem with various and mutative requests and constraints. Based on the analysis of the satellite's functions and the payload's resource constraints, a proactive planning and scheduling strategy based on the availability of consumable and replenishable resources in time-order is introduced along with dividing the planning and scheduling period to several pieces. A particle swarm optimization algorithm is proposed to address the problem with an adaptive mutation operator selection, where the swarm is divided into groups with different probabilities to employ various mutation operators viz., differential evolution, Gaussian and random mutation operators. The probabilities are adjusted adaptively by comparing the effectiveness of the groups to select a proper operator. The simulation results have shown the feasibility and effectiveness of the method.

  8. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

    Matveev, A.

    2010-01-01

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

  9. An examination of hospital satisfaction with blood suppliers.

    Science.gov (United States)

    Carden, Robert; DelliFraine, Jami L

    2004-11-01

    The purpose of this study was to identify factors that predict overall hospital satisfaction with blood suppliers. The data for this study came from a 2001 satisfaction survey of hospital blood bank managers conducted by the National Blood Data Resource Center. A total of 1325 blood-utilizing hospitals were included in the final study database. The measurement of hospital satisfaction with its blood supplier encompasses the five composites of the SERVQUAL model. The five composites are 1) tangibles, 2) reliability, 3) responsiveness, 4) assurance, and 5) empathy. Linear regression was performed with overall hospital satisfaction as the dependent variable and the five composites of the SERVQUAL model and control variables as predictors of overall hospital satisfaction with blood suppliers. Significant predictors of hospital satisfaction with blood suppliers are satisfaction with medical and clinical support provided by the blood center, satisfaction with the routine delivery schedule, and price (service fee) of red cells. Prior studies have demonstrated the importance of customer satisfaction to organizations. As organizations, blood centers can benefit from improved satisfaction from their hospital customers. Blood center strategies that focus on improving these three predictors of overall hospital satisfaction with primary blood suppliers will be the most likely to improve and/or maintain hospital customer satisfaction with primary blood suppliers.

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

  11. Tranexamic acid reduces blood loss and blood transfusions in primary total hip arthroplasty: a prospective randomized double-blind study in 40 patients

    DEFF Research Database (Denmark)

    Husted, Henrik; Blønd, Lars; Sonne-Holm, Stig

    2003-01-01

    INTRODUCTION: We performed a prospective, randomized, double-blind study on 40 patients scheduled for primary total hip arthroplasty due to arthrosis or osteonecrosis to determine the effect of tranexamic acid on per- and postoperative blood losses and on the number of blood transfusions needed....... PATIENTS AND METHODS: 40 patients were randomized to tranexamic acid (10 mg/kg given as a bolus intravenous injection, followed by a continuous infusion of 1 mg/kg/hour for 10 hours) or placebo (20 mL saline given intravenously) 15 minutes before the incision. We recorded the peroperative and postoperative...... blood losses at removal of the drain 24 hours after the operation and the number of blood transfusions. RESULTS: Patients receiving tranexamic acid had a mean peroperative blood loss of 480 mL versus 622 mL in patients receiving placebo (p = 0.3), a postoperative blood loss of 334 mL versus 609 mL (p...

  12. BINARY PARTICLE SWARM OPTIMIZATION APPROACH FOR RANDOM GENERATION OUTAGE MAINTENANCE SCHEDULING

    Directory of Open Access Journals (Sweden)

    K. Suresh

    2013-01-01

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

  13. Analyzing scheduling in the food-processing industry

    DEFF Research Database (Denmark)

    Akkerman, Renzo; van Donk, Dirk Pieter

    2009-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Mohammad Hossein Sadeghi

    2013-08-01

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

  15. Escalonamento cooperativo interorganizacional Cooperative inter-organizational scheduling

    Directory of Open Access Journals (Sweden)

    Ricardo J. Rabelo

    2000-12-01

    Full Text Available Este trabalho tem como objetivo essencial apresentar uma abordagem para uma ágil coordenação e supervisão das ordens de produção da empresa, dando uma nova dimensão à atividade de "escalonamento" (scheduling, não apenas numa perspectiva intra-organizacional, mas também interorganizacional, contemplando toda a cadeia produtiva. Apresenta os fundamentos de um protótipo sendo desenvolvido, baseado nos paradigmas de negociação multiagente e de sistemas de suporte à decisão. Aspectos relacionados com a modelagem e integração da informação requerida nos vários níveis do CIM são abordados. Ao final, uma série de considerações são feitas, quer em relação aos resultados atingidos com o protótipo atual, quer para com as várias dificuldades - e desafios - existentes para a realização de um escalonamento cooperativo interorganizacional.This work aims at presenting an approach for agile scheduling coordination and supervision of distributed production orders, giving rise to a new dimension of the scheduling activity, not only under the intra-organizational perspective, but also the inter-organizational, comprising the whole productive chain. It generally presents a prototype being developed, based on the paradigms of multi-agent negotiation and decision support systems. Aspects related with the information modeling and integration in the several levels of CIM are tackled. At the end, a series of considerations is made, pointing out the results reached with the current prototype, and the several difficulties - and challenges - existent for the accomplishment of cooperative inter-organizational scheduling.

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

  17. Conception of Self-Construction Production Scheduling System

    Science.gov (United States)

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

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

  18. Routing and Scheduling Optimization Model of Sea Transportation

    Science.gov (United States)

    barus, Mika debora br; asyrafy, Habib; nababan, Esther; mawengkang, Herman

    2018-01-01

    This paper examines the routing and scheduling optimization model of sea transportation. One of the issues discussed is about the transportation of ships carrying crude oil (tankers) which is distributed to many islands. The consideration is the cost of transportation which consists of travel costs and the cost of layover at the port. Crude oil to be distributed consists of several types. This paper develops routing and scheduling model taking into consideration some objective functions and constraints. The formulation of the mathematical model analyzed is to minimize costs based on the total distance visited by the tanker and minimize the cost of the ports. In order for the model of the problem to be more realistic and the cost calculated to be more appropriate then added a parameter that states the multiplier factor of cost increases as the charge of crude oil is filled.

  19. Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

    KAUST Repository

    Celik, Abdulkadir

    2016-09-12

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

  20. Time-dependent enhancement of lymphocyte activation by mitogens after exposure to isolation or water scheduling.

    Science.gov (United States)

    Jessop, J J; Gale, K; Bayer, B M

    1988-01-01

    The effects of isolation and water scheduling on mitogen induced lymphocyte proliferation were investigated. Isolated rats were animals which had been raised in group-housed conditions and then transferred to individual cages with ad lib access to water for a 1 or 2 week period. Water scheduled rats were maintained in group housing (5 rats per cage) with ad lib access to food but with access to water for a single 30 minute session each day. Responses of these groups were compared to those of animals which had been continuously group-housed with ad lib access to food and water. No differences in lymphocyte responses to phytohemagglutinin (PHA) were found 1 week after exposure to isolation. However, after 2 weeks, splenic and blood T lymphocytes from isolated animals demonstrated an increased proliferative response to suboptimum and maximum concentrations of PHA. Splenic B lymphocyte responses to lipopolysaccharide (LPS) from isolated animals were also increased by 2- to 3-fold compared to group-housed controls. Two weeks of exposure of animals to daily water scheduling similarly increased the splenic lymphocyte proliferation. This increased responsiveness to PHA was not accompanied by a significant change in the sensitivity of the lymphocytes to PHA, in the total number of white blood cells, or the proportion of splenic T or T helper lymphocytes. Our results show that the increase in lymphocyte proliferation is time-dependent, requires greater than 1 week of exposure to isolation and is due to factors other than changes in sensitivity to mitogen or T lymphocyte number.

  1. Two-Stage Multi-Objective Collaborative Scheduling for Wind Farm and Battery Switch Station

    Directory of Open Access Journals (Sweden)

    Zhe Jiang

    2016-10-01

    Full Text Available In order to deal with the uncertainties of wind power, wind farm and electric vehicle (EV battery switch station (BSS were proposed to work together as an integrated system. In this paper, the collaborative scheduling problems of such a system were studied. Considering the features of the integrated system, three indices, which include battery swapping demand curtailment of BSS, wind curtailment of wind farm, and generation schedule tracking of the integrated system are proposed. In addition, a two-stage multi-objective collaborative scheduling model was designed. In the first stage, a day-ahead model was built based on the theory of dependent chance programming. With the aim of maximizing the realization probabilities of these three operating indices, random fluctuations of wind power and battery switch demand were taken into account simultaneously. In order to explore the capability of BSS as reserve, the readjustment process of the BSS within each hour was considered in this stage. In addition, the stored energy rather than the charging/discharging power of BSS during each period was optimized, which will provide basis for hour-ahead further correction of BSS. In the second stage, an hour-ahead model was established. In order to cope with the randomness of wind power and battery swapping demand, the proposed hour-ahead model utilized ultra-short term prediction of the wind power and the battery switch demand to schedule the charging/discharging power of BSS in a rolling manner. Finally, the effectiveness of the proposed models was validated by case studies. The simulation results indicated that the proposed model could realize complement between wind farm and BSS, reduce the dependence on power grid, and facilitate the accommodation of wind power.

  2. Range Scheduling Aid (RSA)

    Science.gov (United States)

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

    1991-01-01

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

  3. Immunization Schedules for Infants and Children

    Science.gov (United States)

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

  4. 21 CFR 1314.100 - Sales limits for mail-order sales.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Sales limits for mail-order sales. 1314.100 Section 1314.100 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE RETAIL SALE OF SCHEDULED LISTED CHEMICAL PRODUCTS Mail-Order Sales § 1314.100 Sales limits for mail-order sales. (a) Each...

  5. A Formal Product-Line Engineering Approach for Schedulers

    NARCIS (Netherlands)

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

    2017-01-01

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

  6. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

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

  7. An Efficient Live TV Scheduling System for 4G LTE Broadcast

    KAUST Repository

    Lau, Chun Pong

    2016-01-01

    Traditional live television (TV) broadcasting systems are proven to be spectrum inefficient. Therefore, researchers propose to provide TV services on fourth-generation (4G) long-term evolution (LTE) networks. However, static broadcast, a typical broadcasting method over cellular network, is inefficient in terms of radio resource usage. To solve this problem, the audience-driven live TV scheduling (ADTVS) framework is proposed, to maximize radio resource usage when providing TV broadcasting services over LTE networks. ADTVS, a system-level scheduling framework, considers both available radio resources and audience preferences, in order to dynamically schedule TV channels for broadcasting at various time and locations. By conducting a simulation using real-life data and scenarios, it is shown that ADTVS significantly outperforms the static broadcast method. Numerical results indicate that, on average, ADTVS enables substantial improvement to broadcast efficiency and conserves considerable amount of radio resources, while forgoing less than 5% of user services compared to the benchmark system.

  8. A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

    KAUST Repository

    Elwhishi, Ahmed

    2013-05-01

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

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

    International Nuclear Information System (INIS)

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

    1993-07-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1993-07-01

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

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

    Science.gov (United States)

    2013-04-12

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

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

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2015-12-01

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

  13. Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems

    Directory of Open Access Journals (Sweden)

    Hesam Izakian

    2009-07-01

    Full Text Available Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem.

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

  15. Schedule control in Ling Ao nuclear power project

    International Nuclear Information System (INIS)

    Xie Ahai

    2007-01-01

    Ling Ao Nuclear Power Station (LANP) is first one built up by self-reliance in China with power capacity 990x2 MWe. The results of quality control, schedule control and cost control are satisfactory. The commercial operation days of Unit 1 and Unit 2 were 28th May 2002 and 8th Jan. 2003 respectively, which were 48 days and 66 days in advance of the project schedule. This paper presents the practices of self-reliance schedule control system in LANP. The paper includes 10 sections: schedule control system; targets of schedule control; schedule control at early stage of project; construction schedule; scheduling practice; Point curves; schedule control of design and procurement; a good practice of construction schedule control on site; commissioning and startup schedule; schedule control culture. Three figures are attached. The main contents of the self-reliance schedule control system are as follows: to draw up reasonable schedules and targets; to setup management mechanism and procedures; to organize powerful project management team; to establish close monitoring system; to provide timely progress reports and statistics information. Five kinds of schedule control targets are introduced, i.e. bar-chart schedule; milesones; Point curves; interface management; hydraulic test schedule of auxiliary piping loops; EMR/EMC/EESR issuance schedules. Six levels of bar-chart schedules were adopted in LANP, but the bar-chart schedules were not satisfactory for complicated erection condition on site, even using six levels of schedules. So a kind of Point curves was developed and their advantages are explained. Scheduling method of three elements: activity, duration, logic, which was adopted in LANP, is introduced. The duration of each piping activities in LANP level 2 project schedule was calculated based on the relevant working Point quantities. The analysis and adjustment of Point curves are illustrated, i.e. balance of monthly quantities; possible production in the peakload

  16. NASA Instrument Cost/Schedule Model

    Science.gov (United States)

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

    2011-01-01

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

  17. Mathematical modeling identifies optimum lapatinib dosing schedules for the treatment of glioblastoma patients.

    Directory of Open Access Journals (Sweden)

    Shayna Stein

    2018-01-01

    Full Text Available Human primary glioblastomas (GBM often harbor mutations within the epidermal growth factor receptor (EGFR. Treatment of EGFR-mutant GBM cell lines with the EGFR/HER2 tyrosine kinase inhibitor lapatinib can effectively induce cell death in these models. However, EGFR inhibitors have shown little efficacy in the clinic, partly because of inappropriate dosing. Here, we developed a computational approach to model the in vitro cellular dynamics of the EGFR-mutant cell line SF268 in response to different lapatinib concentrations and dosing schedules. We then used this approach to identify an effective treatment strategy within the clinical toxicity limits of lapatinib, and developed a partial differential equation modeling approach to study the in vivo GBM treatment response by taking into account the heterogeneous and diffusive nature of the disease. Despite the inability of lapatinib to induce tumor regressions with a continuous daily schedule, our modeling approach consistently predicts that continuous dosing remains the best clinically feasible strategy for slowing down tumor growth and lowering overall tumor burden, compared to pulsatile schedules currently known to be tolerated, even when considering drug resistance, reduced lapatinib tumor concentrations due to the blood brain barrier, and the phenotypic switch from proliferative to migratory cell phenotypes that occurs in hypoxic microenvironments. Our mathematical modeling and statistical analysis platform provides a rational method for comparing treatment schedules in search for optimal dosing strategies for glioblastoma and other cancer types.

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

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

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

  19. The triangle scheduling problem

    NARCIS (Netherlands)

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

    2017-01-01

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

  20. Implementation of a simple electronic transfusion alert system decreases inappropriate ordering of packed red blood cells and plasma in a multi-hospital health care system.

    Science.gov (United States)

    Smith, Matthew; Triulzi, Darrell J; Yazer, Mark H; Rollins-Raval, Marian A; Waters, Jonathan H; Raval, Jay S

    2014-12-01

    Prescriber adherence to institutional blood component ordering guidelines can be low. The goal of this study was to decrease red blood cell (RBC) and plasma orders that did not meet institutional transfusion guidelines by using data within the laboratory information system to trigger alerts in the computerized order entry (CPOE) system at the time of order entry. At 10 hospitals within a regional health care system, discernment rules were created for RBC and plasma orders utilizing transfusion triggers of hemoglobin 1.6, respectively, with subsequent alert generation that appears within the CPOE system when a prescriber attempts to order RBCs or plasma on a patient whose antecedent laboratory values do not suggest that a transfusion is indicated. Orders and subsequent alerts were tracked for RBCs and plasma over evaluation periods of 15 and 10 months, respectively, along with the hospital credentials of the ordering health care providers (physician or nurse). Alerts triggered which were heeded remained steady and averaged 11.3% for RBCs and 19.6% for plasma over the evaluation periods. Overall, nurses and physicians canceled statistically identical percentages of alerted RBC (10.9% vs. 11.5%; p = 0.78) and plasma (21.3% vs. 18.7%; p = 0.22) orders. Implementing a simple evidence-based transfusion alert system at the time of order entry decreased non-evidence based transfusion orders by both nurse and physician providers. Copyright © 2014 Elsevier Ltd. All rights reserved.

  1. A System for Automatically Generating Scheduling Heuristics

    Science.gov (United States)

    Morris, Robert

    1996-01-01

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

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

    Science.gov (United States)

    Seol, Ye-In; Kim, Young-Kuk

    2014-01-01

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

  3. ComprehensiveBench: a Benchmark for the Extensive Evaluation of Global Scheduling Algorithms

    Science.gov (United States)

    Pilla, Laércio L.; Bozzetti, Tiago C.; Castro, Márcio; Navaux, Philippe O. A.; Méhaut, Jean-François

    2015-10-01

    Parallel applications that present tasks with imbalanced loads or complex communication behavior usually do not exploit the underlying resources of parallel platforms to their full potential. In order to mitigate this issue, global scheduling algorithms are employed. As finding the optimal task distribution is an NP-Hard problem, identifying the most suitable algorithm for a specific scenario and comparing algorithms are not trivial tasks. In this context, this paper presents ComprehensiveBench, a benchmark for global scheduling algorithms that enables the variation of a vast range of parameters that affect performance. ComprehensiveBench can be used to assist in the development and evaluation of new scheduling algorithms, to help choose a specific algorithm for an arbitrary application, to emulate other applications, and to enable statistical tests. We illustrate its use in this paper with an evaluation of Charm++ periodic load balancers that stresses their characteristics.

  4. Artificial intelligence approaches to astronomical observation scheduling

    Science.gov (United States)

    Johnston, Mark D.; Miller, Glenn

    1988-01-01

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

  5. A PSO approach for preventive maintenance scheduling optimization

    International Nuclear Information System (INIS)

    Pereira, C.M.N.A.; Lapa, C.M.F.; Mol, A.C.A.; Luz, A.F. da

    2009-01-01

    This work presents a Particle Swarm Optimization (PSO) approach for preventive maintenance policy optimization, focused in reliability and cost. The probabilistic model for reliability and cost evaluation is developed in such a way that flexible intervals between maintenance are allowed. As PSO is skilled for realcoded continuous spaces, a non-conventional codification has been developed in order to allow PSO to solve scheduling problems (which is discrete) with variable number of maintenance interventions. In order to evaluate the proposed methodology, the High Pressure Injection System (HPIS) of a typical 4-loop PWR has been considered. Results demonstrate ability in finding optimal solutions, for which expert knowledge had to be automatically discovered by PSO. (author)

  6. Conceptual design of a generic pulse schedule and event handling editor for improved fusion device operation

    International Nuclear Information System (INIS)

    Barana, Oliviero; Nouailletas, Rémy; Brémond, Sylvain; Moreau, Philippe; Allegretti, Ludovic; Balme, Stéphane; Ravenel, Nathalie; Mannori, Simone; Guillerminet, Bernard; Leroux, Fabrice; Douai, David; Nardon, Eric; Hertout, Patrick; Saint-Laurent, François

    2013-01-01

    Highlights: ► Real-time event handling requires extended functionalities of pulse schedule editors and plasma control systems ► A new pulse schedule editor, conceived for parameterization of systematic off-normal event handling, is described ► A global, generic approach on off-normal event handling is highlighted ► The functional architecture of an off-normal event handling oriented plasma control system is discussed ► The main objects of the pulse schedule editor are the segment-descriptor object and the scenario-descriptor object. -- Abstract: Coping with unexpected events is an important issue of nuclear fusion experiments. The future machines, characterized by very long plasma discharges and actively cooled metallic plasma-facing components, will require a systematic intervention in real time, in order to maximize the performance and protect the investment. The real-time management of events will require extending the functionalities of the current pulse schedule editors with the possibility of using reference waveforms provided with acceptability margins and setting up advanced mitigation strategies and event countermeasures. With this purpose, a new pulse schedule editor, based on a time-segment approach for the preparation of experimental scenarios, is being conceived on Tore Supra, together with a new plasma control system. This paper will report on their conceptual design and give account of the preliminary results of a feasibility study currently under way in order to prepare a possible implementation on Tore Supra

  7. Conceptual design of a generic pulse schedule and event handling editor for improved fusion device operation

    Energy Technology Data Exchange (ETDEWEB)

    Barana, Oliviero, E-mail: oliviero.barana@cea.fr [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France); Nouailletas, Rémy; Brémond, Sylvain; Moreau, Philippe; Allegretti, Ludovic; Balme, Stéphane; Ravenel, Nathalie [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France); Mannori, Simone [ENEA C.R. Brasimone, 40032 Camugnano (Italy); Guillerminet, Bernard; Leroux, Fabrice; Douai, David; Nardon, Eric; Hertout, Patrick; Saint-Laurent, François [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France)

    2013-10-15

    Highlights: ► Real-time event handling requires extended functionalities of pulse schedule editors and plasma control systems ► A new pulse schedule editor, conceived for parameterization of systematic off-normal event handling, is described ► A global, generic approach on off-normal event handling is highlighted ► The functional architecture of an off-normal event handling oriented plasma control system is discussed ► The main objects of the pulse schedule editor are the segment-descriptor object and the scenario-descriptor object. -- Abstract: Coping with unexpected events is an important issue of nuclear fusion experiments. The future machines, characterized by very long plasma discharges and actively cooled metallic plasma-facing components, will require a systematic intervention in real time, in order to maximize the performance and protect the investment. The real-time management of events will require extending the functionalities of the current pulse schedule editors with the possibility of using reference waveforms provided with acceptability margins and setting up advanced mitigation strategies and event countermeasures. With this purpose, a new pulse schedule editor, based on a time-segment approach for the preparation of experimental scenarios, is being conceived on Tore Supra, together with a new plasma control system. This paper will report on their conceptual design and give account of the preliminary results of a feasibility study currently under way in order to prepare a possible implementation on Tore Supra.

  8. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

    Whitman, N.M.

    1993-01-01

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

  9. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

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

  10. Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation

    Directory of Open Access Journals (Sweden)

    Atif Shahzad

    2016-02-01

    Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.

  11. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

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

  12. Development of Watch Schedule Using Rules Approach

    Science.gov (United States)

    Jurkevicius, Darius; Vasilecas, Olegas

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

  13. Technology for planning and scheduling under complex constraints

    Science.gov (United States)

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

    1997-02-01

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

  14. An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT

    Science.gov (United States)

    Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

    2016-01-01

    In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process. PMID:27827909

  15. An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT.

    Science.gov (United States)

    Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

    2016-11-04

    In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process.

  16. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1983-05-01

    Effective January 1, 1982, NRC will institute records retention and disposal practives in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 24 which apply to housekeeping or facilitative records. NRCS-I applies to records common to all or most NRC offices; NRCS-II applies to program records as found in the various offices of the Commission, Atomic Safety and Licensing Board Panel, and the Atomic Safety and Licensing Appeal Panel; NRCS-III applies to records accumulated by the Advisory Committee on Reactor Safeguards; and NRCS-IV applies to records accumulated in the various NRC offices under the Executive Director for Operations. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  17. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

  18. Data analysis with the DIANA meta-scheduling approach

    International Nuclear Information System (INIS)

    Anjum, A; McClatchey, R; Willers, I

    2008-01-01

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

  19. Integrated project scheduling and staff assignment with controllable processing times.

    Science.gov (United States)

    Fernandez-Viagas, Victor; Framinan, Jose M

    2014-01-01

    This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

  20. Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

    Directory of Open Access Journals (Sweden)

    Victor Fernandez-Viagas

    2014-01-01

    Full Text Available This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

  1. The quest for an Indian blood law as of blood transfusion services regulatory framework

    Directory of Open Access Journals (Sweden)

    Pal Ranabir

    2011-01-01

    Full Text Available Background: Blood transfusion services are a vital part of the national health delivery system. The responsibility for ensuring a continuous supply of blood rests with health administrators, who need to galvanize entire communities towards regular and non-remunerated blood donation. Objective: The present study aimed to examine the prevailing global regulations and practices related to blood transfusion and press the case for a dedicated blood law in India. Materials and Methods: We attempted a comprehensive, annotated assembly of published studies on blood transfusion services in India. Data Abstraction and Synthesis: Laws related to blood transfusion services exist in India as a part of the Drugs and Cosmetics Law. In the developed world, most blood donors are unpaid volunteers who give blood for a community supply. In order to augment safe blood transfusion services in India, we have to develop operational legal guidelines on recruitment and retention of voluntary blood donors to direct related organizations for this imperative activity. Conclusion: Several factors, such as political will and a professional and ethical approach can help in formulating a common vision, building trust, by providing optimum information towards a social movement for the rational blood transfusion services. We have to come together for a dedicated blood law in order to improve the quality of blood transfusion services in India.

  2. Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2005-01-01

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

  3. Sport Tournament Automated Scheduling System

    OpenAIRE

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

    2018-01-01

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

  4. SURVEY - Multicriteria Models for Just-in-Time Scheduling

    OpenAIRE

    T'Kindt , Vincent

    2010-01-01

    Abstract Just-in-Time manufacturing consists in organizing the production of elements in order to meet a certain number of objectives or requirements according to the so-called ?Just-in-Time philosophy?. Just-in-Time has been extensively studied in the literature for many years due to the high number of real-life situations where it can be applied. This paper aims at revisiting Just-in-Time principles and detailing how they can be applied to the scheduling stage of a manufacturi...

  5. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    . 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...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care....... Mathematical and logic-based models are presented for the problems considered. Novel components are added to existing models and the modeling decisions are justified. In one case, the model is solved by a simple, but efficient greedy construction heuristic. In the remaining cases, column generation is applied...

  6. Planning and scheduling for petroleum refineries using mathematical programming

    Directory of Open Access Journals (Sweden)

    Joly M.

    2002-01-01

    Full Text Available The objective of this paper is the development and solution of nonlinear and mixed-integer (MIP optimization models for real-world planning and scheduling problems in petroleum refineries. Firstly, we present a nonlinear planning model that represents a general refinery topology and allows implementation of nonlinear process models as well as blending relations. The optimization model is able to define new operating points, thus increasing the production of the more valuable products and simultaneously satisfying all specification constraints. The second part addresses scheduling problems in oil refineries, which are formulated as MIP optimization models and rely on both continuous and discrete time representations. Three practical applications closely related to the current refinery scenario are presented. The first one addresses the problem of crude oil inventory management of a refinery that receives several types of crude oil delivered exclusively by a single oil pipeline. Subsequently, two optimization models intended to define the optimal production policy, inventory control and distribution are proposed and solved for the fuel oil and asphalt plant. Finally, the planning model of Moro et al. (1998 is extended in order to sequence decisions at the scheduling level in the liquefied petroleum gas (LPG area for maximization of the production of petrochemical-grade propane and product delivery.

  7. 40 CFR 141.702 - Sampling schedules.

    Science.gov (United States)

    2010-07-01

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

  8. Reliable blood pressure self-measurement in the obstetric waiting room

    DEFF Research Database (Denmark)

    Wagner, Stefan; Kamper, C. H.; Rasmussen, Niels H

    2014-01-01

    Background: Patients often fail to adhere to clinical recommendations when using current blood pressure self-measurement (BPSM) methods and equipment. As existing BPSM equipment is not able to detect non-adherent behavior, this could result in misdiagnosis and treatment error. To overcome...... patients scheduled for self-measuring their blood pressure (BP) in the waiting room at an obstetrics department's outpatient clinic to perform an additional BPSM using ValidAid. We then compared the automatically measured and classified values from ValidAid with our manual observations. Results: We found...

  9. Routine environmental monitoring schedule, calendar year 1995

    International Nuclear Information System (INIS)

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

    1994-12-01

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

  10. Interactive Dynamic Mission Scheduling for ASCA

    Science.gov (United States)

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

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

  11. Scheduled Operation of PV Power Station Considering Solar Radiation Forecast Error

    Science.gov (United States)

    Takayama, Satoshi; Hara, Ryoichi; Kita, Hiroyuki; Ito, Takamitsu; Ueda, Yoshinobu; Saito, Yutaka; Takitani, Katsuyuki; Yamaguchi, Koji

    Massive penetration of photovoltaic generation (PV) power stations may cause some serious impacts on a power system operation due to their volatile and unpredictable output. Growth of uncertainty may require larger operating reserve capacity and regulating capacity. Therefore, in order to utilize a PV power station as an alternative for an existing power plant, improvement in controllability and adjustability of station output become very important factor. Purpose of this paper is to develop the scheduled operation technique using a battery system (NAS battery) and the meteorological forecast. The performance of scheduled operation strongly depends on the accuracy of solar radiation forecast. However, the solar radiation forecast contains error. This paper proposes scheduling method and rescheduling method considering the trend of forecast error. More specifically, the forecast error scenario is modeled by means of the clustering analysis of the past actual forecast error. Validity and effectiveness of the proposed method is ascertained through computational simulations using the actual PV generation data monitored at the Wakkanai PV power station and solar radiation forecast data provided by the Japan Weather Association.

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

  13. Regulation of Blood Glucose Concentration in Type 1 Diabetics Using Single Order Sliding Mode Control Combined with Fuzzy On-line Tunable Gain, a Simulation Study.

    Science.gov (United States)

    Dinani, Soudabeh Taghian; Zekri, Maryam; Kamali, Marzieh

    2015-01-01

    Diabetes is considered as a global affecting disease with an increasing contribution to both mortality rate and cost damage in the society. Therefore, tight control of blood glucose levels has gained significant attention over the decades. This paper proposes a method for blood glucose level regulation in type 1 diabetics. The control strategy is based on combining the fuzzy logic theory and single order sliding mode control (SOSMC) to improve the properties of sliding mode control method and to alleviate its drawbacks. The aim of the proposed controller that is called SOSMC combined with fuzzy on-line tunable gain is to tune the gain of the controller adaptively. This merit causes a less amount of control effort, which is the rate of insulin delivered to the patient body. As a result, this method can decline the risk of hypoglycemia, a lethal phenomenon in regulating blood glucose level in diabetics caused by a low blood glucose level. Moreover, it attenuates the chattering observed in SOSMC significantly. It is worth noting that in this approach, a mathematical model called minimal model is applied instead of the intravenously infused insulin-blood glucose dynamics. The simulation results demonstrate a good performance of the proposed controller in meal disturbance rejection and robustness against parameter changes. In addition, this method is compared to fuzzy high-order sliding mode control (FHOSMC) and the superiority of the new method compared to FHOSMC is shown in the results.

  14. Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Mohamed H

    2006-01-01

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

  15. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  16. Decision Model for Planning and Scheduling of Seafood Product Considering Traceability

    Science.gov (United States)

    Agustin; Mawengkang, Herman; Mathelinea, Devy

    2018-01-01

    Due to the global challenges, it is necessary for an industrial company to integrate production scheduling and distribution planning, in order to be more efficient and to get more economics advantages. This paper presents seafood production planning and scheduling of a seafood manufacture company which produces simultaneously multi kind of seafood products, located at Aceh Province, Indonesia. The perishability nature of fish highly restricts its storage duration and delivery conditions. Traceability is a tracking requirement to check whether the quality of the product is satisfied. The production and distribution planning problem aims to meet customer demand subject to traceability of the seafood product and other restrictions. The problem is modeled as a mixed integer linear program, and then it is solved using neighborhood search approach.

  17. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1991-01-01

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

  18. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1991-01-01

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

  19. Schedule and staffing of a nuclear power project

    International Nuclear Information System (INIS)

    Polliart, A.J.; Csik, B.

    1977-01-01

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

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

  1. Limited Preemptive Scheduling in Real-time Systems

    OpenAIRE

    Thekkilakattil, Abhilash

    2016-01-01

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

  2. Early changes in blood flow of the mouse skin after irradiation as measured by the 133Xe clearance method

    International Nuclear Information System (INIS)

    Tsujii, Hirohiko; Irie, Goro

    1983-01-01

    The early effects of radiation on the local blood flow in the skin of mice were evaluated by measuring the local clearance rate of 133 Xe after its subcutaneous injection; this was done at four to five weeks after irradiation during the animals' normal resting conditions. The fractionation schedules employed were single fractions, two fractions in 15 days and four fractions in 15 days. The dose effect curves with these schedules showed a two-component pattern. There was a uniform reduction in flood flow after 10 to 30 Gy, and a steady increase in flood flow after doses more than 40 Gy. The blood flow after higher-fractionated doses was always lower than less-fractionated doses. It was considered that radiation doses causing higher severity of acute skin reactions might have predominated a degree of acute vasodilatation over fibrotic changes, thus resulting in increased blood flow. A steady increase in early blood flow was observed with increasing severity of acute skin reactions, but the early blood flow was not a good indicator for predicting late skin reactions, except for a severe leg deformity which was accompanied with a significant increase in early blood flow. (author)

  3. LOAD ADAPTIVE DYNAMIC SCHEDULING OF TASKS WITH HARD DEADLINES USEFUL FOR INDUSTRIAL APPLICATIONS

    NARCIS (Netherlands)

    HALANG, WA

    1992-01-01

    All intrinsic properties of the earliest deadline task scheduling discipline are compiled and discussed in order to show that this is the most advantageous scheme at hand, characterised by efficiency and allowing predictable system behaviour. It is then pointed out how the method naturally extends

  4. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

    Purcell, W.J.; Martin, E.M.; Shivley, J.M.

    1982-01-01

    The construction schedule for the Clinch River Breeder Reactor Plant and its evolution are described. The initial schedule basis, changes necessitated by the evaluation of the overall plant design, and constructability improvements that have been effected to assure adherence to the schedule are presented. The schedule structure and hierarchy are discussed, as are tools used to define, develop, and evaluate the schedule

  5. Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System

    Science.gov (United States)

    Dylewski, Robert; Jardzioch, Andrzej; Dworak, Oliver

    2018-03-01

    The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.

  6. Utilization Bound of Non-preemptive Fixed Priority Schedulers

    Science.gov (United States)

    Park, Moonju; Chae, Jinseok

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

  7. How police officers and nurses regulate combined domestic and paid workloads to manage schedules: a gender analysis.

    Science.gov (United States)

    Caroly, Sandrine

    2011-01-01

    Our questioning focuses on the role played by the gendered division of labour and by the collective organisation of work in strategies deployed by workers in order to reconcile professional and private lives. How does work organisation facilitate schedule management so as to fit in with workers' domestic lives by offering the possibility of work activity accommodations? A comparison of two stress management studies allowed us to examine the strategies used to manage professional and private schedules. One study focused on nurses in a female environment and one study looked at police officers or a male environment recently incorporating women into the work group. In the hospital sector, management resorts to curtailing leave in order to overcome staff shortages and ensure the quality of health care; however, the female environment facilitates collective regulation to adapt work schedules. These management imposed organisational constraints are especially difficult for female staff due to their roles in the domestic sphere. It is more difficult for women to adapt work schedules in the predominantly male police officer environment. Police ask supervisors for timetable changes more frequently following the introduction of women to the group. The strategies to reconcile professional and private lives depend on division of labour and collective regulation.

  8. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

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

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

    Science.gov (United States)

    2013-02-12

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

  10. 76 FR 43344 - Certain Orange Juice From Brazil; Scheduling of a Full Five-Year Review Concerning the...

    Science.gov (United States)

    2011-07-20

    ... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-1089 (Review)] Certain Orange Juice From Brazil; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Certain Orange... order on certain orange juice from Brazil would be likely to lead to continuation or recurrence of...

  11. Using Optimization Models for Scheduling in Enterprise Resource Planning Systems

    Directory of Open Access Journals (Sweden)

    Frank Herrmann

    2016-03-01

    Full Text Available Companies often use specially-designed production systems and change them from time to time. They produce small batches in order to satisfy specific demands with the least tardiness. This imposes high demands on high-performance scheduling algorithms which can be rapidly adapted to changes in the production system. As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System (in the SAP system for example or can be connected to it. In a real-world application of a flow shop with special restrictions this approach is successfully used on a standard personal computer. Thus, the main implication is that optimal scheduling with a commercially-available tool, incorporated in an Enterprise Resource Planning System, may be the best approach.

  12. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

  14. NRC comprehensive records disposition schedule. Revision 3

    International Nuclear Information System (INIS)

    1998-02-01

    Title 44 US Code, ''Public Printing and Documents,'' regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ''Management and Use of Information and Records,'' and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA's General Records Schedule (dated August 1995)

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

  16. Cure Schedule for Stycast 2651/Catalyst 9.

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-11-01

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

  17. Job shop scheduling problem with late work criterion

    Science.gov (United States)

    Piroozfard, Hamed; Wong, Kuan Yew

    2015-05-01

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

  18. Regulation of Blood Glucose Concentration in Type 1 Diabetics Using Single Order Sliding Mode Control Combined with Fuzzy On-line Tunable Gain, a Simulation Study

    OpenAIRE

    Dinani, Soudabeh Taghian; Zekri, Maryam; Kamali, Marzieh

    2015-01-01

    Diabetes is considered as a global affecting disease with an increasing contribution to both mortality rate and cost damage in the society. Therefore, tight control of blood glucose levels has gained significant attention over the decades. This paper proposes a method for blood glucose level regulation in type 1 diabetics. The control strategy is based on combining the fuzzy logic theory and single order sliding mode control (SOSMC) to improve the properties of sliding mode control method and...

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

  20. Practical principles in appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Mandjes, M.

    2015-01-01

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

  1. Scheduling algorithms for automatic control systems for technological processes

    Science.gov (United States)

    Chernigovskiy, A. S.; Tsarev, R. Yu; Kapulin, D. V.

    2017-01-01

    Wide use of automatic process control systems and the usage of high-performance systems containing a number of computers (processors) give opportunities for creation of high-quality and fast production that increases competitiveness of an enterprise. Exact and fast calculations, control computation, and processing of the big data arrays - all of this requires the high level of productivity and, at the same time, minimum time of data handling and result receiving. In order to reach the best time, it is necessary not only to use computing resources optimally, but also to design and develop the software so that time gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine/multiprocessor systems are applied. Some of basic task scheduling methods for the multi-machine process control systems are considered in this paper, their advantages and disadvantages come to light, and also some usage considerations, in case of the software for automatic process control systems developing, are made.

  2. Sport Tournament Automated Scheduling System

    Directory of Open Access Journals (Sweden)

    Raof R. A. A

    2018-01-01

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

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

    NARCIS (Netherlands)

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

    2005-01-01

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

  4. Scheduling nursing personnel on a microcomputer.

    Science.gov (United States)

    Liao, C J; Kao, C Y

    1997-01-01

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

  5. Vehicle and driver scheduling for public transit.

    Science.gov (United States)

    2009-08-01

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

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

    Science.gov (United States)

    2011-04-28

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

  7. A hybrid job-shop scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  8. Brief-stimulus presentations on multiform tandem schedules

    OpenAIRE

    Reed, Phil

    1994-01-01

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

  9. A customizable, scalable scheduling and reporting system.

    Science.gov (United States)

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

    2014-06-01

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

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

  11. Single machine scheduling with slack due dates assignment

    Science.gov (United States)

    Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin

    2017-04-01

    This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance (i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an ? time algorithm is proposed. Some extensions of the problem are also shown.

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

    Science.gov (United States)

    Butt, Muhammad Arif; Akram, Muhammad

    2016-01-01

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

  13. Parallel Machine Scheduling with Batch Delivery to Two Customers

    Directory of Open Access Journals (Sweden)

    Xueling Zhong

    2015-01-01

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

  14. Developing optimal nurses work schedule using integer programming

    Science.gov (United States)

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

    2017-08-01

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

  15. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

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

  16. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

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

  17. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

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

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

  19. Scheduling multimedia services in cloud computing environment

    Science.gov (United States)

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

    2018-02-01

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

  20. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2008-01-01

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

  1. Flow shop scheduling with heterogeneous workers

    OpenAIRE

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

    2014-01-01

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

  2. A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

    Science.gov (United States)

    Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

    2016-01-01

    There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

  3. An improved scheduling algorithm for linear networks

    KAUST Repository

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

    2017-01-01

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

  4. 21 CFR 113.83 - Establishing scheduled processes.

    Science.gov (United States)

    2010-04-01

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

  5. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

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

  6. Mechanisms for scheduling games with selfish players

    NARCIS (Netherlands)

    Hoeksma, R.P.

    2015-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Chandramouli Anandaraman

    2011-10-01

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

  9. Generation and exploration of aggregation abstractions for scheduling and resource allocation

    Science.gov (United States)

    Lowry, Michael R.; Linden, Theodore A.

    1993-01-01

    This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

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

  11. Work Scheduling by Use of Worker Model in Consideration of Learning by On-The-Job Training

    Science.gov (United States)

    Tateno, Toshitake; Shimizu, Keiko

    This paper deals with a method of scheduling manual work in consideration of learning by on-the-job training (OJT). In skilled work such as maintenance of trains and airplanes, workers must learn many tasks by OJT. While the work processing time of novice workers is longer than that of experts, the time will be reduced with repeated OJT. Therefore, OJT is important for maintaining the skill level and the long-term work efficiency of an organization. In order to devise a schedule considering OJT, the scheduler must incorporate a management function of workers to trace dynamically changing work experience. In this paper, after the relationship between scheduling problems and worker management problems is defined, a simulation method, in which a worker model and an agent-based mechanism are utilized, is proposed to derive the optimal OJT strategy toward high long-term performance. Finally, we present some case studies showing the effectiveness of OJT planning based on the simulation.

  12. Minimizing tardiness for job shop scheduling under uncertainties

    OpenAIRE

    Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

    2016-01-01

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

  13. Audit on the Efficient Use of Cross-Matched Blood in Elective Total Hip and Total Knee Replacement

    Science.gov (United States)

    Rogers, BA; Johnstone, DJ

    2006-01-01

    INTRODUCTION This prospective audit studies the use of cross-matched blood in 301 patients over a 1-year period undergoing total knee (TKR) and total hip replacement (THR) surgery in an orthopaedic unit. PATIENTS AND METHODS Analysis over the first 6 months revealed a high level of unnecessary cross-matched blood. The following interventions were introduced: (i) to cease routine cross-matching for THR; (ii) all patients to have a check full blood count on day 2 after surgery; and (iii) Hb < 8 g/dl to be considered as the trigger for transfusion in patients over 65 years and free from significant co-morbidity. These changes are in accordance with published national guidelines [Anon. Guidelines for the clinical use of red cell transfusions. Br J Haematol 2001; 113: 24–31]. RESULTS In the next 6 months, the number of units cross-matched but not transfused fell by 96% for THR, and the cross-match transfusion (C:T) ratio reduced from 3.21 to 1.62. Reductions were also observed for the TKR cohort. These results provide evidence of a substantial risk and cost benefit in the use of this limited resource. A telephone survey of 44 hospitals revealed that 20 hospitals routinely cross-matched blood for THR and 11 do so for TKR. CONCLUSIONS Changes can be made to the Maximum Surgical Blood Ordering Schedules (MSBOS) in other orthopaedic units according to national guidelines. PMID:16551419

  14. Fractionated total body irradiation; the gastrointestinal toxicity versus the conditioning effect for bone marrow transplantation with different fractionation schedules

    International Nuclear Information System (INIS)

    Walma, E.P.; Klapwijk, W.M.; Miller, A.M.

    1982-01-01

    In most cases, bone marrow transplantation is preceded by a conditioning regimen employing irradiation and/or cytotoxic drugs. The authors are searching for better fractionation schedules in order to optimize the conditioning regimen prior to transplantation of stem-cell-enriched bone marrow. They have determined damage to the gastrointestinal tract in dogs and mice after total body irradiation in mice and dogs following a number of fractionation schedules, and these results are presented. The schedules were chosen such as to minimize the interval between irradiation and the bone marrow transplantation and to maximize clinical feasibility. (Auth./C.F.)

  15. 14 CFR 399.81 - Unrealistic or deceptive scheduling.

    Science.gov (United States)

    2010-01-01

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

  16. A multi-group and preemptable scheduling of cloud resource based on HTCondor

    Science.gov (United States)

    Jiang, Xiaowei; Zou, Jiaheng; Cheng, Yaodong; Shi, Jingyan

    2017-10-01

    Due to the features of virtual machine-flexibility, easy controlling and various system environments, more and more fields utilize the virtualization technology to construct the distributed system with the virtual resources, also including high energy physics. This paper introduce a method used in high energy physics that supports multiple resource group and preemptable cloud resource scheduling, combining virtual machine with HTCondor (a batch system). It makes resource controlling more flexible and more efficient and makes resource scheduling independent of job scheduling. Firstly, the resources belong to different experiment-groups, and the type of user-groups mapping to resource-groups(same as experiment-group) is one-to-one or many-to-one. In order to make the confused group simply to be managed, we designed the permission controlling component to ensure that the different resource-groups can get the suitable jobs. Secondly, for the purpose of elastically allocating resources for suitable resource-group, it is necessary to schedule resources like scheduling jobs. So this paper designs the cloud resource scheduling to maintain a resource queue and allocate an appropriate amount of virtual resources to the request resource-group. Thirdly, in some kind of situations, because of the resource occupied for a long time, resources need to be preempted. This paper adds the preemption function for the resource scheduling that implement resource preemption based on the group priority. Additionally, the way to preempting is soft that when virtual resources are preempted, jobs will not be killed but also be held and rematched later. It is implemented with the help of HTCondor, storing the held job information in scheduler, releasing the job to idle status and doing second matcher. In IHEP (institute of high energy physics), we have built a batch system based on HTCondor with a virtual resources pool based on Openstack. And this paper will show some cases of experiment JUNO

  17. LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

    OpenAIRE

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

    2015-01-01

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

  18. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  19. 33 CFR 401.58 - Pleasure craft scheduling.

    Science.gov (United States)

    2010-07-01

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

  20. Spike: Artificial intelligence scheduling for Hubble space telescope

    Science.gov (United States)

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

    1990-01-01

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

  1. Virtual blood bank

    Directory of Open Access Journals (Sweden)

    Kit Fai Wong

    2011-01-01

    Full Text Available Virtual blood bank is the computer-controlled, electronically linked information management system that allows online ordering and real-time, remote delivery of blood for transfusion. It connects the site of testing to the point of care at a remote site in a real-time fashion with networked computers thus maintaining the integrity of immunohematology test results. It has taken the advantages of information and communication technologies to ensure the accuracy of patient, specimen and blood component identification and to enhance personnel traceability and system security. The built-in logics and process constraints in the design of the virtual blood bank can guide the selection of appropriate blood and minimize transfusion risk. The quality of blood inventory is ascertained and monitored, and an audit trail for critical procedures in the transfusion process is provided by the paperless system. Thus, the virtual blood bank can help ensure that the right patient receives the right amount of the right blood component at the right time.

  2. Scheduling algorithms for rapid imaging using agile Cubesat constellations

    Science.gov (United States)

    Nag, Sreeja; Li, Alan S.; Merrick, James H.

    2018-02-01

    optimality of the dynamic programming solution for single satellites was within 10%, and find up to 5% more optimal solutions. The optimality gap for constellations was found to be 22% at worst, but the dynamic programming schedules were found at nearly four orders of magnitude better computational speed than integer programming. The algorithm can include cloud cover predictions, ground downlink windows or any other spatial, temporal or angular constraints into the orbital module and be integrated into planning tools for agile constellations.

  3. Effect of Pre-Construction on Construction Schedule and Client Loyalty

    OpenAIRE

    Jong Hoon Kim; Hyun-Soo Lee; Moonseo Park; Min Jeong; Inbeom Lee

    2016-01-01

    Pre-construction is essential in achieving the success of a construction project. Due to the early involvement of project participants in the construction phase, project managers are able to plan ahead and solve issues well in advance leading to the success of the project and the satisfaction of the client. This research utilizes quantitative data derived from construction management projects in order to identify the relationship between pre-construction, construction schedule, and client sat...

  4. A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity

    Directory of Open Access Journals (Sweden)

    Kenzo KURIHARA

    2005-02-01

    Full Text Available We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1the variation of productive capacity, and (2the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.

  5. Practicing field hockey skills along the contextual interference continuum: a comparison of five practice schedules.

    Science.gov (United States)

    Cheong, Jadeera Phaik Geok; Lay, Brendan; Grove, J Robert; Medic, Nikola; Razman, Rizal

    2012-01-01

    To overcome the weakness of the contextual interference (CI) effect within applied settings, Brady, 2008 recommended that the amount of interference be manipulated. This study investigated the effect of five practice schedules on the learning of three field hockey skills. Fifty-five pre-university students performed a total of 90 trials for each skill under blocked, mixed or random practice orders. Results showed a significant time effect with all five practice conditions leading to improvements in acquisition and learning of the skills. No significant differences were found between the groups. The findings of the present study did not support the CI effect and suggest that either blocked, mixed, or random practice schedules can be used effectively when structuring practice for beginners. Key pointsThe contextual interference effect did not surface when using sport skills.There appears to be no difference between blocked and random practice schedules in the learning of field hockey skills.Low (blocked), moderate (mixed) or high (random) interference practice schedules can be used effectively when conducting a multiple skill practice session for beginners.

  6. Development of Multivariable Models to Predict and Benchmark Transfusion in Elective Surgery Supporting Patient Blood Management.

    Science.gov (United States)

    Hayn, Dieter; Kreiner, Karl; Ebner, Hubert; Kastner, Peter; Breznik, Nada; Rzepka, Angelika; Hofmann, Axel; Gombotz, Hans; Schreier, Günter

    2017-06-14

    Blood transfusion is a highly prevalent procedure in hospitalized patients and in some clinical scenarios it has lifesaving potential. However, in most cases transfusion is administered to hemodynamically stable patients with no benefit, but increased odds of adverse patient outcomes and substantial direct and indirect cost. Therefore, the concept of Patient Blood Management has increasingly gained importance to pre-empt and reduce transfusion and to identify the optimal transfusion volume for an individual patient when transfusion is indicated. It was our aim to describe, how predictive modeling and machine learning tools applied on pre-operative data can be used to predict the amount of red blood cells to be transfused during surgery and to prospectively optimize blood ordering schedules. In addition, the data derived from the predictive models should be used to benchmark different hospitals concerning their blood transfusion patterns. 6,530 case records obtained for elective surgeries from 16 centers taking part in two studies conducted in 2004-2005 and 2009-2010 were analyzed. Transfused red blood cell volume was predicted using random forests. Separate models were trained for overall data, for each center and for each of the two studies. Important characteristics of different models were compared with one another. Our results indicate that predictive modeling applied prior surgery can predict the transfused volume of red blood cells more accurately (correlation coefficient cc = 0.61) than state of the art algorithms (cc = 0.39). We found significantly different patterns of feature importance a) in different hospitals and b) between study 1 and study 2. We conclude that predictive modeling can be used to benchmark the importance of different features on the models derived with data from different hospitals. This might help to optimize crucial processes in a specific hospital, even in other scenarios beyond Patient Blood Management.

  7. Out-of-order event processing in kinetic data structures

    DEFF Research Database (Denmark)

    Abam, Mohammad; de Berg, Mark; Agrawal, Pankaj

    2011-01-01

    ’s for the maintenance of several fundamental structures such as kinetic sorting and kinetic tournament trees, which overcome the difficulty by employing a refined event scheduling and processing technique. We prove that the new event scheduling mechanism leads to a KDS that is correct except for finitely many short......We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and events may be processed in a wrong order. In traditional KDS’s this can lead to major inconsistencies from which the KDS cannot recover. We present more robust KDS...

  8. A comparison of total amount of blood needed in patients taking autologous or homologous blood transfusion in coronary artery bypass grafting a clinical randomized case control trial

    International Nuclear Information System (INIS)

    Akhlagh, S.H.; Chohedri, A.H.; Bazojoo, A.; Nemati, M.H.

    2007-01-01

    The aim of this clinical case-control trial was to compare the total amount of blood needed in patients taking autologous or homologous blood transfusion in coronary artery bypass grafting (CABG) surgery. Sixty patients scheduled for CABG were randomly allocated to ANH (Acute Normovulemic Hemodynamic) group (A group) or control group (B group). Hematocrit before operation and 24 hours after the operation were checked. The amount of the total blood needed in each group was measured at the end of the operation. There was no significant difference between the two groups as regards post operational hematocrit. The mean total blood infused to the control and ANH group was 2010 ml and 1815 ml respectively. However there was significant difference between the two groups as regards the total amount of the blood needed during operation. Our randomized, double blinded case control study demonstrated that autologous blood, beside carrying lower risks for hemolytic and nonhemolytic transfusion reactions decrease the total amount of blood needed for CABG. However larger studies with more patients are needed to confirm the results. (author)

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

  10. Decay-usage scheduling in multiprocessors

    NARCIS (Netherlands)

    Epema, D.H.J.

    1998-01-01

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

  11. A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2017-01-01

    Full Text Available In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES and improved population diversity strategy (IPDS are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective.

  12. Scheduling and control of programs in the CICADA computer system for TFTR

    International Nuclear Information System (INIS)

    Christianson, G.B.; Sherrick, M.; Stark, W.

    1983-01-01

    The CICADA computer system is a network of super minicomputers for data acquisition, reduction, display and device control on the TFTR experiment. Human interaction with the CICADA system is accomplished by consoles offering color displays with a high degree of operator interaction with the computer system, and by interactive terminals offering a limited degree of operator interaction. The authors describe the software packages and data bases used to control the consoles and provide communication to an application program attached to a console. The console control program in its turn schedules the execution of control programs that furnish operating system interfaces to applications programs executing at a console or terminal (in response to human activation), or upon activation by scheduling tasks. The control programs handle functions such as applications task activation. They discuss the implementation of the control programs in the multi-computer CICADA environment, and describe the control program data bases. In a TFTR shot cycle, applications programs must be scheduled for activation at operator-defined stages, in order to accomplish the arming of hardware devices, acquisition of summary waveform data, and the acquisition and archiving of raw data. The authors describe the software tasks and data bases of the CICADA event system, which accomplishes this scheduling of applications task activation in conjunction with the control programs. Future enhancements planned for the console control, program control, and event systems are outlined

  13. Development of an improved installation procedure and schedule of RVI modularization for APR1400

    International Nuclear Information System (INIS)

    Ko, Do Young

    2011-01-01

    The construction technology for reactor vessel internals (RVI) modularization is one of the most important factors to be considered in reducing the construction period of nuclear power plants. For RVI modularization, gaps between the reactor vessel (RV) core-stabilizing lug and the core support barrel (CSB) snubber lug must be measured using a remote method from outside the RV. In order to measure RVI gaps remotely at nuclear power plant construction sites, certain core technologies must be developed and verified. These include a remote measurement system to measure the gaps between the RV core-stabilizing lug and the CSB snubber lug, an RVI mockup to perform the gap measurement tests, and a new procedure and schedule for RVI installation. A remote measurement system was developed previously, and a gap measurement test was completed successfully using the RVI mockup. We also developed a new procedure and schedule for RVI installation. This paper presents the new and improved installation procedure and schedule for RVI modularization. These are expected to become core technologies that will allow us to shorten the construction period by a minimum of two months compared to the existing installation procedure and schedule

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

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

  16. Changes of RAAS in maternal and placental blood during caesarean operation

    International Nuclear Information System (INIS)

    Huang Daihua; Cui Bangping; Hu Wei; Zhou Wei

    2006-01-01

    To study changes of renin-angiotensin-aldosterone system (RAAS) and influence of anesthetic effect on it during caesarean operation, PRA, AT II and ALD in maternal and placental blood were determined by RIA for 30 healthy women scheduled for caesarean operation. Blood was taken before anesthesia(T 0 group) and just at the end of surgery (T 1 group) for comparison. Results showed that there were significant differences in PRA(P 0 and T 1 group, but there were no significant differences in ALD, PRA and AT II between placental blood, umbilical arteria and vein blood. The data suggest that there was obvious relationship between anesthetic effect and the secretion of RAAS. The levels of AT II, ALD and PRA in patients of partial block anesthesia were significantly than those in patients of complete block anesthesia. (authors)

  17. Temporal distribution of blood donations in three Brazilian blood centers and its repercussion on the blood supply.

    Science.gov (United States)

    Oliveira, Claudia Di Lorenzo; de Almeida-Neto, Cesar; Liu, Emily Jing; Sabino, Ester Cerdeira; Leão, Silvana Carneiro; Loureiro, Paula; Wright, David; Custer, Brian; Gonçalez, Thelma Therezinha; Capuani, Ligia; Busch, Michael; Proietti, Anna Bárbara de Freitas Carneiro

    2013-01-01

    Seasonal distribution of blood donation hinders efforts to provide a safe and adequate blood supply leading to chronic and persistent shortages. This study examined whether holidays, geographical area and donation type (community versus replacement) has any impact on the fluctuation of donations. The numbers of blood donations from 2007 through 2010 in three Brazilian Retrovirus Epidemiological Donor Study II (REDS-II) participating centers were analyzed according to the week of donation. The weeks were classified as holiday or non-holiday. To compare donations performed during holiday versus non-holiday weeks, tabulations and descriptive statistics for weekly donations by blood center were examined and time series analysis was conducted. The average weekly number of donations varied according to the blood center and type of week. The average number of donations decreased significantly during Carnival and Christmas and increased during the Brazilian National Donor Week. The fluctuation was more pronounced in Recife and Belo Horizonte when compared to São Paulo and higher among community donors. National bank holidays affect the blood supply by reducing available blood donations. Blood banks should take into account these oscillations in order to plan local campaigns, aiming at maintaining the blood supply at acceptable levels.

  18. Flexible Work Schedules. ERIC Digest.

    Science.gov (United States)

    Kerka, Sandra

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

  19. Toward an Autonomous Telescope Network: the TBT Scheduler

    Science.gov (United States)

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

    2015-09-01

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

  20. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event is availa......CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event...... 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...

  1. Modelling altered fractionation schedules

    International Nuclear Information System (INIS)

    Fowler, J.F.

    1993-01-01

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

  2. Pittsburgh International Airport - Scheduled Passenger Traffic

    Data.gov (United States)

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

  3. Cloud Service Scheduling Algorithm Research and Optimization

    Directory of Open Access Journals (Sweden)

    Hongyan Cui

    2017-01-01

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

  4. A Gas Scheduling Optimization Model for Steel Enterprises

    Directory of Open Access Journals (Sweden)

    Niu Honghai

    2017-01-01

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

  5. Where do we stand with fuzzy project scheduling?

    CERN Document Server

    Bonnal, Pierre; Lacoste, Germain

    2004-01-01

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

  6. Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

    Science.gov (United States)

    Zelinski, Shannon; Windhorst, Robert

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Mohd Usama

    2017-11-01

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

  8. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

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

  9. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

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

  10. Staffing, overtime, and shift scheduling project

    International Nuclear Information System (INIS)

    Lewis, P.M.

    1989-01-01

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

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

    Science.gov (United States)

    2013-02-27

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

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

  13. Time and Identity: Socializing Schedules and the Implications for Community

    OpenAIRE

    Kattan, Shlomy

    2008-01-01

    This article analyzes data collected as part of an ethnography of three families of Israeli emissaries (shlichim) in order to explore the relationship between the individual, the schedules to which s/he adheres, and her/his affiliation with a particular collective. The paper examines the relationship between time, community, and self through a discourse analytic lens that draws on approaches to the study of cultural identity which look to tension as definitive of groups and their members. It ...

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

  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. MODELLING TEMPORAL SCHEDULE OF URBAN TRAINS USING AGENT-BASED SIMULATION AND NSGA2-BASED MULTIOBJECTIVE OPTIMIZATION APPROACHES

    Directory of Open Access Journals (Sweden)

    M. Sahelgozin

    2015-12-01

    Full Text Available Increasing distances between locations of residence and services leads to a large number of daily commutes in urban areas. Developing subway systems has been taken into consideration of transportation managers as a response to this huge amount of travel demands. In developments of subway infrastructures, representing a temporal schedule for trains is an important task; because an appropriately designed timetable decreases Total passenger travel times, Total Operation Costs and Energy Consumption of trains. Since these variables are not positively correlated, subway scheduling is considered as a multi-criteria optimization problem. Therefore, proposing a proper solution for subway scheduling has been always a controversial issue. On the other hand, research on a phenomenon requires a summarized representation of the real world that is known as Model. In this study, it is attempted to model temporal schedule of urban trains that can be applied in Multi-Criteria Subway Schedule Optimization (MCSSO problems. At first, a conceptual framework is represented for MCSSO. Then, an agent-based simulation environment is implemented to perform Sensitivity Analysis (SA that is used to extract the interrelations between the framework components. These interrelations is then taken into account in order to construct the proposed model. In order to evaluate performance of the model in MCSSO problems, Tehran subway line no. 1 is considered as the case study. Results of the study show that the model was able to generate an acceptable distribution of Pareto-optimal solutions which are applicable in the real situations while solving a MCSSO is the goal. Also, the accuracy of the model in representing the operation of subway systems was significant.

  17. Modeling the Cray memory scheduler

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-04-01

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

  18. Decoupling algorithms from schedules for easy optimization of image processing pipelines

    OpenAIRE

    Adams, Andrew; Paris, Sylvain; Levoy, Marc; Ragan-Kelley, Jonathan Millar; Amarasinghe, Saman P.; Durand, Fredo

    2012-01-01

    Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequence of conflating what computations define the algorithm, with decisions about storage and the order of computation. We refer to these latter two concerns as the schedule, including choices of tiling, fusion, recomputation vs. storage, vectorization, and parallelism. We propose a representation for feed-forward imagi...

  19. How often does the operating list follow the planned order? An analysis of elective maxillofacial operating lists.

    Science.gov (United States)

    Islam, Shofiq; Taylor, Christopher J; Ahmed, Siddiq; Ormiston, Ian W; Hayter, Jonathan P

    2015-12-01

    The authors explored consistency of the observed running order in operating sequence compared with prior scheduled listing. We analysed potential variables felt to be predictive in the chances of a patient having their procedure as previously scheduled. Data were retrospectively collected for a consecutive group of patients who underwent elective maxillofacial procedures over a four week period. The consistency of scheduled and observed running order was documented. We considered four independent variables (original list position, day of week, morning or afternoon list, seniority of surgeon) and analysed their relationship to the probability of a patient undergoing their operation as per listing. Logistic regression analysis was used to determine significant associations between predictor variables with an altered list order. Data were available for 35 lists (n = 133). 49% of lists were found to run according to prior given order, the remainder subject to some alteration. Logistic regression analysis showed a statistically significant association between original scheduled position and day of week, with list position consistency. Patients listed first were twelve times more likely to have their operation as listed compared to those placed fourth (OR 12.7, 95% CI 3.7-43, p lists at the start of a week were subject to less alteration (p lists showed some alteration to the previously printed order. It appears that being first on an elective list offers the greatest guarantee that a patient will have their operation as per prior schedule. It may be reasonable for clinicians to be mindful of potential operating list alterations when preparing their patients for elective surgery. Copyright © 2014 Royal College of Surgeons of Edinburgh (Scottish charity number SC005317) and Royal College of Surgeons in Ireland. Published by Elsevier Ltd. All rights reserved.

  20. Nuclear Installations (Jersey) Order 1980 SI No. 1527

    International Nuclear Information System (INIS)

    1980-01-01

    This Order extends to the Bailiwick of Jersey with the exceptions, adaptations and modifications specified in the Schedule to the Order, certain provisions of the Nuclear Installations Act 1965, as amended. It is the 1965 Act which implements the provisions of the Paris Convention and the Brussels Supplementary Convention in the United Kingdom. These provisions relate to the duty in respect of the carriage of nuclear matter, to the right to compensation for breach of that duty and to the bringing and satisfaction of claims and other matters. This Order came into operation on 3 November 1980. (NEA) [fr

  1. A Generalized Ant Colony Algorithm for Job一shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    ZHANG Hong-Guo

    2017-02-01

    Full Text Available Aiming at the problem of ant colony algorithm for solving Job一shop scheduling problem. Considering the complexity of the algorithm that uses disjunctive graph to describe the relationship between workpiece processing. To solve the problem of optimal solution,a generalized ant colony algorithm is proposed. Under the premise of considering constrained relationship between equipment and process,the pheromone update mechanism is applied to solve Job-shop scheduling problem,so as to improve the quality of the solution. In order to improve the search efficiency,according to the state transition rules of ant colony algorithm,this paper makes a detailed study on the selection and improvement of the parameters in the algorithm,and designs the pheromone update strategy. Experimental results show that a generalized ant colony algorithm is more feasible and more effective. Compared with other algorithms in the literature,the results prove that the algorithm improves in computing the optimal solution and convergence speed.

  2. Gaussian variable neighborhood search for the file transfer scheduling problem

    Directory of Open Access Journals (Sweden)

    Dražić Zorica

    2016-01-01

    Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

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

    Science.gov (United States)

    Tang, Dunbing; Dai, Min

    2015-09-01

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

  4. Evaluation and Selection of Best Priority Sequencing Rule in Job Shop Scheduling using Hybrid MCDM Technique

    Science.gov (United States)

    Kiran Kumar, Kalla; Nagaraju, Dega; Gayathri, S.; Narayanan, S.

    2017-05-01

    Priority Sequencing Rules provide the guidance for the order in which the jobs are to be processed at a workstation. The application of different priority rules in job shop scheduling gives different order of scheduling. More experimentation needs to be conducted before a final choice is made to know the best priority sequencing rule. Hence, a comprehensive method of selecting the right choice is essential in managerial decision making perspective. This paper considers seven different priority sequencing rules in job shop scheduling. For evaluation and selection of the best priority sequencing rule, a set of eight criteria are considered. The aim of this work is to demonstrate the methodology of evaluating and selecting the best priority sequencing rule by using hybrid multi criteria decision making technique (MCDM), i.e., analytical hierarchy process (AHP) with technique for order preference by similarity to ideal solution (TOPSIS). The criteria weights are calculated by using AHP whereas the relative closeness values of all priority sequencing rules are computed based on TOPSIS with the help of data acquired from the shop floor of a manufacturing firm. Finally, from the findings of this work, the priority sequencing rules are ranked from most important to least important. The comprehensive methodology presented in this paper is very much essential for the management of a workstation to choose the best priority sequencing rule among the available alternatives for processing the jobs with maximum benefit.

  5. Integrated Cost and Schedule Control Systems for Nuclear Power Plant Construction: Leveraging Strategic Advantages to Owners and EPC Firms

    Directory of Open Access Journals (Sweden)

    Youngsoo Jung

    2015-01-01

    Full Text Available As the owners expect that the cost and time for nuclear power plant construction would decrease with new entrants into the market, there will be severer competition in the nuclear industry. In order to achieve performance improvement and to attain competitive advantages under the globalized competition, practitioners and researchers in the nuclear industry have recently exerted efforts to develop an advanced and efficient management methodology for the nuclear mega-projects. Among several candidates, integrated cost and schedule control system is of great concern because it can effectively manage the three most important project performances including cost, time, and quality. In this context, the purpose of this paper is to develop a project numbering system (PNS of integrated cost and schedule control system for nuclear power plant construction. Distinct attributes of nuclear power plant construction were investigated first in order to identify influencing variables that characterize real-world implementation of advanced cost and schedule controls. A scenario was then developed and analysed to simulate a case-project. By using this case-project, proposed management requirements, management methods, measurement techniques, data structure, and data collection methods for integrated cost and schedule PNS were illustrated. Finally, findings and implications are outlined, and recommendations for further research are presented.

  6. Robust Optimization for Household Load Scheduling with Uncertain Parameters

    Directory of Open Access Journals (Sweden)

    Jidong Wang

    2018-04-01

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

  7. Prevalence of the β(S) gene among scheduled castes, scheduled tribes and other backward class groups in Central India.

    Science.gov (United States)

    Shrikhande, Anuradha V; Arjunan, Aishwarya; Agarwal, Amit; Dani, Aarti; Tijare, Jayashri; Gettig, Elizabeth; Krishnamurti, Lakshmanan

    2014-01-01

    Sickle cell disease is an inherited disorder of the blood, and characterized by vasoocclusive crises (VOC), risks for pneumococcal infections and organ toxicities, is associated with morbidity and premature mortality. India, with a population of 1.2 billion individuals, is estimated to be home to over 50.0% of the world's patients with sickle cell disease. The β(S) gene [β6(A3)Glu→Val; HBB: c.20A>T] has the highest prevalence in three socio-economically disadvantaged ethnic categories: the Scheduled Castes (SC), the Scheduled Tribes (ST), and Other Backward Class (OBC) groups in India. The tradition of endogamy practiced by the ethnic groups in India provides the rationale for the screening of individual populations to better understand the distribution of the β(S) gene, guide counseling and awareness programs and aid development of public policy. We undertook a study to describe the prevalence of the β(S) gene in these ethnic groups in the district of Nagpur, Maharashtra in Central India. Through community screening and subsequent targeted screening of high risk individuals, 35,636 individuals were screened, of whom 5466 were found to have sickle cell trait and 1010 were identified with sickle cell disease. Community screening revealed a sickle cell trait prevalence of 13.0% in the SC, 12.0% in the ST and 3.4% in the OBC population. This study describes the prevalence of the β(S) gene within these groups in Central India determined by large scale community screening. This program has uncovered previously undiagnosed cases, provided detailed information to guide population-based disease counseling, prevention and comprehensive care programs.

  8. The robust schedule - A link to improved workflow

    DEFF Research Database (Denmark)

    Lindhard, Søren; Wandahl, Søren

    2012-01-01

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

  9. Shiftwork Scheduling for the 1990s.

    Science.gov (United States)

    Coleman, Richard M.

    1989-01-01

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

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

  11. Fog computing job scheduling optimization based on bees swarm

    Science.gov (United States)

    Bitam, Salim; Zeadally, Sherali; Mellouk, Abdelhamid

    2018-04-01

    Fog computing is a new computing architecture, composed of a set of near-user edge devices called fog nodes, which collaborate together in order to perform computational services such as running applications, storing an important amount of data, and transmitting messages. Fog computing extends cloud computing by deploying digital resources at the premise of mobile users. In this new paradigm, management and operating functions, such as job scheduling aim at providing high-performance, cost-effective services requested by mobile users and executed by fog nodes. We propose a new bio-inspired optimization approach called Bees Life Algorithm (BLA) aimed at addressing the job scheduling problem in the fog computing environment. Our proposed approach is based on the optimized distribution of a set of tasks among all the fog computing nodes. The objective is to find an optimal tradeoff between CPU execution time and allocated memory required by fog computing services established by mobile users. Our empirical performance evaluation results demonstrate that the proposal outperforms the traditional particle swarm optimization and genetic algorithm in terms of CPU execution time and allocated memory.

  12. Discordance between 'actual' and 'scheduled' check-in times at a heart failure clinic.

    Science.gov (United States)

    Gorodeski, Eiran Z; Joyce, Emer; Gandesbery, Benjamin T; Blackstone, Eugene H; Taylor, David O; Tang, W H Wilson; Starling, Randall C; Hachamovitch, Rory

    2017-01-01

    A 2015 Institute Of Medicine statement "Transforming Health Care Scheduling and Access: Getting to Now", has increased concerns regarding patient wait times. Although waiting times have been widely studied, little attention has been paid to the role of patient arrival times as a component of this phenomenon. To this end, we investigated patterns of patient arrival at scheduled ambulatory heart failure (HF) clinic appointments and studied its predictors. We hypothesized that patients are more likely to arrive later than scheduled, with progressively later arrivals later in the day. Using a business intelligence database we identified 6,194 unique patients that visited the Cleveland Clinic Main Campus HF clinic between January, 2015 and January, 2017. This clinic served both as a tertiary referral center and a community HF clinic. Transplant and left ventricular assist device (LVAD) visits were excluded. Punctuality was defined as the difference between 'actual' and 'scheduled' check-in times, whereby negative values (i.e., early punctuality) were patients who checked-in early. Contrary to our hypothesis, we found that patients checked-in late only a minority of the time (38% of visits). Additionally, examining punctuality by appointment hour slot we found that patients scheduled after 8AM had progressively earlier check-in times as the day progressed (P < .001 for trend). In both a Random Forest-Regression framework and linear regression models the most important risk-adjusted predictors of early punctuality were: later in the day appointment hour slot, patient having previously been to the hospital, age in the early 70s, and white race. Patients attending a mixed population ambulatory HF clinic check-in earlier than scheduled times, with progressive discrepant intervals throughout the day. This finding may have significant implications for provider utilization and resource planning in order to maximize clinic efficiency. The impact of elective early arrival on

  13. TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal Saud Yousef; Jamshaid, Kamran; Shihada, Basem; Ho, Pin-Han

    2011-01-01

    We propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended

  14. Planning construction of integrative schedule management for nuclear power project

    International Nuclear Information System (INIS)

    Zeng Zhenglin; Wang Wenying; Peng Fei

    2012-01-01

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

  15. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    Squires, K.G.

    1995-01-01

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

  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. A low-hemolysis blood aspirator conserves blood during surgery.

    Science.gov (United States)

    Clague, C T; Blackshear, P L

    1995-01-01

    Blood damage caused by traditional vacuum-operated suction tubes, particularly when air is aspirated along with the blood, usually exceeds damage from all other components. In addition to platelet injury, there is a high degree of hemolysis, which leads to high plasma hemoglobin levels and reduces the number of red blood cells available for reinfusion during cases of blood conservation, such as autologous transfusion and cardiac bypass. This work was undertaken to minimize hemolysis, and the accompanying platelet destruction, during aspiration, with the design of a jet-driven aspirator that separates and removes air from blood immediately within the suction tip. The jet-driven aspirator can suction blood at a range of rates from 100 to at least 700 ml/min, separates and removes 80-100% of aspirated air, operates at any orientation, and generates subatmospheric pressures on the order of only 1 inch H2O. In-vitro hemolysis testing showed a significant reduction in average plasma hemoglobin release, from 19.4 mg/dl to 1.8 mg/dl, when air was removed during blood aspiration. In comparative testing with a conventional vacuum suction tube, the jet-driven aspirator showed significantly less hemolysis than the conventional aspirator at comparable rates of air and blood aspiration.

  18. A theory of behaviour on progressive ratio schedules, with applications in behavioural pharmacology.

    Science.gov (United States)

    Bradshaw, C M; Killeen, P R

    2012-08-01

    Mathematical principles of reinforcement (MPR) provide the theoretical basis for a family of models of schedule-controlled behaviour. A model of fixed-ratio schedule performance that was applied to behaviour on progressive ratio (PR) schedules showed systematic departures from the data. This study aims to derive a new model from MPR that will account for overall and running response rates in the component ratios of PR schedules, and their decline toward 0, the breakpoint. The role of pausing is represented in a real-time model containing four parameters: T (0) and k are the intercept and slope of the linear relation between post-reinforcement pause duration and the prior inter-reinforcer interval; a (specific activation) measures the incentive value of the reinforcer; δ (response time) sets biomechanical limits on response rate. Running rate is predicted to decrease with negative acceleration as ratio size increments, overall rate to increase and then decrease. Differences due to type of progression are explained as hysteresis in the control by reinforcement rates. Re-analysis of extant data focuses on the effects of acute treatment with antipsychotic drugs, lesions of the nucleus accumbens core, and destruction of orexinergic neurones of the lateral hypothalamus. The new model resolves some anomalies evident in earlier analyses, and provides new insights to the results of these interventions. Because they can render biologically relevant parameters, mathematical models can provide greater power in interpreting the effects of interventions on the processes underlying schedule-controlled behaviour than is possible for first-order data such as the breakpoint.

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

  20. Microgrid optimal scheduling considering impact of high penetration wind generation

    Science.gov (United States)

    Alanazi, Abdulaziz

    The objective of this thesis is to study the impact of high penetration wind energy in economic and reliable operation of microgrids. Wind power is variable, i.e., constantly changing, and nondispatchable, i.e., cannot be controlled by the microgrid controller. Thus an accurate forecasting of wind power is an essential task in order to study its impacts in microgrid operation. Two commonly used forecasting methods including Autoregressive Integrated Moving Average (ARIMA) and Artificial Neural Network (ANN) have been used in this thesis to improve the wind power forecasting. The forecasting error is calculated using a Mean Absolute Percentage Error (MAPE) and is improved using the ANN. The wind forecast is further used in the microgrid optimal scheduling problem. The microgrid optimal scheduling is performed by developing a viable model for security-constrained unit commitment (SCUC) based on mixed-integer linear programing (MILP) method. The proposed SCUC is solved for various wind penetration levels and the relationship between the total cost and the wind power penetration is found. In order to reduce microgrid power transfer fluctuations, an additional constraint is proposed and added to the SCUC formulation. The new constraint would control the time-based fluctuations. The impact of the constraint on microgrid SCUC results is tested and validated with numerical analysis. Finally, the applicability of proposed models is demonstrated through numerical simulations.