Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

Directory of Open Access Journals (Sweden)

Ruey-Maw Chen

2011-01-01

Full Text Available The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the best performance resource heuristic and the latest finish time heuristic. These two heuristics applied to the PSO scheme are for speeding up the search of the particle and improving the capability of finding a sound schedule. Moreover, both global communication topology and local ring communication topology are also investigated for efficient study of proposed scheme. Simulation results demonstrate that the proposed approach in this investigation can successfully solve the task-resource assignment problems in grid computing and similar scheduling problems.

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

Science.gov (United States)

Li, Jian; Wang, Cheng

2007-11-01

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

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 .

Protocol-transparent resource sharing in hierarchically scheduled real-time systems

NARCIS (Netherlands)

Heuvel, van den M.M.H.P.; Bril, R.J.; Lukkien, J.J.

2010-01-01

Hierarchical scheduling frameworks (HSFs) provide means for composing complex real-time systems from well-defined, independently analyzed subsystems. To support resource sharing within two-level HSFs, three synchronization protocols based on the stack resource policy (SRP) have recently been

Profit-based conventional resource scheduling with renewable energy penetration

Science.gov (United States)

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

2017-08-01

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

Resource management and scheduling policy based on grid for AIoT

Science.gov (United States)

Zou, Yiqin; Quan, Li

2017-07-01

This paper has a research on resource management and scheduling policy based on grid technology for Agricultural Internet of Things (AIoT). Facing the situation of a variety of complex and heterogeneous agricultural resources in AIoT, it is difficult to represent them in a unified way. But from an abstract perspective, there are some common models which can express their characteristics and features. Based on this, we proposed a high-level model called Agricultural Resource Hierarchy Model (ARHM), which can be used for modeling various resources. It introduces the agricultural resource modeling method based on this model. Compared with traditional application-oriented three-layer model, ARHM can hide the differences of different applications and make all applications have a unified interface layer and be implemented without distinction. Furthermore, it proposes a Web Service Resource Framework (WSRF)-based resource management method and the encapsulation structure for it. Finally, it focuses on the discussion of multi-agent-based AG resource scheduler, which is a collaborative service provider pattern in multiple agricultural production domains.

Ant colony optimisation for scheduling of flexible job shop with multi-resources requirements

Directory of Open Access Journals (Sweden)

Kalinowski Krzysztof

2017-01-01

Full Text Available The paper presents application of ant colony optimisation algorithm for scheduling multi-resources operations in flexible job shop type of production systems. Operations that require the participation of two or more resources are common in industrial practice, when planning are subject not only machines, but also other additional resources (personnel, tools, etc.. Resource requirements of operation are indicated indirectly by resource groups. The most important parameters of the resource model and resource groups are also described. A basic assumptions for ant colony algorithm used for scheduling in the considered model with multiresources requirements of operations is discussed. The main result of the research is the schema of metaheuristic that enables searching best-score solutions in manufacturing systems satisfying presented constraints.

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.

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.

Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

Directory of Open Access Journals (Sweden)

Stanimirović Ivan

2009-01-01

Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

Science.gov (United States)

Tian, Xingke; Yuan, Shengrui

2018-04-01

Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.

A Dynamic Resource Scheduling Method Based on Fuzzy Control Theory in Cloud Environment

Directory of Open Access Journals (Sweden)

Zhijia Chen

2015-01-01

Full Text Available The resources in cloud environment have features such as large-scale, diversity, and heterogeneity. Moreover, the user requirements for cloud computing resources are commonly characterized by uncertainty and imprecision. Hereby, to improve the quality of cloud computing service, not merely should the traditional standards such as cost and bandwidth be satisfied, but also particular emphasis should be laid on some extended standards such as system friendliness. This paper proposes a dynamic resource scheduling method based on fuzzy control theory. Firstly, the resource requirements prediction model is established. Then the relationships between resource availability and the resource requirements are concluded. Afterwards fuzzy control theory is adopted to realize a friendly match between user needs and resources availability. Results show that this approach improves the resources scheduling efficiency and the quality of service (QoS of cloud computing.

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

OpenAIRE

Chen, Ruey-Maw; Wang, Chuin-Mu

2011-01-01

The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimo...

On utilization bounds for a periodic resource under rate monotonic scheduling

NARCIS (Netherlands)

Renssen, van A.M.; Geuns, S.J.; Hausmans, J.P.H.M.; Poncin, W.; Bril, R.J.

2009-01-01

This paper revisits utilization bounds for a periodic resource under the rate monotonic (RM) scheduling algorithm. We show that the existing utilization bound, as presented in [8, 9], is optimistic. We subsequently show that by viewing the unavailability of the periodic resource as a deferrable

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.

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

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

International Nuclear Information System (INIS)

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

2016-01-01

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

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

DEFF Research Database (Denmark)

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

2015-01-01

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

USE OF ELECTRONIC EDUCATIONAL RESOURCES WHEN TRAINING IN WORK WITH SPREADSHEETS

Directory of Open Access Journals (Sweden)

Х А Гербеков

2017-12-01

Full Text Available Today the tools for maintaining training courses based on opportunities of information and communication technologies are developed. Practically in all directions of preparation and on all subject matters electronic textbook and self-instruction manuals are created. Nevertheless the industry of computer educational and methodical materials actively develops and gets more and more areas of development and introduction. In this regard more and more urgent is a problem of development of the electronic educational resources adequate to modern educational requirements. Creation and the organization of training courses with use of electronic educational resources in particular on the basis of Internet technologies remains a difficult methodical task.In article the questions connected with development of electronic educational resources for use when studying the substantial line “Information technologies” of a school course of informatics in particular for studying of spreadsheets are considered. Also the analysis of maintenance of a school course and the unified state examination from the point of view of representation of task in him corresponding to the substantial line of studying “Information technologies” on mastering technology of information processing in spreadsheets and the methods of visualization given by means of charts and schedules is carried out.

Using Optimization Models for Scheduling in Enterprise Resource Planning Systems

Directory of Open Access Journals (Sweden)

Frank Herrmann

2016-03-01

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

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

Directory of Open Access Journals (Sweden)

Denis Pinha

2016-11-01

Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.

Efficient Resource Scheduling by Exploiting Relay Cache for Cellular Networks

Directory of Open Access Journals (Sweden)

Chun He

2015-01-01

Full Text Available In relay-enhanced cellular systems, throughput of User Equipment (UE is constrained by the bottleneck of the two-hop link, backhaul link (or the first hop link, and access link (the second hop link. To maximize the throughput, resource allocation should be coordinated between these two hops. A common resource scheduling algorithm, Adaptive Distributed Proportional Fair, only ensures that the throughput of the first hop is greater than or equal to that of the second hop. But it cannot guarantee a good balance of the throughput and fairness between the two hops. In this paper, we propose a Two-Hop Balanced Distributed Scheduling (TBS algorithm by exploiting relay cache for non-real-time data traffic. The evolved Node Basestation (eNB adaptively adjusts the number of Resource Blocks (RBs allocated to the backhaul link and direct links based on the cache information of relays. Each relay allocates RBs for relay UEs based on the size of the relay UE’s Transport Block. We also design a relay UE’s ACK feedback mechanism to update the data at relay cache. Simulation results show that the proposed TBS can effectively improve resource utilization and achieve a good trade-off between system throughput and fairness by balancing the throughput of backhaul and access link.

Expert System and Heuristics Algorithm for Cloud Resource Scheduling

Directory of Open Access Journals (Sweden)

Mamatha E

2017-03-01

Full Text Available Rule-based scheduling algorithms have been widely used on cloud computing systems and there is still plenty of room to improve their performance. This paper proposes to develop an expert system to allocate resources in cloud by using Rule based Algorithm, thereby measuring the performance of the system by letting the system adapt new rules based on the feedback. Here performance of the action helps to make better allocation of the resources to improve quality of services, scalability and flexibility. The performance measure is based on how the allocation of the resources is dynamically optimized and how the resources are utilized properly. It aims to maximize the utilization of the resources. The data and resource are given to the algorithm which allocates the data to resources and an output is obtained based on the action occurred. Once the action is completed, the performance of every action is measured that contains how the resources are allocated and how efficiently it worked. In addition to performance, resource allocation in cloud environment is also considered.

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

OpenAIRE

Lingna He; Qingshui Li; Linan Zhu

2012-01-01

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

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

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.

A note on resource allocation scheduling with group technology and learning effects on a single machine

Science.gov (United States)

Lu, Yuan-Yuan; Wang, Ji-Bo; Ji, Ping; He, Hongyu

2017-09-01

In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.

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

Directory of Open Access Journals (Sweden)

Mohammad Hossein Sadeghi

2013-08-01

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

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

International Nuclear Information System (INIS)

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

2014-01-01

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

Real-time energy resources scheduling considering short-term and very short-term wind forecast

Energy Technology Data Exchange (ETDEWEB)

Silva, Marco; Sousa, Tiago; Morais, Hugo; Vale, Zita [Polytechnic of Porto (Portugal). GECAD - Knowledge Engineering and Decision Support Research Center

2012-07-01

This paper proposes an energy resources management methodology based on three distinct time horizons: day-ahead scheduling, hour-ahead scheduling, and real-time scheduling. In each scheduling process the update of generation and consumption operation and of the storage and electric vehicles storage status are used. Besides the new operation conditions, the most accurate forecast values of wind generation and of consumption using results of short-term and very short-term methods are used. A case study considering a distribution network with intensive use of distributed generation and electric vehicles is presented. (orig.)

Multi-agent system for energy resource scheduling of integrated microgrids in a distributed system

International Nuclear Information System (INIS)

Logenthiran, T.; Srinivasan, Dipti; Khambadkone, Ashwin M.

2011-01-01

This paper proposes a multi-agent system for energy resource scheduling of an islanded power system with distributed resources, which consists of integrated microgrids and lumped loads. Distributed intelligent multi-agent technology is applied to make the power system more reliable, efficient and capable of exploiting and integrating alternative sources of energy. The algorithm behind the proposed energy resource scheduling has three stages. The first stage is to schedule each microgrid individually to satisfy its internal demand. The next stage involves finding the best possible bids for exporting power to the network and compete in a whole sale energy market. The final stage is to reschedule each microgrid individually to satisfy the total demand, which is the addition of internal demand and the demand from the results of the whole sale energy market simulation. The simulation results of a power system with distributed resources comprising three microgrids and five lumped loads show that the proposed multi-agent system allows efficient management of micro-sources with minimum operational cost. The case studies demonstrate that the system is successfully monitored, controlled and operated by means of the developed multi-agent system. (author)

Multi-agent system for energy resource scheduling of integrated microgrids in a distributed system

Energy Technology Data Exchange (ETDEWEB)

Logenthiran, T.; Srinivasan, Dipti; Khambadkone, Ashwin M. [Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore)

2011-01-15

This paper proposes a multi-agent system for energy resource scheduling of an islanded power system with distributed resources, which consists of integrated microgrids and lumped loads. Distributed intelligent multi-agent technology is applied to make the power system more reliable, efficient and capable of exploiting and integrating alternative sources of energy. The algorithm behind the proposed energy resource scheduling has three stages. The first stage is to schedule each microgrid individually to satisfy its internal demand. The next stage involves finding the best possible bids for exporting power to the network and compete in a whole sale energy market. The final stage is to reschedule each microgrid individually to satisfy the total demand, which is the addition of internal demand and the demand from the results of the whole sale energy market simulation. The simulation results of a power system with distributed resources comprising three microgrids and five lumped loads show that the proposed multi-agent system allows efficient management of micro-sources with minimum operational cost. The case studies demonstrate that the system is successfully monitored, controlled and operated by means of the developed multi-agent system. (author)

Resource-Constrained Optimal Scheduling of Synchronous Dataflow Graphs via Timed Automata

NARCIS (Netherlands)

Ahmad, W.; de Groote, Robert; Holzenspies, P.K.F.; Stoelinga, Mariëlle Ida Antoinette; van de Pol, Jan Cornelis

Synchronous dataflow (SDF) graphs are a widely used formalism for modelling, analysing and realising streaming applications, both on a single processor and in a multiprocessing context. Efficient schedules are essential to obtain maximal throughput under the constraint of available resources. This

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Directory of Open Access Journals (Sweden)

Behrouz Afshar-Nadjafi

2014-01-01

Full Text Available Extensive research works have been carried out in resource constrained project scheduling problem. However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted. In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties. A mixed integer programming formulation is proposed for the problem. The resulting problem is NP-hard. So, we try to obtain a satisfying solution using simulated annealing (SA algorithm. The efficiency of the proposed algorithm is tested based on 150 randomly produced examples. Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.

Resource Allocation in a Repetitive Project Scheduling Using Genetic Algorithm

Science.gov (United States)

Samuel, Biju; Mathew, Jeeno

2018-03-01

Resource Allocation is procedure of doling out or allocating the accessible assets in a monetary way and productive way. Resource allocation is the scheduling of the accessible assets and accessible exercises or activities required while thinking about both the asset accessibility and the total project completion time. Asset provisioning and allocation takes care of that issue by permitting the specialist co-ops to deal with the assets for every individual demand of asset. A probabilistic selection procedure has been developed in order to ensure various selections of chromosomes

Improved Cloud resource allocation: how INDIGO-DataCloud is overcoming the current limitations in Cloud schedulers

Science.gov (United States)

Lopez Garcia, Alvaro; Zangrando, Lisa; Sgaravatto, Massimo; Llorens, Vincent; Vallero, Sara; Zaccolo, Valentina; Bagnasco, Stefano; Taneja, Sonia; Dal Pra, Stefano; Salomoni, Davide; Donvito, Giacinto

2017-10-01

Performing efficient resource provisioning is a fundamental aspect for any resource provider. Local Resource Management Systems (LRMS) have been used in data centers for decades in order to obtain the best usage of the resources, providing their fair usage and partitioning for the users. In contrast, current cloud schedulers are normally based on the immediate allocation of resources on a first-come, first-served basis, meaning that a request will fail if there are no resources (e.g. OpenStack) or it will be trivially queued ordered by entry time (e.g. OpenNebula). Moreover, these scheduling strategies are based on a static partitioning of the resources, meaning that existing quotas cannot be exceeded, even if there are idle resources allocated to other projects. This is a consequence of the fact that cloud instances are not associated with a maximum execution time and leads to a situation where the resources are under-utilized. These facts have been identified by the INDIGO-DataCloud project as being too simplistic for accommodating scientific workloads in an efficient way, leading to an underutilization of the resources, a non desirable situation in scientific data centers. In this work, we will present the work done in the scheduling area during the first year of the INDIGO project and the foreseen evolutions.

Scheduling language and algorithm development study. Volume 1, phase 2: Design considerations for a scheduling and resource allocation system

Science.gov (United States)

Morrell, R. A.; Odoherty, R. J.; Ramsey, H. R.; Reynolds, C. C.; Willoughby, J. K.; Working, R. D.

1975-01-01

Data and analyses related to a variety of algorithms for solving typical large-scale scheduling and resource allocation problems are presented. The capabilities and deficiencies of various alternative problem solving strategies are discussed from the viewpoint of computer system design.

Solving Multi-Resource Constrained Project Scheduling Problem using Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Hsiang-Hsi Huang

2015-01-01

Full Text Available This paper applied Ant Colony Optimization (ACO to develop a resource constraints scheduling model to achieve the resource allocation optimization and the shortest completion time of a project under resource constraints and the activities precedence requirement for projects. Resource leveling is also discussed and has to be achieved under the resource allocation optimization in this research. Testing cases and examples adopted from the international test bank were studied for verifying the effectiveness of the proposed model. The results showed that the solutions of different cases all have a better performance within a reasonable time. These can be obtained through ACO algorithm under the same constrained conditions. A program was written for the proposed model that is able to automatically produce the project resource requirement figure after the project duration is solved.

Production and Resource Scheduling in Mass Customization with Dependent Setup Consideration

DEFF Research Database (Denmark)

Nielsen, Izabela Ewa; Bocewicz, G.; Do, Ngoc Anh Dung

2014-01-01

will contribute to the success of mass customization. This paper addresses the problem of production and resource scheduling for a production system with dependent setup and internal transportation such as AGVs in a mass customization environment. A constraint-programming-based methodology is developed to satisfy...

Generation and exploration of aggregation abstractions for scheduling and resource allocation

Science.gov (United States)

Lowry, Michael R.; Linden, Theodore A.

1993-01-01

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Electronic Resource Management and Design

Science.gov (United States)

Abrams, Kimberly R.

2015-01-01

We have now reached a tipping point at which electronic resources comprise more than half of academic library budgets. Because of the increasing work associated with the ever-increasing number of e-resources, there is a trend to distribute work throughout the library even in the presence of an electronic resources department. In 2013, the author…

Tri-generation based hybrid power plant scheduling for renewable resources rich area with energy storage

International Nuclear Information System (INIS)

Pazheri, F.R.

2015-01-01

Highlights: • Involves scheduling of the tri-generation based hybrid power plant. • Utilization of renewable energy through energy storage is discussed. • Benefits of the proposed model are illustrated. • Energy efficient and environmental friendly dispatch is analyzed. • Modeled scheduling problem is applicable to any fuel enriched area. - Abstract: Solving power system scheduling is crucial to ensure smooth operations of the electric power industry. Effective utilization of available conventional and renewable energy sources (RES) by tri-generation and with the aid of energy storage facilities (ESF) can ensure clean and energy efficient power generation. Such power generation can play an important role in countries, like Saudi Arabia, where abundant fossil fuels (FF) and renewable energy sources (RES) are available. Hence, effective modeling of such hybrid power systems scheduling is essential in such countries based on the available fuel resources. The intent of this paper is to present a simple model for tri-generation based hybrid power system scheduling for energy resources rich area in presence of ESF, to ensure optimum fuel utilization and minimum pollutant emissions while meeting the power demand. This research points an effective operation strategy which ensure a clean and energy efficient power scheduling by exploiting available energy resources effectively. Hence, it has an important role in current and future power generation. In order to illustrate the benefits of the presented approach a clean and energy efficient hybrid power supply scheme for King Saud University (KSU), Saudi Arabia, is proposed and analyzed here. Results show that the proposed approach is very suitable for KSU since adequate solar power is available during its peak demand periods

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

Directory of Open Access Journals (Sweden)

Farhad Habibi

2018-01-01

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

Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm

Science.gov (United States)

Paksi, A. B. N.; Ma'ruf, A.

2016-02-01

In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.

Project scheduling with resources constraints: application in the equipment production for the oil industry; Scheduling de projetos com restricao de recursos: aplicacao na producao de equipamentos para a industria de petroleo

Energy Technology Data Exchange (ETDEWEB)

Cruz, Carolina A.O.; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE)

2008-07-01

One of the essential steps in the main scope Project Management is the Time Management made by the planning and control of the project schedule. In this work is presented the resource constrained scheduling problem beyond its mathematical formulation and a review of papers about this issue. In sequence is presented a practical example of this model considering a simplified model of an engineering project schedule of oil production equipment. The results obtained with the model application are shown and the conclusions about the work with resource constrained scheduling problems. (author)

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.

Evaluation of Selected Resource Allocation and Scheduling Methods in Heterogeneous Many-Core Processors and Graphics Processing Units

Directory of Open Access Journals (Sweden)

Ciznicki Milosz

2014-12-01

Full Text Available Heterogeneous many-core computing resources are increasingly popular among users due to their improved performance over homogeneous systems. Many developers have realized that heterogeneous systems, e.g. a combination of a shared memory multi-core CPU machine with massively parallel Graphics Processing Units (GPUs, can provide significant performance opportunities to a wide range of applications. However, the best overall performance can only be achieved if application tasks are efficiently assigned to different types of processor units in time taking into account their specific resource requirements. Additionally, one should note that available heterogeneous resources have been designed as general purpose units, however, with many built-in features accelerating specific application operations. In other words, the same algorithm or application functionality can be implemented as a different task for CPU or GPU. Nevertheless, from the perspective of various evaluation criteria, e.g. the total execution time or energy consumption, we may observe completely different results. Therefore, as tasks can be scheduled and managed in many alternative ways on both many-core CPUs or GPUs and consequently have a huge impact on the overall computing resources performance, there are needs for new and improved resource management techniques. In this paper we discuss results achieved during experimental performance studies of selected task scheduling methods in heterogeneous computing systems. Additionally, we present a new architecture for resource allocation and task scheduling library which provides a generic application programming interface at the operating system level for improving scheduling polices taking into account a diversity of tasks and heterogeneous computing resources characteristics.

A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling

OpenAIRE

Muñoz, Gonzalo; Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Queyranne, Maurice; Rivera, Orlando

2016-01-01

We study a Lagrangian decomposition algorithm recently proposed by Dan Bienstock and Mark Zuckerberg for solving the LP relaxation of a class of open pit mine project scheduling problems. In this study we show that the Bienstock-Zuckerberg (BZ) algorithm can be used to solve LP relaxations corresponding to a much broader class of scheduling problems, including the well-known Resource Constrained Project Scheduling Problem (RCPSP), and multi-modal variants of the RCPSP that consider batch proc...

Constrained consumption shifting management in the distributed energy resources scheduling considering demand response

International Nuclear Information System (INIS)

Faria, Pedro; Vale, Zita; Baptista, Jose

2015-01-01

Highlights: • Consumption reduction and/or shift to several periods before and after. • Optimization problem for scheduling of demand response and distributed generation. • Minimization of the Virtual Power Player operation (remuneration) costs. • Demand response can be efficient to meet distributed generation shortages. • Consumers benefit with the remuneration of the participation in demand response. - Abstract: Demand response concept has been gaining increasing importance while the success of several recent implementations makes this resource benefits unquestionable. This happens in a power systems operation environment that also considers an intensive use of distributed generation. However, more adequate approaches and models are needed in order to address the small size consumers and producers aggregation, while taking into account these resources goals. The present paper focuses on the demand response programs and distributed generation resources management by a Virtual Power Player that optimally aims to minimize its operation costs taking the consumption shifting constraints into account. The impact of the consumption shifting in the distributed generation resources schedule is also considered. The methodology is applied to three scenarios based on 218 consumers and 4 types of distributed generation, in a time frame of 96 periods

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

Science.gov (United States)

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

2015-01-01

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

The Synthesis of the Hierarchical Structure of Information Resources for Management of Electronic Commerce Entities

Directory of Open Access Journals (Sweden)

Krutova Anzhelika S.

2017-06-01

Full Text Available The aim of the article is to develop the theoretical bases for the classification and coding of economic information and the scientific justification of the content of information resources of an electronic commerce enterprise. The essence of information resources for management of electronic business entities is investigated. It is proved that the organization of accounting in e-commerce systems is advisable to be built on the basis of two circuits: accounting for financial flows and accounting associated with transformation of business factors in products and services as a result of production activities. There presented a sequence of accounting organization that allows to combine the both circuits in a single information system, which provides a possibility for the integrated replenishment and distributed simultaneous use of the e-commerce system by all groups of users. It is proved that the guarantee of efficient activity of the information management system of electronic commerce entities is a proper systematization of the aggregate of information resources on economic facts and operations of an enterprise in accordance with the management tasks by building the hierarchy of accounting nomenclatures. It is suggested to understand nomenclature as an objective, primary information aggregate concerning a certain fact of the economic activity of an enterprise, which is characterized by minimum requisites, is entered into the database of the information system and is to be reflected in the accounting system. It is proposed to build a database of e-commerce systems as a part of directories (constants, personnel, goods / products, suppliers, buyers and the hierarchy of accounting nomenclatures. The package of documents regulating the organization of accounting at an enterprise should include: the provision on the accounting services, the order on the accounting policy, the job descriptions, the schedules of information exchange, the report card and

Resource Allocation and Outpatient Appointment Scheduling Using Simulation Optimization

Directory of Open Access Journals (Sweden)

Carrie Ka Yuk Lin

2017-01-01

Full Text Available This paper studies the real-life problems of outpatient clinics having the multiple objectives of minimizing resource overtime, patient waiting time, and waiting area congestion. In the clinic, there are several patient classes, each of which follows different treatment procedure flow paths through a multiphase and multiserver queuing system with scarce staff and limited space. We incorporate the stochastic factors for the probabilities of the patients being diverted into different flow paths, patient punctuality, arrival times, procedure duration, and the number of accompanied visitors. We present a novel two-stage simulation-based heuristic algorithm to assess various tactical and operational decisions for optimizing the multiple objectives. In stage I, we search for a resource allocation plan, and in stage II, we determine a block appointment schedule by patient class and a service discipline for the daily operational level. We also explore the effects of the separate strategies and their integration to identify the best possible combination. The computational experiments are designed on the basis of data from a study of an ophthalmology clinic in a public hospital. Results show that our approach significantly mitigates the undesirable outcomes by integrating the strategies and increasing the resource flexibility at the bottleneck procedures without adding resources.

Day-Ahead Scheduling Considering Demand Response as a Frequency Control Resource

Directory of Open Access Journals (Sweden)

Yu-Qing Bao

2017-01-01

Full Text Available The development of advanced metering technologies makes demand response (DR able to provide fast response services, e.g., primary frequency control. It is recognized that DR can contribute to the primary frequency control like thermal generators. This paper proposes a day-ahead scheduling method that considers DR as a frequency control resource, so that the DR resources can be dispatched properly with other resources. In the proposed method, the objective of frequency control is realized by defining a frequency limit equation under a supposed contingency. The frequency response model is used to model the dynamics of system frequency. The nonlinear frequency limit equation is transformed to a linear arithmetic equation by piecewise linearization, so that the problem can be solved by mixed integer linear programming (MILP. Finally, the proposed method is verified on numerical examples.

Electronic Resource Management Systems

Directory of Open Access Journals (Sweden)

Mark Ellingsen

2004-10-01

Full Text Available Computer applications which deal with electronic resource management (ERM are quite a recent development. They have grown out of the need to manage the burgeoning number of electronic resources particularly electronic journals. Typically, in the early years of e-journal acquisition, library staff provided an easy means of accessing these journals by providing an alphabetical list on a web page. Some went as far as categorising the e-journals by subject and then grouping the journals either on a single web page or by using multiple pages. It didn't take long before it was recognised that it would be more efficient to dynamically generate the pages from a database rather than to continually edit the pages manually. Of course, once the descriptive metadata for an electronic journal was held within a database the next logical step was to provide administrative forms whereby that metadata could be manipulated. This in turn led to demands for incorporating more information and more functionality into the developing application.

Electronic Resources Management Project Presentation 2012

KAUST Repository

Ramli, Rindra M.

2012-11-05

This presentation describes the electronic resources management project undertaken by the KAUST library. The objectives of this project is to migrate information from MS Sharepoint to Millennium ERM module. One of the advantages of this migration is to consolidate all electronic resources into a single and centralized location. This would allow for better information sharing among library staff.

Multi-objective generation scheduling with hybrid energy resources

Science.gov (United States)

Trivedi, Manas

In economic dispatch (ED) of electric power generation, the committed generating units are scheduled to meet the load demand at minimum operating cost with satisfying all unit and system equality and inequality constraints. Generation of electricity from the fossil fuel releases several contaminants into the atmosphere. So the economic dispatch objective can no longer be considered alone due to the environmental concerns that arise from the emissions produced by fossil fueled electric power plants. This research is proposing the concept of environmental/economic generation scheduling with traditional and renewable energy sources. Environmental/economic dispatch (EED) is a multi-objective problem with conflicting objectives since emission minimization is conflicting with fuel cost minimization. Production and consumption of fossil fuel and nuclear energy are closely related to environmental degradation. This causes negative effects to human health and the quality of life. Depletion of the fossil fuel resources will also be challenging for the presently employed energy systems to cope with future energy requirements. On the other hand, renewable energy sources such as hydro and wind are abundant, inexhaustible and widely available. These sources use native resources and have the capacity to meet the present and the future energy demands of the world with almost nil emissions of air pollutants and greenhouse gases. The costs of fossil fuel and renewable energy are also heading in opposite directions. The economic policies needed to support the widespread and sustainable markets for renewable energy sources are rapidly evolving. The contribution of this research centers on solving the economic dispatch problem of a system with hybrid energy resources under environmental restrictions. It suggests an effective solution of renewable energy to the existing fossil fueled and nuclear electric utilities for the cheaper and cleaner production of electricity with hourly

A multi-objective optimization of the active and reactive resource scheduling at a distribution level in a smart grid context

DEFF Research Database (Denmark)

Sousa, Tiago; Morais, Hugo; Vale, Zita

2015-01-01

In the traditional paradigm, the large power plants supply the reactive power required at a transmission level and the capacitors and transformer tap changer were also used at a distribution level. However, in a near future will be necessary to schedule both active and reactive power...... at a distribution level, due to the high number of resources connected in distribution levels. This paper proposes a new multi-objective methodology to deal with the optimal resource scheduling considering the distributed generation, electric vehicles and capacitor banks for the joint active and reactive power...... scheduling. The proposed methodology considers the minimization of the cost (economic perspective) of all distributed resources, and the minimization of the voltage magnitude difference (technical perspective) in all buses. The Pareto front is determined and a fuzzy-based mechanism is applied to present...

Optimization of horizontal microcode within and beyond basic blocks: an application of processor scheduling with resources

Energy Technology Data Exchange (ETDEWEB)

Fisher, J.A.

1979-10-01

Microprogram optimization is the rearrangement of microcode written vertically, with one operation issued per step, into legal horizontal microinstructions, in which several operations are issued each instruction cycle. The rearrangement is done in a way that approximately minimizes the running time of the code. This problem is identified with the problem of processor scheduling with resource constraints. Thus, the problem of optimizing basic blocks of microcode can be seen to be np-complete; however, approximate methods for basic blocks which have good records in other, similar scheduling environments can be used. In priority list scheduling the tasks are ordered according to some evaluation function, and then schedules are found by repeated scans of the list. Several evaluation functions are shown to perform very well on large samples of various classes of random data-precedence graphs with characteristics similar to those derived from microprograms. A method of spotting resource bottlenecks in the derived data-precedence graph enables one to obtain a resource-considerate evaluation function, in which tasks which contribute directly to or precede bottlenecks have their priorities raised. The complexity of the calculations necessary to compute the lower bound was greatly reduced. A method is suggested for optimizing beyond basic blocks. Groups of basic blocks are treated as if they were one block; the information necessary to control the motion of tasks between blocks is encoded as data-precedence constraints on the conditional tasks. Long paths of code can thus be optimized, with no back branches, by the same methods used for basic blocks. 9 figures, 6 tables.

A Multi-layer Dynamic Model for Coordination Based Group Decision Making in Water Resource Allocation and Scheduling

Science.gov (United States)

Huang, Wei; Zhang, Xingnan; Li, Chenming; Wang, Jianying

Management of group decision-making is an important issue in water source management development. In order to overcome the defects in lacking of effective communication and cooperation in the existing decision-making models, this paper proposes a multi-layer dynamic model for coordination in water resource allocation and scheduling based group decision making. By introducing the scheme-recognized cooperative satisfaction index and scheme-adjusted rationality index, the proposed model can solve the problem of poor convergence of multi-round decision-making process in water resource allocation and scheduling. Furthermore, the problem about coordination of limited resources-based group decision-making process can be solved based on the effectiveness of distance-based group of conflict resolution. The simulation results show that the proposed model has better convergence than the existing models.

PRINCIPLES OF CONTENT FORMATION EDUCATIONAL ELECTRONIC RESOURCE

Directory of Open Access Journals (Sweden)

О Ю Заславская

2017-12-01

Full Text Available The article considers modern possibilities of information and communication technologies for the design of electronic educational resources. The conceptual basis of the open educational multimedia system is based on the modular architecture of the electronic educational resource. The content of the electronic training module can be implemented in several versions of the modules: obtaining information, practical exercises, control. The regularities in the teaching process in modern pedagogical theory are considered: general and specific, and the principles for the formation of the content of instruction at different levels are defined, based on the formulated regularities. On the basis of the analysis, the principles of the formation of the electronic educational resource are determined, taking into account the general and didactic patterns of teaching.As principles of the formation of educational material for obtaining information for the electronic educational resource, the article considers: the principle of methodological orientation, the principle of general scientific orientation, the principle of systemic nature, the principle of fundamentalization, the principle of accounting intersubject communications, the principle of minimization. The principles of the formation of the electronic training module of practical studies in the article include: the principle of systematic and dose based consistency, the principle of rational use of study time, the principle of accessibility. The principles of the formation of the module for monitoring the electronic educational resource can be: the principle of the operationalization of goals, the principle of unified identification diagnosis.

Resource management framework for QoS scheduling in IEEE 802.16 WiMAX networks

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2009-01-01

IEEE 802.16, also known as WiMAX, has received much attention recently for its capability to support multiple types of applications with diverse Quality-of-Service (QoS) requirements. Beyond what the standard has defined, radio resource management (RRM) still remains an open issue, which plays...... an important role in QoS provisioning for different types of services. In this chapter, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module...

Downlink resource management for QoS scheduling in IEEE 802.16 WiMAX networks

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2010-01-01

IEEE 802.16, also known as WiMAX, has received much attention recently for its capability to support multiple types of applications with diverse Quality-of-Service (QoS) requirements. Beyond what the standard has defined, radio resource management (RRM) still remains an open issue, which plays...... an important role in QoS provisioning for different types of services. In this paper, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module. A two...

Implementing CORAL: An Electronic Resource Management System

Science.gov (United States)

Whitfield, Sharon

2011-01-01

A 2010 electronic resource management survey conducted by Maria Collins of North Carolina State University and Jill E. Grogg of University of Alabama Libraries found that the top six electronic resources management priorities included workflow management, communications management, license management, statistics management, administrative…

Managing electronic resources a LITA guide

CERN Document Server

Weir, Ryan O

2012-01-01

Informative, useful, current, Managing Electronic Resources: A LITA Guide shows how to successfully manage time, resources, and relationships with vendors and staff to ensure personal, professional, and institutional success.

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.

A Priority Rule-Based Heuristic for Resource Investment Project Scheduling Problem with Discounted Cash Flows and Tardiness Penalties

Directory of Open Access Journals (Sweden)

Amir Abbas Najafi

2009-01-01

Full Text Available Resource investment problem with discounted cash flows (RIPDCFs is a class of project scheduling problem. In RIPDCF, the availability levels of the resources are considered decision variables, and the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, we consider a new RIPDCF in which tardiness of project is permitted with defined penalty. We mathematically formulated the problem and developed a heuristic method to solve it. The results of the performance analysis of the proposed method show an effective solution approach to the problem.

Multiresource allocation and scheduling for periodic soft real-time applications

Science.gov (United States)

Gopalan, Kartik; Chiueh, Tzi-cker

2001-12-01

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

An Effective Scheduling-Based RFID Reader Collision Avoidance Model and Its Resource Allocation via Artificial Immune Network

OpenAIRE

Wang, Shanjin; Li, Zhonghua; He, Chunhui; Li, Jianming

2016-01-01

Radio frequency identification, that is, RFID, is one of important technologies in Internet of Things. Reader collision does impair the tag identification efficiency of an RFID system. Many developed methods, for example, the scheduling-based series, that are used to avoid RFID reader collision, have been developed. For scheduling-based methods, communication resources, that is, time slots, channels, and power, are optimally assigned to readers. In this case, reader collision avoidance is equ...

Collectives for Multiple Resource Job Scheduling Across Heterogeneous Servers

Science.gov (United States)

Tumer, K.; Lawson, J.

2003-01-01

Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.

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

Real-Time Robust Adaptive Modeling and Scheduling for an Electronic Commerce Server

Science.gov (United States)

Du, Bing; Ruan, Chun

With the increasing importance and pervasiveness of Internet services, it is becoming a challenge for the proliferation of electronic commerce services to provide performance guarantees under extreme overload. This paper describes a real-time optimization modeling and scheduling approach for performance guarantee of electronic commerce servers. We show that an electronic commerce server may be simulated as a multi-tank system. A robust adaptive server model is subject to unknown additive load disturbances and uncertain model matching. Overload control techniques are based on adaptive admission control to achieve timing guarantees. We evaluate the performance of the model using a complex simulation that is subjected to varying model parameters and massive overload.

Multi-core job submission and grid resource scheduling for ATLAS AthenaMP

CERN Document Server

Crooks, D; The ATLAS collaboration; Harrington, R; Purdie, S; Severini, H; Skipsey, S; Tsulaia, V; Washbrook, A

2012-01-01

AthenaMP is the multi-core implementation of the ATLAS software framework and allows the efficient sharing of memory pages between multiple threads of execution. This has now been validated for production and delivers a significant reduction on overall memory footprint with negligible CPU overhead. Before AthenaMP can be routinely run on the LHC Computing Grid, it must be determined how the computing resources available to ATLAS can best exploit the notable improvements delivered by switching to this multi-process model. In particular, there is a need to identify and assess the potential impact of scheduling issues where single core and multi-core job queues have access to the same underlying resources. A study into the effectiveness and scalability of AthenaMP in a production environment will be presented. Submitting AthenaMP tasks to the Tier-0 and candidate Tier-2 sites will allow detailed measurement of worker node performance and also highlight the relative performance of local resource management system...

Gender Analysis Of Electronic Information Resource Use: The Case ...

African Journals Online (AJOL)

Based on the findings the study concluded that access and use of electronic information resources creates a “social digital divide” along gender lines. The study ... Finally, the library needs to change its marketing strategies on the availability of electronic information resources to increase awareness of these resources.

Users satisfaction with electronic information resources and services ...

African Journals Online (AJOL)

This study investigated users satisfaction on the use of electronic information resources and services in MTN Net libraries in ABU & UNIBEN. Two objectives and one null hypotheses were formulated and tested with respect to the users' satisfaction on electronic information resources and services in MTN Net libraries in ...

A random-key encoded harmony search approach for energy-efficient production scheduling with shared resources

Science.gov (United States)

Garcia-Santiago, C. A.; Del Ser, J.; Upton, C.; Quilligan, F.; Gil-Lopez, S.; Salcedo-Sanz, S.

2015-11-01

When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.

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

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.

Organizational matters of competition in electronic educational resources

Directory of Open Access Journals (Sweden)

Ирина Карловна Войтович

2015-12-01

Full Text Available The article examines the experience of the Udmurt State University in conducting competitions of educational publications and electronic resources. The purpose of such competitions is to provide methodological support to educational process. The main focus is on competition of electronic educational resources. The technology of such contests is discussed through detailed analysis of the main stages of the contest. It is noted that the main task of the preparatory stage of the competition is related to the development of regulations on competition and the definition of criteria for selection of the submitted works. The paper also proposes a system of evaluation criteria of electronic educational resources developed by members of the contest organizing committee and jury members. The article emphasizes the importance of not only the preparatory stages of the competition, but also measures for its completion, aimed at training teachers create quality e-learning resources.

CHALLENGES OF ELECTRONIC INFORMATION RESOURCES IN ...

African Journals Online (AJOL)

This paper discusses the role of policy for proper and efficient library services in the electronic era. It points out some of the possible dangers of embarking in electronic resources without a proper focus at hand. Thus, it calls for today's librarians and policy makers to brainstorm and come up with working policies suitable to ...

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

Use of Electronic Resources in a Private University in Nigeria ...

African Journals Online (AJOL)

The study examined awareness and constraints in the use of electronic resources by lecturers and students of Ajayi Crowther University, Oyo, Nigeria. It aimed at justifying the resources expended in the provision of electronic resources in terms of awareness, patronage and factors that may be affecting awareness and use ...

Electronic Resources Management System: Recommendation Report 2017

KAUST Repository

Ramli, Rindra M.

2017-05-01

This recommendation report provides an overview of the selection process for the new Electronic Resources Management System. The library has decided to move away from Innovative Interfaces Millennium ERM module. The library reviewed 3 system as potential replacements namely: Proquest 360 Resource Manager, Ex Libris Alma and Open Source CORAL ERMS. After comparing and trialling the systems, it was decided to go for Proquest 360 Resource Manager.

use of electronic resources by graduate students of the department

African Journals Online (AJOL)

respondent's access electronic resources from the internet via Cybercafé .There is a high ... KEY WORDS: Use, Electronic Resources, Graduate Students, Cybercafé. INTRODUCTION ... Faculty of Education, University of Uyo, Uyo. Olu Olat ...

Flow-shop scheduling problem under uncertainties: Review and trends

Directory of Open Access Journals (Sweden)

Eliana María González-Neira

2017-03-01

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

Electronic resource management practical perspectives in a new technical services model

CERN Document Server

Elguindi, Anne

2012-01-01

A significant shift is taking place in libraries, with the purchase of e-resources accounting for the bulk of materials spending. Electronic Resource Management makes the case that technical services workflows need to make a corresponding shift toward e-centric models and highlights the increasing variety of e-formats that are forcing new developments in the field.Six chapters cover key topics, including: technical services models, both past and emerging; staffing and workflow in electronic resource management; implementation and transformation of electronic resource management systems; the ro

Disallowing Same-program Co-schedules to Improve Efficiency in Quad-core Servers

OpenAIRE

de Blanche, Andreas; Lundqvist, Thomas

2017-01-01

Programs running on different cores in a multicore server are often forced to share resources like off-chip memory, caches, I/O devices, etc. This resource sharing often leads to degraded performance, a slowdown, for the programs that share the resources. A job scheduler can improve performance by co-scheduling programs that use different resources on the same server. The most common approach to solve this co-scheduling problem has been to make job-schedulers resource aware, finding ways to c...

Utilization of electronic information resources by academic staff at ...

African Journals Online (AJOL)

The study investigated the utilization of Electronic Information resources by the academic staff of Makerere University in Uganda. It examined the academic staff awareness of the resources available, the types of resources provided by the Makerere University Library, the factors affecting resource utilization. The study was ...

An Effective Scheduling-Based RFID Reader Collision Avoidance Model and Its Resource Allocation via Artificial Immune Network

Directory of Open Access Journals (Sweden)

Shanjin Wang

2016-01-01

Full Text Available Radio frequency identification, that is, RFID, is one of important technologies in Internet of Things. Reader collision does impair the tag identification efficiency of an RFID system. Many developed methods, for example, the scheduling-based series, that are used to avoid RFID reader collision, have been developed. For scheduling-based methods, communication resources, that is, time slots, channels, and power, are optimally assigned to readers. In this case, reader collision avoidance is equivalent to an optimization problem related to resource allocation. However, the existing methods neglect the overlap between the interrogation regions of readers, which reduces the tag identification rate (TIR. To resolve this shortage, this paper attempts to build a reader-to-reader collision avoidance model considering the interrogation region overlaps (R2RCAM-IRO. In addition, an artificial immune network for resource allocation (RA-IRO-aiNet is designed to optimize the proposed model. For comparison, some comparative numerical simulations are arranged. The simulation results show that the proposed R2RCAM-IRO is an effective model where TIR is improved significantly. And especially in the application of reader-to-reader collision avoidance, the proposed RA-IRO-aiNet outperforms GA, opt-aiNet, and PSO in the total coverage area of readers.

Electronic Resources Management Project Presentation 2012

KAUST Repository

Ramli, Rindra M.

2012-01-01

This presentation describes the electronic resources management project undertaken by the KAUST library. The objectives of this project is to migrate information from MS Sharepoint to Millennium ERM module. One of the advantages of this migration

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

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

A case study: the initiative to improve RN scheduling at Hamilton Health Sciences.

Science.gov (United States)

Wallace, Laurel-Anne; Pierson, Sharon

2008-01-01

In 2003, Hamilton Health Sciences embarked on an initiative to improve and standardize nursing schedules and scheduling practices. The scheduling project was one of several initiatives undertaken by a corporate-wide Nursing Resource Group established to enhance the work environment and patient care and to ensure appropriate utilization of nursing resources across the organization's five hospitals. This article focuses on major activities undertaken in the scheduling initiative. The step-by-step approach described, plus examples of the scheduling resources developed and samples of extended-tour schedules, will all provide insight, potential strategies and practical help for nursing administrators, human resources (HR) personnel and others interested in improving nurse scheduling.

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

PLAN-IT - Scheduling assistant for solar system exploration

International Nuclear Information System (INIS)

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

1987-01-01

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

Practical guide to electronic resources in the humanities

CERN Document Server

Dubnjakovic, Ana

2010-01-01

From full-text article databases to digitized collections of primary source materials, newly emerging electronic resources have radically impacted how research in the humanities is conducted and discovered. This book, covering high-quality, up-to-date electronic resources for the humanities, is an easy-to-use annotated guide for the librarian, student, and scholar alike. It covers online databases, indexes, archives, and many other critical tools in key humanities disciplines including philosophy, religion, languages and literature, and performing and visual arts. Succinct overviews of key eme

An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem

DEFF Research Database (Denmark)

Muller, Laurent Flindt

2009-01-01

We present an application of an Adaptive Large Neighborhood Search (ALNS) algorithm to the Resource-constrained Project Scheduling Problem (RCPSP). The ALNS framework was first proposed by Pisinger and Røpke [19] and can be described as a large neighborhood search algorithm with an adaptive layer......, where a set of destroy/repair neighborhoods compete to modify the current solution in each iteration of the algorithm. Experiments are performed on the wellknown J30, J60 and J120 benchmark instances, which show that the proposed algorithm is competitive and confirms the strength of the ALNS framework...

Utilisation of Electronic Information Resources By Lecturers in ...

African Journals Online (AJOL)

This study assesses the use of information resources, specifically, electronic databases by lecturers/teachers in Universities and Colleges of Education in South Western Nigeria. Information resources are central to teachers' education. It provides lecturers/teachers access to information that enhances research and ...

Location-based Scheduling

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

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

Discipline, availability of electronic resources and the use of Finnish National Electronic Library - FinELib

Directory of Open Access Journals (Sweden)

Sanna Torma

2004-01-01

Full Text Available This study elaborated relations between digital library use by university faculty, users' discipline and the availability of key resources in the Finnish National Electronic Library (FinELib, Finnish national digital library, by using nationwide representative survey data. The results show that the perceived availability of key electronic resources by researchers in FinELib was a stronger predictor of the frequency and purpose of use of its services than users' discipline. Regardless of discipline a good perceived provision of central resources led to a more frequent use of FinELib. The satisfaction with the services did not vary with the discipline, but with the perceived availability of resources.

The Role of the Acquisitions Librarian in Electronic Resources Management

Science.gov (United States)

Pomerantz, Sarah B.

2010-01-01

With the ongoing shift to electronic formats for library resources, acquisitions librarians, like the rest of the profession, must adapt to the rapidly changing landscape of electronic resources by keeping up with trends and mastering new skills related to digital publishing, technology, and licensing. The author sought to know what roles…

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.

Analysis of Pedagogic Potential of Electronic Educational Resources with Elements of Autodidactics

Directory of Open Access Journals (Sweden)

Igor A.

2018-03-01

Full Text Available Introduction: in recent years didactic properties of electronic educational resources undergo considerable changes, nevertheless, the question of studying of such complete phenomenon as “an electronic educational resource with autodidactics elements” remains open, despite sufficient scientific base of researches of the terms making this concept. Article purpose – determination of essence of electronic educational resources with autodidactics elements. Materials and Methods: the main method of research was the theoretical analysis of the pedagogical and psychological literature on the problem under study. We used the theoretical (analysis, synthesis, comparison and generalization methods, the method of interpretation, pedagogical modeling, and empirical methods (observation, testing, conversation, interview, analysis of students’ performance, pedagogical experiment, peer review. Results: we detected the advantages of electronic educational resources in comparison with traditional ones. The concept of autodidactics as applied to the subject of research is considered. Properties of electronic educational resources with a linear and nonlinear principle of construction are studied.The influence of the principle of construction on the development of the learners’ qualities is shown. We formulated an integral definition of electronic educational resources with elements of autodidactics, namely, the variability, adaptivity and cyclicity of training. A model of the teaching-learning process with electronic educational resources is developed. Discussion and Conclusions: further development of a problem will allow to define whether electronic educational resources with autodidactics elements pedagogical potential for realization of educational and self-educational activity of teachers have, to modify technological procedures taking into account age features of students, their specialties and features of the organization of process of training of

Preservation and conservation of electronic information resources of ...

African Journals Online (AJOL)

The major holdings of the broadcast libraries of the Nigerian Television Authority (NTA) are electronic information resources; therefore, providing safe places for general management of these resources have aroused interest in the industry in Nigeria for sometimes. The need to study the preservation and conservation of ...

18 CFR 420.41 - Schedule of water charges.

Science.gov (United States)

2010-04-01

... 18 Conservation of Power and Water Resources 2 2010-04-01 2010-04-01 false Schedule of water charges. 420.41 Section 420.41 Conservation of Power and Water Resources DELAWARE RIVER BASIN COMMISSION ADMINISTRATIVE MANUAL BASIN REGULATIONS-WATER SUPPLY CHARGES Charges; Exemptions § 420.41 Schedule of water...

Building an electronic resource collection a practical guide

CERN Document Server

Lee, Stuart D

2004-01-01

This practical book guides information professionals step-by-step through building and managing an electronic resource collection. It outlines the range of electronic products currently available in abstracting and indexing, bibliographic, and other services and then describes how to effectively select, evaluate and purchase them.

Analysis of Human Resources Management Strategy in China Electronic Commerce Enterprises

Science.gov (United States)

Shao, Fang

The paper discussed electronic-commerce's influence on enterprise human resources management, proposed and proved the human resources management strategy which electronic commerce enterprise should adopt from recruitment strategy to training strategy, keeping talent strategy and other ways.

Using XML Technologies to Organize Electronic Reference Resources

OpenAIRE

Huser, Vojtech; Del Fiol, Guilherme; Rocha, Roberto A.

2005-01-01

Provision of access to reference electronic resources to clinicians is becoming increasingly important. We have created a framework for librarians to manage access to these resources at an enterprise level, rather than at the individual hospital libraries. We describe initial project requirements, implementation details, and some preliminary results.

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

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

Electronic Resources and Mission Creep: Reorganizing the Library for the Twenty-First Century

Science.gov (United States)

Stachokas, George

2009-01-01

The position of electronic resources librarian was created to serve as a specialist in the negotiation of license agreements for electronic resources, but mission creep has added more functions to the routine work of electronic resources such as cataloging, gathering information for collection development, and technical support. As electronic…

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 New Heuristic Providing an Effective Initial Solution for a Simulated Annealing approach to Energy Resource Scheduling in Smart Grids

DEFF Research Database (Denmark)

Sousa, Tiago M; Morais, Hugo; Castro, R.

2014-01-01

scheduling problem. Therefore, the use of metaheuristics is required to obtain good solutions in a reasonable amount of time. This paper proposes two new heuristics, called naive electric vehicles charge and discharge allocation and generation tournament based on cost, developed to obtain an initial solution...... to be used in the energy resource scheduling methodology based on simulated annealing previously developed by the authors. The case study considers two scenarios with 1000 and 2000 electric vehicles connected in a distribution network. The proposed heuristics are compared with a deterministic approach...

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

GLOA: A New Job Scheduling Algorithm for Grid Computing

Directory of Open Access Journals (Sweden)

Zahra Pooranian

2013-03-01

Full Text Available The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA, to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.

Electronic Resources Management System: Recommendation Report 2017

KAUST Repository

Ramli, Rindra M.

2017-01-01

This recommendation report provides an overview of the selection process for the new Electronic Resources Management System. The library has decided to move away from Innovative Interfaces Millennium ERM module. The library reviewed 3 system

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

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.

Sort-Mid tasks scheduling algorithm in grid computing.

Science.gov (United States)

Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

2015-11-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

The Internet School of Medicine: use of electronic resources by medical trainees and the reliability of those resources.

Science.gov (United States)

Egle, Jonathan P; Smeenge, David M; Kassem, Kamal M; Mittal, Vijay K

2015-01-01

Electronic sources of medical information are plentiful, and numerous studies have demonstrated the use of the Internet by patients and the variable reliability of these sources. Studies have investigated neither the use of web-based resources by residents, nor the reliability of the information available on these websites. A web-based survey was distributed to surgical residents in Michigan and third- and fourth-year medical students at an American allopathic and osteopathic medical school and a Caribbean allopathic school regarding their preferred sources of medical information in various situations. A set of 254 queries simulating those faced by medical trainees on rounds, on a written examination, or during patient care was developed. The top 5 electronic resources cited by the trainees were evaluated for their ability to answer these questions accurately, using standard textbooks as the point of reference. The respondents reported a wide variety of overall preferred resources. Most of the 73 responding medical trainees favored textbooks or board review books for prolonged studying, but electronic resources are frequently used for quick studying, clinical decision-making questions, and medication queries. The most commonly used electronic resources were UpToDate, Google, Medscape, Wikipedia, and Epocrates. UpToDate and Epocrates had the highest percentage of correct answers (47%) and Wikipedia had the lowest (26%). Epocrates also had the highest percentage of wrong answers (30%), whereas Google had the lowest percentage (18%). All resources had a significant number of questions that they were unable to answer. Though hardcopy books have not been completely replaced by electronic resources, more than half of medical students and nearly half of residents prefer web-based sources of information. For quick questions and studying, both groups prefer Internet sources. However, the most commonly used electronic resources fail to answer clinical queries more than half

MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler

Science.gov (United States)

Huang, Ye; Brocco, Amos; Courant, Michele; Hirsbrunner, Beat; Kuonen, Pierre

This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intelligent scheduling serving the grid community as a whole. Each MaGate scheduler instance is able to deal with dynamic scheduling conditions, with continuously arriving grid jobs. Received jobs are either allocated on local resources, or delegated to other MaGates for remote execution. The proposed MaGate simulator is based on GridSim toolkit and Alea simulator, and abstracts the features and behaviors of complex fundamental grid elements, such as grid jobs, grid resources, and grid users. Simulation of scheduling tasks is supported by a grid network overlay simulator executing distributed ant-based swarm intelligence algorithms to provide services such as group communication and resource discovery. For evaluation, a comparison of behaviors of different collaborative policies among a community of MaGates is provided. Results support the use of the proposed approach as a functional ready grid scheduler simulator.

ANALYTICAL REVIEW OF ELECTRONIC RESOURCES FOR THE STUDY OF LATIN

Directory of Open Access Journals (Sweden)

Olena Yu. Balalaieva

2014-04-01

Full Text Available The article investigates the current state of development of e-learning content in the Latin language. It is noted that the introduction of ICT in the educational space has expanded the possibility of studying Latin, opened access to digital libraries resources, made it possible to use scientific and educational potential and teaching Latin best practices of world's leading universities. A review of foreign and Ukrainian information resources and electronic editions for the study of Latin is given. Much attention was paid to the didactic potential of local and online multimedia courses of Latin, electronic textbooks, workbooks of interactive tests and exercises, various dictionaries and software translators, databases and digital libraries. Based on analysis of the world market of educational services and products the main trends in the development of information resources and electronic books are examined. It was found that multimedia courses with interactive exercises or workbooks with interactive tests, online dictionaries and translators are the most widely represented and demanded. The noticeable lagging of Ukrainian education and computer linguistics in quantitative and qualitative measures in this industry is established. The obvious drawback of existing Ukrainian resources and electronic editions for the study of Latin is their noninteractive nature. The prospects of e-learning content in Latin in Ukraine are outlined.

Elektronik Bilgi Kaynaklarının Seçimi / Selection of Electronic Information Resources

Directory of Open Access Journals (Sweden)

Pınar Al

2003-04-01

Full Text Available For many years, library users have used only from the printed media in order to get the information that they have needed. Today with the widespread use of the Web and the addition of electronic information resources to library collections, the use of information in the electronic environment as well as in printed media is started to be used. In time, such types of information resources as, electronic journals, electronic books, electronic encyclopedias, electronic dictionaries and electronic theses have been added to library collections. In this study, selection criteria that can be used for electronic information resources are discussed and suggestions are provided for libraries that try to select electronic information resources for their collections.

Access to electronic resources by visually impaired people

Directory of Open Access Journals (Sweden)

Jenny Craven

2003-01-01

Full Text Available Research into access to electronic resources by visually impaired people undertaken by the Centre for Research in Library and Information Management has not only explored the accessibility of websites and levels of awareness in providing websites that adhere to design for all principles, but has sought to enhance understanding of information seeking behaviour of blind and visually impaired people when using digital resources.

Work-family conflict and enrichment from the perspective of psychosocial resources: comparing Finnish healthcare workers by working schedules.

Science.gov (United States)

Mauno, Saija; Ruokolainen, Mervi; Kinnunen, Ulla

2015-05-01

We examined work-family conflict (WFC) and work-family enrichment (WFE) by comparing Finnish nurses, working dayshifts (non-shiftworkers, n = 874) and non-dayshifts. The non-dayshift employees worked either two different dayshifts (2-shiftworkers, n = 490) or three different shifts including nightshifts (3-shiftworkers, n = 270). Specifically, we investigated whether different resources, i.e. job control, managers' work-family support, co-workers' work-family support, control at home, personal coping strategies, and schedule satisfaction, predicted differently WFC and WFE in these three groups. Results showed that lower managers' work-family support predicted higher WFC only among 3-shiftworkers, whereas lower co-workers' support associated with increased WFC only in non-shiftworkers. In addition, shiftworkers reported higher WFC than non-shiftworkers. However, the level of WFE did not vary by schedule types. Moreover, the predictors of WFE varied only very little across schedule types. Shiftwork organizations should pay more attention to family-friendly management in order to reduce WFC among shiftworkers. Copyright © 2014 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Management Matters. Changing to Flexible Scheduling

Science.gov (United States)

Pappas, Marjorie L.

2005-01-01

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

Sort-Mid tasks scheduling algorithm in grid computing

Directory of Open Access Journals (Sweden)

Naglaa M. Reda

2015-11-01

Full Text Available Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Library training to promote electronic resource usage

DEFF Research Database (Denmark)

Frandsen, Tove Faber; Tibyampansha, Dativa; Ibrahim, Glory

2017-01-01

Purpose: Increasing the usage of electronic resources is an issue of concern for many libraries all over the world. Several studies stress the importance of information literacy and instruction in order to increase the usage. Design/methodology/approach: The present article presents the results...

Why and How to Measure the Use of Electronic Resources

Directory of Open Access Journals (Sweden)

Jean Bernon

2008-11-01

Full Text Available A complete overview of library activity implies a complete and reliable measurement of the use of both electronic resources and printed materials. This measurement is based on three sets of definitions: document types, use types and user types. There is a common model of definitions for printed materials, but a lot of questions and technical issues remain for electronic resources. In 2006 a French national working group studied these questions. It relied on the COUNTER standard, but found it insufficient and pointed out the need for local tools such as web markers and deep analysis of proxy logs. Within the French national consortium COUPERIN, a new working group is testing ERMS, SUSHI standards, Shibboleth authentication, along with COUNTER standards, to improve the counting of the electronic resources use. At this stage this counting is insufficient and its improvement will be a European challenge for the future.

Evaluation of Reliability in Risk-Constrained Scheduling of Autonomous Microgrids with Demand Response and Renewable Resources

DEFF Research Database (Denmark)

Vahedipour-Dahraie, Mostafa; Anvari-Moghaddam, Amjad; Guerrero, Josep M.

2018-01-01

of microgrid. Moreover, the impacts of different VOLL and risk aversion parameter are illustrated on the system reliability. Extensive simulation results are also presented to illustrate the impact of risk aversion on system security issues with and without DR. Numerical results demonstrate the advantages......Uncertain natures of the renewable energy resources and consumers’ participation in demand response (DR) programs have introduced new challenges to the energy and reserve scheduling of microgrids, particularly in the autonomous mode. In this paper, a risk-constrained stochastic framework...... is presented to maximize the expected profit of a microgrid operator under uncertainties of renewable resources, demand load and electricity price. In the proposed model, the trade-off between maximizing the operator’s expected profit and the risk of getting low profits in undesired scenarios is modeled...

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

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

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

Cross-Layer Scheduling and Resource Allocation for Heterogeneous Traffic in 3G LTE

Directory of Open Access Journals (Sweden)

Richard Musabe

2014-01-01

Full Text Available 3G long term evolution (LTE introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP and real-time traffic such as voice over internet protocol (VoIP. Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility under different constraints. We compared our proposed algorithm with proportional fair (PF, exponential proportional fair (EXP-PF, and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics.

Euler European Libraries and Electronic Resources in Mathematical Sciences

CERN Document Server

The Euler Project. Karlsruhe

The European Libraries and Electronic Resources (EULER) Project in Mathematical Sciences provides the EulerService site for searching out "mathematical resources such as books, pre-prints, web-pages, abstracts, proceedings, serials, technical reports preprints) and NetLab (for Internet resources), this outstanding engine is capable of simple, full, and refined searches. It also offers a browse option, which responds to entries in the author, keyword, and title fields. Further information about the Project is provided at the EULER homepage.

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

Effects of Electronic Information Resources Skills Training for Lecturers on Pedagogical Practices and Research Productivity

Science.gov (United States)

Bhukuvhani, Crispen; Chiparausha, Blessing; Zuvalinyenga, Dorcas

2012-01-01

Lecturers use various electronic resources at different frequencies. The university library's information literacy skills workshops and seminars are the main sources of knowledge of accessing electronic resources. The use of electronic resources can be said to have positively affected lecturers' pedagogical practices and their work in general. The…

Job scheduling in a heterogenous grid environment

Energy Technology Data Exchange (ETDEWEB)

Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

2004-02-11

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

On Coding of Scheduling Information in OFDM

OpenAIRE

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

2009-01-01

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

Resource-Optimal Scheduling Using Priced Timed Automata

DEFF Research Database (Denmark)

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

2004-01-01

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

Electronic Commerce Resource Centers. An Industry--University Partnership.

Science.gov (United States)

Gulledge, Thomas R.; Sommer, Rainer; Tarimcilar, M. Murat

1999-01-01

Electronic Commerce Resource Centers focus on transferring emerging technologies to small businesses through university/industry partnerships. Successful implementation hinges on a strategic operating plan, creation of measurable value for customers, investment in customer-targeted training, and measurement of performance outputs. (SK)

Extending RTA/Linux with fixed-priority scheduling with deferred preemption

NARCIS (Netherlands)

Bergsma, M.; Holenderski, M.J.; Bril, R.J.; Lukkien, J.J.; Petters, S.M.; Zijlstra, P.

2009-01-01

Fixed-Priority Scheduling with Deferred Preemption (FPDS) is a middle ground between Fixed-Priority Pre-emptive Scheduling and Fixed-Priority Non-preemptive Scheduling, and offers advantages with respect to context switch overhead and resource access control. In this paper we present our work on

Multiagent scheduling models and algorithms

CERN Document Server

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

2014-01-01

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

A Market-Based Approach to Multi-factory Scheduling

Science.gov (United States)

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

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

Distributed energy resources scheduling considering real-time resources forecast

DEFF Research Database (Denmark)

Silva, M.; Sousa, T.; Ramos, S.

2014-01-01

grids and considering day-ahead, hour-ahead and realtime time horizons. This method considers that energy resources are managed by a VPP which establishes contracts with their owners. The full AC power flow calculation included in the model takes into account network constraints. In this paper......, distribution function errors are used to simulate variations between time horizons, and to measure the performance of the proposed methodology. A 33-bus distribution network with large number of distributed resources is used....

Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support

Science.gov (United States)

Richards, Stephen F.

1992-01-01

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of Space Shuttle mission planning.

Scheduling algorithm for data relay satellite optical communication based on artificial intelligent optimization

Science.gov (United States)

Zhao, Wei-hu; Zhao, Jing; Zhao, Shang-hong; Li, Yong-jun; Wang, Xiang; Dong, Yi; Dong, Chen

2013-08-01

Optical satellite communication with the advantages of broadband, large capacity and low power consuming broke the bottleneck of the traditional microwave satellite communication. The formation of the Space-based Information System with the technology of high performance optical inter-satellite communication and the realization of global seamless coverage and mobile terminal accessing are the necessary trend of the development of optical satellite communication. Considering the resources, missions and restraints of Data Relay Satellite Optical Communication System, a model of optical communication resources scheduling is established and a scheduling algorithm based on artificial intelligent optimization is put forwarded. According to the multi-relay-satellite, multi-user-satellite, multi-optical-antenna and multi-mission with several priority weights, the resources are scheduled reasonable by the operation: "Ascertain Current Mission Scheduling Time" and "Refresh Latter Mission Time-Window". The priority weight is considered as the parameter of the fitness function and the scheduling project is optimized by the Genetic Algorithm. The simulation scenarios including 3 relay satellites with 6 optical antennas, 12 user satellites and 30 missions, the simulation result reveals that the algorithm obtain satisfactory results in both efficiency and performance and resources scheduling model and the optimization algorithm are suitable in multi-relay-satellite, multi-user-satellite, and multi-optical-antenna recourses scheduling problem.

Dynamic Scheduling for Cloud Reliability using Transportation Problem

OpenAIRE

P. Balasubramanie; S. K. Senthil Kumar

2012-01-01

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

Missed deadline notification in best-effort schedulers

Science.gov (United States)

Banachowski, Scott A.; Wu, Joel; Brandt, Scott A.

2003-12-01

It is common to run multimedia and other periodic, soft real-time applications on general-purpose computer systems. These systems use best-effort scheduling algorithms that cannot guarantee applications will receive responsive scheduling to meet deadline or timing requirements. We present a simple mechanism called Missed Deadline Notification (MDN) that allows applications to notify the system when they do not receive their desired level of responsiveness. Consisting of a single system call with no arguments, this simple interface allows the operating system to provide better support for soft real-time applications without any a priori information about their timing or resource needs. We implemented MDN in three different schedulers: Linux, BEST, and BeRate. We describe these implementations and their performance when running real-time applications and discuss policies to prevent applications from abusing MDN to gain extra resources.

30 CFR 285.821 - Will MMS conduct scheduled and unscheduled inspections?

Science.gov (United States)

2010-07-01

... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Will MMS conduct scheduled and unscheduled..., COPs and GAPs Inspections and Assessments § 285.821 Will MMS conduct scheduled and unscheduled inspections? The MMS will conduct both scheduled and unscheduled inspections. ...

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.

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.

Cross layer scheduling algorithm for LTE Downlink

DEFF Research Database (Denmark)

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

2012-01-01

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

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

Science.gov (United States)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

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

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

Optimal Grid Scheduling Using Improved Artificial Bee Colony Algorithm

OpenAIRE

T. Vigneswari; M. A. Maluk Mohamed

2015-01-01

Job Scheduling plays an important role for efficient utilization of grid resources available across different domains and geographical zones. Scheduling of jobs is challenging and NPcomplete. Evolutionary / Swarm Intelligence algorithms have been extensively used to address the NP problem in grid scheduling. Artificial Bee Colony (ABC) has been proposed for optimization problems based on foraging behaviour of bees. This work proposes a modified ABC algorithm, Cluster Hete...

Multi-agent Pareto appointment exchanging in hospital patient scheduling

NARCIS (Netherlands)

I.B. Vermeulen (Ivan); S.M. Bohte (Sander); D.J.A. Somefun (Koye); J.A. La Poutré (Han)

2007-01-01

htmlabstractWe present a dynamic and distributed approach to the hospital patient scheduling problem, in which patients can have multiple appointments that have to be scheduled to different resources. To efficiently solve this problem we develop a multi-agent Pareto-improvement appointment

Multi-agent Pareto appointment exchanging in hospital patient scheduling

NARCIS (Netherlands)

Vermeulen, I.B.; Bohté, S.M.; Somefun, D.J.A.; Poutré, La J.A.

2007-01-01

We present a dynamic and distributed approach to the hospital patient scheduling problem, in which patients can have multiple appointments that have to be scheduled to different resources. To efficiently solve this problem we develop a multi-agent Pareto-improvement appointment exchanging algorithm:

Hierarchical Scheduling Framework Based on Compositional Analysis Using Uppaal

DEFF Research Database (Denmark)

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

2014-01-01

This paper introduces a reconfigurable compositional scheduling framework, in which the hierarchical structure, the scheduling policies, the concrete task behavior and the shared resources can all be reconfigured. The behavior of each periodic preemptive task is given as a list of timed actions, ...

5 CFR 9901.212 - Pay schedules and pay bands.

Science.gov (United States)

2010-01-01

... Section 9901.212 Administrative Personnel DEPARTMENT OF DEFENSE HUMAN RESOURCES MANAGEMENT AND LABOR RELATIONS SYSTEMS (DEPARTMENT OF DEFENSE-OFFICE OF PERSONNEL MANAGEMENT) DEPARTMENT OF DEFENSE NATIONAL... Secretary may establish one or more pay schedules within each career group. (b) Each pay schedule may...

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

Science.gov (United States)

Niu, X. N.; Tang, H.; Wu, L. X.

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

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.

Modeling of Agile Intelligent Manufacturing-oriented Production Scheduling System

Institute of Scientific and Technical Information of China (English)

Zhong-Qi Sheng; Chang-Ping Tang; Ci-Xing Lv

2010-01-01

Agile intelligent manufacturing is one of the new manufacturing paradigms that adapt to the fierce globalizing market competition and meet the survival needs of the enterprises, in which the management and control of the production system have surpassed the scope of individual enterprise and embodied some new features including complexity, dynamicity, distributivity, and compatibility. The agile intelligent manufacturing paradigm calls for a production scheduling system that can support the cooperation among various production sectors, the distribution of various resources to achieve rational organization, scheduling and management of production activities. This paper uses multi-agents technology to build an agile intelligent manufacturing-oriented production scheduling system. Using the hybrid modeling method, the resources and functions of production system are encapsulated, and the agent-based production system model is established. A production scheduling-oriented multi-agents architecture is constructed and a multi-agents reference model is given in this paper.

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

Directory of Open Access Journals (Sweden)

Weiwei Lin

2016-01-01

Full Text Available Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual machine power efficiency-aware greedy scheduling algorithm (VPEGS. As a heuristic algorithm, VPEGS estimates task energy by considering factors including task resource demands, VM power efficiency, and server workload before scheduling tasks in a greedy manner. We simulated a heterogeneous VM cluster and conducted experiment to evaluate the effectiveness of VPEGS. Simulation results show that VPEGS effectively reduced total energy consumption by more than 20% without producing large scheduling overheads. With the similar heuristic ideology, it outperformed Min-Min and RASA with respect to energy saving by about 29% and 28%, respectively.

Request-Driven Schedule Automation for the Deep Space Network

Science.gov (United States)

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

2010-01-01

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

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.

Integrating job scheduling and constrained network routing

DEFF Research Database (Denmark)

Gamst, Mette

2010-01-01

This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...

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.

Multisensors Cooperative Detection Task Scheduling Algorithm Based on Hybrid Task Decomposition and MBPSO

Directory of Open Access Journals (Sweden)

Changyun Liu

2017-01-01

Full Text Available A multisensor scheduling algorithm based on the hybrid task decomposition and modified binary particle swarm optimization (MBPSO is proposed. Firstly, aiming at the complex relationship between sensor resources and tasks, a hybrid task decomposition method is presented, and the resource scheduling problem is decomposed into subtasks; then the sensor resource scheduling problem is changed into the match problem of sensors and subtasks. Secondly, the resource match optimization model based on the sensor resources and tasks is established, which considers several factors, such as the target priority, detecting benefit, handover times, and resource load. Finally, MBPSO algorithm is proposed to solve the match optimization model effectively, which is based on the improved updating means of particle’s velocity and position through the doubt factor and modified Sigmoid function. The experimental results show that the proposed algorithm is better in terms of convergence velocity, searching capability, solution accuracy, and efficiency.

Hybrid job shop scheduling

NARCIS (Netherlands)

Schutten, Johannes M.J.

1995-01-01

We consider the problem of scheduling jobs in a hybrid job shop. We use the term 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times. The Shifting Bottleneck procedure can be generalized to deal with

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

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.

Analytical Study of Usage of Electronic Information Resources at Pharmacopoeial Libraries in India

Directory of Open Access Journals (Sweden)

Sunil Tyagi

2014-02-01

Full Text Available The objective of this study is to know the rate and purpose of the use of e-resource by the scientists at pharmacopoeial libraries in India. Among other things, this study examined the preferences of the scientists toward printed books and journals, electronic information resources, and pattern of using e-resources. Non-probability sampling specially accidental and purposive technique was applied in the collection of primary data through administration of user questionnaire. The sample respondents chosen for the study consists of principle scientific officer, senior scientific officer, scientific officer, and scientific assistant of different division of the laboratories, namely, research and development, pharmaceutical chemistry, pharmacovigilance, pharmacology, pharmacogonosy, and microbiology. The findings of the study reveal the personal experiences and perceptions they have had on practice and research activity using e-resource. The major findings indicate that of the total anticipated participants, 78% indicated that they perceived the ability to use computer for electronic information resources. The data analysis shows that all the scientists belonging to the pharmacopoeial libraries used electronic information resources to address issues relating to drug indexes and compendia, monographs, drugs obtained through online databases, e-journals, and the Internet sources—especially polices by regulatory agencies, contacts, drug promotional literature, and standards.

Optimized maritime emergency resource allocation under dynamic demand.

Directory of Open Access Journals (Sweden)

Wenfen Zhang

Full Text Available Emergency resource is important for people evacuation and property rescue when accident occurs. The relief efforts could be promoted by a reasonable emergency resource allocation schedule in advance. As the marine environment is complicated and changeful, the place, type, severity of maritime accident is uncertain and stochastic, bringing about dynamic demand of emergency resource. Considering dynamic demand, how to make a reasonable emergency resource allocation schedule is challenging. The key problem is to determine the optimal stock of emergency resource for supplier centers to improve relief efforts. This paper studies the dynamic demand, and which is defined as a set. Then a maritime emergency resource allocation model with uncertain data is presented. Afterwards, a robust approach is developed and used to make sure that the resource allocation schedule performs well with dynamic demand. Finally, a case study shows that the proposed methodology is feasible in maritime emergency resource allocation. The findings could help emergency manager to schedule the emergency resource allocation more flexibly in terms of dynamic demand.

An Efficient Live TV Scheduling System for 4G LTE Broadcast

KAUST Repository

Lau, Chun Pong

2016-01-01

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

Attitudes, beliefs, and practices regarding electronic nicotine delivery systems in patients scheduled for elective surgery.

Science.gov (United States)

Kadimpati, Sandeep; Nolan, Margaret; Warner, David O

2015-01-01

Smokers are at increased risk of postoperative complications. Electronic nicotine delivery systems (ENDS; or electronic cigarettes) could be a useful tool to reduce harm in the perioperative period. This pilot study examined the attitudes, beliefs, and practices of smokers scheduled for elective surgery regarding ENDS. This was a cross-sectional survey of current cigarette smokers who were evaluated in a preoperative clinic before elective surgery at Mayo Clinic. Measures included demographic characteristics, smoking history, 2 indices assessing the perception of how smoking affected health risks, ENDS use history, and 3 indices assessing interest in, perceived benefits of, and barriers to using ENDS in the perioperative period. Of the 112 smokers who completed the survey, 62 (55%) had tried ENDS and 24 (21%) reported current use. The most commonly stated reason for using ENDS was to quit smoking. Approximately 2 in 3 participants would be willing to use ENDS to help them reduce or eliminate perioperative cigarette use, and similar proportions perceived health benefits of doing so. Of the factors studied, only attempted to quit within the last year was significantly associated with increased interest in the perioperative use of ENDS (P=.03). Compared with participants who had tried ENDS (n=62), those who had never tried ENDS (n=50) had a significantly increased interest in the perioperative use of ENDS. A substantial proportion of patients scheduled for elective surgery had tried ENDS and would consider using ENDS to reduce perioperative use of cigarettes. Copyright © 2015 Mayo Foundation for Medical Education and Research. Published by Elsevier Inc. All rights reserved.

Flow-shop scheduling problem under uncertainties: Review and trends

OpenAIRE

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

2017-01-01

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

Adaptive Priority-Based Downlink Scheduling for WiMAX Networks

OpenAIRE

Wu, Shih-Jung; Huang, Shih-Yi; Huang, Kuo-Feng

2012-01-01

Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: priority assignment and resource allocation. Different service-...

Page 170 Use of Electronic Resources by Undergraduates in Two ...

African Journals Online (AJOL)

undergraduate students use electronic resources such as NUC virtual library, HINARI, ... web pages articles from magazines, encyclopedias, pamphlets and other .... of Nigerian university libraries have Internet connectivity, some of the system.

An extended Intelligent Water Drops algorithm for workflow scheduling in cloud computing environment

Directory of Open Access Journals (Sweden)

Shaymaa Elsherbiny

2018-03-01

Full Text Available Cloud computing is emerging as a high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. Many resource management methods may enhance the efficiency of the whole cloud computing system. The key part of cloud computing resource management is resource scheduling. Optimized scheduling of tasks on the cloud virtual machines is an NP-hard problem and many algorithms have been presented to solve it. The variations among these schedulers are due to the fact that the scheduling strategies of the schedulers are adapted to the changing environment and the types of tasks. The focus of this paper is on workflows scheduling in cloud computing, which is gaining a lot of attention recently because workflows have emerged as a paradigm to represent complex computing problems. We proposed a novel algorithm extending the natural-based Intelligent Water Drops (IWD algorithm that optimizes the scheduling of workflows on the cloud. The proposed algorithm is implemented and embedded within the workflows simulation toolkit and tested in different simulated cloud environments with different cost models. Our algorithm showed noticeable enhancements over the classical workflow scheduling algorithms. We made a comparison between the proposed IWD-based algorithm with other well-known scheduling algorithms, including MIN-MIN, MAX-MIN, Round Robin, FCFS, and MCT, PSO and C-PSO, where the proposed algorithm presented noticeable enhancements in the performance and cost in most situations.

Value of Flexible Resources, Virtual Bidding, and Self-Scheduling in Two-Settlement Electricity Markets With Wind Generation – Part I: Principles and Competitive Model

DEFF Research Database (Denmark)

Kazempour, Jalal; Hobbs, Benjamin F.

2017-01-01

Part one of this two-part paper presents new models for evaluating flexible resources in two-settlement electricity markets (day-ahead and real-time) with uncertain net loads (demand minus wind). Physical resources include wind together with fast- and slow-start demand response and thermal...... of certain equivalencies of the four models. We show how virtual bidding enhances market performance, since, together with self-scheduling by slow-start generators, it can help deterministic day-ahead market to choose the most efficient unit commitment....

A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.

Science.gov (United States)

Xiang, Wei; Yin, Jiao; Lim, Gino

2015-02-01

Operating room (OR) surgery scheduling determines the individual surgery's operation start time and assigns the required resources to each surgery over a schedule period, considering several constraints related to a complete surgery flow and the multiple resources involved. This task plays a decisive role in providing timely treatments for the patients while balancing hospital resource utilization. The originality of the present study is to integrate the surgery scheduling problem with real-life nurse roster constraints such as their role, specialty, qualification and availability. This article proposes a mathematical model and an ant colony optimization (ACO) approach to efficiently solve such surgery scheduling problems. A modified ACO algorithm with a two-level ant graph model is developed to solve such combinatorial optimization problems because of its computational complexity. The outer ant graph represents surgeries, while the inner graph is a dynamic resource graph. Three types of pheromones, i.e. sequence-related, surgery-related, and resource-related pheromone, fitting for a two-level model are defined. The iteration-best and feasible update strategy and local pheromone update rules are adopted to emphasize the information related to the good solution in makespan, and the balanced utilization of resources as well. The performance of the proposed ACO algorithm is then evaluated using the test cases from (1) the published literature data with complete nurse roster constraints, and 2) the real data collected from a hospital in China. The scheduling results using the proposed ACO approach are compared with the test case from both the literature and the real life hospital scheduling. Comparison results with the literature shows that the proposed ACO approach has (1) an 1.5-h reduction in end time; (2) a reduction in variation of resources' working time, i.e. 25% for ORs, 50% for nurses in shift 1 and 86% for nurses in shift 2; (3) an 0.25h reduction in

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System

Directory of Open Access Journals (Sweden)

Litian Duan

2016-11-01

Full Text Available In the multiple-reader environment (MRE of radio frequency identification (RFID system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range.

Model of e-learning with electronic educational resources of new generation

Directory of Open Access Journals (Sweden)

A. V. Loban

2017-01-01

Full Text Available Purpose of the article: improving of scientific and methodical base of the theory of the е-learning of variability. Methods used: conceptual and logical modeling of the е-learning of variability process with electronic educational resource of new generation and system analysis of the interconnection of the studied subject area, methods, didactics approaches and information and communication technologies means. Results: the formalization complex model of the е-learning of variability with electronic educational resource of new generation is developed, conditionally decomposed into three basic components: the formalization model of the course in the form of the thesaurusclassifier (“Author of e-resource”, the model of learning as management (“Coordination. Consultation. Control”, the learning model with the thesaurus-classifier (“Student”. Model “Author of e-resource” allows the student to achieve completeness, high degree of didactic elaboration and structuring of the studied material in triples of variants: modules of education information, practical task and control tasks; the result of the student’s (author’s of e-resource activity is the thesaurus-classifier. Model of learning as management is based on the principle of personal orientation of learning in computer environment and determines the logic of interaction between the lecturer and the student when determining the triple of variants individually for each student; organization of a dialogue between the lecturer and the student for consulting purposes; personal control of the student’s success (report generation and iterative search for the concept of the class assignment in the thesaurus-classifier before acquiring the required level of training. Model “Student” makes it possible to concretize the learning tasks in relation to the personality of the student and to the training level achieved; the assumption of the lecturer about the level of training of a

A survey of the use of electronic scientific information resources among medical and dental students

Directory of Open Access Journals (Sweden)

Aarnio Matti

2006-05-01

Full Text Available Abstract Background To evaluate medical and dental students' utilization of electronic information resources. Methods A web survey sent to 837 students (49.9% responded. Results Twenty-four per cent of medical students and ninteen per cent of dental students searched MEDLINE 2+ times/month for study purposes, and thiry-two per cent and twenty-four per cent respectively for research. Full-text articles were used 2+ times/month by thirty-three per cent of medical and ten per cent of dental students. Twelve per cent of respondents never utilized either MEDLINE or full-text articles. In multivariate models, the information-searching skills among students were significantly associated with use of MEDLINE and full-text articles. Conclusion Use of electronic resources differs among students. Forty percent were non-users of full-text articles. Information-searching skills are correlated with the use of electronic resources, but the level of basic PC skills plays not a major role in using these resources. The student data shows that adequate training in information-searching skills will increase the use of electronic information resources.

Handling machine breakdown for dynamic scheduling by a colony of cognitive agents in a holonic manufacturing framework

Directory of Open Access Journals (Sweden)

T. K. Jana

2015-09-01

Full Text Available There is an ever increasing need of providing quick, yet improved solution to dynamic scheduling by better responsiveness following simple coordination mechanism to better adapt to the changing environments. In this endeavor, a cognitive agent based approach is proposed to deal with machine failure. A Multi Agent based Holonic Adaptive Scheduling (MAHoAS architecture is developed to frame the schedule by explicit communication between the product holons and the resource holons in association with the integrated process planning and scheduling (IPPS holon under normal situation. In the event of breakdown of a resource, the cooperation is sought by implicit communication. Inspired by the cognitive behavior of human being, a cognitive decision making scheme is proposed that reallocates the incomplete task to another resource in the most optimized manner and tries to expedite the processing in view of machine failure. A metamorphic algorithm is developed and implemented in Oracle 9i to identify the best candidate resource for task re-allocation. Integrated approach to process planning and scheduling realized under Multi Agent System (MAS framework facilitates dynamic scheduling with improved performance under such situations. The responsiveness of the resources having cognitive capabilities helps to overcome the adverse consequences of resource failure in a better way.

Access to electronic information resources by students of federal ...

African Journals Online (AJOL)

The paper discusses access to electronic information resources by students of Federal Colleges of Education in Eha-Amufu and Umunze. Descriptive survey design was used to investigate sample of 526 students. Sampling technique used was a Multi sampling technique. Data for the study were generated using ...

Adoption and use of electronic information resources by medical ...

African Journals Online (AJOL)

This study investigated the adoption and use of electronic information resources by medical science students of the University of Benin. The descriptive survey research design was adopted for the study and 390 students provided the data. Data collected were analysed with descriptive Statistics(Simple percentage and ...

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

Science.gov (United States)

2011-11-28

This final rule with comment period addresses changes to the physician fee schedule and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. It also addresses, implements or discusses certain statutory provisions including provisions of the Patient Protection and Affordable Care Act, as amended by the Health Care and Education Reconciliation Act of 2010 (collectively known as the Affordable Care Act) and the Medicare Improvements for Patients and Providers Act (MIPPA) of 2008. In addition, this final rule with comment period discusses payments for Part B drugs; Clinical Laboratory Fee Schedule: Signature on Requisition; Physician Quality Reporting System; the Electronic Prescribing (eRx) Incentive Program; the Physician Resource-Use Feedback Program and the value modifier; productivity adjustment for ambulatory surgical center payment system and the ambulance, clinical laboratory, and durable medical equipment prosthetics orthotics and supplies (DMEPOS) fee schedules; and other Part B related issues.

Where Do Electronic Books Fit in the College Research Arsenal of Resources?

Science.gov (United States)

Barbier, Patricia

2007-01-01

Student use of electronic books has become an accepted supplement to traditional resources. Student use and satisfaction was monitored through an online course discussion board. Increased use of electronic books indicate this service is an accepted supplement to the print book collection.

Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA

OpenAIRE

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

2010-01-01

This paper considers transmission of scheduling information in  OFDMA-based cellular communication systems such as 3GPP long-term  evolution (LTE). These systems provide efficient usage of radio  resources by allowing users to be scheduled dynamically in both  frequency and time. This requires considerable amounts of scheduling  information to be sent to the users.  The paper compares two basic transmission strategies: transmitting a  separate scheduling message to each user versus broadcasti...

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.

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

Energy Technology Data Exchange (ETDEWEB)

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

2012-07-01

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

Project Robust Scheduling Based on the Scattered Buffer Technology

Directory of Open Access Journals (Sweden)

Nansheng Pang

2018-04-01

Full Text Available The research object in this paper is the sub network formed by the predecessor’s affect on the solution activity. This paper is to study three types of influencing factors from the predecessors that lead to the delay of starting time of the solution activity on the longest path, and to analyze the influence degree on the delay of the solution activity’s starting time from different types of factors. On this basis, through the comprehensive analysis of various factors that influence the solution activity, this paper proposes a metric that is used to evaluate the solution robustness of the project scheduling, and this metric is taken as the optimization goal. This paper also adopts the iterative process to design a scattered buffer heuristics algorithm based on the robust scheduling of the time buffer. At the same time, the resource flow network is introduced in this algorithm, using the tabu search algorithm to solve baseline scheduling. For the generation of resource flow network in the baseline scheduling, this algorithm designs a resource allocation algorithm with the maximum use of the precedence relations. Finally, the algorithm proposed in this paper and some other algorithms in previous literature are taken into the simulation experiment; under the comparative analysis, the experimental results show that the algorithm proposed in this paper is reasonable and feasible.

Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments

Directory of Open Access Journals (Sweden)

Kairong Duan

2018-05-01

Full Text Available Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs. When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA. We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time.

Strategic Planning for Electronic Resources Management: A Case Study at Gustavus Adolphus College

Science.gov (United States)

Hulseberg, Anna; Monson, Sarah

2009-01-01

Electronic resources, the tools we use to manage them, and the needs and expectations of our users are constantly evolving; at the same time, the roles, responsibilities, and workflow of the library staff who manage e-resources are also in flux. Recognizing a need to be more intentional and proactive about how we manage e-resources, the…

REVIEW OF MOODLE PLUGINS FOR DESIGNING MULTIMEDIA ELECTRONIC EDUCATIONAL RESOURCES FROM LANGUAGE DISCIPLINES

Directory of Open Access Journals (Sweden)

Anton M. Avramchuk

2015-09-01

Full Text Available Today the problem of designing multimedia electronic educational resources from language disciplines in Moodle is very important. This system has a lot of different, powerful resources, plugins to facilitate the learning of students with language disciplines. This article presents an overview and comparative analysis of the five Moodle plugins for designing multimedia electronic educational resources from language disciplines. There have been considered their key features and functionality in order to choose the best for studying language disciplines in the Moodle. Plugins are compared by a group of experts according to the criteria: efficiency, functionality and easy use. For a comparative analysis of the plugins it is used the analytic hierarchy process.

Distributed Research Project Scheduling Based on Multi-Agent Methods

Directory of Open Access Journals (Sweden)

Constanta Nicoleta Bodea

2011-01-01

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

CMS readiness for multi-core workload scheduling

Science.gov (United States)

Perez-Calero Yzquierdo, A.; Balcas, J.; Hernandez, J.; Aftab Khan, F.; Letts, J.; Mason, D.; Verguilov, V.

2017-10-01

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides a solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.

CMS Readiness for Multi-Core Workload Scheduling

Energy Technology Data Exchange (ETDEWEB)

Perez-Calero Yzquierdo, A. [Madrid, CIEMAT; Balcas, J. [Caltech; Hernandez, J. [Madrid, CIEMAT; Aftab Khan, F. [NCP, Islamabad; Letts, J. [UC, San Diego; Mason, D. [Fermilab; Verguilov, V. [CLMI, Sofia

2017-11-22

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides a solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.

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.

Modern ICT Tools: Online Electronic Resources Sharing Using Web ...

African Journals Online (AJOL)

Modern ICT Tools: Online Electronic Resources Sharing Using Web 2.0 and Its Implications For Library And Information Practice In Nigeria. ... The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader). If you would like more ...

Maritime wideband communication networks video transmission scheduling

CERN Document Server

Yang, Tingting

2014-01-01

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

A visual representation system for the scheduling and management of projects

NARCIS (Netherlands)

Pollalis, S.N.

1992-01-01

A VISUAL SCHEDULING AND MANAGEMENT SYSTEM (VSMS) This work proposes a new system for the visual representation of projects that displays the quantities of work, resources and cost. This new system, called Visual Scheduling and Management System, has a built-in hierarchical system to provide

An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems.

Directory of Open Access Journals (Sweden)

Hajara Idris

Full Text Available The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user's Quality of Service (QoS requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user's QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time.

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.

THE MODEL OF LINGUISTIC TEACHERS’ COMPETENCY DEVELOPMENT ON DESIGNING MULTIMEDIA ELECTRONIC EDUCATIONAL RESOURCES IN THE MOODLE SYSTEM

Directory of Open Access Journals (Sweden)

Anton M. Avramchuk

2017-10-01

Full Text Available The article is devoted to the problem of developing the competency of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system. The concept of "the competence of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system" is justified and defined. Identified and characterized the components by which the levels of the competency development of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system should be assessed. Developed a model for the development of the competency of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system, which is based on the main scientific approaches, used in adult education, and consists of five blocks: target, informative, technological, diagnostic and effective.

A decentralized scheduling algorithm for time synchronized channel hopping

Directory of Open Access Journals (Sweden)

Andrew Tinka

2011-09-01

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

Developing Humanities Collections in the Digital Age: Exploring Humanities Faculty Engagement with Electronic and Print Resources

Science.gov (United States)

Kachaluba, Sarah Buck; Brady, Jessica Evans; Critten, Jessica

2014-01-01

This article is based on quantitative and qualitative research examining humanities scholars' understandings of the advantages and disadvantages of print versus electronic information resources. It explores how humanities' faculty members at Florida State University (FSU) use print and electronic resources, as well as how they perceive these…

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.

Planning and Scheduling for Fleets of Earth Observing Satellites

Science.gov (United States)

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

2001-01-01

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

The VTIE telescope resource management system

Science.gov (United States)

Busschots, B.; Keating, J. G.

2005-06-01

The VTIE Telescope Resource Management System (TRMS) provides a frame work for managing a distributed group of internet telescopes as a single "Virtual Observatory". The TRMS provides hooks which allow for it to be connected to any Java Based web portal and for a Java based scheduler to be added to it. The TRMS represents each telescope and observatory in the system with a software agent and then allows the scheduler and web portal to communicate with these distributed resources in a simple transparent way, hence allowing the scheduler and portal designers to concentrate only on what they wish to do with these resources rather than how to communicate with them. This paper outlines the structure and implementation of this frame work.

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.

Artificial Immune Algorithm for Subtask Industrial Robot Scheduling in Cloud Manufacturing

Science.gov (United States)

Suma, T.; Murugesan, R.

2018-04-01

The current generation of manufacturing industry requires an intelligent scheduling model to achieve an effective utilization of distributed manufacturing resources, which motivated us to work on an Artificial Immune Algorithm for subtask robot scheduling in cloud manufacturing. This scheduling model enables a collaborative work between the industrial robots in different manufacturing centers. This paper discussed two optimizing objectives which includes minimizing the cost and load balance of industrial robots through scheduling. To solve these scheduling problems, we used the algorithm based on Artificial Immune system. The parameters are simulated with MATLAB and the results compared with the existing algorithms. The result shows better performance than existing.

Optimal residential smart appliances scheduling considering distribution network constraints

Directory of Open Access Journals (Sweden)

Yu-Ree Kim

2016-01-01

Full Text Available As smart appliances (SAs are more widely adopted within distribution networks, residential consumers can contribute to electricity market operations with demand response resources and reduce their electricity bill. However, if the schedules of demand response resources are determined only by the economic electricity rate signal, the schedule can be unfeasible due to the distribution network constraints. Furthermore, it is impossible for consumers to understand the complex physical characteristics and reflect them in their everyday behaviors. This paper introduces the concept of load coordinating retailer (LCR that deals with demand responsive appliances to reduce electrical consumption for the given distribution network constraints. The LCR can play the role of both conventional retailer and aggregated demand response provider for residential customers. It determines the optimal schedules for the aggregated neighboring SAs according to their types within each distribution feeder. The optimization algorithms are developed using Mixed Integer Linear Programming, and the distribution network is solved by the Newton–Raphson AC power flow.

An EV Charging Scheduling Mechanism Based on Price Negotiation

Directory of Open Access Journals (Sweden)

Baocheng Wang

2018-05-01

Full Text Available Scheduling EV user’s charging behavior based on charging price and applying renewable energy resources are the effective methods to release the load pressure of power grids brought about by the large-scale popularity of electric vehicles (EVs. This paper presents a novel approach for EV charging scheduling based on price negotiation. Firstly, the EV charging system framework based on price negotiation and renewable energy resources is discussed. Secondly, the price negotiation model is presented, including the initial price models and the conditions of transactions. Finally, an EV charging scheduling mechanism based on price negotiation (CSM-PN, including the price adjustment strategies of both the operator and EV users is proposed to seek a final transaction during multi-round price negotiation. Simulation results show that this novel approach can effectively improve the charging station operator’s income, reduce the EV users’ costs, and balance the load of the power grid while improving the efficiency of the EV charging system.

A IEEE 802.11e HCCA Scheduler with a Reclaiming Mechanism for Multimedia Applications

Directory of Open Access Journals (Sweden)

Anna Lina Ruscelli

2014-01-01

Full Text Available The QoS offered by the IEEE 802.11e reference scheduler is satisfactory in the case of Constant Bit Rate traffic streams, but not yet in the case of Variable Bit Rate traffic streams, whose variations stress its scheduling behavior. Despite the numerous proposed alternative schedulers with QoS, multimedia applications are looking for refined methods suitable to ensure service differentiation and dynamic update of protocol parameters. In this paper a scheduling algorithm, Unused Time Shifting Scheduler (UTSS, is deeply analyzed. It is designed to cooperate with a HCCA centralized real-time scheduler through the integration of a bandwidth reclaiming scheme, suitable to recover nonexhausted transmission time and assign that to the next polled stations. UTSS dynamically computes with an O(1 complexity transmission time providing an instantaneous resource overprovisioning. The theoretical analysis and the simulation results highlight that this injection of resources does not affect the admission control nor the centralized scheduler but is suitable to improve the performance of the centralized scheduler in terms of mean access delay, transmission queues length, bursts of traffic management, and packets drop rate. These positive effects are more relevant for highly variable bit rate traffic.

Multi-core processing and scheduling performance in CMS

International Nuclear Information System (INIS)

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

2012-01-01

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

Passenger oriented railway disruption management by adapting timetables and rolling stock schedules

NARCIS (Netherlands)

Veelenturf, L.P.; Kroon, L.G.; Maróti, G.

2017-01-01

In passenger railway operations, unforeseen events require railway operators to adjust their timetable and their resource schedules. The passengers will also adapt their routes to their destinations. When determining the new timetable and rolling stock schedule, the railway operator has to take

Electronic resource management systems a workflow approach

CERN Document Server

Anderson, Elsa K

2014-01-01

To get to the bottom of a successful approach to Electronic Resource Management (ERM), Anderson interviewed staff at 11 institutions about their ERM implementations. Among her conclusions, presented in this issue of Library Technology Reports, is that grasping the intricacies of your workflow-analyzing each step to reveal the gaps and problems-at the beginning is crucial to selecting and implementing an ERM. Whether the system will be used to fill a gap, aggregate critical data, or replace a tedious manual process, the best solution for your library depends on factors such as your current soft

VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

Science.gov (United States)

Wang, Song; Gupta, Chetan; Mehta, Abhay

There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans.

A HYBRID HEURISTIC ALGORITHM FOR SOLVING THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP

Directory of Open Access Journals (Sweden)

Juan Carlos Rivera

Full Text Available The Resource Constrained Project Scheduling Problem (RCPSP is a problem of great interest for the scientific community because it belongs to the class of NP-Hard problems and no methods are known that can solve it accurately in polynomial processing times. For this reason heuristic methods are used to solve it in an efficient way though there is no guarantee that an optimal solution can be obtained. This research presents a hybrid heuristic search algorithm to solve the RCPSP efficiently, combining elements of the heuristic Greedy Randomized Adaptive Search Procedure (GRASP, Scatter Search and Justification. The efficiency obtained is measured taking into account the presence of the new elements added to the GRASP algorithm taken as base: Justification and Scatter Search. The algorithms are evaluated using three data bases of instances of the problem: 480 instances of 30 activities, 480 of 60, and 600 of 120 activities respectively, taken from the library PSPLIB available online. The solutions obtained by the developed algorithm for the instances of 30, 60 and 120 are compared with results obtained by other researchers at international level, where a prominent place is obtained, according to Chen (2011.

Adaptive Radio Resource Allocation in Hierarchical QoS Scheduling for IEEE 802.16 Systems

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2007-01-01

Future mobile communication systems such as IEEE 802.16 are expected to deliver a variety of multimedia services with diverse QoS requirements. To guarantee the QoS provision, appropriate scheduler architecture and scheduling algorithms have to be carefully designed. In this paper, we propose...

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

Science.gov (United States)

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

Science.gov (United States)

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

NUMA-Aware Thread Scheduling for Big Data Transfers over Terabits Network Infrastructure

Directory of Open Access Journals (Sweden)

Taeuk Kim

2018-01-01

Full Text Available The evergrowing trend of big data has led scientists to share and transfer the simulation and analytical data across the geodistributed research and computing facilities. However, the existing data transfer frameworks used for data sharing lack the capability to adopt the attributes of the underlying parallel file systems (PFS. LADS (Layout-Aware Data Scheduling is an end-to-end data transfer tool optimized for terabit network using a layout-aware data scheduling via PFS. However, it does not consider the NUMA (Nonuniform Memory Access architecture. In this paper, we propose a NUMA-aware thread and resource scheduling for optimized data transfer in terabit network. First, we propose distributed RMA buffers to reduce memory controller contention in CPU sockets and then schedule the threads based on CPU socket and NUMA nodes inside CPU socket to reduce memory access latency. We design and implement the proposed resource and thread scheduling in the existing LADS framework. Experimental results showed from 21.7% to 44% improvement with memory-level optimizations in the LADS framework as compared to the baseline without any optimization.

Centralized mission planning and scheduling system for the Landsat Data Continuity Mission

Science.gov (United States)

Kavelaars, Alicia; Barnoy, Assaf M.; Gregory, Shawna; Garcia, Gonzalo; Talon, Cesar; Greer, Gregory; Williams, Jason; Dulski, Vicki

2014-01-01

Satellites in Low Earth Orbit provide missions with closer range for studying aspects such as geography and topography, but often require efficient utilization of space and ground assets. Optimizing schedules for these satellites amounts to a complex planning puzzle since it requires operators to face issues such as discontinuous ground contacts, limited onboard memory storage, constrained downlink margin, and shared ground antenna resources. To solve this issue for the Landsat Data Continuity Mission (LDCM, Landsat 8), all the scheduling exchanges for science data request, ground/space station contact, and spacecraft maintenance and control will be coordinated through a centralized Mission Planning and Scheduling (MPS) engine, based upon GMV’s scheduling system flexplan9 . The synchronization between all operational functions must be strictly maintained to ensure efficient mission utilization of ground and spacecraft activities while working within the bounds of the space and ground resources, such as Solid State Recorder (SSR) and available antennas. This paper outlines the functionalities that the centralized planning and scheduling system has in its operational control and management of the Landsat 8 spacecraft.

Electronic Resource Management System. Vernetzung von Lizenzinformationen

Directory of Open Access Journals (Sweden)

Michaela Selbach

2014-12-01

Full Text Available In den letzten zehn Jahren spielen elektronische Ressourcen im Bereich der Erwerbung eine zunehmend wichtige Rolle: Eindeutig lässt sich hier ein Wandel in den Bibliotheken (fort vom reinen Printbestand zu immer größeren E-Only-Beständen feststellen. Die stetig wachsende Menge an E-Ressourcen und deren Heterogenität stellt Bibliotheken vor die Herausforderung, die E-Ressourcen effizient zu verwalten. Nicht nur Bibliotheken, sondern auch verhandlungsführende Institutionen von Konsortial- und Allianzlizenzen benötigen ein geeignetes Instrument zur Verwaltung von Lizenzinformationen, welches den komplexen Anforderungen moderner E-Ressourcen gerecht wird. Die Deutsche Forschungsgemeinschaft (DFG unterstützt ein Projekt des Hochschulbibliothekszentrums des Landes Nordrhein-Westfalen (hbz, der Universitätsbibliothek Freiburg, der Verbundzentrale des Gemeinsamen Bibliotheksverbundes (GBV und der Universitätsbibliothek Frankfurt, in dem ein bundesweit verfügbares Electronic Ressource Managementsystem (ERMS aufgebaut werden soll. Ein solches ERMS soll auf Basis einer zentralen Knowledge Base eine einheitliche Nutzung von Daten zur Lizenzverwaltung elektronischer Ressourcen auf lokaler, regionaler und nationaler Ebene ermöglichen. Statistische Auswertungen, Rechteverwaltung für alle angeschlossenen Bibliotheken, kooperative Datenpflege sowie ein über standardisierte Schnittstellen geführter Datenaustausch stehen bei der Erarbeitung der Anforderungen ebenso im Fokus wie die Entwicklung eines Daten- und Funktionsmodells. In the last few years the importance of electronic resources in library acquisitions has increased significantly. There has been a shift from mere print holdings to both e- and print combinations and even e-only subscriptions. This shift poses a double challenge for libraries: On the one hand they have to provide their e-resource collections to library users in an appealing way, on the other hand they have to manage these

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

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.

The Electron Microscopy Outreach Program: A Web-based resource for research and education.

Science.gov (United States)

Sosinsky, G E; Baker, T S; Hand, G; Ellisman, M H

1999-01-01

We have developed a centralized World Wide Web (WWW)-based environment that serves as a resource of software tools and expertise for biological electron microscopy. A major focus is molecular electron microscopy, but the site also includes information and links on structural biology at all levels of resolution. This site serves to help integrate or link structural biology techniques in accordance with user needs. The WWW site, called the Electron Microscopy (EM) Outreach Program (URL: http://emoutreach.sdsc.edu), provides scientists with computational and educational tools for their research and edification. In particular, we have set up a centralized resource containing course notes, references, and links to image analysis and three-dimensional reconstruction software for investigators wanting to learn about EM techniques either within or outside of their fields of expertise. Copyright 1999 Academic Press.

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.

Technical Communicator: A New Model for the Electronic Resources Librarian?

Science.gov (United States)

Hulseberg, Anna

2016-01-01

This article explores whether technical communicator is a useful model for electronic resources (ER) librarians. The fields of ER librarianship and technical communication (TC) originated and continue to develop in relation to evolving technologies. A review of the literature reveals four common themes for ER librarianship and TC. While the…

A new approach for global synchronization in hierarchical scheduled real-time systems

NARCIS (Netherlands)

Behnam, M.; Nolte, T.; Bril, R.J.

2009-01-01

We present our ongoing work to improve an existing synchronization protocol SIRAP for hierarchically scheduled real-time systems. A less pessimistic schedulability analysis is presented which can make the SIRAP protocol more efficient in terms of calculated CPU resource needs. In addition and for

PARTICAL SWARM OPTIMIZATION OF TASK SCHEDULING IN CLOUD COMPUTING

OpenAIRE

Payal Jaglan*, Chander Diwakar

2016-01-01

Resource provisioning and pricing modeling in cloud computing makes it an inevitable technology both on developer and consumer end. Easy accessibility of software and freedom of hardware configuration increase its demand in IT industry. It’s ability to provide a user-friendly environment, software independence, quality, pricing index and easy accessibility of infrastructure via internet. Task scheduling plays an important role in cloud computing systems. Task scheduling in cloud computing mea...

Resource sharing under global scheduling with partial processor bandwidth

NARCIS (Netherlands)

Afshar, Sara; Behnam, Moris; Bril, Reinder J.; Nolte, Thomas

2015-01-01

Resource efficient approaches are of great importance for resource constrained embedded systems. In this paper, we present an approach targeting systems where tasks of a critical application are partitioned on a multi-core platform and by using resource reservation techniques, the remaining

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

CERN Document Server

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

2014-01-01

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

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

Institute of Scientific and Technical Information of China (English)

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

2003-01-01

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

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

LTE uplink scheduling - flow level analysis

NARCIS (Netherlands)

Dimitrova, D.C.; van den Berg, J.L.; Heijenk, G.; Litjens, R.; Sacchi, Claudio; Bellalta, Boris; Vinel, Alexey; Schlegel, Christian; Granelli, Fabrizio; Zhang, Yan

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

LTE uplink scheduling - Flow level analysis

NARCIS (Netherlands)

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

2011-01-01

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

A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags

Directory of Open Access Journals (Sweden)

Angela Hsiang-Ling Chen

2016-09-01

Full Text Available Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP, improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving the RCPSP and its multi-mode variations, there is no standardized procedure that can guide project management practitioners in their scheduling tasks. This is mainly because many of the proposed approaches are either based on unrealistic/oversimplified scenarios or they propose solution procedures not easily applicable or even feasible in real-life situations. In this study, we solve a more true-to-life and complex model, Multimode RCPSP with minimal and maximal time lags (MRCPSP/max. The complexity of the model solved is presented, and the practicality of the proposed approach is justified depending on only information that is available for every project regardless of its industrial context. The results confirm that it is possible to determine a robust makespan and to calculate an execution time-frame with gaps lower than 11% between their lower and upper bounds. In addition, in many instances, the solved lower bound obtained was equal to the best-known optimum.

Decentralized Job Scheduling in the Cloud Based on a Spatially Generalized Prisoner’s Dilemma Game

Directory of Open Access Journals (Sweden)

Gąsior Jakub

2015-12-01

Full Text Available We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner’s Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.

Coordinated scheduling for dynamic real-time systems

Science.gov (United States)

Natarajan, Swaminathan; Zhao, Wei

1994-01-01

In this project, we addressed issues in coordinated scheduling for dynamic real-time systems. In particular, we concentrated on design and implementation of a new distributed real-time system called R-Shell. The design objective of R-Shell is to provide computing support for space programs that have large, complex, fault-tolerant distributed real-time applications. In R-shell, the approach is based on the concept of scheduling agents, which reside in the application run-time environment, and are customized to provide just those resource management functions which are needed by the specific application. With this approach, we avoid the need for a sophisticated OS which provides a variety of generalized functionality, while still not burdening application programmers with heavy responsibility for resource management. In this report, we discuss the R-Shell approach, summarize the achievement of the project, and describe a preliminary prototype of R-Shell system.

A Multi-mode RCPSP with Stochastic Nonrenewable Resource Consumption

DEFF Research Database (Denmark)

Muller, Laurent Flindt

Many processes within production scheduling and project management involve the scheduling of a number of activities, each activity having a certain duration and requiring a certain amount of limited resources. The duration and resource requirements of activities are com- monly the result...

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Energy Technology Data Exchange (ETDEWEB)

Kumbhare, Alok [Univ. of Southern California, Los Angeles, CA (United States); Simmhan, Yogesh [Indian Inst. of Technology (IIT), Bangalore (India); Prasanna, Viktor K. [Univ. of Southern California, Los Angeles, CA (United States)

2014-05-27

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application’s throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based look-ahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from public and private IaaS clouds. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

Science.gov (United States)

Alvarado, Michelle; Ntaimo, Lewis

2018-03-01

Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

OpenAIRE

Weiwei Lin; Wentai Wu; James Z. Wang

2016-01-01

Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual ...

MODEL OF AN ELECTRONIC EDUCATIONAL RESOURCE OF NEW GENERATION

Directory of Open Access Journals (Sweden)

Anatoliy V. Loban

2016-01-01

Full Text Available The mathematical structure of the modular architecture of an electronic educational resource (EER of new generation, which allows to decompose the process of studying the subjects of the course at a hierarchically ordered set of data (knowledge and procedures for manipulating them, to determine the roles of participants of process of training of and technology the development and use of EOR in the study procrate.

Environmental monitoring master sampling schedule: January--December 1989

International Nuclear Information System (INIS)

Bisping, L.E.

1989-01-01

Environmental monitoring of the Hanford Site is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for calendar year 1989 for the Surface and Ground-Water Environmental Monitoring Projects. This schedule is subject to modification during the year in response to changes in Site operations, program requirements, and the nature of the observed results. Operational limitations such as weather, mechanical failures, sample availability, etc., may also require schedule modifications. Changes will be documented in the respective project files, but this plan will not be reissued. This schedule includes routine ground-water sampling performed by PNL for Westinghouse Hanford Company, but does not include samples that may be collected in 1989 to support special studies or special contractor projects, or for quality control. The sampling schedule for Site-wide chemical monitoring is not included here, because it varies each quarter as needed, based on past results and operating needs. This schedule does not include Resource Conservation and Recovery Act ground-water sampling performed by PNL for Hanford Site contractors, nor does it include sampling that may be done by other DOE Hanford contractors

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.

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

Autonomous scheduling technology for Earth orbital missions

Science.gov (United States)

Srivastava, S.

1982-01-01

The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system.

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.

Scheduling in Heterogeneous Grid Environments: The Effects of DataMigration

Energy Technology Data Exchange (ETDEWEB)

Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

2004-01-01

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this goal can be fully realized. One problem critical to the effective utilization of computational grids is efficient job scheduling. Our prior work addressed this challenge by defining a grid scheduling architecture and several job migration strategies. The focus of this study is to explore the impact of data migration under a variety of demanding grid conditions. We evaluate our grid scheduling algorithms by simulating compute servers, various groupings of servers into sites, and inter-server networks, using real workloads obtained from leading supercomputing centers. Several key performance metrics are used to compare the behavior of our algorithms against reference local and centralized scheduling schemes. Results show the tremendous benefits of grid scheduling, even in the presence of input/output data migration - while highlighting the importance of utilizing communication-aware scheduling schemes.

Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks

Directory of Open Access Journals (Sweden)

Djalal Hedjazi

2015-04-01

Full Text Available Skill management is a key factor in improving effectiveness of industrial companies, notably their maintenance services. The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams constraints. This problem is generally known as unrelated parallel machine scheduling. We consider the problem with a both objectives of minimizing total weighted tardiness (TWT and number of tardiness tasks. Our interest is focused particularly on solving this problem under skill constraints, which each resource has a skill level. So, we propose a new efficient heuristic to obtain an approximate solution for this NP-hard problem and demonstrate his effectiveness through computational experiments. This heuristic is designed for implementation in a static maintenance scheduling problem (with unequal release dates, processing times and resource skills, while minimizing objective functions aforementioned.

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.

Reasoning abstractly about resources

Science.gov (United States)

Clement, B.; Barrett, A.

2001-01-01

r describes a way to schedule high level activities before distributing them across multiple rovers in order to coordinate the resultant use of shared resources regardless of how each rover decides how to perform its activities. We present an algorithm for summarizing the metric resource requirements of an abstract activity based n the resource usages of its potential refinements.

Duality between resource reservation and proportional share resource allocation

Science.gov (United States)

Stoica, Ion; Abdel-Wahab, Hussein; Jeffay, Kevin

1997-01-01

We describe anew framework for resource allocation that unifies the well-known proportional share and resource reservation policies. Each client is characterized by two parameters: a weight that represents the rate at which the client 'pays' for the resource, and a share that represents the fraction of the resource that the client should receive. A fixed rate corresponds to a proportional share allocation, while a fixed share corresponds to a reservation. Furthermore, rates and shares are duals of each other. Once one parameters is fixed the other becomes fixed as well. If a client asks for a fixed share then the level of competition for the resource determines the rate at which it has to pay, while if the rate is fixed, level of competition determines the service time the clients should receive. To implement this framework we use a new proportional share algorithm, called earliest eligible virtual deadline first, that achieves optical accuracy in the rates at which process execute. This makes it possible to provide support for highly predictable, real-time services. As a proof of concept we have implemented a prototype of a CPU scheduler under the FreeBSD operating system. The experimental results show that our scheduler achieves the goal of providing integrated support for batch and real-time applications.

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

Flexible Scheduling in Multimedia Kernels: An Overview

NARCIS (Netherlands)

Jansen, P.G.; Scholten, Johan; Laan, Rene; Chow, W.S.

1999-01-01

Current Hard Real-Time (HRT) kernels have their timely behaviour guaranteed on the cost of a rather restrictive use of the available resources. This makes current HRT scheduling techniques inadequate for use in a multimedia environment where we can make a considerable profit by a better and more

A review of metaheuristic scheduling techniques in cloud computing

Directory of Open Access Journals (Sweden)

Mala Kalra

2015-11-01

Full Text Available Cloud computing has become a buzzword in the area of high performance distributed computing as it provides on-demand access to shared pool of resources over Internet in a self-service, dynamically scalable and metered manner. Cloud computing is still in its infancy, so to reap its full benefits, much research is required across a broad array of topics. One of the important research issues which need to be focused for its efficient performance is scheduling. The goal of scheduling is to map tasks to appropriate resources that optimize one or more objectives. Scheduling in cloud computing belongs to a category of problems known as NP-hard problem due to large solution space and thus it takes a long time to find an optimal solution. There are no algorithms which may produce optimal solution within polynomial time to solve these problems. In cloud environment, it is preferable to find suboptimal solution, but in short period of time. Metaheuristic based techniques have been proved to achieve near optimal solutions within reasonable time for such problems. In this paper, we provide an extensive survey and comparative analysis of various scheduling algorithms for cloud and grid environments based on three popular metaheuristic techniques: Ant Colony Optimization (ACO, Genetic Algorithm (GA and Particle Swarm Optimization (PSO, and two novel techniques: League Championship Algorithm (LCA and BAT algorithm.

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

Directory of Open Access Journals (Sweden)

Nazia Anwar

2018-01-01

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

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

month; the necessary rate of a month; the quantities to be completed before half period of the project; the quantities to be achieved before the cold function test. Due to a lot of documents and equipment in LANP, it is impossible to present their supply dates one by one in the level 2 project schedule. The rules, in reference to the corresponding construction starting dates, were given to define the supply dates. The good practices of construction schedule control are presented, including draft of a construction program, performance evaluation, specific coordination meeting and Work Load Point application. The schedule control culture is described, that is one core, two criteria, three control mechanisms, four resources to be secured. (author)

Power efficient dynamic resource scheduling algorithms for LTE

OpenAIRE

Han, C; Beh, KC; Nicolaou, M; Armour, SMD; Doufexi, A

2010-01-01

This paper presents a link level analysis of the rate and energy efficiency performance of the LTE downlink considering the unitary codebook based precoding scheme. In a multi-user environment, appropriate radio resource management strategies can be applied to the system to improve the performance gain by exploiting multi-user diversity in the time, frequency and space domains and the gains can be translated to energy reduction at the base station. Several existing and novel resource scheduli...

Contagious flexibility? A study on whether schedule flexibility facilitates work-life enrichment.

Science.gov (United States)

Pedersen, Vivi Bach; Jeppesen, Hans Jeppe

2012-08-01

Schedule flexibility defines an important generating resource for work-life enrichment; however, our knowledge about how such spillovers take place is limited. This multiple case study examines how workers from different working time contexts with varying levels of schedule flexibility experience work-life interplay. Given the adopted explorative design, it is important to interpret the findings in a tentative light. Nonetheless, the study offers important insight into work-life enrichment that may guide future research in this field. The findings indicate that schedule flexibility may act as a boundary-spanning resource owing to the agency potential it offers workers. Thus, it seemed that flexible schedule opportunities enabled workers to engage more fully in personal life activities, which in turn had a positive influence on their work involvement through positive affect. Such positive role engagements appeared, however, to be greatly determined by workers' boundary management and by time conditions of work and family. In conclusion, the major findings and limitation of the study are discussed against existing research and theory. © 2012 The Authors. Scandinavian Journal of Psychology © 2012 The Scandinavian Psychological Associations.

Scheduling strategies for LTE uplink with flow behaviour analysis

OpenAIRE

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

2010-01-01

Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fa...

Successful Implementation of Six Sigma to Schedule Student Staffing for Circulation Service Desks

Science.gov (United States)

Jankowski, Janiece

2013-01-01

In fall of 2011 the University at Buffalo Libraries circulation department undertook Six Sigma training for the purpose of overhauling its student scheduling process. The department was able to mitigate significant staffing budgetary reductions and resource reallocations and to overcome the unique challenges of scheduling student labor for a…

Communication, Scheduling, and Resource Management in SINA

NARCIS (Netherlands)

Tripathi, A.; Aksit, Mehmet

1988-01-01

In this article we present the object-oriented constructs for communication and concurrent programming in the SINA programming language. The object encapsulation mechanism of SINA allows implementations of hierarchically structured resource management systems and alleviates some of the problems that

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

Science.gov (United States)

Short, Nick, Jr.; Bedet, Jean-Jacques; Bodden, Lee; Boddy, Mark; White, Jim; Beane, John

1994-01-01

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications

GUIDELINES FOR EVALUATION OF PSYCHOLOGICAL AND PEDAGOGICAL QUALITY CHARACTERISTICS OF ELECTRONIC EDUCATIONAL RESOURCES

Directory of Open Access Journals (Sweden)

Galina P. Lavrentieva

2014-05-01

Full Text Available The article highlights the causes of insufficient effective use of electronic learning resources and sets out the guidelines on ways to solve the aforementioned problems. The set of didactic, methodical, psychological, pedagogical, design and ergonomic quality requirements is considered for evaluation, selection and application of information and communication technologies in the educational process. The most appropriate mechanisms for the ICT introduction into the learning process are disclosed as it should meet the specific learning needs of the student and the objectives of the educational process. The guidance for psycho-educational assessment of quality of electronic educational resources is provided. It is argued that the effectiveness of the ICT use is to be improved by means of quality evaluation mechanisms involved into the educational process.

18 CFR 154.202 - Filings to initiate a new rate schedule.

Science.gov (United States)

2010-04-01

... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Filings to initiate a new rate schedule. 154.202 Section 154.202 Conservation of Power and Water Resources FEDERAL ENERGY... contain a notice of the interdependence. (b) If a new service, facility, or rate is specifically...

Availability, Use and Constraints to Use of Electronic Information Resources by Postgraduates Students at the University of Ibadan

Directory of Open Access Journals (Sweden)

Dare Samuel Adeleke

2017-12-01

Full Text Available Availability, awareness and use of electronic resources provide access to authoritative, reliable, accurate and timely access to information. The use of electronic information resources (EIRs can enable innovation in teaching and increase timeliness in research of postgraduate students which will eventual result into encouragement of the expected research-led enquiry in this digital age. The study adopted a descriptive survey design. Samples of 300 of postgraduate students within seven out 13 Faculties were randomly selected. Data were collected using questionnaire designed to elicit response from respondents and data were analyzed using descriptive statistics methods percentages, mean, and standard deviation. Results indicated that internet was ranked most available and used in the university. Low level of usage of electronic resources, in particular, full texts data bases is linked to a number of constraints: Interrupted power supply was ranked highest among other factors as speed and capacity of computers, retrieval of records with high recall and low precision, retrieving records relevant to information need, lack of knowledge of search techniques to retrieve information effectively, non possession of requisite IT skills and problems accessing the internet. The study recommended that usage of electronic resources be made compulsory, intensifying awareness campaigns concerning the availability, training on use of electronic resources and the problem of power outage be addressed.

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

18 CFR 701.203 - Schedule of fees.

Science.gov (United States)

2010-04-01

... by the Public Information Officer on the basis of the balance between the benefit to the general public and the cost to the Water Resources Council. (d) Fees shall be limited to recovery of only direct... ORGANIZATION Availability of Information § 701.203 Schedule of fees. (a) The Public Information Officer will to...

CMS Planning and Scheduling System

CERN Document Server

Kotamaki, M

1998-01-01

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

A Study on Developing Evaluation Criteria for Electronic Resources in Evaluation Indicators of Libraries

Science.gov (United States)

Noh, Younghee

2010-01-01

This study aimed to improve the current state of electronic resource evaluation in libraries. While the use of Web DB, e-book, e-journal, and other e-resources such as CD-ROM, DVD, and micro materials is increasing in libraries, their use is not comprehensively factored into the general evaluation of libraries and may diminish the reliability of…

Coordinating space telescope operations in an integrated planning and scheduling architecture

Science.gov (United States)

Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela

1992-01-01

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

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

Resource Management in Constrained Dynamic Situations

Science.gov (United States)

Seok, Jinwoo

Resource management is considered in this dissertation for systems with limited resources, possibly combined with other system constraints, in unpredictably dynamic environments. Resources may represent fuel, power, capabilities, energy, and so on. Resource management is important for many practical systems; usually, resources are limited, and their use must be optimized. Furthermore, systems are often constrained, and constraints must be satisfied for safe operation. Simplistic resource management can result in poor use of resources and failure of the system. Furthermore, many real-world situations involve dynamic environments. Many traditional problems are formulated based on the assumptions of given probabilities or perfect knowledge of future events. However, in many cases, the future is completely unknown, and information on or probabilities about future events are not available. In other words, we operate in unpredictably dynamic situations. Thus, a method is needed to handle dynamic situations without knowledge of the future, but few formal methods have been developed to address them. Thus, the goal is to design resource management methods for constrained systems, with limited resources, in unpredictably dynamic environments. To this end, resource management is organized hierarchically into two levels: 1) planning, and 2) control. In the planning level, the set of tasks to be performed is scheduled based on limited resources to maximize resource usage in unpredictably dynamic environments. In the control level, the system controller is designed to follow the schedule by considering all the system constraints for safe and efficient operation. Consequently, this dissertation is mainly divided into two parts: 1) planning level design, based on finite state machines, and 2) control level methods, based on model predictive control. We define a recomposable restricted finite state machine to handle limited resource situations and unpredictably dynamic environments

Underground storage tank - Integrated Demonstration Technical Task Plan master schedule

International Nuclear Information System (INIS)

Johnson, C.M.

1994-08-01

This document provides an integrated programmatic schedule (i.e., Master Schedule) for the U.S. Department of Energy (DOE) Underground Storage Tank-Integrated Demonstration (UST-ID) Program. It includes top-level schedule and related information for the DOE Office of Technology Development (EM-50) UST-ID activities. The information is based upon the fiscal year (FY) 1994 technical task plans (TTPS) and has been prepared as a baseline information resource for program participants. The Master Schedule contains Level 0 and Level 1 program schedules for the UST-ID Program. This document is one of a number of programmatic documents developed to support and manage the UST-ID activities. It is composed of the following sections: Program Overview - provides a summary background of the UST-ID Program. This summary addresses the mission, scope, and organizational structure of the program; Activity Description - provides a programmatic description of UST-ID technology development activities and lists the key milestones for the UST-ID systems. Master Schedules - contains the Level 0 and Level 1 programmatic schedules for the UST-ID systems. References - lists the UST-ID programmatic documents used as a basis for preparing the Master Schedule. The appendixes contain additional details related to site-specific technology applications

Real-Time Scheduling for Preventing Information Leakage with Preemption Overheads

Directory of Open Access Journals (Sweden)

BAEK, H.

2017-05-01

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

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

Science.gov (United States)

Liu, Mengqi; Shan, Miyuan; Wu, Juan

2014-01-01

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

Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

Energy Technology Data Exchange (ETDEWEB)

Khan, Atif J., E-mail: atif.j.khan@rutgers.edu [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Rafique, Raza [Suleman Dawood School of Business, Lahore University of Management Sciences, Lahore (Pakistan); Zafar, Waleed [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Shah, Chirag [Department of Radiation Oncology, Cleveland Clinic, Cleveland, Ohio (United States); Haffty, Bruce G. [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Vicini, Frank [Michigan HealthCare Professionals, Farmington Hills, Michigan (United States); Jamshed, Arif [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Zhao, Yao [Rutgers University School of Business, Newark, New Jersey (United States)

2017-02-01

Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

International Nuclear Information System (INIS)

Khan, Atif J.; Rafique, Raza; Zafar, Waleed; Shah, Chirag; Haffty, Bruce G.; Vicini, Frank; Jamshed, Arif; Zhao, Yao

2017-01-01

Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

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.

Downlink scheduling using non-orthogonal uplink beams

KAUST Repository

Eltayeb, Mohammed E.

2014-04-01

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

Downlink scheduling using non-orthogonal uplink beams

KAUST Repository

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

2014-01-01

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

THE MODEL OF LINGUISTIC TEACHERS’ COMPETENCY DEVELOPMENT ON DESIGNING MULTIMEDIA ELECTRONIC EDUCATIONAL RESOURCES IN THE MOODLE SYSTEM

OpenAIRE

Anton M. Avramchuk

2017-01-01

The article is devoted to the problem of developing the competency of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system. The concept of "the competence of teachers of language disciplines on designing multimedia electronic educational resources in the Moodle system" is justified and defined. Identified and characterized the components by which the levels of the competency development of teachers of language disciplines on designing ...

Application of coupled symbolic and numeric processing to an advanced scheduling system for plant construction

International Nuclear Information System (INIS)

Kobayashi, Yasuhiro; Takamoto, Masanori; Nonaka, Hisanori; Yamada, Naoyuki

1994-01-01

A scheduling system has been developed by integrating symbolic processing functions for constraint handling and modification guidance, with numeric processing functions for schedule optimization and evaluation. The system is composed of an automatic schedule generation module, interactive schedule revision module and schedule evaluation module. The goal of the problem solving is the flattening of the daily resources requirement throughout the scheduling period. The automatic schedule generation module optimizes the initial schedule according to the formulatable portion of requirement description specified in a predicate-like language. A planning engineer refines the near-goal schedule through a knowledge-based interactive optimization process to obtain the goal schedule which fully covers the requirement description, with the interactive schedule revision module and schedule evaluation module. A scheduling system has been implemented on the basis of the proposed problem solving framework and experimentally applied to real-world sized scheduling problems for plant construction. With a result of the overall plant construction scheduling, a section schedule optimization process is described with the emphasis on the symbolic processing functions. (author)

Shop Floor Scheduling for Program Depot Maintenance Considering Stochastic Repair Needs

National Research Council Canada - National Science Library

Gemmill, Douglas

2000-01-01

.... The research resulted in the development of a new method to identify the critical path within resource-constrained project scheduling problems, heuristic search methods that improved overall project...

Determining the level of awareness of the physicians in using the variety of electronic information resources and the effecting factors.

Science.gov (United States)

Papi, Ahmad; Ghazavi, Roghayeh; Moradi, Salimeh

2015-01-01

Understanding of the medical society's from the types of information resources for quick and easy access to information is an imperative task in medical researches and management of the treatment. The present study was aimed to determine the level of awareness of the physicians in using various electronic information resources and the factors affecting it. This study was a descriptive survey. The data collection tool was a researcher-made questionnaire. The study population included all the physicians and specialty physicians of the teaching hospitals affiliated to Isfahan University of Medical Sciences and numbered 350. The sample size based on Morgan's formula was set at 180. The content validity of the tool was confirmed by the library and information professionals and the reliability was 95%. Descriptive statistics were used including the SPSS software version 19. On reviewing the need of the physicians to obtain the information on several occasions, the need for information in conducting the researches was reported by the maximum number of physicians (91.9%) and the usage of information resources, especially the electronic resources, formed 65.4% as the highest rate with regard to meeting the information needs of the physicians. Among the electronic information databases, the maximum awareness was related to Medline with 86.5%. Among the various electronic information resources, the highest awareness (43.3%) was related to the E-journals. The highest usage (36%) was also from the same source. The studied physicians considered the most effective deterrent in the use of electronic information resources as being too busy and lack of time. Despite the importance of electronic information resources for the physician's community, there was no comprehensive knowledge of these resources. This can lead to less usage of these resources. Therefore, careful planning is necessary in the hospital libraries in order to introduce the facilities and full capabilities of the

A transportation-scheduling system for managing silvicultural projects

Science.gov (United States)

Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

2005-01-01

A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

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

Directory of Open Access Journals (Sweden)

R. Ghaffarpour

2016-12-01

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

Managing Selection for Electronic Resources: Kent State University Develops a New System to Automate Selection

Science.gov (United States)

Downey, Kay

2012-01-01

Kent State University has developed a centralized system that manages the communication and work related to the review and selection of commercially available electronic resources. It is an automated system that tracks the review process, provides selectors with price and trial information, and compiles reviewers' feedback about the resource. It…

The applicability of knowledge-based scheduling to the utilities industry

International Nuclear Information System (INIS)

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

1992-01-01

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

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)

End-of-life resource recovery from emerging electronic products

DEFF Research Database (Denmark)

Parajuly, Keshav; Habib, Komal; Cimpan, Ciprian

2016-01-01

Integrating product design with appropriate end-of-life (EoL) processing is widely recognized to have huge potentials in improving resource recovery from electronic products. In this study, we investigate both the product characteristics and EoL processing of robotic vacuum cleaner (RVC), as a case...... of emerging electronic product, in order to understand the recovery fate of different materials and its linkage to product design. Ten different brands of RVC were dismantled and their material composition and design profiles were studied. Another 125 RVCs (349 kg) were used for an experimental trial...... at a conventional ‘shred-and-separate’ type preprocessing plant in Denmark. A detailed material flow analysis was performed throughout the recycling chain. The results show a mismatch between product design and EoL processing, and the lack of practical implementation of ‘Design for EoL’ thinking. In the best...

Greedy and metaheuristics for the offline scheduling problem in grid computing

DEFF Research Database (Denmark)

Gamst, Mette

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

Multiprocessor scheduling for real-time systems

CERN Document Server

Baruah, Sanjoy; Buttazzo, Giorgio

2015-01-01

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

Energy resource management under the influence of the weekend transition considering an intensive use of electric vehicles

DEFF Research Database (Denmark)

Sousa, T.; Morais, Hugo; Pinto, T.

2015-01-01

Energy resource scheduling is becoming increasingly important, as the use of distributed resources is intensified and of massive electric vehicle is envisaged. The present paper proposes a methodology for day-ahead energy resource scheduling for smart grids considering the intensive use of distri......Energy resource scheduling is becoming increasingly important, as the use of distributed resources is intensified and of massive electric vehicle is envisaged. The present paper proposes a methodology for day-ahead energy resource scheduling for smart grids considering the intensive use...... of distributed generation and Vehicle-to-Grid (V2G). This method considers that the energy resources are managed by a Virtual Power Player (VPP) which established contracts with their owners. It takes into account these contracts, the users' requirements subjected to the VPP, and several discharge price steps...

Use of electronic sales data to tailor nutrition education resources for an ethnically diverse population.

Science.gov (United States)

Eyles, H; Rodgers, A; Ni Mhurchu, C

2010-02-01

Nutrition education may be most effective when personally tailored. Individualised electronic supermarket sales data offer opportunities to tailor nutrition education using shopper's usual food purchases. The present study aimed to use individualised electronic supermarket sales data to tailor nutrition resources for an ethnically diverse population in a large supermarket intervention trial in New Zealand. Culturally appropriate nutrition education resources (i.e. messages and shopping lists) were developed with the target population (through two sets of focus groups) and ethnic researchers. A nutrient database of supermarket products was developed using retrospective sales data and linked to participant sales to allow tailoring by usual food purchases. Modified Heart Foundation Tick criteria were used to identify 'healthier' products in the database suitable for promotion in the resources. Rules were developed to create a monthly report listing the tailored and culturally targeted messages to be sent to each participant, and to produce automated, tailored shopping lists. Culturally targeted nutrition messages (n = 864) and shopping lists (n = 3 formats) were developed. The food and nutrient database (n = 3000 top-selling products) was created using 12 months of retrospective sales data, and comprised 60%'healthier' products. Three months of baseline sales data were used to determine usual food purchases. Tailored resources were successfully mailed to 123 Māori, 52 Pacific and 346 non-Māori non-Pacific participants over the 6-month trial intervention period. Electronic supermarket sales data can be used to tailor nutrition education resources for a large number of ethnically diverse supermarket shoppers.

A framework for resources allocation in virtualised C-RAN

DEFF Research Database (Denmark)

Al-Samman, Imad; Artuso, Matteo; Christiansen, Henrik Lehrmann

2016-01-01

the performance gains of different resource allocation schemes in legacy LTE air interface virtualization. Moreover Cloud — based mobile networks are anticipated to play a significant role for next generation mobile networks. This paper investigates the potential deployment benefits of a novel resource...... virtualization algorithm (Traffic Aware Joint Scheduling) in Cloud-RANs (C-RAN). Air interface resources are coordinated and allocated dynamically by a hypervisor among different virtual operators (VOs). Three distinctive schemes are proposed and evaluated against standard Round Robin (RR) C-RAN scheduling...

Optimizing Resource Utilization in Grid Batch Systems

International Nuclear Information System (INIS)

Gellrich, Andreas

2012-01-01

On Grid sites, the requirements of the computing tasks (jobs) to computing, storage, and network resources differ widely. For instance Monte Carlo production jobs are almost purely CPU-bound, whereas physics analysis jobs demand high data rates. In order to optimize the utilization of the compute node resources, jobs must be distributed intelligently over the nodes. Although the job resource requirements cannot be deduced directly, jobs are mapped to POSIX UID/GID according to the VO, VOMS group and role information contained in the VOMS proxy. The UID/GID then allows to distinguish jobs, if users are using VOMS proxies as planned by the VO management, e.g. ‘role=production’ for Monte Carlo jobs. It is possible to setup and configure batch systems (queuing system and scheduler) at Grid sites based on these considerations although scaling limits were observed with the scheduler MAUI. In tests these limitations could be overcome with a home-made scheduler.

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.

Availability, Level of Use and Constraints to Use of Electronic Resources by Law Lecturers in Public Universities in Nigeria

Science.gov (United States)

Amusa, Oyintola Isiaka; Atinmo, Morayo

2016-01-01

(Purpose) This study surveyed the level of availability, use and constraints to use of electronic resources among law lecturers in Nigeria. (Methodology) Five hundred and fifty-two law lecturers were surveyed and four hundred and forty-two responded. (Results) Data analysis revealed that the level of availability of electronic resources for the…

Nonmyopic Sensor Scheduling and its Efficient Implementation for Target Tracking Applications

Directory of Open Access Journals (Sweden)

Morrell Darryl

2006-01-01

Full Text Available We propose two nonmyopic sensor scheduling algorithms for target tracking applications. We consider a scenario where a bearing-only sensor is constrained to move in a finite number of directions to track a target in a two-dimensional plane. Both algorithms provide the best sensor sequence by minimizing a predicted expected scheduler cost over a finite time-horizon. The first algorithm approximately computes the scheduler costs based on the predicted covariance matrix of the tracker error. The second algorithm uses the unscented transform in conjunction with a particle filter to approximate covariance-based costs or information-theoretic costs. We also propose the use of two branch-and-bound-based optimal pruning algorithms for efficient implementation of the scheduling algorithms. We design the first pruning algorithm by combining branch-and-bound with a breadth-first search and a greedy-search; the second pruning algorithm combines branch-and-bound with a uniform-cost search. Simulation results demonstrate the advantage of nonmyopic scheduling over myopic scheduling and the significant savings in computational and memory resources when using the pruning algorithms.

Predicting Scheduling and Attending for an Oral Cancer Examination

Science.gov (United States)

Shepperd, James A.; Emanuel, Amber S.; Howell, Jennifer L.; Logan, Henrietta L.

2015-01-01

Background Oral and pharyngeal cancer is highly treatable if diagnosed early, yet late diagnosis is commonplace apparently because of delays in undergoing an oral cancer examination. Purpose We explored predictors of scheduling and attending an oral cancer examination among a sample of Black and White men who were at high risk for oral cancer because they smoked. Methods During an in-person interview, participants (N = 315) from rural Florida learned about oral and pharyngeal cancer, completed survey measures, and were offered a free examination in the next week. Later, participants received a follow-up phone call to explore why they did or did not attend their examination. Results Consistent with the notion that scheduling and attending an oral cancer exam represent distinct decisions, we found that the two outcomes had different predictors. Defensive avoidance and exam efficacy predicted scheduling an examination; exam efficacy and having coping resources, time, and transportation predicted attending the examination. Open-ended responses revealed that the dominant reasons participants offered for missing a scheduled examination was conflicting obligations, forgetting, and confusion or misunderstanding about the examination. Conclusions The results suggest interventions to increase scheduling and attending an oral cancer examination. PMID:26152644

A systematic review of portable electronic technology for health education in resource-limited settings.

Science.gov (United States)

McHenry, Megan S; Fischer, Lydia J; Chun, Yeona; Vreeman, Rachel C

2017-08-01

The objective of this study is to conduct a systematic review of the literature of how portable electronic technologies with offline functionality are perceived and used to provide health education in resource-limited settings. Three reviewers evaluated articles and performed a bibliography search to identify studies describing health education delivered by portable electronic device with offline functionality in low- or middle-income countries. Data extracted included: study population; study design and type of analysis; type of technology used; method of use; setting of technology use; impact on caregivers, patients, or overall health outcomes; and reported limitations. Searches yielded 5514 unique titles. Out of 75 critically reviewed full-text articles, 10 met inclusion criteria. Study locations included Botswana, Peru, Kenya, Thailand, Nigeria, India, Ghana, and Tanzania. Topics addressed included: development of healthcare worker training modules, clinical decision support tools, patient education tools, perceptions and usability of portable electronic technology, and comparisons of technologies and/or mobile applications. Studies primarily looked at the assessment of developed educational modules on trainee health knowledge, perceptions and usability of technology, and comparisons of technologies. Overall, studies reported positive results for portable electronic device-based health education, frequently reporting increased provider/patient knowledge, improved patient outcomes in both quality of care and management, increased provider comfort level with technology, and an environment characterized by increased levels of technology-based, informal learning situations. Negative assessments included high investment costs, lack of technical support, and fear of device theft. While the research is limited, portable electronic educational resources present promising avenues to increase access to effective health education in resource-limited settings, contingent

Scheduling strategies for cycle scavenging in multicluster grid systems

NARCIS (Netherlands)

Sonmez, O.O.; Grundeken, B.; Mohamed, H.H.; Iosup, A.; Epema, D.H.J.

2009-01-01

The use of today's multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ observational scheduling, that is, they postpone the submission of relatively low-priority jobs until a cluster becomes

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

African Journals Online (AJOL)

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2008-07-01

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

Extending a HSF-enabled open-source real-time operating system with resource sharing

NARCIS (Netherlands)

Heuvel, van den M.M.H.P.; Bril, R.J.; Lukkien, J.J.; Behnam, M.; Petters, S.M.; Zijlstra, P.

2010-01-01

Hierarchical scheduling frameworks (HSFs) provide means for composing complex real-time systems from well-defined, independently analyzed subsystems. To support resource sharing within two-level, fixed priority scheduled HSFs, two synchronization protocols based on the stack resource policy (SRP)

Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

Directory of Open Access Journals (Sweden)

Supriya Kinger

2014-01-01

Full Text Available Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

Prediction based proactive thermal virtual machine scheduling in green clouds.

Science.gov (United States)

Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

2014-01-01

Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

Science.gov (United States)

Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

2014-01-01

Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated. PMID:24737962

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1995-02-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1995-02-01

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

Joint User Scheduling and MU-MIMO Hybrid Beamforming Algorithm for mmWave FDMA Massive MIMO System

Directory of Open Access Journals (Sweden)

Jing Jiang

2016-01-01

Full Text Available The large bandwidth and multipath in millimeter wave (mmWave cellular system assure the existence of frequency selective channels; it is necessary that mmWave system remains with frequency division multiple access (FDMA and user scheduling. But for the hybrid beamforming system, the analog beamforming is implemented by the same phase shifts in the entire frequency band, and the wideband phase shifts may not be harmonious with all users scheduled in frequency resources. This paper proposes a joint user scheduling and multiuser hybrid beamforming algorithm for downlink massive multiple input multiple output (MIMO orthogonal frequency division multiple access (OFDMA systems. In the first step of user scheduling, the users with identical optimal beams form an OFDMA user group and multiplex the entire frequency resource. Then base station (BS allocates the frequency resources for each member of OFDMA user group. An OFDMA user group can be regarded as a virtual user; thus it can support arbitrary MU-MIMO user selection and beamforming algorithms. Further, the analog beamforming vectors employ the best beam of each selected MU-MIMO user and the digital beamforming algorithm is solved by weight MMSE to acquire the best performance gain and mitigate the interuser inference. Simulation results show that hybrid beamforming together with user scheduling can greatly improve the performance of mmWave OFDMA massive MU-MIMO system.

An Efficient Scheduling Scheme to Enhance the Capacity of VoIP Services in Evolved UTRA Uplink

Directory of Open Access Journals (Sweden)

Kim Yong-Seok

2008-01-01

Full Text Available An efficient scheduling scheme is proposed to increase the available capacity of VoIP services over evolved UTRA uplink. On top of the advantages of persistent scheduling, the proposed scheme adaptively share the resources of two VoIP users to get early-termination gain of dynamic scheduler. Through system-level simulations, the performance of the proposed algorithm is evaluated in terms of the capacity enhancement of VoIP services. Comparisons with the original persistent scheduling and the HSUPA scheduler reveal that the proposed scheme increases the capacity of VoIP services up to 20%.

SAGES: a suite of freely-available software tools for electronic disease surveillance in resource-limited settings.

Directory of Open Access Journals (Sweden)

Sheri L Lewis

Full Text Available Public health surveillance is undergoing a revolution driven by advances in the field of information technology. Many countries have experienced vast improvements in the collection, ingestion, analysis, visualization, and dissemination of public health data. Resource-limited countries have lagged behind due to challenges in information technology infrastructure, public health resources, and the costs of proprietary software. The Suite for Automated Global Electronic bioSurveillance (SAGES is a collection of modular, flexible, freely-available software tools for electronic disease surveillance in resource-limited settings. One or more SAGES tools may be used in concert with existing surveillance applications or the SAGES tools may be used en masse for an end-to-end biosurveillance capability. This flexibility allows for the development of an inexpensive, customized, and sustainable disease surveillance system. The ability to rapidly assess anomalous disease activity may lead to more efficient use of limited resources and better compliance with World Health Organization International Health Regulations.

Use and Cost of Electronic Resources in Central Library of Ferdowsi University Based on E-metrics

Directory of Open Access Journals (Sweden)

Mohammad Reza Davarpanah

2012-07-01

Full Text Available The purpose of this study was to investigate the usage of electronic journals in Ferdowsi University, Iran based on e-metrics. The paper also aimed to emphasize the analysis of cost-benefit and the correlation between the journal impact factors and the usage data. In this study experiences of Ferdowsi University library on licensing and usage of electronic resources was evaluated by providing a cost-benefit analysis based on the cost and usage statistics of electronic resources. Vendor-provided data were also compared with local usage data. The usage data were collected by tracking web-based access locally, and by collecting vender-provided usage data. The data sources were one-year of vendor-supplied e-resource usage data such as Ebsco, Elsevier, Proquest, Emerald, Oxford and Springer and local usage data collected from the Ferdowsi university web server. The study found that actual usage values differ for vendor-provided data and local usage data. Elsevier has got the highest usage degree in searches, sessions and downloads. Statistics also showed that a small number of journals satisfy significant amount of use while the majority of journals were used less frequent and some were never used at all. The users preferred the PDF rather than HTML format. The data in subject profile suggested that the provided e-resources were best suited to certain subjects. There was no correlation between IF and electronic journal use. Monitoring the usage of e-resources gained increasing importance for acquisition policy and budget decisions. The article provided information about local metrics for the six surveyed vendors/publishers, e.g. usage trends, requests per package, cost per use as related to the scientific specialty of the university.

REPNET: project scheduling and workflow optimization for Construction Projects

Directory of Open Access Journals (Sweden)

Marco Alvise Bragadin

2013-10-01

Full Text Available Project planning and control are core processes for construction management. In practice project planning is achieved by network - based techniques like Precedence Diagramming Method (PDM.Indeed many researchers and practitioners claims that networking techniques as such do not provide a suitable model for construction projects. Construction process modeling should incorporate for specific features of resource flows through project activities. So an improved resource scheduling method for construction is developed, called REPNET, based on a precedence network plotted on a resource–space chart and presented with a flow-line chart. The heuristics of REPNET are used to carry out resource timing while optimizing processes flows and resource usage. The method has been tested on a sample project.

Data location-aware job scheduling in the grid. Application to the GridWay metascheduler

International Nuclear Information System (INIS)

Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M

2010-01-01

Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.

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

Science.gov (United States)

Kullberg, Anna; Bergenmar, Mia; Sharp, Lena

2016-05-01

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

Adapting planning and scheduling concepts to an engineering perspective: Key issues and successful techniques

International Nuclear Information System (INIS)

Finnegan, J.M.

1986-01-01

Traditional approaches to engineering planning are slanted toward the formats and interests of downstream implementation, and do not always consider the form and criticality of the front-end engineering development process. These processes and scopes are less defined and more subjective than most construction and operations tasks, and require flexible scheduling methods. This paper discusses the characteristics and requirement of engineering schedules, presents concepts for approaching planning in this field, and illustrates simple methods for developing and analyzing engineering plans, and evaluating schedule performance. Engineering plans are structured into a schedule hierarchy which delineates appropriate control and responsibilities, and is governed by key evaluation and decision milestones. Schedule risk analysis considers the uncertainty of engineering tasks, and critical resource constraints. Methods to evaluate schedule performance recognize that engineers and managers are responsible for adequate planning and forecasting, and quality decisions, even if they cannot control all factors influencing schedule results

Evaluation of a Cross Layer Scheduling Algorithm for LTE Downlink

Directory of Open Access Journals (Sweden)

A. Popovska Avramova

2013-06-01

Full Text Available The LTE standard is a leading standard in the wireless broadband market. The Radio Resource Management at the base station plays a major role in satisfying users demand for high data rates and quality of service. This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions based on channel conditions, the size of transmission buffers and different quality of service demands. Simulation results show that the new algorithm improves the resource utilization and provides better guarantees for service quality.

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

Science.gov (United States)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Interval algebra - an effective means of scheduling surveillance radar networks

CSIR Research Space (South Africa)

Focke, RW

2015-05-01

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

Interval algebra: an effective means of scheduling surveillance radar networks

CSIR Research Space (South Africa)

Focke, RW

2015-05-01

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

Joint Scheduling Optimization of Virtual Power Plants and Equitable Profit Distribution Using Shapely Value Theory

Directory of Open Access Journals (Sweden)

Zhong-fu Tan

2018-01-01

Full Text Available The installation capacity of wind and solar photovoltaic power is continually increasing, which makes renewable energy grid connection and power generation an important link of China’s power structure optimization. A virtual power plant (VPP is an important way to help distributed energy resource grid connection and promote renewable energy industry development. To study the economic scheduling problem of various distributed energy resources and the profit distribution problem of VPP alliance, this study builds a separate operation scheduling model for individual VPP and a joint operation scheduling model for VPP alliance, as well as the profit distribution model. The case study verifies the feasibility and effectiveness of the proposed model. The sensitivity analysis provides information about VPP decision-making in accordance with the policy environment development trend.

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.

Building and Managing Electronic Resources in Digital Era in India with Special Reference to IUCAA and NIV, Pune: A Comparative Case Study

Science.gov (United States)

Sahu, H. K.; Singh, S. N.

2015-04-01

This paper discusses and presents a comparative case study of two libraries in Pune, India, Inter-University Centre for Astronomy and Astrophysics and Information Centre and Library of National Institute of Virology (Indian Council of Medical Research). It compares how both libraries have managed their e-resource collections, including acquisitions, subscriptions, and consortia arrangements, while also developing a collection of their own resources, including pre-prints and publications, video lectures, and other materials in an institutional repository. This study illustrates how difficult it is to manage electronic resources in a developing country like India, even though electronic resources are used more than print resources. Electronic resource management can be daunting, but with a systematic approach, various problems can be solved, and use of the materials will be enhanced.

Wireless-Uplinks-Based Energy-Efficient Scheduling in Mobile Cloud Computing

Directory of Open Access Journals (Sweden)

Xing Liu

2015-01-01

Full Text Available Mobile cloud computing (MCC combines cloud computing and mobile internet to improve the computational capabilities of resource-constrained mobile devices (MDs. In MCC, mobile users could not only improve the computational capability of MDs but also save operation consumption by offloading the mobile applications to the cloud. However, MCC faces the problem of energy efficiency because of time-varying channels when the offloading is being executed. In this paper, we address the issue of energy-efficient scheduling for wireless uplink in MCC. By introducing Lyapunov optimization, we first propose a scheduling algorithm that can dynamically choose channel to transmit data based on queue backlog and channel statistics. Then, we show that the proposed scheduling algorithm can make a tradeoff between queue backlog and energy consumption in a channel-aware MCC system. Simulation results show that the proposed scheduling algorithm can reduce the time average energy consumption for offloading compared to the existing algorithm.

Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

Science.gov (United States)

Xia, Feng; Ma, Longhua; Peng, Chen; Sun, Youxian; Dong, Jinxiang

2008-01-01

There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS) scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting cross-layer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An event-driven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN. PMID:27879934

Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

Directory of Open Access Journals (Sweden)

Jinxiang Dong

2008-07-01

Full Text Available There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting crosslayer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An eventdriven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN.

National All Schedules Prescription Electronic Reporting Act (NASPER): balancing substance abuse and medical necessity.

Science.gov (United States)

Manchikanti, Laxmaiah; Brown, Keith R; Singh, Vijay

2002-07-01

The National All Schedules Prescription Electronic Reporting Act, or NASPER, is a bill proposed by the American Society of Interventional Pain Physicians to provide and improve patient access with quality care, and protect patients and physicians from deleterious effects of controlled substance misuse, abuse and trafficking. Controlled prescription drugs, including narcotic analgesics, anxiolytics, anti-depressants, stimulants, and sedative-hypnotics play a significant and legitimate role in interventional pain management practices in managing chronic pain and related disorders. Based on the 1997 household survey on drug abuse it is estimated that 76.9 million Americans had used an illicit drug at least once in their life. In 1997, 4.2 million people used analgesics, 2.1 million used tranquillizers, and an additional 2.3 million people used various other drugs, including sedatives, tranquillizers, etc. The non-medical use of prescription drugs exceeds that of all illicit substances except for marijuana and hashish. The report on epidemiology trends in drug abuse, based on community epidemiology work group analysis showed continued increase of abuse of prescription drugs in urban, suburban, and rural areas. The most commonly abused drugs include oxycodone, hydrocodone, hydromorphone, morphine, codeine, clonazepam, alprazolam, lorazepam, diazepam and carisoprodol. The diversion of prescription controlled substances to illicit channels is a public health and safety issue. This review describes the role of controlled substances in chronic pain management, prevalence and economic impact of controlled substance abuse, prescription accountability, effectiveness of prescription monitoring programs, and rationale for national controlled substance electronic reporting system.

Resource-aware control and dynamic scheduling in CPS

NARCIS (Netherlands)

Heemels, W.P.M.H.

2015-01-01

Recent developments in computer and communication technologies are leading to an increasingly networked and wireless world. This raises new challenging questions in the context of control for cyberphysical systems (CPS), especially when the computation, communication, energy and actuation resources

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

NARCIS (Netherlands)

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

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

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.

Scheduling of Irrigation and Leaching Requirements

Directory of Open Access Journals (Sweden)

Amer Hassan Al-haddad

2015-03-01

Full Text Available Iraq depends mainly on Tigris and Euphrates Rivers to provide high percentage of agricultural water use for thousands years. At last years, Iraq is suffering from shortage in water resources due to global climate changes and unfair water politics of the neighboring countries, which affected the future of agriculture plans for irrigation, added to that the lack of developed systems of water management in the irrigation projects and improper allocation of irrigation water, which reduces water use efficiency and lead to losing irrigation water and decreasing in agricultural yield. This study aims at studying the usability of irrigation and leaching scheduling within the irrigating projects and putting a complete annual or seasonal irrigation program as a solution for the scarcity of irrigation water, the increase of irrigation efficiency, lessening the salinity in the projects and preparing an integral irrigation calendar through field measurements of soil physical properties and chemical for project selected and compared to the results of the irrigation scheduling and leaching with what is proposed by the designers. The process is accomplished by using a computer program which was designed by Water Resources Department at the University of Baghdad, with some modification to generalize it and made it applicable to various climatic zone and different soil types. Study area represented by large project located at the Tigris River, and this project was (Al-Amara irrigation project. Sufficient samples of project's soil were collected so as to identify soil physical and chemical properties and the salinity of soil and water as well as identifying the agrarian cycles virtually applied to this project. Finally, a comparison was conducted between the calculated water quantities and the suggested ones by the designers. The research results showed that using this kind of scheduling (previously prepared irrigation and leaching scheduling with its properties

Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks

KAUST Repository

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

2017-01-01

In practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling

Sharing Data for Production Scheduling Using the ISA-95 Standard

Energy Technology Data Exchange (ETDEWEB)

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

2014-10-21

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

Sharing Data for Production Scheduling Using the ISA-95 Standard

International Nuclear Information System (INIS)

Harjunkoski, Iiro; Bauer, Reinhard

2014-01-01

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

Sharing data for production scheduling using the ISA-95 standard

Directory of Open Access Journals (Sweden)

Iiro eHarjunkoski

2014-10-01

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

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.

Real-time-service-based Distributed Scheduling Scheme for IEEE 802.16j Networks

OpenAIRE

Kuo-Feng Huang; Shih-Jung Wu

2013-01-01

Supporting Quality of Service (QoS) guarantees for diverse multimedia services is the primary concern for IEEE802.16j networks. A scheduling scheme that satisfies the QoS requirements has become more important for wireless communications. We proposed an adaptive nontransparent-based distributed scheduling scheme (ANDS) for IEEE 802.16j networks. ANDS comprises three major components: Priority Assignment, Resource Allocation, Preserved Bandwidth Adjustment. Different service-type connections p...

Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

NARCIS (Netherlands)

Nemati, F.; Behnam, M.; Bril, R.J.

2009-01-01

In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent. In practice a typical real-time system usually share logical resources among tasks. However, synchronization in the multiprocessor area has not

[Use of internet and electronic resources among Spanish intensivist physicians. First national survey].

Science.gov (United States)

Gómez-Tello, V; Latour-Pérez, J; Añón Elizalde, J M; Palencia-Herrejón, E; Díaz-Alersi, R; De Lucas-García, N

2006-01-01

Estimate knowledge and use habits of different electronic resources in a sample of Spanish intensivists: Internet, E-mail, distribution lists, and use of portable electronic devices. Self-applied questionnaire. A 50-question questionnaire was distributed among Spanish intensivists through the hospital marketing delegates of a pharmaceutical company and of electronic forums. A total of 682 questionnaires were analyzed (participation: 74%). Ninety six percent of those surveyed used Internet individually: 67% admitted training gap. Internet was the second source of clinical consultations most used (61%), slightly behind consultation to colleagues (65%). The pages consulted most were bibliographic databases (65%) and electronic professional journals (63%), with limited use of Evidence Based Medicine pages (19%). Ninety percent of those surveyed used e-mail regularly in the practice of their profession, although 25% admitted that were not aware of its possibilities. The use of E-mail decreased significantly with increase in age. A total of 62% of the intensivists used distribution lists. Of the rest, 42% were not aware of its existence and 32% admitted they had insufficient training to handle them. Twenty percent of those surveyed had portable electronic devices and 64% considered it useful, basically due to its rapid consultation at bedside. Female gender was a negative predictive factor of its use (OR 0.35; 95% CI 0.2-0.63; p=0.0002). A large majority of the Spanish intensivists use Internet and E-mail. E-mail lists and use of portable devices are still underused resources. There are important gaps in training and infrequent use of essential pages. There are specific groups that require directed educational policies.

Model of e-learning with electronic educational resources of new generation

OpenAIRE

A. V. Loban; D. A. Lovtsov

2017-01-01

Purpose of the article: improving of scientific and methodical base of the theory of the е-learning of variability. Methods used: conceptual and logical modeling of the е-learning of variability process with electronic educational resource of new generation and system analysis of the interconnection of the studied subject area, methods, didactics approaches and information and communication technologies means. Results: the formalization complex model of the е-learning of variability with elec...

Dynamic workload balancing of parallel applications with user-level scheduling on the Grid

CERN Document Server

Korkhov, Vladimir V; Krzhizhanovskaya, Valeria V

2009-01-01

This paper suggests a hybrid resource management approach for efficient parallel distributed computing on the Grid. It operates on both application and system levels, combining user-level job scheduling with dynamic workload balancing algorithm that automatically adapts a parallel application to the heterogeneous resources, based on the actual resource parameters and estimated requirements of the application. The hybrid environment and the algorithm for automated load balancing are described, the influence of resource heterogeneity level is measured, and the speedup achieved with this technique is demonstrated for different types of applications and resources.

Radio Resource Management for Uplink Carrier Aggregation in LTE-Advanced

DEFF Research Database (Denmark)

Wang, Hua; Rosa, Claudio; Pedersen, Klaus I.

2015-01-01

. On the other hand they will introduce additional power back-off for the power amplifier in the user equipment (UE) with non-contiguous resource allocation. Taking into account that the uplink is inherently limited by the maximum transmission power of the UE, the assignment of uplink CA and/or dual cluster...... scheduling algorithm is proposed for dual-cluster transmission, which tightly couples the bandwidth allocation and packet scheduling together to exploit the frequency domain diversity with low complexity. Simulation results show that with proper differentiation between power-limited and non-power-limited UEs......This paper investigates the uplink resource allocation problem in the context of LTE-Advanced systems with carrier aggregation (CA) and dual-cluster scheduling. On one hand these Rel’10 functionalities can increase the available transmission bandwidth and scheduling flexibility in uplink...

Impact of Knowledge Resources Linked to an Electronic Health Record on Frequency of Unnecessary Tests and Treatments

Science.gov (United States)

Goodman, Kenneth; Grad, Roland; Pluye, Pierre; Nowacki, Amy; Hickner, John

2012-01-01

Introduction: Electronic knowledge resources have the potential to rapidly provide answers to clinicians' questions. We sought to determine clinicians' reasons for searching these resources, the rate of finding relevant information, and the perceived clinical impact of the information they retrieved. Methods: We asked general internists, family…

Electronic Document Management: A Human Resource Management Case Study

Directory of Open Access Journals (Sweden)

Thomas Groenewald

2004-11-01

Full Text Available This case study serve as exemplar regarding what can go wrong with the implementation of an electronic document management system. Knowledge agility and knowledge as capital, is outlined against the backdrop of the information society and knowledge economy. The importance of electronic document management and control is sketched thereafter. The literature review is concluded with the impact of human resource management on knowledge agility, which includes references to the learning organisation and complexity theory. The intervention methodology, comprising three phases, follows next. The results of the three phases are presented thereafter. Partial success has been achieved with improving the human efficacy of electronic document management, however the client opted to discontinue the system in use. Opsomming Die gevalle studie dien as voorbeeld van wat kan verkeerd loop met die implementering van ’n elektroniese dokumentbestuur sisteem. Teen die agtergrond van die inligtingsgemeenskap en kennishuishouding word kennissoepelheid en kennis as kapitaal bespreek. Die literatuurstudie word afgesluit met die inpak van menslikehulpbronbestuur op kennissoepelheid, wat ook die verwysings na die leerorganisasie en kompleksietydsteorie insluit. Die metodologie van die intervensie, wat uit drie fases bestaan, volg daarna. Die resultate van die drie fases word vervolgens aangebied. Slegs gedeelte welslae is behaal met die verbetering van die menslike doeltreffendheid ten opsigte van elektroniese dokumentbestuur. Die klient besluit egter om nie voort te gaan om die huidige sisteem te gebruik nie.

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.

Results of a 5-Week Schedule of Modern Total Skin Electron Beam Radiation Therapy

Energy Technology Data Exchange (ETDEWEB)

Morris, Stephen Lloyd, E-mail: stephen.morris@gstt.nhs.uk [St Johns Institute of Dermatology, Guys and St Thomas Hospital, London (United Kingdom); McGovern, Mark; Bayne, Sally; Wain, Mary; Child, Fiona; Whittaker, Sean [St Johns Institute of Dermatology, Guys and St Thomas Hospital, London (United Kingdom)

2013-08-01

Purpose: To report the outcomes of a 5-week schedule of total skin electron beam radiation therapy (TSEB) for mycosis fungoides (MF). Methods: Over 5 years, 41 patients with confirmed MF were treated with a modern TSEB technique delivering 30 Gy in 20 fractions over 5 weeks to the whole skin surface. Data were collected prospectively and entered into the skin tumor unit research database. Skin modified skin weighted assessment tool score data were collected to determine response, duration of response, survival, and toxicity. The outcomes were analyzed according to the patient's stage before TSEB, prognostic factors, and adjuvant treatments. Results: Seventeen patients were stage 1B, 19 were stage IIB, 3 were stage III, and 2 were stage IV. The overall response rate was 95%, with a complete response rate of 51%. Seventy-six percent of patients had relapsed at median follow-up of 18 months. The median time to relapse was 12 months, to systemic therapy was 15 months, and to modified skin weighted assessment tool progression above baseline was 44 months. The complete response rate was 59% in stage IB and 47% in stage IIB patients. The median time to skin relapse was longer in stage IB compared with stage IIB, 18 months versus 9 months. The median time to systemic therapy was longer in stage IB compared with stage IIB, >56 months versus 8 months. The median overall survival was 35 months: >56 months for stage IB, 25 months for stage IIB, 46 months for stage III, and 23.5 months for stage IV. Fifteen patients received adjuvant psoralen + ultraviolet A treatment with no difference seen in the time to relapse. Conclusions: This 5-week schedule of TSEB for MF has a high response rate with comparable duration of response to other regimens. Future studies are needed to find adjuvant and combination treatments to improve the duration of response.

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.

Challenges in the implementation of an electronic surveillance system in a resource-limited setting: Alerta, in Peru

Directory of Open Access Journals (Sweden)

Soto Giselle

2008-11-01

Full Text Available Abstract Background Infectious disease surveillance is a primary public health function in resource-limited settings. In 2003, an electronic disease surveillance system (Alerta was established in the Peruvian Navy with support from the U.S. Naval Medical Research Center Detachment (NMRCD. Many challenges arose during the implementation process, and a variety of solutions were applied. The purpose of this paper is to identify and discuss these issues. Methods This is a retrospective description of the Alerta implementation. After a thoughtful evaluation according to the Centers for Disease Control and Prevention (CDC guidelines, the main challenges to implementation were identified and solutions were devised in the context of a resource-limited setting, Peru. Results After four years of operation, we have identified a number of challenges in implementing and operating this electronic disease surveillance system. These can be divided into the following categories: (1 issues with personnel and stakeholders; (2 issues with resources in a developing setting; (3 issues with processes involved in the collection of data and operation of the system; and (4 issues with organization at the central hub. Some of the challenges are unique to resource-limited settings, but many are applicable for any surveillance system. For each of these challenges, we developed feasible solutions that are discussed. Conclusion There are many challenges to overcome when implementing an electronic disease surveillance system, not only related to technology issues. A comprehensive approach is required for success, including: technical support, personnel management, effective training, and cultural sensitivity in order to assure the effective deployment of an electronic disease surveillance system.

Using Common Graphics Paradigms Implemented in a Java Applet to Represent Complex Scheduling Requirements

Science.gov (United States)

Jaap, John; Meyer, Patrick; Davis, Elizabeth

1997-01-01

The experiments planned for the International Space Station promise to be complex, lengthy and diverse. The scarcity of the space station resources will cause significant competition for resources between experiments. The scheduling job facing the Space Station mission planning software requires a concise and comprehensive description of the experiments' requirements (to ensure a valid schedule) and a good description of the experiments' flexibility (to effectively utilize available resources). In addition, the continuous operation of the station, the wide geographic dispersion of station users, and the budgetary pressure to reduce operations manpower make a low-cost solution mandatory. A graphical representation of the scheduling requirements for station payloads implemented via an Internet-based application promises to be an elegant solution that addresses all of these issues. The graphical representation of experiment requirements permits a station user to describe his experiment by defining "activities" and "sequences of activities". Activities define the resource requirements (with alternatives) and other quantitative constraints of tasks to be performed. Activities definitions use an "outline" graphics paradigm. Sequences define the time relationships between activities. Sequences may also define time relationships with activities of other payloads or space station systems. Sequences of activities are described by a "network" graphics paradigm. The bulk of this paper will describe the graphical approach to representing requirements and provide examples that show the ease and clarity with which complex requirements can be represented. A Java applet, to run in a web browser, is being developed to support the graphical representation of payload scheduling requirements. Implementing the entry and editing of requirements via the web solves the problems introduced by the geographic dispersion of users. Reducing manpower is accomplished by developing a concise

Flexible Scheduling by Deadline Inheritance in Soft Real Time Kernels

NARCIS (Netherlands)

Jansen, P.G.; Wygerink, Emiel

1996-01-01

Current Hard Real Time (HRT) kernels have their timely behaviour guaranteed on the cost of a rather restrictive use of the available resources. This makes HRT scheduling techniques inadequate for use in Soft Real Time (SRT) environment where we can make a considerable profit by a better and more

Scheduling of Crude Oil Operations in Refinery without Sufficient Charging Tanks Using Petri Nets

Directory of Open Access Journals (Sweden)

Yan An

2017-05-01

Full Text Available A short-term schedule for crude oil operations in a refinery should define and sequence the activities in detail. Each activity involves both discrete-event and continuous variables. The combinatorial nature of the scheduling problem makes it difficult to solve. For such a scheduling problem, charging tanks are a type of critical resources. If the number of charging tanks is not sufficient, the scheduling problem is further complicated. This work conducts a study on the scheduling problem of crude oil operations without sufficient charging tanks. In this case, to make a refinery able to operate, a charging tank has to be in simultaneous charging and feeding to a distiller for some time, called simultaneously-charging-and-feeding (SCF mode, leading to disturbance to the oil distillation in distillers. A hybrid Petri net model is developed to describe the behavior of the system. Then, a scheduling method is proposed to find a schedule such that the SCF mode is minimally used. It is computationally efficient. An industrial case study is given to demonstrate the obtained results.

ADAPTATION OF JOHNSON SEQUENCING ALGORITHM FOR JOB SCHEDULING TO MINIMISE THE AVERAGE WAITING TIME IN CLOUD COMPUTING ENVIRONMENT

Directory of Open Access Journals (Sweden)

SOUVIK PAL

2016-09-01

Full Text Available Cloud computing is an emerging paradigm of Internet-centric business computing where Cloud Service Providers (CSPs are providing services to the customer according to their needs. The key perception behind cloud computing is on-demand sharing of resources available in the resource pool provided by CSP, which implies new emerging business model. The resources are provisioned when jobs arrive. The job scheduling and minimization of waiting time are the challenging issue in cloud computing. When a large number of jobs are requested, they have to wait for getting allocated to the servers which in turn may increase the queue length and also waiting time. This paper includes system design for implementation which is concerned with Johnson Scheduling Algorithm that provides the optimal sequence. With that sequence, service times can be obtained. The waiting time and queue length can be reduced using queuing model with multi-server and finite capacity which improves the job scheduling model.

18 CFR 157.9 - Notice of application and notice of schedule for environmental review.

Science.gov (United States)

2010-04-01

... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Notice of application and notice of schedule for environmental review. 157.9 Section 157.9 Conservation of Power and Water Resources FEDERAL ENERGY REGULATORY COMMISSION, DEPARTMENT OF ENERGY REGULATIONS UNDER NATURAL GAS ACT APPLICATIONS FOR CERTIFICATES OF PUBLIC...

Neural Feedback Scheduling of Real-Time Control Tasks

OpenAIRE

Xia, Feng; Tian, Yu-Chu; Sun, Youxian; Dong, Jinxiang

2008-01-01

Many embedded real-time control systems suffer from resource constraints and dynamic workload variations. Although optimal feedback scheduling schemes are in principle capable of maximizing the overall control performance of multitasking control systems, most of them induce excessively large computational overheads associated with the mathematical optimization routines involved and hence are not directly applicable to practical systems. To optimize the overall control performance while minimi...

Considering Point-of-Care Electronic Medical Resources in Lieu of Traditional Textbooks for Medical Education.

Science.gov (United States)

Hale, LaDonna S; Wallace, Michelle M; Adams, Courtney R; Kaufman, Michelle L; Snyder, Courtney L

2015-09-01

Selecting resources to support didactic courses is a critical decision, and the advantages and disadvantages must be carefully considered. During clinical rotations, students not only need to possess strong background knowledge but also are expected to be proficient with the same evidence-based POC resources used by clinicians. Students place high value on “real world” learning and therefore may place more value on POC resources that they know practicing clinicians use as compared with medical textbooks. The condensed nature of PA education requires students to develop background knowledge and information literacy skills over a short period. One way to build that knowledge and those skills simultaneously is to use POC resources in lieu of traditional medical textbooks during didactic training. Electronic POC resources offer several advantages over traditional textbooks and should be considered as viable options in PA education.

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.

Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

Directory of Open Access Journals (Sweden)

Atinat Palawan

2016-05-01

Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

77 FR 37443 - Records Schedules; Availability and Request for Comments

Science.gov (United States)

2012-06-21

... an electronic information system used to track review action assignments and customer satisfaction... disposal or reduce the retention period of records already authorized for disposal. NARA invites public... accumulation, agency records managers prepare schedules proposing retention periods for records and submit...

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.

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

Science.gov (United States)

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

A novel LTE scheduling algorithm for green technology in smart grid.

Directory of Open Access Journals (Sweden)

Mohammad Nour Hindia

Full Text Available Smart grid (SG application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA, distributed energy system-storage (DER and electrical vehicle (EV, are investigated in order to study their suitability in Long Term Evolution (LTE network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule, modified-largest weighted delay first (M-LWDF and exponential/PF (EXP/PF, respectively.

A novel LTE scheduling algorithm for green technology in smart grid.

Science.gov (United States)

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

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.

A hybrid online scheduling mechanism with revision and progressive techniques for autonomous Earth observation satellite

Science.gov (United States)

Li, Guoliang; Xing, Lining; Chen, Yingwu

2017-11-01

The autonomicity of self-scheduling on Earth observation satellite and the increasing scale of satellite network attract much attention from researchers in the last decades. In reality, the limited onboard computational resource presents challenge for the online scheduling algorithm. This study considered online scheduling problem for a single autonomous Earth observation satellite within satellite network environment. It especially addressed that the urgent tasks arrive stochastically during the scheduling horizon. We described the problem and proposed a hybrid online scheduling mechanism with revision and progressive techniques to solve this problem. The mechanism includes two decision policies, a when-to-schedule policy combining periodic scheduling and critical cumulative number-based event-driven rescheduling, and a how-to-schedule policy combining progressive and revision approaches to accommodate two categories of task: normal tasks and urgent tasks. Thus, we developed two heuristic (re)scheduling algorithms and compared them with other generally used techniques. Computational experiments indicated that the into-scheduling percentage of urgent tasks in the proposed mechanism is much higher than that in periodic scheduling mechanism, and the specific performance is highly dependent on some mechanism-relevant and task-relevant factors. For the online scheduling, the modified weighted shortest imaging time first and dynamic profit system benefit heuristics outperformed the others on total profit and the percentage of successfully scheduled urgent tasks.

Scheduling Data Access in Smart Grid Networks Utilizing Context Information

DEFF Research Database (Denmark)

Findrik, Mislav; Grønbæk, Jesper; Olsen, Rasmus Løvenstein

2014-01-01

Current electrical grid is facing increased penetration of intermittent energy resources, in particular wind and solar energy. Fast variability of the power supply due to renewable energy resources can be balanced out using different energy storage systems or shifting the loads. Efficiently...... managing this fast flexibility requires two-way data exchange between a controller and sensors/meters via communication networks. In this paper we investigated scheduling of data collection utilizing meta-data from sensors that are describing dynamics of information. We show the applicability...

Resource conservation approached with an appropriate collection and upgrade-remanufacturing for used electronic products.

Science.gov (United States)

Zlamparet, Gabriel I; Tan, Quanyin; Stevels, A B; Li, Jinhui

2018-03-01

This comparative research represents an example for a better conservation of resources by reducing the amount of waste (kg) and providing it more value under the umbrella of remanufacturing. The three discussed cases will expose three issues already addressed separately in the literature. The generation of waste electrical and electronic equipment (WEEE) interacts with the environmental depletion. In this article, we gave the examples of addressed issues under the concept of remanufacturing. Online collection opportunity eliminating classical collection, a business to business (B2B) implementation for remanufactured servers and medical devices. The material reuse (recycling), component sustainability, reuse (part harvesting), product reuse (after repair/remanufacturing) indicates the recovery potential using remanufacturing tool for a better conservation of resources adding more value to the products. Our findings can provide an overview of new system organization for the general collection, market potential and the technological advantages using remanufacturing instead of recycling of WEEE or used electrical and electronic equipment. Copyright © 2017. Published by Elsevier Ltd.

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

Aircraft Stand Allocation with Associated Resource Scheduling

DEFF Research Database (Denmark)

Justesen, Tor Fog; Larsen, Jesper; Lusby, Richard Martin

-rounds simultaneously claim the same resource are handled implicitly. To solve the model, a heuristic based on linear programming is developed. The heuristic iteratively solves a relaxed, restricted version of the problem, adding extra variables at each iteration if needed. The additional variables are identified...... by a cost-based partial enumeration of the possible variables for each turn-round and the heuristic stops when the first feasible solution is encountered. The heuristic has been tested on real data from Copenhagen Airport with a special focus on tactical day-to-day planning. The results show that the method...... generates high-quality feasible solutions within reasonable time for tactical planning....

Performance analysis of job scheduling policies in parallel supercomputing environments

Energy Technology Data Exchange (ETDEWEB)

Naik, V.K.; Squillante, M.S. [IBM T.J. Watson Research Center, Yorktown Heights, NY (United States); Setia, S.K. [George Mason Univ., Fairfax, VA (United States). Dept. of Computer Science

1993-12-31

In this paper the authors analyze three general classes of scheduling policies under a workload typical of largescale scientific computing. These policies differ in the manner in which processors are partitioned among the jobs as well as the way in which jobs are prioritized for execution on the partitions. Their results indicate that existing static schemes do not perform well under varying workloads. Adaptive policies tend to make better scheduling decisions, but their ability to adjust to workload changes is limited. Dynamic partitioning policies, on the other hand, yield the best performance and can be tuned to provide desired performance differences among jobs with varying resource demands.

Effects of the Use of Electronic Human Resource Management (EHRM Within Human Resource Management (HRM Functions at Universities

Directory of Open Access Journals (Sweden)

Chux Gervase Iwu

2016-09-01

Full Text Available This study set out to examine the effect of e-hrm systems in assisting human resource practitioners to execute their duties and responsibilities. In comparison to developed economies of the world, information technology adoption in sub-Saharan Africa has not been without certain glitches. Some of the factors that are responsible for these include poor need identification, sustainable funding, and insufficient skills. Besides these factors, there is also the issue of change management and users sticking to what they already know. Although, the above factors seem negative, there is strong evidence that information systems such as electronic human resource management present benefits to an organization. To achieve this, a dual research approach was utilized. Literature assisted immensely in both the development of the conceptual framework upon which the study hinged as well as in the development of the questionnaire items. The study also made use of an interview checklist to guide the participants. The findings reveal a mix of responses that indicate that while there are gains in adopting e-hrm systems, it is wiser to consider supporting resources as well as articulate the needs of the university better before any investment is made.

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

Directory of Open Access Journals (Sweden)

Srdjan Vukmirovic

2011-08-01

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

Electronic human resource management: Enhancing or entrancing?

Directory of Open Access Journals (Sweden)

Paul Poisat

2017-07-01

Full Text Available Orientation: This article provides an investigation into the current level of development of the body of knowledge related to electronic human resource management (e-HRM by means of a qualitative content analysis. Several aspects of e-HRM, namely definitions of e-HRM, the theoretical perspectives around e-HRM, the role of e-HRM, the various types of e-HRM and the requirements for successful e-HRM, are examined. Research purpose: The purpose of the article was to determine the status of e-HRM and examine the studies that report on the link between e-HRM and organisational productivity. Motivation for the study: e-HRM has the capacity to improve organisational efficiency and leverage the role of human resources (HR as a strategic business partner. Main findings: The notion that the implementation of e-HRM will lead to improved organisational productivity is commonly assumed; however, empirical evidence in this regard was found to be limited. Practical/managerial implications: From the results of this investigation it is evident that more research is required to gain a greater understanding of the influence of e-HRM on organisational productivity, as well as to develop measures for assessing this influence. Contribution: This article proposes additional areas to research and measure when investigating the effectiveness of e-HRM. It provides a different lens from which to view e-HRM assessment whilst keeping it within recognised HR measurement parameters (the HR value chain. In addition, it not only provides areas for measuring e-HRM’s influence but also provides important clues as to how the measurements may be approached.

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

KAUST Repository

Sadek, Mirette; Aï ssa, Sonia

2011-01-01

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

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

KAUST Repository

Sadek, Mirette

2011-05-01

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

Long term adequacy of uranium resources

International Nuclear Information System (INIS)

Steyn, J.

1990-01-01

This paper examines the adequacy of world economic uranium resources to meet requirements in the very long term, that is until at least 2025 and beyond. It does so by analysing current requirements forecasts, existing and potential production centre supply capability schedules and national resource estimates. It takes into account lead times from resource discovery to production and production rate limitations. The institutional and political issues surrounding the question of adequacy are reviewed. (author)

Real-Time Electronic Dashboard Technology and Its Use to Improve Pediatric Radiology Workflow.

Science.gov (United States)

Shailam, Randheer; Botwin, Ariel; Stout, Markus; Gee, Michael S

The purpose of our study was to create a real-time electronic dashboard in the pediatric radiology reading room providing a visual display of updated information regarding scheduled and in-progress radiology examinations that could help radiologists to improve clinical workflow and efficiency. To accomplish this, a script was set up to automatically send real-time HL7 messages from the radiology information system (Epic Systems, Verona, WI) to an Iguana Interface engine, with relevant data regarding examinations stored in an SQL Server database for visual display on the dashboard. Implementation of an electronic dashboard in the reading room of a pediatric radiology academic practice has led to several improvements in clinical workflow, including decreasing the time interval for radiologist protocol entry for computed tomography or magnetic resonance imaging examinations as well as fewer telephone calls related to unprotocoled examinations. Other advantages include enhanced ability of radiologists to anticipate and attend to examinations requiring radiologist monitoring or scanning, as well as to work with technologists and operations managers to optimize scheduling in radiology resources. We foresee increased utilization of electronic dashboard technology in the future as a method to improve radiology workflow and quality of patient care. Copyright © 2017 Elsevier Inc. All rights reserved.

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

Identifying and evaluating electronic learning resources for use in adult-gerontology nurse practitioner education.

Science.gov (United States)

Thompson, Hilaire J; Belza, Basia; Baker, Margaret; Christianson, Phyllis; Doorenbos, Ardith; Nguyen, Huong

2014-01-01

Enhancing existing curricula to meet newly published adult-gerontology advanced practice registered nurse (APRN) competencies in an efficient manner presents a challenge to nurse educators. Incorporating shared, published electronic learning resources (ELRs) in existing or new courses may be appropriate in order to assist students in achieving competencies. The purposes of this project were to (a) identify relevant available ELR for use in enhancing geriatric APRN education and (b) to evaluate the educational utility of identified ELRs based on established criteria. A multilevel search strategy was used. Two independent team members reviewed identified ELR against established criteria to ensure utility. Only resources meeting all criteria were retained. Resources were found for each of the competency areas and included formats such as podcasts, Web casts, case studies, and teaching videos. In many cases, resources were identified using supplemental strategies and not through traditional search or search of existing geriatric repositories. Resources identified have been useful to advanced practice educators in improving lecture and seminar content in a particular topic area and providing students and preceptors with additional self-learning resources. Addressing sustainability within geriatric APRN education is critical for sharing of best practices among educators and for sustainability of teaching and related resources. © 2014.

Systematic review of electronic surveillance of infectious diseases with emphasis on antimicrobial resistance surveillance in resource-limited settings.

Science.gov (United States)

Rattanaumpawan, Pinyo; Boonyasiri, Adhiratha; Vong, Sirenda; Thamlikitkul, Visanu

2018-02-01

Electronic surveillance of infectious diseases involves rapidly collecting, collating, and analyzing vast amounts of data from interrelated multiple databases. Although many developed countries have invested in electronic surveillance for infectious diseases, the system still presents a challenge for resource-limited health care settings. We conducted a systematic review by performing a comprehensive literature search on MEDLINE (January 2000-December 2015) to identify studies relevant to electronic surveillance of infectious diseases. Study characteristics and results were extracted and systematically reviewed by 3 infectious disease physicians. A total of 110 studies were included. Most surveillance systems were developed and implemented in high-income countries; less than one-quarter were conducted in low-or middle-income countries. Information technologies can be used to facilitate the process of obtaining laboratory, clinical, and pharmacologic data for the surveillance of infectious diseases, including antimicrobial resistance (AMR) infections. These novel systems require greater resources; however, we found that using electronic surveillance systems could result in shorter times to detect targeted infectious diseases and improvement of data collection. This study highlights a lack of resources in areas where an effective, rapid surveillance system is most needed. The availability of information technology for the electronic surveillance of infectious diseases, including AMR infections, will facilitate the prevention and containment of such emerging infectious diseases. Copyright © 2018 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Elsevier Inc. All rights reserved.

ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING

Directory of Open Access Journals (Sweden)

P. Mathiyalagan

2010-07-01

Full Text Available Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clusters of varying sizes, and different clusters typically contains processing elements with different level of performance. In this, heuristic approaches based on particle swarm optimization and ant colony optimization algorithms are adopted for solving task scheduling problems in grid environment. Particle Swarm Optimization (PSO is one of the latest evolutionary optimization techniques by nature. It has the better ability of global searching and has been successfully applied to many areas such as, neural network training etc. Due to the linear decreasing of inertia weight in PSO the convergence rate becomes faster, which leads to the minimal makespan time when used for scheduling. To make the convergence rate faster, the PSO algorithm is improved by modifying the inertia parameter, such that it produces better performance and gives an optimized result. The ACO algorithm is improved by modifying the pheromone updating rule. ACO algorithm is hybridized with PSO algorithm for efficient result and better convergence in PSO algorithm.

Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations

CERN Document Server

Toporkov, Victor; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

2015-01-01

In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution strategies are suggested. Job framework forming is justified with such quality of service indicators as an average job execution time, a number of required scheduling cycles, and a number of job execution declines. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one utilizes the mentioned compatibility coefficient. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.

Resource-loaded planning for ALICE

CERN Document Server

Gastal, M

2005-01-01

The ALICE experimental area management team faces various challenges when it comes to sharing scarce resources, indispensable to any efficient installation in a category one worksite. Space, cranes, jigs, and personnel with key competences have to be carefully allocated to activities so as to avoid slowing down work progress. To this intent, a resource loaded planning has been developed that allows highlighting coactivities and prioritizing critical tasks. It uses the built-in capabilities of Microsoft Project. The use of this scheduling tool leads to a more efficient use of time and a safer work environment. The installation sequence resulting from this schedule is presented in this paper. The first part of the sequence focuses on the revision of the coils in the SX2 building. The dipole has then to be installed in the RB26 side of the UX25 cavern. This complex and resource intensive activity has to be performed in parallel with the services installation inside the L3 magnet. On the RB24 side of the cavern t...

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

Science.gov (United States)

Ahmed, Z; Elmekkawy, Ty; Bates, S

2011-01-01

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

75 FR 4316 - Integration of Variable Energy Resources

Science.gov (United States)

2010-01-27

... regional transmission organizations (RTOs) or independent system operators (ISOs), resources typically... discretion to accept schedule changes no later than 20 minutes prior to the operating hour. 20. In RTOs/ISOs... economic dispatch of internal resources, which affords RTOs/ISOs the ability to respond quickly and...

Resource Allocation for A Mobile Application Oriented Architecture

NARCIS (Netherlands)

Guo, Y.; Smit, Gerardus Johannes Maria; Lu, W.W.; Xie, X.

2005-01-01

A Montium is a coarse-grained reconfigurable architecture designed by the CADTES group of the University of Twente for mobile applications. This paper presents a resource allocation method to allocate variables to storage places and to schedule data movements for the Montium. The resource allocation

Scheduling at the Los Alamos Neutron Science Center (LANSCE)

International Nuclear Information System (INIS)

Gallegos, F.R.

1999-01-01

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

From Millennium ERM to Proquest 360 Resource Manager: Implementing a new Electronic Resources Management System ERMS in an International Graduate Research University in Saudi Arabia

KAUST Repository

Ramli, Rindra M.

2017-01-01

An overview of the Recommendation Study and the subsequent Implementation of a new Electronic Resources Management system ERMS in an international graduate research university in the Kingdom of Saudi Arabia. It covers the timeline, deliverables

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.

Long range planning, scheduling and budgeting for the environmental compliance program at the Rocky Flats Plant

International Nuclear Information System (INIS)

McKinley, K.B.; Nielsen, T.H.

1989-01-01

This paper reports how the Rocky Flats RCRA/CERCLA group at the Rocky Flats Plant in Golden, Colorado is developing a computerized schedule and budget management system. The system will aggregate schedule, budgets, and regulatory commitments provided by RCRA/CERCLA program managers. The system will provide tabular and graphical representations of the schedule and budget information at various levels of detail. The system will perform a variety of analyses on the schedule and budget. The RCRA/CERCLA group will use the results to develop realistic compliance schedules and the budgets necessary to meet them. Presentation of the schedules and budgets in a consistent graphical and tabular form will give a good appreciation of the remediation costs as understood by the RCRA/CERCLA group. The system will then be used to test resource availability and remediation period scenarios, differing from the optimal combination as determined by the RCRA/CERCLA group

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm.

Science.gov (United States)

Abdulhamid, Shafi'i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm

Science.gov (United States)

Abdulhamid, Shafi’i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques. PMID:27384239

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.

Integrating GRID tools to build a computing resource broker: activities of DataGrid WP1

International Nuclear Information System (INIS)

Anglano, C.; Barale, S.; Gaido, L.; Guarise, A.; Lusso, S.; Werbrouck, A.

2001-01-01

Resources on a computational Grid are geographically distributed, heterogeneous in nature, owned by different individuals or organizations with their own scheduling policies, have different access cost models with dynamically varying loads and availability conditions. This makes traditional approaches to workload management, load balancing and scheduling inappropriate. The first work package (WP1) of the EU-funded DataGrid project is addressing the issue of optimizing the distribution of jobs onto Grid resources based on a knowledge of the status and characteristics of these resources that is necessarily out-of-date (collected in a finite amount of time at a very loosely coupled site). The authors describe the DataGrid approach in integrating existing software components (from Condor, Globus, etc.) to build a Grid Resource Broker, and the early efforts to define a workable scheduling strategy

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

Science.gov (United States)

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

2017-03-01

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

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.

Open-Source Electronic Health Record Systems for Low-Resource Settings: Systematic Review.

Science.gov (United States)

Syzdykova, Assel; Malta, André; Zolfo, Maria; Diro, Ermias; Oliveira, José Luis

2017-11-13

Despite the great impact of information and communication technologies on clinical practice and on the quality of health services, this trend has been almost exclusive to developed countries, whereas countries with poor resources suffer from many economic and social issues that have hindered the real benefits of electronic health (eHealth) tools. As a component of eHealth systems, electronic health records (EHRs) play a fundamental role in patient management and effective medical care services. Thus, the adoption of EHRs in regions with a lack of infrastructure, untrained staff, and ill-equipped health care providers is an important task. However, the main barrier to adopting EHR software in low- and middle-income countries is the cost of its purchase and maintenance, which highlights the open-source approach as a good solution for these underserved areas. The aim of this study was to conduct a systematic review of open-source EHR systems based on the requirements and limitations of low-resource settings. First, we reviewed existing literature on the comparison of available open-source solutions. In close collaboration with the University of Gondar Hospital, Ethiopia, we identified common limitations in poor resource environments and also the main requirements that EHRs should support. Then, we extensively evaluated the current open-source EHR solutions, discussing their strengths and weaknesses, and their appropriateness to fulfill a predefined set of features relevant for low-resource settings. The evaluation methodology allowed assessment of several key aspects of available solutions that are as follows: (1) integrated applications, (2) configurable reports, (3) custom reports, (4) custom forms, (5) interoperability, (6) coding systems, (7) authentication methods, (8) patient portal, (9) access control model, (10) cryptographic features, (11) flexible data model, (12) offline support, (13) native client, (14) Web client,(15) other clients, (16) code

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

Directory of Open Access Journals (Sweden)

Li Tian

2014-04-01

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

Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS

DEFF Research Database (Denmark)

Wang, Haibo; Devendra, Devendra; Zhou, Xin

This paper investigates the Radio Resource Management (RRM) approaches for GSM/GPRS networks. The effort was put on Access Control(AC), Time-Slot (TS) allocation, and Radio Link Control (RLC) packet scheduling for down-link performance enhancement. A new credit-based algorithm was proposed...

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.

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.

Status Report on the Development of Micro-Scheduling Software for the Advanced Outage Control Center Project

Energy Technology Data Exchange (ETDEWEB)

Germain, Shawn St. [Idaho National Lab. (INL), Idaho Falls, ID (United States); Thomas, Kenneth [Idaho National Lab. (INL), Idaho Falls, ID (United States); Farris, Ronald [Idaho National Lab. (INL), Idaho Falls, ID (United States); Joe, Jeffrey [Idaho National Lab. (INL), Idaho Falls, ID (United States)

2014-09-01

The long-term viability of existing nuclear power plants (NPPs) in the United States (U.S.) is dependent upon a number of factors, including maintaining high capacity factors, maintaining nuclear safety, and reducing operating costs, particularly those associated with refueling outages. Refueling outages typically take 20-30 days, and for existing light water NPPs in the U.S., the reactor cannot be in operation during the outage. Furthermore, given that many NPPs generate between $1-1.5 million/day in revenue when in operation, there is considerable interest in shortening the length of refueling outages. Yet, refueling outages are highly complex operations, involving multiple concurrent and dependent activities that are difficult to coordinate. Finding ways to improve refueling outage performance while maintaining nuclear safety has proven to be difficult. The Advanced Outage Control Center project is a research and development (R&D) demonstration activity under the Light Water Reactor Sustainability (LWRS) Program. LWRS is a R&D program which works with industry R&D programs to establish technical foundations for the licensing and managing of long-term, safe, and economical operation of current NPPs. The Advanced Outage Control Center project has the goal of improving the management of commercial NPP refueling outages. To accomplish this goal, this INL R&D project is developing an advanced outage control center (OCC) that is specifically designed to maximize the usefulness of communication and collaboration technologies for outage coordination and problem resolution activities. This report describes specific recent efforts to develop a capability called outage Micro-Scheduling. Micro-Scheduling is the ability to allocate and schedule outage support task resources on a sub-hour basis. Micro-Scheduling is the real-time fine-tuning of the outage schedule to react to the actual progress of the primary outage activities to ensure that support task resources are

Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

Directory of Open Access Journals (Sweden)

H Kazemipoor

2012-04-01

Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.

Real-time distributed scheduling algorithm for supporting QoS over WDM networks

Science.gov (United States)

Kam, Anthony C.; Siu, Kai-Yeung

1998-10-01

Most existing or proposed WDM networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently they are not suitable for data applications involving bursty traffic patterns. The MIT AON Consortium has developed an all-optical LAN/MAN testbed which provides time-slotted WDM service and employs fast-tunable transceivers in each optical terminal. In this paper, we explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time-sharing the wavelengths in a fair manner. In particular, we develop a real-time distributed protocol for best-effort traffic over this time-slotted WDM service with near-optical fairness and throughput characteristics. As an additional design feature, our protocol supports the allocation of guaranteed bandwidths to selected connections. This feature acts as a first step towards supporting integrated services and quality-of-service guarantees over WDM networks. To achieve high throughput, our approach is based on scheduling transmissions, as opposed to collision- based schemes. Our distributed protocol involves one MAN scheduler and several LAN schedulers (one per LAN) in a master-slave arrangement. Because of propagation delays and limits on control channel capacities, all schedulers are designed to work with partial, delayed traffic information. Our distributed protocol is of the `greedy' type to ensure fast execution in real-time in response to dynamic traffic changes. It employs a hybrid form of rate and credit control for resource allocation. We have performed extensive simulations, which show that our protocol allocates resources (transmitters, receivers, wavelengths) fairly with high throughput, and supports bandwidth guarantees.

Research on Scheduling Algorithm for Multi-satellite and Point Target Task on Swinging Mode

Science.gov (United States)

Wang, M.; Dai, G.; Peng, L.; Song, Z.; Chen, G.

2012-12-01

Nowadays, using satellite in space to observe ground is an important and major method to obtain ground information. With the development of the scientific technology in the field of space, many fields such as military and economic and other areas have more and more requirement of space technology because of the benefits of the satellite's widespread, timeliness and unlimited of area and country. And at the same time, because of the wide use of all kinds of satellites, sensors, repeater satellites and ground receiving stations, ground control system are now facing great challenge. Therefore, how to make the best value of satellite resources so as to make full use of them becomes an important problem of ground control system. Satellite scheduling is to distribute the resource to all tasks without conflict to obtain the scheduling result so as to complete as many tasks as possible to meet user's requirement under considering the condition of the requirement of satellites, sensors and ground receiving stations. Considering the size of the task, we can divide tasks into point task and area task. This paper only considers point targets. In this paper, a description of satellite scheduling problem and a chief introduction of the theory of satellite scheduling are firstly made. We also analyze the restriction of resource and task in scheduling satellites. The input and output flow of scheduling process are also chiefly described in the paper. On the basis of these analyses, we put forward a scheduling model named as multi-variable optimization model for multi-satellite and point target task on swinging mode. In the multi-variable optimization model, the scheduling problem is transformed the parametric optimization problem. The parameter we wish to optimize is the swinging angle of every time-window. In the view of the efficiency and accuracy, some important problems relating the satellite scheduling such as the angle relation between satellites and ground targets, positive

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.

76 FR 78950 - FBI Criminal Justice Information Services Division; Revised User Fee Schedule

Science.gov (United States)