WorldWideScience

Sample records for blood order schedule

  1. Maximum surgical blood ordering schedule in a tertiary trauma center in northern India: A proposal

    Directory of Open Access Journals (Sweden)

    Arulselvi Subramanian

    2012-01-01

    ordering schedule. Regular auditing and periodic feedbacks are also vital to improve the blood utilization practices.

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

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

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

  5. Second-order schedules of token reinforcement: effects of varying the schedule of food presentation1

    Science.gov (United States)

    Malagodi, E. F.; Webbe, Frank M.; Waddell, Thomas R.

    1975-01-01

    In the initial link of a complex schedule, one discriminative stimulus was presented and lever pressing produced tokens on fixed-ratio schedules. In the terminal link, signalled by a second discriminative stimulus, deposits of the tokens produced food. With two rats, the terminal link was presented after each sixth component schedule of token reinforcement was completed. With the other two rats, the terminal link was presented following the first component schedule completed after a fixed interval. During the terminal link, each token deposit initially produced food. The schedule of food presentation was subsequently increased such that an increasing number of token deposits in the terminal link was required for each food presentation. Rates of lever pressing in the initial link were inversely related to the schedule of food presentation in the terminal link. These results are similar to those of experiments that have varied schedules of food presentation in chained schedules. Rates and patterns of responding controlled throughout the initial link were more similar to those ordinarily controlled by second-order brief-stimulus schedules than to those controlled by comparable extended chained schedules. PMID:16811869

  6. Schedules of controlled substances: temporary placement of three synthetic cathinones in Schedule I. Final Order.

    Science.gov (United States)

    2011-10-21

    The Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cathinones under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are 4-methyl-N-methylcathinone (mephedrone), 3,4-methylenedioxy-N-methylcathinone (methylone), and 3,4-methylenedioxypyrovalerone (MDPV). This action is based on a finding by the Administrator that the placement of these synthetic cathinones 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 its 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 cathinones.

  7. Scheduling and order acceptance for the customised stochastic lot scheduling problem

    NARCIS (Netherlands)

    van Foreest, Nicky D.; Wijngaard, Jacob; van der Vaart, Taco

    2010-01-01

    This paper develops and analyses several customer order acceptance policies to achieve high bottleneck utilisation for the customised stochastic lot scheduling problem (CSLSP) with large setups and strict order due dates. To compare the policies, simulation is used as the main tool, due to the compl

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

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

  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. Second-order schedules of token reinforcement: comparisons of performance under fixed-ratio and variable-ratio exchange schedules.

    Science.gov (United States)

    Webbe, F M; Malagodi, E F

    1978-09-01

    Rats' lever pressing produced tokens according to a 20-response fixed-ratio schedule. Sequences of token schedules were reinforced under a second-order schedule by presentation of periods when tokens could be exchanged for food pellets. When the exchange period schedule was a six-response fixed ratio, patterns of completing the component token schedules were bivalued, with relatively long and frequent pauses marking the initiation of each new sequence. Altering the exchange period schedule to a six-response variable ratio resulted in sharp reductions in the frequency and duration of these initial pauses, and increases in overall rates of lever pressing. These results are comparable to those ordinarily obtained under simple fixed-ratio and variable-ratio schedules.

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

    Science.gov (United States)

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

    2013-08-01

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

  13. DYNAMIC ADVANCED PLANNING AND SCHEDULING WITH FROZEN INTERVAL FOR NEW ORDERS

    Institute of Scientific and Technical Information of China (English)

    CHEN Kejia; JI Ping

    2007-01-01

    A dynamic advanced planning and scheduling (DAPS) problem is addressed where new Orders arrive on a continuous basis. A periodic policy with frozen interval is adopted to increase stability on the shop floor. A genetic algorithm is developed to find a schedule at each rescheduling point for both original Orders and new orders that both production idle time and penalties on tardiness and earliness of orders are minimized. The proposed methodology is tested on a small example to illustrate the effect of the frozen interval. The results indicate that the suggested approach can improve the schedule stability while retaining efficiency.

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

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

  16. Second-order schedules of token reinforcement: comparisons of performance under fixed-ratio and variable-ratio exchange schedules1

    Science.gov (United States)

    Webbe, Frank M.; Malagodi, E. F.

    1978-01-01

    Rats' lever pressing produced tokens according to a 20-response fixed-ratio schedule. Sequences of token schedules were reinforced under a second-order schedule by presentation of periods when tokens could be exchanged for food pellets. When the exchange period schedule was a six-response fixed ratio, patterns of completing the component token schedules were bivalued, with relatively long and frequent pauses marking the initiation of each new sequence. Altering the exchange period schedule to a six-response variable ratio resulted in sharp reductions in the frequency and duration of these initial pauses, and increases in overall rates of lever pressing. These results are comparable to those ordinarily obtained under simple fixed-ratio and variable-ratio schedules. PMID:16812101

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

  18. An Order Insertion Scheduling Model of Logistics Service Supply Chain Considering Capacity and Time Factors

    Science.gov (United States)

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

  19. An Order Insertion Scheduling Model of Logistics Service Supply Chain Considering Capacity and Time Factors

    Directory of Open Access Journals (Sweden)

    Weihua Liu

    2014-01-01

    Full Text Available 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.

  20. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    Directory of Open Access Journals (Sweden)

    Zhang Yu

    2013-01-01

    Full Text Available By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  1. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    OpenAIRE

    Zhang Yu; Xiaomei Yang

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove it...

  2. Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.

    Science.gov (United States)

    Yu, Zhang; Yang, Xiaomei

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  3. The Health Behavior Schedule-II for Diabetes Predicts Self-Monitoring of Blood Glucose

    Science.gov (United States)

    Frank, Maxwell T.; Cho, Sungkun; Heiby, Elaine M.; Lee, Chun-I; Lahtela, Adrienne L.

    2006-01-01

    The Health Behavior Schedule-II for Diabetes (HBS-IID) is a 27-item questionnaire that was evaluated as a predictor of self-monitoring of blood glucose (SMBG). The HBS-IID was completed by 96 adults with Type 2 diabetes. Recent glycosylated hemoglobin HbA1c and fasting blood glucose results were taken from participants' medical records. Only 31.3%…

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

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

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

  6. Optimal scheduling of logistical support for medical resources order and shipment in community health service centers

    Directory of Open Access Journals (Sweden)

    Ming Liu

    2015-11-01

    Full Text Available Purpose: This paper aims to propose an optimal scheduling for medical resources order and shipment in community health service centers (CHSCs.Design/methodology/approach: This paper presents two logistical support models for scheduling medical resources in CHSCs. The first model is a deterministic planning model (DM, which systematically considers the demands for various kinds of medical resources, the lead time of supplier, the storage capacity and other constraints, as well as the integrated shipment planning in the dimensions of time and space. The problem is a multi-commodities flow problem and is formulated as a mixed 0-1 integer programming model. Considering the demand for medical resources is always stochastic in practice, the second model is constructed as a stochastic programming model (SM. A solution procedure is developed to solve the proposed two models and a simulation-based evaluation method is proposed to compare the performances of the proposed models. Findings andFindings: The main contributions of this paper includes the following two aspects: (1 While most research on medical resources optimization studies a static problem taking no consideration of the time evolution and especially the dynamic demand for such resources, the proposed models in our paper integrate time-space network technique, which can find the optimal scheduling of logistical support for medical resources order and shipment in CHSCs effectively. (2 The logistics plans in response to the deterministic demand and the time-varying demand are constructed as 0-1 mixed integer programming model and stochastic integer programming model, respectively. The optimal solutions not only minimize the operation cost of the logistics system, but also can improve the order and shipment operation in practice.Originality/value: Currently, medical resources in CHSCs are purchased by telephone or e-mail. The important parameters in decision making, i.e. order/shipment frequency

  7. PSECMAC intelligent insulin schedule for diabetic blood glucose management under nonmeal announcement.

    Science.gov (United States)

    Teddy, S D; Quek, C; Lai, E M-K; Cinar, A

    2010-03-01

    Therapeutically, the closed-loop blood glucose-insulin regulation paradigm via a controllable insulin pump offers a potential solution to the management of diabetes. However, the development of such a closed-loop regulatory system to date has been hampered by two main issues: 1) the limited knowledge on the complex human physiological process of glucose-insulin metabolism that prevents a precise modeling of the biological blood glucose control loop; and 2) the vast metabolic biodiversity of the diabetic population due to varying exogneous and endogenous disturbances such as food intake, exercise, stress, and hormonal factors, etc. In addition, current attempts of closed-loop glucose regulatory techniques generally require some form of prior meal announcement and this constitutes a severe limitation to the applicability of such systems. In this paper, we present a novel intelligent insulin schedule based on the pseudo self-evolving cerebellar model articulation controller (PSECMAC) associative learning memory model that emulates the healthy human insulin response to food ingestion. The proposed PSECMAC intelligent insulin schedule requires no prior meal announcement and delivers the necessary insulin dosage based only on the observed blood glucose fluctuations. Using a simulated healthy subject, the proposed PSECMAC insulin schedule is demonstrated to be able to accurately capture the complex human glucose-insulin dynamics and robustly addresses the intraperson metabolic variability. Subsequently, the PSECMAC intelligent insulin schedule is employed on a group of type-1 diabetic patients to regulate their impaired blood glucose levels. Preliminary simulation results are highly encouraging. The work reported in this paper represents a major paradigm shift in the management of diabetes where patient compliance is poor and the need for prior meal announcement under current treatment regimes poses a significant challenge to an active lifestyle.

  8. Negotiation in Multi-Agent System using Partial-Order Schedule

    Directory of Open Access Journals (Sweden)

    Ritu Sindhu

    2011-01-01

    Full Text Available In systems composed of multiple autonomous agents, negotiation is a key form of interaction that enables groups of agents to arrive at a mutual agreement regarding some belief, goal or plan, for example. In general, multi-linked negotiation (including both the directly linked and the indirectly linked relationships describes situations where one agent needs to negotiate with multiple agents about different issues, where the negotiation over one issue influences the negotiations over other issues. The characteristics of the commitment on one issue affect the evaluation of a commitment or the construction of a proposal for another issue. In this paper we built a partial order schedule representation with the help of which we effectively manage interacting negotiation issues.Also we explored how flexibility is an important factor for ordering and managing negotiation issues in a successful negotiation and enables an agent to reason explicitly about the interactions among multiple negotiation issues in order to achieve higher performance.

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

  10. Integrated production and distribution scheduling problems related to fixed delivery departure dates and weights of late orders.

    Science.gov (United States)

    Li, Shanlin; Li, Maoqin

    2015-01-01

    We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL) provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1) the total weight of late orders and (2) the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time.

  11. Decision theory for computing variable and value ordering decisions for scheduling problems

    Science.gov (United States)

    Linden, Theodore A.

    1993-01-01

    Heuristics that guide search are critical when solving large planning and scheduling problems, but most variable and value ordering heuristics are sensitive to only one feature of the search state. One wants to combine evidence from all features of the search state into a subjective probability that a value choice is best, but there has been no solid semantics for merging evidence when it is conceived in these terms. Instead, variable and value ordering decisions should be viewed as problems in decision theory. This led to two key insights: (1) The fundamental concept that allows heuristic evidence to be merged is the net incremental utility that will be achieved by assigning a value to a variable. Probability distributions about net incremental utility can merge evidence from the utility function, binary constraints, resource constraints, and other problem features. The subjective probability that a value is the best choice is then derived from probability distributions about net incremental utility. (2) The methods used for rumor control in Bayesian Networks are the primary way to prevent cycling in the computation of probable net incremental utility. These insights lead to semantically justifiable ways to compute heuristic variable and value ordering decisions that merge evidence from all available features of the search state.

  12. 77 FR 1549 - Order Limiting Scheduled Operations at Newark Liberty International Airport

    Science.gov (United States)

    2012-01-10

    ... 15, 2012. The construction schedule, which may be adjusted because of weather conditions, is: Nightly..., and the construction schedule, which limits the closures, reflects those discussions. FAA Analysis... Newark Liberty International Airport (EWR) due to construction at the airport during the summer 2012...

  13. Developing an Upper Bound and Heuristic Solution Algorithm for Order Scheduling Problem with Machines Idle Time Minimization

    Directory of Open Access Journals (Sweden)

    Hadi Mokhtari

    2013-01-01

    Full Text Available In this paper, the problem of received order scheduling by a manufacturer, with the measure of maximum completion times of orders, has been formulated and then an analytical approach has been devised for its solution. At the beginning of a planning period, the manufacturer receives a number of orders from customers, each of which requires two different stages for processing. In order to minimize the work in process inventories, the no-wait condition between two operations of each order is regarded. Then, the equality of obtained schedules is proved by machine idle time minimization, as objective, with the schedules obtained by maximum completion time minimization. A concept entitled “Order pairing” has been defined and an algorithm for achieving optimal order pairs which is based on symmetric assignment problem has been presented. Using the established order pairs, an upper bound has been developed based on contribution of every order pair out of total machines idle time. Out of different states of improving upper bound, 12 potential situations of order pairs sequencing have been also evaluated and then the upper bound improvement has been proved in each situation, separately. Finally, a heuristic algorithm has been developed based on attained results of pair improvement and a case study in printing industry has been investigated and analyzed to approve its applicability.

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

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

    Directory of Open Access Journals (Sweden)

    FLAVIA BOCHIS

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

  16. A new dosing schedule for gentamicin in blood pythons (Python curtus): a pharmacokinetic study.

    Science.gov (United States)

    Hilf, M; Swanson, D; Wagner, R; Yu, V L

    1991-03-01

    Gentamicin is frequently used in the treatment of aerobic Gram-negative infections in reptiles. Pharmacokinetic data to ensure proper dosing are scant, especially for large snakes. A pharmacokinetic study of gentamicin was therefore conducted in four blood pythons. Snakes were given intramuscular injections of either 2.5 mg kg-1 or 3.0 mg kg-1 loading dose followed by 1.5 mg kg-1 at 72 and 96 hours. A linear pharmacokinetic relationship between gentamicin serum concentrations and time was demonstrated in each of the four snakes studied. Peak serum concentrations occurred six to 10 hours after injection and ranged from 4.6 to 8.9 micrograms ml-1. Half-life was variable and ranged from 32 to 110 hours. Total body clearance and apparent volume of distribution varied little between the individual snakes studied. There was no evidence of renal toxicity. For blood pythons a loading dose of 2.5 mg kg-1 followed by 1.5 mg kg-1 at 96 hour intervals is recommended. If higher concentrations are desired, a loading dose of 3.0 mg kg-1 followed by 1.5 mg kg-1 at 96 hours can be given. These dosing schedules will provide serum concentrations in excess of the minimum inhibitory concentrations for most aerobic Gram-negative bacilli that are pathogenic in snakes; gentamicin accumulation with subsequent renal dysfunction should not occur.

  17. An integrated model of scheduling, batch delivery and supplier selection in a make-to-order manufacturing system

    Directory of Open Access Journals (Sweden)

    Mohammad Mahdavi Mazdeh

    2016-06-01

    Full Text Available This paper analyzes a supply chain, which consists of a manufacturer, a retailer and several suppliers in which the retailer orders jobs to the manufacturer and the suppliers provide the requiring parts. The manufacturer schedules and processes the orders and dispatches them to the retailer either individually or collectively in batches. The manufacturer incurs a penalty cost for each tardy job and a transportation cost for every delivered batch and therefore, searches for a schedule that yields minimum number of tardy jobs and batches. Moreover, the manufacturer tries to optimize its supplying cost through locating the suppliers that offer appropriate release times and costs for manufacturing parts. Since the release times of parts directly affect scheduling of orders, in this research, we develop an integrated mathematical model for the manufacturer that incorporates suppliers' selection issue into the scheduling and batching decisions. Furthermore, we present a heuristic algorithm (greedy algorithm and also a local search to quickly determine the optimal or near-optimal solutions. The computational analysis shows the importance of the integrated model and also the superiority and effectiveness of the heuristic algorithms.

  18. Integrated Production and Distribution Scheduling Problems Related to Fixed Delivery Departure Dates and Weights of Late Orders

    Directory of Open Access Journals (Sweden)

    Shanlin Li

    2015-01-01

    Full Text Available We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1 the total weight of late orders and (2 the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time.

  19. 75 FR 32987 - Orders Limiting Scheduled Operations at John F. Kennedy International Airport and Newark Liberty...

    Science.gov (United States)

    2010-06-10

    ... for a period of five or more consecutive days. \\1\\ 74 FR 51648 (Oct. 7, 2009) (EWR); 74 FR 51650 (Oct... Airport (JFK) and Newark Liberty International Airport (EWR). The FAA will treat as used any Operating Authorization that was scheduled for an operation between JFK or EWR and points in Europe from April 14...

  20. Comparison of dynamic scheduling policies for hybrid make-to-order and make-to-stock production systems with stochastic demand

    NARCIS (Netherlands)

    Soman, Chetan Anil; van Donk, Dirk Pieter; Gaalman, Gerard

    2006-01-01

    We examine the previously under-researched problem of scheduling a single stage, capacitated, hybrid make-to-order (MTO) and make-to-stock (MTS) production system with stochastic demand. We build on the Economic Lot Scheduling Problem (ELSP) literature and make some modifications to incorporate MTO

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

    Directory of Open Access Journals (Sweden)

    Weihua Liu

    2014-01-01

    Full Text Available 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.

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

  3. Drug seeking under a second-order schedule of reinforcement depends on dopamine D3 receptors in the basolateral amygdala.

    Science.gov (United States)

    Di Ciano, Patricia

    2008-02-01

    Drug seeking under the control of drug-associated stimuli and its reinstatement after extinction can be decreased by systemic administration of dopamine D3 receptor antagonists. It is demonstrated that responding by rats on the active lever for cocaine under a 2nd-order schedule of reinforcement, under which responding is maintained by response-contingent cocaine-paired conditioned reinforcers, is markedly attenuated by infusion of the dopamine D3 receptor antagonist SB-277011-A into the amygdala (2 and 4 microg/0.3 microl). By contrast, infusions of SB-277011-A into the shell subregion of the nucleus accumbens and also into the dorsal striatum were without effect. These results show that the control over drug seeking by conditioned reinforcers depends on D3 receptor-dependent dopamine transmission in the amygdala.

  4. Schedules of Controlled Substances: Extension of Temporary Placement of PB-22, 5F-PB-22, AB-FUBINACA and ADB-PINACA in Schedule I of the Controlled Substances Act. Final order.

    Science.gov (United States)

    2016-02-05

    The Administrator of the Drug Enforcement Administration is issuing this final order to extend the temporary schedule I status of four synthetic cannabinoids pursuant to the temporary scheduling provisions of the Controlled Substances Act. The substances are: quinolin-8-yl 1-pentyl-1H-indole-3-carboxylate (PB-22; QUPIC); quinolin-8-yl 1-(5-fluoropentyl)-1H-indole-3-carboxylate (5-fluoro-PB-22; 5F-PB-22); N-(1-amino-3-methyl-1-oxobutan-2-yl)-1-(4-fluorobenzyl)-1H-indazole-3-carboxamide (AB-FUBINACA); and N-(1-amino-3,3-dimethyl-1-oxobutan-2-yl)-1-pentyl-1H-indazole-3-carboxamide (ADB-PINACA), including their optical, positional and geometric isomers, salts, and salts of isomers. The current final order temporarily placing PB-22, 5F-PB-22, AB-FUBINACA, and ADB-PINACA into schedule I is in effect through February 9, 2016. This final order will extend the temporary scheduling of PB-22, 5F-PB-22, AB-FUBINACA, and ADB-PINACA for one year, or until the permanent scheduling action for these four substances is completed, whichever occurs first.

  5. Research on Fuzzy Decision of Resources Selection in Job-shop Scheduling for a One-of-a-Kind and Order-Oriented Production System

    Institute of Scientific and Technical Information of China (English)

    XIONG He-gen; LI Jian-jun; OUYANG Hong-qun; XIAO Xiang-zhi

    2004-01-01

    In a one-of-a-kind and order-oriented production corporation, job shop scheduling plays an important role in the production planning system and production process control. Since resource selection in job shop scheduling directly influences the qualities and due dates of products and production cost, it is indispensable to take resource selection into account during job shop scheduling. By analyzing the relative characteristics of resources, an approach of fuzzy decision is proposed for resource selection. Finally, issues in the application of the approach are discussed.

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

  8. The shop floor scheduling game

    NARCIS (Netherlands)

    Riezebos, Jan; Slomp, Jannes

    1995-01-01

    The aim of the shop floor scheduling game is getting participants acquainted with: - developing robust planning and scheduling procedures; - accepting orders under uncertainty and competition; - using information from cost accounting in scheduling; - creating an adequate communication structure

  9. Influence of feeding schedules on the chronobiology of renin activity, urinary electrolytes and blood pressure in dogs.

    Science.gov (United States)

    Mochel, Jonathan P; Fink, Martin; Bon, Charlotte; Peyrou, Mathieu; Bieth, Bruno; Desevaux, Cyril; Deurinck, Mark; Giraudel, Jérôme M; Danhof, Meindert

    2014-06-01

    The contribution of the renin-angiotensin-aldosterone system (RAAS) to the development of congestive heart failure (CHF) and hypertension (HT) has long been recognized. Medications that are commonly used in the course of CHF and HT are most often given with morning food for the sake of convenience and therapeutic compliance. However, biological rhythms and their responsiveness to environmental clues such as food intake may noticeably impact the effectiveness of drugs used in the management of cardiovascular disorders. Only sparse information about the effect of feeding schedules on the biology of the RAAS and blood pressure (BP) is presently available. Two studies were designed to explore the chronobiology of renin activity (RA), BP, renal sodium (UNa,fe) and potassium (UK,fe) handling in relation to meal timing in dogs. In a first experiment (Study a), blood and urinary samples for measurement of RA, UNa,fe and UK,fe were drawn from 18 healthy beagle dogs fed a normal-sodium diet at either 07:00, 13:00 or 19:00 h. In a second experiment (Study b), BP was recorded continuously from six healthy, telemetered beagle dogs fed a similar diet at 07:00, or 19:00 h. Data were collected throughout 24-h time periods, and analyzed by means of nonlinear mixed-effects models. Differences between the geometric means of early versus late time after feeding observations were further compared using parametric statistics. In agreement with our previous investigations, the results indicate that RA, UNa,fe, UK,fe, systolic, and diastolic BP oscillate with a circadian periodicity in dogs fed a regular diet at 07:00 h. A cosine model with a fixed 24-h period was found to fit the variations of RA, UK,fe and BP well, whereas cyclic changes in UNa,fe were best characterized by means of a combined cosine and surge model, reflecting a postprandial sodium excretion followed by a monotonous decay. Our data show that feeding time has a marked influence on the chronobiology of the renin

  10. Cardiovascular risk factor and familial aggregation of blood pressure with respect to anthropometric variables in a scheduled caste population in Punjab, a North Indian state.

    Science.gov (United States)

    Badaruddoza; Kumar, Raman

    2009-06-01

    Based on anthropometric data, this study aims to detect cardiovascular risk factor and familial aggregation of blood pressure in a specific community in India. A total of 1096 adult individuals, constituting 350 families in a scheduled caste community in Punjab, India, was surveyed for blood pressure, pulse rate, pulse pressure and fifteen anthropometric measurements. Estimates of correlation among blood pressure phenotypes with other significant variables and stepwise multiple regression analysis have been carried out for both offspring and parent generations. The hypothesis for common household effects was examined by likelihood ratio tests. Almost all anthropometric variables were found to be significant with blood pressure between both generations. The percent of variance for the regression (R2) was found to be higher for the offspring generation than for the parent one. The results suggest that despite of genetic effects, common household environment for many anthropometric measurements is a significant determinant of blood pressure. The data indicate a strong familial aggregation of blood pressure and anthropometric measurements should be a useful tool for screening cardiovascular risk factor with elevated blood pressure.

  11. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

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

  12. Effects of contingent and non-contingent cocaine on drug-seeking behavior measured using a second-order schedule of cocaine reinforcement in rats.

    Science.gov (United States)

    Markou, A; Arroyo, M; Everitt, B J

    1999-06-01

    Rats were trained to respond with intravenous cocaine as the reinforcer under a fixed interval 15-min schedule, during which conditioned stimuli paired with cocaine were presented contingent on completion of a fixed ratio of 10 responses (i.e., second-order schedule of reinforcement). The effects of contingent and noncontingent cocaine were investigated. The results show that pretreatment with noncontingent (i.e., experimenter-administered) cocaine led to a satiation-like effect that was reflected in decreased numbers of responses and a tendency for an increased latency to initiate responding when the doses of cocaine administered were similar to or higher than the training/maintenance dose of cocaine. By contrast, noncontingent administration of cocaine doses lower than the training/maintenance dose, and response-contingent cocaine administration, led to increased drug-seeking behavior, as reflected in increased numbers of responses. The present data indicate that at least two factors determine whether administration of cocaine would lead to drug-seeking behavior: whether the cocaine administration is contingent or noncontingent, and the relative magnitude of the cocaine dose administered in relation to the training/maintenance dose of cocaine.

  13. Research on Blood Emergency Scheduling Optimization under Supply Disruption after Disasters%考虑供应中断的灾后安全救援血液优化调度研究

    Institute of Scientific and Technical Information of China (English)

    秦晓燕; 刘晓; 程勤侦

    2012-01-01

    血液应急保障是灾后安全救援的重要环节.为既有效满足需求,又避免盲目、过量的采血、调血增大血液过期报废压力甚至血荒的发生,保障灾后安全救援顺利进行,针对血液的易腐特性,提出血液应急调度的特点,并建立在物联网技术支持下的多时段、多类型血制品、多种运输方式的优化调度模型,通过合理调用库存血,组织自采血、外调血,并确定相应的数量以满足用血需求,实现血液应急保障系统响应时间和调度总成本最小化目标.采用ILOG CPLEX软件对模型进行求解,结合汶川特大地震的实际案例,进行数值仿真与结果分析,并给出在不同中断情景下的调度策略,表明通过建立双向互调的血液供应网络,并采用调度优化方法能够以更短的时间满足用血需求,同时减小调配成本和血液报废压力,能更好地应对灾后救援中出现的供应中断情况.%Blood emergency guarantee system plays an important role in the disaster relief. However, large fluctuation in blood demand makes precise forecast impossible, meanwhile, node failure and road resistance cause supply disruption. So in order to meet the demand and avoid great discard pressure caused by severe excess, even blood supply shortage after disaster relief, a multi-period, multi-commodity, multi-mode transportation model was developed, based on blood characteristics, analysis of blood emergency scheduling features and technology of Internet of Things, with an objective to minimize the total response time and emergency cost of the blood scheduling network as well as reduce the discard risk, by determining the amount of self-collection, transportation and inventory to meet the demand. ILOG CPLEX software was employed to resolve the model and gave scheduling strategies for different scenarios of supply disruption. With Wenchuan earthquake as an example, a numerical simulation was conducted, and the analysis results show

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

  15. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

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

  16. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

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

  17. Scheduling for Responsive Grids

    CERN Document Server

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

    2008-01-01

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

  18. Scheduling multiple orders per job with various constraints for hybrid flow shop%考虑多约束的混合流水车间MOJ调度

    Institute of Scientific and Technical Information of China (English)

    周炳海; 王腾

    2016-01-01

    With a comprehensive consideration of multiple product types and sequence-dependent setup times constraints in which processes of wafer fabrications, a scheduling model of multiple orders per job(MOJ) in a hybrid flow shop with an objective function of minimizing total completion time of the system is developed. On the basis of the descriptions, a column generation algorithm based on the job-product-machine three level disjunctive network flow is proposed. Furthermore, to improve the degradation effects of column generation algorithm, Lagrangian relaxation with sub-gradient optimization is combined into the frame of column generation algorithm, and then a modified column generation(MCG) algorithm adopting dual iteration is proposed. Finally, theory analysis and simulation experiments show that the developed MCG algorithm is valid and feasible.%考虑晶圆加工过程中的多品种和与次序相关的换模时间约束,以系统总完工时间最小为优化目标,建立混合流水车间MOJ调度模型。在此基础上,提出了基于作业-产品-机器三层析取网络流的列生成算法。为进一步改善列生成算法存在的尾效应,将基于次梯度优化的拉格朗日松弛算法嵌入列生成算法框架中,构建了采用双重迭代的改进型列生成(MCG)算法。最后,通过理论分析和仿真实验表明了MCG算法是有效、可行的。

  19. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

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

  20. Homozygosity by descent mapping of blood pressure in the Old Order Amish: evidence for sex specific genetic architecture

    Directory of Open Access Journals (Sweden)

    McArdle Patrick F

    2007-10-01

    Full Text Available Abstract Background High blood pressure is a well established risk factor for morbidity and mortality acting through heart disease, stroke and cardiovascular disease. Genome wide scans have linked regions of nearly every human chromosome to blood pressure related traits. We have capitalized on beneficial qualities of the Old Order Amish of Lancaster, PA, a closed founder population with a relatively small number of founders, to perform a genome wide homozygosity by descent mapping scan. Each individual in the study has a non zero probability of consanguinity. Systolic and diastolic blood pressures are shown to have appreciable dominance variance components. Results Areas of two chromosomes were identified as suggestive of linkage to SBP and 5 areas to DBP in either the overall or sex specific analyses. The strongest evidence for linkage in the overall sample was to Chromosome 18q12 (LOD = 2.6 DBP. Sex specific analyses identified a linkage on Chromosome 4p12-14 (LOD in men only = 3.4 SBP. At Chromosome 2q32-33, an area where we previously reported significant evidence for linkage to DBP using a conventional identity by descent approach, the LOD was 1.4; however an appreciable sex effect was observed with men accounting for most of the linkage (LOD in men only = 2.6. Conclusion These results add evidence to a sex specific genetic architecture to blood pressure related traits, particularly in regions of linkage on chromosome 2, 4 and 18.

  1. Blood

    Science.gov (United States)

    ... Also, blood is either Rh-positive or Rh-negative. So if you have type A blood, it's either A positive or A negative. Which type you are is important if you need a blood transfusion. And your Rh factor could be important ...

  2. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

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

  3. Prospective validation of a blood ordering protocol for elective spine arthrodesis and its impact on cost reduction

    Directory of Open Access Journals (Sweden)

    Muhammad Waqas

    2014-01-01

    Full Text Available Background: On the basis of an institutional audit, the authors published an individual patient-based protocol for preoperative arrangement of blood products in patients undergoing elective spine arthrodesis. The present study was conducted for the prospective validation of the proposed protocol in reducing cross match to transfusion ratio, and its implications on overall cost. Methods: This cross-sectional study was conducted over 1 year (2012. All adult patients who underwent elective spinal arthrodesis were included and prospectively observed. The actual transfusion index was calculated for individual patients with the formula C1/T, where C1 is the number of units of packed RBCs cross matched and T is the number of actual transfusions. C1/T was then compared with a theoretical transfusion index C2/T for the same group of patients, C2 being the number derived from calculating the number of units of packed RBCs that would have been ordered for individual patient according to the protocol. The cost difference between C1/T and C2/T was analyzed. Results: A total of 125 patients were included. A total of 435 units of packed RBCs were ordered (C1, out of which only 108 units were transfused (T, yielding a C1/T of 4.02. The C2 for the same group of patients was 188 units of packed RBCs and the C2/T was thus calculated to be 1.74. Implementation of the protocol would reduce per patient cost from Pakistani Rupees (PKR 6676.8 ± 4125.8 to 4700.8 ± 1712.86, with a P < 0.001 and an overall reduction of 30%. Conclusion: Cross match to transfusion ratio and blood ordering related cost are both significantly reduced with the application of institutional cross-match protocol.

  4. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been the predomin......The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...

  5. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

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

  6. High-order sliding-mode control for blood glucose regulation in the presence of uncertain dynamics.

    Science.gov (United States)

    Hernández, Ana Gabriela Gallardo; Fridman, Leonid; Leder, Ron; Andrade, Sergio Islas; Monsalve, Cristina Revilla; Shtessel, Yuri; Levant, Arie

    2011-01-01

    The success of blood glucose automatic regulation depends on the robustness of the control algorithm used. It is a difficult task to perform due to the complexity of the glucose-insulin regulation system. The variety of model existing reflects the great amount of phenomena involved in the process, and the inter-patient variability of the parameters represent another challenge. In this research a High-Order Sliding-Mode Control is proposed. It is applied to two well known models, Bergman Minimal Model, and Sorensen Model, to test its robustness with respect to uncertain dynamics, and patients' parameter variability. The controller designed based on the simulations is tested with the specific Bergman Minimal Model of a diabetic patient whose parameters were identified from an in vivo assay. To minimize the insulin infusion rate, and avoid the hypoglycemia risk, the glucose target is a dynamical profile.

  7. Reactive Scheduling in Multipurpose Batch Plants

    Science.gov (United States)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

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

  8. Experiences with "self service" electronic blood banking.

    Science.gov (United States)

    Cheng, G

    1998-01-01

    Electronic verification of ABO compatibility (computer crossmatching) has been accepted as the crossmatching procedure for patients without clinically significant alloantibodies. Computer crossmatching offers several advantages over the immediate spin crossmatch and enables the setting up of a self service blood banking system. Self service blood banking saves manpower, improves crossmatch/transfusion(C/T) ratio and makes the maximum surgical blood ordering schedule (MSBOS) redundant. Blood banking service can also be provided at satellite hospitals without stationing blood banking staff there. We have also developed a novel self service system that does not require expensive computer hardware and networking.

  9. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

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

  10. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

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

  11. 订单型企业多目标生产计划的制定及其调度%Multi-objective production planning and scheduling for order enterprise

    Institute of Scientific and Technical Information of China (English)

    王庆明; 李微

    2012-01-01

    针对制定订单式小批量生产计划问题,提出了一种使用动态随机投入产出函数来制定多目标生产计划的方法.针对生产调度问题,提出了联合使用最长加工时间优先(LPT)与遗传算法(GA)的混合遗传算法(HCA)来求解混合流水线的调度,并给出了一种新的编码方法,选择了相应的交叉和变异方法.研究结果表明,该计划制造方法能较好地满足订单型企业的随机性要求,而且生产计划编制效率高.该编码方法在保证染色体合法性的同时也保证了算法本身的随机性.某轧辊厂的实际案例分析结果也验证了所提出的订单型企业多目标生产计划的制定及其调度方法的可行性.%Aiming at the production planning problem of small quantities,order type, a new method of making multi-objective production planning,which used the dynamic input-output function, was proposed. Aiming at the production scheduling problem,a new method of solving hybrid flow-shop scheduling problem based on hybrid genetic algorithm(HGA) was proposed,as well as a new coding method for this problem. Corresponding crossover and mutation operators were given, too. The results indicate that, the planning method not only satisfies the randomness demand of the order enterprise, but also has higher efficiency. The coding method can easily keep the validity and randomness. The final example of some roll work is carried out,which shows that the methods of multi-objective production planning and scheduling are available.

  12. Subcompartmentalisation of proteins in the rhoptries correlates with ordered events of erythrocyte invasion by the blood stage malaria parasite.

    Directory of Open Access Journals (Sweden)

    Elizabeth S Zuccala

    Full Text Available Host cell infection by apicomplexan parasites plays an essential role in lifecycle progression for these obligate intracellular pathogens. For most species, including the etiological agents of malaria and toxoplasmosis, infection requires active host-cell invasion dependent on formation of a tight junction - the organising interface between parasite and host cell during entry. Formation of this structure is not, however, shared across all Apicomplexa or indeed all parasite lifecycle stages. Here, using an in silico integrative genomic search and endogenous gene-tagging strategy, we sought to characterise proteins that function specifically during junction-dependent invasion, a class of proteins we term invasins to distinguish them from adhesins that function in species specific host-cell recognition. High-definition imaging of tagged Plasmodium falciparum invasins localised proteins to multiple cellular compartments of the blood stage merozoite. This includes several that localise to distinct subcompartments within the rhoptries. While originating from the same organelle, however, each has very different dynamics during invasion. Apical Sushi Protein and Rhoptry Neck protein 2 release early, following the junction, whilst a novel rhoptry protein PFF0645c releases only after invasion is complete. This supports the idea that organisation of proteins within a secretory organelle determines the order and destination of protein secretion and provides a localisation-based classification strategy for predicting invasin function during apicomplexan parasite invasion.

  13. Assessment of reduced-order unscented Kalman filter for parameter identification in 1-dimensional blood flow models using experimental data.

    Science.gov (United States)

    Caiazzo, A; Caforio, Federica; Montecinos, Gino; Muller, Lucas O; Blanco, Pablo J; Toro, Eluterio F

    2016-10-25

    This work presents a detailed investigation of a parameter estimation approach on the basis of the reduced-order unscented Kalman filter (ROUKF) in the context of 1-dimensional blood flow models. In particular, the main aims of this study are (1) to investigate the effects of using real measurements versus synthetic data for the estimation procedure (i.e., numerical results of the same in silico model, perturbed with noise) and (2) to identify potential difficulties and limitations of the approach in clinically realistic applications to assess the applicability of the filter to such setups. For these purposes, the present numerical study is based on a recently published in vitro model of the arterial network, for which experimental flow and pressure measurements are available at few selected locations. To mimic clinically relevant situations, we focus on the estimation of terminal resistances and arterial wall parameters related to vessel mechanics (Young's modulus and wall thickness) using few experimental observations (at most a single pressure or flow measurement per vessel). In all cases, we first perform a theoretical identifiability analysis on the basis of the generalized sensitivity function, comparing then the results owith the ROUKF, using either synthetic or experimental data, to results obtained using reference parameters and to available measurements.

  14. Decentralized Real-Time Scheduling

    Science.gov (United States)

    1990-08-01

    917-932, August, 1987. [ Daniels 86] D. C. Daniels and H. F. Wedde. Real-Time Performance of a Completely Distributed Operating System. In Proceedings...imnmediate execuoon The schedule c.-eated by the SeltctPhaseProcfj procedure is an ordere-d lis t of mocl -phnise pairs, each placed according to the

  15. Medical devices; immunology and microbiology devices; classification of multiplex nucleic acid assay for identification of microorganisms and resistance markers from positive blood cultures. Final order.

    Science.gov (United States)

    2015-05-27

    The Food and Drug Administration (FDA) is classifying multiplex nucleic acid assay for identification of microorganisms and resistance markers from positive blood cultures into class II (special controls). The special controls that will apply to this device are identified in this order and will be part of the codified language for the multiplex nucleic acid assay for identification of microorganisms and resistance markers from positive blood cultures. The Agency is classifying the device into class II (special controls) in order to provide a reasonable assurance of safety and effectiveness of the device.

  16. List scheduling revisited

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem.

  17. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

  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.

    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.

  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. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  1. Concentrations of Sex Hormones in Umbilical-Cord Blood: Their Relations to Sex and Birth Order of Infants.

    Science.gov (United States)

    Maccoby, Eleanor E.; And Others

    1979-01-01

    Results showed that concentrations of testosterone were significantly greater in the umbilical blood of newborn males than females. In both sexes, firstborns had significantly more progesterone and estrogens than later borns, and among males, firstborns had higher concentrations of testosterone. Temporal spacing of childbirths had greater effects…

  2. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

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

  3. Immunization Schedules for Adults

    Science.gov (United States)

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

  4. Instant Childhood Immunization Schedule

    Science.gov (United States)

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

  5. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

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

  6. Divergent Response Profile in Activated Cord Blood T cells from First-born Child Implies Birth-order-associated in Utero Immune Programming

    DEFF Research Database (Denmark)

    Kragh, Marie; Larsen, Jeppe Madura; Thysen, Anna Hammerich

    2016-01-01

    the association between birth-order and the functional response of stimulated cord blood T cells. Method: Purified cord blood T cells were polyclonally activated with anti-CD3/CD28-coated beads in a subgroup of 28 children enrolled in the COPSAC2010 birth cohort. Expression levels of seven activation markers...... on helper and cytotoxic T cells as well as the percentage of CD4+CD25+ T cells were assessed by flow cytometry. Production of IFN-γ, TNF-α, IL-17, IL-4, IL-5, IL-13 and IL-10 was measured in supernatants. Results: IL-10 secretion (P = 0.007) and CD25 expression on CD4+ helper T cells (P = 0.......0003) in activated cord blood T cells were selectively reduced in first-born children, while the percentage of CD4+CD25+ cord blood T cells was independent of birth-order. Conclusion: First-born infants display a reduced anti-inflammatory profile in T cells at birth. This possible in utero ‘birth-order’ T cell...

  7. Reinforcement learning in scheduling

    Science.gov (United States)

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

    1994-01-01

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

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

  9. Parallel scheduling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Dekel, E.; Sahni, S.

    1983-01-01

    Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.

  10. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

    Full Text Available This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine the optimal demand for nurses that met the hospital’s service standards. To obtain the optimal nurse schedule with the number of nurses acquired from the simulation model, we proposed a genetic algorithm (GA with two-point crossover and random mutation. After running the algorithm, we compared the expenses and number of nurses between the existing and our proposed nurse schedules. For January 2013, the nurse schedule obtained by GA could save 12% in staffing expenses per month and 13% in number of nurses when compare with the existing schedule, while more equitably distributing overtime pay between all nurses.

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

    Science.gov (United States)

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

    2016-08-01

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

  12. DSN Scheduling Engine

    Science.gov (United States)

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

    2008-01-01

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

  13. 基于混合遗传算法的订单生产调度在机车车辆行业中的应用%Research on scheduling order for locomotive and car enterprises based on hybrid genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    李永妮; 曹瑞; 韩彩夏

    2012-01-01

    机车车辆行业作为典型的面向订单的机械制造企业.优化的生产调度方法能提高订单的准时交货,缩短产品的生产周期,提高企业的市场竞争力。订单生产调度问题是典型的NP—hard问题。遗传算法(GeneticAlgorithms)为求具有多个约束的复杂问题提供了有效的方法。但是遗传算法的局部搜索能力比较差,在解决订单生产调度问题中存在着明显的不足。本文引入了局部搜索能力很强的禁忌搜索算法,用遗传算法和禁忌搜索算法相结合的混合遗传算法来解决机车车辆行业中面向订单生产调度问题。%Locomotive and car enterprises as a typical scheduling Order, optimizing production scheduling methods can shorten production cycle, improve the market competitiveness of enterprises. Order scheduling problem is a typical NP-hard problem, in many cases a mathematical model is difficult to accurately solved. Genetic algorithms provides a common framework for solving complex problems. But the genetic algorithm in solving the order scheduling problem has obvious shortcomings. And the introduction of tabu search algorithm has strong local search ability.This paper explores using tabu search hybrid algorithm combining genetic algorithm to solve the problem of the scheduling order for locomotive and car enterprises.

  14. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

  15. STUDY ON SHIFT SCHEDULE AND SIMULATION OF AUTOMATIC TRANSMISSION

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

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

  16. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

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

    2016-11-01

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

  17. Scheduling Algorithm for Complex Product Development

    Institute of Scientific and Technical Information of China (English)

    LIUMin; ZHANGLong; WUCheng

    2004-01-01

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

  18. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

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

    2014-01-01

    the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  19. STATUS OF SCHEDULE TRIBES IN ANDHRA PRADESH

    Directory of Open Access Journals (Sweden)

    Dr. P. Subramanyachary

    2013-01-01

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

  20. Interval Scheduling: A Survey

    NARCIS (Netherlands)

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

    2007-01-01

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

  1. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

    Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…

  2. Scheduling and Subcontracting under Parallel Machines

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; TANG Guo-chun

    2012-01-01

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

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

  4. Different training schedules influence platelet aggregation in show jumping horses.

    Science.gov (United States)

    Giannetto, C; Arfuso, F; Fazio, F; Giudice, E; Pietro, S Di; Bruschetta, D; Piccione, G

    2017-03-28

    Depending on the intensity, duration and type of physical exercise, equine metabolism has to adapt to nervous, cardiovascular, endocrine and respiratory system requirements. In horses, exercise and training are known to have considerable effects on the mechanisms of hemostatic system involving platelet activity. The aim of the present study was to evaluate the effect of different training schedules on platelet aggregation in 15 Italian Saddle jumping horses. Animals were divided into three equal groups: Group A was subjected to a high intensity-training program; group B to a light training program, group C included sedentary horses. From each animal, blood samples were collected by jugular venipuncture at rest on the 1st, 3rd and 5th days, and afterwards, once a week, for a total of 5 weeks data recording, in order to assess the maximum degree of platelet aggregation and the initial velocity of aggregation (slope) platelet aggregation. Two-way analysis of variance (ANOVA) showed a significant effect of the different training schedules on studied parameters. The results revealed a different degree of platelet aggregation and a different initial velocity of platelet aggregation that changes during the different training schedules in horses that could represent a different protective endothelial mechanism. These findings could have an important role for a clearer knowledge of the physiological reference values of platelet aggregation and for a better interpretation of these variations during the training.

  5. Mathematical programming and financial objectives for scheduling projects

    CERN Document Server

    Kimms, Alf

    2001-01-01

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

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

  7. Techniques for cash management in scheduling manufacturing operations

    Science.gov (United States)

    Morady Gohareh, Mehdy; Shams Gharneh, Naser; Ghasemy Yaghin, Reza

    2017-10-01

    The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum available cash. For single machine scheduling, it is demonstrated that scheduling jobs in decreasing order of profit ratios maximizes the former and improves productivity. Moreover, scheduling jobs in increasing order of costs and breaking ties in decreasing order of prices maximizes the latter and creates protection against financial instability.

  8. Techniques for cash management in scheduling manufacturing operations

    Science.gov (United States)

    Morady Gohareh, Mehdy; Shams Gharneh, Naser; Ghasemy Yaghin, Reza

    2016-10-01

    The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum available cash. For single machine scheduling, it is demonstrated that scheduling jobs in decreasing order of profit ratios maximizes the former and improves productivity. Moreover, scheduling jobs in increasing order of costs and breaking ties in decreasing order of prices maximizes the latter and creates protection against financial instability.

  9. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

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

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

  11. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  12. DMEPOS Fee Schedule

    Data.gov (United States)

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

  13. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  14. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

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

  15. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...... 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...

  16. Clinical Laboratory Fee Schedule

    Data.gov (United States)

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

  17. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    Despite several attempts to accurately predict duration and cost of software projects, initial plans still do not reflect real-life situations. Since commitments with customers are usually decided based on these initial plans, software companies frequently fail to deliver on time and many projects...... 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...

  18. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  19. Fee Schedules - General Information

    Data.gov (United States)

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

  20. Physician Fee Schedule Search

    Data.gov (United States)

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

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

  2. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

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

  3. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

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

  4. 49 CFR 1111.8 - Procedural schedule in stand-alone cost cases.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 8 2010-10-01 2010-10-01 false Procedural schedule in stand-alone cost cases... § 1111.8 Procedural schedule in stand-alone cost cases. (a) Procedural schedule. Absent a specific order by the Board, the following general procedural schedule will apply in stand-alone cost cases: Day...

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

  6. Optimal radiotherapy dose schedules under parametric uncertainty

    Science.gov (United States)

    Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

    2016-01-01

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

  7. Application-adaptive resource scheduling in a computational grid

    Institute of Scientific and Technical Information of China (English)

    LUAN Cui-ju; SONG Guang-hua; ZHENG Yao

    2006-01-01

    Selecting appropriate resources for running a job efficiently is one of the common objectives in a computational grid.Resource scheduling should consider the specific characteristics of the application, and decide the metrics to be used accordingly.This paper presents a distributed resource scheduling framework mainly consisting of a job scheduler and a local scheduler. In order to meet the requirements of different applications, we adopt HGSA, a Heuristic-based Greedy Scheduling Algorithm, to schedule jobs in the grid, where the heuristic knowledge is the metric weights of the computing resources and the metric workload impact factors. The metric weight is used to control the effect of the metric on the application. For different applications, only metric weights and the metric workload impact factors need to be changed, while the scheduling algorithm remains the same.Experimental results are presented to demonstrate the adaptability of the HGSA.

  8. Buffer Size Setting Method for DBR Scheduling

    Science.gov (United States)

    Park, Soonyoung; Woo, Kiyun; Fujimura, Shigeru

    There are many kinds of delay in real-world production systems caused by many reasons including unexpected accidents. A delay of order may inflict great damages for not only itself but also the other affected orders. To prevent these types of loss from frequent delay, DBR (Drum-Buffer-Rope) scheduling method of TOC (Theory of Constraints) manages production schedule observing the state of time buffers. The current buffer size setting method for DBR scheduling is very simple and depends on user's experience. Although it makes possible to keep the due time for production orders, it leads to the redundant production lead time and stock. For DBR scheduling, it is not clear how the buffer size should be set. Therefore, this paper proposes a buffer size setting method for DBR scheduling providing a numerical model for the buffer size. In addition, a simulation gives the result of comparison between the current method and the proposed method, and the effect of the proposed method is shown.

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

    Science.gov (United States)

    2013-04-12

    ... exchange, changes in blood pressure, seizures, erratic behavior, and coma. Even death has been reported... large majority of these exposures were by intentional abuse, misuse, or suspected suicide. Most of these...'' with regard to post-traumatic stress disorder (PTSD), Schedule I placement ``implicitly...

  10. An On-Line Scheduler over Hard Real-Time Communication System

    Institute of Scientific and Technical Information of China (English)

    CHEN Hui; XIONG Guangze

    2003-01-01

    By thorough research on the prominent periodic and aperiodic scheduling algorithms, an on-line hard real-time scheduler is presented, which is applicable to the scheduling of packets over a link.This scheduler, based on both Rate Monotonic, pinwheel scheduling algorithm Sr and Polling Server scheduling algorithms, can rapidly judge the schedulability and then automatically generate a bus table for the scheduling algorithm to schedule the packets as the periodic packets. The implementation of the scheduler is simple and easy to use, and it is effective for the utilization of bus link. The orderly execution of the bus table can not only guarantee the performance of the hard real time but also avoid the blockage and interruption of the message transmission. So the scheduler perfectly meets the demand of hard realtime communication system on the field bus domain.

  11. Blood Component Use in a Sub-Saharan African Country : Results of a 4-Year Evaluation of Diagnoses Associated With Transfusion Orders in Namibia

    NARCIS (Netherlands)

    Pitman, John P.; Wilkinson, Robert; Liu, Yang; von Finckenstein, Bjorn; Sibinga, Cees Th. Smit; Lowrance, David W.; Marfin, Anthony A.; Postma, Maarten J.; Mataranyika, Mary; Basavaraju, Sridhar V.

    2015-01-01

    National blood use patterns in sub-Saharan Africa are poorly described. Although malaria and maternal hemorrhage remain important drivers of blood demand across Africa, economic growth and changes in malaria, HIV/AIDS, and noncommunicable disease epidemiology may contribute to changes in blood deman

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

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

  14. Influence of the order of introduction of a set of objectives in IMRT treatment schedules prostate; Influencia del orden de introduccion de un conjunto de objetivos en planificaciones de tratamientos IMRT de prostata

    Energy Technology Data Exchange (ETDEWEB)

    Maravilla Limorte, M.; Gomez Martin, C.; Alonso Iracheta, L.; Bejar Navarro, M. J.; Capuz Suarez, A. B.; Comenares Fernandez, R.; Moris Pablos, R.; Rot Sanjuan, M. J.

    2011-07-01

    The purpose of this paper is to analyze to what extent could influence the order in which you enter the target calculation algorithm of planning. For this, assesses the implications-both-dosimetric calculation as derived from the implementation of 3 IMRT optimization methods, which only differ in regard to the order of introduction of a fixed set of objectives.

  15. Fuzzy Flexible Resource Constrained Project Scheduling Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    查鸿; 张连营

    2014-01-01

    Both fuzzy temporal constraint and flexible resource constraint are considered in project scheduling. In order to obtain an optimal schedule, we propose a genetic algorithm integrated with concepts on fuzzy set theory as well as specialized coding and decoding mechanism. An example demonstrates that the proposed approach can assist the project managers to obtain the optimal schedule effectively and make the correct decision on skill training before a project begins.

  16. Impact of Personnel Flexibility on Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Ren Lin

    2016-01-01

    Full Text Available Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

  17. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

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

  18. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-01-01

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

  19. Model Migration Schedules

    OpenAIRE

    1981-01-01

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

  20. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

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

    2003-01-01

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

  1. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

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

  2. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  3. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  4. Blood component use in a sub-Saharan African country: results of a 4-year evaluation of diagnoses associated with transfusion orders in Namibia.

    Science.gov (United States)

    Pitman, John P; Wilkinson, Robert; Liu, Yang; von Finckenstein, Bjorn; Smit Sibinga, Cees Th; Lowrance, David W; Marfin, Anthony A; Postma, Maarten J; Mataranyika, Mary; Basavaraju, Sridhar V

    2015-01-01

    National blood use patterns in sub-Saharan Africa are poorly described. Although malaria and maternal hemorrhage remain important drivers of blood demand across Africa, economic growth and changes in malaria, HIV/AIDS, and noncommunicable disease epidemiology may contribute to changes in blood demand. We evaluated indications for blood use in Namibia, a country in southern Africa, using a nationally representative sample and discuss implications for the region. Clinical and demographic data related to the issuance of blood component units in Namibia were reviewed for a 4-year period (August 1, 2007-July 31, 2011). Variables included blood component type, recipient age and sex, and diagnosis. Diagnoses reported by clinicians were reclassified into International Statistical Classification of Diseases, 10th Revision categories. Multiple imputation methods were used to complete a data set missing age, sex or diagnosis data. Descriptive analyses were conducted to describe indications for transfusions and use of red blood cells (RBCs), platelets, and plasma. A total of 39,313 records accounting for 91,207 blood component units were analyzed. The median age of Namibian transfusion recipients was 45 years (SD, ±19). A total of 78,660 RBC units were issued in Namibia during the study period. Red blood cells transfused for "unspecified anemia" accounted for the single largest category of blood issued (24,798 units). Of the overall total, 38.9% were for diseases of the blood and blood-forming organs (D50-D89). Infectious disease (A00-B99), pregnancy (O00-O99), and gastrointestinal (K20-K93) accounted for 14.8%, 11.1%, and 6.1% of RBC units issued, respectively. Although a specific diagnosis of malaria accounted for only 2.7% of pediatric transfusions, an unknown number of additional transfusions for malaria may have been categorized by requesting physicians as unspecified anemia and counted under diseases of blood forming organs. During the study period, 9751 units of fresh

  5. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

    For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...

  6. Creating Genuine Readers with Flexible Scheduling

    Science.gov (United States)

    Lambert, Nancy Jo

    2017-01-01

    This article describes how Nancy Jo Lambert, a school librarian, implemented a flexible library schedule at elementary schools in which she worked collaboratively with classroom teachers. After observing students removing bookmarks from the middle of their books in order to turn the books in by the due date or because their fixed library schedule…

  7. Hybrid Meta-Heuristics for Robust Scheduling

    NARCIS (Netherlands)

    M. Surico (Michele); U. Kaymak (Uzay); D. Naso (David); R. Dekker (Rommert)

    2006-01-01

    textabstractThe production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer

  8. Synthesis and Stochastic Assessment of Cost-Optimal Schedules

    OpenAIRE

    Mader, A.H.; Bohnenkamp, H.C.; Usenko, Y.S.; Jansen, D.N.; J L Hurink; Hermanns, H.

    2006-01-01

    We treat the problem of generating cost-optimal schedules for orders with individual due dates and cost functions based on earliness/tardiness. Orders can run in parallel in a resource-constrained manufacturing environment, where resources are subject to stochastic breakdowns. The goal is to generate schedules while minimizing the expected costs. First, we estimate the distribution of each order type by simulation (assuming a reasonable machine/load model) and derive from the cost-function an...

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

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

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

  10. Experimental demonstration of interference avoidance protocol (transmission scheduling) in O-CDMA networks.

    Science.gov (United States)

    Saghari, Poorya; Kamath, P; Arbab, Vahid R; Haghi, Mahta; Willner, Alan E; Bannister, Joe A; Touch, Joe D

    2007-12-10

    We experimentally demonstrate a transmission scheduling algorithm to avoid congestion collapse in O-CDMA networks. Our result shows that transmission scheduling increases the performance of the system by orders of magnitude.

  11. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn; Heijden, van der Matthieu; Harten, van 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 thei

  12. 7 CFR 1160.605 - Scheduling of referendum.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 9 2010-01-01 2009-01-01 true Scheduling of referendum. 1160.605 Section 1160.605... Referenda in Connection with a Fluid Milk Promotion Order § 1160.605 Scheduling of referendum. A referendum... in the preceding referendum. ...

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

  14. Analysis of sequencing and scheduling methods for arrival traffic

    Science.gov (United States)

    Neuman, Frank; Erzberger, Heinz

    1990-01-01

    The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.

  15. Heuristic-based scheduling algorithm for high level synthesis

    Science.gov (United States)

    Mohamed, Gulam; Tan, Han-Ngee; Chng, Chew-Lye

    1992-01-01

    A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.

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

  17. An Improved Ant Algorithm for Grid Task Scheduling Strategy

    Science.gov (United States)

    Wei, Laizhi; Zhang, Xiaobin; Li, Yun; Li, Yujie

    Task scheduling is an important factor that directly influences the performance and efficiency of the system. Grid resources are usually distributed in different geographic locations, belonging to different organizations and resources' properties are vastly different, in order to complete efficiently, intelligently task scheduling, the choice of scheduling strategy is essential. This paper proposes an improved ant algorithm for grid task scheduling strategy, by introducing a new type pheromone and a new node redistribution selection rule. On the one hand, the algorithm can track performances of resources and tag it. On the other hand, add algorithm to deal with task scheduling unsuccessful situations that improve the algorithm's robustness and the successful probability of task allocation and reduce unnecessary overhead of system, shortening the total time to complete tasks. The data obtained from simulation experiment shows that use this algorithm to resolve schedule problem better than traditional ant algorithm.

  18. Revisiting conjugate schedules.

    Science.gov (United States)

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

    2015-07-01

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

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

  20. Scheduling jobs that arrive over time

    Energy Technology Data Exchange (ETDEWEB)

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

    1995-04-06

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

  1. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

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

    1996-12-31

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

  2. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. Also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  3. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

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

  4. Scheduling a C-Section

    Science.gov (United States)

    ... Pregnancy > Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill in all fields. Please enter ... and develop before she’s born. Why can scheduling a c-section for non-medical reasons be a ...

  5. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

    Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…

  6. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Godskesen, Jens Christian; Hermanns, Holger

    2015-01-01

    . This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace...

  7. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

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

  8. Flexible Software for Flexible Scheduling

    Science.gov (United States)

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

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

  9. Blood Typing

    Science.gov (United States)

    ... anemia such as sickle cell disease and thalassemia Bleeding during or after surgery Injury or trauma Excessive blood loss Cancer and the effects of chemotherapy Bleeding disorders such as hemophilia Testing is ordered when ...

  10. Research on remanufacturing scheduling problem based on critical chain management

    Science.gov (United States)

    Cui, Y.; Guan, Z.; He, C.; Yue, L.

    2017-06-01

    Remanufacturing is the recycling process of waste products as “as good as new products”, compared with materials recycling, remanufacturing represents a higher form of recycling. The typical structure of remanufacturing system consists of three parts: disassembly workshop, remanufacturing workshop and assembly workshop. However, the management of production planning and control activities can differ greatly from management activities in traditional manufacturing. Scheduling in a remanufacturing environment is more complex and the scheduler must deal with more uncertainty than in a traditional manufacturing environment. In order to properly schedule in a remanufacturing environment the schedule must be able to cope with several complicating factors which increase variability. This paper introduced and discussed seven complicating characteristics that require significant changes in production planning and control activities, in order to provide a new method for remanufacturing production scheduling system.

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

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

  13. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

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

  14. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

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

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

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

  17. CBS (CONTRASTRAIN BASED SCHEDULLING ADALAH FAKTOR PENENTU KEBERHASILAN PERUSAHANAN PRINTING

    Directory of Open Access Journals (Sweden)

    Hendra Achmadi

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

  18. A Neuro Fuzzy Technique for Process Grain Scheduling of Parallel Jobs

    Directory of Open Access Journals (Sweden)

    S. V. Sudha

    2011-01-01

    Full Text Available Problem statement: We present development of neural network based fuzzy inference system for scheduling of parallel Jobs with the help of a real life workload data. The performance evaluation of a parallel system mainly depends on how the processes are co scheduled? Various co scheduling techniques available are First Come First Served, Gang Scheduling, Flexible Co Scheduling and Agile Algorithm Approach: In order to use a wide range of objective functions, we used a rule bases scheduling strategy. The rule system depends on scheduling results of the agile algorithm and classifies all possible scheduling states and assigns an appropriate scheduling strategy based on actual state. The rule bases were developed with the help of a real workload data. Results: With the help of rule base results, scheduling was done again, which is compared with the first come first served, gang scheduling, flexible co scheduling and agile algorithm. The results of scheduling showed the optimized results of agile algorithm with the help of neuro fuzzy optimization technique. Conclusion: The study confirmed that the Neuro Fuzzy Technique can be used as a better optimization tool for optimizing any scheduling algorithm, This optimization tool is used for agile algorithm which is further used for process grain scheduling of parallel jobs.

  19. Tainted blood

    DEFF Research Database (Denmark)

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

    2015-01-01

    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...... need to move beyond the bifurcation of the social and medical aspects of blood supply as two separate issues and approach social dynamics as key medical safety questions....

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

  1. Nicotinic acetylcholine receptor subunit variants are associated with blood pressure; findings in the Old Order Amish and replication in the Framingham Heart Study

    Directory of Open Access Journals (Sweden)

    Ott Sandy

    2008-07-01

    Full Text Available Abstract Background Systemic blood pressure, influenced by both genetic and environmental factors, is regulated via sympathetic nerve activity. We assessed the role of genetic variation in three subunits of the neuromuscular nicotinic acetylcholine receptor positioned on chromosome 2q, a region showing replicated evidence of linkage to blood pressure. Methods We sequenced CHRNA1, CHRND and CHRNG in 24 Amish subjects from the Amish Family Diabetes Study (AFDS and identified 20 variants. We then performed association analysis of non-redundant variants (n = 12 in the complete AFDS cohort of 1,189 individuals, and followed by genotyping blood pressure-associated variants (n = 5 in a replication sample of 1,759 individuals from the Framingham Heart Study (FHS. Results The minor allele of a synonymous coding SNP, rs2099489 in CHRNG, was associated with higher systolic blood pressure in both the Amish (p = 0.0009 and FHS populations (p = 0.009 (minor allele frequency = 0.20 in both populations. Conclusion CHRNG is currently thought to be expressed only during fetal development. These findings support the Barker hypothesis, that fetal genotype and intra-uterine environment influence susceptibility to chronic diseases later in life. Additional studies of this variant in other populations, as well as the effect of this variant on acetylcholine receptor expression and function, are needed to further elucidate its potential role in the regulation of blood pressure. This study suggests for the first time in humans, a possible role for genetic variation in the neuromuscular nicotinic acetylcholine receptor, particularly the gamma subunit, in systolic blood pressure regulation.

  2. Novel system using microliter order sample volume for measuring arterial radioactivity concentrations in whole blood and plasma for mouse PET dynamic study.

    Science.gov (United States)

    Kimura, Yuichi; Seki, Chie; Hashizume, Nobuya; Yamada, Takashi; Wakizaka, Hidekatsu; Nishimoto, Takahiro; Hatano, Kentaro; Kitamura, Keishi; Toyama, Hiroshi; Kanno, Iwao

    2013-11-21

    This study aimed to develop a new system, named CD-Well, for mouse PET dynamic study. CD-Well allows the determination of time-activity curves (TACs) for arterial whole blood and plasma using 2-3 µL of blood per sample; the minute sample size is ideal for studies in small animals. The system has the following merits: (1) measures volume and radioactivity of whole blood and plasma separately; (2) allows measurements at 10 s intervals to capture initial rapid changes in the TAC; and (3) is compact and easy to handle, minimizes blood loss from sampling, and delay and dispersion of the TAC. CD-Well has 36 U-shaped channels. A drop of blood is sampled into the opening of the channel and stored there. After serial sampling is completed, CD-Well is centrifuged and scanned using a flatbed scanner to define the regions of plasma and blood cells. The length measured is converted to volume because the channels have a precise and uniform cross section. Then, CD-Well is exposed to an imaging plate to measure radioactivity. Finally, radioactivity concentrations are computed. We evaluated the performance of CD-Well in in vitro measurement and in vivo (18)F-fluorodeoxyglucose and [(11)C]2-carbomethoxy-3β-(4-fluorophenyl) tropane studies. In in vitro evaluation, per cent differences (mean±SE) from manual measurement were 4.4±3.6% for whole blood and 4.0±3.5% for plasma across the typical range of radioactivity measured in mouse dynamic study. In in vivo studies, reasonable TACs were obtained. The peaks were captured well, and the time courses coincided well with the TAC derived from PET imaging of the heart chamber. The total blood loss was less than 200 µL, which had no physiological effect on the mice. CD-Well demonstrates satisfactory performance, and is useful for mouse PET dynamic study.

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

  4. The Dynamical Kernel Scheduler - Part 1

    CERN Document Server

    Adelmann, Andreas; Suter, Andreas

    2015-01-01

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

  5. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

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

  6. DTS: Building custom, intelligent schedulers

    Science.gov (United States)

    Hansson, Othar; Mayer, Andrew

    1994-01-01

    DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

  7. Fault tolerant workflow scheduling based on replication and resubmission of tasks in Cloud Computing

    OpenAIRE

    Jayadivya S K; Jaya Nirmala S; Mary Saira Bhanu S

    2012-01-01

    The aim of workflow scheduling system is to schedule the workflows within the user given deadline to achieve a good success rate. Workflow is a set of tasks processed in a predefined order based on its data and control dependency. Scheduling these workflows in a computing environment, like cloud environment, is an NP-Complete problem and it becomes more challenging when failures of tasks areconsidered. To overcome these failures, the workflow scheduling system should be fault tolerant. In thi...

  8. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

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

  9. Major Half Served First (MHSF Disk Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Manish Kumar Mishra

    2013-01-01

    Full Text Available I/O performance has been improved by proper scheduling of disk accesses since the time movable head disk came into existence. Disk scheduling is the process of carefully examining the pending requests to determine the most efficient way to service the pending requests. Scheduling algorithms generally concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some important scheduling algorithms are First-Come-First-Served (FCFS, Shortest Seek Time First (SSTF, SCAN, Circular Scan (C-SCAN and LOOK. This paper proposes a new disk scheduling algorithm called Major Half Served First (MHSF. Simulation results show that using MHSF the service is fast and seek time has been reduced drastically.

  10. A Scheduling Algorithm Based on Petri Nets and Simulated Annealing

    Directory of Open Access Journals (Sweden)

    Rachida H. Ghoul

    2007-01-01

    Full Text Available This study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static and dynamic behavior of the HFMS and design scheduling solutions. Hierarchical Petri nets model was regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process which was composed of many operations and tasks. The complex scheduling problem was decomposed in simple sub-problems. Scheduling algorithm was applied on each sub model in order to resolve conflicts on shared production resources.

  11. An Iterated Local Search Algorithm for a Place Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Shicheng Hu

    2013-01-01

    Full Text Available We study the place scheduling problem which has many application backgrounds in realities. For the block manufacturing project with special manufacturing platform requirements, we propose a place resource schedule problem. First, the mathematical model for the place resource schedule problem is given. On the basis of resource-constrained project scheduling problem and packing problem, we develop a hybrid heuristic method which combines priority rules and three-dimensional best fit algorithm, in which the priority rules determine the scheduling order and the three-dimensional best fit algorithm solves the placement. After this method is used to get an initial solution, the iterated local search is employed to get an improvement. Finally, we use a set of simulation data to demonstrate the steps of the proposed method and verify its feasibility.

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

  13. Parallel job scheduling policies to improve fairness : a case study.

    Energy Technology Data Exchange (ETDEWEB)

    Leung, Vitus Joseph; Sabin, Gerald (Ohio State University, Columbus, OH); Sadayappan, Ponnuswamy (Ohio State University, Columbus, OH)

    2008-02-01

    Balancing fairness, user performance, and system performance is a critical concern when developing and installing parallel schedulers. Sandia uses a customized scheduler to manage many of their parallel machines. A primary function of the scheduler is to ensure that the machines have good utilization and that users are treated in a 'fair' manner. A separate compute process allocator (CPA) ensures that the jobs on the machines are not too fragmented in order to maximize throughput. Until recently, there has been no established technique to measure the fairness of parallel job schedulers. This paper introduces a 'hybrid' fairness metric that is similar to recently proposed metrics. The metric uses the Sandia version of a 'fairshare' queuing priority as the basis for fairness. The hybrid fairness metric is used to evaluate a Sandia workload. Using these results, multiple scheduling strategies are introduced to improve performance while satisfying user and system performance constraints.

  14. Grid Computing based on Game Optimization Theory for Networks Scheduling

    Directory of Open Access Journals (Sweden)

    Peng-fei Zhang

    2014-05-01

    Full Text Available The resource sharing mechanism is introduced into grid computing algorithm so as to solve complex computational tasks in heterogeneous network-computing problem. However, in the Grid environment, it is required for the available resource from network to reasonably schedule and coordinate, which can get a good workflow and an appropriate network performance and network response time. In order to improve the performance of resource allocation and task scheduling in grid computing method, a game model based on non-cooperation game is proposed. Setting the time and cost of user’s resource allocation can increase the performance of networks, and incentive resource of networks uses an optimization scheduling algorithm, which minimizes the time and cost of resource scheduling. Simulation experiment results show the feasibility and suitability of model. In addition, we can see from the experiment result that model-based genetic algorithm is the best resource scheduling algorithm

  15. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

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

  16. Scheduling the powering tests

    CERN Document Server

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

    2008-01-01

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

  17. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

  18. Visually Exploring Transportation Schedules.

    Science.gov (United States)

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

    2016-01-01

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

  19. Evaluation of Scheduling Methods for Multiple Runways

    Science.gov (United States)

    Bolender, Michael A.; Slater, G. L.

    1996-01-01

    Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

  20. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

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

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

  2. 多种群果蝇优化算法求解自动化仓库拣选作业调度问题%Multiple-Population Fruit Fly Optimization Algorithm for Scheduling Problem of Order Picking Operation in Automatic Warehouse

    Institute of Scientific and Technical Information of China (English)

    习宁; 韩虎

    2014-01-01

    针对自动化仓库的拣选作业调度问题,提出了一种多种群果蝇优化算法。采用随机键编码方式,利用味道浓度判定值的大小次序来映射调度解。通过同时学习子种群的局部最优和全局最优个体,实现对果蝇个体的更新计算。为了避免陷入局部最优,采用了一种果蝇个体变异机制。计算结果显示,多种群果蝇优化算法在计算精度和收敛效率方面要好于基本果蝇优化算法,并且搜索过程能够有效跳出局部最优。%A multiple population fruit fly optimization algorithm is proposed for the scheduling problem of order picking operation in automatic warehouse.A coding method of random key is a-dopted,and the sequence of the smell concentration judgment value is mapped to the schedule so-lution.The fruit individuals are calculated and updated by simultaneously learning from both the local optimum of the offspring population and the whole optimum of overall populations in the it-eration.A mutation method is employed to jump away from the local optimum for the fruit indi-vidual.The computational results show that the multiple-population fruit fly optimization algo-rithm has better calculation precision and convergence efficiency than the basic fruit fly optimiza-tion algorithm,and it can effectively avoid falling into the local optimum.

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

  4. MidSFN Local Scheduling AlgorithmMidSFN Local Scheduling Algorithm for Heterogeneous Grid Environment

    Directory of Open Access Journals (Sweden)

    Dr.G.Sumathi

    2012-05-01

    Full Text Available A grid is a heterogeneous computing and communication system that allows a group of nodes to compass a task. The process of assigning the jobs or subtasks to the nodes present in the heterogeneous grid is known as scheduling. The type of scheduling in which the subtasks are assigned to the nodes is known as Local Scheduling.A significant research problem is how to assign resources to the subtasks and order the execution of the subtasks that are matched to maximize performance criterion of a local grid system. This procedure of scheduling is called mapping or resource allocation. MidSFN adverts to Medium Subtask Fastest Node algorithm which classifies the subtasks into three tier categories, High, Middle and Low based on their priority. In MidSFN algorithm priority is assigned based on the new parameters Computational Complexity and Processing Power. The value for processing power is assigned based on the Performance Factor. The value of the Performance Factor is the product of the number of operations per cycle per processor and the number of instructions processed per second. In MidSFN algorithm the subtask of medium computational complexity and resources exhibiting medium processing power are assigned with a high priority. The subtasks are then mapped to respective processors based on the assigned priority for execution. Compared to other local scheduling algorithms, MidSFN algorithm shows efficient load balancing and better computation with effective usage of resources. The effectiveness of this algorithm is evaluated through simulation results.

  5. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

    Directory of Open Access Journals (Sweden)

    Marcelo Nobre

    2015-04-01

    Full Text Available Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA. As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques forWirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of theWirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed.

  6. The Effectiveness of Block Scheduling.

    Science.gov (United States)

    Creamean, Sharon Lightle; Horvath, Robert Jeffery

    This report describes a program for the exploration of block scheduling. The targeted population consists of high school students in a growing, middle-class community, located in a suburban setting of a large mid-western city. The historical background of block scheduling is documented through data gathered using attendance reports, student…

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

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

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

  10. Improving the efficiency of patient throughput via centralized inpatient scheduling.

    Science.gov (United States)

    Steffen, Mark W

    2010-01-01

    Advocate Illinois Masonic Medical Center implemented a centralized scheduling system in order to increase efficiency and throughput, improve customer satisfaction, improve communication between departments,and create a single schedule (IP/ED/OP) per modality. Most resistance for the change came from technologists, so a formal design team was established for each modality, which included a core information systems (IS) team member,the lead technologist of the modality, and the technologist most able to influence the other technologists who might be resistant to change. Overall,throughput increased by 3.14% post-implementation of the inpatient scheduling software.

  11. Cloud Scheduler: a resource manager for distributed compute clouds

    CERN Document Server

    Armstrong, P; Bishop, A; Charbonneau, A; Desmarais, R; Fransham, K; Hill, N; Gable, I; Gaudet, S; Goliath, S; Impey, R; Leavett-Brown, C; Ouellete, J; Paterson, M; Pritchet, C; Penfold-Brown, D; Podaima, W; Schade, D; Sobie, R J

    2010-01-01

    The availability of Infrastructure-as-a-Service (IaaS) computing clouds gives researchers access to a large set of new resources for running complex scientific applications. However, exploiting cloud resources for large numbers of jobs requires significant effort and expertise. In order to make it simple and transparent for researchers to deploy their applications, we have developed a virtual machine resource manager (Cloud Scheduler) for distributed compute clouds. Cloud Scheduler boots and manages the user-customized virtual machines in response to a user's job submission. We describe the motivation and design of the Cloud Scheduler and present results on its use on both science and commercial clouds.

  12. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

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

  13. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

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

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

    Science.gov (United States)

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

    2009-09-01

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

  15. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    LE Bisping

    2000-01-27

    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.

  16. Hanford site environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    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.

  17. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

  18. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  19. Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems

    Science.gov (United States)

    Sun, Wei; Yu, Chen; Défago, Xavier; Inoguchi, Yasushi

    The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. The primary-backup (PB) approach is often used as a fault-tolerant technique to guarantee the deadlines of tasks despite the presence of faults. In this paper we propose a dynamic PB-based task scheduling approach, wherein an allocation parameter is used to search the available time slots for a newly arriving task, and the previously scheduled tasks can be re-scheduled when there is no available time slot for the newly arriving task. In order to improve the schedulability we also propose an overloading strategy for PB-overloading and Backup-backup (BB) overloading. Our proposed task scheduling algorithm is compared with some existing scheduling algorithms in the literature through simulation studies. The results have shown that the task rejection ratio of our real-time task scheduling algorithm is almost 50% lower than the compared algorithms.

  20. Sensor scheduling strategies for fault isolation in networked control system.

    Science.gov (United States)

    Sid, M A

    2015-01-01

    A framework for the joint design of sensor scheduling and fault isolation is proposed. First, the synthesis of fault isolation filter and the communication sequence that ensures the isolability of fault is given. The proposed filter can be viewed as a special structure of the traditional Kalman filter. Several sensor scheduling strategies are proposed in order to ensure the minimization of the noise effect on the generated residual. A numerical example illustrates the effectiveness of the proposed approach.

  1. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  2. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

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

  4. Nurse Scheduling System based on Dynamic Weighted Maximal Constraint Satisfaction Problem

    Science.gov (United States)

    Hattori, Hiromitsu; Isomura, Atsushi; Ito, Takayuki; Ozono, Tadachika; Shintani, Toramatsu

    Scheduling has been an important research field in Artificial Intelligence. Because typical scheduling problems could be modeled as a Constraint Satisfaction Problem(CSP), several constraint satisfaction techniques have been proposed. In order to handle the different levels of importance of the constraints, solving a problem as a Weighted Maximal Constraint Satisfaction Problem(W-MaxCSP) is an promising approach. However, there exists the case where unexpected events are added and some sudden changes are required, i.e., the case with dynamic changes in scheduling problems. In this paper, we describe such dynamic scheduling problem as a Dynamic Weighted Maximal Constraint Satisfaction Problem(DW-MaxCSP) in which constraints would changes dynamically. Generally, it is undesirable to determine vastly modified schedule even if re-scheduling is needed. A new schedule should be close to the current one as much as possible. In order to obtain stable solutions, we propose the methodology to maintain portions of the current schedule using the provisional soft constraints, which explicitly penalize the changes from the current schedule. We have experimentally confirmed the efficacy of re-scheduling based on our method with provisional constraints. In this paper, we construct the nurse scheduling system for applying the proposed scheduling method.

  5. A Network Simulation Tool for Task Scheduling

    Directory of Open Access Journals (Sweden)

    Ondřej Votava

    2012-01-01

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

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

  7. Improved Squeaky Wheel Optimisation for Driver Scheduling

    CERN Document Server

    Aickelin, Uwe; Li, Jingpeng

    2008-01-01

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

  8. Blood sugar test - blood

    Science.gov (United States)

    ... blood glucose level ( hypoglycemia ) may be due to: Hypopituitarism (a pituitary gland disorder) Underactive thyroid gland or ... tonic-clonic seizure Glucagon blood test Glucagonoma Hyperthyroidism Hypopituitarism Hypothyroidism Insulinoma Low blood sugar Multiple endocrine neoplasia ( ...

  9. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

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

  10. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

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

  11. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

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

  12. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

    de Snoo, C.; van Wezel, W.M.C.; Jorna, R.J.J.M.

    Planning and scheduling significantly influence organizational performance, but literature that pays attention to how organizations could or should organize and assess their planning processes is limited. We extend planning and scheduling theory with a categorization of scheduling performance

  13. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

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

  14. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

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

  15. A new polynomial algorithm for a parallel identical scheduling problem

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A precedence order is defined based on the release dates of jobs'direct successors.Using the defined precedence order and Heap Sort,a new polynomial algorithm is provided which aims tO solve the parallel scheduling problem P|pj=1,Tj,outtree|∑ Cj.The new algorithm is shown to be more compact and easier to implement.

  16. Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid

    CERN Document Server

    Moise, Diana; Pop, Florin; Cristea, Valentin

    2011-01-01

    Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamentally important in order to achieve optimized resources utilization. The existing and potential applications include many fields of activity like satellite image processing and medicine. The paper proposes a scheduling algorithm for tasks with dependencies in Grid environments. CoAllocation represents a strategy that provides a schedule for task with dependencies, having as main purpose the efficiency of the schedule, in terms of load balancing and minimum time for the execution of the tasks.

  17. Simulation and real-time optimal scheduling: a framework for integration

    Energy Technology Data Exchange (ETDEWEB)

    Macal, C.M.; Nevins, M.R. [Argonne National Lab., IL (United States); Williams, M.K.; Joines, J.C. [Military Traffic Management Command Transportation Engineering Agency, Newport News, VA (United States)

    1997-02-01

    Traditional scheduling and simulation models of the same system differ in several fundamental respects. These include the definition of a schedule, the existence of an objective function which orders schedules and indicates the performance of a given schedule according to specific criteria, and the level of fidelity at which the items are represented and processed through he system. This paper presents a conceptual, object-oriented, architecture for combining a traditional, high-level, scheduling system with a detailed, process- level, discrete-event simulation. A multi-echelon planning framework is established in the context of modeling end-to-end military deployments with the focus on detailed seaport operations.

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

  19. Review of WiMAX Scheduling Algorithms and Their Classification

    Science.gov (United States)

    Yadav, A. L.; Vyavahare, P. D.; Bansod, P. P.

    2014-07-01

    Providing quality of service (QoS) in wireless communication networks has become an important consideration for supporting variety of applications. IEEE 802.16 based WiMAX is the most promising technology for broadband wireless access with best QoS features for tripe play (voice, video and data) service users. Unlike wired networks, QoS support is difficult in wireless networks due to variable and unpredictable nature of wireless channels. In transmission of voice and video main issue involves allocation of available resources among the users to meet QoS criteria such as delay, jitter and throughput requirements to maximize goodput, to minimize power consumption while keeping feasible algorithm flexibility and ensuring system scalability. WiMAX assures guaranteed QoS by including several mechanisms at the MAC layer such as admission control and scheduling. Packet scheduling is a process of resolving contention for bandwidth which determines allocation of bandwidth among users and their transmission order. Various approaches for classification of scheduling algorithms in WiMAX have appeared in literature as homogeneous, hybrid and opportunistic scheduling algorithms. The paper consolidates the parameters and performance metrics that need to be considered in developing a scheduler. The paper surveys recently proposed scheduling algorithms, their shortcomings, assumptions, suitability and improvement issues associated with these uplink scheduling algorithms.

  20. Chain-type wireless sensor network node scheduling strategy

    Institute of Scientific and Technical Information of China (English)

    Guangzhu Chen; Qingchun Meng; Lei Zhang

    2014-01-01

    In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network (WSN), sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment (UD), non-uniform deployment (NUD) and op-timal distribution point spacing (ODS) is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.

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

  2. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  3. Executive Schedule C System (ESCS)

    Data.gov (United States)

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

  4. The GBT Dynamic Scheduling System

    Science.gov (United States)

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

    2012-09-01

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

  5. Schedule Sales Query Raw Data

    Data.gov (United States)

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

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

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

  8. Scheduling commercial advertisements for television

    OpenAIRE

    Garcia-Villoria, Alberto; Salhi, Said

    2014-01-01

    The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heur...

  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. Batch Delivery Scheduling with Multiple Decentralized Manufacturers

    Directory of Open Access Journals (Sweden)

    Shi Li

    2014-01-01

    Full Text Available This paper addresses an integrated decision on production scheduling and delivery operations, which is one of the most important issues in supply chain scheduling. We study a model in which a set of jobs ordered by only one customer and a set of decentralized manufacturers located at different locations are considered. Specifically, each job must be assigned to one of the decentralized manufacturers to process on its single machine facility. Then, the job is delivered to the customer directly in batch without intermediate inventory. The objective is to find a joint schedule of production and distribution to optimize the customer service level and delivery cost. In our work, we discuss this problem considering two different situations in terms of the customer service level. In the first one, the customer service is measured by the maximum arrival time, while the customer service is measured by the total arrival time in the second one. For each situation, we develop a dynamic programming algorithm to solve, respectively. Moreover, we identify a special case for the latter situation by introducing its corresponding solutions.

  11. Ant Colony Optimisation for Backward Production Scheduling

    Directory of Open Access Journals (Sweden)

    Leandro Pereira dos Santos

    2012-01-01

    Full Text Available The main objective of a production scheduling system is to assign tasks (orders or jobs to resources and sequence them as efficiently and economically (optimised as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.

  12. Advanced sleep schedules affect circadian gene expression in young adults with delayed sleep schedules.

    Science.gov (United States)

    Zhu, Yong; Fu, Alan; Hoffman, Aaron E; Figueiro, Mariana G; Carskadon, Mary A; Sharkey, Katherine M; Rea, Mark S

    2013-05-01

    Human circadian rhythms are regulated by the interplay between circadian genes and environmental stimuli. The influence of altered sleep-wake schedules or light on human circadian gene expression patterns is not well characterized. Twenty-one young adults were asked to keep to their usual sleep schedules and two blood samples were drawn at the end of the first week from each subject based on estimated time of dim light melatonin onset (DLMO); the first sample was obtained one and a half hours before the estimated DLMO and the second three hours later, at one and a half hours after the estimated DLMO. During the second week, participants were randomized into two groups, one that received a one hour blue-light (λmax=470 nm) exposure in the morning and one that received a comparable morning dim-light exposure. Two blood samples were obtained at the same clock times as the previous week at the end of the second week. We measured the expression of 10 circadian genes in response to sleep-wake schedule advancement and morning blue-light stimulation in the peripheral blood of 21 participants during a two-week field study. We found that nine of the 10 circadian genes showed significant expression changes from the first to the second week for participants in both the blue-light and dim-light groups, likely reflecting significant advances in circadian phase. This wholesale change in circadian gene expression may reflect considerable advances in circadian phase (i.e., advance in DLMO) from the first to the second week resulting from the advanced, daily personal light exposures. Copyright © 2013 Elsevier B.V. All rights reserved.

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

  15. Workload-aware VM Scheduling on Multicore Systems

    Directory of Open Access Journals (Sweden)

    Insoon Jo

    2011-11-01

    Full Text Available In virtualized environments, performance interference between virtual machines (VMs is a key challenge. In order to mitigate resource contention, an efficient VM scheduling is positively necessary.In this paper, we propose a workload-aware VM scheduler on multi-core systems, which finds a systemwide mapping of VMs to physical cores. Our work aims not only at minimizing the number of used hosts,but at maximizing the system throughput. To achieve the first goal, our scheduler dynamically adjusts a set of used hosts. To achieve the second goal, it maps each VM on a physical core where the physical core and its host most sufficiently meet the resource requirements of the VM. Evaluation demonstrates that our scheduling ensures efficient use of data center resources.

  16. Decision Support for Iteration Scheduling in Agile Environments

    Science.gov (United States)

    Szőke, Ákos

    Today’s software business development projects often lay claim to low-risk value to the customers in order to be financed. Emerging agile processes offer shorter investment periods, faster time-to-market and better customer satisfaction. To date, however, in agile environments there is no sound methodological schedule support contrary to the traditional plan-based approaches. To address this situation, we present an agile iteration scheduling method whose usefulness is evaluated with post-mortem simulation. It demonstrates that the method can significantly improve load balancing of resources (cca. 5×), produce higher quality and lower-risk feasible schedule, and provide more informed and established decisions by optimized schedule production. Finally, the paper analyzes benefits and issues from the use of this method.

  17. Dynamic Extra Buses Scheduling Strategy in Public Transport

    Directory of Open Access Journals (Sweden)

    Bin Yu

    2015-06-01

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

  18. Deadlock-free Production Scheduling with Dynamic Buffers in MES

    Directory of Open Access Journals (Sweden)

    Taiping Mo

    2014-11-01

    Full Text Available In order to enable enterprises to change the production management mode and improve efficiency, MES provides overall solutions to information integration of manufacturing enterprises. Production scheduling is an important functional module in MES, and research of shop scheduling in MES has important significance. The concept deadlock is first put forward by computer science researchers who are engaged in resource allocation in the operation system. Modern manufacturing enterprises need to process complex workpieces with different processing step, so it is easy to produce a deadlock in the production process. A deadlock will bring many serious consequences for the system. Equipping with enough buffers can solve the problem of deadlock. However, it is costly and there is even no way to allocate buffers in some manufacturing industries. Considering the buffer cost and scheduling index, this paper puts forward the dynamic buffers deadlock-free scheduling to reduce cost and lower risk of the enterprise to a minimum.

  19. Design and Realization of the Safety Production Scheduling System

    Directory of Open Access Journals (Sweden)

    Qiang Fan

    2013-01-01

    Full Text Available In this study, we have a research of the design and realization of the Safety Production Scheduling System. Urged by the government departments as well as safety supervising institutions, many coal enterprises are embarking on designing and constructing an information system platform for safety production and scheduling. How to establish a systematic, comprehensive, standardized and scientific management platform for the safety production and scheduling has become a hot issue in the coal industry, which is also an important move to integrate various safety management measures in order to prevent major safety accidents and keep up with the international industry status. Taking a successful, large-scale safety production and scheduling system for example, this study elaborates on its overall design and construction. When the system is completed, it will play an important role in strengthening safety production of the coal mines, preventing accidents as well as increasing the overall safety level of the coal industry.

  20. Mining truck scheduling with stochastic maintenance cost

    Institute of Scientific and Technical Information of China (English)

    Erkan TOPAL; Salih RAMAZAN

    2012-01-01

    Open pit mining operations utilize large scale and expensive equipment.For the mines implementing shovel and truck operation system,trucks constitute a large portion of these equipment and are used for hauling the mined materials.In order to have sustainable and viable operation,these equipment need to be utilized efficiently with minimum operating cost.Maintenance cost is a significant proportion of the overall operating costs.The maintenance cost of a truck changes non-linearly depending on the type,age and truck types.A new approach based on stochastic integer programming (SIP) techniques is used for annually scheduling a fixed fleet of mining trucks in a given operation,over the life of mine (multi-year time horizon) to minimize maintenance cost.The maintenance cost data in mining usually has uncertainty caused from the variability of the operational conditions at mines.To estimate the cost,usually historic data from different operations for new mines,and/or the historic data at the operating mines are used.However,maintenance cost varies depending on road conditions,age of equipment and many other local conditions at an operation.Traditional models aim to estimate the maintenance cost as a deterministic single value and financial evaluations are based on the estimated value.However,it does not provide a confidence on the estimate.The proposed model in this study assumes the truck maintenance cost is a stochastic parameter due to the significant level of uncertainty in the data and schedules the available fleet to meet the annual production targets.The scheduling has been performed by applying both the proposed stochastic and deterministic approaches.The approach provides a distribution for the maintenance cost of the optimized equipment schedule minimizing the cost.

  1. Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling

    Directory of Open Access Journals (Sweden)

    Chen Yao

    2014-08-01

    Full Text Available Safety-critical avionics systems which become more complex and tend to integrate multiple functionalities with different levels of criticality for better cost and power efficiency are subject to certifications at various levels of rigorousness. In order to simultaneously guarantee temporal constraints at all different levels of assurance mandated by different criticalities, novel scheduling techniques are in need. In this paper, a mixed-criticality sporadic task model with multiple virtual deadlines is built and a certification-cognizant dynamic scheduling approach referred as earliest virtual-deadline first with mixed-criticality (EVDF-MC is considered, which exploits different relative deadlines of tasks in different criticality modes. As for the corresponding schedulability analysis problem, a sufficient and efficient schedulability test is proposed on the basis of demand-bound functions derived in the mixed-criticality scenario. In addition, a modified simulated annealing (MSA-based heuristic approach is established for virtual deadlines assignment. Experiments performing simulations with randomly generated tasks indicate that the proposed approach is computationally efficient and competes well against the existing approaches.

  2. Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling

    Institute of Scientific and Technical Information of China (English)

    Chen Yao; Li Qiao; Li Zheng; Xiong Huagang

    2014-01-01

    Safety-critical avionics systems which become more complex and tend to integrate multiple functionalities with different levels of criticality for better cost and power efficiency are subject to certifications at various levels of rigorousness. In order to simultaneously guarantee tem-poral constraints at all different levels of assurance mandated by different criticalities, novel sched-uling techniques are in need. In this paper, a mixed-criticality sporadic task model with multiple virtual deadlines is built and a certification-cognizant dynamic scheduling approach referred as ear-liest virtual-deadline first with mixed-criticality (EVDF-MC) is considered, which exploits different relative deadlines of tasks in different criticality modes. As for the corresponding schedulability analysis problem, a sufficient and efficient schedulability test is proposed on the basis of demand-bound functions derived in the mixed-criticality scenario. In addition, a modified simulated annealing (MSA)-based heuristic approach is established for virtual deadlines assignment. Experi-ments performing simulations with randomly generated tasks indicate that the proposed approach is computationally efficient and competes well against the existing approaches.

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

  4. Stochastic Scheduling and Planning Using Reinforcement Learning

    Science.gov (United States)

    2007-11-02

    reinforcement learning (RL) methods to large-scale optimization problems relevant to Air Force operations planning, scheduling, and maintenance. The objectives of this project were to: (1) investigate the utility of RL on large-scale logistics problems; (2) extend existing RL theory and practice to enhance the ease of application and the performance of RL on these problems; and (3) explore new problem formulations in order to take maximal advantage of RL methods. A method using RL to modify local search cost functions was developed and shown to yield significant

  5. The Dynamic Kernel Scheduler-Part 1

    Science.gov (United States)

    Adelmann, Andreas; Locans, Uldis; Suter, Andreas

    2016-10-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software that uses these hardware accelerators introduces additional challenges for the developer. These challenges may include exposing increased parallelism, handling different hardware designs, and using multiple development frameworks in order to utilise devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between the host application and different hardware accelerators. DKS handles the communication between the host and the device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL, and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated into OPAL (Object-oriented Parallel Accelerator Library) in order to speed up a parallel FFT based Poisson solver and Monte Carlo simulations for particle-matter interaction used for proton therapy degrader modelling. DKS was also used together with Minuit2 for parameter fitting, where χ2 and max-log-likelihood functions were offloaded to the hardware accelerator. The concepts of the DKS, first results, and plans for the future will be shown in this paper.

  6. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

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

  7. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

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

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

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

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

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

  12. Diagnosis of High Blood Pressure

    Medline Plus

    Full Text Available ... blood pressure test is easy and painless and can be done in a health care provider’s office ... severity of your blood pressure, he or she can order additional tests to determine if your blood ...

  13. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

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

  14. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

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

  15. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

  16. Batch Scheduling a Fresh Approach

    Science.gov (United States)

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

    1994-01-01

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

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

    , it is possible to design a gain-scheduled controller using multiple controllers optimised for a single frequency. Gain-scheduling strategies using the Youla parametrisation can guarantee stability at the cost of increased controller order and performance loss in the interpolation region. This paper contributes...... 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....

  18. Feature-based telescope scheduler

    Science.gov (United States)

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

    2016-07-01

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

  19. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

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

  1. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

    In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.

  2. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  3. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  4. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

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

  5. Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, J. [Western Oregon State College, Monmouth, OR (United States); Saletore, V.A. [Oregon State Univ., Corvallis, OR (United States); Lewis, T.G. [Naval Postgraduate School, Monterey, CA (United States)

    1994-12-01

    In this paper we present Safe Self-Scheduling (SSS), a new scheduling scheme that schedules parallel loops with variable length iteration execution times not known at compile time. The scheme assumes a shared memory space. SSS combines static scheduling with dynamic scheduling and draws favorable advantages from each. First, it reduces the dynamic scheduling overhead by statistically scheduling a major portion of loop iterations. Second, the workload is balanced with simple and efficient self-scheduling scheme by applying a new measure, the smallest critical chore size. Experimental results comparing SSS with other scheduling schemes indicate that SSS surpasses other scheduling schemes. In the experiment on Gauss-Jordan, an application that is suitable for static scheduling schemes, SSS is the only self-scheduling scheme that outperforms the static scheduling scheme. This indicates that SSS achieves a balanced workload with a very small amount of overhead.

  6. A Study on the Engineering Construction Schedule Control

    Institute of Scientific and Technical Information of China (English)

    Song Shihai

    2014-01-01

    In the whole process of engineering construction,its schedule control is a very important part,which not only directly affects the quality of the whole project,but also plays a very important role in the economic effect of the entire project. Meanwhile,in the particular process of engineering construction,since construction is a dynamic process,coupled with the numerous factors that involved in the engineering construction schedule control and the program is quite complex,it is so imperative to put the factors and program involved in order;and from a dynamic point of view,the construction schedule control can be studied and analyzed in a comprehensive way. The paper begins with the study of relative definitions of engineering construction schedule control and illustrates the involved factors and the corresponding influence of them on the engineering construction schedule control based on the case study of real estate project construction schedule control at Fuyuan Jiayuan of Tai'an City. And some related suggestions are put forward on the base and the author expects to make an active theoretical guidance effect on engineering construction.

  7. Petri net and beam search based FMS scheduling system

    Energy Technology Data Exchange (ETDEWEB)

    Shih, H.; Sekiguchi, T. (Yokohama National University, Yokohama (Japan))

    1992-04-15

    The present paper proposes an on-line flexible manufacturing system (FMS) scheduling system which takes in consideration the routing flexibility. The FMS was modeled by utilizing a timed Petri net representation. This representation gives real time information about the production evolvement and the situation of each machine and equipment. According to this information, the present system starts to search for the scheduling of the next orders to be assigned. The search is conducted by a beam search based on-line decision method. An algorithm has been developed by integrating the timed Petri net representation to the beam search. In order to test the developed system, a just-in-time production objective was established. The performance of this system was evaluated by exhaustive simulations. Consequently, a better achievement of the production objective as well as a smaller variance under different scheduling conditions can be realized. 14 refs., 6 figs., 2 tabs.

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

  9. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    Science.gov (United States)

    1994-01-01

    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979. [13] Eliyahu M. Goldratt ...techniques is the one developed by Goldratt and his colleagues within the context of the OPT factory scheduling system [13, 15, 10]. OPT demonstrated

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

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

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

  11. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

    Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

  12. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different...

  13. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    LE Bisping

    1999-02-12

    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.

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

  15. An Integrated Expert System for Linear Scheduling Heavy Earthmoving Operations

    Directory of Open Access Journals (Sweden)

    Nizar Markiz

    2016-01-01

    Full Text Available Heavy earthmoving operations are repetitive in nature and vulnerable to time-related restraints and uncertainties. Therefore, at the conceptual stage, scheduling these operations can take a linear form, known as linear schedule or line of balance (LOB. In such type of work, generating a preliminary line of balance for variable sequencing of activities is crucial. In this paper, an integrated expert system for determining preliminary linear schedules for heavy earthmoving operations at the conceptual stage is presented. The proposed system incorporates numerous factors that influence the analysis of earthmoving operations, which include geological and topographical parameters used to determine productivity rates at the conceptual stage. Also, the proposed system is capable of automatically generating a line of balance based on a stochastic scheduling technique via the metaheuristic simulated annealing intelligent approach to incorporate randomness and uncertainties in performing the associated activities. A parametric analysis is conducted in order to quantify the system’s degree of accuracy. An actual case project is then utilized to illustrate its numerical capabilities. Generating accurate linear schedules for heavy earthmoving operations at the conceptual design stage is anticipated to be of major significance to infrastructure project stakeholders, engineers, and construction managers by detecting schedule’s conflicts early in order to enhance overall operational logistics.

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

  17. Weirton Steel Corporation logistics and integrated scheduling. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Guzzetta, M.B. [comp.

    1996-06-01

    In order to remain competitive in the changing steel market, US steel producers restructured by taking on foreign and domestic partners, closing facilities and/or trimming work forces, and modernizing their steel making facilities. However, very little was done to develop production management technology to complement these changes. The Logistics and Integrated Scheduling program (LIS) was undertaken to address this issue. LIS is an information management system that delivers better customer service, better quality materials, and a just-in-time delivery system. It involves three major components: (1) material marking and sensing: advanced R&D applied to determining cost effective, feasible solutions to passive inventory; (2) material inventory and tracking: advanced technology applied to managing inventory movement; (3) planning and scheduling: beginning with annual production plans, order management, and operational constraints, the ability to build integrated schedules capable of pull through and push through scheduling for various plant capability levels and location configurations with rapid turnaround capability. LIS provides accurate, automated tracking of material flows throughout the mill, the collection and analysis of production data, and automated schedule optimization.

  18. A scheduling model for astronomy

    Science.gov (United States)

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

    2016-04-01

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

  19. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    2012-01-01

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  20. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    2011-01-01

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  1. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  2. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  3. CROP UNDER DEFICIT IRRIGATION SCHEDULING

    African Journals Online (AJOL)

    This study presents crop coefficient (Kc) values of TMV 1 -ST maize variety ... given time from planting to the time it is harvested. ... real time irrigation scheduling for high frequent and non-fiequent water .... 10 m, and the average soil bulk density was 1420 kg/m'. ...... Performance Evaluation of Fadama Irrigation Practice.

  4. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

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

  5. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

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

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

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

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

  9. 18 CFR 157.217 - Changes in rate schedules.

    Science.gov (United States)

    2010-04-01

    ... CONVENIENCE AND NECESSITY AND FOR ORDERS PERMITTING AND APPROVING ABANDONMENT UNDER SECTION 7 OF THE NATURAL... authorization. The certificate holder is authorized to permit an existing customer, at the customer's request... limitations on deliveries to the customer under both rate schedules are not increased, for either annual...

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

  11. Blood Types

    Science.gov (United States)

    ... blood, safe blood transfusions depend on careful blood typing and cross-matching. The ABO Blood Group System ... that provided by the ABO positive/negative blood typing. For example, sometimes if the donor and recipient ...

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

  13. Utilizing GIS to evaluate base schedules in paratransit operations. Final technical report, July 1997--February 1999

    Energy Technology Data Exchange (ETDEWEB)

    Nalevanko, A.; McDonald, S.; Garrity, R.

    1999-02-02

    With ready access to street file names and inexpensive GIS software, paratransit systems can take advantage of GIS technology to evaluate base schedules on a regular basis in order to maintain system efficiency at consistently high levels. This project will develop a methodology to allow frequent analysis of base schedules to update paratransit routes on a semi-annual or annual basis.

  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. Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Lingna He

    2012-09-01

    Full Text Available 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 specific implementation for cloud resources scheduling . And in CloudSim simulation environment and simulation experiments, the results show that the algorithm has better scheduling performance and load balance than general algorithm.

  16. Optimal Power Scheduling for an Islanded Hybrid Microgrid

    DEFF Research Database (Denmark)

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

    2016-01-01

    A microgrid is a system that integrates energy generation, energy storage, and loads and it is able to operate either in interconnected or islanded mode. Energy resources should be scheduled to supply the load properly in order to coordinate optimally the power exchange within the microgrid...... according to a defined objective function. In this paper, an optimal power scheduling for generation and demand side is presented to manage an islanded hybrid PV-wind-battery microgrid implemented in Shanghai-China. The optimization is addressed through a Mixed-Integer Linear Programming (MILP) mathematical......SPACE1006) in which a scaled down model of this microgrid is emulated....

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

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

  19. Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems

    DEFF Research Database (Denmark)

    Eles, Petru; Kuchcinski, Krzysztof; Peng, Zebo

    1998-01-01

    The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have developed algorithms for process graph scheduling based on listscheduling and branch-and-bound strategies. One essential...... contribution is in the manner in which information on process allocation is used in order to efficiently derive a good quality or optimal schedule. Experiments show the superiority of these algorithms compared to previous approaches like critical-path heuristics and ILP based optimal scheduling. An extension...... of our approach allows the scheduling of conditional process graphs capturing both data and control flow. In this case a schedule table has to be generated so that the worst case delay is minimized....

  20. A Component Based Heuristic Search method with Adaptive Perturbations for Hospital Personnel Scheduling

    CERN Document Server

    Li, Jingpeng; Burke, Edmund

    2008-01-01

    Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over the world. This paper presents a new component-based approach with adaptive perturbations, for a nurse scheduling problem arising at a major UK hospital. The main idea behind this technique is to decompose a schedule into its components (i.e. the allocated shift pattern of each nurse), and then mimic a natural evolutionary process on these components to iteratively deliver better schedules. The worthiness of all components in the schedule has to be continuously demonstrated in order for them to remain there. This demonstration employs a dynamic evaluation function which evaluates how well each component contributes towards the final objective. Two perturbation steps are then applied: the first perturbation eliminates a number of components that are deemed not worthy to stay in the current schedule; the second perturbation may also throw out, with a low level of probability, some worthy components. The eli...

  1. Immunization Schedules for Infants and Children

    Science.gov (United States)

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

  2. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

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

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

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

  5. Behavioral momentum and accumulation of mass in multiple schedules.

    Science.gov (United States)

    Craig, Andrew R; Cunningham, Paul J; Shahan, Timothy A

    2015-05-01

    Behavioral momentum theory suggests that the relation between a discriminative-stimulus situation and reinforcers obtained in that context (i.e., the Pavlovian stimulus-reinforcer relation) governs persistence of operant behavior. Within the theory, a mass-like aspect of behavior has been shown to be a power function of predisruption reinforcement rates. Previous investigations of resistance to change in multiple schedules, however, have been restricted to examining response persistence following protracted periods of stability in reinforcer rates within a discriminative situation. Thus, it is unclear how long a stimulus-reinforcer relation must be in effect prior to disruption in order to affect resistance to change. The present experiment examined resistance to change of pigeon's key pecking following baseline conditions where reinforcer rates that were correlated with discriminative-stimulus situations changed. Across conditions, one multiple-schedule component arranged either relatively higher rates or lower rates of variable-interval food delivery, while the other component arranged the opposite rate. These schedules alternated between multiple-schedule components across blocks of sessions such that reinforcer rates in the components were held constant for 20, 5, 3, 2, or 1 session(s) between alternations. Resistance to extinction was higher in the component that most recently was associated with higher rates of food delivery in all conditions except when schedules alternated daily or every other day. These data suggest that resistance to change in multiple schedules is related to recently experienced reinforcer rates but only when multiple-schedule components are associated with specific reinforcer rates for several sessions. © Society for the Experimental Analysis of Behavior.

  6. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

  7. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-10-01

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

  8. Dynamic Broadcast Scheduling in DDBMS

    Directory of Open Access Journals (Sweden)

    Babu Santhalingam,

    2011-01-01

    Full Text Available This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamically generated data objects and answer the complex query for retrieving multiple data objects. In dynamic environments, data streams need to be online processed rather than being stored and later retrieved to answer queries. Particularly, data objects are produced dynamically by the information providers, interleaved and disseminated efficiently by the broadcasting servers, and associated sequentially in the client sides. The proposed algorithm with a well-specific gain measure function prominently outperforms the FIFO schedule and is able to minimize the mean service access time to the extent close to the theoretical optimum.

  9. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

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

  10. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

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

  11. Scheduling Coast Guard District Cutters

    Science.gov (United States)

    1992-09-01

    DESCRIPTION ..... ............ .. 14 D. COSTS, PENALTIES, AND MEASURES OF EFFECTIVENESS 15 iv IV . COMPUTATIONAL EXPERIENCE ............ 19 A. TEST PROBLEMS...used. Using the model of Chapter III, computational performance for a year’s worth of actual data from the First District is presented in Chapter IV ...2G, B-2NY, B-2SAR, C); t - week the cutter assumes the patrol status. COSTO - cost of scheduling cutter i to patrol k; (1 if ship i is available for

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  13. 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. User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

    Directory of Open Access Journals (Sweden)

    P. Suresh

    2013-01-01

    Full Text Available Grid computing is a collection of computational and data resources, providing the means to support both computational intensive applications and data intensive applications. In order to improve the overall performance and efficient utilization of the resources, an efficient load balanced scheduling algorithm has to be implemented. The scheduling approach also needs to consider user demand to improve user satisfaction. This paper proposes a dynamic hierarchical load balancing approach which considers load of each resource and performs load balancing. It minimizes the response time of the jobs and improves the utilization of the resources in grid environment. By considering the user demand of the jobs, the scheduling algorithm also improves the user satisfaction. The experimental results show the improvement of the proposed load balancing method.

  15. A Scheduling Method for Painting Line under Pull Production

    Science.gov (United States)

    Yoo, Jae Kyu; Shinbo, Kojiro; Shimizu, Yoshiaki

    This paper concerns with a scheduling method for painting (preceding) line with much longer production lead-time than assembly (subsequent) line. In general, production schedule of the painting line is made independently based on the forecasted job requirement at the assembly line. When the job requirement changes at the assembly line by virtue of the change of customer order, therefore, production balance is destroyed between the both lines. To avoid the tardiness caused by such unbalance, we need to have many inventories for the painting line. Such countermeasure is taken place in many companies actually. Thus, to avoid the tardiness while keeping small inventory, we propose a scheduling method that makes a Pseudo-Pull production possible for the painting line. We have evaluated the proposed method through computer simulations.

  16. Scheduling Issues in ECOFRAME Optical Packet Switched Ring

    Directory of Open Access Journals (Sweden)

    P. Gravey

    2011-06-01

    Full Text Available In the metropolitan area, traditional SONET/SDH circuit switched rings are likely to be replaced with optical packet/burst switching technologies. In this paper we consider a slotted WDM optical packet ring operating without resource reservation mechanisms. In such rings, optical packets in transit have priority over traffic to be inserted by the node. Packets to be inserted are thus queued according to their destination, in order to avoid headof-line blocking. We focus on scheduling policies and compare several MaxWeight scheduling policies, including Oldest Packet First (OPF which emulates FIFO queueing while avoiding head-of-line blocking. We show that there is a trade-off between implementation complexity and fairness, and identify the Largest Virtual Waiting Time First (LVWTF scheduling policy as presenting both a low complexity and a good fairness performance.

  17. Performance Evaluation of Different Scheduling Algorithms in WiMAX

    CERN Document Server

    Al-Howaide, Ala'a Z; Khamayseh, Yaser M; 10.5121/ijcsea.2011.1509

    2011-01-01

    Worldwide Interoperability for Microwave Access (WiMAX) networks were expected to be the main Broadband Wireless Access (BWA) technology that provided several services such as data, voice, and video services including different classes of Quality of Services (QoS), which in turn were defined by IEEE 802.16 standard. Scheduling in WiMAX became one of the most challenging issues, since it was responsible for distributing available resources of the network among all users; this leaded to the demand of constructing and designing high efficient scheduling algorithms in order to improve the network utilization, to increase the network throughput, and to minimize the end-to-end delay. In this study, we presenedt a simulation study to measure the performance of several scheduling algorithms in WiMAX, which were Strict Priority algorithm, Round-Robin (RR), Weighted Round Robin (WRR), Weighted Fair Queuing (WFQ), Self-Clocked Fair (SCF), and Diff-Serv Algorithm.

  18. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

    2016-10-15

    Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

  19. Influência da redação da prescrição médica na administração de medicamentos em horários diferentes do prescrito Influencia de la redación de la prescripción médica en la administración de medicamentos en horarios diferentes al prescripto Influence of the writing of the medical orders on the administration of medications at the wrong schedule time

    Directory of Open Access Journals (Sweden)

    Fernanda Raphael Escobar Gimenes

    2009-01-01

    evaluate the influence of the writing of medical orders on the administration of medications in medical units from five brazilian hospitals. METHODS: This descriptive study used a secondary analysis of data from a multicenter study conducted in 2005. the sample consisted of 1,084 medication orders that had been administered at the wrong schedule time. RESULTS: The great majority of medical orders (96.2% had acronyms and/or abbreviations, 7.8% of them had incomplete schedules for administration of the medication, and 4.8% had been marked out. in addition, there was no schedule for the administration of the medication in 1.9% of the medical orders. CONCLUSION: Implementation of electronic prescribing and continuing education of health care providers can minimize the administration of medication at the wrong schedule time.

  20. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

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

  1. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

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

    2012-01-01

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

  2. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

    Megow, N.; Uetz, Marc Jochen; Vredeveld, T.

    We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that

  3. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

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

  4. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

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

  5. Centralized scheduling an unanticipated revenue cycle opportunity.

    Science.gov (United States)

    O'Neill, Daniel P; Kenniff, Peter B

    2007-09-01

    Centralized outpatient scheduling can provide acute care hospitals with accessibility and service levels equal to freestanding facilities, enabling hospitals to recapture lost market share. Two implementation strategies are critical to the success of centralized scheduling: Correctly developing the schedule. Managing the incoming call volume.

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

  7. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

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

    2012-01-01

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

  8. An Algorithm for Automatically Modifying Train Crew Schedule

    Science.gov (United States)

    Takahashi, Satoru; Kataoka, Kenji; Kojima, Teruhito; Asami, Masayuki

    Once the break-down of the train schedule occurs, the crew schedule as well as the train schedule has to be modified as quickly as possible to restore them. In this paper, we propose an algorithm for automatically modifying a crew schedule that takes all constraints into consideration, presenting a model of the combined problem of crews and trains. The proposed algorithm builds an initial solution by relaxing some of the constraint conditions, and then uses a Taboo-search method to revise this solution in order to minimize the degree of constraint violation resulting from these relaxed conditions. Then we show not only that the algorithm can generate a constraint satisfaction solution, but also that the solution will satisfy the experts. That is, we show the proposed algorithm is capable of producing a usable solution in a short time by applying to actual cases of train-schedule break-down, and that the solution is at least as good as those produced manually, by comparing the both solutions with several point of view.

  9. Word Order

    DEFF Research Database (Denmark)

    Rijkhoff, Jan

    2015-01-01

    The way constituents are ordered in a linguistic expression is determined by general principles and language specific rules. This article is mostly concerned with general ordering principles and the three main linguistic categories that are relevant for constituent order research: formal, functio...

  10. Research on logistics scheduling based on PSO

    Science.gov (United States)

    Bao, Huifang; Zhou, Linli; Liu, Lei

    2017-08-01

    With the rapid development of e-commerce based on the network, the logistics distribution support of e-commerce is becoming more and more obvious. The optimization of vehicle distribution routing can improve the economic benefit and realize the scientific of logistics [1]. Therefore, the study of logistics distribution vehicle routing optimization problem is not only of great theoretical significance, but also of considerable value of value. Particle swarm optimization algorithm is a kind of evolutionary algorithm, which is based on the random solution and the optimal solution by iteration, and the quality of the solution is evaluated through fitness. In order to obtain a more ideal logistics scheduling scheme, this paper proposes a logistics model based on particle swarm optimization algorithm.

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

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

    NARCIS (Netherlands)

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

    1990-01-01

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

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

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

  15. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

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

  16. Blood transfusions

    Science.gov (United States)

    ... this page: //medlineplus.gov/ency/patientinstructions/000431.htm Blood transfusions To use the sharing features on this ... several sources of blood which are described below. Blood From the Public (Volunteer Blood Donation) The most ...

  17. Blood smear

    Science.gov (United States)

    ... some red blood cells shaped like spheres ( hereditary spherocytosis ) Increased breakdown of RBCs Presence of RBCs with ... normal Red blood cells, elliptocytosis Red blood cells, spherocytosis Acute lymphocytic leukemia - photomicrograph Red blood cells, multiple ...

  18. Blood culture

    Science.gov (United States)

    Culture - blood ... A blood sample is needed . The site where blood will be drawn is first cleaned with an antiseptic such ... organism from the skin getting into (contaminating) the blood sample and causing a false-positive result (see ...

  19. Blood Thinners

    Science.gov (United States)

    If you have some kinds of heart or blood vessel disease, or if you have poor blood flow to your brain, your doctor may recommend that you take a blood thinner. Blood thinners reduce the risk of heart ...

  20. Blood typing

    Science.gov (United States)

    A blood sample is needed. The test to determine your blood group is called ABO typing. Your blood sample is mixed with antibodies against type A and B blood. Then, the sample is checked to see whether ...

  1. Increasing the flexibility of operational scheduling for a large-scale CHP plant used for generating district heat and electricity in order to meet the varying market demands; Steigerung der Einsatzflexibilitaet einer grossen KWK-Anlage zur Fernwaerme- und Stromerzeugung gemaess aktueller Marktanforderungen

    Energy Technology Data Exchange (ETDEWEB)

    Meierer, Matthias; Krupp, Roland; Stork, Rolf [Grosskraftwerk Mannheim AG, Mannheim (Germany)

    2015-07-01

    The substantial changes in the structure of German power supply plants pose high demands on the flexibility of the operational scheduling of conventional thermal power plants. Grosskraftwerk Mannheim AG is a power plant company that is operating a plant for combined power and district heat generation. The paper describes some measures which have been taken to improve the plant's operational flexibility. In addition, the associated technical systems and their functions, as well as the state of ongoing projects are outlined. Special focus is placed on topics related to issues such as ''district-heat storage unit of the new unit 9, flexibility of operational scheduling, and efficient CHP plant operation''.

  2. 76 FR 29008 - Granular Polytetrafluoroethylene Resin From Italy; Correction of Notice of Scheduling

    Science.gov (United States)

    2011-05-19

    ... From the Federal Register Online via the Government Publishing Office INTERNATIONAL TRADE COMMISSION Granular Polytetrafluoroethylene Resin From Italy; Correction of Notice of Scheduling AGENCY... expedited five-year review on an antidumping duty order on granular polytetrafluoroethylene resin from...

  3. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

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

  4. Routine environmental monitoring schedule, calendar year 1995

    Energy Technology Data Exchange (ETDEWEB)

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

    1994-12-01

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

  5. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

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

  7. 采用排队论优化十堰市某医院门诊采血技师配置对患者满意度的影响%Effect of Patient Satisfaction by Queuing Theory in Outpatient Department of Scheduling Blood Collection Technician of a Hospital in Shiyan

    Institute of Scientific and Technical Information of China (English)

    柴海霞; 刘菊英; 王锋; 罗强; 谢飞; 郑苏; 姚红

    2016-01-01

    Objective:To explore the rational allocation of outpatient department blood collection technician of one hospital in Shiyan based on queuing theory and compare the patient satisfaction of outpatient before and after allocating laboratory services. Methods:Time measuring and queuing theory model were applied to calculate commonly used fit index of queuing theory in the technician configuration. The questionnaires were conducted to evaluate patients' satisfaction. Results:Allocating 6 technicians from Monday to Tuesday morning and 5 technicians from Wednesday to Sunday morning were reasonable. The patient satisfaction was improved after adjusting technicians on the basis of queuing theory analysis ( P<0.05) .Conclusion:Queuing theory method can provide reasonable suggestion for staff scheduling,as well as point the new research direction to improve customer satisfaction.%目的::运用排队论分析十堰市某医院门诊采血技师配置的合理性,比较门诊采血技师配置前后患者满意度的变化。方法:运用工时测量法和排队论模型,计算门诊采血排队系统中的各项运行指标,得出合理的技师配置;运用调查问卷评估患者满意度。结果:每周一至周二上午配置6名技师较为合理;周三至周日上午配置5名技师较为合理。根据排队论分析并调整技师排班后,门诊采血窗口患者满意度得到明显提高( P<0.05)。结论:排队论方法可以合理配置采血室的工作人员,同时为研究患者满意度提供新的方向。

  8. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

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

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

  9. Scheduling of an aircraft fleet

    Science.gov (United States)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

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

  10. Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

    Institute of Scientific and Technical Information of China (English)

    Chollette C.Chude-Olisah; Uche A.K.Chude-Okonkwo; Kamalrulnizam A.Balar; Ghazali Sulong

    2013-01-01

    Addressing the problem of queue scheduling for the packet-switched system is a vital aspect of congestion control.In this paper,the fuzzy logic based decision method is adopted for queue scheduling in order to enforce some level of control for traffic of different quality of service requirements using predetermined values.The fuzzy scheduler proposed in this paper takes into account the dynamic nature of the Internet traffic with respect to its time-varying packet arrival process that affects the network states and performance.Three queues are defined,viz low,medium and high priority queues.The choice of prioritizing packets influences how queues are served.The fuzzy scheduler not only utilizes queue priority in the queue scheduling scheme,but also considers packet drop susceptibility and queue limit.Through simulation it is shown that the fuzzy scheduler is more appropriate for the dynamic nature of Internet traffic in a packet-switched system as compared with some existing queue scheduling methods.Results show that the scheduling strategy of the proposed fuzzy scheduler reduces packet drop,provides good link utilization and minimizes queue delay as compared with the priority queuing (PQ),first-in-first-out (FIFO),and weighted fair queuing (WFQ).

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

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

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

  13. Steps Toward Optimal Competitive Scheduling

    Science.gov (United States)

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

    2006-01-01

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

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

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

  16. A two-phase tabu search approach to scheduling optimization in container terminals

    Institute of Scientific and Technical Information of China (English)

    ZENG Qing-cheng; YANG Zhong-zhen

    2007-01-01

    An optimization model for scheduling of quay cranes (QCs) and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithra was designed. In the QCs scheduling phase of the algorithm, a search was performed to determine a good QC unloading operation order. For each QC unloading operation order generated during the QC's scheduling phase, another search was run to obtain a good yard trailer routing for the given QC's unloading order. Using this information, the time required for the operation was estimated,then the time of return to availability of the units was fed back to the QC scheduler. Numerical tests show that the two-phase Tabu Search algorithm searches the solution space efficiently, decreases the empty distance yard trailers must travel, decreases the number of trailers needed, and thereby reduces time and costs and improves the integration and reliability of container terminal operation systems.

  17. Evolutionary based system for production scheduling in foundry

    Directory of Open Access Journals (Sweden)

    A. Stawowy

    2008-10-01

    Full Text Available This work presents a development of a capable-to-promise system for companies that operate under the hybrid make-to-order and maketo-stock strategy in a lot-sizing and flowshop environment. Proposed system simultaneously considers planning and scheduling processesin order to achieve the optimality. Optimisation engine is based on an advanced evolutionary algorithm. Information available in ERPsystem from different production units and stages, the optimization module, and customer requests are integrated via Internet using XMLlanguage as a data exchange standard.The details on key elements of the system and a software architecture are given. Practical application of the system is illustrated on the example of production scheduling for an iron castings foundry.

  18. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview......The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

  19. Minimally disruptive schedule repair for MCM missions

    Science.gov (United States)

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

    2015-05-01

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

  20. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear...... 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...

  1. Greedy Maximal Scheduling in Wireless Networks

    CERN Document Server

    Li, Qiao

    2010-01-01

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

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

  3. Fair Scheduling in Networks Through Packet Election

    CERN Document Server

    Jagabathula, Srikanth

    2008-01-01

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

  4. Blood Donation

    Science.gov (United States)

    Tests and Procedures Blood donation By Mayo Clinic Staff Blood donation is a voluntary procedure. You agree to have blood drawn so that it can ... have a disease that requires blood components. Blood donation makes all of this possible. There are several ...

  5. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

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

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

  7. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

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

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

  9. Analysis of a stochastic lot scheduling problem with strict due-dates

    NARCIS (Netherlands)

    van Foreest, Nicolaas; Wijngaard, Jacob; Boucherie, Richard; van Dijk, Nico M.

    2017-01-01

    This chapter considers admission control and scheduling rules for a single machine production environment. Orders arrive at a single machine and can be grouped into serveral product families. Each order has a family dependent due-date, production duration, and reward. When an order cannot be served

  10. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

    In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in 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 with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

  11. A Conservative Multiversion Locking—Graph Scheduler Algorithm

    Institute of Scientific and Technical Information of China (English)

    陈Fang; 施伯乐

    1991-01-01

    In order to improve the concurrency of multiversion database systems,a conservative MV locking-graph scheduler algorithm is proposed,which takes the power of MVS as a target.The algorithm combines the advantages of locking and graph,and does optimizing processes on read-only and write-only operations to reduce the blocks of transactions.The correctness and complexity of the algorithm are also provided.

  12. A Multi-Carrier Scheduling Algorithm for LTE-Advanced

    DEFF Research Database (Denmark)

    Vulpe, Alexander; Mihovska, Albena D.; Prasad, Ramjee

    2013-01-01

    LTE-Advanced aims to provide a transmission bandwidth of 100 MHz by using Carrier Aggregation to aggregate LTE Rel. 8 carriers. In order to increase the system capacity, resource allocation becomes a very good tool, and, in the context of the existence of multiple Component Carriers in LTE-Advanc......Net scenario) that respects the 3GPP specifications. Numerical results show that this algorithm has better performances than the traditional Round Robin and Proportionally Fair resource scheduling algorithms....

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

  14. Blood groups systems

    Directory of Open Access Journals (Sweden)

    Ranadhir Mitra

    2014-01-01

    Full Text Available International Society of Blood Transfusion has recently recognized 33 blood group systems. Apart from ABO and Rhesus system, many other types of antigens have been noticed on the red cell membranes. Blood grouping and cross-matching is one of the few important tests that the anaesthesiologist orders during perioperative period. Hence, a proper understanding of the blood group system, their clinical significance, typing and cross-matching tests, and current perspective are of paramount importance to prevent transfusion-related complications. Nonetheless, the knowledge on blood group system is necessary to approach blood group-linked diseases which are still at the stage of research. This review addresses all these aspects of the blood groups system.

  15. An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint

    Science.gov (United States)

    Garcia, Christopher; Rabadi, Ghaith

    2010-01-01

    Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.

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

  17. Dynamic Task-Scheduling in Grid Computing using Prioritized Round Robin Algorithm

    Directory of Open Access Journals (Sweden)

    Sunita Bansal

    2011-03-01

    Full Text Available Over the years, grid computing has emerged as one of the most viable and scalable alternatives to high performance supercomputing, tapping into computing power of the order of Gigaflops. However, the inherent dynamicity in grid computing has made it extremely difficult to come up with near-optimal solutions to efficiently schedule tasks in grids. The present paper proposes a novel grid-scheduling heuristic that adaptively and dynamically schedules tasks without requiring any prior information on the workload of incoming tasks. The approach models the grid system in the form of a state-transition diagram, employing a prioritized round-robin algorithm with task replication to optimally schedule tasks, using prediction information on processor utilization of individual nodes. Simulations, comparing the proposed approach with the round-robin heuristic, have shown the given heuristic to be more effective in scheduling tasks as compared to the latter.

  18. Critical Task Re-assignment under Hybrid Scheduling Approach in Multiprocessor Real-Time Systems

    CERN Document Server

    Nair, Gopalakrishnan T R

    2012-01-01

    Embedded hard real time systems require substantial amount of emergency processing power for the management of large scale systems like a nuclear power plant under the threat of an earth quake or a future transport systems under a peril. In order to meet a fully coordinated supervisory control of multiple domains of a large scale system, it requires the scenario of engaging multiprocessor real time design. There are various types of scheduling schemes existing for meeting the critical task assignment in multiple processor environments and it requires the tracking of faulty conditions of the subsystem to avoid system underperformance from failure patterns. Hybrid scheduling usually engages a combined scheduling philosophy comprising of a static scheduling of a set of tasks and a highly pre-emptive scheduling for another set of tasks in different situations of process control. There are instances where highly critical tasks need to be introduced at a least expected catastrophe and it cannot be ensured to meet a...

  19. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

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

  20. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

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

  1. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

    ...) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE NATIONAL SECURITY INDUSTRIAL BASE REGULATIONS DEFENSE PRIORITIES AND ALLOCATIONS SYSTEM Industrial Priorities § 700.14 Preferential scheduling. (a) A...

  2. Scheduling By Using Fuzzy Logic in Manufacturing

    Directory of Open Access Journals (Sweden)

    Miss. Ashwini. A. Mate

    2014-07-01

    Full Text Available This paper represents the scheduling process in furniture manufacturing unit. It gives the fuzzy logic application in flexible manufacturing system. Flexible manufacturing systems are production system in furniture manufacturing unit. FMS consist of same multipurpose numerically controlled machines. Here in this project the scheduling has been done in FMS by using fuzzy logic tool in Matlab software. The fuzzy logic based scheduling model in this paper will deals with the job and best alternative route selection with multi-criteria of machine. Here two criteria for job and sequencing and routing with rules. This model is applicable to the scheduling of any manufacturing industry.

  3. CASSIUS: The Cassini Uplink Scheduler

    Science.gov (United States)

    Bellinger, Earl

    2012-01-01

    The Cassini Uplink Scheduler (CASSIUS) is cross-platform software used to generate a radiation sequence plan for commands being sent to the Cassini spacecraft. Because signals must travel through varying amounts of Earth's atmosphere, several different modes of constant telemetry rates have been devised. These modes guarantee that the spacecraft and the Deep Space Network agree with respect to the data transmission rate. However, the memory readout of a command will be lost if it occurs on a telemetry mode boundary. Given a list of spacecraft message files as well as the available telemetry modes, CASSIUS can find an uplink sequence that ensures safe transmission of each file. In addition, it can predict when the two on-board solid state recorders will swap. CASSIUS prevents data corruption by making sure that commands are not planned for memory readout during telemetry rate changes or a solid state recorder swap.

  4. Data-Replicas Scheduler for Heterogeneous MapReduce Cluster

    Directory of Open Access Journals (Sweden)

    Yang Yang

    2013-05-01

    Full Text Available Large scale data processing has rapidly increased in nowadays. MapReduce programming model, which is firstly mentioned in functional languages, appeared in distributed system and perform excellently in large scale data processing since 2006. Hadoop, which is the most popular framework of open-sourced MapReduce runtime environment, supplies reliable, scalable and distributed system processing large scale data across clusters of computers using this virtue programming model. In this system, files are split into many blocks and all blocks are replicated over several computers in clusters. To process these blocks efficiently, each job runs parallel and is divided into many tasks which deals with a file block. In order to fully take advantage of network bandwidth these systems, data locality is paid more and more attentions. Considering the existence of data-replica blocks, we propose a data-replicas scheduler which includes task scheduling and data allocation. The data-replicas scheduler takes fully advantage of data replicas in local Data node, reduce the costs of data transfer and improve the system performance. The results of experiments show that our scheduler not only improves the CPU ratio, but also reduces the packets that transfer in the network.

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

  6. DRSCRO: A Metaheuristic Algorithm for Task Scheduling on Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Yuyi Jiang

    2015-01-01

    Full Text Available An efficient DAG task scheduling is crucial for leveraging the performance potential of a heterogeneous system and finding a schedule that minimizes the makespan (i.e., the total execution time of a DAG is known to be NP-complete. A recently proposed metaheuristic method, Chemical Reaction Optimization (CRO, demonstrates its capability for solving NP-complete optimization problems. This paper develops an algorithm named Double-Reaction-Structured Chemical Reaction Optimization (DRSCRO for DAG scheduling on heterogeneous systems, which modifies the conventional CRO framework and incorporates CRO with the variable neighborhood search (VNS method. DRSCRO has two reaction phases for super molecule selection and global optimization, respectively. In the molecule selection phase, the CRO as a metaheuristic algorithm is adopted to obtain a super molecule for accelerating convergence. For promoting the intensification capability, in the global optimization phase, the VNS algorithm with a new processor selection model is used as the initialization under the consideration of scheduling order and processor assignment, and the load balance neighborhood structure of VNS is also utilized in the ineffective reaction operator. The experimental results verify the effectiveness and efficiency of DRSCRO in terms of makespan and convergence rate.

  7. Based on the MapReduce Model for Data-intensive Computing of Energy Scheduling Algorithm Strategy

    Directory of Open Access Journals (Sweden)

    Yuqiang Sun

    2013-05-01

    Full Text Available In this study, based on the consideration of energy consumption, we take to improve the strategy of the MapReduce job scheduling algorithm, in order to reduce the average response time for task scheduling of interactive jobs in the network. In accordance with the job priority grouping to adjust the scheduling task response time which can reduce the impact of network congestion, with good results that increase the throughput of the system transferring data and computing power.

  8. Donating Blood

    Science.gov (United States)

    ... can't get an infection or disease from giving blood. The needles and other equipment used are sterile ... part of blood (plasma) within 72 hours after giving blood. It generally takes about 4–8 weeks to ...

  9. Donating Blood

    Science.gov (United States)

    ... Can Get Weight Loss Surgery? Choosing the Right Sport for You Shyness Donating ... Red Cross, there's a 97% chance that someone you know will need a blood transfusion. Blood donors — especially donors with certain blood types — are always ...

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

    Directory of Open Access Journals (Sweden)

    C. Yaashuwanth

    2010-01-01

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

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

  12. Dosing Schedules for Pneumococcal Conjugate Vaccine

    Science.gov (United States)

    2014-01-01

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

  13. New Downlink Scheduling Framework for Hybrid Unicast and Multicast Traffic in WiMAX Networks

    Directory of Open Access Journals (Sweden)

    Rashid Karimi

    2012-10-01

    Full Text Available WiMAX networks based on IEEE 802.16 standard has expedited broadband wireless access surge in recent years. The traffic in these networks is identified in four types of class of service with different QoS requirements. Therefore, scheduling mechanism to manage these services in order to meet QoS requirements is a crucial fact and an important challenge. In this paper, for PMP mode of WiMAX networks, a two-level scheduling mechanism in MAC layer of Base Station (BS has been proposed. The proposed scheduling algorithm takes into account hybrid unicast and multicast downlink traffic including three classes of service: rtps, nrtps and BE. In the first level of this scheduling mechanism, we have used the scheduling algorithms WRR and FCFS to schedule the connections and in its second level, the PQ algorithm based on Aging method is used to manage and schedule the packets. The functionality of the proposed scheduling algorithm is compared with priority queuing (PQ algorithm. The resulting outcome of simulation shows that the proposed design has quite a better performance for Best Effort (BE service class. Furthermore the delay of the rtps class and total throughput of the network is increased noticeably

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

    KAUST Repository

    Ammar, Zafar

    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.

  15. Idaho National Engineering Laboratory Environmental Restoration Program Schedule Contingency Evaluation Report

    Energy Technology Data Exchange (ETDEWEB)

    1993-09-01

    This report represents the schedule contingency evaluation done on the FY-93 Major System Acquisition (MSA) Baseline for the Idaho National Engineering Laboratory`s (INEL) Environmental Restoration Program (EPP). A Schedule Contingency Evaluation Team (SCET) was established to evaluate schedule contingency on the MSA Baseline for the INEL ERP associated with completing work within milestones established in the baseline. Baseline schedules had been established considering enforceable deadlines contained in the Federal Facilities Agreement/Consent Order (FFA/CO), the agreement signed in 1992, by the State of Idaho, Department of Health & Welfare, the U.S. Environmental Protection Agency, Region 10, and the U.S. Department of Energy, Idaho Operations Office. The evaluation was based upon the application of standard schedule risk management techniques to the specific problems of the INEL ERP. The schedule contingency evaluation was designed to provided early visibility for potential schedule delays impacting enforceable deadlines. The focus of the analysis was on the duration of time needed to accomplish all required activities to achieve completion of the milestones in the baseline corresponding to the enforceable deadlines. Additionally, the analysis was designed to identify control of high-probability, high-impact schedule risk factors.

  16. Throughput versus Fairness: Channel-Aware Scheduling in Multiple Antenna Downlink

    Directory of Open Access Journals (Sweden)

    Sezgin Aydin

    2009-01-01

    Full Text Available Abstract Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. Alternatively, each user could be served equally in order to maximize fairness. Obviously, there is a tradeoff between average throughput and fairness in the system. In this paper, we study four representative schedulers, namely the maximum throughput scheduler (MTS, the proportional fair scheduler (PFS, the (relative opportunistic round robin scheduler (ORS, and the round robin scheduler (RRS for a space-time coded multiple antenna downlink system. The system applies TDMA based scheduling and exploits the multiple antennas in terms of spatial diversity. We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrical distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distribution.

  17. Throughput versus Fairness: Channel-Aware Scheduling in Multiple Antenna Downlink

    Directory of Open Access Journals (Sweden)

    2009-03-01

    Full Text Available Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. Alternatively, each user could be served equally in order to maximize fairness. Obviously, there is a tradeoff between average throughput and fairness in the system. In this paper, we study four representative schedulers, namely the maximum throughput scheduler (MTS, the proportional fair scheduler (PFS, the (relative opportunistic round robin scheduler (ORS, and the round robin scheduler (RRS for a space-time coded multiple antenna downlink system. The system applies TDMA based scheduling and exploits the multiple antennas in terms of spatial diversity. We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrical distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distribution.

  18. Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

    Institute of Scientific and Technical Information of China (English)

    WANG Xibo; ZHOU Benhai; YU Ge; LI Qian

    2007-01-01

    μC/OS- Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling,an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block (TCB) is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten.Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS- Ⅱ.

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

  20. 75 FR 66195 - Schedules of Controlled Substances: Placement of Propofol Into Schedule IV

    Science.gov (United States)

    2010-10-27

    ... Propofol Into Schedule IV; Proposed Rule #0;#0;Federal Register / Vol. 75, No. 207 / Wednesday, October 27... Schedules of Controlled Substances: Placement of Propofol Into Schedule IV AGENCY: Drug Enforcement... propofol, including its salts, isomers, and salts of isomers whenever the existence of such salts, isomers...

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

  2. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

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

  3. 10 CFR 51.15 - Time schedules.

    Science.gov (United States)

    2010-01-01

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

  4. Robust scheduling in an uncertain environment

    NARCIS (Netherlands)

    Wilson, M.

    2016-01-01

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

  5. Crew Scheduling for Netherlands Railways: "destination: customer"

    NARCIS (Netherlands)

    L.G. Kroon (Leo); M. Fischetti (Matteo)

    2000-01-01

    textabstract: In this paper we describe the use of a set covering model with additional constraints for scheduling train drivers and conductors for the Dutch railway operator NS Reizigers. The schedules were generated according to new rules originating from the project "Destination: Customer"

  6. On green routing and scheduling problem

    CERN Document Server

    Touati, Nora

    2012-01-01

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

  7. On green routing and scheduling problem

    OpenAIRE

    Touati, Nora; Jost, Vincent

    2011-01-01

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

  8. 5 CFR 293.511 - Retention schedule.

    Science.gov (United States)

    2010-01-01

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

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

  10. Downlink Scheduling in Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Anwar Hossain

    2015-06-01

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

  11. Scheduling in high performance buffered crossbar switches

    NARCIS (Netherlands)

    Mhamdi, L.

    2007-01-01

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

  12. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

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

    1998-01-01

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

  13. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

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

    1998-01-01

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

  14. Schedule-extended synchronous dataflow graphs

    NARCIS (Netherlands)

    Damavandpeyma, M.; Stuijk, S.; Basten, T.; Geilen, M.; Corporaal, H.

    2013-01-01

    Synchronous dataflow graphs (SDFGs) are used extensively to model streaming applications. An SDFG can be extended with scheduling decisions, allowing SDFG analysis to obtain properties, such as throughput or buffer sizes for the scheduled graphs. Analysis times depend strongly on the size of the

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

  16. A question of matching rather than scheduling

    NARCIS (Netherlands)

    van de Velde, S.L.

    1995-01-01

    Proper scheduling maintenance for Air Force C-130 aircraft involves the prevention of mismatches concerning the availability of the aircraft and a new wing kit which would prolong its use. Scheduling maintenance problems include the designation of wing kits in the production sequence to match for a

  17. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc

    2016-01-01

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

  18. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen

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

  19. Machine scheduling with resource dependent processing times

    NARCIS (Netherlands)

    Grigoriev, A.; Sviridenko, M.; Uetz, Marc Jochen

    We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. workers. A given amount of that

  20. Dishabituation Produces Interactions during Multiple Schedules

    Science.gov (United States)

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

    2004-01-01

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

  1. Scheduling identical jobs on uniform parallel machines

    NARCIS (Netherlands)

    M. Dessouky (Mohamed); B. Lageweg (Ben); J.K. Lenstra; S.L. van de Velde (Steef)

    1990-01-01

    textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job completion times. It is well known that this can be formulated as a linear assignment problem, and subsequently solved in O(n3) time. We

  2. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

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

    2006-01-01

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

  3. NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    XIE Zhiqiang; YE Guangjie; ZHANG Dali; TAN Guangyu

    2008-01-01

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

  4. Shaping Academic Task Engagement with Percentile Schedules

    Science.gov (United States)

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

    2007-01-01

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

  5. 40 CFR 716.60 - Reporting schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Reporting schedule. 716.60 Section 716.60 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) TOXIC SUBSTANCES CONTROL ACT HEALTH AND SAFETY DATA REPORTING General Provisions § 716.60 Reporting schedule. (a) General requirements...

  6. State Teacher Salary Schedules. Policy Analysis

    Science.gov (United States)

    Griffith, Michael

    2016-01-01

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

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

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

  9. DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA

    Institute of Scientific and Technical Information of China (English)

    Xu Gang; Wu Zhiming

    2003-01-01

    An efficient algorithm for finding an optimal deadlock-free schedule in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using an example.

  10. An Integer Linear Programming Model for the Radiotherapy Treatment Scheduling Problem

    CERN Document Server

    Burke, Edmund K; Petrovic, Sanja

    2011-01-01

    Radiotherapy represents an important phase of treatment for a large number of cancer patients. It is essential that resources used to deliver this treatment are employed effectively. This paper presents a new integer linear programming model for real-world radiotherapy treatment scheduling and analyses the effectiveness of using this model on a daily basis in a hospital. Experiments are conducted varying the days on which schedules can be created. Results obtained using real-world data from the Nottingham University Hospitals NHS Trust, UK, are presented and show how the proposed model can be used with different policies in order to achieve good quality schedules.

  11. Garbage Collection Scheduling of Aperiodic Tasks

    Institute of Scientific and Technical Information of China (English)

    Ning Zhang; Guang-Ze Xiong

    2009-01-01

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

  12. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

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

    2015-12-01

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

  13. Dynamic Scheduling of Flexible Job Shops

    Institute of Scientific and Technical Information of China (English)

    SHAHID Ikramullah Butt; SUN Hou-fang

    2007-01-01

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

  14. Scheduler Vulnerabilities and Attacks in Cloud Computing

    CERN Document Server

    Zhou, Fangfei; Desnoyers, Peter; Sundaram, Ravi

    2011-01-01

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

  15. ISAPS: Intelligent Scheduling And Planning System

    Energy Technology Data Exchange (ETDEWEB)

    King, M.S.; Rutherford, W.C.; Grice, J.V. (Allied-Signal Aerospace Co., Kansas City, MO (USA). Kansas City Div.); Kessel, K.L.; Orel, M. (Intellicorp, Mountain View, CA (USA))

    1990-08-01

    ISAPS is a scheduling and planning tool for shop floor personnel working in a Flexible Manufacturing System (FMS) environment. The ISAP system has two integrated components: the Predictive Scheduler (PS) and the Reactive Scheduler (RS). These components work cooperatively to satisfy the four goals of the ISAP system, which are: (G1) meet production due dates, (G2) maximize machining center utilization, (G3) minimize cutting tool migration, and (G4) minimize product flow time. The PS is used to establish schedules for new production requirements. The RS is used to adjust the schedules produced by the PS for unforeseen events that occur during production operations. The PS and RS subsystems have been developed using IntelliCorp's Knowledge Engineering Environment (KEE), an expert system development shell, and Common LISP. Software Quality Assurance (SQA) techniques have been incorporated throughout the development effort to assure the ISAP system meets the manufacturing goals and end user requirements. 5 refs., 4 figs.

  16. Approximation algorithm for multiprocessor parallel job scheduling

    Institute of Scientific and Technical Information of China (English)

    陈松乔; 黄金贵; 陈建二

    2002-01-01

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

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

  18. 21 CFR 1305.27 - Preservation of electronic orders.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Preservation of electronic orders. 1305.27 Section 1305.27 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE ORDERS FOR SCHEDULE I AND II CONTROLLED SUBSTANCES Electronic Orders § 1305.27 Preservation of electronic orders. (a)...

  19. 77 FR 73674 - Ammonium Nitrate From Ukraine; Notice of Revised Schedule of the Five-year Review Concerning the...

    Science.gov (United States)

    2012-12-11

    ...)] Ammonium Nitrate From Ukraine; Notice of Revised Schedule of the Five-year Review Concerning the Antidumping Duty Order on Ammonium Nitrate From Ukraine AGENCY: United States International Trade Commission... established a schedule for the conduct of the 5-year review of Ammonium Nitrate from Ukraine (77 FR...

  20. 76 FR 18622 - Notice of Submission Deadline for Schedule Information for O'Hare International Airport, John F...

    Science.gov (United States)

    2011-04-04

    ... Airport (ORD), New York's John F. Kennedy International Airport (JFK), and Newark Liberty International... INFORMATION: The FAA has designated ORD as an IATA Level 2, Schedules Facilitated Airport, and JFK and EWR as Level 3, Coordinated Airports. Scheduled operations at JFK and EWR are limited by the FAA ] Orders,...

  1. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  2. PREVENTIVE MEASURES FOR THE IMPROVEMENT OF THE SAFETY OF BLOOD TRANSFUSION AND VIRTUAL TRANSFUSION LABORATORY

    Directory of Open Access Journals (Sweden)

    Primož Rožman

    2002-04-01

    Full Text Available Background. Even though blood transfusion is a relatively safe form of therapy, because of the eventual administrative errors in the transfusion chain between the blood donor and the recipient of blood, transfusion errors still occur. Therefore, it is imperative to ensure an utmost extent of safety and reliability of all transfusion related procedures. The safety of blood transfusion can be improved by preventive actions, i.e. implementation of the total quality management concept, haemovigilance and virtual transfusion laboratory. In the resulting system, the information web, robotics, computer sciences and communication technologies ensure safe and reliable identification of the patients, blood donors, corresponding test samples and blood products. Apart form this; the modern technologies enable the automation of laboratory testing, the integrity of laboratory results and enable an optimal use of blood.Conclusions. For an improved transfusion safety in Slovenia, adoption of corresponding prevention as well as haemovigilance is necessary. Identification errors can be prevented by implementation of the wristbands systems with the code bars for the tagging of the patient and his biological samples, whereas the administrative errors in the blood bank and transfusion laboratory can be prevented by implementation of information systems and automation.We assume that the virtual transfusion laboratory will become an integral part of the new Slovenian transfusion web and will speed up, unify and simplify today’s methods of ordering and administering blood products. To the attending physician, it will enable the choice of optimal transfusion therapy schedule and at the same time, it will enable the supervision of individual orders, deviations and indications, all of which is needed in order to analyse and improve the quality and the costs of the treatment. These services represent the first obligatory step for the modernisation of the transfusion

  3. A Hierarchical Algorithm for Integrated Scheduling and Control With Applications to Power Systems

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Dinesen, Peter Juhler; Jørgensen, John Bagterp

    2016-01-01

    The contribution of this paper is a hierarchical algorithm for integrated scheduling and control via model predictive control of hybrid systems. The controlled system is a linear system composed of continuous control, state, and output variables. Binary variables occur as scheduling decisions...... portfolio case study show that the hierarchical algorithm reduces the computation to solve the OCP by several orders of magnitude. The improvement in computation time is achieved without a significant increase in the overall cost of operation....

  4. Dynamic Production Scheduling in Computer-Aided Fabrication of Integrated Circuits,

    Science.gov (United States)

    1986-01-01

    research. or -I’d - - Most researchfinvolves performing operations on silicon wafes. grup o waersthat is processed together is calleda 12t. The...scheduling requires a numerical objective function L. One possible objective is the minimization of the average expec- ted time between the arrival of an order...middle level of the scheduler has two functions : first, it responds to random events such as machine failures. When a machine goes down, it adjusts

  5. Advertisement Scheduling in Television Channels: An Application of Mixed Integer Programming

    OpenAIRE

    ULUCAN, Aydın; Ülker, Onur

    2005-01-01

    In recent years, the increment in the number of TV channels, increased the digital broadcasting and wired homes. Developing of convalescence, television advertising has become much more important, commercial companies allocate their advertisement budgets on TV ads. TV channels need professional advertisement scheduling techniques in order to increase spot sales profitability and productivities. As per date, many methods have been evaluated in spot scheduling. The most important ones are, ‘int...

  6. Data-oriented scheduling for PROOF

    Science.gov (United States)

    Xu, Neng; Guan, Wen; Wu, Sau Lan; Ganis, Gerardo

    2011-12-01

    The Parallel ROOT Facility - PROOF - is a distributed analysis system optimized for I/O intensive analysis tasks of HEP data. With LHC entering the analysis phase, PROOF has become a natural ingredient for computing farms at Tier3 level. These analysis facilities will typically be used by a few tenths of users, and can also be federated into a sort of analysis cloud corresponding to the Virtual Organization of the experiment. Proper scheduling is required to guarantee fair resource usage, to enforce priority policies and to optimize the throughput. In this paper we discuss an advanced priority system that we are developing for PROOF. The system has been designed to automatically adapt to unknown length of the tasks, to take into account the data location and availability (including distribution across geographically separated sites), and the {group, user} default priorities. In this system, every element - user, group, dataset, job slot and storage - gets its priority and those priorities are dynamically linked with each other. In order to tune the interplay between the various components, we have designed and started implementing a simulation application that can model various type and size of PROOF clusters. In this application a monitoring package records all the changes of them so that we can easily understand and tune the performance. We will discuss the status of our simulation and show examples of the results we are expecting from it.

  7. Notes on Bit-reversal Broadcast Scheduling

    CERN Document Server

    Kik, Marcin

    2012-01-01

    This report contains revision and extension of some results about RBO [arXiv:1108.5095]. RBO is a simple and efficient broadcast scheduling of $n = 2^k$ uniform frames for battery powered radio receivers. Each frame contains a key from some arbitrary linearly ordered universe. The broadcast cycle -- a sequence of frames sorted by the keys and permuted by $k$-bit reversal -- is transmitted in a round robin fashion by the broadcaster. At arbitrary time during the transmission, the receiver may start a simple protocol that reports to him all the frames with the keys that are contained in a specified interval of the key values $[K', K"]$. RBO receives at most $2 k + 1$ other frames' keys before receiving the first key from $[K', K"]$ or noticing that there are no such keys in the broadcast cycle. As a simple corollary, $4 k + 2$ is upper bound the number of keys outside $[K', K"]$ that will ever be received. In unreliable network the expected number of efforts to receive such frames is bounded by $(8 k + 4) / p +...

  8. Performance analysis of active schedules in identical parallel machine

    Institute of Scientific and Technical Information of China (English)

    Changjun WANG; Yugeng XI

    2007-01-01

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

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

  10. Production Scheduling for the Furnace - Casting Line System

    Directory of Open Access Journals (Sweden)

    A. Stawowy

    2013-07-01

    Full Text Available The problem considered in the paper is motivated by production planning in a foundry equipped with the furnace and casting line, which provides a variety of castings in various grades of cast iron/steel for a large number of customers. The quantity of molten metal does not exceed the capacity of the furnace, the load is a particular type of metal from which the products are made in the automatic casting lines. The goal is to create the order of the melted metal loads to prevent delays in delivery of goods to customers. This problem is generally considered as a lot-sizing and scheduling problem. The paper describes two computational intelligence algorithms for simultaneous grouping and scheduling tasks and presents the results achieved by these algorithms for example test problems.

  11. Task scheduling based on ant colony optimization in cloud environment

    Science.gov (United States)

    Guo, Qiang

    2017-04-01

    In order to optimize the task scheduling strategy in cloud environment, we propose a cloud computing task scheduling algorithm based on ant colony algorithm. The main goal of this algorithm is to minimize the makespan and the total cost of the tasks, while making the system load more balanced. In this paper, we establish the objective function of the makespan and costs of the tasks, define the load balance function. Meanwhile, we also improve the initialization of the pheromone, the heuristic function and the pheromone update method in the ant colony algorithm. Then, some experiments were carried out on the Cloudsim platform, and the results were compared with algorithms of ACO and Min-Min. The results shows that the algorithm is more efficient than the other two algorithms in makespan, costs and system load balancing.

  12. Automated problem scheduling and reduction of synchronization delay effects

    Science.gov (United States)

    Saltz, Joel H.

    1987-01-01

    It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs.

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

  14. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

    CERN Document Server

    Chrobak, Marek; Hurand, Mathilde; Robert, Julien

    2008-01-01

    We study scheduling problems motivated by recently developed techniques for microprocessor thermal management at the operating systems level. The general scenario can be described as follows. The microprocessor's temperature is controlled by the hardware thermal management system that continuously monitors the chip temperature and automatically reduces the processor's speed as soon as the thermal threshold is exceeded. Some tasks are more CPU-intensive than other and thus generate more heat during execution. The cooling system operates non-stop, reducing (at an exponential rate) the deviation of the processor's temperature from the ambient temperature. As a result, the processor's temperature, and thus the performance as well, depends on the order of the task execution. Given a variety of possible underlying architectures, models for cooling and for hardware thermal management, as well as types of tasks, this scenario gives rise to a plethora of interesting and never studied scheduling problems. We focus on s...

  15. A Metaheuristic Algorithm for Job Scheduling in Grid Computing

    Directory of Open Access Journals (Sweden)

    Hedieh Sajedi

    2014-05-01

    Full Text Available These days the number of issues that we can not do on time is increasing. In the mean time, scientists are trying to make questions simpler and using computers. Still, more problems that are complicated need more complex calculations by using highly advanced technology. Grid computing integrates distributed resources to solve complex scientific, industrial, and commercial problems. In order to achieve this goal, an efficient scheduling system as a vital part of the grid is required. In this paper, we introduce CUckoo-Genetic Algorithm (CUGA, which inspired from cuckoo optimization algorithm (COA with genetic algorithm (GA for job scheduling in grids. CUGA can be applied to minimize the completion time of machines, and it could avoid trapping in a local minimum effectively. The results illustrate that the proposed algorithm, in comparison with GA, COA, and Particle Swarm Optimization (PSO is more efficient and provides higher performance.

  16. Striping and Scheduling for Large Scale Multimedia Servers

    Institute of Scientific and Technical Information of China (English)

    Kyung-Oh Lee; Jun-Ho Park; Yoon-Young Park

    2004-01-01

    When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes.

  17. Organizing of Virtual Enterprise for Customized Artificial Joint and Scheduling of Manufacturing Resources Based on Manufacturing Grid

    Institute of Scientific and Technical Information of China (English)

    DENG Hong; CHEN Li; WANG Cheng-tao; DENG Qian-qi

    2005-01-01

    In order to improve efficiency of developing customized artificial joint, a virtual enterprise is organized based on the manufacturing grid. The application-oriented framework of the virtual enterprise is created for organization of the virtual enterprise. The manufacturing system of the virtual enterprise is built up based on the exterior grid and manufacturing subsystems of member enterprises are set up based on the interior grid. Furthermore, according to characteristic matching of manufacturing resources, the scheduling flow is studied in detail and the related scheduling strategies are established. The scheduling procedure is divided into distributed scheduling stage and local scheduling stage.Based on the manufacturing grid, the organization of the virtual enterprise for customized artificial joint and the corresponding scheduling strategies can be utilized to shorten developing cycle and reduce produce cost.

  18. Opinions of the Construction Schedule Control%基于建筑施工进度控制之见解

    Institute of Scientific and Technical Information of China (English)

    陈建文; 俞海峰

    2013-01-01

      建筑工程具有量大、复杂、周期长等特点,这就决定了施工进度要受诸多因素的影响。要想有效控制施工进度,就必须全面分析影响施工进度的因素,确定合理的进度控制目标,编制可行的进度计划。%The construction project has the characteristics like large quantity, complex, long period and so on, which determi-ne the schedule of construction would be influenced by many factors. In order to effectively control the construction schedul-e, it must have a comprehensive analysis of the factors affecti-ng the construction schedule, to determine the reasonable sche-dule control target, making feasible schedule.

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

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

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

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

  3. Use of Data Mining in Scheduler Optimization

    CERN Document Server

    Anderson, George; Nelwamondo, Fulufhelo V

    2010-01-01

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

  4. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

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

  5. 基于序优化的原油调合调度问题中掺炼序列评价的分布研究%Simulation study on probability distribution of sequence evaluation in order-based crude oil blending scheduling problem

    Institute of Scientific and Technical Information of China (English)

    摆亮; 江永亨; 黄德先

    2012-01-01

    对于加工多种原油的炼油厂,原油调合调度可以改善进料原油性质,它对保证后续生产装置的平稳操作、先进控制的实施以及生产计划的完成具有重要意义.基于实际生产背景和需求,文献[4-5]提出了原油调合调度模型以及基于2层优化结构和序优化的求解方案.该方案中,原油掺炼序列和流量的混合优化问题转化为掺炼序列的采样和评价问题,它们分别涉及到算法的广度搜索和深度搜索,如何处理二者之间的平衡关系对于合理利用计算量并进一步提高算法效率具有重要意义.因此,作为衡量搜索深度和搜索广度的基础,本文对掺炼序列评价的分布规律进行了研究.在首先分析比较了仿真优化中参数评价与原油调合调度优化中序列评价的异同之后,本文通过蒙特卡洛仿真法统计分析了原油掺炼序列评价的分布变化规律,并利用威布尔分布对其进行了拟合.文章最后展示了基于威布尔分布描述的2个掺炼序列的评价比较,同时指出威布尔分布的参数拟合问题是接下来研究的重点.%Crude oil blending and scheduling can help refineries improve the feedstock property, which is important to the smooth operation of oil refining unit, implementation of advanced control and fulfillment of production plan. Under the actual production background, a multi-pipeline crude oil blending and scheduling model is established and a novel solution methodology based on a two-level optimization structure and ordinal optimization is proposed correspondingly Ref.[4-5]. In this solution methodology, a blending sequence and flowrate hybrid optimization problem changes into a blending sequence's sampling and evaluation problem, which relates to the breadth and depth of search in algorithm, respectively. How to deal with the balance between them is important to rationally allocate the computation and further improve the optimization efficiency

  6. Blood glucose concentration in pediatric outpatient surgery.

    Science.gov (United States)

    Somboonviboon, W; Kijmahatrakul, W

    1996-04-01

    Blood glucose concentration was measured in 84 pediatric patients who were scheduled for outpatient surgery at Chulalongkorn Hospital. They were allocated into 3 groups according to their ages, group 1:less than 1 year of age, group 2:1 to 5 years of age and group 3:over 5 years. The fasting times were approximately 8-12 hours. All patients received standard general anesthesia under mask. No glucose solution was given during operation. Preoperative mean blood glucose were 91.09 +/- 17.34, 89.55 +/- 18.69 and 82.14 +/- 16.14 mg/dl in group 1, 2 and 3 while the postoperative mean glucose values were 129.07 +/- 37.90, 115.62 +/- 29.63 and 111.53 +/- 23.07 mg/dl respectively. The difference between pre- and post-operative values were statistically significant difference (P postoperative glucose values may be due to stress response from surgery and anesthesia. We would suggest that the parents give the fluid to their children according to our instructions in order to prevent dehydration and hypoglycemia especially in small infants.

  7. Artificial blood

    Directory of Open Access Journals (Sweden)

    Sarkar Suman

    2008-01-01

    Full Text Available Artificial blood is a product made to act as a substitute for red blood cells. While true blood serves many different functions, artificial blood is designed for the sole purpose of transporting oxygen and carbon dioxide throughout the body. Depending on the type of artificial blood, it can be produced in different ways using synthetic production, chemical isolation, or recombinant biochemical technology. Development of the first blood substitutes dates back to the early 1600s, and the search for the ideal blood substitute continues. Various manufacturers have products in clinical trials; however, no truly safe and effective artificial blood product is currently marketed. It is anticipated that when an artificial blood product is available, it will have annual sales of over $7.6 billion in the United States alone.

  8. Artificial blood.

    Science.gov (United States)

    Sarkar, Suman

    2008-07-01

    Artificial blood is a product made to act as a substitute for red blood cells. While true blood serves many different functions, artificial blood is designed for the sole purpose of transporting oxygen and carbon dioxide throughout the body. Depending on the type of artificial blood, it can be produced in different ways using synthetic production, chemical isolation, or recombinant biochemical technology. Development of the first blood substitutes dates back to the early 1600s, and the search for the ideal blood substitute continues. Various manufacturers have products in clinical trials; however, no truly safe and effective artificial blood product is currently marketed. It is anticipated that when an artificial blood product is available, it will have annual sales of over $7.6 billion in the United States alone.

  9. New schedulability analysis for WiDom

    OpenAIRE

    Vahabi, Maryam; Andersson, Björn

    2010-01-01

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

  10. Concurrent Scheduling of Event-B Models

    CERN Document Server

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

    2011-01-01

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

  11. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

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

  12. Proposed Schedule for Fenton Hill Experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1990-10-22

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

  13. Multiprocessor Scheduling Using Parallel Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nourah Al-Angari

    2012-07-01

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

  14. Schedule Uncertainty Control: A Literature Review

    Science.gov (United States)

    Jun-yan, Liu

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

  15. NEWS OF THE NATIONAL IMMUNIZATION SCHEDULE

    Directory of Open Access Journals (Sweden)

    O. V. Shamsheva

    2014-01-01

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

  16. Predictive Modeling of Massive Transfusion Requirements During Liver Transplantation and Its Potential to Reduce Utilization of Blood Bank Resources.

    Science.gov (United States)

    Pustavoitau, Aliaksei; Lesley, Maggie; Ariyo, Promise; Latif, Asad; Villamayor, April J; Frank, Steven M; Rizkalla, Nicole; Merritt, William; Cameron, Andrew; Dagher, Nabil; Philosophe, Benjamin; Gurakar, Ahmet; Gottschalk, Allan

    2017-05-01

    Patients undergoing liver transplantation frequently but inconsistently require massive blood transfusion. The ability to predict massive transfusion (MT) could reduce the impact on blood bank resources through customization of the blood order schedule. Current predictive models of MT for blood product utilization during liver transplantation are not generally applicable to individual institutions owing to variability in patient population, intraoperative management, and definitions of MT. Moreover, existing models may be limited by not incorporating cirrhosis stage or thromboelastography (TEG) parameters. This retrospective cohort study included all patients who underwent deceased-donor liver transplantation at the Johns Hopkins Hospital between 2010 and 2014. We defined MT as intraoperative transfusion of > 10 units of packed red blood cells (pRBCs) and developed a multivariable predictive model of MT that incorporated cirrhosis stage and TEG parameters. The accuracy of the model was assessed with the goodness-of-fit test, receiver operating characteristic analysis, and bootstrap resampling. The distribution of correct patient classification was then determined as we varied the model threshold for classifying MT. Finally, the potential impact of these predictions on blood bank resources was examined. Two hundred three patients were included in the study. Sixty (29.6%) patients met the definition for MT and received a median (interquartile range) of 19.0 (14.0-27.0) pRBC units intraoperatively compared with 4.0 units (1.0-6.0) for those who did not satisfy the criterion for MT. The multivariable model for predicting MT included Model for End-stage Liver Disease score, whether simultaneous liver and kidney transplant was performed, cirrhosis stage, hemoglobin concentration, platelet concentration, and TEG R interval and angle. This model demonstrated good calibration (Hosmer-Lemeshow goodness-of-fit test P = .45) and good discrimination (c statistic: 0.835; 95

  17. Recent reinforcement-schedule research and applied behavior analysis

    OpenAIRE

    Lattal, Kennon A; Neef, Nancy A

    1996-01-01

    Reinforcement schedules are considered in relation to applied behavior analysis by examining several recent laboratory experiments with humans and other animals. The experiments are drawn from three areas of contemporary schedule research: behavioral history effects on schedule performance, the role of instructions in schedule performance of humans, and dynamic schedules of reinforcement. All of the experiments are discussed in relation to the role of behavioral history in current schedule pe...

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

  19. Predictive / Reactive Planning and Scheduling of a Surgical Suite with Emergency Patient Arrival.

    Science.gov (United States)

    Heydari, Mehdi; Soudi, Asie

    2016-01-01

    This paper surveys the problem of predictive / reactive scheduling of an integrated operating theatre with two types of demand for surgery: 1) elective or known demand; 2) emergency or uncertain demand. The stochastic arrival of emergency patients with uncertain surgery time enforces the scheduler to react to disruption and modify scheduling plan of elective patients. We focus on this predictive / reactive scheduling problem which has not been investigated in such way before. As in hospitals, at the time of occurrence a disruption in a surgical suite, the scheduler has not enough time to make the best decision; we propose a new approach based on two-stage stochastic programming model with recourse which determines the best recourse strategy in advance of any disruption occurrence. Using the proposed approach, the primary schedule is generated in such a way that it can absorb disruption with minimum effect on planned elective surgeries. For the first time in operating theatre planning, two new significant sets of performance measures comprising "robustness" and "stability" measures are considered in generation of primary schedule which will be shown to be of great importance in efficiency of surgical suite planning. Computational experiments performed on sets of generated problem based on the data obtained from a non-profit hospital. In order to demonstrate efficiency of the proposed method, computational results of the proposed approach are compared with classic approach.

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

    Directory of Open Access Journals (Sweden)

    Piyush Chauhan

    2013-01-01

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