Cesium heat-pipe thermostat

Energy Technology Data Exchange (ETDEWEB)

Wu, F.; Song, D.; Sheng, K.; Wu, J. [Changcheng Institute of Metrology and Measurement, 100095, Beijing (China); Yi, X. [China National South Aviation industry CO., LTD., 412002, Hunan (China); Yu, Z. [Dalian Jinzhou Institute of Measurement and Testing, 116100, Liaoning (China)

2013-09-11

In this paper the authors report a newly developed Cesium Heat-Pipe Thermostat (Cs HPT) with the operation range of 400 °C to 800 °C. The working medium is cesium (Cs) of 99.98% purity and contains no radioisotope. A Cs filing device is developed which can prevent Cs being in contact with air. The structural material is stainless steel. A 5000 h test has been made to confirm the compatibility between cesium and stainless steel. The Cs HPT has several thermometer wells of 220mm depth with different diameters for different sizes of thermometers. The temperature uniformity of the Cs HPT is 0.06 °C to 0.20 °C. A precise temperature controller is used to ensure the temperature fluctuation within ±0.03 °C. The size of Cs HPT is 380mm×320mm×280mm with foot wheels for easy moving. The thermostat has been successfully used for the calibration of industrial platinum resistance thermometers and thermocouples.

Deterministic time-reversible thermostats: chaos, ergodicity, and the zeroth law of thermodynamics

Science.gov (United States)

Patra, Puneet Kumar; Sprott, Julien Clinton; Hoover, William Graham; Griswold Hoover, Carol

2015-09-01

The relative stability and ergodicity of deterministic time-reversible thermostats, both singly and in coupled pairs, are assessed through their Lyapunov spectra. Five types of thermostat are coupled to one another through a single Hooke's-law harmonic spring. The resulting dynamics shows that three specific thermostat types, Hoover-Holian, Ju-Bulgac, and Martyna-Klein-Tuckerman, have very similar Lyapunov spectra in their equilibrium four-dimensional phase spaces and when coupled in equilibrium or nonequilibrium pairs. All three of these oscillator-based thermostats are shown to be ergodic, with smooth analytic Gaussian distributions in their extended phase spaces (coordinate, momentum, and two control variables). Evidently these three ergodic and time-reversible thermostat types are particularly useful as statistical-mechanical thermometers and thermostats. Each of them generates Gibbs' universal canonical distribution internally as well as for systems to which they are coupled. Thus they obey the zeroth law of thermodynamics, as a good heat bath should. They also provide dissipative heat flow with relatively small nonlinearity when two or more such temperature baths interact and provide useful deterministic replacements for the stochastic Langevin equation.

Learning Agent for a Heat-Pump Thermostat with a Set-Back Strategy Using Model-Free Reinforcement Learning

Directory of Open Access Journals (Sweden)

Frederik Ruelens

2015-08-01

Full Text Available The conventional control paradigm for a heat pump with a less efficient auxiliary heating element is to keep its temperature set point constant during the day. This constant temperature set point ensures that the heat pump operates in its more efficient heat-pump mode and minimizes the risk of activating the less efficient auxiliary heating element. As an alternative to a constant set-point strategy, this paper proposes a learning agent for a thermostat with a set-back strategy. This set-back strategy relaxes the set-point temperature during convenient moments, e.g., when the occupants are not at home. Finding an optimal set-back strategy requires solving a sequential decision-making process under uncertainty, which presents two challenges. The first challenge is that for most residential buildings, a description of the thermal characteristics of the building is unavailable and challenging to obtain. The second challenge is that the relevant information on the state, i.e., the building envelope, cannot be measured by the learning agent. In order to overcome these two challenges, our paper proposes an auto-encoder coupled with a batch reinforcement learning technique. The proposed approach is validated for two building types with different thermal characteristics for heating in the winter and cooling in the summer. The simulation results indicate that the proposed learning agent can reduce the energy consumption by 4%–9% during 100 winter days and by 9%–11% during 80 summer days compared to the conventional constant set-point strategy.

Case mix classification and a benchmark set for surgery scheduling

NARCIS (Netherlands)

Leeftink, Gréanne; Hans, Erwin W.

Numerous benchmark sets exist for combinatorial optimization problems. However, in healthcare scheduling, only a few benchmark sets are known, mainly focused on nurse rostering. One of the most studied topics in the healthcare scheduling literature is surgery scheduling, for which there is no widely

Thermostatic Radiator Valve Evaluation

Energy Technology Data Exchange (ETDEWEB)

Dentz, Jordan [Advanced Residential Integrated Energy Solutions Collaborative, New York, NY (United States); Ansanelli, Eric [Advanced Residential Integrated Energy Solutions Collaborative, New York, NY (United States)

2015-01-01

A large stock of multifamily buildings in the Northeast and Midwest are heated by steam distribution systems. Losses from these systems are typically high and a significant number of apartments are overheated much of the time. Thermostatically controlled radiator valves (TRVs) are one potential strategy to combat this problem, but have not been widely accepted by the residential retrofit market.

Load management: Model-based control of aggregate power for populations of thermostatically controlled loads

International Nuclear Information System (INIS)

Perfumo, Cristian; Kofman, Ernesto; Braslavsky, Julio H.; Ward, John K.

2012-01-01

Highlights: ► Characterisation of power response of a population of air conditioners. ► Implementation of demand side management on a group of air conditioners. ► Design of a controller for the power output of a group of air conditioners. ► Quantification of comfort impact of demand side management. - Abstract: Large groups of electrical loads can be controlled as a single entity to reduce their aggregate power demand in the electricity network. This approach, known as load management (LM) or demand response, offers an alternative to the traditional paradigm in the electricity market, where matching supply and demand is achieved solely by regulating how much generation is dispatched. Thermostatically controlled loads (TCLs), such as air conditioners (ACs) and fridges, are particularly suitable for LM, which can be implemented using feedback control techniques to regulate their aggregate power. To achieve high performance, such feedback control techniques require an accurate mathematical model of the TCL aggregate dynamics. Although such models have been developed, they appear too complex to be effectively used in control design. In this paper we develop a mathematical model aimed at the design of a model-based feedback control strategy. The proposed model analytically characterises the aggregate power response of a population of ACs to a simultaneous step change in temperature set points. Based on this model, we then derive, and completely parametrise in terms of the ACs ensemble properties, a reduced-order mathematical model to design an internal-model controller that regulates aggregate power by broadcasting temperature set-point offset changes. The proposed controller achieves high LM performance provided the ACs are equipped with high resolution thermostats. With coarser resolution thermostats, which are typical in present commercial and residential ACs, performance deteriorates significantly. This limitation is overcome by subdividing the population

Alternative Work Schedules in Office and Nonoffice Work Settings.

Science.gov (United States)

Kirk, Raymond J.; Barton, H. David

A rapidly growing change in the workplace is the replacement of a fixed work schedule with a variety of alternative work schedules (AWS), including both flexible and compressed schedules. Experimenting organizations (N=901) evaluated one of four major categories of AWS in office and nonoffice settings, i.e., a flexible 8-hour day;…

Deterministic thermostats, theories of nonequilibrium systems and parallels with the ergodic condition

International Nuclear Information System (INIS)

Jepps, Owen G; Rondoni, Lamberto

2010-01-01

Deterministic 'thermostats' are mathematical tools used to model nonequilibrium steady states of fluids. The resulting dynamical systems correctly represent the transport properties of these fluids and are easily simulated on modern computers. More recently, the connection between such thermostats and entropy production has been exploited in the development of nonequilibrium fluid theories. The purpose and limitations of deterministic thermostats are discussed in the context of irreversible thermodynamics and the development of theories of nonequilibrium phenomena. We draw parallels between the development of such nonequilibrium theories and the development of notions of ergodicity in equilibrium theories. (topical review)

Large Scale Demand Response of Thermostatic Loads

DEFF Research Database (Denmark)

Totu, Luminita Cristiana

This study is concerned with large populations of residential thermostatic loads (e.g. refrigerators, air conditioning or heat pumps). The purpose is to gain control over the aggregate power consumption in order to provide balancing services for the electrical grid. Without affecting the temperat......This study is concerned with large populations of residential thermostatic loads (e.g. refrigerators, air conditioning or heat pumps). The purpose is to gain control over the aggregate power consumption in order to provide balancing services for the electrical grid. Without affecting....... The control architecture is defined by parsimonious communication requirements that also have a high level data privacy, and it furthermore guarantees a robust and secure local operation. Mathematical models are put forward, and the effectiveness is shown by numerical simulations. A case study of 10000...

A unified thermostat scheme for efficient configurational sampling for classical/quantum canonical ensembles via molecular dynamics

Science.gov (United States)

Zhang, Zhijun; Liu, Xinzijian; Chen, Zifei; Zheng, Haifeng; Yan, Kangyu; Liu, Jian

2017-07-01

We show a unified second-order scheme for constructing simple, robust, and accurate algorithms for typical thermostats for configurational sampling for the canonical ensemble. When Langevin dynamics is used, the scheme leads to the BAOAB algorithm that has been recently investigated. We show that the scheme is also useful for other types of thermostats, such as the Andersen thermostat and Nosé-Hoover chain, regardless of whether the thermostat is deterministic or stochastic. In addition to analytical analysis, two 1-dimensional models and three typical real molecular systems that range from the gas phase, clusters, to the condensed phase are used in numerical examples for demonstration. Accuracy may be increased by an order of magnitude for estimating coordinate-dependent properties in molecular dynamics (when the same time interval is used), irrespective of which type of thermostat is applied. The scheme is especially useful for path integral molecular dynamics because it consistently improves the efficiency for evaluating all thermodynamic properties for any type of thermostat.

Determination of the mechanical thermostat electrical contacts switching quality with sound and vibration analysis

Energy Technology Data Exchange (ETDEWEB)

Rejc, Jure; Munih, Marko [University of Ljubljana, Ljubljana (Slovenia)

2017-05-15

A mechanical thermostat is a device that switches heating or cooling appliances on or off based on temperature. For this kind of use, electronic or mechanical switching concepts are applied. During the production of electrical contacts, several irregularities can occur leading to improper switching events of the thermostat electrical contacts. This paper presents a non-obstructive method based on the fact that when the switching event occurs it can be heard and felt by human senses. We performed several laboratory tests with two different methods. The first method includes thermostat switch sound signal analysis during the switching event. The second method is based on sampling of the accelerometer signal during the switching event. The results show that the sound analysis approach has great potential. The approach enables an accurate determination of the switching event even if the sampled signal carries also the switching event of the neighbour thermostat.

Design and Implementation of Frequency-responsive Thermostat Control

DEFF Research Database (Denmark)

Nyeng, Preben; Østergaard, Jacob; Togeby, Mikael

2010-01-01

properties and needs of each application, and on the other hand the requirements of the system operator. The control algorithms are implemented on a microcontroller unit that is interfaced with existing thermostats for each application. To validate the control algorithms and overall system design, a series...

An Inductive Water Thermostat Using On‐Off Triac Control and Platinum Sensing

DEFF Research Database (Denmark)

Diamond, Joseph M.

1971-01-01

An on‐off thermostat is described using novel means for heating, sensing, and triac control. Heating is performed by sending the water through a coil of silver tubing which forms the short‐circuited secondary winding of a transformer. This arrangement permits extremely good insulation, which...... was essential in the medical application (a dialysis water thermostat) for which it was designed; its quick response also contributes to the excellent regulation achieved with simple on‐off control. Sensing is provided by a very low resistance platinum coil in direct contact with the water, thus providing quick...

A Microwave Thermostatic Reactor for Processing Liquid Materials Based on a Heat-Exchanger.

Science.gov (United States)

Zhou, Yongqiang; Zhang, Chun; Xie, Tian; Hong, Tao; Zhu, Huacheng; Yang, Yang; Liu, Changjun; Huang, Kama

2017-10-08

Microwaves have been widely used in the treatment of different materials. However, the existing adjustable power thermostatic reactors cannot be used to analyze materials characteristics under microwave effects. In this paper, a microwave thermostatic chemical reactor for processing liquid materials is proposed, by controlling the velocity of coolant based on PLC (programmable logic controller) in different liquid under different constant electric field intensity. A nonpolar coolant (Polydimethylsiloxane), which is completely microwave transparent, is employed to cool the liquid materials. Experiments are performed to measure the liquid temperature using optical fibers, the results show that the precision of temperature control is at the range of ±0.5 °C. Compared with the adjustable power thermostatic control system, the effect of electric field changes on material properties are avoided and it also can be used to detect the properties of liquid materials and special microwave effects.

Sensitivity of the optimal parameter settings for a LTE packet scheduler

NARCIS (Netherlands)

Fernandez-Diaz, I.; Litjens, R.; van den Berg, C.A.; Dimitrova, D.C.; Spaey, K.

Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we study the sensitivity of the optimal parameter setting for packet scheduling in LTE radio networks with respect to various

Time step MOTA thermostat simulation

International Nuclear Information System (INIS)

Guthrie, G.L.

1978-09-01

The report details the logic, program layout, and operating procedures for the time-step MOTA (Materials Open Test Assembly) thermostat simulation program known as GYRD. It will enable prospective users to understand the operation of the program, run it, and interpret the results. The time-step simulation analysis was the approach chosen to determine the maximum value gain that could be used to minimize steady temperature offset without risking undamped thermal oscillations. The advantage of the GYRD program is that it directly shows hunting, ringing phenomenon, and similar events. Programs BITT and CYLB are faster, but do not directly show ringing time

End users heat energy savings using thermostat regulation valves radiators, v. 16(64)

International Nuclear Information System (INIS)

Jakimovska, Emilija Misheva; Potsev, Eftim

2008-01-01

Billing the used heat energy offers the opportunity to motivate end users to use the heat energy rationally and to save the energy. Installing the thermostat valves on the radiators it is possible frequently to regulate the room temperature and to use the heat gains, obtaining comfortable climate in the apartments and saving the energy. Thermostat valves give the possibility to use the heat energy rationally and save the energy, and these way and users can regulate the heat energy consumption according to their own level of thermal comfort. (Author)

End users heat energy savings using thermostat regulation valves radiators, v. 16(63)

International Nuclear Information System (INIS)

Jakimovska, Emilija Misheva; Potsev, Eftim

2008-01-01

Billing the used heat energy offers the opportunity to motivate end users to use the heat energy rationally and to save the energy. Installing the thermostat valves on the radiators it is possible frequently to regulate the room temperature and to use the heat gains, obtaining comfortable climate in the apartments and saving the energy. Thermostat valves give the possibility to use the heat energy rationally and save the energy, and these way and users can regulate the heat energy consumption according to their own level of thermal comfort. (Author)

A thermostatted kinetic theory model for event-driven pedestrian dynamics

Science.gov (United States)

Bianca, Carlo; Mogno, Caterina

2018-06-01

This paper is devoted to the modeling of the pedestrian dynamics by means of the thermostatted kinetic theory. Specifically the microscopic interactions among pedestrians and an external force field are modeled for simulating the evacuation of pedestrians from a metro station. The fundamentals of the stochastic game theory and the thermostatted kinetic theory are coupled for the derivation of a specific mathematical model which depicts the time evolution of the distribution of pedestrians at different exits of a metro station. The perturbation theory is employed in order to establish the stability analysis of the nonequilibrium stationary states in the case of a metro station consisting of two exits. A general sensitivity analysis on the initial conditions, the magnitude of the external force field and the number of exits is presented by means of numerical simulations which, in particular, show how the asymptotic distribution and the convergence time are affected by the presence of an external force field. The results show how, in evacuation conditions, the interaction dynamics among pedestrians can be negligible with respect to the external force. The important role of the thermostat term in allowing the reaching of the nonequilibrium stationary state is stressed out. Research perspectives are underlined at the end of paper, in particular for what concerns the derivation of frameworks that take into account the definition of local external actions and the introduction of the space and velocity dynamics.

Integrating and scheduling an open set of static analyses

DEFF Research Database (Denmark)

Eichberg, Michael; Mezini, Mira; Kloppenburg, Sven

2006-01-01

to keep the set of analyses open. We propose an approach to integrating and scheduling an open set of static analyses which decouples the individual analyses and coordinates the analysis executions such that the overall time and space consumption is minimized. The approach has been implemented...... for the Eclipse IDE and has been used to integrate a wide range of analyses such as finding bug patterns, detecting violations of design guidelines, or type system extensions for Java....

Thermostatic Radiator Valve Evaluation

Energy Technology Data Exchange (ETDEWEB)

Dentz, J. [Advanced Residential Integrated Energy Solutions Collaborative (ARIES), New York, NY (United States); Ansanelli, E. [Advanced Residential Integrated Energy Solutions Collaborative (ARIES), New York, NY (United States)

2015-01-01

A large stock of multifamily buildings in the Northeast and Midwest are heated by steam distribution systems. Losses from these systems are typically high and a significant number of apartments are overheated much of the time. Thermostatically controlled radiator valves (TRVs) are one potential strategy to combat this problem, but have not been widely accepted by the residential retrofit market. In this project, the ARIES team sought to better understand the current usage of TRVs by key market players in steam and hot water heating and to conduct limited experiments on the effectiveness of new and old TRVs as a means of controlling space temperatures and reducing heating fuel consumption. The project included a survey of industry professionals, a field experiment comparing old and new TRVs, and cost-benefit modeling analysis using BEopt™ (Building Energy Optimization software).

Modeling Populations of Thermostatic Loads with Switching Rate Actuation

DEFF Research Database (Denmark)

Totu, Luminita Cristiana; Wisniewski, Rafal; Leth, John-Josef

2015-01-01

We model thermostatic devices using a stochastic hybrid description, and introduce an external actuation mechanism that creates random switch events in the discrete dynamics. We then conjecture the form of the Fokker-Planck equation and successfully verify it numerically using Monte Carlo...... simulations. The actuation mechanism and subsequent modeling result are relevant for power system operation....

Evaluating functions of positive-definite matrices using colored-noise thermostats

Science.gov (United States)

Nava, Marco; Ceriotti, Michele; Dryzun, Chaim; Parrinello, Michele

2014-02-01

Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scales with the cube of the size of the matrix. We present here a method that can be used to evaluate the elements of a function of a positive-definite matrix with a scaling that is linear for sparse matrices and quadratic in the general case. This methodology is based on the properties of the dynamics of a multidimensional harmonic potential coupled with colored-noise, generalized Langevin equation thermostats. This "f-thermostat" approach allows us to calculate directly elements of functions of a positive-definite matrix by carefully tailoring the properties of the stochastic dynamics. We demonstrate the scaling and the accuracy of this approach for both dense and sparse problems and compare the results with other established methodologies.

Modeling heterogeneous populations of thermostatically controlled loads using diffusion-advection PDEs

DEFF Research Database (Denmark)

Moura, Scott; Ruiz, Victor; Bendtsen, Jan Dimon

2013-01-01

This paper focuses on developing a partial differential equation (PDE)-based model and parameter identification scheme for heterogeneous populations of thermostatically controlled loads (TCLs). First, a coupled two-state hyperbolic PDE model for homogenous TCL populations is derived. This model i...

Thermostatic system of sensor in NIR spectrometer based on PID control

Science.gov (United States)

Wang, Zhihong; Qiao, Liwei; Ji, Xufei

2016-11-01

Aiming at the shortcomings of the primary sensor thermostatic control system in the near infrared (NIR) spectrometer, a novel thermostatic control system based on proportional-integral-derivative (PID) control technology was developed to improve the detection precision of the NIR spectrometer. There were five parts including bridge amplifier circuit, analog-digital conversion (ADC) circuit, microcontroller, digital-analog conversion (DAC) circuit and drive circuit in the system. The five parts formed a closed-loop control system based on PID algorithm that was used to control the error between the temperature calculated by the sampling data of ADC and the designed temperature to ensure the stability of the spectrometer's sensor. The experimental results show that, when the operating temperature of sensor is -11°, compared with the original system, the temperature control precision of the new control system is improved from ±0.64° to ±0.04° and the spectrum signal to noise ratio (SNR) is improved from 4891 to 5967.

Capillary Tube and Thermostatic Expansion Valve Comparative Analysis in Water Chiller Air Conditioning

Science.gov (United States)

Wijaya Sunu, Putu; Made Rasta, I.; Anakottapary, Daud Simon; Made Suarta, I.; Cipta Santosa, I. D. M.

2018-01-01

The aims of this study to compares the performance characteristics of a water chiller air conditioning simulation equipped with thermostatic expansion valve (TEV) with those of a capillary tube. Water chiller system filled with the same charge of refrigerant. Comparative analyses were performed based on coefficient of performance (COP) and performance parameter of the refrigeration system, carried out at medium cooling load level with the ambient temperature of 29-31°C, constant compressor speed and fixed chilled water volume flowrate at 15 lpm. It was shown that the TEV system showed better energy consumption compared to that of capillary tube. From the coefficient of performance perspective, the thermostatic expansion valve system showed higher COP (± 21.4%) compared to that of capillary tube system.

Peltier battery thermostat for semiconductor detectors

International Nuclear Information System (INIS)

Caini, V.

1980-01-01

The description is given of a Peltier battery cooling thermostat for semiconductor detectors, whose sensing element is the detector itself. A signal proportional to the leakage current is amplified and compared with a chosen reference voltage. The difference, amplified and sensed, regulates the cooling current to the Peltier battery. Special mechanical devices speed up measurement-taking. The leakage current proved to be reducible to as little as 1/1000 of that at ambient temperature and the stabilization obtained is between +-5 nA (although between +-1 nA is also feasible). Hence it is possible to use very high load resistance preamplifiers to reduce noise and to improve stability and pulse height resolution in α spectroscopy, even with a detector unsuitable for work at very low temperatures. Other applications can be foreseen. (orig.)

Investigation of charges for thermostatic expansion valves containing condensable and non condensable gas

DEFF Research Database (Denmark)

Langmaack, Lasse Nicolai; Knudsen, Hans-Jørgen Høgaard

2006-01-01

The bulb of a thermostatic expansion valve (TXV) is basically a temperature-pressure converter. It senses the temperature at the outlet of the evaporator, and the substance in the bulb (charge) generates the corresponding saturation pressure inside the bulb. The aim of the work presented in this ...

Control for large scale demand response of thermostatic loads

DEFF Research Database (Denmark)

Totu, Luminita Cristiana; Leth, John; Wisniewski, Rafal

2013-01-01

appliances with on/off operation. The objective is to reduce the consumption peak of a group of loads composed of both flexible and inflexible units. The power flexible units are the thermostat-based appliances. We discuss a centralized, model predictive approach and a distributed structure with a randomized......Demand response is an important Smart Grid concept that aims at facilitating the integration of volatile energy resources into the electricity grid. This paper considers a residential demand response scenario and specifically looks into the problem of managing a large number thermostatbased...

Control characteristics and heating performance analysis of automatic thermostatic valves for radiant slab heating system in residential apartments

Energy Technology Data Exchange (ETDEWEB)

Ahn, Byung-Cheon [Department of Building Equipment System Engineering, Kyungwon University, Seongnam City (Korea); Song, Jae-Yeob [Graduate School, Building Equipment System Engineering, Kyungwon University, Seongnam City (Korea)

2010-04-15

Computer simulations and experiments are carried out to research the control characteristics and heating performances for a radiant slab heating system with automatic thermostatic valves in residential apartments. An electrical equivalent R-C circuit is applied to analyze the unsteady heat transfer in the house. In addition, the radiant heat transfer between slabs, ceilings and walls in the room is evaluated by enclosure analysis method. Results of heating performance and control characteristics were determined from control methods such as automatic thermostatic valves, room air temperature-sensing method, water-temperature-sensing method, proportional control method, and On-Off control method. (author)

Construction and Start-up of a Large-Volume Thermostat for Dielectric-Constant Gas Thermometry

Science.gov (United States)

Merlone, A.; Moro, F.; Zandt, T.; Gaiser, C.; Fellmuth, B.

2010-07-01

A liquid-bath thermostat with a volume of about 800 L was designed to provide a suitable thermal environment for a dielectric-constant gas thermometer (DCGT) in the range from the triple point of mercury to the melting point of gallium. In the article, results obtained with the unique, huge thermostat without the DCGT measuring chamber are reported to demonstrate the capability of controlling the temperature of very large systems at a metrological level. First tests showed that the bath together with its temperature controller provide a temperature variation of less than ±0.5mK peak-to-peak. This temperature instability could be maintained over a period of several days. In the central working volume (diameter—500mm, height—650mm), in which the vacuum chamber containing the measuring system of the DCGT will be placed later, the temperature inhomogeneity has been demonstrated to be also well below 1mK.

Electrodeposition of nickel onto steel, using a thermostatic cell and movable anode by a variable current

International Nuclear Information System (INIS)

Vega G, J.D.

1994-01-01

In this work, metallic coatings of nickel was made over carbon steel using two different electrolytic solutions: The Watts's bath and the nickel sulfamate bath, using a pulse variable current. The method use was the traditional method, its means a thermostatic cell and one movable anode, which is a few know technique nowadays, it allow realize depositions away from any laboratory or special workshop, it has the advantage to be a portable dispositive. At last of all the electro depositions the coatings quality was valuable by them physical properties like: adhesion, hardness, wrinkled and thickness. The best results was obtain by the Nickel sulfamate bath and movable anode, less in the thickness, which has higher on the thermostatic cell. The variable current was obtain by a Pulse Generator and a Cathodic galvanometer. (Author)

Demand Response of Thermostatic Loads by Optimized Switching-Fraction Broadcast

DEFF Research Database (Denmark)

Totu, Luminita Cristiana; Wisniewski, Rafal

2014-01-01

Demand response is an important Smart Grid concept that aims at facilitating the integration of volatile energy resources into the electricity grid. This paper considers the problem of managing large populations of thermostat-based devices with on/off operation. The objective is to enable demand...... Method is used to spatially discretize these equations. Next, a broadcast strategy with two switching-fraction signals is proposed for actuating the population. This is applied in an open-loop scenario for tracking a power reference by running an optimization with a multilinear objective....

Demand Response on domestic thermostatically controlled loads

DEFF Research Database (Denmark)

Lakshmanan, Venkatachalam

. For a safe and reliable operation of electric power systems, the balance between electricity generation and consumption has to be maintained. The conventional fossil fuel based power generation achieves this balance by adjusting the generation to follow the consumption. In the electric power system......Electricity has become an inevitable part of human life in present day world. In the past two centuries, the electric power system has undergone a lot of changes. Due to the awareness about the adverse impact of the fossil fuels, the power industry is adopting green and sustainable energy sources....... In general, the electricity consumers are classified as industrial, commercial and domestic. In this dissertation, only the thermostatically controlled loads (TCLs) in the domestic segment are considered for the demand response study. The study is funded by Danish Council for Strategic Research (DCSR...

Design and Development of Autonomous High Voltage Driving System for DEAP Actuator in Radiator Thermostat

DEFF Research Database (Denmark)

Huang, Lina; Zhang, Zhe; Andersen, Michael A. E.

2014-01-01

In radiator thermostat applications, DEAP (Dielectric Electro Active Polymer) actuator tends to be a good candidate to replace the conventional self-actuating or step motor based actuator due to its intrinsic advantages. The capacitive property and high voltage (HV) driving demand of DEAP actuator...

Design and Modelling of Thermostatically Controlled Loads as Frequency Controlled Reserve

DEFF Research Database (Denmark)

Xu, Zhao; Østergaard, Jacob; Togeby, Mikael

2007-01-01

Using demand as frequency controlled reserve (DFR) is beneficial to power systems in many aspects. To study the impacts of this technology on power system operation, control logics and simulation models of relevant loads should be carefully developed. Two advanced control logics for using demand...... frequency, is developed. The developed simulation model is able to represent a variety of aggregated thermostatically controlled loads, such as heaters or refrigerators. Uncertainties including customer behaviours and ambient temperature variation are also modelled. Preliminary simulation results...

饱和蒸汽压式波纹管疏水阀热动元件实验研究%Experimental study on the saturated vapor pressure type thermostatic bellows for steam traps

Institute of Scientific and Technical Information of China (English)

李树勋; 徐登伟; 把桥环

2011-01-01

针对液体膨胀式波纹管蒸汽疏水阀排量不稳定、漏汽率高等问题,分析波纹管热动元件的热工特性.基于Riedel蒸汽压方程和气液平衡方程,建立饱和蒸汽压式波纹管热动元件的热力学模型,设计相应实验系统,进行不同参数下的实验研究.结果表明,饱和蒸汽压式波纹管热动元件伸长量是相变温度的单值函数,近似呈指数关系；采用不同混合比、刚度及填充方式,可调节疏水阀的排水过冷度.%In view of the instabilities of displacement and high steam leakage rate for the liquid-expansion type ther-mostatic bellows steam traps, thermodynamic characteristical of thermostatic bellows was analyzed. Based on the Riedel equation and the vapor-liquid equilibrium equation, thermodynamic model of the saturated vapor pressure type thermostatic bellows was set up, corresponding experimental system was designed, and experimental studies with different parameters was carried out. The experimental results agree well with the theoretical analysis. The results show that the elongation A/I of the saturated vapor pressure type thermostatic bellows is monodrome function of phase transition temperature T, and relationship between the elongation A/I and the phase change temperature t is an exponential function. The subcooled temperature of steam trap can be adjusted by using different mixture ratio, different bellows' stiffness and different sufficient attire method. This paper establishes theoretical and experimental foundation for improving the performance of thermostatic bellows steam traps.

Development of modular thermostatic vapour-cooled current leads for cryogenic service

International Nuclear Information System (INIS)

Blessing, H.; Lebrun, P.

1983-01-01

Cryogenic current leads cooled by helium vapour have been developed, built and tested. Their construction, based on standard electrolytic copper braids crimped at the ends, is such as to provide flexible cold terminations and make possible a modular design. The warm terminations combine electrical insulation, leak-tightness and integrated thermostatic valves controlling lead temperature and avoiding thermal run-away or ice build-up. After giving a detailed description of their construction, this report presents results of performance and reliability tests made on prototype units. (orig.)

The presence and growth of Legionella species in thermostatic shower mixer taps: an exploratory field study

NARCIS (Netherlands)

Joost van Hoof; P.W.J.J. van der Wielen; E. van der Blom; O.W.W. Nuijten; L. Hornstra

2014-01-01

Legislation in the Netherlands requires routine analysis of drinking water samples for cultivable Legionella species from high-priority installations. A field study was conducted to investigate the presence of Legionella species in thermostatic shower mixer taps. Water samples and the interior of

Modelling occupants’ heating set-point prefferences

DEFF Research Database (Denmark)

Andersen, Rune Vinther; Olesen, Bjarne W.; Toftum, Jørn

2011-01-01

consumption. Simultaneous measurement of the set-point of thermostatic radiator valves (trv), and indoor and outdoor environment characteristics was carried out in 15 dwellings in Denmark in 2008. Linear regression was used to infer a model of occupants’ interactions with trvs. This model could easily...... be implemented in most simulation software packages to increase the validity of the simulation outcomes....

Small causes, big effects. For environment and sales: Check of thermostat valves in the internet; Kleine Ursache, grosse Wirkung. Zugunsten Umwelt und Umsatz: Thermostatventil-Check jetzt im Internet

Energy Technology Data Exchange (ETDEWEB)

Anon.

2008-04-15

Fifty percent of all installed thermostat valves are assumed to be lacking in energy efficiency, according to the ''Optimus'' research report. Industry has reacted to this by developing a ThermostatCheck, which can be accessed in the internet by builder-owners and fitters. (orig.)

Nuclear quantum effects in solids using a colored-noise thermostat.

Science.gov (United States)

Ceriotti, Michele; Bussi, Giovanni; Parrinello, Michele

2009-07-17

We present a method, based on a non-Markovian Langevin equation, to include quantum corrections to the classical dynamics of ions in a quasiharmonic system. By properly fitting the correlation function of the noise, one can vary the fluctuations in positions and momenta as a function of the vibrational frequency, and fit them so as to reproduce the quantum-mechanical behavior, with minimal a priori knowledge of the details of the system. We discuss the application of the thermostat to diamond and to ice Ih. We find that results in agreement with path-integral methods can be obtained using only a fraction of the computational effort.

42 CFR 415.170 - Conditions for payment on a fee schedule basis for physician services in a teaching setting.

Science.gov (United States)

2010-10-01

... physician services in a teaching setting. 415.170 Section 415.170 Public Health CENTERS FOR MEDICARE... BY PHYSICIANS IN PROVIDERS, SUPERVISING PHYSICIANS IN TEACHING SETTINGS, AND RESIDENTS IN CERTAIN SETTINGS Physician Services in Teaching Settings § 415.170 Conditions for payment on a fee schedule basis...

Generation Following with Thermostatically Controlled Loads via Alternating Direction Method of Multipliers Sharing Algorithm

OpenAIRE

Burger, Eric M.; Moura, Scott J.

2015-01-01

A fundamental requirement of the electric power system is to maintain a continuous and instantaneous balance between generation and load. The intermittency and uncertainty introduced by renewable energy generation requires the expansion of ancillary power system services to maintain such a balance. In this paper, we examine the potential of thermostatically controlled loads (TCLs), such as refrigerators and electric water heaters, to provide generation following services in real-time energy m...

Thermal response of a Fermi-Pasta-Ulam chain with Andersen thermostats

Science.gov (United States)

D'Ambrosio, Federico; Baiesi, Marco

2017-11-01

The linear response to temperature variations is well characterised for equilibrium systems but a similar theory is not available, for example, for inertial heat conducting systems, whose paradigm is the Fermi-Pasta-Ulam (FPU) model driven by two different boundary temperatures. For models of inertial systems out of equilibrium, including relaxing systems, we show that Andersen thermostats are a natural tool for studying the thermal response. We derive a fluctuation-response relation that allows to predict thermal expansion coefficients or the heat capacitance in nonequilibrium regimes. Simulations of the FPU chain of oscillators suggest that estimates of susceptibilities obtained with our relation are better than those obtained via a small perturbation.

Influence of occupant's heating set-point preferences on indoor environmental quality and heating demand in residential buildings

DEFF Research Database (Denmark)

Fabi, Valentina; Corgnati, Stefano Paolo; Andersen, Rune Korsholm

2013-01-01

of energy consumption. The aim was to compare the obtained results with a traditional deterministic use of the simulation program. Based on heating set-point behavior of 13 Danish dwellings, logistic regression was used to infer the probability of adjusting the set-point of thermostatic radiator valves...

Bad seeds sprout perilous dynamics: stochastic thermostat induced trajectory synchronization in biomolecules

International Nuclear Information System (INIS)

Voter, A. F.; Sindhikara, Daniel J.; Kim, Seonah; Roitberg, Adrian E.

2009-01-01

Molecular dynamics simulations starting from different initial conditions are commonly used to mimic the behavior of an experimental ensemble. We show in this article that when a Langevin thermostat is used to maintain constant temperature during such simulations, extreme care must be taken when choosing the random number seeds used in order to prevent statistical correlation among the MD trajectories. While recent studies have shown that stochastically thermostatted trajectories evolving within a single potential basin with identical random number seeds tend to synchronize, we show that there is a synchronization effect even for complex, biologically relevant systems. We demonstrate this effect in simulations of Alanine trimer and pentamer and in a simulation of a temperature-jump experiment for peptide folding of a 14-residue peptide. Even in replica-exchange simulations, in which the trajectories are at different temperatures, we find partial synchronization occurring when the same random number seed is employed. We explain this by extending the recent derivation of the synchronization effect for two trajectories in a harmonic well to the case in which the trajectories are at two different temperatures. Our results suggest several ways in which mishandling selection of a pseudo random number generator initial seed can lead to corruption of simulation data. Simulators can fall into this trap in simple situations such as neglecting to specifically indicate different random seeds in either parallel or sequential restart simulations, utilizing a simulation package with a weak pseudorandom number generator, or using an advanced simulation algorithm that hasn't been programmed to distribute initial seeds

Bad Seeds Sprout Perilous Dynamics: Stochastic Thermostat Induced Trajectory Synchronization in Biomolecules.

Science.gov (United States)

Sindhikara, Daniel J; Kim, Seonah; Voter, Arthur F; Roitberg, Adrian E

2009-06-09

Molecular dynamics simulations starting from different initial conditions are commonly used to mimic the behavior of an experimental ensemble. We show in this article that when a Langevin thermostat is used to maintain constant temperature during such simulations, extreme care must be taken when choosing the random number seeds to prevent statistical correlation among the MD trajectories. While recent studies have shown that stochastically thermostatted trajectories evolving within a single potential basin with identical random number seeds tend to synchronize, we show that there is a synchronization effect even for complex, biologically relevant systems. We demonstrate this effect in simulations of alanine trimer and pentamer and in a simulation of a temperature-jump experiment for peptide folding of a 14-residue peptide. Even in replica-exchange simulations, in which the trajectories are at different temperatures, we find partial synchronization occurring when the same random number seed is employed. We explain this by extending the recent derivation of the synchronization effect for two trajectories in a harmonic well to the case in which the trajectories are at two different temperatures. Our results suggest several ways in which mishandling selection of a pseudorandom number generator initial seed can lead to corruption of simulation data. Simulators can fall into this trap in simple situations such as neglecting to specifically indicate different random seeds in either parallel or sequential restart simulations, utilizing a simulation package with a weak pseudorandom number generator, or using an advanced simulation algorithm that has not been programmed to distribute initial seeds.

Constraints of using thermostatic expansion valves to operate air-cooled chillers at lower condensing temperatures

International Nuclear Information System (INIS)

Yu, F.W.; Chan, K.T.; Chu, H.Y.

2006-01-01

Thermostatic expansion valves (TXVs) have long been used in air-cooled chillers to implement head pressure control under which the condensing temperature is kept high at around 50 o C by staging condenser fans as few as possible. This paper considers how TXVs prevent the chillers from operating with an increased COP at lower condensing temperatures when the chiller load or outdoor temperature drops. An analysis on an existing air-cooled reciprocating chiller showed that the range of differential pressures across TXVs restricts the maximum heat rejection airflow required to increase the chiller COP, though the set point of condensing temperature is reduced to 22 o C from a high level of 45 o C. It is possible to use electronic expansion valves to meet the differential pressure requirements for maximum chiller COP. There is a maximum of 28.7% increase in the chiller COP when the heat rejection airflow is able to be maximized in various operating conditions. The results of this paper emphasize criteria for lowering the condensing temperature to enhance the performance of air-cooled chillers

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2003-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2000-01-01

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

Project Schedule Simulation

DEFF Research Database (Denmark)

Mizouni, Rabeb; Lazarova-Molnar, Sanja

2015-01-01

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

Economic MPC based on LPV model for thermostatically controlled loads

DEFF Research Database (Denmark)

Zemtsov, Nikita; Hlava, Jaroslav; Frantsuzova, Galina

2017-01-01

Rapid increase of the renewable energy share in electricity production requires optimization and flexibility of the power consumption side. Thermostatically controlled loads (TCLs) have a large potential for regulation service provision. Economic model predictive control (MPC) is an advanced...... control method which can be used to syncronize the power consumption with undispatchable renewable electricity production. Thermal behavior of TCLs can be described by linear models based on energy balance of the system. In some cases, parameters of the model may be time-varying. In this work, we present...... a modified economic MPC based on linear parameter-varying model. In particular, we provide an exact transformation from a standard economic MPC formulation to a linear program. We assume that the variables influencing the model parameters are known (predictable) for the prediction horizon of the controller...

Quantum Oscillator in the Thermostat as a Model in the Thermodynamics of Open Quantum Systems

OpenAIRE

Sukhanov, Aleksander

2005-01-01

The quantum oscillator in the thermostat is considered as the model of an open quantum system. Our analysis will be heavily founded on the use of the Schroedinger generalized uncertainties relations (SUR). Our first aim is to demonstrate that for the quantum oscillator the state of thermal equilibrium belongs to the correlated coherent states (CCS), which imply the saturation of SUR at any temperature. The obtained results open the perspective for the search of some statistical theory, which ...

Overview of Existing and Future Residential Use Cases for Connected Thermostats

Energy Technology Data Exchange (ETDEWEB)

Rotondo, Julia [Energetics Inc., Washington, DC (United States); Johnson, Robert [Energetics Inc., Washington, DC (United States); Gonzalez, Nancy [Energetics Inc., Washington, DC (United States); Waranowski, Alexandra [Energetics Inc., Washington, DC (United States); Badger, Chris [Vermont Energy Investment Corporation, Burlington, VT (United States); Lange, Nick [Vermont Energy Investment Corporation, Burlington, VT (United States); Goldman, Ethan [Vermont Energy Investment Corporation, Burlington, VT (United States); Foster, Rebecca [Vermont Energy Investment Corporation, Burlington, VT (United States)

2017-03-01

This paper is intended to help inform future technology deployment opportunities for connected thermostats (CTs), based on investigation and review of the U.S. residential housing and CT markets, as well as existing, emerging, and future use cases for CT hardware and CT-generated data. The CT market has experienced tremendous growth over the last 5 years—both in terms of the number of units sold and the number of firms offering competing products—and can be characterized by its rapid pace of technological innovation. Despite many assuming CTs would become powerful tools for increasing comfort while saving energy, there remains a great deal of uncertainty about the actual energy and cost savings that are likely to be realized from deployment of CTs, particularly under different conditions.

Building America Case Study: The Impact of Thermostat Placement in Low-Load Homes in Sunny Climates, Denver, Colorado

Energy Technology Data Exchange (ETDEWEB)

2016-02-01

Modern, energy-efficient homes conforming to the Zero Energy Ready Home standard face the challenge of meeting high customer expectations for comfort. Traditional heating, ventilation, and air conditioning (HVAC) sizing and control strategies may be insufficient to adequately condition each zone due to unique load patterns in each room caused by a number of factors. These factors include solar heat gains, occupant-related gains, and gains associated with appliances and electronics. Because of shrinking shell loads, these intermittent factors are having an increasingly significant impact on the thermal load in each zone. Consequently, occupant comfort can be compromised. To evaluate the impact of climate and house geometry, as well as HVAC system and control strategies on comfort conditions, IBACOS analyzed the results of 99 TRNSYS multiple-zone simulations. The results of this analysis indicate that for simple-geometry and single-story plans, a single zone and thermostat can adequately condition the entire house. Demanding house geometry and houses with multiple stories require the consideration of multiple thermostats and multiple zones.

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

Directory of Open Access Journals (Sweden)

Yi Han

2013-01-01

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

How the Invisible Hand is Supposed to Adjust the Natural Thermostat: A Guide for the Perplexed

OpenAIRE

Storm, Servaas

2016-01-01

Mainstream climate economics takes global warming seriously, but perplexingly concludes that the optimal economic policy is to almost do nothing about it. This conclusion can be traced to just a few “normative” assumptions, over which there exists fundamental disagreement amongst economists. This paper explores two axes of this disagreement. The first axis (“market vs. regulation”) measures faith in the invisible hand to adjust the natural thermostat. The second axis expresses differences in ...

Overview of Existing and Future Residential Use Cases for Connected Thermostats

Energy Technology Data Exchange (ETDEWEB)

Rotondo, Julia [Energetics Inc., Washington, DC (United States); Johnson, Robert [Energetics Inc., Washington, DC (United States); Gonzales, Nancy [Energetics Inc., Washington, DC (United States); Waranowski, Alexandra [Energetics Inc., Washington, DC (United States); Badger, Chris [Vermont Energy Investment Corp., Burlington, VT (United States); Lange, Nack [Vermont Energy Investment Corp., Burlington, VT (United States); Goldman, Ethan [Vermont Energy Investment Corp., Burlington, VT (United States); Foster, Rebecca [Vermont Energy Investment Corp., Burlington, VT (United States)

2016-12-01

This paper is intended to help inform future technology deployment opportunities for connected thermostats (CTs), based on investigation and review of the U.S. residential housing and CT markets, as well as existing, emerging, and future use cases for CT hardware and CT-generated data. The CT market has experienced tremendous growth over the last five years — both in terms of the number of units sold and the number of firms offering competing products — and can be characterized by its rapid pace of technological innovation. Despite many assuming CTs would become powerful tools for increasing comfort while saving energy, there remains a great deal of uncertainty about the actual energy and cost savings that are likely to be realized from deployment of CTs, particularly under different conditions.

Methods for a Smart Thermostat to Estimate the Characteristics of a House Based on Sensor Data with Varying Extent of Completeness

NARCIS (Netherlands)

van der Ham, Wim; Klein, Michel; Tabatabaei, Seyed Amin; Thilakarathne, Dilhan; Treur, Jan

Smart thermostats can play an important role in achieving more economic energy usage in domestic situations. This paper focuses on the energy used for natural gas-based heating, and monitoring of gas usages versus indoor and outdoor temperatures over time. Two methods are presented that enable the

Setting the global thermostat with an exhaustible tradeable permit system

International Nuclear Information System (INIS)

Kosobud, R.G.; Quinn, K.G.; Illinois Univ., Chicago, IL; South, D.W.; Daly, T.A.

1993-01-01

The global warming policy debate has centered largely on near-term objectives such as freezing 1990 CO 2 emissions without regard to long-run implications. A policy of freezing CO 2 emissions is shown to slow but not halt global warming, while requiring expensive near-term adjustments. If the long-run temperature change outcome of the freeze policy is set as the goal of a more graduated control policy, one which allows the market to determine annual emissions, a more cost-effective solution is obtained that reduces the negative adjustment effects on the energy and other affected industries. The most cost-effective emissions time path of a graduated control policy could be achieved by an evaporative marketable CO 2 emissions permit system. This paper provides a preliminary examination of an evaporative permit system used to achieve long-run stabilization of greenhouse-induced temperature change

Interactive Dynamic Mission Scheduling for ASCA

Science.gov (United States)

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

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

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

Vehicle and driver scheduling for public transit.

Science.gov (United States)

2009-08-01

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

An Analysis of Electrical Consumption at Representative Army Installations.

Science.gov (United States)

1980-05-01

can be done by analyzing and optimizing HVAC system and building operation. For example, if the minimum hourly usage (demand) of a typical bachelor...equipment. (Major candidates for scheduling are air-handler motors, chillers , air compressors, exhaust fans, exterior lights, hot water heaters, and hot...location: Thermostats Setpoint Measured Limiters Setback Area Temperature Temperature Yes No Yes No Are night setback thermostats recommended? Yes _ No

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

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

Architecture and performance of neural networks for efficient A/C control in buildings

International Nuclear Information System (INIS)

Mahmoud, Mohamed A.; Ben-Nakhi, Abdullatif E.

2003-01-01

The feasibility of using neural networks (NNs) for optimizing air conditioning (AC) setback scheduling in public buildings was investigated. The main focus is on optimizing the network architecture in order to achieve best performance. To save energy, the temperature inside public buildings is allowed to rise after business hours by setting back the thermostat. The objective is to predict the time of the end of thermostat setback (EoS) such that the design temperature inside the building is restored in time for the start of business hours. State of the art building simulation software, ESP-r, was used to generate a database that covered the years 1995-1999. The software was used to calculate the EoS for two office buildings using the climate records in Kuwait. The EoS data for 1995 and 1996 were used for training and testing the NNs. The robustness of the trained NN was tested by applying them to a 'production' data set (1997-1999), which the networks have never 'seen' before. For each of the six different NN architectures evaluated, parametric studies were performed to determine the network parameters that best predict the EoS. External hourly temperature readings were used as network inputs, and the thermostat end of setback (EoS) is the output. The NN predictions were improved by developing a neural control scheme (NC). This scheme is based on using the temperature readings as they become available. For each NN architecture considered, six NNs were designed and trained for this purpose. The performance of the NN analysis was evaluated using a statistical indicator (the coefficient of multiple determination) and by statistical analysis of the error patterns, including ANOVA (analysis of variance). The results show that the NC, when used with a properly designed NN, is a powerful instrument for optimizing AC setback scheduling based only on external temperature records

Safe protocols for generating power pulses with heterogeneous populations of thermostatically controlled loads

International Nuclear Information System (INIS)

Sinitsyn, Nikolai A.; Kundu, Soumya; Backhaus, Scott

2013-01-01

Highlights: ► Algorithms to produce useful load response from a heterogeneous group of TCLs. ► Generation of sharp power pulses without initiating any unwanted oscillation. ► Open-loop methods, not requiring any detailed system modeling. ► One-way, utility-to-consumer, communication. ► Potential use in secondary frequency regulation, generation-load balancing, etc. - Abstract: We explore methods to use thermostatically controlled loads (TCLs), such as water heaters and air conditioners, to provide ancillary services by assisting in balancing generation and load. We show that by adding simple imbedded instructions and a small amount of memory to temperature controllers of TCLs, it is possible to design open-loop control algorithms capable of creating short-term pulses of demand response without unwanted power oscillations associated with temporary synchronization of the TCL dynamics. By moving a small amount of intelligence to each of the end point TCL devices, we are able to leverage our knowledge of the time dynamics of TCLs to shape the demand response pulses for different power system applications. A significant benefit of our open-loop method is the reduction from two-way to one-way broadcast communication which also eliminates many basic consumer privacy issues. In this work, we focus on developing the algorithms to generate a set of fundamental pulse shapes that can subsequently be used to create demand response with arbitrary profiles. Demand response control methods, such as the one developed here, open the door to fast, nonperturbative control of large aggregations of TCLs

Solving project scheduling problems by minimum cut computations

NARCIS (Netherlands)

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

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

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

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

Utilization Bound of Non-preemptive Fixed Priority Schedulers

Science.gov (United States)

Park, Moonju; Chae, Jinseok

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

A System for Automatically Generating Scheduling Heuristics

Science.gov (United States)

Morris, Robert

1996-01-01

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

Optimal Temporal Decoupling in Task Scheduling with Preferences

NARCIS (Netherlands)

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

2011-01-01

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

Minimizing tardiness for job shop scheduling under uncertainties

OpenAIRE

Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

2016-01-01

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

Small Business Demand Response with Communicating Thermostats: SMUD's Summer Solutions Research Pilot

Energy Technology Data Exchange (ETDEWEB)

Herter, Karen; Wayland, Seth; Rasin, Josh

2009-09-25

This report documents a field study of 78 small commercial customers in the Sacramento Municipal Utility District service territory who volunteered for an integrated energy-efficiency/demand-response (EE-DR) program in the summer of 2008. The original objective for the pilot was to provide a better understanding of demand response issues in the small commercial sector. Early findings justified a focus on offering small businesses (1) help with the energy efficiency of their buildings in exchange for occasional load shed, and (2) a portfolio of options to meet the needs of a diverse customer sector. To meet these expressed needs, the research pilot provided on-site energy efficiency advice and offered participants several program options, including the choice of either a dynamic rate or monthly payment for air-conditioning setpoint control. An analysis of hourly load data indicates that the offices and retail stores in our sample provided significant demand response, while the restaurants did not. Thermostat data provides further evidence that restaurants attempted to precool and reduce AC service during event hours, but were unable to because their air-conditioning units were undersized. On a 100 F reference day, load impacts of all participants during events averaged 14%, while load impacts of office and retail buildings (excluding restaurants) reached 20%. Overall, pilot participants including restaurants had 2007-2008 summer energy savings of 20% and bill savings of 30%. About 80% of participants said that the program met or surpassed their expectations, and three-quarters said they would probably or definitely participate again without the $120 participation incentive. These results provide evidence that energy efficiency programs, dynamic rates and load control programs can be used concurrently and effectively in the small business sector, and that communicating thermostats are a reliable tool for providing air-conditioning load shed and enhancing the ability

An original accelerated radiotherapy schedule in stage III to IV head and neck cancers. Results in a multicenter setting

International Nuclear Information System (INIS)

Allal, A.S.

2000-01-01

Background: Accelerated radiotherapy delivery has recently been shown to be effective in overcoming repopulation during fractionated radiotherapy. The therapeutic ratio may be particularly favorable for 5-week regimens. This study reports the feasibility and results of a particular accelerated schedule in Stage III to IV head and neck carcinomas used in a multicenter setting. Patients and Methods: Seventy-four patients with Stage III (26 patients) or IV (48 patients) head and neck carcinomas were treated with a 5-week accelerated schedule (69.9 to 69.8 Gy in 41 to 40 fractions over a period of 35 to 36 days). Treatment began with 20 Gy in 10 daily fractions to initial involved sites, followed by bi-fractionated radiotherapy (2x1.6 Gy to 1.66 Gy/day) to a larger head and neck volume. Thirty-six (49%) patients received induction chemotherapy (median 3 cycles, range 1 to 4 cycles). Results: Grade 3 or 4 (RTOG) confluent mucositis was observed in 57 patients (77%) and Grade 3 dysphagia in 33 patients (44%). Grade 3 or 4 (RTOG-EORTC) late complications were scored in 10.5% of cases. The 5-year actuarial locoregional control rate was 56% (95% CI: 42 to 71). The 5-year overall actuarial survival was 32% (95% CI: 18 to 46). Induction chemotherapy was not associated with a more favorable outcome. Conclusions: This study demonstrates the feasibility of this schedule in a multicenter setting. The oncologic results appear similar to those obtained by other accelerated regimens, while the rate of late complications seems acceptable. Five-week accelerated regimens warrant further evaluation, particularly in conjunction with concomitant chemotherapy, in the framework of prospective trials. (orig.) [de

Impact of thermostatically controlled loads' demand response activation on aggregated power: A field experiment

DEFF Research Database (Denmark)

Lakshmanan, Venkatachalam; Marinelli, Mattia; Kosek, Anna Magdalena

2015-01-01

activation. The outcome of this experimental study quantifies the actual flexibility of household TCLs and the consequence for the different parties with respect to power behaviour. Each DR activation method adopts different scenarios to meet the power reduction, and has different impacts on the parameters......This paper describes the impacts of different types of DR (demand response) activation on TCLs' (thermostatically controlled loads) aggregated power. The different parties: power system operators, DR service providers (or aggregators) and consumers, have different objectives in relation to DR....... The experiments are conducted with real domestic refrigerators representing TCL. Activating refrigerators for DR with a delay reduces the ISE (integral square error) in power limitation by 28.46%, overshoot by 7.69%. The delay in refrigerator activation causes reduction in power ramp down rate by 39.90%, ramp up...

Integrated network design and scheduling problems :

Energy Technology Data Exchange (ETDEWEB)

Nurre, Sarah G.; Carlson, Jeffrey J.

2014-01-01

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Development and analysis of a variable position thermostat for smart cooling system of a light duty diesel vehicles and engine emissions assessment during NEDC

International Nuclear Information System (INIS)

Mohamed, Eid S.

2016-01-01

Highlights: • A new concept of the variable position electromagnetic thermostat in MCS is proposed. • A series of experiments were conducted on a light duty diesel vehicle operated over the NEDC test. • A comparative study was done on emission characteristics of the MCS and the conventional cooling system. • Engine cold start and steady-state coolant flow rate and emissions are presented. • The effect of MCS on engine accumulation FC and emissions over NEDC are evaluated. - Graphical Abstract: Display Omitted - Abstract: Smart cooling control systems for IC engines can better regulate the combustion process and heat, a variable position thermostat and electric coolant pumps (EWP) for IC engines are under development by a number of researchers. However, the aim of this study is to assess the performance of a variable position electromagnetic thermostat (VPEMT) to provide more flexible control of the engine temperature and coolant mass flow rate of modification cooling system (MCS). The measurement procedure was applied to two phases under new European drive cycle (NEDC) on a chassis dynamometer, with conventional cooling system (baseline engine) and MCS of a light duty diesel engine. The experimental results revealed that MCS using a VPEMT and EWP contributed to a reduction of engine warm-up period. As a consequence, important reduces in coolant flow rate and most exhaust emission compounds (THC, CO_2, CO and smoke opacity) were obtained. In contrast, NOx emission was observed to increase in these conditions. Comparative results are given for various engine speeds during a cold start and engine fully warm-up tests when the engine was equipped by conventional cooling system and MCS operation under NEDC, revealing the effect of MCS on engine fuel consumption and exhaust emissions.

Distributing Flexibility to Enhance Robustness in Task Scheduling Problems

NARCIS (Netherlands)

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

2013-01-01

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

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

NASA Instrument Cost/Schedule Model

Science.gov (United States)

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

2011-01-01

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

How the Invisible Hand is Supposed to Adjust the Natural Thermostat: A Guide for the Perplexed.

Science.gov (United States)

Storm, Servaas

2017-10-01

Mainstream climate economics takes global warming seriously, but perplexingly concludes that the optimal economic policy is to almost do nothing about it. This conclusion can be traced to just a few "normative" assumptions, over which there exists fundamental disagreement amongst economists. This paper explores two axes of this disagreement. The first axis ("market vs. regulation") measures faith in the invisible hand to adjust the natural thermostat. The second axis expresses differences in views on the efficiency and equity implications of climate action. The two axes combined lead to a classification of conflicting approaches in climate economics. The variety of approaches does not imply a post-modern "anything goes", as the contradictions between climate and capitalism cannot be wished away.

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

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

2013-01-01

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

Using billing and weather data to separate thermostat from insulation effects

Energy Technology Data Exchange (ETDEWEB)

Fels, M F; Goldberg, M L

1984-05-01

A simple methodology, which uses aggregate utility sales data to measure and decompose residential conservation trends, is demonstrated. The data base is the aggregate natural gas consumption of the nearly one million houses in New Jersey which use gas for heating. The conservation index resulting from the analysis is normalized annual consumption, which adjusts per-household consumption to typical weather conditions. To smooth erratic year-to-year changes, four-year composite analyses are moved forward in time over the period 1970-82. Dramatic decreases in consumption, totaling 26% since the oil embargo, are evident. A decomposition of the results for the four years following the embargo suggests that over half of this conservation effect is due to changes in interior temperatures, with the policy implication that thermostat setbacks have played a far greater conservation role than have either structural change through retrofitting or modifications in appliance usage. In more recent years, for which the overall reduction in energy usage is lower, the dominant conservation role appears to have shifted to reductions in temperature-independent, base-level consumption by water heaters and appliances, while the effects of retrofitting remain relatively small.

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

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

2017-08-01

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

Recovery scheduling for industrial pocesses using graph constraints

NARCIS (Netherlands)

Saltik, M.B.; van Gameren, S.; Özkan, L.; Weiland, S.

2017-01-01

This paper considers a class of scheduling problems cast for processes that consist of several interconnected subprocesses. We model the temporal constraints (On-Off status) on each subprocess using labeled directed graphs to form the admissible set of schedules. Furthermore, we consider physical

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

Science.gov (United States)

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

2018-03-01

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

Bumpless Transfer between Observer-based Gain Scheduled Controllers

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Stoustrup, Jakob; Trangbæk, Klaus

2005-01-01

This paper deals with bumpless transfer between a number of observer-based controllers in a gain scheduling architecture. Linear observer-based controllers are designed for a number of linear approximations of a nonlinear system in a set of operating points, and gain scheduling control can...

Robust Optimization-Based Generation Self-Scheduling under Uncertain Price

Directory of Open Access Journals (Sweden)

Xiao Luo

2011-01-01

Full Text Available This paper considers generation self-scheduling in electricity markets under uncertain price. Based on the robust optimization (denoted as RO methodology, a new self-scheduling model, which has a complicated max-min optimization structure, is set up. By using optimal dual theory, the proposed model is reformulated to an ordinary quadratic and quadratic cone programming problems in the cases of box and ellipsoidal uncertainty, respectively. IEEE 30-bus system is used to test the new model. Some comparisons with other methods are done, and the sensitivity with respect to the uncertain set is analyzed. Comparing with the existed uncertain self-scheduling approaches, the new method has twofold characteristics. First, it does not need a prediction of distribution of random variables and just requires an estimated value and the uncertain set of power price. Second, the counterpart of RO corresponding to the self-scheduling is a simple quadratic or quadratic cone programming. This indicates that the reformulated problem can be solved by many ordinary optimization algorithms.

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities

OpenAIRE

Bonifaci , Vincenzo; Brandenburg , Björn; D'Angelo , Gianlorenzo; Marchetti-Spaccamela , Alberto

2016-01-01

International audience; Many multiprocessor real-time operating systems offer the possibility to restrict the migrations of any task to a specified subset of processors by setting affinity masks. A notion of " strong arbitrary processor affinity scheduling " (strong APA scheduling) has been proposed; this notion avoids schedulability losses due to overly simple implementations of processor affinities. Due to potential overheads, strong APA has not been implemented so far in a real-time operat...

A Procedure for scheduling and setting processing priority of MC requests

CERN Document Server

Balcar, Stepan

2013-01-01

My project contains designing and programming a base of an open system, which should help with the scheduling Monte Carlo production requests needed by the CMS physicists for data analysis within the CMS collaboration. A primary requirement was to create web interface that would be portable and independent of the control logic of the system. Another point of the project was to make a scheduler for the Monte Carlo production planning and to design and program interfaces between the various logical blocks of the system. Introduction Many research groups in CERN which specialize in different areas of particle physics works with CMS. They are mostly scientists working at universities or research institutes in their countries. Their research consists in constructing models of elementary particles and subsequent experimental verification of the behavior of these models. All these groups of people create MC production requests which are to be executed using computing resources located at CERN and other institutes. T...

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

Science.gov (United States)

Hakim, L.; Bakhtiar, T.; Jaharuddin

2017-01-01

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

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

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

Goal programming for cyclical auxiliary police scheduling at UiTM Cawangan Perlis

Science.gov (United States)

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

2017-11-01

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

An introduction to optimal satellite range scheduling

CERN Document Server

Vázquez Álvarez, Antonio José

2015-01-01

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

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.

Designing of vague logic based multilevel feedback queue scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-03-01

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

Equivalent electricity storage capacity of domestic thermostatically controlled loads

International Nuclear Information System (INIS)

Sossan, Fabrizio

2017-01-01

A method to quantify the equivalent storage capacity inherent the operation of thermostatically controlled loads (TCLs) is developed. Equivalent storage capacity is defined as the amount of power and electricity consumption which can be deferred or anticipated in time with respect to the baseline consumption (i.e. when no demand side event occurs) without violating temperature limits. The analysis is carried out for 4 common domestic TCLs: an electric space heating system, freezer, fridge, and electric water heater. They are simulated by applying grey-box thermal models identified from measurements. They describe the heat transfer of the considered TCLs as a function of the electric power consumption and environment conditions. To represent typical TCLs operating conditions, Monte Carlo simulations are developed, where models inputs and parameters are sampled from relevant statistical distributions. The analysis provides a way to compare flexible demand against competitive storage technologies. It is intended as a tool for system planners to assess the TCLs potential to support electrical grid operation. In the paper, a comparison of the storage capacity per unit of capital investment cost is performed considering the selected TCLs and two grid-connected battery storage systems (a 720 kVA/500 kWh lithium-ion unit and 15 kVA/120 kWh Vanadium flow redox) is performed. - Highlights: • The equivalent storage capacity of domestic TCLs is quantified • A comparison with battery-based storage technologies is performed • We derive metrics for system planners to plan storage in power system networks • Rule-of-thumb cost indicators for flexible demand and battery-based storage

Interoceanic canal excavation scheduling via computer simulation

Energy Technology Data Exchange (ETDEWEB)

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

1970-05-15

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

Interoceanic canal excavation scheduling via computer simulation

International Nuclear Information System (INIS)

Baldonado, Orlino C.

1970-01-01

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

Real Time Information Based Energy Management Using Customer Preferences and Dynamic Pricing in Smart Homes

Directory of Open Access Journals (Sweden)

Muhammad Babar Rasheed

2016-07-01

Full Text Available This paper presents real time information based energy management algorithms to reduce electricity cost and peak to average ratio (PAR while preserving user comfort in a smart home. We categorize household appliances into thermostatically controlled (tc, user aware (ua, elastic (el, inelastic (iel and regular (r appliances/loads. An optimization problem is formulated to reduce electricity cost by determining the optimal use of household appliances. The operational schedules of these appliances are optimized in response to the electricity price signals and customer preferences to maximize electricity cost saving and user comfort while minimizing curtailed energy. Mathematical optimization models of tc appliances, i.e., air-conditioner and refrigerator, are proposed which are solved by using intelligent programmable communication thermostat ( iPCT. We add extra intelligence to conventional programmable communication thermostat (CPCT by using genetic algorithm (GA to control tc appliances under comfort constraints. The optimization models for ua, el, and iel appliances are solved subject to electricity cost minimization and PAR reduction. Considering user comfort, el appliances are considered where users can adjust appliance waiting time to increase or decrease their comfort level. Furthermore, energy demand of r appliances is fulfilled via local supply where the major objective is to reduce the fuel cost of various generators by proper scheduling. Simulation results show that the proposed algorithms efficiently schedule the energy demand of all types of appliances by considering identified constraints (i.e., PAR, variable prices, temperature, capacity limit and waiting time.

A General State-Space Formulation for Online Scheduling

Directory of Open Access Journals (Sweden)

Dhruv Gupta

2017-11-01

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

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)

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

1990-01-01

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

Courts, Scheduled Damages, and Medical Malpractice Insurance

DEFF Research Database (Denmark)

Bertoli, Paola; Grembi, Veronica

We assess the impact of the introduction of schedules of non-economic damages (i.e. tiered caps systems) on the behavior of insurers operating in the medical liability market for hospitals while controlling the performance of the judicial system, measured as court backlog. Using a difference......-in-differences strategy on Italian data, we find that the introduction of schedules increases the presence of insurers (i.e. medical liability market attractiveness) only in inefficient judicial districts. In the same way, court inefficiency is attractive to insurers for average values of schedules penetration...... of the market, with an increasing positive impact of inefficiency as the territorial coverage of schedules increases. Finally, no significant impact is registered on paid premiums. Our analysis sheds light on a complex set of elements affecting the decisions of insurers in malpractice markets. The analysis...

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

Science.gov (United States)

Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Approximating multi-objective scheduling problems

NARCIS (Netherlands)

Dabia, S.; Talbi, El-Ghazali; Woensel, van T.; Kok, de A.G.

2013-01-01

In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions that represent the interactions between the different objectives. Due to

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

Science.gov (United States)

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

2017-09-01

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

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

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

1998-01-01

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

Diverse task scheduling for individualized requirements in cloud manufacturing

Science.gov (United States)

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

2018-03-01

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

A combinatorial approach to multi-skill workforce scheduling

NARCIS (Netherlands)

Firat, M.; Hurkens, C.A.J.

2010-01-01

This paper deals with scheduling complex tasks with an inhomogeneous set of resources. The problem is to assign technicians to tasks with multi-level skill requirements. Here the requirements are merely the presence of a set of technicians that possess the necessary capabilities. An additional

Designing a fuzzy scheduler for hard real-time systems

Science.gov (United States)

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

1992-01-01

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

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

Apprenticeship Learning: Learning to Schedule from Human Experts

Science.gov (United States)

2016-06-09

identified by the heuristic . A spectrum of problems (i.e. traveling salesman, job-shop scheduling, multi-vehicle routing) was represented , as task locations...caus- ing the codification of this knowledge to become labori- ous. We propose a new approach for capturing domain- expert heuristics through a...demonstrate that this approach accu- rately learns multi-faceted heuristics on both a synthetic data set incorporating job-shop scheduling and vehicle

Multiprocessor Global Scheduling on Frame-Based DVFS Systems

OpenAIRE

Berten, Vandy; Goossens, Joël

2008-01-01

International audience; In this work, we are interested in multiprocessor energy efficient systems where task durations are not known in advance but are known stochastically. More precisely we consider global scheduling algorithms for frame-based multiprocessor stochastic DVFS (Dynamic Voltage and Frequency Scaling) systems. Moreover we consider processors with a discrete set of available frequencies. We provide a global scheduling algorithm, and formally show that no deadline will ever be mi...

Research on optimizing pass schedule of tandem cold mill

International Nuclear Information System (INIS)

Lu, C.; Wang, J.S.; Zhao, Q.L.; Liu, X.H.; Wang, G.D.

2000-01-01

In this paper, research on pass schedule of tandem cold mill (TCM) is carried out. According to load (reduction, rolling force, motor power) balance, non-linear equations set with variables of inter-stand thickness is constructed. The pass schedule optimization is carried out by solving the non-linear equations set. As the traditional method, the Newton-Raphson method is used for solving the non-linear equations set. In this paper a new simple method is brought up. On basis of the monotone relations between thickness and load, the inter-stands thickness is adjusted dynamically. The solution of non-linear equations set can be converged by iterative calculation. This method can avoid the derivative calculation used by traditional method. So, this method is simple and calculation speed is high. It is suitable for on-line control. (author)

The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations

DEFF Research Database (Denmark)

Dithmer, Philip; Reinhardt, Line Blander; Kontovas, Christos

2017-01-01

This paper deals with the Liner Shipping Routing and Scheduling Problem (LSRSP), which consists of designing the time schedule for a vessel to visit a fixed set of ports while minimizing costs. We extend the classical problem to include the external cost of ship air emissions and we present some...

EPA Sets Schedule to Improve Visibility in the Nation's Most Treasured Natural Areas

Science.gov (United States)

EPA issued a schedule to act on more than 40 state pollution reduction plans that will improve visibility in national parks and wilderness areas and protect public health from the damaging effects of the pollutants that cause regional haze.

Scheduling for the National Hockey League Using a Multi-objective Evolutionary Algorithm

Science.gov (United States)

Craig, Sam; While, Lyndon; Barone, Luigi

We describe a multi-objective evolutionary algorithm that derives schedules for the National Hockey League according to three objectives: minimising the teams' total travel, promoting equity in rest time between games, and minimising long streaks of home or away games. Experiments show that the system is able to derive schedules that beat the 2008-9 NHL schedule in all objectives simultaneously, and that it returns a set of schedules that offer a range of trade-offs across the objectives.

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)

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

Science.gov (United States)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

A Multiagent Evolutionary Algorithm for the Resource-Constrained Project Portfolio Selection and Scheduling Problem

Directory of Open Access Journals (Sweden)

Yongyi Shou

2014-01-01

Full Text Available A multiagent evolutionary algorithm is proposed to solve the resource-constrained project portfolio selection and scheduling problem. The proposed algorithm has a dual level structure. In the upper level a set of agents make decisions to select appropriate project portfolios. Each agent selects its project portfolio independently. The neighborhood competition operator and self-learning operator are designed to improve the agent’s energy, that is, the portfolio profit. In the lower level the selected projects are scheduled simultaneously and completion times are computed to estimate the expected portfolio profit. A priority rule-based heuristic is used by each agent to solve the multiproject scheduling problem. A set of instances were generated systematically from the widely used Patterson set. Computational experiments confirmed that the proposed evolutionary algorithm is effective for the resource-constrained project portfolio selection and scheduling problem.

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.

Staffing, overtime, and shift scheduling project

International Nuclear Information System (INIS)

Lewis, P.M.

1989-01-01

Recent events at the Peach Bottom nuclear power plant have demonstrated the need to establish a quantifiable basis for assessing the safety significance of long work hours on nuclear power plant operators. The incidents at TMI-2, Chernobyl, and Bhopal, which all occurred during the late evening/night shift, further highlight the importance of the relationship between shift scheduling and performance. The objective of this project is to estimate, using statistical analysis on data from the nuclear industry, the effects on safety of staffing levels, overtime, and shift scheduling for operators and maintenance personnel. Regarding staffing levels, the Nuclear Regulatory Commission (NRC) currently has no explicit regulation concerning the minimum acceptable levels of staffing in a plant that has an operating license. The NRC has no systematic method for collecting data on the number of licensed operators on the operating crews. In 1982 the NRC recommended that plants write into their technical specifications a model policy on overtime. Currently, 77 nuclear power plant units have the model policy or a modification of it written into their technical specifications; 33 units have no policy on overtime. The model policy sets limits on overtime for safety related personnel, although these limits can be exceeded with plant manger approval. The US nuclear power industry has three types of shift schedules: (1) forward-rotating 8-hour/day shift schedules, (2) backward-rotating 8-hour/day schedules, and (3) 12-hour/day schedules

PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

International Nuclear Information System (INIS)

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

1986-01-01

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

Anesthesiology Nurse Scheduling using Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Leopoldo Altamirano

2012-02-01

Full Text Available In this article we present an approach designed to solve a real world problem: the Anesthesiology Nurse Scheduling Problem (ANSP at a public French hospital. The anesthesiology nurses are one of the most shared resources in the hospital and we attempt to find a fair/balanced schedule for them, taking into account a set of constraints and the nursesarsquo; stated preferences, concerning the different shifts. We propose a particle swarm optimization algorithm to solve the ANSP. Finally, we compare our technique with previous results obtained using integer programming.

Electrodeposition of nickel onto steel, using a thermostatic cell and movable anode by a variable current.; Electrodeposicion de niquel sobre acero al carbon, empleando una celda termostatizada y un anodo movil, por medio de una corriente pulsada rectangular.

Energy Technology Data Exchange (ETDEWEB)

Vega G, J D

1994-12-31

In this work, metallic coatings of nickel was made over carbon steel using two different electrolytic solutions: The Watts`s bath and the nickel sulfamate bath, using a pulse variable current. The method use was the traditional method, its means a thermostatic cell and one movable anode, which is a few know technique nowadays, it allow realize depositions away from any laboratory or special workshop, it has the advantage to be a portable dispositive. At last of all the electro depositions the coatings quality was valuable by them physical properties like: adhesion, hardness, wrinkled and thickness. The best results was obtain by the Nickel sulfamate bath and movable anode, less in the thickness, which has higher on the thermostatic cell. The variable current was obtain by a Pulse Generator and a Cathodic galvanometer. (Author).

The Classroom Observation Schedule to Measure Intentional Communication (COSMIC): an observational measure of the intentional communication of children with autism in an unstructured classroom setting.

Science.gov (United States)

Pasco, Greg; Gordon, Rosanna K; Howlin, Patricia; Charman, Tony

2008-11-01

The Classroom Observation Schedule to Measure Intentional Communication (COSMIC) was devised to provide ecologically valid outcome measures for a communication-focused intervention trial. Ninety-one children with autism spectrum disorder aged 6 years 10 months (SD 16 months) were videoed during their everyday snack, teaching and free play activities. Inter-rater reliability was high and relevant items showed significant associations with comparable items from concurrent Autism Diagnostic Observation Schedule-Generic (Lord et al. 2000, J Autism Dev Disord 30(3):205-223) assessments. In a subsample of 28 children initial differences in rates of initiations, initiated speech/vocalisation and commenting were predictive of language and communication competence 15 months later. Results suggest that the use of observational measures of intentional communication in natural settings is a valuable assessment strategy for research and clinical practice.

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

Science.gov (United States)

Schumacher, André; Haanpää, Harri

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chvátal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

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

Science.gov (United States)

Eckhardt, D. E., Jr.

1983-01-01

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

An Automatic Course Scheduling Approach Using Instructors' Preferences

Directory of Open Access Journals (Sweden)

Hossam Faris

2012-03-01

Full Text Available University Courses Timetabling problem has been extensively researched in the last decade. Therefore, numerous approaches were proposed to solve UCT problem. This paper proposes a new approach to process a sequence of meetings between instructors, rooms, and students in predefined periods of time with satisfying a set of constraints divided in variety of types. In addition, this paper proposes new representation for courses timetabling and conflict-free for each time slot by mining instructor preferences from previous schedules to avoid undesirable times for instructors. Experiments on different real data showed the approach achieved increased satisfaction degree for each instructor and gives feasible schedule with satisfying all hard constraints in construction operation. The generated schedules have high satisfaction degrees comparing with schedules created manually. The research conducts experiments on collected data gathered from the computer science department and other related departments in Jordan University of Science and Technology- Jordan.

Single-machine scheduling of proportionally deteriorating jobs by two agents

OpenAIRE

S Gawiejnowicz; W-C Lee; C-L Lin; C-C Wu

2011-01-01

We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a...

Automatic Generation of Heuristics for Scheduling

Science.gov (United States)

Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

1997-01-01

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

Experimental analysis of flexibility change with different levels of power reduction by demand response activation on thermostat controlled loads

DEFF Research Database (Denmark)

Lakshmanan, Venkatachalam; Marinelli, Mattia; Hu, Junjie

2017-01-01

This paper studies the flexibility available with thermostatically controlled loads (TCLs) to provide power system services by demand response (DR) activation. Although the DR activation on TCLs can provide power system ancillary services, it is important to know how long such services can...... be provided for when different levels of power reduction are imposed. The flexibility change with different levels of power reduction is tested experimentally with domestic fridges used by real customers with unknown user interaction. The investigation quantifies the flexibility of household fridges...... and the impact of DR activation in terms of deviation in the average temperature. The maximum possible power reduction with the cluster of refrigerators is 67% and the available flexibility with the cluster of refrigerators is 10%. The resulting deviation in the average temperature is 14%....

Home Health Care for California's Injured Workers: Options for Implementing a Fee Schedule.

Science.gov (United States)

Wynn, Barbara O; Boustead, Anne

2015-07-15

The California Department of Industrial Relations/Division of Worker's Compensation asked RAND to provide technical assistance in developing a fee schedule for home health services provided to injured workers. The fee schedule needs to address the full spectrum of home health services ranging from skilled nursing and therapy services to unskilled personal care or chore services that may be provided by family members. RAND researchers consulted with stakeholders in the California workers' compensation system to outline issues the fee schedule should address, reviewed home health fee schedules used by other payers, and conducted interviews with WC administrators from other jurisdictions to elicit their experiences. California stakeholders identified unskilled attendant services as most problematic in determining need and payment rates, particularly services furnished by family members. RAND researchers concentrated on fee schedule options that would result in a single fee schedule covering the full range of home health care services furnished to injured workers and made three sets of recommendations. The first set pertains to obtaining additional information that would highlight the policy issues likely to occur with the implementation of the fee schedule and alternatives for assessing an injured worker's home health care needs. Another approach conforms most closely with the Labor Code requirements. It would integrate the fee schedules used by Medicare, In-Home Health Supportive Services, and the federal Office of Workers' Compensation. The third approach would base the home health fee schedule on rules used by the federal Office of Workers' Compensation.

A FAST AND ELITIST BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR SCHEDULING INDEPENDENT TASKS ON HETEROGENEOUS SYSTEMS

Directory of Open Access Journals (Sweden)

G.Subashini

2010-07-01

Full Text Available To meet the increasing computational demands, geographically distributed resources need to be logically coupled to make them work as a unified resource. In analyzing the performance of such distributed heterogeneous computing systems scheduling a set of tasks to the available set of resources for execution is highly important. Task scheduling being an NP-complete problem, use of metaheuristics is more appropriate in obtaining optimal solutions. Schedules thus obtained can be evaluated using several criteria that may conflict with one another which require multi objective problem formulation. This paper investigates the application of an elitist Nondominated Sorting Genetic Algorithm (NSGA-II, to efficiently schedule a set of independent tasks in a heterogeneous distributed computing system. The objectives considered in this paper include minimizing makespan and average flowtime simultaneously. The implementation of NSGA-II algorithm and Weighted-Sum Genetic Algorithm (WSGA has been tested on benchmark instances for distributed heterogeneous systems. As NSGA-II generates a set of Pareto optimal solutions, to verify the effectiveness of NSGA-II over WSGA a fuzzy based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto solution set.

Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems

NARCIS (Netherlands)

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

1999-01-01

We present a novel approach to compute Lagrangian lower bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent

Scheduling and Mapping in an Incremental Design Methodology for Distributed Real-Time Embedded Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2004-01-01

In this paper we present an approach to mapping and scheduling of distributed embedded systems for hard real-time applications, aiming at a minimization of the system modification cost. We consider an incremental design process that starts from an already existing system running a set of applicat......In this paper we present an approach to mapping and scheduling of distributed embedded systems for hard real-time applications, aiming at a minimization of the system modification cost. We consider an incremental design process that starts from an already existing system running a set...... be added to the resulted system. Thus, we propose a heuristic which finds the set of already running applications which have to be remapped and rescheduled at the same time with mapping and scheduling the new application, such that the disturbance on the running system (expressed as the total cost implied...... by the modifications) is minimized. Once this set of applications has been determined, we outline a mapping and scheduling algorithm aimed at fulfilling the requirements stated above. The approaches have been evaluated based on extensive experiments using a large number of generated benchmarks as well as a real...

Distributed continuous energy scheduling for dynamic virtual power plants

International Nuclear Information System (INIS)

Niesse, Astrid

2015-01-01

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

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

Science.gov (United States)

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

1986-09-01

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

TAGUCHI METHOD FOR THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES

Directory of Open Access Journals (Sweden)

AREF MALEKI-DARONKOLAEI

2013-10-01

Full Text Available This article considers a three-stage assembly flowshop scheduling problem minimizing the weighted sum of mean completion time and makespan with sequence-dependent setup times at the first stage and blocking times between each stage. To tackle such an NP-hard, two meta-heuristic algorithms are presented. The novelty of our approach is to develop a variable neighborhood search algorithm (VNS and a well-known simulated annealing (SA for the problem. Furthermore, to enhance the performance of the (SA, its parameters are optimized by the use of Taguchi method, but to setting parameters of VNS just one parameter has been used without Taguchi. The computational results show that the proposed VNS is better in mean and standard deviation for all sizes of the problem than SA, but on the contrary about CPU Time SA outperforms VNS.

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.

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

KAUST Repository

Douik, Ahmed

2017-09-07

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

Effect of sampling schedule on pharmacokinetic parameter estimates of promethazine in astronauts

Science.gov (United States)

Boyd, Jason L.; Wang, Zuwei; Putcha, Lakshmi

2005-08-01

Six astronauts on the Shuttle Transport System (STS) participated in an investigation on the pharmacokinetics of promethazine (PMZ), a medication used for the treatment of space motion sickness (SMS) during flight. Each crewmember completed the protocol once during flight and repeated thirty days after returned to Earth. Saliva samples were collected at scheduled times for 72 h after PMZ administration; more frequent samples were collected on the ground than during flight owing to schedule constraints in flight. PMZ concentrations in saliva were determined by a liquid chromatographic/mass spectrometric (LC-MS) assay and pharmacokinetic parameters (PKPs) were calculated using actual flight and ground-based data sets and using time-matched sampling schedule on ground to that during flight. Volume of distribution (Vc) and clearance (Cls) decreased during flight compared to that from time-matched ground data set; however, ClS and Vc estimates were higher for all subjects when partial ground data sets were used for analysis. Area under the curve (AUC) normalized with administered dose was similar in flight and partial ground data; however AUC was significantly lower using time-matched sampling compared with the full data set on ground. Half life (t1/2) was longest during flight, shorter with matched-sampling schedule on ground and shortest when complete data set from ground was used. Maximum concentration (Cmax), time for Cmax (tmax), parameters of drug absorption, depicted a similar trend with lowest and longest respectively, during flight, lower with time- matched ground data and highest and shortest with full ground data.

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

Science.gov (United States)

2017-05-03

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

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

From non-preemptive to preemptive scheduling using synchronization synthesis.

Science.gov (United States)

Černý, Pavol; Clarke, Edmund M; Henzinger, Thomas A; Radhakrishna, Arjun; Ryzhyk, Leonid; Samanta, Roopsha; Tarrach, Thorsten

2017-01-01

We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

OpenAIRE

Chih-Yu Wen; Ying-Chih Chen

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show t...

Solving University Scheduling Problem Using Hybrid Approach

Directory of Open Access Journals (Sweden)

Aftab Ahmed Shaikh

2011-10-01

Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

Directory of Open Access Journals (Sweden)

Mihai-Victor Micea

2017-06-01

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

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

Science.gov (United States)

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

2017-06-26

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

Advance Resource Provisioning in Bulk Data Scheduling

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet

2012-10-01

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

Software Schedules Missions, Aids Project Management

Science.gov (United States)

2008-01-01

NASA missions require advanced planning, scheduling, and management, and the Space Agency has worked extensively to develop the programs and software suites necessary to facilitate these complex missions. These enormously intricate undertakings have hundreds of active components that need constant management and monitoring. It is no surprise, then, that the software developed for these tasks is often applicable in other high-stress, complex environments, like in government or industrial settings. NASA work over the past few years has resulted in a handful of new scheduling, knowledge-management, and research tools developed under contract with one of NASA s partners. These tools have the unique responsibility of supporting NASA missions, but they are also finding uses outside of the Space Program.

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.

Basic Features of Customer Satisfaction with Train Schedules

Science.gov (United States)

Murakoshi, Akiko; Kunimatsu, Taketoshi; Saito, Ayano

This paper aims to reveal the fundamental features of customer satisfaction with train schedules, which is one of the most basic services provided by a railway company. A customer satisfaction survey of passengers who frequently utilize three lines in the metropolitan area was conducted; we obtained the following findings: (a) out of nine factors to evaluate a train schedule from a passenger's viewpoint, the four most important ones are the frequency of trains running, punctuality, congestion rate, and time distance; (b) the ride-frequency influences the degree of satisfaction with train schedules in a particular line; and (c) it is important to set a numeric goal for the level of customer satisfaction by grasping the relationship between the transport service and a passenger's satisfaction with that service. The difference between customer satisfaction and passenger disutility is also discussed. The findings are expected to help conduct customer satisfaction surveys and also to form the basis for establishing a method by which to evaluate a train schedule from passengers' satisfaction ratings.

Computer-based irrigation scheduling for cotton crop

International Nuclear Information System (INIS)

Laghari, K.Q.; Memon, H.M.

2008-01-01

In this study a real time irrigation schedule for cotton crop has been tested using mehran model, a computer-based DDS (Decision Support System). The irrigation schedule was set on selected MAD (Management Allowable Depletion) and the current root depth position. The total 451 mm irrigation water applied to the crop field. The seasonal computed crop ET (Evapotranspiration) was estimated 421.32 mm and actual (ET/sub ca/) observed was 413 mm. The model over-estimated seasonal ET by only 1.94. WUE (Water Use Efficiency) for seed-cotton achieved 6.59 Kg (ha mm)/sup -1/. The statistical analysis (R/sup 2/=0.96, ARE%=2.00, T-1.17 and F=550.57) showed good performance of the model in simulated and observed ET values. The designed Mehran model is designed quite versatile for irrigation scheduling and can be successfully used as irrigation DSS tool for various crop types. (author)

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.

NASA scheduling technologies

Science.gov (United States)

Adair, Jerry R.

1994-01-01

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

Optimisation-Based Solution Methods for Set Partitioning Models

DEFF Research Database (Denmark)

Rasmussen, Matias Sevel

The scheduling of crew, i.e. the construction of work schedules for crew members, is often not a trivial task, but a complex puzzle. The task is complicated by rules, restrictions, and preferences. Therefore, manual solutions as well as solutions from standard software packages are not always su......_cient with respect to solution quality and solution time. Enhancement of the overall solution quality as well as the solution time can be of vital importance to many organisations. The _elds of operations research and mathematical optimisation deal with mathematical modelling of di_cult scheduling problems (among...... other topics). The _elds also deal with the development of sophisticated solution methods for these mathematical models. This thesis describes the set partitioning model which has been widely used for modelling crew scheduling problems. Integer properties for the set partitioning model are shown...

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.

Compositional schedulability analysis of real-time actor-based systems.

Science.gov (United States)

Jaghoori, Mohammad Mahdi; de Boer, Frank; Longuet, Delphine; Chothia, Tom; Sirjani, Marjan

2017-01-01

We present an extension of the actor model with real-time, including deadlines associated with messages, and explicit application-level scheduling policies, e.g.,"earliest deadline first" which can be associated with individual actors. Schedulability analysis in this setting amounts to checking whether, given a scheduling policy for each actor, every task is processed within its designated deadline. To check schedulability, we introduce a compositional automata-theoretic approach, based on maximal use of model checking combined with testing. Behavioral interfaces define what an actor expects from the environment, and the deadlines for messages given these assumptions. We use model checking to verify that actors match their behavioral interfaces. We extend timed automata refinement with the notion of deadlines and use it to define compatibility of actor environments with the behavioral interfaces. Model checking of compatibility is computationally hard, so we propose a special testing process. We show that the analyses are decidable and automate the process using the Uppaal model checker.

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

Science.gov (United States)

2010-07-22

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

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

Science.gov (United States)

Richards, Stephen F.

1991-01-01

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

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

Science.gov (United States)

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

2018-06-12

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

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

Science.gov (United States)

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

2016-01-01

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

Scheduling technicians and tasks in a telecommunications company

DEFF Research Database (Denmark)

Cordeau, J. F.; Laporte, G.; Pasin, F.

2010-01-01

This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunications company. This problem was solved within the framework of the 2007 challenge set up by the French Operational Research...

Controlling the temperature in Canadian homes

International Nuclear Information System (INIS)

Dewis, G.

2008-01-01

Programmable thermostats can be used to optimize the operation of heating and cooling systems by reducing system usage when occupants are asleep or when dwellings are unoccupied. This paper used the results of a 2006 households and the environment survey to examine how programmable thermostats are currently being used in Canadian households. The demographic factors associated with thermostat use were discussed, as well as how their usage varied in different areas of Canada. The study showed that most Canadian households set their temperature at between 20 to 22 degrees C during times when they are home and awake. Home temperatures were reduced to between 16 and 18 degrees C when household members were away or asleep. Only 4 out of 10 households used programmable thermostats. Of those who used programmable thermostats, only 7 in 10 programmed the thermostat to lower the temperature when occupants were asleep. Senior citizens and people with lower levels of education were less likely to use programmable thermostats. It was concluded that incentive programs and the distribution of free programmable thermostats will increase their use in households. Assistance in programming during the installation process should also be provided. Factor analyses must also be conducted to examine the influence of age, education, and income and the decisions made by households in relation to temperature regulation. 7 tabs

Runway Scheduling Using Generalized Dynamic Programming

Science.gov (United States)

Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

2011-01-01

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

42 CFR 415.172 - Physician fee schedule payment for services of teaching physicians.

Science.gov (United States)

2010-10-01

... teaching physicians. 415.172 Section 415.172 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES... PROVIDERS, SUPERVISING PHYSICIANS IN TEACHING SETTINGS, AND RESIDENTS IN CERTAIN SETTINGS Physician Services in Teaching Settings § 415.172 Physician fee schedule payment for services of teaching physicians. (a...

Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

Directory of Open Access Journals (Sweden)

Long Wan

2015-01-01

Full Text Available This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time.

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

NARCIS (Netherlands)

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

2010-01-01

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

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

OpenAIRE

木内, 正光

2010-01-01

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

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

Science.gov (United States)

Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

2017-10-01

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

Using Multiple Schedules during Functional Communication Training to Promote Rapid Transfer of Treatment Effects

Science.gov (United States)

Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.

2015-01-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and…

Schedule-dependency of doxorubicin and vinblastine in EAT tumours in mice

International Nuclear Information System (INIS)

Auersperg, M.; Pogacnik, A.; Kloboves-Prevodnik, V.; Sersa, G.; Cemazar, M.

2006-01-01

Background. Antitumour schedule-dependency of the doxorubicin and vinblastine combination was explored. Materials and methods. Intraperitoneal Ehrlich ascites tumours (EAT) syngeneic to CBA mice were treated with vinblastine or doxorubicin alone, or in combined treatment schedules. Results. Combinations of doxorubicin and vinblastine administered at 48-h, but not at 24-h interval, regardless of the sequence of drugs, significantly reduced the number of tumour cells in the ascites in comparison with all other treatments. In the combined treatment schedules, the predominant morphological changes as well as DNA distribution pattern were dependent on the first drug applied. Regardless of the sequence of the drugs, median survival times of animals did not significantly differ between the treatment groups. Conclusions. The effect of combination of vinblastine and doxorubicin is schedule-dependent. The time interval, but not the sequence of drugs seems to be crucial for the observed effect. The data from preclinical studies are important for planning combined treatment schedules in clinical setting. (author)

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.

Portable Microplate Analyzer with a Thermostatic Chamber Based on a Smartphone for On-site Rapid Detection.

Science.gov (United States)

Wan, Zijian; Zhong, Longjie; Pan, Yuxiang; Li, Hongbo; Zou, Quchao; Su, Kaiqi; Wang, Ping

2017-01-01

A microplate method provides an efficient way to use modern detection technology. However, there are some difficulties concerning on-site detection, such as being non-portable and time-consuming. In this work, a novel portable microplate analyzer with a thermostatic chamber based on a smartphone was designed for rapid on-site detection. An analyzer with a wide-angle lens and an optical filter provides a proper environment for the microplate. A smartphone app-iPlate Monitor was used for RGB analyze of image. After a consistency experiment with a microtiter plate reader (MTPR), the normalized calibration curves were y = 0.7276x + 0.0243 (R 2 = 0.9906) and y = 0.3207x + 0.0094 (R 2 = 0.9917) with a BCA protein kit as well as y = 0.182x + 0.0134 (R 2 = 0.994) and y = 0.0674x + 0.0003 (R 2 = 0.9988) with a glucose kit. The times for obtaining the detection requirement were 15 and 10 min for the BCA protein kit and the glucose kit at 37°C; in contrast, it required more than 30 and 20 min at ambient temperature. Meanwhile, it also showed good repeatability for detections.

Optimizing Unmanned Aircraft System Scheduling

Science.gov (United States)

2008-06-01

ASC-U uses a deterministic algorithm to optimize over a given finite time horizon to obtain near-optimal UAS mission area assignments. ASC-U...the details of the algorithm . We set an upper bound on the total number of schedules that can be generated, so as not to create unsolvable ILPs. We...COL_MISSION_NAME)) If Trim( CStr (rMissions(iRow, COL_MISSION_REQUIRED))) <> "" Then If CLng(rMissions(iRow, COL_MISSION_REQUIRED)) > CLng

WCET Analysis for Preemptive Scheduling

OpenAIRE

Altmeyer, Sebastian; Gebhard, Gernot

2008-01-01

Hard real-time systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it gets even more complex if tasks are scheduled preemptively -- especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compu...

Design Principles and Algorithms for Air Traffic Arrival Scheduling

Science.gov (United States)

Erzberger, Heinz; Itoh, Eri

2014-01-01

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

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

Science.gov (United States)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Treating Non-Retentive Encopresis with Rewarded Scheduled Toilet Visits

Science.gov (United States)

Boles, Richard E; Roberts, Michael C; Vernberg, Eric M

2008-01-01

We evaluated the effects of rewarded scheduled toilet sits on non-retentive encopretic behavior of an elementary-school student receiving services for serious emotional disturbance. A multidisciplinary team implemented the 8-week intervention using a multiple baseline across settings design. The results showed an increase in sitting on the toilet and a decline in encopretic episodes in both school and home settings. These findings support the use of a behavioral intervention for children with significant behavioral disorders within a classroom setting. PMID:22477690

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.

Web Publishing Schedule

Science.gov (United States)

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

The complexity of scheduling trees with communication delays

NARCIS (Netherlands)

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

1996-01-01

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

Freight railway operator timetabling and engine scheduling

DEFF Research Database (Denmark)

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

2015-01-01

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

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

Science.gov (United States)

Majerowicz, Walt; Shinn, Stephen A.

2016-01-01

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

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

Directory of Open Access Journals (Sweden)

Sean Yaw

2017-10-01

Full Text Available This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

Energy conservation in refrigerating machines by combining of thermo-static expansion valve and interior heat transfer material; Energieeinsparung in Kaelteanlagen durch Kombination von thermostatischem Expansionsventil und innerem Waermeuebertrager

Energy Technology Data Exchange (ETDEWEB)

Tambovtsev, Alexander

2007-12-15

The invention of the refrigerating machine enables to generate cold energy in any needed amount and at any desired temperature. However, cold energy generation requires driving energy. The target of this dissertation is to reduce the energy consumption of refrigerating plants considerably by means of an intelligent combination of the thermo-static expansion valve and the interior heat transfer medium. This combination should not deteriorate the reliability nor incur additional costs. Until today the two known components thermo-static expansion valve and interior heat transfer medium are considered as incompatible, because the simple connection of both components leads to an unstable control behaviour. After a detailed analysis of the causes for this instability the hypothesis is made, a stable working area can be found by means of a deliberate ''deterioration'' of the internal heat transfer medium. This ''deterioration'' can be e.g. a bypass of a part of the high-pressure flow or a parallel flow arrangement of the flows in the heat transfer medium. This hypothesis was primarily proved by experiments, but also by simulation calculations. A test stand was set-up for this purpose, which was used to test various configurations and control strategies. A considerable reduction of the energy consumption compared to conventional arrangements was achieved. (orig.) [German] Die Erfindung der Kaeltemaschine macht es moeglich, dass heute zu beliebiger Zeit Kaelte in benoetigter Menge und gewuenschter Temperatur erzeugt werden kann. Aber fuer die Kaelteerzeugung braucht man Antriebsenergie. Das Ziel dieser Doktorarbeit besteht darin, mit einer intelligenten Kombination von thermostatischem Expansionsventil (TEV) und innerem Waermeuebertrager (IWUe) den Energieverbrauch von Kaelteanlagen deutlich zu verringern, ohne dass dies zu einer Verschlechterung der Zuverlaessigkeit oder wesentlichen Mehrkosten fuehrt. Bis heute gelten die beiden

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

Science.gov (United States)

Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.

2012-01-01

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

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

Science.gov (United States)

2010-07-01

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

ATLAS construction schedule

CERN Multimedia

Kotamaki, M

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

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Directory of Open Access Journals (Sweden)

Angela Hsiang-Ling Chen

2014-09-01

Full Text Available Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP, a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC—an effective and powerful meta-heuristic—to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every

A new genetic algorithm for flexible job-shop scheduling problems

International Nuclear Information System (INIS)

Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia

2015-01-01

Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

A new genetic algorithm for flexible job-shop scheduling problems

Energy Technology Data Exchange (ETDEWEB)

Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia [University of Batna, Batna (Algeria)

2015-03-15

Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

A hybrid approach for minimizing makespan in permutation flowshop scheduling

DEFF Research Database (Denmark)

Govindan, Kannan; Balasundaram, R.; Baskar, N.

2017-01-01

This work proposes a hybrid approach for solving traditional flowshop scheduling problems to reduce the makespan (total completion time). To solve scheduling problems, a combination of Decision Tree (DT) and Scatter Search (SS) algorithms are used. Initially, the DT is used to generate a seed...... solution which is then given input to the SS to obtain optimal / near optimal solutions of makespan. The DT used the entropy function to convert the given problem into a tree structured format / set of rules. The SS provides an extensive investigation of the search space through diversification...

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

Directory of Open Access Journals (Sweden)

Chih-Yu Wen

2009-05-01

Full Text Available This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

Science.gov (United States)

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

An adaptive large neighborhood search heuristic for the pickup and delivery problem with time Windows and scheduled lines

NARCIS (Netherlands)

Ghilas, V.; Demir, E.; van Woensel, T.

2016-01-01

The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) concerns scheduling a set of vehicles to serve freight requests such that a part of the journey can be carried out on a scheduled public transportation line. Due to the complexity of the problem, which is NP-hard, we

Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

A microeconomic scheduler for parallel computers

Science.gov (United States)

Stoica, Ion; Abdel-Wahab, Hussein; Pothen, Alex

1995-01-01

We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

The Effects of Two Scheduling Formats on Student Achievement in a Suburban High School Setting

Science.gov (United States)

Jackson, Kenyada Morton

2013-01-01

Limited studies have been conducted on the relationship between scheduling formats and academic performance of high school students. At the target high school, students underperform on standardized tests in English language arts (ELA) and math. The purpose of this causal comparative quantitative study was to compare the means of ELA and math test…

Proposed algorithm to improve job shop production scheduling using ant colony optimization method

Science.gov (United States)

Pakpahan, Eka KA; Kristina, Sonna; Setiawan, Ari

2017-12-01

This paper deals with the determination of job shop production schedule on an automatic environment. On this particular environment, machines and material handling system are integrated and controlled by a computer center where schedule were created and then used to dictate the movement of parts and the operations at each machine. This setting is usually designed to have an unmanned production process for a specified interval time. We consider here parts with various operations requirement. Each operation requires specific cutting tools. These parts are to be scheduled on machines each having identical capability, meaning that each machine is equipped with a similar set of cutting tools therefore is capable of processing any operation. The availability of a particular machine to process a particular operation is determined by the remaining life time of its cutting tools. We proposed an algorithm based on the ant colony optimization method and embedded them on matlab software to generate production schedule which minimize the total processing time of the parts (makespan). We test the algorithm on data provided by real industry and the process shows a very short computation time. This contributes a lot to the flexibility and timelines targeted on an automatic environment.

Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling

OpenAIRE

Albers , Karsten; Slomka , Frank

2005-01-01

Submitted on behalf of EDAA (http://www.edaa.com/); International audience; This paper presents new fast exact feasibility tests for uniprocessor real-time systems using preemptive EDF scheduling. Task sets which are accepted by previously described sufficient tests will be evaluated in nearly the same time as with the old tests by the new algorithms. Many task sets are not accepted by the earlier tests despite them beeing feasible. These task sets will be evaluated by the new algorithms a lo...

Robust design method and thermostatic experiment for multiple piezoelectric vibration absorber system

International Nuclear Information System (INIS)

Nambu, Yohsuke; Takashima, Toshihide; Inagaki, Akiya

2015-01-01

This paper examines the effects of connecting multiplexing shunt circuits composed of inductors and resistors to piezoelectric transducers so as to improve the robustness of a piezoelectric vibration absorber (PVA). PVAs are well known to be effective at suppressing the vibration of an adaptive structure; their weakness is low robustness to changes in the dynamic parameters of the system, including the main structure and the absorber. In the application to space structures, the temperature-dependency of capacitance of piezoelectric ceramics is the factor that causes performance reduction. To improve robustness to the temperature-dependency of the capacitance, this paper proposes a multiple-PVA system that is composed of distributed piezoelectric transducers and several shunt circuits. The optimization problems that determine both the frequencies and the damping ratios of the PVAs are multi-objective problems, which are solved using a real-coded genetic algorithm in this paper. A clamped aluminum beam with four groups of piezoelectric ceramics attached was considered in simulations and experiments. Numerical simulations revealed that the PVA systems designed using the proposed method had tolerance to changes in the capacitances. Furthermore, experiments using a thermostatic bath were conducted to reveal the effectiveness and robustness of the PVA systems. The maximum peaks of the transfer functions of the beam with the open circuit, the single-PVA system, the double-PVA system, and the quadruple-PVA system at 20 °C were 14.3 dB, −6.91 dB, −7.47 dB, and −8.51 dB, respectively. The experimental results also showed that the multiple-PVA system is more robust than a single PVA in a variable temperature environment from −10 °C to 50 °C. In conclusion, the use of multiple PVAs results in an effective, robust vibration control method for adaptive structures. (paper)

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

Long-term generation scheduling of Xiluodu and Xiangjiaba cascade hydro plants considering monthly streamflow forecasting error

International Nuclear Information System (INIS)

Xie, Mengfei; Zhou, Jianzhong; Li, Chunlong; Zhu, Shuang

2015-01-01

Highlights: • Monthly streamflow forecasting error is considered. • An improved parallel progressive optimality algorithm is proposed. • Forecasting dispatching chart is manufactured accompanying with a set of rules. • Applications in Xiluodu and Xiangjiaba cascade hydro plants. - Abstract: Reliable streamflow forecasts are very significant for reservoir operation and hydropower generation. But for monthly streamflow forecasting, the forecasting result is unreliable and it is hard to be utilized, although it has a certain reference value for long-term hydro generation scheduling. Current researches mainly focus on deterministic scheduling, and few of them consider the uncertainties. So this paper considers the forecasting error which exists in monthly streamflow forecasting and proposes a new long-term hydro generation scheduling method called forecasting dispatching chart for Xiluodu and Xiangjiaba cascade hydro plants. First, in order to consider the uncertainties of inflow, Monte Carlo simulation is employed to generate streamflow data according to the forecasting value and error distribution curves. Then the large amount of data obtained by Monte Carlo simulation is used as inputs for long-term hydro generation scheduling model. Because of the large amount of streamflow data, the computation speed of conventional algorithm cannot meet the demand. So an improved parallel progressive optimality algorithm is proposed to solve the long-term hydro generation scheduling problem and a series of solutions are obtained. These solutions constitute an interval set, unlike the unique solution in the traditional deterministic long-term hydro generation scheduling. At last, the confidence intervals of the solutions are calculated and forecasting dispatching chart is proposed as a new method for long-term hydro generation scheduling. A set of rules are proposed corresponding to forecasting dispatching chart. The chart is tested for practical operations and achieves

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

Routing and scheduling of hazardous materials shipments: algorithmic approaches to managing spent nuclear fuel transport

International Nuclear Information System (INIS)

Cox, R.G.

1984-01-01

Much controversy surrounds government regulation of routing and scheduling of Hazardous Materials Transportation (HMT). Increases in operating costs must be balanced against expected benefits from local HMT bans and curfews when promulgating or preempting HMT regulations. Algorithmic approaches for evaluating HMT routing and scheduling regulatory policy are described. A review of current US HMT regulatory policy is presented to provide a context for the analysis. Next, a multiobjective shortest path algorithm to find the set of efficient routes under conflicting objectives is presented. This algorithm generates all efficient routes under any partial ordering in a single pass through the network. Also, scheduling algorithms are presented to estimate the travel time delay due to HMT curfews along a route. Algorithms are presented assuming either deterministic or stochastic travel times between curfew cities and also possible rerouting to avoid such cities. These algorithms are applied to the case study of US highway transport of spent nuclear fuel from reactors to permanent repositories. Two data sets were used. One data set included the US Interstate Highway System (IHS) network with reactor locations, possible repository sites, and 150 heavily populated areas (HPAs). The other data set contained estimates of the population residing with 0.5 miles of the IHS and the Eastern US. Curfew delay is dramatically reduced by optimally scheduling departure times unless inter-HPA travel times are highly uncertain. Rerouting shipments to avoid HPAs is a less efficient approach to reducing delay

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.

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

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

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

Science.gov (United States)

Butt, Muhammad Arif; Akram, Muhammad

2016-01-01

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

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

Uncertainty management by relaxation of conflicting constraints in production process scheduling

Science.gov (United States)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

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

Schedule goals for civilian radioactive waste management - Can we have confidence?

International Nuclear Information System (INIS)

Bartlett, John W.

1992-01-01

The schedule goals for the Civilian Radioactive Waste Management Program are to begin spent fuel receipt from reactors in 1998 and to begin waste disposal in 2010. Although there are various reasons for these goals, the most important is to set demanding goals and be responsible for achieving them. Meeting these goals requires taking into account an array of facilitators and potential inhibitors that affect schedule confidence. Facilitators include actions to prioritize the program, and make its operations efficient. These include actions to baseline activities, emphasize communications with constituencies, use help from others, and facilitate the licensing process. Inhibitors include problems in monitored storage facilities negotiations, obstruction by the State of Nevada, funding deficiencies, and technical uncertainties at Yucca Mountain. At the present time, the program can, in principle meet its schedule goals. In the near-term, the linchpin of schedule confidence is Congressional action to match the Administration's commitment to progress. (author)

Radioactive Waste Management System: Draft Project Decision Schedule. Revision

International Nuclear Information System (INIS)

1985-07-01

The Nuclear Waste Policy Act (NWPA) of 1982 (Pub. L. 97-425) requires that the Secretary of Energy prepare, in cooperation with affected Federal agencies, a Project Decision Schedule that portrays the optimum way to attain the operation of geologic repositories. The Draft Project Decision Schedule portrays the major milestones of the Radioactive Waste Management System. It also depicts the set of activities for which Federal agencies have responsibility and the deadlines for taking the required action that are associated with the activities. The NWPA also requires that Federal agencies having determined that they: (1) cannot comply with a deadline for taking a required action; or (2) fail to comply with a deadline contained in the Project Decision Schedule; submit a comprehensive report to the Secretary of Energy and Congress to explain their failure or expected failure. The Secretary, in turn, is required to submit to Congress a response to the agency's report. 7 figs., 13 tabs

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

Planning and Scheduling for Environmental Sensor Networks

Science.gov (United States)

Frank, J. D.

2005-12-01

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

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

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

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Kosar, Tevfik

2010-05-20

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

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

Directory of Open Access Journals (Sweden)

Lavy Libman

2012-11-01

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

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

A Modeling Framework for Schedulability Analysis of Distributed Avionics Systems

DEFF Research Database (Denmark)

Han, Pujie; Zhai, Zhengjun; Nielsen, Brian

2018-01-01

This paper presents a modeling framework for schedulability analysis of distributed integrated modular avionics (DIMA) systems that consist of spatially distributed ARINC-653 modules connected by a unified AFDX network. We model a DIMA system as a set of stopwatch automata (SWA) in UPPAAL...

Harnessing the flexibility of thermostatic loads in microgrids with Solar Power Generation

NARCIS (Netherlands)

Morales González, R.; Shariat Torbaghan, S.; Gibescu, M.; Cobben, S.

2016-01-01

This paper presents a demand response (DR) framework that intertwines thermodynamic building models with a genetic algorithm (GA)-based optimization method. The framework optimizes heating/cooling schedules of end-users inside a business park microgrid with local distributed generation from

Automated Scheduling Via Artificial Intelligence

Science.gov (United States)

Biefeld, Eric W.; Cooper, Lynne P.

1991-01-01

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

Schedule Analytics

Science.gov (United States)

2016-04-30

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

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1992-03-01

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

Flexibility Driven Scheduling and Mapping for Distributed Real-Time Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2002-01-01

In this paper we present an approach to mapping and scheduling of distributed hard real-time systems, aiming at improving the flexibility of the design process. We consider an incremental design process that starts from an already existing system running a set of applications, with preemptive...

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

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

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

Optimal imaging surveillance schedules after liver-directed therapy for hepatocellular carcinoma.

Science.gov (United States)

Boas, F Edward; Do, Bao; Louie, John D; Kothary, Nishita; Hwang, Gloria L; Kuo, William T; Hovsepian, David M; Kantrowitz, Mark; Sze, Daniel Y

2015-01-01

To optimize surveillance schedules for the detection of recurrent hepatocellular carcinoma (HCC) after liver-directed therapy. New methods have emerged that allow quantitative analysis and optimization of surveillance schedules for diseases with substantial rates of recurrence such as HCC. These methods were applied to 1,766 consecutive chemoembolization, radioembolization, and radiofrequency ablation procedures performed on 910 patients between 2006 and 2011. Computed tomography or magnetic resonance imaging performed just before repeat therapy was set as the time of "recurrence," which included residual and locally recurrent tumor as well as new liver tumors. Time-to-recurrence distribution was estimated by Kaplan-Meier method. Average diagnostic delay (time between recurrence and detection) was calculated for each proposed surveillance schedule using the time-to-recurrence distribution. An optimized surveillance schedule could then be derived to minimize the average diagnostic delay. Recurrence is 6.5 times more likely in the first year after treatment than in the second. Therefore, screening should be much more frequent in the first year. For eight time points in the first 2 years of follow-up, the optimal schedule is 2, 4, 6, 8, 11, 14, 18, and 24 months. This schedule reduces diagnostic delay compared with published schedules and is cost-effective. The calculated optimal surveillance schedules include shorter-interval follow-up when there is a higher probability of recurrence and longer-interval follow-up when there is a lower probability. Cost can be optimized for a specified acceptable diagnostic delay or diagnostic delay can be optimized within a specified acceptable cost. Copyright © 2015 SIR. Published by Elsevier Inc. All rights reserved.

Gaussian variable neighborhood search for the file transfer scheduling problem

Directory of Open Access Journals (Sweden)

Dražić Zorica

2016-01-01

Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

An original accelerated radiotherapy schedule in stage III to IV head and neck cancers. Results in a multicenter setting

Energy Technology Data Exchange (ETDEWEB)

Allal, A.S. [Geneva Univ. Hospital (Switzerland). Div. of Radiation Oncology; Monney, M.; Rosset, A.; Ozsahin, M. [Hopital Cantonal Universitaire, Lausanne (Switzerland). Inst. de Radiographie; Guillemin, C. [Cantonal Radiotherapy Department Sion (Switzerland)

2000-01-01

Background: Accelerated radiotherapy delivery has recently been shown to be effective in overcoming repopulation during fractionated radiotherapy. The therapeutic ratio may be particularly favorable for 5-week regimens. This study reports the feasibility and results of a particular accelerated schedule in Stage III to IV head and neck carcinomas used in a multicenter setting. Patients and Methods: Seventy-four patients with Stage III (26 patients) or IV (48 patients) head and neck carcinomas were treated with a 5-week accelerated schedule (69.9 to 69.8 Gy in 41 to 40 fractions over a period of 35 to 36 days). Treatment began with 20 Gy in 10 daily fractions to initial involved sites, followed by bi-fractionated radiotherapy (2x1.6 Gy to 1.66 Gy/day) to a larger head and neck volume. Thirty-six (49%) patients received induction chemotherapy (median 3 cycles, range 1 to 4 cycles). Results: Grade 3 or 4 (RTOG) confluent mucositis was observed in 57 patients (77%) and Grade 3 dysphagia in 33 patients (44%). Grade 3 or 4 (RTOG-EORTC) late complications were scored in 10.5% of cases. The 5-year actuarial locoregional control rate was 56% (95% CI: 42 to 71). The 5-year overall actuarial survival was 32% (95% CI: 18 to 46). Induction chemotherapy was not associated with a more favorable outcome. Conclusions: This study demonstrates the feasibility of this schedule in a multicenter setting. The oncologic results appear similar to those obtained by other accelerated regimens, while the rate of late complications seems acceptable. Five-week accelerated regimens warrant further evaluation, particularly in conjunction with concomitant chemotherapy, in the framework of prospective trials. (orig.) [German] Hintergrund: Die Wirksamkeit der akzelerierten Bestrahlung in bezug auf die Bewaeltigung der Tumorzellrepopulation waehrend einer Radiotherapie ist vor kurzem nachgewiesen worden. Das Verhaeltnis zwischen therapeutischem Effekt und Toxizitaet duerfte fuer fuenfwoechige Schemen

Declarative Modeling for Production Order Portfolio Scheduling

Directory of Open Access Journals (Sweden)

Banaszak Zbigniew

2014-12-01

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

Fog computing job scheduling optimization based on bees swarm

Science.gov (United States)

Bitam, Salim; Zeadally, Sherali; Mellouk, Abdelhamid

2018-04-01

Fog computing is a new computing architecture, composed of a set of near-user edge devices called fog nodes, which collaborate together in order to perform computational services such as running applications, storing an important amount of data, and transmitting messages. Fog computing extends cloud computing by deploying digital resources at the premise of mobile users. In this new paradigm, management and operating functions, such as job scheduling aim at providing high-performance, cost-effective services requested by mobile users and executed by fog nodes. We propose a new bio-inspired optimization approach called Bees Life Algorithm (BLA) aimed at addressing the job scheduling problem in the fog computing environment. Our proposed approach is based on the optimized distribution of a set of tasks among all the fog computing nodes. The objective is to find an optimal tradeoff between CPU execution time and allocated memory required by fog computing services established by mobile users. Our empirical performance evaluation results demonstrate that the proposal outperforms the traditional particle swarm optimization and genetic algorithm in terms of CPU execution time and allocated memory.

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.

Cryptococcal meningitis management in Tanzania with strict schedule of serial lumber punctures using intravenous tubing sets: an operational research study.

Science.gov (United States)

Meda, John; Kalluvya, Samuel; Downs, Jennifer A; Chofle, Awilly A; Seni, Jeremiah; Kidenya, Benson; Fitzgerald, Daniel W; Peck, Robert N

2014-06-01

Cryptococcal meningitis (CM) has a mortality rate of ∼70% among HIV-infected adults in low-income countries. Controlling intracranial pressure (ICP) is essential in CM, but it is difficult in low-income countries because manometers and practical ICP management protocols are lacking. As part of a continuous quality improvement project, our Tanzanian hospital initiated a new protocol for ICP management for CM. All adult inpatients with CM are included in a prospective patient registry. At the time of analysis, this registry included data from 2 years before the initiation of this new ICP management protocol and for a 9-month period after. ICP was measured at baseline and at days 3, 7, and 14 by both manometer and intravenous (IV) tubing set. All patients were given IV fluconazole according to Tanzanian treatment guidelines and were followed until 30 days after admission. Among adult inpatients with CM, 32 of 35 patients (91%) had elevated ICP on admission. Cerebrospinal fluid pressure measurements using the improvised IV tubing set demonstrated excellent agreement (r = 0.96) with manometer measurements. Compared with historical controls, the new ICP management protocol was associated with a significant reduction in 30-day mortality (16/35 [46%] vs. 48/64 [75%] in historical controls; hazard ratio = 2.1 [95% CI: 1.1 to 3.8]; P = 0.018]. Increased ICP is almost universal among HIV-infected adults admitted with CM in Tanzania. Intensive ICP management with a strict schedule of serial lumbar punctures reduced in-hospital mortality compared with historical controls. ICP measurement with IV tubing sets may be a good alternative in resource-limited health facilities where manometers are not available.

Outage scheduling and implementation

International Nuclear Information System (INIS)

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

1986-01-01

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

Scheduling algorithms for saving energy and balancing load

Energy Technology Data Exchange (ETDEWEB)

Antoniadis, Antonios

2012-08-03

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

KASTOR – A VEHICLE AND CREW SCHEDULING SYSTEM FOR REGULAR BUS PASSENGER TRANSPORT

Directory of Open Access Journals (Sweden)

Stanislav PALÚCH

2017-04-01

Full Text Available The challenge in vehicle and crew scheduling is to arrange a given set of bus trips into running boards while minimizing certain objectives and complying with a given set of constraints. This scheduling was solved several tens years ago manually by a dispatcher who used his skill, experience, knowledge of history, and intuition. This attitude worked quite well in small instances but could not be applied in larger ones. Development of computers brought opportunities to build computerized vehicle and crew optimization systems. This paper describes a computer system KASTOR developed for vehicle and crew optimization, which complies with the special requirements of Czech and Slovak bus providers, and is significantly different from those in some west European countries.

The scheduling of tracking times for interplanetary spacecraft on the Deep Space Network

Science.gov (United States)

Webb, W. A.

1978-01-01

The Deep Space Network (DSN) is a network of tracking stations, located throughout the globe, used to track spacecraft for NASA's interplanetary missions. This paper describes a computer program, DSNTRAK, which provides an optimum daily tracking schedule for the DSN given the view periods at each station for a mission set of n spacecraft, where n is between 2 and 6. The objective function is specified in terms of relative total daily tracking time requirements between the n spacecraft. Linear programming is used to maximize the total daily tracking time and determine an optimal daily tracking schedule consistent with DSN station capabilities. DSNTRAK is used as part of a procedure to provide DSN load forecasting information for proposed future NASA mission sets.

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

Directory of Open Access Journals (Sweden)

Basar Ogun

2018-05-01

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

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

On the Integrated Job Scheduling and Constrained Network Routing Problem

DEFF Research Database (Denmark)

Gamst, Mette

This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...

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

Assessment of end-use electricity consumption and peak demand by Townsville's housing stock

International Nuclear Information System (INIS)

Ren, Zhengen; Paevere, Phillip; Grozev, George; Egan, Stephen; Anticev, Julia

2013-01-01

We have developed a comprehensive model to estimate annual end-use electricity consumption and peak demand of housing stock, considering occupants' use of air conditioning systems and major appliances. The model was applied to analyse private dwellings in Townsville, Australia's largest tropical city. For the financial year (FY) 2010–11 the predicted results agreed with the actual electricity consumption with an error less than 10% for cooling thermostat settings at the standard setting temperature of 26.5 °C and at 1.0 °C higher than the standard setting. The greatest difference in monthly electricity consumption in the summer season between the model and the actual data decreased from 21% to 2% when the thermostat setting was changed from 26.5 °C to 27.5 °C. Our findings also showed that installation of solar panels in Townville houses could reduce electricity demand from the grid and would have a minor impact on the yearly peak demand. A key new feature of the model is that it can be used to predict probability distribution of energy demand considering (a) that appliances may be used randomly and (b) the way people use thermostats. The peak demand for the FY estimated from the probability distribution tracked the actual peak demand at 97% confidence level. - Highlights: • We developed a model to estimate housing stock energy consumption and peak demand. • Appliances used randomly and thermostat settings for space cooling were considered. • On-site installation of solar panels was also considered. • Its' results agree well with the actual electricity consumption and peak demand. • It shows the model could provide the probability distribution of electricity demand

A hybrid algorithm for flexible job-shop scheduling problem with setup times

Directory of Open Access Journals (Sweden)

Ameni Azzouz

2017-01-01

Full Text Available Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA and variable neighbourhood search (VNS to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1982-07-01

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

Putting ROSE to Work: A Proposed Application of a Request-Oriented Scheduling Engine for Space Station Operations

Science.gov (United States)

Jaap, John; Muery, Kim

2000-01-01

Scheduling engines are found at the core of software systems that plan and schedule activities and resources. A Request-Oriented Scheduling Engine (ROSE) is one that processes a single request (adding a task to a timeline) and then waits for another request. For the International Space Station, a robust ROSE-based system would support multiple, simultaneous users, each formulating requests (defining scheduling requirements), submitting these requests via the internet to a single scheduling engine operating on a single timeline, and immediately viewing the resulting timeline. ROSE is significantly different from the engine currently used to schedule Space Station operations. The current engine supports essentially one person at a time, with a pre-defined set of requirements from many payloads, working in either a "batch" scheduling mode or an interactive/manual scheduling mode. A planning and scheduling process that takes advantage of the features of ROSE could produce greater customer satisfaction at reduced cost and reduced flow time. This paper describes a possible ROSE-based scheduling process and identifies the additional software component required to support it. Resulting changes to the management and control of the process are also discussed.

Alertness management : strategic naps in operational settings

Science.gov (United States)

1995-01-01

Managing fatigue in complex operational settings requires attention to multiple factors, including hours of service, scheduling, education and training, countermeasures, technology, and research. Alertness-management strategies can be used to promote...

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

OpenAIRE

Pérez González, Paz; Framiñán Torres, José Manuel

2009-01-01

In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availabi...

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

International Nuclear Information System (INIS)

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

2009-01-01

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

Scheduling Algorithms for Maximizing Throughput with Zero-Forcing Beamforming in a MIMO Wireless System

Science.gov (United States)

Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Energy Technology Data Exchange (ETDEWEB)

Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.; Catalyurek, Umit V.; Kurc, Tahsin; Sadayappan, Ponnuswamy; Saltz, Joel H.

2009-08-01

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

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

Directory of Open Access Journals (Sweden)

Michael Short

2017-07-01

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

A Hybrid Scheduler for Many Task Computing in Big Data Systems

Directory of Open Access Journals (Sweden)

Vasiliu Laura

2017-06-01

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

DEVELOPMENT OF GENETIC ALGORITHM-BASED METHODOLOGY FOR SCHEDULING OF MOBILE ROBOTS

DEFF Research Database (Denmark)

Dang, Vinh Quang

problem is to minimize the total traveling time of the single mobile robot and thereby increase its availability. For the second scheduling problem, a fleet of mobile robots is considered together with a set of machines to carry out different types of tasks, e.g. pre-assembly or quality inspection. Some...... problem and finding optimal solutions for each one. However, the formulated mathematical models could only be applicable to small-scale problems in practice due to the significant increase of computation time as the problem size grows. Note that making schedules of mobile robots is part of real-time....... For the first scheduling problem, a single mobile robot is considered to collect and transport container of parts and empty them into machine feeders where needed. A limit on carrying capacity of the single mobile robot and hard time windows of part-feeding tasks are considered. The objective of the first...

Development of Fault Models for Hybrid Fault Detection and Diagnostics Algorithm: October 1, 2014 -- May 5, 2015

Energy Technology Data Exchange (ETDEWEB)

Cheung, Howard [Purdue Univ., West Lafayette, IN (United States); Braun, James E. [Purdue Univ., West Lafayette, IN (United States)

2015-12-31

This report describes models of building faults created for OpenStudio to support the ongoing development of fault detection and diagnostic (FDD) algorithms at the National Renewable Energy Laboratory. Building faults are operating abnormalities that degrade building performance, such as using more energy than normal operation, failing to maintain building temperatures according to the thermostat set points, etc. Models of building faults in OpenStudio can be used to estimate fault impacts on building performance and to develop and evaluate FDD algorithms. The aim of the project is to develop fault models of typical heating, ventilating and air conditioning (HVAC) equipment in the United States, and the fault models in this report are grouped as control faults, sensor faults, packaged and split air conditioner faults, water-cooled chiller faults, and other uncategorized faults. The control fault models simulate impacts of inappropriate thermostat control schemes such as an incorrect thermostat set point in unoccupied hours and manual changes of thermostat set point due to extreme outside temperature. Sensor fault models focus on the modeling of sensor biases including economizer relative humidity sensor bias, supply air temperature sensor bias, and water circuit temperature sensor bias. Packaged and split air conditioner fault models simulate refrigerant undercharging, condenser fouling, condenser fan motor efficiency degradation, non-condensable entrainment in refrigerant, and liquid line restriction. Other fault models that are uncategorized include duct fouling, excessive infiltration into the building, and blower and pump motor degradation.

Lixiviation of heavy metals of hazardous industrial wastes by means of thermostatized columns and design of a pilot plant

International Nuclear Information System (INIS)

Vite T, J.; Leon, C.C. de; Vite T, M.; Soto T, J.L.

2006-01-01

The purpose of this work was to evaluate the efficiency of lixiviation of heavy metals, using thermostatized columns and hazardous industrial residual wastes: those by the volume with which are generated and its high toxicity, its represent a great problem for it treatment and disposition, in this work a diagram of a pilot plant for extraction of heavy metals is included. The process and equipment were patented in United States and in Mexico. For the development of this study four thermostated columns were used that were coupled. The waste were finely milled and suspended in an aqueous pulp adding of 10 - 40gL -1 of mineral acid or sodium hydroxide until reaching an interval of pH of 2,5,7 and 10. Its were used of 4-10 gL -1 of a reducer agent and of 0.3-1.5 g of a surfactant agent. In some cases with this method was possible to remove until 100% of heavy metals. It was used Plasma Emission Spectroscopy to determine the concentrations of the cations in the lixiviation liquors. For studying the metallic alloys the X-ray diffraction technique was used. (Author)

Assessment of the Correlation between Appointment Scheduling and Patient Satisfaction in a Pediatric Dental Setup

Directory of Open Access Journals (Sweden)

Amar N. Katre

2014-01-01

Full Text Available Introduction. The practice of modern pediatric dentistry requires delivery of quality care in combination with adherence to excellent business as well as time management principles. A definite appointment schedule should be presented to the parents on the first or second appointment. More importantly, the prescribed schedule should be followed to the best of the professional abilities of the pediatric dentist. Aims. The aim of the study was to assess the co-relation between appointment scheduling and patient satisfaction in a pediatric dental setup with the objective of understanding the parameters related to appointment scheduling to increase patient satisfaction. Method. A total of 40 patients, who visited the Department of Pediatric and Preventive Dentistry, YMT Dental College & Hospital, for dental treatment were selected on a random basis. A questionnaire with a set of 6 questions with a rating scale of 1–5 to assess the patient satisfaction related to appointment scheduling was prepared. Results. A significant number of the patients were happy with the existing appointment scheduling system barring a few exceptions.

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…

Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed

2015-12-01

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

Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

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

Congestion game scheduling for virtual drug screening optimization

Science.gov (United States)

Nikitina, Natalia; Ivashko, Evgeny; Tchernykh, Andrei

2018-02-01

In virtual drug screening, the chemical diversity of hits is an important factor, along with their predicted activity. Moreover, interim results are of interest for directing the further research, and their diversity is also desirable. In this paper, we consider a problem of obtaining a diverse set of virtual screening hits in a short time. To this end, we propose a mathematical model of task scheduling for virtual drug screening in high-performance computational systems as a congestion game between computational nodes to find the equilibrium solutions for best balancing the number of interim hits with their chemical diversity. The model considers the heterogeneous environment with workload uncertainty, processing time uncertainty, and limited knowledge about the input dataset structure. We perform computational experiments and evaluate the performance of the developed approach considering organic molecules database GDB-9. The used set of molecules is rich enough to demonstrate the feasibility and practicability of proposed solutions. We compare the algorithm with two known heuristics used in practice and observe that game-based scheduling outperforms them by the hit discovery rate and chemical diversity at earlier steps. Based on these results, we use a social utility metric for assessing the efficiency of our equilibrium solutions and show that they reach greatest values.

Approximating Preemptive Stochastic Scheduling

OpenAIRE

Megow Nicole; Vredeveld Tjark

2009-01-01

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

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

Science.gov (United States)

2017-10-26

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

Static Scheduling of Periodic Hardware Tasks with Precedence and Deadline Constraints on Reconfigurable Hardware Devices

Directory of Open Access Journals (Sweden)

Ikbel Belaid

2011-01-01

Full Text Available Task graph scheduling for reconfigurable hardware devices can be defined as finding a schedule for a set of periodic tasks with precedence, dependence, and deadline constraints as well as their optimal allocations on the available heterogeneous hardware resources. This paper proposes a new methodology comprising three main stages. Using these three main stages, dynamic partial reconfiguration and mixed integer programming, pipelined scheduling and efficient placement are achieved and enable parallel computing of the task graph on the reconfigurable devices by optimizing placement/scheduling quality. Experiments on an application of heterogeneous hardware tasks demonstrate an improvement of resource utilization of 12.45% of the available reconfigurable resources corresponding to a resource gain of 17.3% compared to a static design. The configuration overhead is reduced to 2% of the total running time. Due to pipelined scheduling, the task graph spanning is minimized by 4% compared to sequential execution of the graph.

Schedule-Aware Workflow Management Systems

Science.gov (United States)

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

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

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

Directory of Open Access Journals (Sweden)

Ann Medaille

2011-03-01

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

Improving Energy Saving Techniques by Ambient Intelligence Scheduling

DEFF Research Database (Denmark)

Cristani, Matteo; Karafili, Erisa; Tomazzoli, Claudio

2015-01-01

Energy saving is one of the most challenging aspects of modern ambient intelligence technologies, for both domestic and business usages. In this paper we show how to combine Ambient Intelligence and Artificial Intelligence techniques to solve the problem of scheduling a set of devices under a given...... for Ambient Intelligence to a specific framework and exhibit a sample usage for a real life system, Elettra, that is in use in an industrial context....

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

Self-scheduling with Microsoft Excel.

Science.gov (United States)

Irvin, S A; Brown, H N

1999-01-01

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

Optimization of the solution of the problem of scheduling theory ...

African Journals Online (AJOL)

This article describes the genetic algorithm used to solve the problem related to the scheduling theory. A large number of different methods is described in the scientific literature. The main issue that faced the problem in question is that it is necessary to search the optimal solution in a large search space for the set of ...

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

NARCIS (Netherlands)

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

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

Immunization Schedules for Adults

Science.gov (United States)

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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

Concurrent processes scheduling with scarce resources in small and medium enterprises

Institute of Scientific and Technical Information of China (English)

马嵩华

2016-01-01

Scarce resources , precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises (SMEs), which are deemed to block the ap-plication of workflow management system ( WfMS ) .To tackle this problem , a workflow scheduling approach is proposed based on timing workflow net (TWF-net) and genetic algorithm (GA).The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking .After simplifying and reconstructing the set of workflow instance , the conflict resolution problem is transformed into a resource-constrained project scheduling problem ( RCPSP ) , which could be efficiently solved by a heuristic method , such as GA.Finally, problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-first-served ( FCFS) strategy.The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource con -straints .

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.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Directory of Open Access Journals (Sweden)

Meng-Hsun Tsai

Full Text Available Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP built on top of MultiPath TCP (MPTCP. CBSP enables users to buy bandwidth on demand from neighbors (called Helpers and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC, to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Science.gov (United States)

Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

BIM-BASED SCHEDULING OF CONSTRUCTION

DEFF Research Database (Denmark)

Andersson, Niclas; Büchmann-Slorup, Rolf

2010-01-01

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

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

Science.gov (United States)

Stottler, D.

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

Network scheduling at Belene NPP construction site

International Nuclear Information System (INIS)

Matveev, A.

2010-01-01

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

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

NARCIS (Netherlands)

Gracia, P.; Kalmijn, M.

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Giovanni Agosta

2005-01-01

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

Evolving from Planning and Scheduling to Real-Time Operations Support: Design Challenges

Science.gov (United States)

Marquez, Jessica J.; Ludowise, Melissa; McCurdy, Michael; Li, Jack

2010-01-01

Versions of Scheduling and Planning Interface for Exploration (SPIFe) have supported a variety of mission operations across NASA. This software tool has evolved and matured over several years, assisting planners who develop intricate schedules. While initially conceived for surface Mars missions, SPIFe has been deployed in other domains, where people rather than robotic explorers, execute plans. As a result, a diverse set of end-users has compelled growth in a new direction: supporting real-time operations. This paper describes the new needs and challenges that accompany this development. Among the key features that have been built for SPIFe are current time indicators integrated into the interface and timeline, as well as other plan attributes that enable execution of scheduled activities. Field tests include mission support for the Lunar CRater Observation and Sensing Satellite (LCROSS), NASA Extreme Environment Mission Operations (NEEMO) and Desert Research and Technology Studies (DRATS) campaigns.

The Home Care Crew Scheduling Problem:

DEFF Research Database (Denmark)

Rasmussen, Matias Sevel; Justesen, Tor; Dohn, Anders

In the Home Care Crew Scheduling Problem a staff of caretakers has to be assigned a number of visits to patients' homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time...... preference constraints. The algorithm is tested both on real-life problem instances and on generated test instances inspired by realistic settings. The use of the specialised branching scheme on real-life problems is novel. The visit clustering decreases run times significantly, and only gives a loss...... windows of the visits must be respected. The challenge when assigning visits to caretakers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits. We model the problem as a set partitioning problem with side constraints and develop an exact...

Multi-objective demand side scheduling considering the operational safety of appliances

International Nuclear Information System (INIS)

Du, Y.F.; Jiang, L.; Li, Y.Z.; Counsell, J.; Smith, J.S.

2016-01-01

Highlights: • Operational safety of appliances is introduced in multi-objective scheduling. • Relationships between operational safety and other objectives are investigated. • Adopted Pareto approach is compared with Weigh and Constraint approaches. • Decision making of Pareto approach is proposed for final appliances’ scheduling. - Abstract: The safe operation of appliances is of great concern to users. The safety risk increases when the appliances are in operation during periods when users are not at home or when they are asleep. In this paper, multi-objective demand side scheduling is investigated with consideration to the appliances’ operational safety together with the electricity cost and the operational delay. The formulation of appliances’ operational safety is proposed based on users’ at-home status and awake status. Then the relationships between the operational safety and the other two objectives are investigated through the approach of finding the Pareto-optimal front. Moreover, this approach is compared with the Weigh and Constraint approaches. As the Pareto-optimal front consists of a set of optimal solutions, this paper proposes a method to make the final scheduling decision based on the relationships among the multiple objectives. Simulation results demonstrate that the operational safety is improved with the sacrifice of the electricity cost and the operational delay, and that the approach of finding the Pareto-optimal front is effective in presenting comprehensive optimal solutions of the multi-objective demand side scheduling.

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

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

A multi-criteria model for maintenance job scheduling

Directory of Open Access Journals (Sweden)

Sunday A. Oke

2007-12-01

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

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

Directory of Open Access Journals (Sweden)

Yi Tang

2017-11-01

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

Conception of Self-Construction Production Scheduling System

Science.gov (United States)

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

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

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

KAUST Repository

Douik, Ahmed

2016-03-28

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

Range Scheduling Aid (RSA)

Science.gov (United States)

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

1991-01-01

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

Immunization Schedules for Infants and Children

Science.gov (United States)

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

A Formal Product-Line Engineering Approach for Schedulers

NARCIS (Netherlands)

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

2017-01-01

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

Robust and Flexible Scheduling with Evolutionary Computation

DEFF Research Database (Denmark)

Jensen, Mikkel T.

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

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Directory of Open Access Journals (Sweden)

Sivashan Chetty

2015-01-01

Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

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

Science.gov (United States)

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

2016-01-01

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

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

Science.gov (United States)

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

2016-11-04

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

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

International Nuclear Information System (INIS)

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

1993-07-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

1993-07-01

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

From Preemptive to Non-preemptive Scheduling Using Rejections

OpenAIRE

Lucarelli , Giorgio; Srivastav , Abhinav; Trystram , Denis

2016-01-01

International audience; We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platforms cannot be interrupted or migrated once they start their execution (due ...

Investigating the Effect of Voltage-Switching on Low-Energy Task Scheduling in Hard Real-Time Systems

Science.gov (United States)

2005-01-01

We investigate the effect of voltage-switching on task execution times and energy consumption for dual-speed hard real - time systems , and present a...scheduling algorithm and apply it to two real-life task sets. Our results show that energy can be conserved in embedded real - time systems using energy...aware task scheduling. We also show that switching times have a significant effect on the energy consumed in hard real - time systems .

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

Science.gov (United States)

2013-04-12

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

Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling

Directory of Open Access Journals (Sweden)

Tomáš Macák

2016-01-01

Full Text Available Time management has a crucial role in organizations and also in our personal lives. Managerial scheduling is an important tool for the time management, especially It can serve as a tool for the first phase, of time management - namely for effective planning. This paper focusses on finding the best possible setting for determining significant the best layout for activities according to the criteria of urgency and importance using a modified steepest ascent method, which can be referred as dynamic scheduling. This term indicates the nature of the method; wherein the experimental design space is changed to look for the best conditions for adjustment factors influencing a managerial process. Existing methods for layout optimization mentioned in the literature and conventionally implemented in practice have only shown local optima.

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

Prioritizing and scheduling Portsmouth Gaseous Diffusion Plant safeguards upgrades

International Nuclear Information System (INIS)

Edmunds, T.; Saleh, R.; Zevanove, S.

1992-02-01

As part of the Site Safeguards and Security Plan (SSSP), facilities are required to develop a Resource Plan (RP). The Resource Plan provides documentation and justification for the facility's planned upgrades, including the schedule, priority, and cost estimates for the safeguards and security upgrades. Portsmouth Gaseous Diffusion Plant (PORTS) management has identified and obtained funding approval for a number of safeguards and security upgrades, including line-item construction projects. These upgrade projects were selected to address a variety of concerns identified in the PORTS vulnerability assessments and other reviews performed in support of the SSSP process. However, budgeting and scheduling constraints do not make it possible to simultaneously begin implementation of all of the upgrade projects. A formal methodology and analysis are needed to explicitly address the trade-offs between competing safeguards objectives, and to prioritize and schedule the upgrade projects to ensure that the maximum benefit can be realized in the shortest possible time frame. The purpose of this report is to describe the methodology developed to support these upgrade project scheduling decisions. The report also presents the results obtained from applying the methodology to a set of the upgrade projects selected by PORTS S ampersand S management. Data for the analysis are based on discussions with personnel familiar with the PORTS safeguards and security needs, the requirements for implementing these upgrades, and upgrade funding limitations. The analysis results presented here assume continued highly enriched uranium (HEU) operations at PORTS. However, the methodology developed is readily adaptable for the evaluation of other operational scenarios and other resource allocation issues relevant to PORTS

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

The triangle scheduling problem

NARCIS (Netherlands)

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

2017-01-01

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

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

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

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

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance.

Science.gov (United States)

Carter, Christine E; Grahn, Jessica A

2016-01-01

, although results varied across raters. Participant questionnaires also revealed that the interleaved practice schedule had positive effects on factors such as goal setting, focus, and mistake identification. Taken together, these results suggest that an interleaved practice schedule may be a more effective practice strategy than continuous repetition in a music-learning context.

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

Science.gov (United States)

Carter, Christine E.; Grahn, Jessica A.

2016-01-01

, although results varied across raters. Participant questionnaires also revealed that the interleaved practice schedule had positive effects on factors such as goal setting, focus, and mistake identification. Taken together, these results suggest that an interleaved practice schedule may be a more effective practice strategy than continuous repetition in a music-learning context. PMID:27588014

Optimizing music learning: Exploring how blocked and interleaved practice schedules affect advanced performance

Directory of Open Access Journals (Sweden)

Christine E Carter

2016-08-01

better than those in the blocked schedule, although results varied across raters. Participant questionnaires also revealed that the interleaved practice schedule had positive effects on factors such as goal setting, focus, and mistake identification. Taken together, these results suggest that an interleaved practice schedule may be a more effective practice strategy than continuous repetition in a music-learning context.

Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

Directory of Open Access Journals (Sweden)

Różycki Rafał

2016-09-01

Full Text Available In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Swami Ananthram

2007-01-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Ananthram Swami

2007-12-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Setting conservation priorities.

Science.gov (United States)

Wilson, Kerrie A; Carwardine, Josie; Possingham, Hugh P

2009-04-01

A generic framework for setting conservation priorities based on the principles of classic decision theory is provided. This framework encapsulates the key elements of any problem, including the objective, the constraints, and knowledge of the system. Within the context of this framework the broad array of approaches for setting conservation priorities are reviewed. While some approaches prioritize assets or locations for conservation investment, it is concluded here that prioritization is incomplete without consideration of the conservation actions required to conserve the assets at particular locations. The challenges associated with prioritizing investments through time in the face of threats (and also spatially and temporally heterogeneous costs) can be aided by proper problem definition. Using the authors' general framework for setting conservation priorities, multiple criteria can be rationally integrated and where, how, and when to invest conservation resources can be scheduled. Trade-offs are unavoidable in priority setting when there are multiple considerations, and budgets are almost always finite. The authors discuss how trade-offs, risks, uncertainty, feedbacks, and learning can be explicitly evaluated within their generic framework for setting conservation priorities. Finally, they suggest ways that current priority-setting approaches may be improved.

Artificial intelligence approaches to astronomical observation scheduling

Science.gov (United States)

Johnston, Mark D.; Miller, Glenn

1988-01-01

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

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

The operational flight and multi-crew scheduling problem

Directory of Open Access Journals (Sweden)

Stojković Mirela

2005-01-01

Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

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

Alternative Work Schedules: Definitions

Science.gov (United States)

Journal of the College and University Personnel Association, 1977

1977-01-01

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

Tapping the energy storage potential in electric loads to deliver load following and regulation, with application to wind energy

International Nuclear Information System (INIS)

Callaway, Duncan S.

2009-01-01

This paper develops new methods to model and control the aggregated power demand from a population of thermostatically controlled loads, with the goal of delivering services such as regulation and load following. Previous work on direct load control focuses primarily on peak load shaving by directly interrupting power to loads. In contrast, the emphasis of this paper is on controlling loads to produce relatively short time scale responses (hourly to sub-hourly), and the control signal is applied by manipulation of temperature set points, possibly via programmable communicating thermostats or advanced metering infrastructure. To this end, the methods developed here leverage the existence of system diversity and use physically-based load models to inform the development of a new theoretical model that accurately predicts - even when the system is not in equilibrium - changes in load resulting from changes in thermostat temperature set points. Insight into the transient dynamics that result from set point changes is developed by deriving a new exact solution to a well-known hybrid state aggregated load model. The eigenvalues of the solution, which depend only on the thermal time constant of the loads under control, are shown to have a strong effect on the accuracy of the model. The paper also shows that load heterogeneity - generally something that must be assumed away in direct load control models - actually has a positive effect on model accuracy. System identification techniques are brought to bear on the problem, and it is shown that identified models perform only marginally better than the theoretical model. The paper concludes by deriving a minimum variance control law, and demonstrates its effectiveness in simulations wherein a population of loads is made to follow the output of a wind plant with very small changes in the nominal thermostat temperature set points.

Planning and Scheduling of Airline Operations

Directory of Open Access Journals (Sweden)

İlkay ORHAN

2010-02-01

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

A trial of scheduled deep brain stimulation for Tourette syndrome: moving away from continuous deep brain stimulation paradigms.

Science.gov (United States)

Okun, Michael S; Foote, Kelly D; Wu, Samuel S; Ward, Herbert E; Bowers, Dawn; Rodriguez, Ramon L; Malaty, Irene A; Goodman, Wayne K; Gilbert, Donald M; Walker, Harrison C; Mink, Jonathan W; Merritt, Stacy; Morishita, Takashi; Sanchez, Justin C

2013-01-01

To collect the information necessary to design the methods and outcome variables for a larger trial of scheduled deep brain stimulation (DBS) for Tourette syndrome. We performed a small National Institutes of Health-sponsored clinical trials planning study of the safety and preliminary efficacy of implanted DBS in the bilateral centromedian thalamic region. The study used a cranially contained constant-current device and a scheduled, rather than the classic continuous, DBS paradigm. Baseline vs 6-month outcomes were collected and analyzed. In addition, we compared acute scheduled vs acute continuous vs off DBS. A university movement disorders center. Five patients with implanted DBS. A 50% improvement in the Yale Global Tic Severity Scale (YGTSS) total score. RESULTS Participating subjects had a mean age of 34.4 (range, 28-39) years and a mean disease duration of 28.8 years. No significant adverse events or hardware-related issues occurred. Baseline vs 6-month data revealed that reductions in the YGTSS total score did not achieve the prestudy criterion of a 50% improvement in the YGTSS total score on scheduled stimulation settings. However, statistically significant improvements were observed in the YGTSS total score (mean [SD] change, -17.8 [9.4]; P=.01), impairment score (-11.3 [5.0]; P=.007), and motor score (-2.8 [2.2]; P=.045); the Modified Rush Tic Rating Scale Score total score (-5.8 [2.9]; P=.01); and the phonic tic severity score (-2.2 [2.6]; P=.04). Continuous, off, and scheduled stimulation conditions were assessed blindly in an acute experiment at 6 months after implantation. The scores in all 3 conditions showed a trend for improvement. Trends for improvement also occurred with continuous and scheduled conditions performing better than the off condition. Tic suppression was commonly seen at ventral (deep) contacts, and programming settings resulting in tic suppression were commonly associated with a subjective feeling of calmness. This study provides

Effects of Parent Implemented Visual Schedule Routines for African American Children with ASD in Low-Income Home Settings

Science.gov (United States)

Goldman, Samantha E.; Glover, Carrie A.; Lloyd, Blair P.; Barton, Erin E.; Mello, Maria P.

2018-01-01

Low-income, minority families are underrepresented in the literature on parent training for school-aged children with autism spectrum disorder (ASD). Although the use of visual supports, such as visual schedules, is considered to be an evidence-based practice for children with ASD in school, it is not known whether this strategy is effective for…

Technology for planning and scheduling under complex constraints

Science.gov (United States)

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

1997-02-01

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

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

Science.gov (United States)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1983-05-01

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

CMS multicore scheduling strategy

International Nuclear Information System (INIS)

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

2014-01-01

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

Synthesis of Communication Schedules for TTEthernet-Based Mixed-Criticality Systems

DEFF Research Database (Denmark)

Tamas-Selicean, Domitian; Pop, Paul; Steiner, Wilfried

2012-01-01

In this paper we are interested in safety-critical distributed systems, composed of heterogeneous processing elements interconnected using the TTEthernet protocol. We address hard real-time mixed-criticality applications, which may have different criticality levels, and we focus on the optimization...... be integrated onto the same architecture only if there is enough spatial and temporal separation among them. TTEthernet offers spatial separation for mixed-criticality messages through the concept of virtual links, and temporal separation, enforced through schedule tables for TT messages and bandwidth...... allocation for RC messages. Given the set of mixed-criticality messages in the system and the topology of the virtual links on which the messages are transmitted, we are interested to synthesize offline the static schedules for the TT messages, such that the deadlines for the TT and RC messages are satisfied...

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

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

Scheduling lessons learned from the Autonomous Power System

Science.gov (United States)

Ringer, Mark J.

1992-01-01

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

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

Learners’ Perceptions of the Effectiveness of Spaced Learning Schedule in L2 Vocabulary Learning

Directory of Open Access Journals (Sweden)

Amir Reza Lotfolahi

2016-05-01

Full Text Available The spacing effect is a ubiquitous phenomenon, whereby memory is enhanced for the information that is learned across different points in time rather than being learned at once. A considerable amount of research has focused on the nature of the spacing effect, and there is general acceptance that spacing learning events out in time promotes learning. However, fewer studies have been conducted in educational settings. The aim of this study is to explore learners’ perceptions of different spacing schedules (massed vs. spaced. To achieve the purpose of the study, we taught 30 children 24 English–Farsi word pairs utilizing different spacing schedules. Later, we administered a questionnaire to explore leaarners’ perceptions of both massed and spaced schedules. The results revealed that the children percieved spaced practice to be more effective than massed practice.

40 CFR 141.702 - Sampling schedules.

Science.gov (United States)

2010-07-01

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

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

Science.gov (United States)

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

2016-08-01

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

Routine environmental monitoring schedule, calendar year 1995

International Nuclear Information System (INIS)

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

1994-12-01

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

Extended precedence preservative crossover for job shop scheduling problems

Science.gov (United States)

Ong, Chung Sin; Moin, Noor Hasnah; Omar, Mohd

2013-04-01

Job shop scheduling problems (JSSP) is one of difficult combinatorial scheduling problems. A wide range of genetic algorithms based on the two parents crossover have been applied to solve the problem but multi parents (more than two parents) crossover in solving the JSSP is still lacking. This paper proposes the extended precedence preservative crossover (EPPX) which uses multi parents for recombination in the genetic algorithms. EPPX is a variation of the precedence preservative crossover (PPX) which is one of the crossovers that perform well to find the solutions for the JSSP. EPPX is based on a vector to determine the gene selected in recombination for the next generation. Legalization of children (offspring) can be eliminated due to the JSSP representation encoded by using permutation with repetition that guarantees the feasibility of chromosomes. The simulations are performed on a set of benchmarks from the literatures and the results are compared to ensure the sustainability of multi parents recombination in solving the JSSP.

Automated scheduling and planning from theory to practice

CERN Document Server

Ozcan, Ender; Urquhart, Neil

2013-01-01

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

Evidence for positive, but not negative, behavioral contrast with wheel-running reinforcement on multiple variable-ratio schedules.

Science.gov (United States)

Belke, Terry W; Pierce, W David

2016-12-01

Rats responded on a multiple variable-ratio (VR) 10 VR 10 schedule of reinforcement in which lever pressing was reinforced by the opportunity to run in a wheel for 30s in both the changed (manipulated) and unchanged components. To generate positive contrast, the schedule of reinforcement in the changed component was shifted to extinction; to generate negative contrast, the schedule was shifted to VR 3. With the shift to extinction in the changed component, wheel-running and local lever-pressing rates increased in the unchanged component, a result supporting positive contrast; however, the shift to a VR 3 schedule in the changed component showed no evidence of negative contrast in the unaltered setting, only wheel running decreased in the unchanged component. Changes in wheel-running rates across components were consistent in showing a compensation effect, depending on whether the schedule manipulation increased or decreased opportunities for wheel running in the changed component. These findings are the first to demonstrate positive behavioral contrast on a multiple schedule with wheel running as reinforcement in both components. Copyright © 2016 Elsevier B.V. All rights reserved.

Extending the Internet to make demand management e-smart

Energy Technology Data Exchange (ETDEWEB)

Nelson, M. D. [emWare Inc., Salt Lake City, UT (United States)

2001-06-01

A new cost-effective solution to managing peak power demand by utility companies is described. The system was developed by Carrier Corporation, in conjunction with Silicon Energy, AT and T and emWare Inc. The program is known as 'ComfortChoice'. The heart of the system is a new generation of energy management interface (Emi) thermostat which is Internet-enabled. These thermostats allow the utility company to adjust the customer's temperature set point during peak energy time to reduce energy usage, while giving the customer complete freedom to override the utility company's settings and to control the thermostat remotely via a Web browser interface on a PC. The device-networking system runs on the EMIT software package, developed by emWare Inc, which is ideal for electronic devices with 8- or 16-bit micro-controllers, like thermostats and other everyday devices, and enable bringing the Internet into homes in a cost-effective platform. It is particularly well-suited to controlling power and resource management, heating and cooling systems, building and home automation, telemedicine and health services to network-enable new and existing products, making them e-smart. In addition to being enabled to monitor, diagnose, upgrade and control these devices over the Internet, the embedded micro internet-working technology (EMIT) also offers improved service, greater convenience, and increased cost savings. Productivity and safety are also claimed to be enhanced.

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

Energy Technology Data Exchange (ETDEWEB)

Flory, John Andrew [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Padilla, Denise D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gauthier, John H. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zwerneman, April Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Miller, Steven P [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2016-05-01

Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

Online Scheduling in Manufacturing A Cumulative Delay Approach

CERN Document Server

Suwa, Haruhiko

2013-01-01

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

Parallel Machine Scheduling with Batch Delivery to Two Customers

Directory of Open Access Journals (Sweden)

Xueling Zhong

2015-01-01

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

Limited Preemptive Scheduling in Real-time Systems

OpenAIRE

Thekkilakattil, Abhilash

2016-01-01

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

A simple rule based model for scheduling farm management operations in SWAT

Science.gov (United States)

Schürz, Christoph; Mehdi, Bano; Schulz, Karsten

2016-04-01

For many interdisciplinary questions at the watershed scale, the Soil and Water Assessment Tool (SWAT; Arnold et al., 1998) has become an accepted and widely used tool. Despite its flexibility, the model is highly demanding when it comes to input data. At SWAT's core the water balance and the modeled nutrient cycles are plant growth driven (implemented with the EPIC crop growth model). Therefore, land use and crop data with high spatial and thematic resolution, as well as detailed information on cultivation and farm management practices are required. For many applications of the model however, these data are unavailable. In order to meet these requirements, SWAT offers the option to trigger scheduled farm management operations by applying the Potential Heat Unit (PHU) concept. The PHU concept solely takes into account the accumulation of daily mean temperature for management scheduling. Hence, it contradicts several farming strategies that take place in reality; such as: i) Planting and harvesting dates are set much too early or too late, as the PHU concept is strongly sensitivity to inter-annual temperature fluctuations; ii) The timing of fertilizer application, in SWAT this often occurs simultaneously on the same date in in each field; iii) and can also coincide with precipitation events. Particularly, the latter two can lead to strong peaks in modeled nutrient loads. To cope with these shortcomings we propose a simple rule based model (RBM) to schedule management operations according to realistic farmer management practices in SWAT. The RBM involves simple strategies requiring only data that are input into the SWAT model initially, such as temperature and precipitation data. The user provides boundaries of time periods for operation schedules to take place for all crops in the model. These data are readily available from the literature or from crop variety trials. The RBM applies the dates by complying with the following rules: i) Operations scheduled in the

Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling

OpenAIRE

George , Laurent; Rivierre , Nicolas; Spuri , Marco

1996-01-01

Projet REFLECS; Scheduling theory, as it applies to hard-real-time environment, has been widely studied in the last twenty years and it might be unclear to make it out within the plethora of results available. Our goal is first to collect in a single paper the results known for uniproces sor, non-idling, preemptive/non-preemptive, fixed/dynamic priority driven contexts, consid ering general task sets as a central figure for the description of possible processor loads. Second to establish new ...

Clinch River Breeder Reactor Plant Project: construction schedule

International Nuclear Information System (INIS)

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

1982-01-01

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

Risk-constrained dynamic self-scheduling of a pumped-storage plant in the energy and ancillary service markets

International Nuclear Information System (INIS)

Kazempour, S. Jalal; Moghaddam, M. Parsa; Haghifam, M.R.; Yousefi, G.R.

2009-01-01

This work addresses a new framework for self-scheduling of an individual price-taker pumped-storage plant in a day-ahead (DA) market. The goal is achieving the best trade-off between the expected profit and the risks when the plant participates in DA energy, spinning reserve and regulation markets. In this paper, a set of uncertainties including price forecasting errors and also the uncertainty of power delivery requests in the ancillary service markets are contemplated. Considering these uncertainties, a new approach is proposed which is called dynamic self-scheduling (DSS). This risk-constrained dynamic self-scheduling problem is therefore formulated and solved as a mixed integer programming (MIP) problem. Numerical results for a case study are discussed. (author)

Technical Report: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Approach

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

2008-01-01

In this paper, we present The Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem...... considered here, is concerned with the generation of schedules for these. The problem is decomposed and modeled in two parts, namely a planning problem and a scheduling problem. In the planning problem a set of crane operations is created to take the yard from its current state to a desired goal state...... schedule for the cranes is generated, where each operation is assigned to a crane and is given a specific time of initiation. For both models, a thorough description of the modeling details is given along with a specification of objective criteria. Variants of the models are presented as well. Preliminary...

A matheuristic for transfer synchronization through integrated timetabling and vehicle scheduling

DEFF Research Database (Denmark)

Fonseca, João Paiva; van der Hurk, Evelien; Roberti, Roberto

2018-01-01

Long transfer times often add unnecessary inconvenience to journeys in public transport systems. Synchronizing relevant arrival and departure times through small timetable modifications could reduce excess transfer times, but may also directly affect the operational costs, as the timetable defines...... the set of feasible vehicle schedules. Therefore better results in terms of passenger service, operational costs, or both, could be obtained by solving these problems simultaneously....

Unifying practice schedules in the timescales of motor learning and performance.

Science.gov (United States)

Verhoeven, F Martijn; Newell, Karl M

2018-06-01

In this article, we elaborate from a multiple time scales model of motor learning to examine the independent and integrated effects of massed and distributed practice schedules within- and between-sessions on the persistent (learning) and transient (warm-up, fatigue) processes of performance change. The timescales framework reveals the influence of practice distribution on four learning-related processes: the persistent processes of learning and forgetting, and the transient processes of warm-up decrement and fatigue. The superposition of the different processes of practice leads to a unified set of effects for massed and distributed practice within- and between-sessions in learning motor tasks. This analysis of the interaction between the duration of the interval of practice trials or sessions and parameters of the introduced time scale model captures the unified influence of the between trial and session scheduling of practice on learning and performance. It provides a starting point for new theoretically based hypotheses, and the scheduling of practice that minimizes the negative effects of warm-up decrement, fatigue and forgetting while exploiting the positive effects of learning and retention. Copyright © 2018 Elsevier B.V. All rights reserved.

76 FR 11196 - Foreign-Trade Zone 158-Vicksburg/Jackson, MS, Application for Expansion of Manufacturing...

Science.gov (United States)

2011-03-01

..., tool sets, reservoir tanks, fans, air-conditioner components, filters, valves, thermostats, door roller... America, Inc. (Motor Vehicles) An application has been submitted to the Foreign-Trade Zones Board (the...

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

2015-01-01

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

Group Elevator Peak Scheduling Based on Robust Optimization Model

Directory of Open Access Journals (Sweden)

ZHANG, J.

2013-08-01

Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

NRC comprehensive records disposition schedule. Revision 3

International Nuclear Information System (INIS)

1998-02-01

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

NRC comprehensive records disposition schedule. Revision 3

Energy Technology Data Exchange (ETDEWEB)

NONE

1998-02-01

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

Cure Schedule for Stycast 2651/Catalyst 9.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

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

Job shop scheduling problem with late work criterion

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

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

Practicing field hockey skills along the contextual interference continuum: a comparison of five practice schedules.

Science.gov (United States)

Cheong, Jadeera Phaik Geok; Lay, Brendan; Grove, J Robert; Medic, Nikola; Razman, Rizal

2012-01-01

To overcome the weakness of the contextual interference (CI) effect within applied settings, Brady, 2008 recommended that the amount of interference be manipulated. This study investigated the effect of five practice schedules on the learning of three field hockey skills. Fifty-five pre-university students performed a total of 90 trials for each skill under blocked, mixed or random practice orders. Results showed a significant time effect with all five practice conditions leading to improvements in acquisition and learning of the skills. No significant differences were found between the groups. The findings of the present study did not support the CI effect and suggest that either blocked, mixed, or random practice schedules can be used effectively when structuring practice for beginners. Key pointsThe contextual interference effect did not surface when using sport skills.There appears to be no difference between blocked and random practice schedules in the learning of field hockey skills.Low (blocked), moderate (mixed) or high (random) interference practice schedules can be used effectively when conducting a multiple skill practice session for beginners.

Optimal treatment scheduling of ionizing radiation and sunitinib improves the antitumor activity and allows dose reduction

International Nuclear Information System (INIS)

Kleibeuker, Esther A; Hooven, Matthijs A ten; Castricum, Kitty C; Honeywell, Richard; Griffioen, Arjan W; Verheul, Henk M; Slotman, Ben J; Thijssen, Victor L

2015-01-01

The combination of radiotherapy with sunitinib is clinically hampered by rare but severe side effects and varying results with respect to clinical benefit. We studied different scheduling regimes and dose reduction in sunitinib and radiotherapy in preclinical tumor models to improve potential outcome of this combination treatment strategy. The chicken chorioallantoic membrane (CAM) was used as an angiogenesis in vivo model and as a xenograft model with human tumor cells (HT29 colorectal adenocarcinoma, OE19 esophageal adenocarcinoma). Treatment consisted of ionizing radiation (IR) and sunitinib as single therapy or in combination, using different dose-scheduling regimes. Sunitinib potentiated the inhibitory effect of IR (4 Gy) on angiogenesis. In addition, IR (4 Gy) and sunitinib (4 days of 32.5 mg/kg per day) inhibited tumor growth. Ionizing radiation induced tumor cell apoptosis and reduced proliferation, whereas sunitinib decreased tumor angiogenesis and reduced tumor cell proliferation. When IR was applied before sunitinib, this almost completely inhibited tumor growth, whereas concurrent IR was less effective and IR after sunitinib had no additional effect on tumor growth. Moreover, optimal scheduling allowed a 50% dose reduction in sunitinib while maintaining comparable antitumor effects. This study shows that the therapeutic efficacy of combination therapy improves when proper dose-scheduling is applied. More importantly, optimal treatment regimes permit dose reductions in the angiogenesis inhibitor, which will likely reduce the side effects of combination therapy in the clinical setting. Our study provides important leads to optimize combination treatment in the clinical setting

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.

Sport Tournament Automated Scheduling System

Directory of Open Access Journals (Sweden)

Raof R. A. A

2018-01-01

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

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

NARCIS (Netherlands)

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

2005-01-01

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

Scheduling nursing personnel on a microcomputer.

Science.gov (United States)

Liao, C J; Kao, C Y

1997-01-01

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

A hybrid job-shop scheduling system

Science.gov (United States)

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

1992-01-01

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

Brief-stimulus presentations on multiform tandem schedules

OpenAIRE

Reed, Phil

1994-01-01

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

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

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

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

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

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

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

49 CFR Appendix B to Part 386 - Penalty Schedule; Violations and Maximum Civil Penalties

Science.gov (United States)

2010-10-01

... Maximum Civil Penalties The Debt Collection Improvement Act of 1996 [Public Law 104-134, title III... civil penalties set out in paragraphs (e)(1) through (4) of this appendix results in death, serious... 49 Transportation 5 2010-10-01 2010-10-01 false Penalty Schedule; Violations and Maximum Civil...

Prescribed Travel Schedules for Fatigue Management

Science.gov (United States)

Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

2011-01-01

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

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

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

2018-02-01

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

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

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

2018-03-01

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

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

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

Flow shop scheduling with heterogeneous workers

OpenAIRE

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

2014-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

21 CFR 113.83 - Establishing scheduled processes.

Science.gov (United States)

2010-04-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-06

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

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

Directory of Open Access Journals (Sweden)

Chandramouli Anandaraman

2011-10-01

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

GSA eLibrary Schedules and Contracts

Data.gov (United States)

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

Effect of a simple dose-escalation schedule on tramadol tolerability : assessment in the clinical setting.

Science.gov (United States)

Tagarro, I; Herrera, J; Barutell, C; Díez, M C; Marín, M; Samper, D; Busquet, C; Rodríguez, M J

2005-01-01

To assess the effect of a very simple dose-escalation schedule on tramadol tolerability in clinical practice. This schedule consists of starting treatment with sustained-release tramadol 50mg twice daily, and escalating the dose around 7 days later to 100mg twice daily. Data from 1925 outpatients with non-malignant chronic pain were collected in this multicentre, prospective, comparative, non-randomised, open, observational study. A total of 1071 patients (55.6%) were included in the dose-escalation group (50mg group) and 854 patients (44.4%) in the control group (sustained-release tramadol 100mg twice daily; 100mg group). The proportion of patients who interrupted tramadol treatment due to the occurrence of adverse reactions was significantly lower in the 50mg group (5.6%) than in the 100mg group (12.6%) [p = 0.001]. In line with this, the proportion of patients who experienced at least one adverse reaction was significantly lower in the 50mg group (18.4%) than in the 100mg group (30.4%) [p = 0.001] and, interestingly, the two most frequently reported adverse reactions, nausea and dizziness, were found with a significantly lower frequency in the 50mg group (p < 0.001). Multivariate analysis showed that the risk of safety-related treatment cessations was 2.3 times higher in the 100mg group than in the 50mg group, and 2.2 times higher in females than in males. The two treatments were equally effective in reducing pain intensity (p = 0.121), measured as a reduction in pain score obtained by means of a visual analogue scale. The instauration of tramadol treatment, starting with sustained-release 50mg capsules twice daily and escalating the dose some days later to 100mg twice daily, was shown to be an effective and easy way to improve tramadol tolerability in clinical practice, whilst maintaining its analgesic efficacy.

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

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

1992-05-01

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

14 CFR 399.81 - Unrealistic or deceptive scheduling.

Science.gov (United States)

2010-01-01

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

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

International Nuclear Information System (INIS)

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

2015-01-01

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

An optimal dynamic interval preventive maintenance scheduling for series systems

International Nuclear Information System (INIS)

Gao, Yicong; Feng, Yixiong; Zhang, Zixian; Tan, Jianrong

2015-01-01

This paper studies preventive maintenance (PM) with dynamic interval for a multi-component system. Instead of equal interval, the time of PM period in the proposed dynamic interval model is not a fixed constant, which varies from interval-down to interval-up. It is helpful to reduce the outage loss on frequent repair parts and avoid lack of maintenance of the equipment by controlling the equipment maintenance frequency, when compared to a periodic PM scheme. According to the definition of dynamic interval, the reliability of system is analyzed from the failure mechanisms of its components and the different effects of non-periodic PM actions on the reliability of the components. Following the proposed model of reliability, a novel framework for solving the non-periodical PM schedule with dynamic interval based on the multi-objective genetic algorithm is proposed. The framework denotes the strategies include updating strategy, deleting strategy, inserting strategy and moving strategy, which is set to correct the invalid population individuals of the algorithm. The values of the dynamic interval and the selections of PM action for the components on every PM stage are determined by achieving a certain level of system availability with the minimum total PM-related cost. Finally, a typical rotary table system of NC machine tool is used as an example to describe the proposed method. - Highlights: • A non-periodic preventive maintenance scheduling model is proposed. • A framework for solving the non-periodical PM schedule problem is developed. • The interval of non-periodic PM is flexible and schedule can be better adjusted. • Dynamic interval leads to more efficient solutions than fixed interval does

Examining the Cultural Validity of Fear Survey Schedule for Children: The Contemporary Fears of Turkish Children and Adolescents

Science.gov (United States)

Serim-Yildiz, Begum; Erdur-Baker, Ozgur

2013-01-01

The authors examined the cultural validity of Fear Survey Schedule for Children (FSSC-AM) developed by J. J. Burnham (2005) with Turkish children. The relationships between demographic variables and the level of fear were also tested. Three independent data sets were used. The first data set comprised 676 participants (321 women and 355 men) and…

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

Simultaneous Scheduling of Jobs, AGVs and Tools Considering Tool Transfer Times in Multi Machine FMS By SOS Algorithm

Science.gov (United States)

Sivarami Reddy, N.; Ramamurthy, D. V., Dr.; Prahlada Rao, K., Dr.

2017-08-01

This article addresses simultaneous scheduling of machines, AGVs and tools where machines are allowed to share the tools considering transfer times of jobs and tools between machines, to generate best optimal sequences that minimize makespan in a multi-machine Flexible Manufacturing System (FMS). Performance of FMS is expected to improve by effective utilization of its resources, by proper integration and synchronization of their scheduling. Symbiotic Organisms Search (SOS) algorithm is a potent tool which is a better alternative for solving optimization problems like scheduling and proven itself. The proposed SOS algorithm is tested on 22 job sets with makespan as objective for scheduling of machines and tools where machines are allowed to share tools without considering transfer times of jobs and tools and the results are compared with the results of existing methods. The results show that the SOS has outperformed. The same SOS algorithm is used for simultaneous scheduling of machines, AGVs and tools where machines are allowed to share tools considering transfer times of jobs and tools to determine the best optimal sequences that minimize makespan.

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

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

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

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

2013-01-01

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

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

Decay-usage scheduling in multiprocessors

NARCIS (Netherlands)

Epema, D.H.J.

1998-01-01

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

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

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

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

DEFF Research Database (Denmark)

Neumann, Frank; Witt, Carsten

2015-01-01

combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

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

A theory of behaviour on progressive ratio schedules, with applications in behavioural pharmacology.

Science.gov (United States)

Bradshaw, C M; Killeen, P R

2012-08-01

Mathematical principles of reinforcement (MPR) provide the theoretical basis for a family of models of schedule-controlled behaviour. A model of fixed-ratio schedule performance that was applied to behaviour on progressive ratio (PR) schedules showed systematic departures from the data. This study aims to derive a new model from MPR that will account for overall and running response rates in the component ratios of PR schedules, and their decline toward 0, the breakpoint. The role of pausing is represented in a real-time model containing four parameters: T (0) and k are the intercept and slope of the linear relation between post-reinforcement pause duration and the prior inter-reinforcer interval; a (specific activation) measures the incentive value of the reinforcer; δ (response time) sets biomechanical limits on response rate. Running rate is predicted to decrease with negative acceleration as ratio size increments, overall rate to increase and then decrease. Differences due to type of progression are explained as hysteresis in the control by reinforcement rates. Re-analysis of extant data focuses on the effects of acute treatment with antipsychotic drugs, lesions of the nucleus accumbens core, and destruction of orexinergic neurones of the lateral hypothalamus. The new model resolves some anomalies evident in earlier analyses, and provides new insights to the results of these interventions. Because they can render biologically relevant parameters, mathematical models can provide greater power in interpreting the effects of interventions on the processes underlying schedule-controlled behaviour than is possible for first-order data such as the breakpoint.

Nonblocking Scheduling for Web Service Transactions

DEFF Research Database (Denmark)

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

2007-01-01

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

Decentralized vs. centralized scheduling in wireless sensor networks for data fusion

OpenAIRE

Mitici, M.A.; Goseling, Jasper; de Graaf, Maurits; Boucherie, Richardus J.

2014-01-01

We consider the problem of data estimation in a sensor wireless network where sensors transmit their observations according to decentralized and centralized transmission schedules. A data collector is interested in achieving a data estimation using several sensor observations such that the variance of the estimation is below a targeted threshold. We analyze the waiting time for a collector to receive sufficient sensor observations. We show that, for sufficiently large sensor sets, the decentr...

Multi-objective group scheduling with learning effect in the cellular manufacturing system

Directory of Open Access Journals (Sweden)

Mohammad Taghi Taghavi-fard

2011-01-01

Full Text Available Group scheduling problem in cellular manufacturing systems consists of two major steps. Sequence of parts in each part-family and the sequence of part-family to enter the cell to be processed. This paper presents a new method for group scheduling problems in flow shop systems where it minimizes makespan (Cmax and total tardiness. In this paper, a position-based learning model in cellular manufacturing system is utilized where processing time for each part-family depends on the entrance sequence of that part. The problem of group scheduling is modeled by minimizing two objectives of position-based learning effect as well as the assumption of setup time depending on the sequence of parts-family. Since the proposed problem is NP-hard, two meta heuristic algorithms are presented based on genetic algorithm, namely: Non-dominated sorting genetic algorithm (NSGA-II and non-dominated rank genetic algorithm (NRGA. The algorithms are tested using randomly generated problems. The results include a set of Pareto solutions and three different evaluation criteria are used to compare the results. The results indicate that the proposed algorithms are quite efficient to solve the problem in a short computational time.

A bi-objective integer programming model for partly-restricted flight departure scheduling.

Science.gov (United States)

Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Flexible Work Schedules. ERIC Digest.

Science.gov (United States)

Kerka, Sandra

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

Toward an Autonomous Telescope Network: the TBT Scheduler

Science.gov (United States)

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

2015-09-01

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

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

Directory of Open Access Journals (Sweden)

Vasileios Thanasias

Full Text Available Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

Science.gov (United States)

Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

2016-01-01

Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

The ASDEX Upgrade discharge schedule

International Nuclear Information System (INIS)

Neu, G.; Engelhardt, K.; Raupp, G.; Treutterer, W.; Zasche, D.; Zehetbauer, T.

2007-01-01

ASDEX Upgrade's recently commissioned discharge control system (DCS) marks the transition from a traditional programmed system to a highly flexible 'data driven' one. The allocation of application processes (APs) to controllers, the interconnection of APs through uniquely named signals, and AP control parameter values are all defined as data, and can easily be adapted to the requirements of a particular discharge. The data is laid down in a set of XML documents which APs request via HTTP from a configuration server before a discharge. The use of XML allows for easy parsing, and structural validation through (XSD) schemas. The central input to the configuration process is the discharge schedule (DS), which embodies the dynamic behaviour of a planned discharge as reference trajectories grouped in segments, concatenated through transition conditions. Editing, generation and validation tools, and version control through CVS allow for efficient management of DSs

Modelling altered fractionation schedules

International Nuclear Information System (INIS)

Fowler, J.F.

1993-01-01

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

Pittsburgh International Airport - Scheduled Passenger Traffic

Data.gov (United States)

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

Cloud Service Scheduling Algorithm Research and Optimization

Directory of Open Access Journals (Sweden)

Hongyan Cui

2017-01-01

Full Text Available We propose a cloud service scheduling model that is referred to as the Task Scheduling System (TSS. In the user module, the process time of each task is in accordance with a general distribution. In the task scheduling module, we take a weighted sum of makespan and flowtime as the objective function and use an Ant Colony Optimization (ACO and a Genetic Algorithm (GA to solve the problem of cloud task scheduling. Simulation results show that the convergence speed and output performance of our Genetic Algorithm-Chaos Ant Colony Optimization (GA-CACO are optimal.

A Gas Scheduling Optimization Model for Steel Enterprises

Directory of Open Access Journals (Sweden)

Niu Honghai

2017-01-01

Full Text Available Regarding the scheduling problems of steel enterprises, this research designs the gas scheduling optimization model according to the rules and priorities. Considering different features and the process changes of the gas unit in the process of actual production, the calculation model of process state and gas consumption soft measurement together with the rules of scheduling optimization is proposed to provide the dispatchers with real-time gas using status of each process, then help them to timely schedule and reduce the gas volume fluctuations. In the meantime, operation forewarning and alarm functions are provided to avoid the abnormal situation in the scheduling, which has brought about very good application effect in the actual scheduling and ensures the safety of the gas pipe network system and the production stability.

A reduced feedback proportional fair multiuser scheduling scheme

KAUST Repository

Shaqfeh, Mohammad

2011-12-01

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

Where do we stand with fuzzy project scheduling?

CERN Document Server

Bonnal, Pierre; Lacoste, Germain

2004-01-01

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

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

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

Mission Operations Planning and Scheduling System (MOPSS)

Science.gov (United States)

Wood, Terri; Hempel, Paul

2011-01-01

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

Post LS1 schedule

CERN Document Server

Lamont, M

2014-01-01

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

A priority-based heuristic algorithm (PBHA for optimizing integrated process planning and scheduling problem

Directory of Open Access Journals (Sweden)

Muhammad Farhan Ausaf

2015-12-01

Full Text Available Process planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing the IPPS problem, there is still room for improvement in terms of quality of solution and algorithm efficiency, especially for more complicated problems. Dispatching rules have been successfully utilized for solving complicated scheduling problems, but haven’t been considered extensively for the IPPS problem. This approach incorporates dispatching rules with the concept of prioritizing jobs, in an algorithm called priority-based heuristic algorithm (PBHA. PBHA tries to establish job and machine priority for selecting operations. Priority assignment and a set of dispatching rules are simultaneously used to generate both the process plans and schedules for all jobs and machines. The algorithm was tested for a series of benchmark problems. The proposed algorithm was able to achieve superior results for most complex problems presented in recent literature while utilizing lesser computational resources.

Gender Still Matters: Effects of Workplace Discrimination on Employment Schedules of Young Professionals

Directory of Open Access Journals (Sweden)

Gabriele Plickert

2017-11-01

Full Text Available The influx of women into the legal profession has significantly changed the landscape of legal practice. Women lawyers today no longer face the challenges to entering the legal profession they encountered thirty years ago. However, despite these advancements, research continues to demonstrate that there are still gender-based issues women have to face in the legal workplace. Among these issues to date are the difficulties in combining responsibilities of work with responsibilities of families and children that underpin women’s employment and earning disadvantages. Using survey data from a national representative U.S. panel study of lawyers, we examine how work schedules, comparing full-time to part-time work, vary by personal disposition and workplace characteristics. Drawing from prominent explanations of gender inequality in the legal profession, we focus on inquiries of commitment to work, performance, ideal worker expectations, practice settings, and job satisfaction among dimensions of workplace characteristics and examine their effects on women and men lawyers’ work schedules. Logistic regression results show that work schedules significantly vary by gender, parental role, and experience of workplace discrimination. We find that, although all parents experience types of discrimination, there are still major differences in work schedules between mothers and fathers. Our study adds to the gender debate of employment and organizations by examining quantitatively experiences of workplace discrimination.

77 FR 4509 - Patent Public Advisory Committee Public Hearings on the Proposed Patent Fee Schedule

Science.gov (United States)

2012-01-30

... patent fees. The publication of that Notice will open a comment window through which the public may...-P-2012-0002] Patent Public Advisory Committee Public Hearings on the Proposed Patent Fee Schedule... Trademark Office (USPTO) may set or adjust by rule any patent or trademark fee established, authorized, or...

Realistic Scheduling Mechanism for Smart Homes

Directory of Open Access Journals (Sweden)

Danish Mahmood

2016-03-01

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

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

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

Scheduling job shop - A case study

Science.gov (United States)

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

2016-08-01

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

Modeling the Cray memory scheduler

Energy Technology Data Exchange (ETDEWEB)

Wickham, K.L.; Litteer, G.L.

1992-04-01

This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.

The development and testing of a computerised temperature control ...

African Journals Online (AJOL)

S Blignaut

electric ovens require the average internal temperature at each thermostat setting ..... higher temperatures and are more porous and conse- quently less compact and .... by a combination of vis- cometry and electrical resistance oven heating.

The robust schedule - A link to improved workflow

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2012-01-01

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

Shiftwork Scheduling for the 1990s.

Science.gov (United States)

Coleman, Richard M.

1989-01-01

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

CMS Records Schedule

Data.gov (United States)

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

Updating Linear Schedules with Lowest Cost: a Linear Programming Model

Science.gov (United States)

Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

2017-10-01

Many civil engineering projects involve sets of tasks repeated in a predefined sequence in a number of work areas along a particular route. A useful graphical representation of schedules of such projects is time-distance diagrams that clearly show what process is conducted at a particular point of time and in particular location. With repetitive tasks, the quality of project performance is conditioned by the ability of the planner to optimize workflow by synchronizing the works and resources, which usually means that resources are planned to be continuously utilized. However, construction processes are prone to risks, and a fully synchronized schedule may expire if a disturbance (bad weather, machine failure etc.) affects even one task. In such cases, works need to be rescheduled, and another optimal schedule should be built for the changed circumstances. This typically means that, to meet the fixed completion date, durations of operations have to be reduced. A number of measures are possible to achieve such reduction: working overtime, employing more resources or relocating resources from less to more critical tasks, but they all come at a considerable cost and affect the whole project. The paper investigates the problem of selecting the measures that reduce durations of tasks of a linear project so that the cost of these measures is kept to the minimum and proposes an algorithm that could be applied to find optimal solutions as the need to reschedule arises. Considering that civil engineering projects, such as road building, usually involve less process types than construction projects, the complexity of scheduling problems is lower, and precise optimization algorithms can be applied. Therefore, the authors put forward a linear programming model of the problem and illustrate its principle of operation with an example.

Planning construction of integrative schedule management for nuclear power project

International Nuclear Information System (INIS)

Zeng Zhenglin; Wang Wenying; Peng Fei

2012-01-01

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

Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

Directory of Open Access Journals (Sweden)

Huiling Fu

2012-01-01

Full Text Available Among the most commonly used methods of scheduling train stops are practical experience and various “one-step” optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR network such as the one in China. This paper introduces a two-stage approach for train stop scheduling with a goal of efficiently organizing passenger traffic into a rational train stop pattern combination while retaining features of regularity, connectivity, and rapidity (RCR. Based on a three-level station classification definition, a mixed integer programming model and a train operating tactics descriptive model along with the computing algorithm are developed and presented for the two stages. A real-world numerical example is presented using the Chinese HSR network as the setting. The performance of the train stop schedule and the applicability of the proposed approach are evaluated from the perspective of maintaining RCR.

Spent nuclear fuel project integrated schedule plan

International Nuclear Information System (INIS)

Squires, K.G.

1995-01-01

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

Spent nuclear fuel project integrated schedule plan

Energy Technology Data Exchange (ETDEWEB)

Squires, K.G.

1995-03-06

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

The Use of Player-centered Positive Reinforcement to Schedule In-game Rewards Increases Enjoyment and Performance in a Serious Game

Directory of Open Access Journals (Sweden)

Aniket Nagle

2014-10-01

Full Text Available Among the methods used to increase enjoyment and performance in serious games, reward schedules, i.e., determining when in-game rewards should be given, have not been sufficiently explored. In the present study, we designed a simple memory training serious game and compared two methods of scheduling rewards, both based on the paradigm of positive reinforcement: fixed ratio schedule, in which rewards were given after a fixed number of correct responses, and variable ratio schedule, in which rewards were given after an unpredictable number of correct responses. To account for the variability in player preference for rewards, a player-centered sub-mode was included in both schedules by adjusting the schedule ratio according to player preference for rewards. The effectiveness of this approach was tested by comparing it against two more sub-modes: one which used a predetermined ratio, and another which set the ratio to the opposite of player preference. The game was put online and tested with 210 participants. Enjoyment, performance, duration of gameplay, and likelihood to play again were significantly higher in the player-centered sub-mode than the other sub-modes. On average, the variable-ratio schedule was better in the outcome measures than the fixed-ratio schedule. The results highlight the importance of in-game rewards, and indicate that giving rewards according to a player-centered variable-ratio schedule has the potential to make serious games more effective.

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

Knowledge-based scheduling of arrival aircraft

Science.gov (United States)

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

1995-01-01

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

Integrated multi-resource planning and scheduling in engineering project

Directory of Open Access Journals (Sweden)

Samer Ben Issa

2017-01-01

Full Text Available Planning and scheduling processes in project management are carried out sequentially in prac-tice, i.e. planning project activities first without visibility of resource limitation, and then schedul-ing the project according to these pre-planned activities. This is a need to integrate these two pro-cesses. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called “the Minimum Moments of Resources Required around X-Y axes (MMORR”, we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

46 CFR 112.50-1 - General.

Science.gov (United States)

2010-10-01

... degrees C). (c) The room that has the generator set must have intake and exhaust ducts to supply adequate... thermostatically-controlled electric water-jacket heater connected to the final emergency bus is permitted. (e) The... generator set must shut down automatically upon loss of lubricating oil pressure, overspeed, or operation of...

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.

Development and Evaluation of Algorithms to Improve Small- and Medium-Size Commercial Building Operations

Energy Technology Data Exchange (ETDEWEB)

Kim, Woohyun [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Katipamula, Srinivas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Lutes, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Underhill, Ronald M. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

2016-10-31

Small- and medium-sized (<100,000 sf) commercial buildings (SMBs) represent over 95% of the U.S. commercial building stock and consume over 60% of total site energy consumption. Many of these buildings use rudimentary controls that are mostly manual, with limited scheduling capability, no monitoring or failure management. Therefore, many of these buildings are operated inefficiently and consume excess energy. SMBs typically utilize packaged rooftop units (RTUs) that are controlled by an individual thermostat. There is increased urgency to improve the operating efficiency of existing commercial building stock in the U.S. for many reasons, chief among them is to mitigate the climate change impacts. Studies have shown that managing set points and schedules of the RTUs will result in up to 20% energy and cost savings. Another problem associated with RTUs is short-cycling, where an RTU goes through ON and OFF cycles too frequently. Excessive cycling can lead to excessive wear and lead to premature failure of the compressor or its components. The short cycling can result in a significantly decreased average efficiency (up to 10%), even if there are no physical failures in the equipment. Also, SMBs use a time-of-day scheduling is to start the RTUs before the building will be occupied and shut it off when unoccupied. Ensuring correct use of the zone set points and eliminating frequent cycling of RTUs thereby leading to persistent building operations can significantly increase the operational efficiency of the SMBs. A growing trend is to use low-cost control infrastructure that can enable scalable and cost-effective intelligent building operations. The work reported in this report describes three algorithms for detecting the zone set point temperature, RTU cycling rate and occupancy schedule detection that can be deployed on the low-cost infrastructure. These algorithms only require the zone temperature data for detection. The algorithms have been tested and validated using

46 CFR 525.2 - Terminal schedules.

Science.gov (United States)

2010-10-01

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