Integrated network design and scheduling problems :

Energy Technology Data Exchange (ETDEWEB)

Nurre, Sarah G.; Carlson, Jeffrey J.

2014-01-01

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

Scheduling language and algorithm development study. Volume 2, phase 2: Introduction to plans programming. [user guide

Science.gov (United States)

Cochran, D. R.; Ishikawa, M. K.; Paulson, R. E.; Ramsey, H. R.

1975-01-01

A user guide for the Programming Language for Allocation and Network Scheduling (PLANS) is presented. Information is included for the construction of PLANS programs. The basic philosophy of PLANS is discussed, and access and update reference techniques are described along with the use of tree structures.

Spent nuclear fuel project integrated schedule plan

International Nuclear Information System (INIS)

Squires, K.G.

1995-01-01

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

Spent nuclear fuel project integrated schedule plan

Energy Technology Data Exchange (ETDEWEB)

Squires, K.G.

1995-03-06

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

Integrated multi-resource planning and scheduling in engineering project

Directory of Open Access Journals (Sweden)

Samer Ben Issa

2017-01-01

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

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

Bridging the Gap Between Planning and Scheduling

Science.gov (United States)

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

2000-01-01

Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

WiMax network planning and optimization

CERN Document Server

Zhang, Yan

2009-01-01

This book offers a comprehensive explanation on how to dimension, plan, and optimize WiMAX networks. The first part of the text introduces WiMAX networks architecture, physical layer, standard, protocols, security mechanisms, and highly related radio access technologies. It covers system framework, topology, capacity, mobility management, handoff management, congestion control, medium access control (MAC), scheduling, Quality of Service (QoS), and WiMAX mesh networks and security. Enabling easy understanding of key concepts and technologies, the second part presents practical examples and illu

Stochastic project networks temporal analysis, scheduling and cost minimization

CERN Document Server

Neumann, Klaus

1990-01-01

Project planning, scheduling, and control are regularly used in business and the service sector of an economy to accomplish outcomes with limited resources under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network techniques CPM and PERT and which represent acyclic weighted directed graphs, are able to describe only projects whose evolution in time is uniquely specified in advance. Here every event of the project is realized exactly once during a single project execution and it is not possible to return to activities previously carried out (that is, no feedback is permitted). Many practical projects, however, do not meet those conditions. Consider, for example, a production process where some parts produced by a machine may be poorly manufactured. If an inspection shows that a part does no...

Future aircraft networks and schedules

Science.gov (United States)

Shu, Yan

2011-07-01

Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

Automated Planning and Scheduling for Planetary Rover Distributed Operations

Science.gov (United States)

Backes, Paul G.; Rabideau, Gregg; Tso, Kam S.; Chien, Steve

1999-01-01

Automated planning and Scheduling, including automated path planning, has been integrated with an Internet-based distributed operations system for planetary rover operations. The resulting prototype system enables faster generation of valid rover command sequences by a distributed planetary rover operations team. The Web Interface for Telescience (WITS) provides Internet-based distributed collaboration, the Automated Scheduling and Planning Environment (ASPEN) provides automated planning and scheduling, and an automated path planner provided path planning. The system was demonstrated on the Rocky 7 research rover at JPL.

Space network scheduling benchmark: A proof-of-concept process for technology transfer

Science.gov (United States)

Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy

1993-01-01

This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

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

The Planning and Scheduling of HST: Improvements and Enhancements since Launch

Science.gov (United States)

Taylor, D. K.; Chance, D. R.; Jordan, I. J. E.; Patterson, A. P.; Stanley, M.; Taylor, D. C.

2001-12-01

The planning and scheduling (P&S) systems used in operating the Hubble Space Telescope (HST) have undergone such substantial and pervasive re-engineering that today they dimly resemble those used when HST was launched. Processes (i.e., software, procedures, networking, etc.) which allow program implementation, the generation of a Long Range Plan (LRP), and the scheduling of science and mission activities have improved drastically in nearly 12 years, resulting in a consistently high observing efficiency, a stable LRP that principal investigators can use, exceptionally clean command loads uplinked to the spacecraft, and the capability of a very fast response time due to onboard anomalies or targets of opportunity. In this presentation we describe many of the systems which comprise the P&S ("front-end") system for HST, how and why they were improved, and what benefits have been realized by either the HST user community or the STScI staff. The systems include the Guide Star System, the Remote Proposal Submission System - 2 (RPS2), Artificial Intelligence (AI) planning tools such as Spike, and the science and mission scheduling software. We also describe how using modern software languages such as Python and better development practices allow STScI staff to do more with HST (e.g., to handle much more science data when ACS is installed) without increasing the cost to HST operations.

Scheduling Maintenance Jobs in Networks

OpenAIRE

Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman

2017-01-01

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral t...

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.

Production Planning and Planting Pattern Scheduling Information System for Horticulture

Science.gov (United States)

Vitadiar, Tanhella Zein; Farikhin; Surarso, Bayu

2018-02-01

This paper present the production of planning and planting pattern scheduling faced by horticulture farmer using two methods. Fuzzy time series method use to predict demand on based on sales amount, while linear programming is used to assist horticulture farmers in making production planning decisions and determining the schedule of cropping patterns in accordance with demand predictions of the fuzzy time series method, variable use in this paper is size of areas, production advantage, amount of seeds and age of the plants. This research result production planning and planting patterns scheduling information system with the output is recommendations planting schedule, harvest schedule and the number of seeds will be plant.

Computer-aided resource planning and scheduling for radiological services

Science.gov (United States)

Garcia, Hong-Mei C.; Yun, David Y.; Ge, Yiqun; Khan, Javed I.

1996-05-01

There exists tremendous opportunity in hospital-wide resource optimization based on system integration. This paper defines the resource planning and scheduling requirements integral to PACS, RIS and HIS integration. An multi-site case study is conducted to define the requirements. A well-tested planning and scheduling methodology, called Constrained Resource Planning model, has been applied to the chosen problem of radiological service optimization. This investigation focuses on resource optimization issues for minimizing the turnaround time to increase clinical efficiency and customer satisfaction, particularly in cases where the scheduling of multiple exams are required for a patient. How best to combine the information system efficiency and human intelligence in improving radiological services is described. Finally, an architecture for interfacing a computer-aided resource planning and scheduling tool with the existing PACS, HIS and RIS implementation is presented.

Scheduling and Topology Design in Networks with Directional Antennas

Science.gov (United States)

2017-05-19

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

Production planning and scheduling in refinery industry

International Nuclear Information System (INIS)

Persson, Jan.

1999-01-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-07-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-06-01

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

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

APGEN Scheduling: 15 Years of Experience in Planning Automation

Science.gov (United States)

Maldague, Pierre F.; Wissler, Steve; Lenda, Matthew; Finnerty, Daniel

2014-01-01

In this paper, we discuss the scheduling capability of APGEN (Activity Plan Generator), a multi-mission planning application that is part of the NASA AMMOS (Advanced Multi- Mission Operations System), and how APGEN scheduling evolved over its applications to specific Space Missions. Our analysis identifies two major reasons for the successful application of APGEN scheduling to real problems: an expressive DSL (Domain-Specific Language) for formulating scheduling algorithms, and a well-defined process for enlisting the help of auxiliary modeling tools in providing high-fidelity, system-level simulations of the combined spacecraft and ground support system.

Distribution network planning method considering distributed generation for peak cutting

International Nuclear Information System (INIS)

Ouyang Wu; Cheng Haozhong; Zhang Xiubin; Yao Liangzhong

2010-01-01

Conventional distribution planning method based on peak load brings about large investment, high risk and low utilization efficiency. A distribution network planning method considering distributed generation (DG) for peak cutting is proposed in this paper. The new integrated distribution network planning method with DG implementation aims to minimize the sum of feeder investments, DG investments, energy loss cost and the additional cost of DG for peak cutting. Using the solution techniques combining genetic algorithm (GA) with the heuristic approach, the proposed model determines the optimal planning scheme including the feeder network and the siting and sizing of DG. The strategy for the site and size of DG, which is based on the radial structure characteristics of distribution network, reduces the complexity degree of solving the optimization model and eases the computational burden substantially. Furthermore, the operation schedule of DG at the different load level is also provided.

Operating Theatre Planning and Scheduling.

NARCIS (Netherlands)

Hans, Elias W.; Vanberkel, P.T.; Hall, R.

2012-01-01

In this chapter we present a number of approaches to operating theatre planning and scheduling. We organize these approaches hierarchically which serves to illustrate the breadth of problems confronted by researchers. At each hierarchicalplanning level we describe common problems, solution

Coordinated scheduling for the downlink of cloud radio-access networks

KAUST Repository

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

2015-01-01

This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit

Evolutionary Scheduler for the Deep Space Network

Science.gov (United States)

Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert

2010-01-01

A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

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

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.

Planning construction of integrative schedule management for nuclear power project

International Nuclear Information System (INIS)

Zeng Zhenglin; Wang Wenying; Peng Fei

2012-01-01

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

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

Joint opportunistic scheduling and network coding for bidirectional relay channel

KAUST Repository

Shaqfeh, Mohammad

2013-07-01

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

Harvesting and wood transport planning with SNAP III program (Scheduling and Network Analysis Program in a pine plantation in Southeast Brazil

Directory of Open Access Journals (Sweden)

Lopes Eduardo da Silva

2003-01-01

Full Text Available The objective of this study was to verify the potential of SNAP III (Scheduling and Network Analysis Program as a support tool for harvesting and wood transport planning in Brazil harvesting subsystem definition and establishment of a compatible route were assessed. Initially, machine operational and production costs were determined in seven subsystems for the study area, and quality indexes, construction and maintenance costs of forest roads were obtained and used as SNAP III program input data. The results showed, that three categories of forest road occurrence were observed in the study area: main, secondary and tertiary which, based on quality index, allowed a medium vehicle speed of about 41, 30 and 24 km/hours and a construction cost of about US$ 5,084.30, US$ 2,275.28 and US$ 1,650.00/km, respectively. The SNAP III program used as a support tool for the planning, was found to have a high potential tool in the harvesting and wood transport planning. The program was capable of defining efficiently, the harvesting subsystem on technical and economical basis, the best wood transport route and the forest road to be used in each period of the horizon planning.

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

Optimized Charging Scheduling with Single Mobile Charger for Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Qihua Wang

2017-11-01

Full Text Available Due to the rapid development of wireless charging technology, the recharging issue in wireless rechargeable sensor network (WRSN has been a popular research problem in the past few years. The weakness of previous work is that charging route planning is not reasonable. In this work, a dynamic optimal scheduling scheme aiming to maximize the vacation time ratio of a single mobile changer for WRSN is proposed. In the proposed scheme, the wireless sensor network is divided into several sub-networks according to the initial topology of deployed sensor networks. After comprehensive analysis of energy states, working state and constraints for different sensor nodes in WRSN, we transform the optimized charging path problem of the whole network into the local optimization problem of the sub networks. The optimized charging path with respect to dynamic network topology in each sub-network is obtained by solving an optimization problem, and the lifetime of the deployed wireless sensor network can be prolonged. Simulation results show that the proposed scheme has good and reliable performance for a small wireless rechargeable sensor network.

Simultaneous optimization of planning and scheduling in an oil refinery

NARCIS (Netherlands)

Zondervan, E.; van Boekel, T.P.J.; Fransoo, J.C.; Haan, de A.B.; Postikopoulos, E.N.; Georgiadis, M.C.; Kokossis, A.

2011-01-01

In earlier work we have developed and tested a scheduling model [1] in the AIMMS software. In this follow-up contribution we will develop a planning model. Next we will identify the information flow between scheduling model and the planning model. Lastly we will integrate the two models in a

Traffic Scheduling in WDM Passive Optical Network with Delay Guarantee

Institute of Scientific and Technical Information of China (English)

无

2005-01-01

WDM passive optical network becomes more favorable as the required bandwidth increases, but currently few media access control algorithms adapted to WDM access network. This paper presented a new scheduling algorithm for bandwidth sharing in WDM passive optical networks, which provides per-flow delay guarantee and supports variable-length packets scheduling. Through theoretical analysis and simulation, the end-to-end delay bound and throughput fairness of the algorithm was demonstrated.

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.

Computation and evaluation of scheduled waiting time for railway networks

DEFF Research Database (Denmark)

Landex, Alex

2010-01-01

Timetables are affected by scheduled waiting time (SWT) that prolongs the travel times for trains and thereby passengers. SWT occurs when a train hinders another train to run with the wanted speed. The SWT affects both the trains and the passengers in the trains. The passengers may be further...... affected due to longer transfer times to other trains. SWT can be estimated analytically for a given timetable or by simulation of timetables and/or plans of operation. The simulation of SWT has the benefit that it is possible to examine the entire network. This makes it possible to improve the future...

Optimal scheduling for distribution network with redox flow battery storage

International Nuclear Information System (INIS)

Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

2016-01-01

Highlights: • A novel method for optimal scheduling of storages in radial network is presented. • Peak shaving and load leveling are the main objectives. • Vanadium redox flow battery is considered as the energy storage unit. • Real data is used for simulation. - Abstract: There are many advantages to utilize storages in electric power system. Peak shaving, load leveling, load frequency control, integration of renewable, energy trading and spinning reserve are the most important of them. Batteries, especially redox flow batteries, are one of the appropriate storages for utilization in distribution network. This paper presents a novel, heuristic and practical method for optimal scheduling in distribution network with flow battery storage. This heuristic method is more suitable for scheduling and operation of distribution networks which require installation of storages. Peak shaving and load leveling is considered as the main objective in this paper. Several indices are presented in this paper for determine the place of storages and also scheduling for optimal use of energy in them. Simulations of this paper are based on real information of distribution network substation that located in Semnan, Iran.

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

KAUST Repository

Douik, Ahmed

2017-09-07

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

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.

DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations

CERN Document Server

Rosenberg, Arnold L; Sotteau, Dominique; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; Interconnection networks and mapping and scheduling parallel computations

1995-01-01

The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed pro...

Sleep scheduling with expected common coverage in wireless sensor networks

OpenAIRE

Bulut, Eyuphan; Korpeoglu, Ibrahim

2011-01-01

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, proces...

Freezing the Master Production Schedule Under Rolling Planning Horizons

OpenAIRE

V. Sridharan; William L. Berry; V. Udayabhanu

1987-01-01

The stability of the Master Production Schedule (MPS) is a critical issue in managing production operations with a Material Requirements Planning System. One method of achieving stability is to freeze some portion or all of the MPS. While freezing the MPS can limit the number of schedule changes, it can also produce an increase in production and inventory costs. This paper examines three decision variables in freezing the MPS: the freezing method, the freeze interval length, and the planning ...

Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

KAUST Repository

Shaqfeh, Mohammad

2013-05-27

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

Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

KAUST Repository

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

2013-01-01

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

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

A subjective scheduler for subjective dedicated networks

Science.gov (United States)

Suherman; Fakhrizal, Said Reza; Al-Akaidi, Marwan

2017-09-01

Multiple access technique is one of important techniques within medium access layer in TCP/IP protocol stack. Each network technology implements the selected access method. Priority can be implemented in those methods to differentiate services. Some internet networks are dedicated for specific purpose. Education browsing or tutorial video accesses are preferred in a library hotspot, while entertainment and sport contents could be subjects of limitation. Current solution may use IP address filter or access list. This paper proposes subjective properties of users or applications are used for priority determination in multiple access techniques. The NS-2 simulator is employed to evaluate the method. A video surveillance network using WiMAX is chosen as the object. Subjective priority is implemented on WiMAX scheduler based on traffic properties. Three different traffic sources from monitoring video: palace, park, and market are evaluated. The proposed subjective scheduler prioritizes palace monitoring video that results better quality, xx dB than the later monitoring spots.

Schedule optimization study implementation plan

International Nuclear Information System (INIS)

1993-11-01

This Implementation Plan is intended to provide a basis for improvements in the conduct of the Environmental Restoration (ER) Program at Hanford. The Plan is based on the findings of the Schedule Optimization Study (SOS) team which was convened for two weeks in September 1992 at the request of the U.S. Department of Energy (DOE) Richland Operations Office (RL). The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit (OU) Remedial Investigation/Feasibility Study (RI/FS) Work Plan. The SOS team was comprised of independent professionals from other federal agencies and the private sector experienced in environmental restoration within the federal system. The objective of the team was to examine reasons for the lengthy RI/FS process and recommend ways to expedite it. The SOS team issued their Final Report in December 1992. The report found the most serious impediments to cleanup relate to a series of management and policy issues which are within the control of the three parties managing and monitoring Hanford -- the DOE, U.S. Environmental Protection Agency (EPA), and the State of Washington Department of Ecology (Ecology). The SOS Report identified the following eight cross-cutting issues as the root of major impediments to the Hanford Site cleanup. Each of these eight issues is quoted from the SOS Report followed by a brief, general description of the proposed approach being developed

Gain and exposure scheduling to compensate for photorefractive neural-network weight decay

Science.gov (United States)

Goldstein, Adam A.; Petrisor, Gregory C.; Jenkins, B. Keith

1995-03-01

A gain and exposure schedule that theoretically eliminates the effect of photorefractive weight decay for the general class of outer-product neural-network learning algorithms (e.g., backpropagation, Widrow-Hoff, perceptron) is presented. This schedule compensates for photorefractive diffraction-efficiency decay by iteratively increasing the spatial-light-modulator transfer function gain and decreasing the weight-update exposure time. Simulation results for the scheduling procedure, as applied to backpropagation learning for the exclusive-OR problem, show improved learning performance compared with results for networks trained without scheduling.

Scheduled Collision Avoidance in wireless sensor network using Zigbee

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2014-01-01

Transmission reliability and energy consumptions are two critical concerns associated with wireless sensor network (WSN) design for a long time and continuous operation. With the increase in reliability of the transmission, the energy consumption increases by affecting the efficiency of the network....... This paper proposes the Schedule based Collision Avoidance (SCA) algorithm for finding the tradeoff between reliability and energy efficiency by fusion of CSMA/CA and TDMA techniques in Zigbee/ IEEE802.15.4. It uses the multi-path data propagation for collision avoidance and effective utilization...... of the channel providing efficient energy consumption. It analyses different scheduling schemes to provide an appropriate solution for reducing collisions and improving network lifetime....

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

Coordinated scheduling for the downlink of cloud radio-access networks

KAUST Repository

Douik, Ahmed S.

2015-09-11

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

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.

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

Science.gov (United States)

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

2013-04-01

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

Using Integer Programming for Airport Service Planning in Staff Scheduling

Directory of Open Access Journals (Sweden)

W.H. Ip

2010-09-01

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

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.

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

Science.gov (United States)

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

2018-06-12

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

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.

QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Zhang Yan

2009-01-01

Full Text Available This paper studies the packet scheduling problem in Broadband Wireless Access (BWA networks. The key difficulties of the BWA scheduling problem lie in the high variability of wireless channel capacity and the unknown model of packet arrival process. It is difficult for traditional heuristic scheduling algorithms to handle the situation and guarantee satisfying performance in BWA networks. In this paper, we introduce learning-based approach for a better solution. Specifically, we formulate the packet scheduling problem as an average cost Semi-Markov Decision Process (SMDP. Then, we solve the SMDP by using reinforcement learning. A feature-based linear approximation and the Temporal-Difference learning technique are employed to produce a near optimal solution of the corresponding SMDP problem. The proposed algorithm, called Reinforcement Learning Scheduling (RLS, has in-built capability of self-training. It is able to adaptively and timely regulate its scheduling policy according to the instantaneous network conditions. Simulation results indicate that RLS outperforms two classical scheduling algorithms and simultaneously considers: (i effective QoS differentiation, (ii high bandwidth utilization, and (iii both short-term and long-term fairness.

Automated Planning and Scheduling for Space Mission Operations

Science.gov (United States)

Chien, Steve; Jonsson, Ari; Knight, Russell

2005-01-01

Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.

A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

Directory of Open Access Journals (Sweden)

Arash T. Toyserkani

2009-01-01

Full Text Available We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

32 CFR 644.8 - Planning and scheduling real estate activities.

Science.gov (United States)

2010-07-01

... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling... of sound judgment, actual hardship is found to exist. (iii) Individual tract ownerships recommended...

The Single And Multi Project Approach To Planning And Scheduling

DEFF Research Database (Denmark)

Andersson, Niclas

2008-01-01

The fragmentation of the construction industry in Denmark is reflected in the organisation of construction projects, which typically involves a large number of subcontractors. The main contractor, being responsible for the planning and scheduling of construction work, is thus faced with the chall......The fragmentation of the construction industry in Denmark is reflected in the organisation of construction projects, which typically involves a large number of subcontractors. The main contractor, being responsible for the planning and scheduling of construction work, is thus faced...

Incorporating price-responsive customers in day-ahead scheduling of smart distribution networks

International Nuclear Information System (INIS)

Mazidi, Mohammadreza; Monsef, Hassan; Siano, Pierluigi

2016-01-01

Highlights: • Proposing a model for incorporating price-responsive customers in day-ahead scheduling of smart distribution networks; this model provides a win–win situation. • Introducing a risk management model based on a bi-level information-gap decision theory and recasting it into its equivalent single-level robust optimization problem using Karush–Kuhn–Tucker optimality conditions. • Utilizing mixed-integer linear programing formulation that is efficiently solved by commercial optimization software. - Abstract: Demand response and real-time pricing of electricity are key factors in a smart grid as they can increase economic efficiency and technical performances of power grids. This paper focuses on incorporating price-responsive customers in day-ahead scheduling of smart distribution networks under a dynamic pricing environment. A novel method is proposed and formulated as a tractable mixed integer linear programming optimization problem whose objective is to find hourly sale prices offered to customers, transactions (purchase/sale) with the wholesale market, commitment of distribution generation units, dispatch of battery energy storage systems and planning of interruptible loads in a way that the profit of the distribution network operator is maximized while customers’ benefit is guaranteed. To hedge distribution network operator against financial risk arising from uncertainty of wholesale market prices, a risk management model based on a bi-level information-gap decision theory is proposed. The proposed bi-level problem is solved by recasting it into its equivalent single-level robust optimization problem using Karush–Kuhn–Tucker optimality conditions. Performance of the proposed model is verified by applying it to a modified version of the IEEE 33-bus distribution test network. Numerical results demonstrate the effectiveness and efficiency of the proposed method.

Automating Deep Space Network scheduling and conflict resolution

Science.gov (United States)

Johnston, Mark D.; Clement, Bradley

2005-01-01

The Deep Space Network (DSN) is a central part of NASA's infrastructure for communicating with active space missions, from earth orbit to beyond the solar system. We describe our recent work in modeling the complexities of user requirements, and then scheduling and resolving conflicts on that basis. We emphasize our innovative use of background 'intelligent' assistants' that carry out search asynchrnously while the user is focusing on various aspects of the schedule.

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

Directory of Open Access Journals (Sweden)

Swami Ananthram

2007-01-01

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

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

Directory of Open Access Journals (Sweden)

Ananthram Swami

2007-12-01

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

Scheduling Broadcasts in a Network of Timelines

KAUST Repository

Manzoor, Emaad A.

2015-05-12

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

Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xi Jin

2016-08-01

Full Text Available Wireless sensor networks (WSNs have been widely used in industrial systems. Their real-time performance and reliability are fundamental to industrial production. Many works have studied the two aspects, but only focus on single criticality WSNs. Mixed criticality requirements exist in many advanced applications in which different data flows have different levels of importance (or criticality. In this paper, first, we propose a scheduling algorithm, which guarantees the real-time performance and reliability requirements of data flows with different levels of criticality. The algorithm supports centralized optimization and adaptive adjustment. It is able to improve both the scheduling performance and flexibility. Then, we provide the schedulability test through rigorous theoretical analysis. We conduct extensive simulations, and the results demonstrate that the proposed scheduling algorithm and analysis significantly outperform existing ones.

Cleaning Schedule Operations in Heat Exchanger Networks

Directory of Open Access Journals (Sweden)

Huda Hairul

2018-01-01

Full Text Available Heat exchanger networks have been known to be the essential parts in the chemical industries. Unfortunately, since the performance of heat exchanger can be decreasing in transferring the heat from hot stream into cold stream due to fouling, then cleaning the heat exchanger is needed to restore its initial performance periodically. A process of heating crude oil in a refinery plant was used as a case study. As many as eleven heat exchangers were used to heat crude oil before it was heated by a furnace to the temperature required to the crude unit distillation column. The purpose of this study is to determine the cleaning schedule of heat exchanger on the heat exchanger networks due to the decrease of the overall heat transfer coefficient by various percentage of the design value. A close study on the process of heat exchanger cleaning schedule in heat exchanger networks using the method of decreasing overall heat transfer coefficient as target. The result showed that the higher the fouling value the more often the heat exchanger is cleaned because the overall heat transfer coefficient decreases quickly.

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.

Options for Parallelizing a Planning and Scheduling Algorithm

Science.gov (United States)

Clement, Bradley J.; Estlin, Tara A.; Bornstein, Benjamin D.

2011-01-01

Space missions have a growing interest in putting multi-core processors onboard spacecraft. For many missions processing power significantly slows operations. We investigate how continual planning and scheduling algorithms can exploit multi-core processing and outline different potential design decisions for a parallelized planning architecture. This organization of choices and challenges helps us with an initial design for parallelizing the CASPER planning system for a mesh multi-core processor. This work extends that presented at another workshop with some preliminary results.

An adaptive random search for short term generation scheduling with network constraints.

Directory of Open Access Journals (Sweden)

J A Marmolejo

Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

A neural network approach to job-shop scheduling.

Science.gov (United States)

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network

Directory of Open Access Journals (Sweden)

Kazuhiko Hiramoto

2018-01-01

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

Overcoming barriers to scheduling embedded generation to support distribution networks

Energy Technology Data Exchange (ETDEWEB)

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

2000-07-01

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

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

Planning and scheduling for maritime container yards supporting and facilitating the global supply network

CERN Document Server

Li, Wenkai; Goh, Mark

2015-01-01

Maximizing reader insights into the challenges facing maritime supply chains and container port logistics service providers in Asia, this book highlights their innovative responses to these challenges through real-world case studies. With a focus on mathematical modeling, simulation and heuristics approaches, this book provides academics, engineers, container terminal operators, students in logistics and supply chain management with the latest approaches that can be used to address the planning and scheduling problem in large container terminal yards. This book can be used on a self-contained basis as teaching cases in an undergraduate or specialist class setting, or on techniques applied to maritime container operations for port operations.

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

KAUST Repository

Douik, Ahmed

2016-03-28

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

Planning and scheduling for petroleum refineries using mathematical programming

Directory of Open Access Journals (Sweden)

Joly M.

2002-01-01

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

A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

KAUST Repository

Elwhishi, Ahmed

2013-05-01

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

Impacts of fuel oil substitution by natural gas in a pipeline network scheduling; Impactos da substituicao do oleo combustivel por gas natural na programacao de uma rede de dutos

Energy Technology Data Exchange (ETDEWEB)

Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Coordenacao dos Programas de Pos-Graduacao de Engenharia (COPPE/UFRJ), RJ (Brazil)

2012-07-01

In recent decades, due to the advancement and computational methods for solving optimization problems, the number of articles addressing the scheduling of products has grown. The mathematical models developed have proved useful to schedule from a single pipeline with multiple products to complex networks of multiple pipelines. Moreover, the planning of these activities is of even greater importance when considering the existence of new environmental requirements to be applied to production and marketing of petroleum products. An example of this paradigm shift is the reduction in fuel oil consumption due to increased share of natural gas in the Brazilian energy matrix. In this context, this paper proposes a mathematical model to obtain feasible solutions for problems of scheduling a network of pipelines considering replacing all or part of the demand for fuel oil to natural gas. We tested the model on three real instances of a multi commodity network consists of 4 terminals, 4 refineries and 8 unidirectional pipelines, considering a planning horizon of one week. (author)

Floyd-A∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

Directory of Open Access Journals (Sweden)

Yu Zhang

2014-01-01

Full Text Available We consider an ad hoc Floyd-A∗ algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT network. The network is bimodal (i.e., USPT lines and walking and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A∗ algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A∗-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A∗ algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, “just boarding” and “just missing” cases are identified.

Optimal Sensor Networks Scheduling in Identification of Distributed Parameter Systems

CERN Document Server

Patan, Maciej

2012-01-01

Sensor networks have recently come into prominence because they hold the potential to revolutionize a wide spectrum of both civilian and military applications. An ingenious characteristic of sensor networks is the distributed nature of data acquisition. Therefore they seem to be ideally prepared for the task of monitoring processes with spatio-temporal dynamics which constitute one of most general and important classes of systems in modelling of the real-world phenomena. It is clear that careful deployment and activation of sensor nodes are critical for collecting the most valuable information from the observed environment. Optimal Sensor Network Scheduling in Identification of Distributed Parameter Systems discusses the characteristic features of the sensor scheduling problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, especially dedicated for networks with mobile and scanning nodes. Both researchers and practitioners will find the case studies, the proposed al...

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.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

Science.gov (United States)

Yu, Chao

2013-01-01

In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

Network development plan 1995

International Nuclear Information System (INIS)

Anon.

1995-11-01

Network plan 1995 concerns several strategic problems, among others environmental policy of power transmission lines. Possibilities of restructuring aerial cable network are described. The state of the existing systems and plans for new network systems are presented. (EG)

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

Science.gov (United States)

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

2010-01-01

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

Decision Model for Planning and Scheduling of Seafood Product Considering Traceability

Science.gov (United States)

Agustin; Mawengkang, Herman; Mathelinea, Devy

2018-01-01

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

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

KAUST Repository

Rashid, Faraan

2012-07-01

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

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.

Real-time Energy Resource Scheduling considering a Real Portuguese Scenario

DEFF Research Database (Denmark)

Silva, Marco; Sousa, Tiago; Morais, Hugo

2014-01-01

The development in power systems and the introduction of decentralized gen eration and Electric Vehicles (EVs), both connected to distribution networks, represents a major challenge in the planning and operation issues. This new paradigm requires a new energy resources management approach which...... scheduling in smart grids, considering day - ahead, hour - ahead and real - time scheduling. The case study considers a 33 - bus distribution network with high penetration of distributed energy resources . The wind generation profile is base d o n a rea l Portuguese wind farm . Four scenarios are presented...... taking into account 0, 1, 2 and 5 periods (hours or minutes) ahead of the scheduling period in the hour - ahead and real - time scheduling...

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

Marketplace Plans With Narrow Physician Networks Feature Lower Monthly Premiums Than Plans With Larger Networks.

Science.gov (United States)

Polsky, Daniel; Cidav, Zuleyha; Swanson, Ashley

2016-10-01

The introduction of health insurance Marketplaces under the Affordable Care Act has been associated with growth of restricted provider networks. The value of this plan design strategy, including its association with lower premiums, is uncertain. We used data from all silver plans offered in the 2014 health insurance exchanges in the fifty states and the District of Columbia to estimate the association between the breadth of a provider network and plan premiums. We found that within a market, for plans of otherwise equivalent design and controlling for issuer-specific pricing strategy, a plan with an extra-small network had a monthly premium that was 6.7 percent less expensive than that of a plan with a large network. Because narrow networks remain an important strategy available to insurance companies to offer lower-cost plans on health insurance Marketplaces, the success of health insurance coverage expansions may be tied to the successful implementation of narrow networks. Project HOPE—The People-to-People Health Foundation, Inc.

Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

KAUST Repository

Douik, Ahmed

2015-12-01

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

Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

KAUST Repository

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

2015-01-01

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

Optimal trajectory planning and train scheduling for urban rail transit systems

CERN Document Server

Wang, Yihui; van den Boom, Ton; De Schutter, Bart

2016-01-01

This book contributes to making urban rail transport fast, punctual and energy-efficient –significant factors in the importance of public transportation systems to economic, environmental and social requirements at both municipal and national levels. It proposes new methods for shortening passenger travel times and for reducing energy consumption, addressing two major topics: (1) train trajectory planning: the authors derive a nonlinear model for the operation of trains and present several approaches for calculating optimal and energy-efficient trajectories within a given schedule; and (2) train scheduling: the authors develop a train scheduling model for urban rail systems and optimization approaches with which to balance total passenger travel time with energy efficiency and other costs to the operator. Mixed-integer linear programming and pseudospectral methods are among the new methods proposed for single- and multi-train systems for the solution of the nonlinear trajectory planning problem which involv...

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.

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

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.

Refinery production planning and scheduling: the refining core business

Directory of Open Access Journals (Sweden)

M. Joly

2012-06-01

Full Text Available Intelligent production planning and scheduling are of paramount importance to ensure refinery profitability, logistic reliability and safety at the local and corporate levels. In Brazil, such activities play a particularly critical role, since the Brazilian downstream model is moving towards a demand-driven model rather than a supply-driven one. Moreover, new and specialized non-linear constraints are continuously being incorporated into these large-scale problems: increases in oil prices implying the need for processing poor quality crudes, increasing demand and new demand patterns for petroleum products, new stringent environmental regulations related to clean fuels and start-up of new production technologies embedded into more complex refining schemes. This paper aims at clarifying the central role of refinery planning and scheduling activities in the Petrobras refining business. Major past and present results are outlined and corporate long-term strategies to deal with present and future challenges are presented.

NWTS waste package program plan. Volume I. Program strategy, description, and schedule

International Nuclear Information System (INIS)

1981-10-01

This document describes the work planned for developing the technology to design, test and produce packages used for the long-term isolation of nuclear waste in deep geologic repositories. Waste forms considered include spent fuel and high-level waste. The testing and selection effort for barrier materials for radionuclide containment is described. The NWTS waste package program is a design-driven effort; waste package conceptual designs are used as input for preliminary designs, which are upgraded to a final design as materials and testing data become available. Performance assessment models are developed and validated. Milestones and a detailed schedule are given for the waste package development effort. Program logic networks defining work flow, interfaces among the NWTS Projects, and interrelationships of specific activities are presented. Detailed work elements are provided for the Waste Package Program Plan subtasks - design and development, waste form, barrier materials, and performance evaluation - for salt and basalt, host rocks for which the state of waste package knowledge and the corresponding data base are advanced

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Science.gov (United States)

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Congestion Control and Traffic Scheduling for Collaborative Crowdsourcing in SDN Enabled Mobile Wireless Networks

Directory of Open Access Journals (Sweden)

Dawei Shen

2018-01-01

Full Text Available Currently, a number of crowdsourcing-based mobile applications have been implemented in mobile networks and Internet of Things (IoT, targeted at real-time services and recommendation. The frequent information exchanges and data transmissions in collaborative crowdsourcing are heavily injected into the current communication networks, which poses great challenges for Mobile Wireless Networks (MWN. This paper focuses on the traffic scheduling and load balancing problem in software-defined MWN and designs a hybrid routing forwarding scheme as well as a congestion control algorithm to achieve the feasible solution. The traffic scheduling algorithm first sorts the tasks in an ascending order depending on the amount of tasks and then solves it using a greedy scheme. In the proposed congestion control scheme, the traffic assignment is first transformed into a multiknapsack problem, and then the Artificial Fish Swarm Algorithm (AFSA is utilized to solve this problem. Numerical results on practical network topology reveal that, compared with the traditional schemes, the proposed congestion control and traffic scheduling schemes can achieve load balancing, reduce the probability of network congestion, and improve the network throughput.

Rolling schedule approaches for supply chain operations planning

NARCIS (Netherlands)

Spitter, J.M.

2005-01-01

Supply Chain Operations Planning (SCOP) involves the determination of an extensive production plan for a network of manufacturing and distribution entities within and across organizations. The production plan consist of order release decisions that allocate materials and resources in order to

Interface between the production plan and the master production schedule in assembly environments

OpenAIRE

Moya Navarro, Marcos; Sánchez Brenes, Magaly

2012-01-01

In a production environment there is a direct relationship between the market and the manufacturing process of goods.When production is immersed in an assembly environment, the process of production planning and scheduling becomes complex, and the enterprises have the risk of losing competitive advantages in terms of not meeting delivery dates and production high costs. Linear programming has become an appropriate tool for production planning and scheduling in complex manufacturing environmen...

Dynamic Intelligent Feedback Scheduling in Networked Control Systems

Directory of Open Access Journals (Sweden)

Hui-ying Chen

2013-01-01

Full Text Available For the networked control system with limited bandwidth and flexible workload, a dynamic intelligent feedback scheduling strategy is proposed. Firstly, a monitor is used to acquire the current available network bandwidth. Then, the new available bandwidth in the next interval is predicted by using LS_SVM approach. At the same time, the dynamic performance indices of all control loops are obtained with a two-dimensional fuzzy logic modulator. Finally, the predicted network bandwidth is dynamically allocated by the bandwidth manager and the priority allocator in terms of the loops' dynamic performance indices. Simulation results show that the sampling periods and priorities of control loops are adjusted timely according to the network workload condition and the dynamic performance of control loops, which make the system running in the optimal state all the time.

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

KAUST Repository

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

2016-01-01

results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Science.gov (United States)

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

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

Directory of Open Access Journals (Sweden)

Shuai Zhang

2016-01-01

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

Proposal of Constraints Analysis Method Based on Network Model for Task Planning

Science.gov (United States)

Tomiyama, Tomoe; Sato, Tatsuhiro; Morita, Toyohisa; Sasaki, Toshiro

Deregulation has been accelerating several activities toward reengineering business processes, such as railway through service and modal shift in logistics. Making those activities successful, business entities have to regulate new business rules or know-how (we call them ‘constraints’). According to the new constraints, they need to manage business resources such as instruments, materials, workers and so on. In this paper, we propose a constraint analysis method to define constraints for task planning of the new business processes. To visualize each constraint's influence on planning, we propose a network model which represents allocation relations between tasks and resources. The network can also represent task ordering relations and resource grouping relations. The proposed method formalizes the way of defining constraints manually as repeatedly checking the network structure and finding conflicts between constraints. Being applied to crew scheduling problems shows that the method can adequately represent and define constraints of some task planning problems with the following fundamental features, (1) specifying work pattern to some resources, (2) restricting the number of resources for some works, (3) requiring multiple resources for some works, (4) prior allocation of some resources to some works and (5) considering the workload balance between resources.

A Case Study of Line-of-Balance based Schedule Planning and Control System

OpenAIRE

Seppänen, Olli; Aalto, Erno

2005-01-01

Line-of-Balance is a graphical technique which can be used to plan and manage work flow. It is suit-able for construction projects because of their large degree of repetition. Despite its strengths Line-of-Balance has not gained widespread use in construction industry internationally. However, it has been used as the principal scheduling tool in Finland since 1980s. As a result of two decades of research and use in industry, a comprehensive schedule planning and control system has been develo...

An efficient schedule based data aggregation using node mobility for wireless sensor network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Pawar, Pranav M.; Prasad, Neeli R.

2014-01-01

In the Wireless Sensor Networks, (WSNs) a key challenge is to schedule the activities of the mobile node for improvement in throughput, energy consumption and delay. This paper proposes efficient schedule based data aggregation algorithm using node mobility (SDNM). It considers the cluster...

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.

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

Science.gov (United States)

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

A three-stage heuristic for harvest scheduling with access road network development

Science.gov (United States)

Mark M. Clark; Russell D. Meller; Timothy P. McDonald

2000-01-01

In this article we present a new model for the scheduling of forest harvesting with spatial and temporal constraints. Our approach is unique in that we incorporate access road network development into the harvest scheduling selection process. Due to the difficulty of solving the problem optimally, we develop a heuristic that consists of a solution construction stage...

An Adaptive Power Efficient Packet Scheduling Algorithm for Wimax Networks

OpenAIRE

R Murali Prasad; P. Satish Kumar

2010-01-01

Admission control schemes and scheduling algorithms are designed to offer QoS services in 802.16/802.16e networks and a number of studies have investigated these issues. But the channel condition and priority of traffic classes are very rarely considered in the existing scheduling algorithms. Although a number of energy saving mechanisms have been proposed for the IEEE 802.16e, to minimize the power consumption of IEEE 802.16e mobile stations with multiple real-time connections has not yet be...

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

KAUST Repository

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

2017-01-01

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access

DLTAP: A Network-efficient Scheduling Method for Distributed Deep Learning Workload in Containerized Cluster Environment

Directory of Open Access Journals (Sweden)

Qiao Wei

2017-01-01

Full Text Available Deep neural networks (DNNs have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling data-parallel computation jobs like DNN over containerized clusters is critical for job performance, system throughput, and resource utilization. It becomes even more challenging with the complex workloads. We propose a scheduling method called Deep Learning Task Allocation Priority (DLTAP which performs scheduling decisions in a distributed manner, and each of scheduling decisions takes aggregation degree of parameter sever task and worker task into account, in particularly, to reduce cross-node network transmission traffic and, correspondingly, decrease the DNN training time. We evaluate the DLTAP scheduling method using a state-of-the-art distributed DNN training framework on 3 benchmarks. The results show that the proposed method can averagely reduce 12% cross-node network traffic, and decrease the DNN training time even with the cluster of low-end servers.

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.

Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Ahmed Mohamed H

2006-01-01

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

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

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Zhidong Deng

2009-10-01

Full Text Available Energy constraints restrict the lifetime of wireless sensor networks (WSNs with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes’ energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs.

Genetic algorithm and neural network hybrid approach for job-shop scheduling

OpenAIRE

Zhao, Kai; Yang, Shengxiang; Wang, Dingwei

1998-01-01

Copyright @ 1998 ACTA Press This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach for job-shop scheduling with respect to the quality of solutions and ...

ECS: Efficient Communication Scheduling for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Lu Hong

2011-03-01

Full Text Available TDMA protocols have attracted a lot of attention for underwater acoustic sensor networks (UWSNs, because of the unique characteristics of acoustic signal propagation such as great energy consumption in transmission, long propagation delay and long communication range. Previous TDMA protocols all allocated transmission time to nodes based on discrete time slots. This paper proposes an efficient continuous time scheduling TDMA protocol (ECS for UWSNs, including the continuous time based and sender oriented conflict analysis model, the transmission moment allocation algorithm and the distributed topology maintenance algorithm. Simulation results confirm that ECS improves network throughput by 20% on average, compared to existing MAC protocols.

Planning Risk-Based SQC Schedules for Bracketed Operation of Continuous Production Analyzers.

Science.gov (United States)

Westgard, James O; Bayat, Hassan; Westgard, Sten A

2018-02-01

To minimize patient risk, "bracketed" statistical quality control (SQC) is recommended in the new CLSI guidelines for SQC (C24-Ed4). Bracketed SQC requires that a QC event both precedes and follows (brackets) a group of patient samples. In optimizing a QC schedule, the frequency of QC or run size becomes an important planning consideration to maintain quality and also facilitate responsive reporting of results from continuous operation of high production analytic systems. Different plans for optimizing a bracketed SQC schedule were investigated on the basis of Parvin's model for patient risk and CLSI C24-Ed4's recommendations for establishing QC schedules. A Sigma-metric run size nomogram was used to evaluate different QC schedules for processes of different sigma performance. For high Sigma performance, an effective SQC approach is to employ a multistage QC procedure utilizing a "startup" design at the beginning of production and a "monitor" design periodically throughout production. Example QC schedules are illustrated for applications with measurement procedures having 6-σ, 5-σ, and 4-σ performance. Continuous production analyzers that demonstrate high σ performance can be effectively controlled with multistage SQC designs that employ a startup QC event followed by periodic monitoring or bracketing QC events. Such designs can be optimized to minimize the risk of harm to patients. © 2017 American Association for Clinical Chemistry.

Telecommunications Network Plan

International Nuclear Information System (INIS)

1989-05-01

The Office of Civilian Radioactive Waste Management (OCRWM) must, among other things, be equipped to readily produce, file, store, access, retrieve, and transfer a wide variety of technical and institutional data and information. The data and information regularly produced by members of the OCRWM Program supports, and will continue to support, a wide range of program activities. Some of the more important of these information communication-related activities include: supporting the preparation, submittal, and review of a license application to the Nuclear Regulatory Commission (NRC) to authorize the construction of a geologic repository; responding to requests for information from parties affected by and/or interested in the program; and providing evidence of compliance with all relevant Federal, State, local, and Indian Tribe regulations, statutes, and/or treaties. The OCRWM Telecommunications Network Plan (TNP) is intended to identify, as well as to present the current strategy for satisfying, the telecommunications requirements of the civilian radioactive waste management program. The TNP will set forth the plan for integrating OCRWM's information resources among major program sites. Specifically, this plan will introduce a telecommunications network designed to establish communication linkages across the program's Washington, DC; Chicago, Illinois; and Las Vegas, Nevada, sites. The linkages across these and associated sites will comprise Phase I of the proposed OCRWM telecommunications network. The second phase will focus on the modification and expansion of the Phase I network to fully accommodate access to the OCRWM Licensing Support System (LSS). The primary components of the proposed OCRWM telecommunications network include local area networks; extended local area networks; and remote extended (wide) area networks. 10 refs., 6 figs

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.

Power Saving Scheduling Scheme for Internet of Things over LTE/LTE-Advanced Networks

Directory of Open Access Journals (Sweden)

Yen-Wei Kuo

2015-01-01

Full Text Available The devices of Internet of Things (IoT will grow rapidly in the near future, and the power consumption and radio spectrum management will become the most critical issues in the IoT networks. Long Term Evolution (LTE technology will become a promising technology used in IoT networks due to its flat architecture, all-IP network, and greater spectrum efficiency. The 3rd Generation Partnership Project (3GPP specified the Discontinuous Reception (DRX to reduce device’s power consumption. However, the DRX may pose unexpected communication delay due to missing Physical Downlink Control Channel (PDCCH information in sleep mode. Recent studies mainly focus on optimizing DRX parameters to manage the tradeoff between the energy consumption and communication latency. In this paper, we proposed a fuzzy-based power saving scheduling scheme for IoT over the LTE/LTE-Advanced networks to deal with the issues of the radio resource management and power consumption from the scheduling and resource allocation perspective. The proposed scheme considers not only individual IoT device’s real-time requirement but also the overall network performance. The simulation results show that our proposed scheme can meet the requirements of the DRX cycle and scheduling latency and can save about half of energy consumption for IoT devices compared to conventional approaches.

Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks

NARCIS (Netherlands)

Durmaz, O.; Ghosh, A.; Krishnamachari, B.; Chintalapudi, K.

We explore the following fundamental question - how fast can information be collected from a wireless sensor network? We consider a number of design parameters such as, power control, time and frequency scheduling, and routing. There are essentially two factors that hinder efficient data collection

Controller Area Network (CAN) schedulability analysis : refuted, revisited and revised

NARCIS (Netherlands)

Davis, R.I.; Burns, A.; Bril, R.J.; Lukkien, J.J.

2007-01-01

Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 schedulability analysis was developed for CAN, showing how worst-case response times of CAN messages could be calculated and hence

Telecommunications network modelling, planning and design

CERN Document Server

Evans, Sharon

2003-01-01

Telecommunication Network Modelling, Planning and Design addresses sophisticated modelling techniques from the perspective of the communications industry and covers some of the major issues facing telecommunications network engineers and managers today. Topics covered include network planning for transmission systems, modelling of SDH transport network structures and telecommunications network design and performance modelling, as well as network costs and ROI modelling and QoS in 3G networks.

The Third Competition on Knowledge Engineering for Planning and Scheduling

OpenAIRE

Bartak, Roman; Fratini, Simone; McCluskey, Lee

2010-01-01

We report on the staging of the third competition on knowledge engineering for AI planning and scheduling systems, held during ICAPS-09 at Thessaloniki, Greece in September 2009. We give an overview of how the competition has developed since its first run in 2005, and its relationship with the AI planning field. This run of the competition focused on translators that when input with some formal description in an application-area-specific language, output solver-ready domain models. Despite a ...

Energy-aware scheduling of surveillance in wireless multimedia sensor networks.

Science.gov (United States)

Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao

2010-01-01

Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.

Planning and scheduling algorithms for the COSMO-SkyMed constellation

NARCIS (Netherlands)

Bianchessi, Nicola; Righini, Giovanni

2008-01-01

The COSMO-SkyMed satellite constellation for the observation of the Earth is made of four satellites equipped with radar instruments and is intended for dual use, i.e. for security as well as for environmental monitoring purpose. The planning and scheduling problem for the COSMO-SkyMed constellation

GCF: Green Conflict Free TDMA Scheduling for Wireless Sensor Network

DEFF Research Database (Denmark)

Pawar, Pranav M.; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

2012-01-01

The last few years have seen the promising growth in the application of wireless sensor networks (WSNs). The contribution of this paper is on a cluster-based time division multiple access (TDMA) scheduling algorithm to improve the performance of WSN applications in terms of energy efficiency, delay...

Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints

Directory of Open Access Journals (Sweden)

Wangtu Xu

2012-01-01

Full Text Available This paper proposes a stochastic user equilibrium (SUE assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: (1 ride time, which is composed of in-vehicle and waiting times, (2 overload delay, (3 fare, (4 transfer constraints, and (5 departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model.

AN OVERVIEW OF THE ADVANCED PLANNING AND SCHEDULING SYSTEMS

Directory of Open Access Journals (Sweden)

Thales Botelho de Sousa

2014-12-01

Full Text Available Currently, the activities of the planning and control of companies are becoming increasingly complex and the managers of this area are constantly pressured to reduce operating costs, maintain inventories at adequate levels, to fully meet the demand of customers, and to respond effectively to changes that occur. The planning and scheduling task is important for most companies, so according to some authors, there is a need for further analysis of the practical use of production planning and control systems. Within the context of production planning and control systems development, in the 1990s were launched the APS systems, which represent an innovation when compared to their predecessors. This paper intended to provide through a literature review, the concepts, structure, capabilities, implementation process and benefits of using APS systems in the companies production planning and control. The main contribution of this research is to show a strong conceptual understanding regarding APS systems, which can be used as a solid theoretical reference for future researches.

Quantized Synchronization of Chaotic Neural Networks With Scheduled Output Feedback Control.

Science.gov (United States)

Wan, Ying; Cao, Jinde; Wen, Guanghui

In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control

Tourism-planning network knowledge dynamics

DEFF Research Database (Denmark)

Dredge, Dianne

2014-01-01

This chapter explores the characteristics and functions of tourism networks as a first step in understanding how networks facilitate and reproduce knowledge. A framework to progress understandings of knowledge dynamics in tourism networks is presented that includes four key dimensions: context......, network agents, network boundaries and network resources. A case study of the development of the Next Generation Tourism Handbook (Queensland, Australia), a policy initiative that sought to bring tourism and land use planning knowledge closer together is presented. The case study illustrates...... that the tourism policy and land use planning networks operate in very different spheres and that context, network agents, network boundaries and network resources have a significant influence not only on knowledge dynamics but also on the capacity of network agents to overcome barriers to learning and to innovate....

Integrating planning and scheduling in an oil refinery with a rolling horizon approach

NARCIS (Netherlands)

Zondervan, E.; Kaland, M.; van Elzakker, M.A.H.; Fransoo, J.C.; Meuldijk, J.; Klemes, J.J.; Varbanov, P.S.; Liew, P.Y.

2014-01-01

Decisions in an oil refinery are made at three levels: planning, scheduling and control. Existing facilities have to be operated close to their maximum capacity, while continuously responding to cost fluctuations. In many of the currently reported planning models each decision level has its own

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

2008-01-01

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

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

Directory of Open Access Journals (Sweden)

Muhammad Farhan Ausaf

2015-12-01

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

Automatic Scheduling and Planning (ASAP) in future ground control systems

Science.gov (United States)

Matlin, Sam

1988-01-01

This report describes two complementary approaches to the problem of space mission planning and scheduling. The first is an Expert System or Knowledge-Based System for automatically resolving most of the activity conflicts in a candidate plan. The second is an Interactive Graphics Decision Aid to assist the operator in manually resolving the residual conflicts which are beyond the scope of the Expert System. The two system designs are consistent with future ground control station activity requirements, support activity timing constraints, resource limits and activity priority guidelines.

Using an ontology for network attack planning

CSIR Research Space (South Africa)

Van Heerden, R

2016-09-01

Full Text Available The modern complexity of network attacks and their counter-measures (cyber operations) requires detailed planning. This paper presents a Network Attack Planning ontology which is aimed at providing support for planning such network operations within...

Multilayer Network Planning - A Practical Perspective

OpenAIRE

Autenrieth, Achim

2018-01-01

The paper presents a pragmatic and practical multilayer network planning approach based on a candidate lightpath auxiliary graph model. The paper discusses, how this approach can be applied to offline network planning as well as dynamic planning and provisioning of services.

Excellence through outage planning and scheduling

International Nuclear Information System (INIS)

Ferriole, G.

1987-01-01

The Nuclear and Fossil Generation Division of Electricite de France (EdF) has been the largest nuclear plant operating utility in France since 1984. The size of the units, their standardization, and extensive operating experience were favorable parameters leading to the development of a very complete maintenance organization. Electricite de France believes in the importance of well-defined maintenance concepts. These maintenance concepts contribute to outage performance by requiring a careful consideration of work to be done and by defining the techniques and means of accomplishing this work. In addition to maintenance concepts and careful planning and scheduling, good outage management is achieved through the motivation and dedication of the people involved. It is the key to good operational results

A Systematic, Automated Network Planning Method

DEFF Research Database (Denmark)

Holm, Jens Åge; Pedersen, Jens Myrup

2006-01-01

This paper describes a case study conducted to evaluate the viability of a systematic, automated network planning method. The motivation for developing the network planning method was that many data networks are planned in an adhoc manner with no assurance of quality of the solution with respect...... structures, that are ready to implement in a real world scenario, are discussed in the end of the paper. These are in the area of ensuring line independence and complexity of the design rules for the planning method....

Planning of Distribution Networks in Baghdad City

Directory of Open Access Journals (Sweden)

Thamir M. Abdul-Wahhab

2015-02-01

Full Text Available Planning of electrical distribution networks is considered of highest priority at the present time in Iraq, due to the huge increase in electrical demand and expansions imposed on distribution networks as a result of the great and rapid urban development. Distribution system planning simulates and studies the behavior of electrical distribution networks under different operating conditions. The study provide understanding of the existing system and to prepare a short term development plan or a long term plan used to guide system expansion and future investments needed for improved network performance. The objective of this research is the planning of Al_Bayaa 11 kV distribution network in Baghdad city based on the powerful and efficient CYMDist software as a tool for the simulation and analysis of the network. The planning method proposed in this thesis is to reach the optimum operating conditions of the network by combining the network reconfiguration in sequence with the insertion of capacitors with optimal sizing and locations. The optimum performance of the network is achieved by reducing losses, improving voltage profile and alleviating overload for transformers and cables.

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

Science.gov (United States)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

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

Optimizing Intermodal Train Schedules with a Design Balanced Network Design Model

DEFF Research Database (Denmark)

Pedersen, Michael Berliner; Crainic, Teodor Gabriel

We present a modeling approach for optimizing intermodal trains schedules based on an infrastructure divided into time-dependent train paths. The formulation can be generalized to a capacitated multi commodity network design model with additional design balance constraints. We present a Tabu Search...

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

NARCIS (Netherlands)

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

2014-01-01

We consider the problem of data estimation in a sensor wireless network where sensors transmit their observations according to decentralized and centralized transmission schedules. A data collector is interested in achieving a data estimation using several sensor observations such that the variance

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

NARCIS (Netherlands)

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

2013-01-01

We consider the problem of data estimation in a sensor wireless network where sensors transmit their observations according to decentralized and centralized transmission schedules. A data collector is interested in achieving a data estimation using several sensor observations such that the variance

Dynamic and stochastic multi-project planning

CERN Document Server

Melchiors, Philipp

2015-01-01

This book deals with dynamic and stochastic methods for multi-project planning. Based on the idea of using queueing networks for the analysis of dynamic-stochastic multi-project environments this book addresses two problems: detailed scheduling of project activities, and integrated order acceptance and capacity planning. In an extensive simulation study, the book thoroughly investigates existing scheduling policies. To obtain optimal and near optimal scheduling policies new models and algorithms are proposed based on the theory of Markov decision processes and Approximate Dynamic programming.

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

International Nuclear Information System (INIS)

Vo Ngoc Dieu; Ongsakul, Weerakorn

2009-01-01

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

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.

Intersection planning in Safer Transportation Network Planning : safety principles, planning framework, and library information.

NARCIS (Netherlands)

Hummel, T.

2001-01-01

This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

15 CFR 714.3 - Advance declaration requirements for additionally planned production of Schedule 3 chemicals.

Science.gov (United States)

2010-01-01

... COMMERCE CHEMICAL WEAPONS CONVENTION REGULATIONS ACTIVITIES INVOLVING SCHEDULE 3 CHEMICALS § 714.3 Advance... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Advance declaration requirements for additionally planned production of Schedule 3 chemicals. 714.3 Section 714.3 Commerce and Foreign Trade...

Artificial intelligence for the CTA Observatory scheduler

Science.gov (United States)

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

2014-08-01

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

Simulation of textile manufacturing processes for planning, scheduling, and quality control purposes

Science.gov (United States)

Cropper, A. E.; Wang, Z.

1995-08-01

Simulation, as a management information tool, has been applied to engineering manufacture and assembly operations. The application of the principles to textile manufacturing (fiber to fabric) is discussed. The particular problems and solutions in applying the simulation software package to the yarn production processes are discussed with an indication of how the software achieves the production schedule. The system appears to have application in planning, scheduling, and quality assurance. The latter being a result of the traceability possibilities through a process involving mixing and splitting of material.

QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

Science.gov (United States)

Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

2016-02-01

As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

OpenAIRE

Madani Sajjad; Nazir Babar; Hasbullah Halabi

2011-01-01

Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a) the distance of the node from the sink node, (b) the importance of the node's location from connectivity's perspective, and...

Dynamic Sleep Scheduling on Air Pollution Levels Monitoring with Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Gezaq Abror

2018-01-01

Full Text Available Wireless Sensor Network (WSN can be applied for Air Pollution Level Monitoring System that have been determined by the Environmental Impact Management Agency which is  PM10, SO2, O3, NO2 and CO. In WSN, node system is constrained to a limited power supply, so that the node system has a lifetime. To doing lifetime maximization, power management scheme is required and sensor nodes should use energy efficiently. This paper proposes dynamic sleep scheduling using Time Category-Fuzzy Logic (Time-Fuzzy Scheduling as a reference for calculating time interval for sleep and activated node system to support power management scheme. This research contributed in power management design to be applied to the WSN system to reduce energy expenditure. From the test result in real hardware node system, it can be seen that Time-Fuzzy Scheduling is better in terms of using the battery and it is better in terms of energy consumption too because it is more efficient 51.85% when it is compared with Fuzzy Scheduling, it is more efficient 68.81% when it is compared with Standard Scheduling and it is more efficient 85.03% when compared with No Scheduling.

Virtualized Network Control (VNC)

Energy Technology Data Exchange (ETDEWEB)

Lehman, Thomas [Univ. of Southern California, Los Angeles, CA (United States); Guok, Chin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Ghani, Nasir [Univ. of New Mexico, Albuquerque, NM (United States)

2013-01-31

The focus of this project was on the development of a "Network Service Plane" as an abstraction model for the control and provisioning of multi-layer networks. The primary motivation for this work were the requirements of next generation networked applications which will need to access advanced networking as a first class resource at the same level as compute and storage resources. A new class of "Intelligent Network Services" were defined in order to facilitate the integration of advanced network services into application specific workflows. This new class of network services are intended to enable real-time interaction between the application co-scheduling algorithms and the network for the purposes of workflow planning, real-time resource availability identification, scheduling, and provisioning actions.

An MILP approach to shelf life integrated planning and scheduling in scalded sausage production

DEFF Research Database (Denmark)

Günther, H.O.; van Beek, P.; Grunow, Martin

2006-01-01

in which shelf life aspects are integrated into operational production planning and scheduling functions. Specifically we make use of so-called Mixed Integer Linear Programming (MILP) models. Our research is based on an industrial case study of yogurt production. Relying on the principle of block planning...

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

Science.gov (United States)

Webb, W. A.

1978-01-01

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

Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

Science.gov (United States)

Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu

2015-12-01

For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

Land use planning in Safer Transportation Network Planning : safety principles, planning framework, and library information.

NARCIS (Netherlands)

Hummel, T.

2001-01-01

This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

Secret Shoppers Find Access To Providers And Network Accuracy Lacking For Those In Marketplace And Commercial Plans.

Science.gov (United States)

Haeder, Simon F; Weimer, David L; Mukamel, Dana B

2016-07-01

The adequacy of provider networks for plans sold through insurance Marketplaces established under the Affordable Care Act has received much scrutiny recently. Various studies have established that networks are generally narrow. To learn more about network adequacy and access to care, we investigated two questions. First, no matter the nominal size of a network, can patients gain access to primary care services from providers of their choice in a timely manner? Second, how does access compare to plans sold outside insurance Marketplaces? We conducted a "secret shopper" survey of 743 primary care providers from five of California's nineteen insurance Marketplace pricing regions in the summer of 2015. Our findings indicate that obtaining access to primary care providers was generally equally challenging both inside and outside insurance Marketplaces. In less than 30 percent of cases were consumers able to schedule an appointment with an initially selected physician provider. Information about provider networks was often inaccurate. Problems accessing services for patients with acute conditions were particularly troubling. Effectively addressing issues of network adequacy requires more accurate provider information. Project HOPE—The People-to-People Health Foundation, Inc.

Understanding Applications of Project Planning and Scheduling in Construction Projects

OpenAIRE

AlNasseri, Hammad Abdullah

2015-01-01

Construction project life-cycle processes must be managed in a more effective and predictable way to meet project stakeholders’ needs. However, there is increasing concern about whether know-how effectively improves understanding of underlying theories of project management processes for construction organizations and their project managers. Project planning and scheduling are considered as key and challenging tools in controlling and monitoring project performance, but many worldwide constru...

Multi-User Preemptive Scheduling For Critical Low Latency Communications in 5G Networks

DEFF Research Database (Denmark)

Abdul-Mawgood Ali Ali Esswie, Ali; Pedersen, Klaus

2018-01-01

5G new radio is envisioned to support three major service classes: enhanced mobile broadband (eMBB), ultrareliable low-latency communications (URLLC), and massive machine type communications. Emerging URLLC services require up to one millisecond of communication latency with 99.999% success...... probability. Though, there is a fundamental trade-off between system spectral efficiency (SE) and achievable latency. This calls for novel scheduling protocols which cross-optimize system performance on user-centric; instead of network-centric basis. In this paper, we develop a joint multi-user preemptive...... scheduling strategy to simultaneously cross-optimize system SE and URLLC latency. At each scheduling opportunity, available URLLC traffic is always given higher priority. When sporadic URLLC traffic appears during a transmission time interval (TTI), proposed scheduler seeks for fitting the URLLC-eMBB traffic...

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

Science.gov (United States)

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

Science.gov (United States)

Schumacher, André; Haanpää, Harri

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

Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling

Directory of Open Access Journals (Sweden)

Tomáš Macák

2016-01-01

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

Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network

Directory of Open Access Journals (Sweden)

Xiangming Yao

2017-01-01

Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.

New preemptive scheduling for OBS networks considering cascaded wavelength conversion

Science.gov (United States)

Gao, Xingbo; Bassiouni, Mostafa A.; Li, Guifang

2009-05-01

In this paper we introduce a new preemptive scheduling technique for next generation optical burst-switched networks considering the impact of cascaded wavelength conversions. It has been shown that when optical bursts are transmitted all optically from source to destination, each wavelength conversion performed along the lightpath may cause certain signal-to-noise deterioration. If the distortion of the signal quality becomes significant enough, the receiver would not be able to recover the original data. Accordingly, subject to this practical impediment, we improve a recently proposed fair channel scheduling algorithm to deal with the fairness problem and aim at burst loss reduction simultaneously in optical burst switching. In our scheme, the dynamic priority associated with each burst is based on a constraint threshold and the number of already conducted wavelength conversions among other factors for this burst. When contention occurs, a new arriving superior burst may preempt another scheduled one according to their priorities. Extensive simulation results have shown that the proposed scheme further improves fairness and achieves burst loss reduction as well.

TRADING-OFF CONSTRAINTS IN THE PUMP SCHEDULING OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Directory of Open Access Journals (Sweden)

Gencer Genço\\u011Flu

2016-01-01

Full Text Available Pumps are one of the essential components of water supply systems. Depending of the topography, a water supply system may completely rely on pumping. They may consume non-negligible amount of water authorities' budgets during operation. Besides their energy costs, maintaining the healthiness of pumping systems is another concern for authorities. This study represents a multi-objective optimization method for pump scheduling problem. The optimization objective contains hydraulic and operational constraints. Switching of pumps and usage of electricity tariff are assumed to be key factors for operational reliability and energy consumption and costs of pumping systems. The local optimals for systems operational reliability, energy consumptions and energy costs are investigated resulting from trading-off pump switch and electricity tariff constraints within given set of boundary conditions. In the study, a custom made program is employed that combines genetic algorithm based optimization module with hydraulic network simulation software -EPANET. Developed method is applied on the case study network; N8-3 pressure zone of the Northern Supply of Ankara (Turkey Water Distribution Network. This work offers an efficient method for water authorities aiming to optimize pumping schedules considering expenditures and operational reliability mutually.

Planning Multitechnology Access Networks with Performance Constraints

Science.gov (United States)

Chamberland, Steven

Considering the number of access network technologies and the investment needed for the “last mile” of a solution, in today’s highly competitive markets, planning tools are crucial for the service providers to optimize the network costs and accelerate the planning process. In this paper, we propose to tackle the problem of planning access networks composed of four technologies/architectures: the digital subscriber line (xDSL) technologies deployed directly from the central office (CO), the fiber-to-the-node (FTTN), the fiber-to-the-micro-node (FTTn) and the fiber-to-the-premises (FTTP). A mathematical programming model is proposed for this planning problem that is solved using a commercial implementation of the branch-and-bound algorithm. Next, a detailed access network planning example is presented followed by a systematic set of experiments designed to assess the performance of the proposed approach.

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.

Outage scheduling and implementation

International Nuclear Information System (INIS)

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

1986-01-01

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

A Planning Guide for Instructional Networks, Part I.

Science.gov (United States)

Daly, Kevin F.

1994-01-01

Discusses three phases in implementing a master plan for a school-based local area network (LAN): (1) network software selection; (2) hardware selection, network topology, and site preparation; and (3) implementation time table. Sample planning and specification worksheets and a list of planning guides are included. (Contains six references.) (KRN)

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2010-08-01

Full Text Available Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

Secure Autonomous Automated Scheduling (SAAS). Rev. 1.1

Science.gov (United States)

Walke, Jon G.; Dikeman, Larry; Sage, Stephen P.; Miller, Eric M.

2010-01-01

This report describes network-centric operations, where a virtual mission operations center autonomously receives sensor triggers, and schedules space and ground assets using Internet-based technologies and service-oriented architectures. For proof-of-concept purposes, sensor triggers are received from the United States Geological Survey (USGS) to determine targets for space-based sensors. The Surrey Satellite Technology Limited (SSTL) Disaster Monitoring Constellation satellite, the UK-DMC, is used as the space-based sensor. The UK-DMC's availability is determined via machine-to-machine communications using SSTL's mission planning system. Access to/from the UK-DMC for tasking and sensor data is via SSTL's and Universal Space Network's (USN) ground assets. The availability and scheduling of USN's assets can also be performed autonomously via machine-to-machine communications. All communication, both on the ground and between ground and space, uses open Internet standards

A probabilistic computational framework for bridge network optimal maintenance scheduling

International Nuclear Information System (INIS)

Bocchini, Paolo; Frangopol, Dan M.

2011-01-01

This paper presents a probabilistic computational framework for the Pareto optimization of the preventive maintenance applications to bridges of a highway transportation network. The bridge characteristics are represented by their uncertain reliability index profiles. The in/out of service states of the bridges are simulated taking into account their correlation structure. Multi-objective Genetic Algorithms have been chosen as numerical tool for the solution of the optimization problem. The design variables of the optimization are the preventive maintenance schedules of all the bridges of the network. The two conflicting objectives are the minimization of the total present maintenance cost and the maximization of the network performance indicator. The final result is the Pareto front of optimal solutions among which the managers should chose, depending on engineering and economical factors. A numerical example illustrates the application of the proposed approach.

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.

Detailed leak detection test plan and schedule for Oak Ridge National Laboratory liquid low-level waste active tanks

International Nuclear Information System (INIS)

1995-01-01

This document provides a plan and schedule for leak testing a portion of the Liquid Low-Level Waste (LLLW) system at the Oak Ridge National Laboratory (ORNL), Oak Ridge, Tennessee. It is a concise version of a more general leak testing plan that was prepared in response to the requirements of the Federal Facility Agreement (FFA) for the Oak Ridge Reservation (ORR). This plan includes a schedule for the initial reporting of the leak test results from the various tanks that will be tested. The FFA distinguishes four categories of tank and pipeline systems: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems; there are 14 such tanks addressed in this plan, plus one tank (W-12) that has been temporarily returned to service based on EPA and TDEC concurrence. A schedule for testing these tanks is also included. The plan and schedule also addresses an additional 15 Category B tanks have been demonstrated to meet secondary containment requirements. While these 15 tanks are addressed in this plan for the sake of completeness, they have been removed from the leak testing program based on the design demonstrations that show secondary containment. It is noted that the general plan included 42 tanks. Since that report was issued, 26 of those tanks have passed secondary containment design demonstrations and subsequently have been removed from this leak testing plan. In addition, one tank (LA-104) has been removed from service. Accordingly, this document addresses 15 of the LLLW tanks in the system; plans for testing the pipelines will be described in a separate document

Detailed leak detection test plan and schedule for Oak Ridge National Laboratory liquid low-level waste active tanks

Energy Technology Data Exchange (ETDEWEB)

NONE

1995-01-01

This document provides a plan and schedule for leak testing a portion of the Liquid Low-Level Waste (LLLW) system at the Oak Ridge National Laboratory (ORNL), Oak Ridge, Tennessee. It is a concise version of a more general leak testing plan that was prepared in response to the requirements of the Federal Facility Agreement (FFA) for the Oak Ridge Reservation (ORR). This plan includes a schedule for the initial reporting of the leak test results from the various tanks that will be tested. The FFA distinguishes four categories of tank and pipeline systems: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems; there are 14 such tanks addressed in this plan, plus one tank (W-12) that has been temporarily returned to service based on EPA and TDEC concurrence. A schedule for testing these tanks is also included. The plan and schedule also addresses an additional 15 Category B tanks have been demonstrated to meet secondary containment requirements. While these 15 tanks are addressed in this plan for the sake of completeness, they have been removed from the leak testing program based on the design demonstrations that show secondary containment. It is noted that the general plan included 42 tanks. Since that report was issued, 26 of those tanks have passed secondary containment design demonstrations and subsequently have been removed from this leak testing plan. In addition, one tank (LA-104) has been removed from service. Accordingly, this document addresses 15 of the LLLW tanks in the system; plans for testing the pipelines will be described in a separate document.

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

Directory of Open Access Journals (Sweden)

Huiling Fu

2012-01-01

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

Multiresolution Network Temporal and Spatial Scheduling Model of Scenic Spot

Directory of Open Access Journals (Sweden)

Peng Ge

2013-01-01

Full Text Available Tourism is one of pillar industries of the world economy. Low-carbon tourism will be the mainstream direction of the scenic spots' development, and the ω path of low-carbon tourism development is to develop economy and protect environment simultaneously. However, as the tourists' quantity is increasing, the loads of scenic spots are out of control. And the instantaneous overload in some spots caused the image phenomenon of full capacity of the whole scenic spot. Therefore, realizing the real-time schedule becomes the primary purpose of scenic spot’s management. This paper divides the tourism distribution system into several logically related subsystems and constructs a temporal and spatial multiresolution network scheduling model according to the regularity of scenic spots’ overload phenomenon in time and space. It also defines dynamic distribution probability and equivalent dynamic demand to realize the real-time prediction. We define gravitational function between fields and takes it as the utility of schedule, after resolving the transportation model of each resolution, it achieves hierarchical balance between demand and capacity of the system. The last part of the paper analyzes the time complexity of constructing a multiresolution distribution system.

An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Thien T. T. Le

2016-12-01

Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

Collaborative Optimization of Stop Schedule Plan and Ticket Allotment for the Intercity Train

Directory of Open Access Journals (Sweden)

Xichun Chen

2016-01-01

Full Text Available As regards the ticket allotment issue of the intercity passenger corridor designed for different train grades, the matching relationship between the ticket allotment and the passenger flow demand is studied. The passenger flow conversion equation which is based on the collaborative optimization of the intercity train stop schedule plan and ticket allotment is established. Then the mathematical model aiming at the maximum revenue of intercity train system and the highest satisfaction from the passengers is established. The particle swarm harmony search algorithm is designed to solve the model. The example verifies the effectiveness of the model and algorithm, which indicates that, through the collaborative optimization of the stop schedule plan and ticket allotment for different grades intercity trains, the sectional utilization rate of the train can be improved; meanwhile, the optimum matching between the intercity train revenue and the passenger satisfaction can be realized.

Comparison of Different Approaches to the Cutting Plan Scheduling

Directory of Open Access Journals (Sweden)

Peter Bober

2011-10-01

Full Text Available Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial optimization problem. In this respect, various approaches and methods are used to arrive to a viable solution. The paper reports three approaches represented by three discreet optimization methods. The first one is back-tracing algorithm and serves as a reference to verify functionality of the other two ones. The second method is optimization using genetic algorithms, and the third one presents heuristic approach to optimization based on anticipated properties of an optimal solution. Research results indicate that genetic algorithms are demanding to calculate though not dependant on the selected objective function. Heuristic algorithm is fast but dependant upon anticipated properties of the optimal solution. Hence, at change of the objective function it has to be changed. When the scheduling by genetic algorithms is solvable in a sufficiently short period of time, it is more appropriate from the practical point than the heuristic algorithm. The back-tracing algorithm usually does not provide a result in a feasible period of time.

Improvement to Airport Throughput Using Intelligent Arrival Scheduling and an Expanded Planning Horizon

Science.gov (United States)

Glaab, Patricia C.

2012-01-01

The first phase of this study investigated the amount of time a flight can be delayed or expedited within the Terminal Airspace using only speed changes. The Arrival Capacity Calculator analysis tool was used to predict the time adjustment envelope for standard descent arrivals and then for CDA arrivals. Results ranged from 0.77 to 5.38 minutes. STAR routes were configured for the ACES simulation, and a validation of the ACC results was conducted comparing the maximum predicted time adjustments to those seen in ACES. The final phase investigated full runway-to-runway trajectories using ACES. The radial distance used by the arrival scheduler was incrementally increased from 50 to 150 nautical miles (nmi). The increased Planning Horizon radii allowed the arrival scheduler to arrange, path stretch, and speed-adjust flights to more fully load the arrival stream. The average throughput for the high volume portion of the day increased from 30 aircraft per runway for the 50 nmi radius to 40 aircraft per runway for the 150 nmi radius for a traffic set representative of high volume 2018. The recommended radius for the arrival scheduler s Planning Horizon was found to be 130 nmi, which allowed more than 95% loading of the arrival stream.

NWTS waste package program plan. Volume II. Program logic networks

International Nuclear Information System (INIS)

1981-10-01

This document describes the work planned for developing the technology to design, test and produce packages used for the long-term isolation of nuclear waste in deep geologic repositories. Waste forms considered include spent fuel and high-level waste. The testing and selection effort for barrier materials for radionuclide containment is described. The NWTS waste package program is a design-driven effort; waste package conceptual designs are used as input for preliminary designs, which are upgraded to a final design as materials and testing data become available. Performance assessment models are developed and validated. Milestones and a detailed schedule are given for the waste package development effort. Program logic networks defining work flow, interfaces among the NWTS Projects, and interrelationships of specific activities are presented. Detailed work elements are provided for the Waste Package Program Plan subtasks - design and development, waste form, barrier materials, and performance evaluation - for salt and basalt, host rocks for which the state of waste package knowledge and the corresponding data base are advanced

The operational flight and multi-crew scheduling problem

Directory of Open Access Journals (Sweden)

Stojković Mirela

2005-01-01

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

The development of stochastic process modeling through risk analysis derived from scheduling of NPP project

International Nuclear Information System (INIS)

Lee, Kwang Ho; Roh, Myung Sub

2013-01-01

There are so many different factors to consider when constructing a nuclear power plant successfully from planning to decommissioning. According to PMBOK, all projects have nine domains from a holistic project management perspective. They are equally important to all projects, however, this study focuses mostly on the processes required to manage timely completion of the project and conduct risk management. The overall objective of this study is to let you know what the risk analysis derived from scheduling of NPP project is, and understand how to implement the stochastic process modeling through risk management. Building the Nuclear Power Plant is required a great deal of time and fundamental knowledge related to all engineering. That means that integrated project scheduling management with so many activities is necessary and very important. Simulation techniques for scheduling of NPP project using Open Plan program, Crystal Ball program, and Minitab program can be useful tools for designing optimal schedule planning. Thus far, Open Plan and Monte Carlo programs have been used to calculate the critical path for scheduling network analysis. And also, Minitab program has been applied to monitor the scheduling risk. This approach to stochastic modeling through risk analysis of project activities is very useful for optimizing the schedules of activities using Critical Path Method and managing the scheduling control of NPP project. This study has shown new approach to optimal scheduling of NPP project, however, this does not consider the characteristic of activities according to the NPP site conditions. Hence, this study needs more research considering those factors

The development of stochastic process modeling through risk analysis derived from scheduling of NPP project

Energy Technology Data Exchange (ETDEWEB)

Lee, Kwang Ho; Roh, Myung Sub [KEPCO International Nuclear Graduate School, Ulsan (Korea, Republic of)

2013-10-15

There are so many different factors to consider when constructing a nuclear power plant successfully from planning to decommissioning. According to PMBOK, all projects have nine domains from a holistic project management perspective. They are equally important to all projects, however, this study focuses mostly on the processes required to manage timely completion of the project and conduct risk management. The overall objective of this study is to let you know what the risk analysis derived from scheduling of NPP project is, and understand how to implement the stochastic process modeling through risk management. Building the Nuclear Power Plant is required a great deal of time and fundamental knowledge related to all engineering. That means that integrated project scheduling management with so many activities is necessary and very important. Simulation techniques for scheduling of NPP project using Open Plan program, Crystal Ball program, and Minitab program can be useful tools for designing optimal schedule planning. Thus far, Open Plan and Monte Carlo programs have been used to calculate the critical path for scheduling network analysis. And also, Minitab program has been applied to monitor the scheduling risk. This approach to stochastic modeling through risk analysis of project activities is very useful for optimizing the schedules of activities using Critical Path Method and managing the scheduling control of NPP project. This study has shown new approach to optimal scheduling of NPP project, however, this does not consider the characteristic of activities according to the NPP site conditions. Hence, this study needs more research considering those factors.

An unit cost adjusting heuristic algorithm for the integrated planning and scheduling of a two-stage supply chain

Directory of Open Access Journals (Sweden)

Jianhua Wang

2014-10-01

Full Text Available Purpose: The stable relationship of one-supplier-one-customer is replaced by a dynamic relationship of multi-supplier-multi-customer in current market gradually, and efficient scheduling techniques are important tools of the dynamic supply chain relationship establishing process. This paper studies the optimization of the integrated planning and scheduling problem of a two-stage supply chain with multiple manufacturers and multiple retailers to obtain a minimum supply chain operating cost, whose manufacturers have different production capacities, holding and producing cost rates, transportation costs to retailers.Design/methodology/approach: As a complex task allocation and scheduling problem, this paper sets up an INLP model for it and designs a Unit Cost Adjusting (UCA heuristic algorithm that adjust the suppliers’ supplying quantity according to their unit costs step by step to solve the model.Findings: Relying on the contrasting analysis between the UCA and the Lingo solvers for optimizing many numerical experiments, results show that the INLP model and the UCA algorithm can obtain its near optimal solution of the two-stage supply chain’s planning and scheduling problem within very short CPU time.Research limitations/implications: The proposed UCA heuristic can easily help managers to optimizing the two-stage supply chain scheduling problems which doesn’t include the delivery time and batch of orders. For two-stage supply chains are the most common form of actual commercial relationships, so to make some modification and study on the UCA heuristic should be able to optimize the integrated planning and scheduling problems of a supply chain with more reality constraints.Originality/value: This research proposes an innovative UCA heuristic for optimizing the integrated planning and scheduling problem of two-stage supply chains with the constraints of suppliers’ production capacity and the orders’ delivering time, and has a great

Smooth and Controlled Recovery Planning of Disruptions in Rapid Transit Networks

NARCIS (Netherlands)

Cadarso, L.; Marin, A.; Maroti, G.

2015-01-01

This paper studies the disruption management problem of rapid transit rail networks. We consider an integrated model for the recovery of the timetable and the rolling stock schedules. We propose a new approach to deal with large-scale disruptions: we limit the number of simultaneous schedule changes

A Bilevel Scheduling Approach for Modeling Energy Transaction of Virtual Power Plants in Distribution Networks

Directory of Open Access Journals (Sweden)

F. Nazari

2017-03-01

Full Text Available By increasing the use of distributed generation (DG in the distribution network operation, an entity called virtual power plant (VPP has been introduced to control, dispatch and aggregate the generation of DGs, enabling them to participate either in the electricity market or the distribution network operation. The participation of VPPs in the electricity market has made challenges to fairly allocate payments and benefits between VPPs and distribution network operator (DNO. This paper presents a bilevel scheduling approach to model the energy transaction between VPPs and DNO.  The upper level corresponds to the decision making of VPPs which bid their long- term contract prices so that their own profits are maximized and the lower level represents the DNO decision making to supply electricity demand of the network by minimizing its overall cost. The proposed bilevel scheduling approach is transformed to a single level optimizing problem using its Karush-Kuhn-Tucker (KKT optimality conditions. Several scenarios are applied to scrutinize the effectiveness and usefulness of the proposed model. 

Automated scheduling and planning from theory to practice

CERN Document Server

Ozcan, Ender; Urquhart, Neil

2013-01-01

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

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Science.gov (United States)

Lee, Charles H.; Cheung, Kar-Ming

2013-01-01

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

DLTAP: A Network-efficient Scheduling Method for Distributed Deep Learning Workload in Containerized Cluster Environment

OpenAIRE

Qiao Wei; Li Ying; Wu Zhong-Hai

2017-01-01

Deep neural networks (DNNs) have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling ...

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

Multi-layer service function chaining scheduling based on auxiliary graph in IP over optical network

Science.gov (United States)

Li, Yixuan; Li, Hui; Liu, Yuze; Ji, Yuefeng

2017-10-01

Software Defined Optical Network (SDON) can be considered as extension of Software Defined Network (SDN) in optical networks. SDON offers a unified control plane and makes optical network an intelligent transport network with dynamic flexibility and service adaptability. For this reason, a comprehensive optical transmission service, able to achieve service differentiation all the way down to the optical transport layer, can be provided to service function chaining (SFC). IP over optical network, as a promising networking architecture to interconnect data centers, is the most widely used scenarios of SFC. In this paper, we offer a flexible and dynamic resource allocation method for diverse SFC service requests in the IP over optical network. To do so, we firstly propose the concept of optical service function (OSF) and a multi-layer SFC model. OSF represents the comprehensive optical transmission service (e.g., multicast, low latency, quality of service, etc.), which can be achieved in multi-layer SFC model. OSF can also be considered as a special SF. Secondly, we design a resource allocation algorithm, which we call OSF-oriented optical service scheduling algorithm. It is able to address multi-layer SFC optical service scheduling and provide comprehensive optical transmission service, while meeting multiple optical transmission requirements (e.g., bandwidth, latency, availability). Moreover, the algorithm exploits the concept of Auxiliary Graph. Finally, we compare our algorithm with the Baseline algorithm in simulation. And simulation results show that our algorithm achieves superior performance than Baseline algorithm in low traffic load condition.

Using Planning, Scheduling and Execution for Autonomous Mars Rover Operations

Science.gov (United States)

Estlin, Tara A.; Gaines, Daniel M.; Chouinard, Caroline M.; Fisher, Forest W.; Castano, Rebecca; Judd, Michele J.; Nesnas, Issa A.

2006-01-01

With each new rover mission to Mars, rovers are traveling significantly longer distances. This distance increase raises not only the opportunities for science data collection, but also amplifies the amount of environment and rover state uncertainty that must be handled in rover operations. This paper describes how planning, scheduling and execution techniques can be used onboard a rover to autonomously generate and execute rover activities and in particular to handle new science opportunities that have been identified dynamically. We also discuss some of the particular challenges we face in supporting autonomous rover decision-making. These include interaction with rover navigation and path-planning software and handling large amounts of uncertainty in state and resource estimations. Finally, we describe our experiences in testing this work using several Mars rover prototypes in a realistic environment.

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

International Nuclear Information System (INIS)

1994-12-01

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

User’s guide to SNAP for ArcGIS® :ArcGIS interface for scheduling and network analysis program

Science.gov (United States)

Woodam Chung; Dennis Dykstra; Fred Bower; Stephen O’Brien; Richard Abt; John. and Sessions

2012-01-01

This document introduces a computer software named SNAP for ArcGIS® , which has been developed to streamline scheduling and transportation planning for timber harvest areas. Using modern optimization techniques, it can be used to spatially schedule timber harvest with consideration of harvesting costs, multiple products, alternative...

Access management in Safer Transportation Network Planning : safety principles, planning framework, and library information.

NARCIS (Netherlands)

Hummel, T.

2001-01-01

This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

Route management in Safer Transportation Network Planning : safety principles, planning framework, and library information.

NARCIS (Netherlands)

Hummel, T.

2001-01-01

This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information

A planning and scheduling system for the LHC project

CERN Document Server

Bachy, Gérard; Tarrant, M

1995-01-01

The purpose of this paper is to present modern ways to manage time, resources and progress in a large-scale project. Over the last ten years, new project management techniques and tools have appeared such as concurrent engineering, Continuous Acquisition Lifecycle Support (CALS) and Engineering Data Management System (EDMS). The world downturn of the early 90s influenced project management: increasing constraints on time and budget and more external direction on spending that, for example, requires sophisticated sub-contracting practises. However, the evolution of the software and hardware market makes project control tools cheaper and easier to use. All project groups want to have their scope of work considered as complete projects and to control them themselves. This has several consequences on project staff behaviour concerning project control, and has to be taken into account in every planning process designed today. The system described will be at the heart of the planning and scheduling procedures issue...

Sleep-time sizing and scheduling in green passive optical networks

KAUST Repository

Elrasad, Amr

2012-08-01

Next-generation passive optical network (PON) has been widely considered as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue for its operations. In this paper, we present a novel sleep time sizing and scheduling framework that satisfies power efficient bandwidth allocation in PONs. We consider the downstream links from an optical line terminal (OLT) to an optical network unit (ONU). The ONU has two classes of traffic, control and data. Control traffic are delay intolerant with higher priority than the data traffic. Closed form model for average ONU sleeping time and end-to-end data traffic delay are presented and evaluated. Our framework decouples the dependency between ONU sleeping time and the QoS of the traffic.

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

Science.gov (United States)

2010-07-01

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

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

OpenAIRE

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-01-01

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical d...

Optimal Temporal Decoupling in Task Scheduling with Preferences

NARCIS (Netherlands)

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

2011-01-01

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

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

An alternate property tax program requiring a forest management plan and scheduled harvesting

Science.gov (United States)

D.F. Dennis; P.E. Sendak

1991-01-01

Vermont's Use Value Appraisal property tax program, designed to address problems such as tax inequity and forced development caused by taxing agricultural and forest land based on speculative values, requires a forest management plan and scheduled harvests. A probit analysis of enrollment provides evidence of the program's success in attracting large parcels...

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

OpenAIRE

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

2014-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

Agent-based scheduling for aircraft deicing

NARCIS (Netherlands)

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

2006-01-01

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

Optimal Charging Schedule Planning and Economic Analysis for Electric Bus Charging Stations

Directory of Open Access Journals (Sweden)

Rong-Ceng Leou

2017-04-01

Full Text Available The battery capacity of electric buses (EB used for public transportation is greater than that of electric cars, and the charging power is also several times greater than that used in electric cars; this can result in high energy consumption and negatively impact power distribution networks. This paper proposes a framework to determine the optimal contracted power capacity and charging schedule of an EB charging station in such a way that energy costs can be reduced. A mathematical model of controlled charging, which includes the capacity and energy charges of the station, was developed to minimize costs. The constraints of the model include the charging characteristics of an EB and the operational guidelines of the bus company. A practical EB charging station was used to verify the proposed model. The financial viability of this EB charging station is also studied in this paper. The economic analysis model for this charging station considers investment and operational costs, and the operational revenue. Sensitivity analyses with respect to some key parameters are also performed in this paper. Based on actual operational routes and EB charging schemes, test results indicate that the EB charging station investment is feasible, and the planning model proposed can be used to determine optimal station power capacity and minimize energy costs.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

Science.gov (United States)

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-04-16

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

FFTF and Advanced Reactors Transition Program Resource Loaded Schedule

Energy Technology Data Exchange (ETDEWEB)

GANTT, D.A.

2000-10-31

This Resource Load Schedule (RLS) addresses two missions. The Advanced Reactors Transition (ART) mission, funded by DOE-EM, is to transition assigned, surplus facilities to a safe and compliant, low-cost, stable, deactivated condition (requiring minimal surveillance and maintenance) pending eventual reuse or D&D. Facilities to be transitioned include the 309 Building Plutonium Recycle Test Reactor (PRTR) and Nuclear Energy Legacy facilities. This mission is funded through the Environmental Management (EM) Project Baseline Summary (PBS) RL-TP11, ''Advanced Reactors Transition.'' The second mission, the Fast Flux Test Facility (FFTF) Project, is funded through budget requests submitted to the Office of Nuclear Energy, Science and Technology (DOE-NE). The FFTF Project mission is maintaining the FFTF, the Fuels and Materials Examination Facility (FMEF), and affiliated 400 Area buildings in a safe and compliant standby condition. This mission is to preserve the condition of the plant hardware, software, and personnel in a manner not to preclude a plant restart. This revision of the Resource Loaded Schedule (RLS) is based upon the technical scope in the latest revision of the following project and management plans: Fast Flux Test Facility Standby Plan (Reference 1); Hanford Site Sodium Management Plan (Reference 2); and 309 Building Transition Plan (Reference 4). The technical scope, cost, and schedule baseline is also in agreement with the concurrent revision to the ART Fiscal Year (FY) 2001 Multi-Year Work Plan (MYWP), which is available in an electronic version (only) on the Hanford Local Area Network, within the ''Hanford Data Integrator (HANDI)'' application.

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Efficient Load Scheduling Method For Power Management

Directory of Open Access Journals (Sweden)

Vijo M Joy

2015-08-01

Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.

Optimal Scheduling and Operating Target (OPTAR) Cost Model for Aircraft Carriers in the Fleet Response Plan

National Research Council Canada - National Science Library

York, Michael A

2008-01-01

.... This capability is developed through the Fleet Readiness Training Plan (FRTP) where the Navy's carriers are scheduled in staggered 32-month cycles consisting of four phases of progressive readiness levels...

Simulation and Optimization Methodologies for Military Transportation Network Routing and Scheduling and for Military Medical Services

National Research Council Canada - National Science Library

Rodin, Ervin Y

2005-01-01

The purpose of this present research was to develop a generic model and methodology for analyzing and optimizing large-scale air transportation networks including both their routing and their scheduling...

Borda application of selection planning scheduling method in dock engineering consultants in Central Sulawesi province Indonesia

Directory of Open Access Journals (Sweden)

Siti Fatimah

2015-04-01

Full Text Available The aim of this paper to find out the planning scheduling method that used in dock engineering consultants as a project supervisor dock. This research use qualitative approach to find the most preferred method by engineering consultants, this research was explorative that test and find out the most preferred method. This research showed that dock engineering consultants in Palu City, Central Sulawesi most preferred curve-s method than method such as CPM, PERT, PDM, and Bar Chart. This research can help further research to determine differences and similarities the project planning scheduling method and being basic for The New Dock Engineering Consultans. This research looking for the most preferred method with limited respondents dock engineering consultans in Palu City, Central Sulawesi.

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)

Detailed leak detection test plan and schedule for the Oak Ridge National Laboratory LLLW active pipelines

International Nuclear Information System (INIS)

Douglas, D.G.; Starr, J.W.; Juliano, T.M.; Maresca, J.W. Jr.

1993-09-01

This document provides a detailed leak detection test plan and schedule for leak testing many of the pipelines that comprise the active portion of the liquid low-level waste (LLLW) system at the Oak Ridge National Laboratory (ORNL). This plan was prepared in response to the requirements of the Federal Facility Agreement (FFA) between the US Department of Energy (DOE) and two other agencies, the US Environmental Protection Agency (EPA) and the Tennessee Department of Environment and Conservation (TDEC). The LLLW system is an interconnected complex of tanks and pipelines. The FFA distinguishes four categories of tank and pipeline systems within this complex: new systems (Category A), doubly contained systems (Category B), singly contained systems (Category C), and inactive systems (Category D). The FFA specifically requires leak testing of the Category C systems. This plan and schedule addresses leak testing of the Category C pipelines and those doubly contained pipelines that do not fully meet the requirements for secondary containment as listed in the FFA

Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

Science.gov (United States)

Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

2016-09-01

A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

The DEEP-South: Scheduling and Data Reduction Software System

Science.gov (United States)

Yim, Hong-Suh; Kim, Myung-Jin; Bae, Youngho; Moon, Hong-Kyu; Choi, Young-Jun; Roh, Dong-Goo; the DEEP-South Team

2015-08-01

The DEep Ecliptic Patrol of the Southern sky (DEEP-South), started in October 2012, is currently in test runs with the first Korea Microlensing Telescope Network (KMTNet) 1.6 m wide-field telescope located at CTIO in Chile. While the primary objective for the DEEP-South is physical characterization of small bodies in the Solar System, it is expected to discover a large number of such bodies, many of them previously unknown.An automatic observation planning and data reduction software subsystem called "The DEEP-South Scheduling and Data reduction System" (the DEEP-South SDS) is currently being designed and implemented for observation planning, data reduction and analysis of huge amount of data with minimum human interaction. The DEEP-South SDS consists of three software subsystems: the DEEP-South Scheduling System (DSS), the Local Data Reduction System (LDR), and the Main Data Reduction System (MDR). The DSS manages observation targets, makes decision on target priority and observation methods, schedules nightly observations, and archive data using the Database Management System (DBMS). The LDR is designed to detect moving objects from CCD images, while the MDR conducts photometry and reconstructs lightcurves. Based on analysis made at the LDR and the MDR, the DSS schedules follow-up observation to be conducted at other KMTNet stations. In the end of 2015, we expect the DEEP-South SDS to achieve a stable operation. We also have a plan to improve the SDS to accomplish finely tuned observation strategy and more efficient data reduction in 2016.

Modeling the transient security constraints of natural gas network in day-ahead power system scheduling

DEFF Research Database (Denmark)

Yang, Jingwei; Zhang, Ning; Kang, Chongqing

2017-01-01

The rapid deployment of gas-fired generating units makes the power system more vulnerable to failures in the natural gas system. To reduce the risk of gas system failure and to guarantee the security of power system operation, it is necessary to take the security constraints of natural gas...... accurately, they are hard to be embedded into the power system scheduling model, which consists of algebraic equations and inequations. This paper addresses this dilemma by proposing an algebraic transient model of natural gas network which is similar to the branch-node model of power network. Based...... pipelines into account in the day-ahead power generation scheduling model. However, the minute- and hour-level dynamic characteristics of gas systems prevents an accurate decision-making simply with the steady-state gas flow model. Although the partial differential equations depict the dynamics of gas flow...

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

Directory of Open Access Journals (Sweden)

Sukho Oh

2018-04-01

Full Text Available Time Slotted Channel Hopping (TSCH is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Combining Activity DSM with Temporal Logic for Collaborative Planning and Scheduling

Directory of Open Access Journals (Sweden)

Mathieu Baudin

2013-09-01

Full Text Available This work presents an approach that implements enhanced scheduling algorithms to plan and schedule interventions in scientific facilities emitting various types of ionizing radiation such as the ones present at CERN in Geneva, (Switzerland or at GSI in Darmstadt (Germany. To deal with the collaborative process of activity creation and submission used in those organizations, we propose a framework to set the appropriate sequence or skeleton for the activities. This framework combines Allen's Interval Algebra and DSM (Design Structure Matrix. It enables the sequence of activities to be automatically computed while gathering and taking into account the needs of users and testing their compatibility. It also deals with technical-type or resource-type constraints between activities as well as incompatible submissions. The work described in this paper includes details of the collaborative submission process and introduces suggestions for compromising as well as temporal calculations with the introduction of parameterized DSMs rather than binary ones.

Settlement Networks in Polish Spatial Development Regional Plans

Science.gov (United States)

Sołtys, Jacek

2017-10-01

In 1999, ten years after the great political changes in Poland, 16 self-governed regions (in Polish: voivodeship) were created. According to Polish law, voivodeship spatial development plans, or regional plans in short, determine basic elements of the settlement network. No detailed regulations indicate the specific elements of the settlement network or what features of these elements should be determined. For this reason, centres as elements of the settlement network are variously named in different regions and take the form of various models. The purposes of the research described in this article are: (1) recognition and systematization of settlement network models determined in regional plans; and (2) assessment of the readability of determination in planning and its usefulness in the practice of regional policy. Six models of settlement networks in regional plans have been identified and classified into types and sub-types. Names of specific levels of centres indicate that they were classified according to two criteria: (1) level of services, which concerns only 5 voivodships; and (2) importance in development, which concerns the 11 other voivodships. The hierarchical model referring to the importance of development is less understandable than the one related to services. In the text of most plans, centres of services and centres of development are treated independently from their names. In some plans the functional types of towns and cities are indicated. In some voivodships, specifications in the plan text are too general and seem to be rather useless in the practice of regional policy. The author suggests that regional plans should determine two kinds of centres: hierarchical service centres and non-hierarchical centres of development. These centres should be further distinguished according to: (1) their role in the activation of surroundings; (2) their level of development and the necessity of action for their development; and (3) the types of actions

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

2010-01-01

In this paper, we present the Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem...

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

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

Directory of Open Access Journals (Sweden)

Lavy Libman

2012-11-01

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

Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

Directory of Open Access Journals (Sweden)

Julien Maheut

2013-07-01

Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system

Computer network environment planning and analysis

Science.gov (United States)

Dalphin, John F.

1989-01-01

The GSFC Computer Network Environment provides a broadband RF cable between campus buildings and ethernet spines in buildings for the interlinking of Local Area Networks (LANs). This system provides terminal and computer linkage among host and user systems thereby providing E-mail services, file exchange capability, and certain distributed computing opportunities. The Environment is designed to be transparent and supports multiple protocols. Networking at Goddard has a short history and has been under coordinated control of a Network Steering Committee for slightly more than two years; network growth has been rapid with more than 1500 nodes currently addressed and greater expansion expected. A new RF cable system with a different topology is being installed during summer 1989; consideration of a fiber optics system for the future will begin soon. Summmer study was directed toward Network Steering Committee operation and planning plus consideration of Center Network Environment analysis and modeling. Biweekly Steering Committee meetings were attended to learn the background of the network and the concerns of those managing it. Suggestions for historical data gathering have been made to support future planning and modeling. Data Systems Dynamic Simulator, a simulation package developed at NASA and maintained at GSFC was studied as a possible modeling tool for the network environment. A modeling concept based on a hierarchical model was hypothesized for further development. Such a model would allow input of newly updated parameters and would provide an estimation of the behavior of the network.

Designing of network planning system for small-scale manufacturing

Science.gov (United States)

Kapulin, D. V.; Russkikh, P. A.; Vinnichenko, M. V.

2018-05-01

The paper presents features of network planning in small-scale discrete production. The procedure of explosion of the production order, considering multilevel representation, is developed. The software architecture is offered. Approbation of the network planning system is carried out. This system allows carrying out dynamic updating of the production plan.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

Science.gov (United States)

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

Urban Green Network Design: Defining green network from an urban planning perspective

Directory of Open Access Journals (Sweden)

Andrea Tulisi

2017-08-01

Full Text Available From the theoretical context of Smart City various studies have emerged that adopt an analytical approach and description of urban phenomena based on the principles of “network design”; this line of research uses the network systems theory to define the principles that regulate the relationships among the various elements of urban sub-systems in order to optimize their functionality. From the same theoretical basis, urban greenspaces have also been studied as networks, by means of the creation of models capable of measuring the performance of the system in its entirety, posing the basis of a new multy-disciplinary research field called green network. This paper presents the results of research aimed at clarifying the meaning of green network from an urban planning perspective through a lexical analysis applied to a textual corpus of more than 300 abstracts of research papers that have dealt with this topic over the last twenty years. The results show that the concept of green network appears still fuzzy and unclear, due to the different meaning given to the term “green” and to an incorrect use of the term “network”, often referred to as a generic set of natural areas present in a city, without any reference to the network system theory or to the basic rules linking these elements together. For this reason, the paper proposes a unique definition of green network from an urban planning perspective that takes into account the contribution of other research areas to effective green infrastructure planning. This is the concept of “urban green network design” defined as “an urban planning practice, supported by decision support tools able to model green infrastructure as network, composed by natural and semi-natural areas, whose connections are modelled according to specific variables, in order to deliver an equal distribution of public services for enhancing the quality of life as well as a wide range of ecosystem services”.

National contingency plan product schedule data base

International Nuclear Information System (INIS)

Putukian, J.; Hiltabrand, R.R.

1993-01-01

During oil spills there are always proposals by the technical community and industry to use chemical agents to help in oil spill cleanups. Federal Clean Water Act regulations require that any chemical agents that the federal on-scene coordinator (FOSC) wants to use for oil cleanup be listed on the US Environmental Protection Agency (EPA) National Contingency Plan (NCP) Product Schedule. Chemical countermeasures are among the most controversial, complex, and time-critical issues facing decision-making officials choosing response methods to use on coastal oil spills. There are situations in which dispersants are likely to be one of the most appropriate counter-measure strategies. Dispersants are most effective when applied to fresh oil, and their effectiveness dramatically decreases as the oil weathers, which can begin in as little as 24 hours. To logistically implement dispersant use, a decision would need to be made within roughly the first 4 hours after the release. Most of the information that the FOSC needs to make the determination to use a specific chemical agent exists in manuals, EPA bulletins, and the published literature. This information is not in an easy-to-use format under field emergency conditions. Hence the need to collect and disseminate the information in an automated data base. The sources for the information in this data base are the following. Published results of tests performed by Environment Canada; EPA bulletins associated with the NCP Product Schedule; Published results of tests by the chemical industry. The data base resides on a Macintosh computer and contains information about 70 NCP products, including dispersants, surface collecting agents, and biological additives. It contains information on physical properties, toxicity, heavy metal content, safety precautions, use conditions, etc

An UAV scheduling and planning method for post-disaster survey

Science.gov (United States)

Li, G. Q.; Zhou, X. G.; Yin, J.; Xiao, Q. Y.

2014-11-01

Annually, the extreme climate and special geological environments lead to frequent natural disasters, e.g., earthquakes, floods, etc. The disasters often bring serious casualties and enormous economic losses. Post-disaster surveying is very important for disaster relief and assessment. As the Unmanned Aerial Vehicle (UAV) remote sensing with the advantage of high efficiency, high precision, high flexibility, and low cost, it is widely used in emergency surveying in recent years. As the UAVs used in emergency surveying cannot stop and wait for the happening of the disaster, when the disaster happens the UAVs usually are working at everywhere. In order to improve the emergency surveying efficiency, it is needed to track the UAVs and assign the emergency surveying task for each selected UAV. Therefore, a UAV tracking and scheduling method for post-disaster survey is presented in this paper. In this method, Global Positioning System (GPS), and GSM network are used to track the UAVs; an emergency tracking UAV information database is built in advance by registration, the database at least includes the following information, e.g., the ID of the UAVs, the communication number of the UAVs; when catastrophe happens, the real time location of all UAVs in the database will be gotten using emergency tracking method at first, then the traffic cost time for all UAVs to the disaster region will be calculated based on the UAVs' the real time location and the road network using the nearest services analysis algorithm; the disaster region is subdivided to several emergency surveying regions based on DEM, area, and the population distribution map; the emergency surveying regions are assigned to the appropriated UAV according to shortest cost time rule. The UAVs tracking and scheduling prototype is implemented using SQLServer2008, ArcEnginge 10.1 SDK, Visual Studio 2010 C#, Android, SMS Modem, and Google Maps API.

Task path planning, scheduling and learning for free-ranging robot systems

Science.gov (United States)

Wakefield, G. Steve

1987-01-01

The development of robotics applications for space operations is often restricted by the limited movement available to guided robots. Free ranging robots can offer greater flexibility than physically guided robots in these applications. Presented here is an object oriented approach to path planning and task scheduling for free-ranging robots that allows the dynamic determination of paths based on the current environment. The system also provides task learning for repetitive jobs. This approach provides a basis for the design of free-ranging robot systems which are adaptable to various environments and tasks.

Network location theory and contingency planning

Energy Technology Data Exchange (ETDEWEB)

Hakimi, S L

1983-08-01

A brief survey of results in network location theory is first presented. Then, a systems view of contingency planning is described. Finally, some results in location theory are re-examined and it is shown that they are motivated by contingency planning considerations. Some new issues and problems in location theory are described, which, if properly tackled, will have a substantial impact on contingency planning in transportation.

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

The link between the use of advanced planning and scheduling (APS) modules and factory context

DEFF Research Database (Denmark)

Kristensen, Jesper; Asmussen, Jesper Normann; Wæhrens, Brian Vejrum

2017-01-01

at factories characterized by low planning maturity, but lower for factories with medium planning maturity. For low planning maturity, the APS module is used for improving the configuration of the manufacturing system, whereas high planning maturity is required to capture performance benefits from optimization......Through a study of four embedded action research cases within a global OEM, it is investigated how the frequency of use and contribution of an Advanced Planning and Scheduling (APS) module are affected by factory context. The performance contribution of the APS module is found to be high...... and scenario planning. Further, it is found that planning complexity at the factory increases both the frequency of use and the contribution of using APS modules. On the basis of the findings, three propositions are formulated on the link between factory context and the use of APS module....

An overview of trends in distribution network planning: A movement towards smart planning

DEFF Research Database (Denmark)

You, Shi; Bindner, Henrik W.; Hu, Junjie

2014-01-01

Distribution network planning, historically known as a ‘predict and provide’ process, seeks to determine a set of optimal network solutions for supplying electric demands spatially distributed over a geographic area. Today, the rapid development and deployment of distributed generation and smart...... grid products (e.g., control, communication, and new economic measures) call for urgent improvements in distribution network planning to allow the utilities to proactively modernize their existing distribution grids. This paper reviews the current practices in this area and the emerging trends towards...

Range Scheduling Aid (RSA)

Science.gov (United States)

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

1991-01-01

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

Fair packet scheduling in Wireless Mesh Networks

KAUST Repository

Nawab, Faisal

2014-02-01

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

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks.

Science.gov (United States)

Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

2017-09-15

Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller's direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20-40% while ensuring feasible data delay.

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Yunkai Wei

2017-09-01

Full Text Available Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs are an inexorable trend for Wireless Sensor Networks (WSNs, including Wireless Rechargeable Sensor Network (WRSNs. However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay.

Multi-day activity scheduling reactions to planned activities and future events in a dynamic model of activity-travel behavior

NARCIS (Netherlands)

Nijland, L.; Arentze, T.A.; Timmermans, H.J.P.

2014-01-01

Modeling multi-day planning has received scarce attention in activity-based transport demand modeling so far. However, new dynamic activity-based approaches are being developed at the current moment. The frequency and inflexibility of planned activities and events in activity schedules of

Multi-Day Activity Scheduling Reactions to Planned Activities and Future Events in a Dynamic Model of Activity-Travel Behavior

NARCIS (Netherlands)

Nijland, L.; Arentze, T.; Timmermans, H.

2014-01-01

Modeling multi-day planning has received scarce attention in activity-based transport demand modeling so far. However, new dynamic activity-based approaches are being developed at the current moment. The frequency and inflexibility of planned activities and events in activity schedules of

Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks

KAUST Repository

Celik, Abdulkadir

2016-09-12

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

F/H Area high level waste removal plan ampersand schedule as required by the Federal Facility Agreement for the Savannah River Site

International Nuclear Information System (INIS)

Hunter, M.A.

1993-11-01

The F and H-area HLW Tank Farms are one component of a larger integrated waste treatment system consisting of facilities designed for the overall processing of several radioactive waste streams resulting from nuclear material processing. Section IX.E of the SRS Federal Facility Agreement requires the DOE to submit to the EPA and SCDHEC for review and approval, a plan(s) and schedule(s) for the removal from service of waste tank systems(s)/component(s) that do not meet secondary containment standards, or that leak or have leaked. The Plan and Schedule for removal from service of these waste tanks is shown in Appendices A and B, respectively. Other portions of this package which include schedule dates are provided for information only. The SRS intends to remove systems from service as opposed to providing secondary containment for non-compliant systems. The systems that do not meet secondary containment requirements or that have leaked (as determined by tank assessment reports) include High Level Waste Tanks No. 1--24 along with corresponding ancillary equipment

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

NARCIS (Netherlands)

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

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

Green cloud environment by using robust planning algorithm

Directory of Open Access Journals (Sweden)

Jyoti Thaman

2017-11-01

Full Text Available Cloud computing provided a framework for seamless access to resources through network. Access to resources is quantified through SLA between service providers and users. Service provider tries to best exploit their resources and reduce idle times of the resources. Growing energy concerns further makes the life of service providers miserable. User’s requests are served by allocating users tasks to resources in Clouds and Grid environment through scheduling algorithms and planning algorithms. With only few Planning algorithms in existence rarely planning and scheduling algorithms are differentiated. This paper proposes a robust hybrid planning algorithm, Robust Heterogeneous-Earliest-Finish-Time (RHEFT for binding tasks to VMs. The allocation of tasks to VMs is based on a novel task matching algorithm called Interior Scheduling. The consistent performance of proposed RHEFT algorithm is compared with Heterogeneous-Earliest-Finish-Time (HEFT and Distributed HEFT (DHEFT for various parameters like utilization ratio, makespan, Speed-up and Energy Consumption. RHEFT’s consistent performance against HEFT and DHEFT has established the robustness of the hybrid planning algorithm through rigorous simulations.

Improved Scheduling Mechanisms for Synchronous Information and Energy Transmission.

Science.gov (United States)

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

2017-06-09

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

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

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

KAUST Repository

Douik, Ahmed

2017-07-17

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 devices to the frames’ radio resources blocks (RRBs) of the single-antenna base-stations (BSs), adjusting the transmit power levels, and for synchronizing the transmit frames across the connected BSs. Previous studies show that the jointly coordinated scheduling and power control problem in the considered CRAN can be solved using an approach that scales exponentially with the number of BSs, devices, and RRBs, which makes the practical implementation infeasible for reasonably sized networks. This paper instead proposes a low-complexity solution to the problem, under the constraints that each device cannot be served by more than one BS but can be served by multiple RRBs within each BS frame, and under the practical assumption that the channel is constant during the duration of each frame. The paper utilizes graph-theoretical based techniques and shows that constructing a single power control graph is sufficient to obtain the optimal solution with a complexity that is independent of the number of RRBs. Simulation results reveal the optimality of the proposed solution for slow-varying channels, and show that the solution performs near-optimal for highly correlated channels.

Automated transportation management system (ATMS) software project management plan (SPMP)

Energy Technology Data Exchange (ETDEWEB)

Weidert, R.S., Westinghouse Hanford

1996-05-20

The Automated Transportation Management System (ATMS) Software Project Management plan (SPMP) is the lead planning document governing the life cycle of the ATMS and its integration into the Transportation Information Network (TIN). This SPMP defines the project tasks, deliverables, and high level schedules involved in developing the client/server ATMS software.

Security-Reliability Trade-Off Analysis for Multiuser SIMO Mixed RF/FSO Relay Networks With Opportunistic User Scheduling

KAUST Repository

El-Malek, Ahmed H. Abd; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim

2016-01-01

In this paper, we study the performance of multiuser single-input multiple-output mixed radio frequency (RF)/free space optical (FSO) relay network with opportunistic user scheduling. The considered system includes multiple users, one amplify

Dynamic Sleep Scheduling on Air Pollution Levels Monitoring with Wireless Sensor Network

OpenAIRE

Gezaq Abror; Rusminto Tjatur Widodo; M. Udin Harun Al Rasyid

2018-01-01

Wireless Sensor Network (WSN) can be applied for Air Pollution Level Monitoring System that have been determined by the Environmental Impact Management Agency which is  PM10, SO2, O3, NO2 and CO. In WSN, node system is constrained to a limited power supply, so that the node system has a lifetime. To doing lifetime maximization, power management scheme is required and sensor nodes should use energy efficiently. This paper proposes dynamic sleep scheduling using Time Category-Fuzzy Logic (Time-...

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

Joint optimization scheduling for water conservancy projects in complex river networks

Directory of Open Access Journals (Sweden)

Qin Liu

2017-01-01

Full Text Available In this study, we simulated water flow in a water conservancy project consisting of various hydraulic structures, such as sluices, pumping stations, hydropower stations, ship locks, and culverts, and developed a multi-period and multi-variable joint optimization scheduling model for flood control, drainage, and irrigation. In this model, the number of sluice holes, pump units, and hydropower station units to be opened were used as decision variables, and different optimization objectives and constraints were considered. This model was solved with improved genetic algorithms and verified using the Huaian Water Conservancy Project as an example. The results show that the use of the joint optimization scheduling led to a 10% increase in the power generation capacity and a 15% reduction in the total energy consumption. The change in the water level was reduced by 0.25 m upstream of the Yundong Sluice, and by 50% downstream of pumping stations No. 1, No. 2, and No. 4. It is clear that the joint optimization scheduling proposed in this study can effectively improve power generation capacity of the project, minimize operating costs and energy consumption, and enable more stable operation of various hydraulic structures. The results may provide references for the management of water conservancy projects in complex river networks.

Wake-on-a-Schedule: Energy-aware Communication in Wi-Fi Networks

Directory of Open Access Journals (Sweden)

PERKOVIC, T.

2014-02-01

Full Text Available Excessive energy consumption of mobile device Wi-Fi (IEEE 802.11x interface is limiting its operational time on batteries, and impacts total energy consumption of electronic devices. In recent years research community has invested great effort in better efficiency of energy consumption. However, there is still a space for improvement. Wi-Fi devices connected to the single AP (Access Point compete for the medium during data exchange. However, due to the performance anomaly in 802.11 networks, a low data rate device will force all other devices connected to the AP to communicate at low rate, which will increase the total energy consumption of these devices. Wake-on-a-Schedule algorithm is proposed reducing the energy consumption of devices placed in the area with the weaker signal by scheduling the data packets for each client on the server side which will not allow clients to compete for the Wi-Fi medium. Through extensive measurements we show that our algorithm can save up to 60% of energy consumption on the client side.

A Method for Automated Planning of FTTH Access Network Infrastructures

DEFF Research Database (Denmark)

Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun

2005-01-01

In this paper a method for automated planning of Fiber to the Home (FTTH) access networks is proposed. We introduced a systematic approach for planning access network infrastructure. The GIS data and a set of algorithms were employed to make the planning process more automatic. The method explains...... method. The method, however, does not fully automate the planning but make the planning process significantly fast. The results and discussion are presented and conclusion is given in the end....

Migration from a terrestrial network to a satellite network - Risks/constraints/payoffs

Science.gov (United States)

Homon, K. A.

The migration method is regarded as a straightforward approach to a customer's requirements while addressing the known constraints. The migration plan organizes, controls, and communicates the extensive number of tasks, schedules, technical details, and node-by-node conversion details using the selected migration method as its cornerstone. It is noted that a successful migration plan must also provide the flexibility and robustness necessary to handle the unforeseen changes that will occur over the three- to four-year migration period. A baseline network provides a solid structural underpinning for the migration plan.

Detailed leak detection test plan and schedule for the Oak Ridge National Laboratory LLLW active tanks

International Nuclear Information System (INIS)

Douglas, D.G.; Maresca, J.W. Jr.

1993-03-01

This document provides a detailed leak detection test plan and schedule for leak testing many of the tanks that comprise the active portion of the liquid low-level waste (LLLW) system at the Oak Ridge National Laboratory (ORNL). This plan was prepared in response to the requirements of the Federal Facility Agreement (FFA) between the US Department of Energy (DOE) and two other agencies, the US Environmental Protection Agency (EPA) and the Tennessee Department of Environment and Conservation (TDEC)

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

Green Network Planning Model for Optical Backbones

DEFF Research Database (Denmark)

Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Jensen, Michael

2010-01-01

on the environment in general. In network planning there are existing planning models focused on QoS provisioning, investment minimization or combinations of both and other parameters. But there is a lack of a model for designing green optical backbones. This paper presents novel ideas to be able to define......Communication networks are becoming more essential for our daily lives and critically important for industry and governments. The intense growth in the backbone traffic implies an increment of the power demands of the transmission systems. This power usage might have a significant negative effect...

ESSOPE: Towards S/C operations with reactive schedule planning

Science.gov (United States)

Wheadon, J.

1993-01-01

The ESSOPE is a prototype front-end tool running on a Sun workstation and interfacing to ESOC's MSSS spacecraft control system for the exchange of telecommand requests (to MSSS) and telemetry reports (from MSSS). ESSOPE combines an operations Planner-Scheduler, with a Schedule Execution Control function. Using an internal 'model' of the spacecraft, the Planner generates a schedule based on utilization requests for a variety of payload services by a community of Olympus users, and incorporating certain housekeeping operations. Conflicts based on operational constraints are automatically resolved, by employing one of several available strategies. The schedule is passed to the execution function which drives MSSS to perform it. When the schedule can no longer be met, either because the operator interferes (by delays or changes of requirements), or because ESSOPE has recognized some spacecraft anomalies, the Planner produces a modified schedule maintaining the on-going procedures as far as consistent with the new constraints or requirements.

An Improved Harmony Search Algorithm for Power Distribution Network Planning

Directory of Open Access Journals (Sweden)

Wei Sun

2015-01-01

Full Text Available Distribution network planning because of involving many variables and constraints is a multiobjective, discrete, nonlinear, and large-scale optimization problem. Harmony search (HS algorithm is a metaheuristic algorithm inspired by the improvisation process of music players. HS algorithm has several impressive advantages, such as easy implementation, less adjustable parameters, and quick convergence. But HS algorithm still has some defects such as premature convergence and slow convergence speed. According to the defects of the standard algorithm and characteristics of distribution network planning, an improved harmony search (IHS algorithm is proposed in this paper. We set up a mathematical model of distribution network structure planning, whose optimal objective function is to get the minimum annual cost and constraint conditions are overload and radial network. IHS algorithm is applied to solve the complex optimization mathematical model. The empirical results strongly indicate that IHS algorithm can effectively provide better results for solving the distribution network planning problem compared to other optimization algorithms.

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

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Kosar, Tevfik

2010-05-20

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

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.

Bayesian network models for error detection in radiotherapy plans

International Nuclear Information System (INIS)

Kalet, Alan M; Ford, Eric C; Phillips, Mark H; Gennari, John H

2015-01-01

The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network’s conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures. (paper)

Network-Based Material Requirements Planning (NBMRP) in ...

African Journals Online (AJOL)

Network-Based Material Requirements Planning (NBMRP) in Product Development Project. ... International Journal of Development and Management Review ... To address the problems, this study evaluated the existing material planning practice, and formulated a NBMRP model out of the variables of the existing MRP and ...

Effect of 3D radiotherapy planning compared to 2D planning within a conventional treatment schedule of advanced lung cancer

International Nuclear Information System (INIS)

Schraube, P.; Spahn, U.; Oetzel, D.; Wannenmacher, M.

2000-01-01

Background: The effect of 3D radiotherapy planning (3D RTP) in comparison to 2D radiotherapy planning (2D RTP) was evaluated in a usually practiced treatment schedule (starting by v./d. opposing portals, continued with computer-planned portals) for non-small-cell lung cancer. Patients and Methods: In 20 patients with locally advanced non-small-cell lung cancer the computer-planned part of the treatment schedule was calculated 2- and 3-dimensionally. Target volume were the primary tumor, the involved and the electively irradiated mediastinal lymph nodes. The results of the 2D RTP were recalculated 3-dimensionally and the mean doses to target volume and organs at risk were defined. Further, the normal tissue complications were calculated. Results: Under the prerequisite of 44 Gy maximally allowed to the spinal cord and a dose to the reference point of 50 Gy a small, but significant advantage with 2.1 Gy to the target (p=0.004) and a reduction of 3.6 Gy to the heart (p=0.05) was achievable for 3D RTP. The dose to the lungs did not differ significantly (19.7 Gy for 2D RTP, 20.3 Gy for 3D RTP). The dose to the heart was not estimated critical by NTCP (normal tissue complication probability). The NTCP for the ipsilateral lung was 16.1 and 18.7% for 2D RTP and 3D RTP, respectively. Regarding the simulator-planned ap/pa fields at the start of the radiotherapy the advantage of 3D RTP was further reduced but remained significant. Favorable with respect to the mean lung dose and the NTCP (18.7% NTCP ipsilateral lung for early onset of 3D planned radiotherapy vs 31.7% for late onset of 3D planned radiotherapy) but not significantly measurable is the early start of the treatment by computerized RTP. Conclusion: The main advantage of 3D RTP in treatment of advanced lung cancer is the better coverage of the target volume. A reduction of the mean lung dose cannot be expected. A dose escalation by 3D RTP to target volumes as described here seems not to be possible because of

ICPP tank farm closure study. Volume III: Cost estimates, planning schedules, yearly cost flowcharts, and life-cycle cost estimates

International Nuclear Information System (INIS)

1998-02-01

This volume contains information on cost estimates, planning schedules, yearly cost flowcharts, and life-cycle costs for the six options described in Volume 1, Section 2: Option 1 -- Total removal clean closure; No subsequent use; Option 2 -- Risk-based clean closure; LLW fill; Option 3 -- Risk-based clean closure; CERCLA fill; Option 4 -- Close to RCRA landfill standards; LLW fill; Option 5 -- Close to RCRA landfill standards; CERCLA fill; and Option 6 -- Close to RCRA landfill standards; Clean fill. This volume is divided into two portions. The first portion contains the cost and planning schedule estimates while the second portion contains life-cycle costs and yearly cash flow information for each option

Prescription Drug Plan Formulary, Pharmacy Network, and P...

Data.gov (United States)

U.S. Department of Health & Human Services — These public use files contain formulary, pharmacy network, and pricing data for Medicare Prescription Drug Plans and Medicare Advantage Prescription Drug Plans...

New York State Middle Schools and Instructional Scheduling, Teaming and Common Planning: A Descriptive Study

Science.gov (United States)

Corey, Chad; Babo, Gerard

2016-01-01

Data regarding the type of instructional scheduling utilized along with the use of teaming and common planning at the middle school level has not been collected nor reported on the New York State School Report Card, and therefore it is not known whether and how middle schools are implementing these three school supports. Consequently, the purpose…

Performance Analysis of Stop-Skipping Scheduling Plans in Rail Transit under Time-Dependent Demand.

Science.gov (United States)

Cao, Zhichao; Yuan, Zhenzhou; Zhang, Silin

2016-07-13

Stop-skipping is a key method for alleviating congestion in rail transit, where schedules are sometimes difficult to implement. Several mechanisms have been proposed and analyzed in the literature, but very few performance comparisons are available. This study formulated train choice behavior estimation into the model considering passengers' perception. If a passenger's train path can be identified, this information would be useful for improving the stop-skipping schedule service. Multi-performance is a key characteristic of our proposed five stop-skipping schedules, but quantified analysis can be used to illustrate the different effects of well-known deterministic and stochastic forms. Problems in the novel category of forms were justified in the context of a single line rather than transit network. We analyzed four deterministic forms based on the well-known A/B stop-skipping operating strategy. A stochastic form was innovatively modeled as a binary integer programming problem. We present a performance analysis of our proposed model to demonstrate that stop-skipping can feasibly be used to improve the service of passengers and enhance the elasticity of train operations under demand variations along with an explicit parametric discussion.

Performance Analysis of Stop-Skipping Scheduling Plans in Rail Transit under Time-Dependent Demand

Directory of Open Access Journals (Sweden)

Zhichao Cao

2016-07-01

Full Text Available Stop-skipping is a key method for alleviating congestion in rail transit, where schedules are sometimes difficult to implement. Several mechanisms have been proposed and analyzed in the literature, but very few performance comparisons are available. This study formulated train choice behavior estimation into the model considering passengers’ perception. If a passenger’s train path can be identified, this information would be useful for improving the stop-skipping schedule service. Multi-performance is a key characteristic of our proposed five stop-skipping schedules, but quantified analysis can be used to illustrate the different effects of well-known deterministic and stochastic forms. Problems in the novel category of forms were justified in the context of a single line rather than transit network. We analyzed four deterministic forms based on the well-known A/B stop-skipping operating strategy. A stochastic form was innovatively modeled as a binary integer programming problem. We present a performance analysis of our proposed model to demonstrate that stop-skipping can feasibly be used to improve the service of passengers and enhance the elasticity of train operations under demand variations along with an explicit parametric discussion.

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.

2018-03-01

The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.

Effective preemptive scheduling scheme for optical burst-switched networks with cascaded wavelength conversion consideration

Science.gov (United States)

Gao, Xingbo

2010-03-01

We introduce a new preemptive scheduling technique for next-generation optical burst switching (OBS) networks considering the impact of cascaded wavelength conversions. It has been shown that when optical bursts are transmitted all optically from source to destination, each wavelength conversion performed along the lightpath may cause certain signal-to-noise deterioration. If the distortion of the signal quality becomes significant enough, the receiver would not be able to recover the original data. Accordingly, subject to this practical impediment, we improve a recently proposed fair channel scheduling algorithm to deal with the fairness problem and aim at burst loss reduction simultaneously in OBS environments. In our scheme, the dynamic priority associated with each burst is based on a constraint threshold and the number of already conducted wavelength conversions among other factors for this burst. When contention occurs, a new arriving superior burst may preempt another scheduled one according to their priorities. Extensive simulation results have shown that the proposed scheme further improves fairness and achieves burst loss reduction as well.

Artificial intelligence techniques for scheduling Space Shuttle missions

Science.gov (United States)

Henke, Andrea L.; Stottler, Richard H.

1994-01-01

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

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks.

Science.gov (United States)

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-10-14

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network.

GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

Energy Technology Data Exchange (ETDEWEB)

Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2008-07-01

Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

Scheduling optimization of a real-world multi product pipeline network; Otimizacao das operacoes de transporte de derivados de petroleo em redes de dutos

Energy Technology Data Exchange (ETDEWEB)

Boschetto, Suelen N.; Felizari, Luiz C.; Magatao, Leandro; Stebel, Sergio L.; Neves Junior, Flavio; Lueders, Ricardo; Arruda, Lucia V.R. de [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil); Ribas, Paulo Cesar; Bernardo, Luiz F.J. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

2008-07-01

This work develops an optimization structure to aid the operational decision-making of scheduling activities in a real world pipeline network. The proposed approach is based on a decomposition method to address complex problems with high computational burden. The Pre-analysis makes a previous evaluation of a batch sequencing, getting information to be entered into optimization block. The continuous time Mixed Integer Linear Program (MILP) model gets such information and calculates the scheduling. The models are applied to a pipeline network that connects different areas including refineries, terminals, and final clients. Many oil derivatives (e.g. gasoline, liquefied petroleum gas, naphtha) can be sent or received in this network. The computational burden to determine a short-term scheduling within the considered scenario is a relevant issue. Many insights have been derived from the obtained solutions, which are given in a reduced computational time for oil industrial-size scenarios. (author)

A review on application of neural networks and fuzzy logic to solve hydrothermal scheduling problem

International Nuclear Information System (INIS)

Haroon, S.; Malik, T.N.; Zafar, S.

2014-01-01

Electrical power system is highly complicated having hydro and thermal mix with large number of machines. To reduce power production cost, hydro and thermal resources are mixed. Hydrothermal scheduling is the optimal coordination of hydro and thermal plants to meet the system load demand at minimum possible operational cost while satisfying the system constraints. Hydrothermal scheduling is dynamic, large scale, non-linear and non-convex optimization problem. The classical techniques have failed in solving such problem. Artificial Intelligence Tools based techniques are used now a day to solve this complex optimization problem because of their no requirements on the nature of the problem. The aim of this research paper is to provide a comprehensive survey of literature related to both Artificial Neural Network (ANN) and Fuzzy Logic (FL) as effective optimization algorithms for the hydrothermal scheduling problem. The outcomes along with the merits and demerits of individual techniques are also discussed. (author)

Planning contract and networks of home services

Directory of Open Access Journals (Sweden)

José Eudoro Narváez Viteri

2010-06-01

Full Text Available This article highlights the worrying increase in public investment in infrastructure works due to deficiencies at the stage of study and design, particularly in public utility services networks. Some cities lack real technical drawings and updated underground networks, especially in the former. Hence, no reliable information is difficult to require contractors, consultants about study designs appropriate public service networks in evident contradiction with the principle of contractual planning.

Planning logistics network for recyclables collection

Directory of Open Access Journals (Sweden)

Ratković Branislava

2014-01-01

Full Text Available Rapid urbanization, intensified industrialization, rise of income, and a more sophisticated form of consumerism are leading to an increase in the amount and toxicity of waste all over the world. Whether reused, recycled, incinerated or put into landfill sites, the management of household and industrial waste yield financial and environmental costs. This paper presents a modeling approach that can be used for designing one part of recycling logistics network through defining optimal locations of collection points, and possible optimal scheduling of vehicles for collecting recyclables. [Projekat Ministarstva nauke Republike Srbije, br. TR36005

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.

Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

Directory of Open Access Journals (Sweden)

Madani Sajjad

2011-01-01

Full Text Available Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a the distance of the node from the sink node, (b the importance of the node's location from connectivity's perspective, and (c if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.

Communication, knowledge, social network and family planning ...

African Journals Online (AJOL)

Family planning utilization in Tanzania is low. This study was cross sectional. It examined family planning use and socio demographic variables, social networks, knowledge and communication among the couples, whereby a stratified sample of 440 women of reproductive age (18-49), married or cohabiting was studied in ...

UMTS network planning, optimization, and inter-operation with GSM

CERN Document Server

Rahnema, Moe

2008-01-01

UMTS Network Planning, Optimization, and Inter-Operation with GSM is an accessible, one-stop reference to help engineers effectively reduce the time and costs involved in UMTS deployment and optimization. Rahnema includes detailed coverage from both a theoretical and practical perspective on the planning and optimization aspects of UMTS, and a number of other new techniques to help operators get the most out of their networks. Provides an end-to-end perspective, from network design to optimizationIncorporates the hands-on experiences of numerous researchersSingle

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

Science.gov (United States)

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Thi-Nga Dao

2016-01-01

Full Text Available Many applications in wireless sensor networks (WSNs require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

Long-term home care scheduling

DEFF Research Database (Denmark)

Gamst, Mette; Jensen, Thomas Sejr

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

Using Data Mining Techniques on APC Data to Develop Effective Bus Scheduling Plans

Directory of Open Access Journals (Sweden)

Jayakrishna PATNAIK

2006-02-01

Full Text Available Various trip generators (e.g., buildings, shopping malls, recreational centers continually influence travel demand in urban and suburban areas. As a result, the headway regularity that should be kept among transit vehicles is difficult to maintain, specifically during peak hours. The variation of headways lengthens the average wait times and deteriorates service quality. Providing a tool to monitor and maintain most up-to-date information through Advanced Traveler Information Systems (ATIS can assist effective system planning and scheduling, while reducing the door-to-door travel time. This paper develops a methodology for clustering the state variables (number served passengers and halting stations in each vehicle trip and using that for service planning. The data used to develop the models were collected by Automatic Passenger Counters (APC on buses operated by a transit agency in the northeast region of the United States. The results illustrate that the developed tool can provide suggestions for improving systems performance as well as future planning.

Multi-Objective Planning Techniques in Distribution Networks: A Composite Review

Directory of Open Access Journals (Sweden)

Syed Ali Abbas Kazmi

2017-02-01

Full Text Available Distribution networks (DNWs are facing numerous challenges, notably growing load demands, environmental concerns, operational constraints and expansion limitations with the current infrastructure. These challenges serve as a motivation factor for various distribution network planning (DP strategies, such as timely addressing load growth aiming at prominent objectives such as reliability, power quality, economic viability, system stability and deferring costly reinforcements. The continuous transformation of passive to active distribution networks (ADN needs to consider choices, primarily distributed generation (DG, network topology change, installation of new protection devices and key enablers as planning options in addition to traditional grid reinforcements. Since modern DP (MDP in deregulated market environments includes multiple stakeholders, primarily owners, regulators, operators and consumers, one solution fit for all planning scenarios may not satisfy all these stakeholders. Hence, this paper presents a review of several planning techniques (PTs based on mult-objective optimizations (MOOs in DNWs, aiming at better trade-off solutions among conflicting objectives and satisfying multiple stakeholders. The PTs in the paper spread across four distinct planning classifications including DG units as an alternative to costly reinforcements, capacitors and power electronic devices for ensuring power quality aspects, grid reinforcements, expansions, and upgrades as a separate category and network topology alteration and reconfiguration as a viable planning option. Several research works associated with multi-objective planning techniques (MOPT have been reviewed with relevant models, methods and achieved objectives, abiding with system constraints. The paper also provides a composite review of current research accounts and interdependence of associated components in the respective classifications. The potential future planning areas, aiming at

Scalable and practical multi-objective distribution network expansion planning

NARCIS (Netherlands)

Luong, N.H.; Grond, M.O.W.; Poutré, La J.A.; Bosman, P.A.N.

2015-01-01

We formulate the distribution network expansion planning (DNEP) problem as a multi-objective optimization (MOO) problem with different objectives that distribution network operators (DNOs) would typically like to consider during decision making processes for expanding their networks. Objectives are

Path Planning and Navigation for Mobile Robots in a Hybrid Sensor Network without Prior Location Information

Directory of Open Access Journals (Sweden)

Zheng Zhang

2013-03-01

Full Text Available In a hybrid wireless sensor network with mobile and static nodes, which have no prior geographical knowledge, successful navigation for mobile robots is one of the main challenges. In this paper, we propose two novel navigation algorithms for outdoor environments, which permit robots to travel from one static node to another along a planned path in the sensor field, namely the RAC and the IMAP algorithms. Using this, the robot can navigate without the help of a map, GPS or extra sensor modules, only using the received signal strength indication (RSSI and odometry. Therefore, our algorithms have the advantage of being cost-effective. In addition, a path planning algorithm to schedule mobile robots' travelling paths is presented, which focuses on shorter distances and robust paths for robots by considering the RSSI-Distance characteristics. The simulations and experiments conducted with an autonomous mobile robot show the effectiveness of the proposed algorithms in an outdoor environment.

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.

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

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

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

PLANNING TRIPOLI METRO NETWORK BY THE USE OF REMOTE SENSING IMAGERY

Directory of Open Access Journals (Sweden)

O. Alhusain

2012-08-01

Full Text Available Tripoli, the capital city of Libya is going through significant and integrated development process, this development is expected to continue in the next few decades. The Libyan authorities have put it as their goal to develop Tripoli to an important metropolis in North Africa. To achieve this goal, they identified goals for the city's future development in all human, economic, cultural, touristic, and nonetheless infrastructure levels. On the infrastructure development level, among other things, they have identified the development of public transportation as one of the important development priorities. At present, public transportation in Tripoli is carried out by a limited capacity bus network alongside of individual transportation. However, movement in the city is characterized mainly by individual transportation with all its disadvantages such as traffic jams, significant air pollution with both carbon monoxide and dust, and lack of parking space. The Libyan authorities wisely opted for an efficient, modern, and environment friendly solution for public transportation, this was to plan a complex Metro Network as the backbone of public transportation in the city, and to develop and integrate the bus network and other means of transportation to be in harmony with the planned Metro network. The Metro network is planned to provide convenient connections to Tripoli International Airport and to the planned Railway station. They plan to build a system of Park and Ride (P+R facilities at suitable locations along the Metro lines. This paper will present in details the planned Metro Network, some of the applied technological solutions, the importance of applying remote sensing and GIS technologies in different planning phases, and problems and benefits associated with the use of multi-temporal-, multi-format spatial data in the whole network planning phase.

Planning Tripoli Metro Network by the Use of Remote Sensing Imagery

Science.gov (United States)

Alhusain, O.; Engedy, Gy.; Milady, A.; Paulini, L.; Soos, G.

2012-08-01

Tripoli, the capital city of Libya is going through significant and integrated development process, this development is expected to continue in the next few decades. The Libyan authorities have put it as their goal to develop Tripoli to an important metropolis in North Africa. To achieve this goal, they identified goals for the city's future development in all human, economic, cultural, touristic, and nonetheless infrastructure levels. On the infrastructure development level, among other things, they have identified the development of public transportation as one of the important development priorities. At present, public transportation in Tripoli is carried out by a limited capacity bus network alongside of individual transportation. However, movement in the city is characterized mainly by individual transportation with all its disadvantages such as traffic jams, significant air pollution with both carbon monoxide and dust, and lack of parking space. The Libyan authorities wisely opted for an efficient, modern, and environment friendly solution for public transportation, this was to plan a complex Metro Network as the backbone of public transportation in the city, and to develop and integrate the bus network and other means of transportation to be in harmony with the planned Metro network. The Metro network is planned to provide convenient connections to Tripoli International Airport and to the planned Railway station. They plan to build a system of Park and Ride (P+R) facilities at suitable locations along the Metro lines. This paper will present in details the planned Metro Network, some of the applied technological solutions, the importance of applying remote sensing and GIS technologies in different planning phases, and problems and benefits associated with the use of multi-temporal-, multi-format spatial data in the whole network planning phase.

Federal Facility Agreement plans and schedules for liquid low-level radioactive waste tank systems at Oak Ridge National Laboratory, Oak Ridge, Tennessee

International Nuclear Information System (INIS)

1993-06-01

The Superfund Amendments and Reauthorization Act of the Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) requires a Federal Facility Agreement (FFA) for federal facilities placed on the National Priorities List. The Oak Ridge Reservation was placed on that list on December 21, 1989, and the agreement was signed in November 1991 by the Department of Energy Oak Ridge Field Office (DOE-OR), the US Environmental Protection Agency (EPA)-Region IV, and the Tennessee Department of Environment and Conservation (TDEC). The effective date of the FFA was January 1, 1992. Section 9 and Appendix F of the agreement impose design and operating requirements on the Oak Ridge National Laboratory (ORNL) liquid low-level radioactive waste (LLLW) tank systems and identify several plans, schedules, and assessments that must be submitted to EPA/TDEC for review or approval. The initial issue of this document in March 1992 transmitted to EPA/TDEC those plans and schedules that were required within 60 to 90 days of the FFA effective date. The current revision of this document updates the plans, schedules, and strategy for achieving compliance with the FFA, and it summarizes the progress that has been made over the past year. Chapter 1 describes the history and operation of the ORNL LLLW System, the objectives of the FFA, the organization that has been established to bring the system into compliance, and the plans for achieving compliance. Chapters 2 through 7 of this report contain the updated plans and schedules for meeting FFA requirements. This document will continue to be periodically reassessed and refined to reflect newly developed information and progress

An Automated Planning Model for RoF Heterogeneous Wireless Networks

DEFF Research Database (Denmark)

Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Ólafur

2010-01-01

The number of users in wireless WANs is increasing like never before, at the same time as the bandwidth demands by users increase.The structure of the third generation Wireless WANs makes it expensive for Wireless ISPs to meet these demands.The FUTON architecture is a RoF heterogeneous wireless...... network architecture under development,that will be cheaper to deploy and operate.This paper shows a method to plan an implementation of this architecture.The planning is done as automatic as possible,covering radio planning, fiber planning and network dimensioning. The out come of the paper is a planning...

Ten-Year Network Development Plan - 2015 edition, executive summary

International Nuclear Information System (INIS)

2016-01-01

Complying with the European and French laws, each year, RTE prepares and publicizes a Ten-Year Network Development Plan (NDP) to meet the expectations of its stakeholders and customers. The NDP lists the network development projects that RTE plans to complete and commission over a 3-year period and presents the main power transmission infrastructure work envisaged for the next Ten-years. Beyond, it outlines the possible network adaptation needs for a variety of energy transition scenarios. Over the next 10 years, the network investments will make it possible to: - Meet the goals of the Regional Climate Air Energy Plans, - Create 4 GW of extra offshore wind generation integration capacity and 10 GW of additional interconnection capacity, 2/3 more than the current capacity, - Enable the development of economically and demographically dynamic areas, with safe and high-standard electricity supply. In the coming decade, RTE plans: - 1,200 km of new underground and sub-sea DC links, along with their associated converter stations; - 600 km of existing equipment upgrades or new overhead 400 kV AC circuits substituting existing power lines. - and, at the same time, nearly 900 km of underground lines and just over 400 km of overhead 225 kV AC lines should be built. 400 projects are listed in this NDP: - 21% of the operations are on overhead lines (for 3/4 new lines or upgrade and for 1/4 dismantling of existing assets) - 27% concern new underground lines; - 52% on substation adaptations (about 20 new RTE substations and 100 new customer substations connected). Globally, nearly 80% of the network is developed underground or sub-sea. This edition of the Network Development plan is further enriched. In particular, it explains more thoroughly the link between the integration of renewable energy and the entailed development of the transmission network. It also provides a focus on smart grids. This edition relies on mid and long term scenarios describing the evolution of the

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.

An Enhanced Feedback-Base Downlink Packet Scheduling Algorithm for Mobile TV in WIMAX Networks

Directory of Open Access Journals (Sweden)

Joseph Oyewale

2013-06-01

Full Text Available With high speed access network technology like WIMAX, there is the need for efficient management of radio resources where the throughput and Qos requirements for Multicasting Broadcasting Services (MBS for example TV are to be met. An enhanced  feedback-base downlink Packet scheduling algorithm  that can be used in IEEE 802.16d/e networks for mobile TV “one way traffic”(MBS is needed to support many users utilizing multiuser diversity of the  broadband of WIMAX systems where a group of users(good/worst channels share allocated resources (bandwidth. This paper proposes a WIMAX framework feedback-base (like a channel-awareness downlink packet scheduling algorithm for Mobile TV traffics in IEEE806.16, in which network Physical Timing Slots (PSs resource blocks are allocated in a dynamic way to mobile TV subscribers based on the Channel State information (CSI feedback, and then considering users with worst channels with the aim of improving system throughput while system coverage is being guaranteed. The algorithm was examined by changing the PSs bandwidth allocation of the users and different number of users of a cell. Simulation results show our proposed algorithm performed better than other algorithms (blind algorithms in terms of improvement in system throughput performance. /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso

INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

Directory of Open Access Journals (Sweden)

Remigiusz Romuald Iwańkowicz

2015-02-01

Full Text Available The specificity of the yard work requires the particularly careful treatment of the issues of scheduling and budgeting in the production planning processes. The article presents the method of analysis of the assembly sequence taking into account the duration of individual activities and the demand for resources. A method of the critical path and resource budgeting were used. Modelling of the assembly was performed using the acyclic graphs. It has been shown that the assembly sequences can have very different feasible budget regions. The proposed model is applied to the assembly processes of large-scale welded structures, including the hulls of ships. The presented computational examples have a simulation character. They show the usefulness of the model and the possibility to use it in a variety of analyses.

Plans and schedules for implementation of US Nuclear Regulatory Commission responsibilities under the Low-Level Radioactive Waste Policy Amendments Act of 1985 (P.L. 99-240)

International Nuclear Information System (INIS)

Dunkelman, M.M.; Kearney, M.S.; MacDougall, R.D.

1986-07-01

The purpose of this document is to make available to the states and other interested parties, the plans and schedules for the US Nuclear Regulatory Commission's (NRC's) implementation of its responsibilities under Public Law 99-240, the Low-Level Radioactive Waste Policy Amendments Act of 1985 (LLRWPAA). This document identifies the provisions of the LLRWPAA which affect the programs of the NRC, identifies what the NRC must do to fulfill each of its requirements under the LLRWPAA, and establishes schedules for carrying out these requirements. The plans and schedules are current as of June 1986

Multi-year expansion planning of large transmission networks

Energy Technology Data Exchange (ETDEWEB)

Binato, S; Oliveira, G C [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil)

1994-12-31

This paper describes a model for multi-year transmission network expansion to be used in long-term system planning. The network is represented by a linearized (DC) power flow and, for each year, operation costs are evaluated by a linear programming (LP) based algorithm that provides sensitivity indices for circuit reinforcements. A Backward/Forward approaches is proposed to devise an expansion plan over the study period. A case study with the southeastern Brazilian system is presented and discussed. (author) 18 refs., 5 figs., 1 tab.

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

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

NARCIS (Netherlands)

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

2005-01-01

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

Decennial development plan of the GRTgaz's transmission network 2012-2021

International Nuclear Information System (INIS)

2012-09-01

The GRTgaz network is the longest high pressure natural gas transmission network in Europe, and one of the best interconnected. It comprises a main network and a regional network. After an indication of some key figures of the GRTgaz network (duct length, transported volume, exchanged power, clients, turnover, investments), this report proposes a synthetic overview of the decennial development plan framework, of European and French energy policies, of the French geographical position in relationship with Europe, and of the energetic objectives of the decennial plan. In its other parts, this report reviews the gas transmission demand and supply, analyses the evolution of the gas market in Europe and in France (consumption and supplies, issue of secure supply), describes the development of the GRTgaz transmission network (developments in the northern and southern areas, merger of North and South market areas, connection of Corsica), presents the provisional timetable for the planned works (projects put into service within 3 years or after 2014, provisional development of capacities during the 2012-2021 period)

Opportunities and Challenges of AC/DC Transmission Network Planning Considering High Proportion Renewable Energy

Directory of Open Access Journals (Sweden)

Arslan Habib

2018-03-01

Full Text Available The time and space distribution characteristics of future high proportion of renewable energy sources will bring unprecedented challenges to the electric power system’s processing and planning, the basic form of electric power system and operating characteristics will have fundamental changes. Based on the research status quo at home and abroad, this paper expounds the four scientific problems of the transmission network planning with high proportion of renewable energy. Respectively, from the network source collaborative planning, transmission network flexible planning. With the distribution network in conjunction with the transmission network planning, transmission planning program comprehensive evaluation and decision-making methods. This paper puts forward the research ideas and framework of transmission network planning considering the high proportion of renewable energy. At the end, the future high proportion of (renewable energy grid-connected transmission network’s opportunities and challenges are presented.

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

Science.gov (United States)

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-01-01

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network. PMID:27754405

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

Directory of Open Access Journals (Sweden)

Binbin Shi

2016-10-01

Full Text Available In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network.

Detailed Leak Detection Test Plan and schedule for the Oak Ridge National Laboratory liquid low-level waste active pipelines

International Nuclear Information System (INIS)

1994-08-01

This document provides a detailed leak detection test plan and schedule for the pipelines that comprise the active, singly contained, portion of the liquid low-level waste (LLLW) system at the Oak Ridge National Laboratory (ORNL). This plan was prepared in response to the requirements of the Federal Facility Agreement for the Oak Ridge Reservation (FFA) between the U.S. Department of Energy (DOE), the U.S. Environmental Protection Agency (EPA) and the Tennessee Department of Environment and Conservation (TDEC). The LLLW system is an interconnected complex of tanks and pipelines. The FFA distinguishes four categories of tank and pipeline systems within this complex: new or replacement tank systems with secondary containment (Category A), existing tank systems with secondary containment (Category B), existing tank systems without secondary containment (Category C), and tank systems that have been removed from service (Category D). The FFA specifically requires that DOE demonstrate that the Category C systems are not leaking. This plan and schedule addresses testing of the Category C pipelines and the pipelines which are part of Category B tank systems that do not fully meet the requirements for secondary containment as listed in the FFA. A key feature of the plan is that it is based on the use of performance standards for the conduct of release detection testing, and on the use of methods whose performance has been evaluated and shown to meet those standards. Another feature of the plan is that it is based in part on relevant portions of current federal EPA regulations applicable to underground storage tanks and pipelines (UST systems) that store and transfer petroleum products and other hazardous substances. While the FFA does not require that the testing at ORNL follow these regulations, the regulations do provide industry- and regulator-accepted performance standards, as well as a schedule for repeated testing of UST components

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

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

1992-05-01

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

Interactive Anticipatory Scheduling for Two Military Applications

National Research Council Canada - National Science Library

Howe, Adele

2003-01-01

...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...

Integrating smart grid solution into distribution network planning

NARCIS (Netherlands)

Grond, M.O.W.; Morren, J.; Slootweg, J.G.

2013-01-01

The planning of medium voltage (MV) distribution networks is a challenging optimization problem due to its scale, its inherent uncertainty, and non-linear nature. In the international technical literature, there are many different optimization models and methods available to approach this planning

SOFIA's Choice: Automating the Scheduling of Airborne Observations

Science.gov (United States)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Artificial Neural Network Based Mission Planning Mechanism for Spacecraft

Science.gov (United States)

Li, Zhaoyu; Xu, Rui; Cui, Pingyuan; Zhu, Shengying

2018-04-01

The ability to plan and react fast in dynamic space environments is central to intelligent behavior of spacecraft. For space and robotic applications, many planners have been used. But it is difficult to encode the domain knowledge and directly use existing techniques such as heuristic to improve the performance of the application systems. Therefore, regarding planning as an advanced control problem, this paper first proposes an autonomous mission planning and action selection mechanism through a multiple layer perceptron neural network approach to select actions in planning process and improve efficiency. To prove the availability and effectiveness, we use autonomous mission planning problems of the spacecraft, which is a sophisticated system with complex subsystems and constraints as an example. Simulation results have shown that artificial neural networks (ANNs) are usable for planning problems. Compared with the existing planning method in EUROPA, the mechanism using ANNs is more efficient and can guarantee stable performance. Therefore, the mechanism proposed in this paper is more suitable for planning problems of spacecraft that require real time and stability.

Social networks, big data and transport planning

Energy Technology Data Exchange (ETDEWEB)

Ruiz Sanchez, T.; Lidon Mars Aicart, M. del; Arroyo Lopez, M.R.; Serna Nocedal, A.

2016-07-01

The characteristics of people who are related or tied to each individual affects her activitytravel behavior. That influence is especially associated to social and recreational activities, which are increasingly important. Collecting high quality data from those social networks is very difficult, because respondents are asked about their general social life, which is most demanding to remember that specific facts. On the other hand, currently there are different potential sources of transport data, which is characterized by the huge amount of information available, the velocity with it is obtained and the variety of format in which is presented. This sort of information is commonly known as Big Data. In this paper we identify potential sources of social network related big data that can be used in Transport Planning. Then, a review of current applications in Transport Planning is presented. Finally, some future prospects of using social network related big data are highlighted. (Author)

Project management a systems approach to planning, scheduling, and controlling

CERN Document Server

Kerzner, Harold

2017-01-01

Project Management is the bestselling text for students and professionals, presenting a streamlined approach to project management functions in full alignment with PMI(r)'s latest Project Management Body of Knowledge (PMBOK(r)). This new 12th edition has been updated to reflect the latest changes found in the PMBOK(r) Guide--Sixth Edition, and features new coverage of emerging topics including global stakeholder management, causes of failure, agile project management, project governance failure, customer approval milestones, classifying project metrics, and more. Supplementary materials are available for students, working professionals, and instructors. * Understand organizational structures and project management functions * Learn how to control costs, manage risk, and analyze trade-offs * Examine different methods used for planning, scheduling, QA, and more * Work effectively with customers and stakeholders from around the globe Project Management is the comprehensive reference to keep within arm's reach. ...

Effect of AQM-Based RLC Buffer Management on the eNB Scheduling Algorithm in LTE Network

Directory of Open Access Journals (Sweden)

Anup Kumar Paul

2017-09-01

Full Text Available With the advancement of the Long-Term Evolution (LTE network and smart-phones, most of today’s internet content is delivered via cellular links. Due to the nature of wireless signal propagation, the capacity of the last hop link can vary within a short period of time. Unfortunately, Transmission Control Protocol (TCP does not perform well in such scenarios, potentially leading to poor Quality of Service (QoS (e.g., end-to-end throughput and delay for the end user. In this work, we have studied the effect of Active Queue Management (AQM based congestion control and intra LTE handover on the performance of different Medium Access Control (MAC schedulers with TCP traffic by ns3 simulation. A proper AQM design in the Radio Link Control (RLC buffer of eNB in the LTE network leads to the avoidance of forced drops and link under-utilization along with robustness to a variety of network traffic-loads. We first demonstrate that the original Random Early Detection (RED linear dropping function cannot cope well with different traffic-load scenarios. Then, we establish a heuristic approach in which different non-linear functions are proposed with one parameter free to define. In our simulations, we demonstrate that the performance of different schedulers can be enhanced via proper dropping function.

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

A comparison of two exact methods for passenger railway rolling stock (re)scheduling

DEFF Research Database (Denmark)

Haahr, Jørgen Thorlund; Wagenaar, Joris C.; Veelenturf, Lucas P.

2016-01-01

The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real...... is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption...... scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting....

A hybrid job-shop scheduling system

Science.gov (United States)

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

1992-01-01

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

Optimal Scheduling of a Multi-Carrier Energy Hub Supplemented By Battery Energy Storage Systems

DEFF Research Database (Denmark)

Javadi, Mohammad Sadegh; Anvari-Moghaddam, Amjad; Guerrero, Josep M.

2017-01-01

This paper introduces a management model for optimal scheduling of a multi-carrier energy hub. In the proposed hub, three types of assets are considered: dispersed generating systems (DGs) such as micro-combined heat and power (mCHP) units, storage devices such as battery-based electrical storage...... systems (ESSs), and heating/cooling devices such as electrical heater, heat-pumps and absorption chillers. The optimal scheduling and management of the examined energy hub assets in line with electrical transactions with distribution network is modeled as a mixed-integer non-linear optimization problem....... In this regard, optimal operating points of DG units as well as ESSs are calculated based on a cost-effective strategy. Degradation cost of ESSs is also taken into consideration for short-term scheduling. Simulation results demonstrate that including well-planned energy storage options together with optimal...

Optimal Scheduling of a Battery Energy Storage System with Electric Vehicles’ Auxiliary for a Distribution Network with Renewable Energy Integration

Directory of Open Access Journals (Sweden)

Yuqing Yang

2015-09-01

Full Text Available With global conventional energy depletion, as well as environmental pollution, utilizing renewable energy for power supply is the only way for human beings to survive. Currently, distributed generation incorporated into a distribution network has become the new trend, with the advantages of controllability, flexibility and tremendous potential. However, the fluctuation of distributed energy resources (DERs is still the main concern for accurate deployment. Thus, a battery energy storage system (BESS has to be involved to mitigate the bad effects of DERs’ integration. In this paper, optimal scheduling strategies for BESS operation have been proposed, to assist with consuming the renewable energy, reduce the active power loss, alleviate the voltage fluctuation and minimize the electricity cost. Besides, the electric vehicles (EVs considered as the auxiliary technique are also introduced to attenuate the DERs’ influence. Moreover, both day-ahead and real-time operation scheduling strategies were presented under the consideration with the constraints of BESS and the EVs’ operation, and the optimization was tackled by a fuzzy mathematical method and an improved particle swarm optimization (IPSO algorithm. Furthermore, the test system for the proposed strategies is a real distribution network with renewable energy integration. After simulation, the proposed scheduling strategies have been verified to be extremely effective for the enhancement of the distribution network characteristics.

Supporting Real-Time Operations and Execution through Timeline and Scheduling Aids

Science.gov (United States)

Marquez, Jessica J.; Pyrzak, Guy; Hashemi, Sam; Ahmed, Samia; McMillin, Kevin Edward; Medwid, Joseph Daniel; Chen, Diana; Hurtle, Esten

2013-01-01

Since 2003, the NASA Ames Research Center has been actively involved in researching and advancing the state-of-the-art of planning and scheduling tools for NASA mission operations. Our planning toolkit SPIFe (Scheduling and Planning Interface for Exploration) has supported a variety of missions and field tests, scheduling activities for Mars rovers as well as crew on-board International Space Station and NASA earth analogs. The scheduled plan is the integration of all the activities for the day/s. In turn, the agents (rovers, landers, spaceships, crew) execute from this schedule while the mission support team members (e.g., flight controllers) follow the schedule during execution. Over the last couple of years, our team has begun to research and validate methods that will better support users during realtime operations and execution of scheduled activities. Our team utilizes human-computer interaction principles to research user needs, identify workflow processes, prototype software aids, and user test these. This paper discusses three specific prototypes developed and user tested to support real-time operations: Score Mobile, Playbook, and Mobile Assistant for Task Execution (MATE).

Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

Directory of Open Access Journals (Sweden)

Mohammad Taghi Ameli

2012-01-01

Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

Planning and management of cloud computing networks

Science.gov (United States)

Larumbe, Federico

comprehensive vision. The first question to be solved is what are the optimal data center locations. We found that the location of each data center has a big impact on cost, QoS, power consumption, and greenhouse gas emissions. An optimization problem with a multi-criteria objective function is proposed to decide jointly the optimal location of data centers and software components, link capacities, and information routing. Once the network planning has been analyzed, the problem of dynamic resource provisioning in real time is addressed. In this context, virtualization is a key technique in cloud computing because each server can be shared by multiple Virtual Machines (VMs) and the total power consumption can be reduced. In the same line of location problems, we propose a Green Cloud Broker that optimizes VM placement across multiple data centers. In fact, when multiple data centers are considered, response time can be reduced by placing VMs close to users, cost can be minimized, power consumption can be optimized by using energy efficient data centers, and CO2 emissions can be decreased by choosing data centers provided with renewable energy sources. The third stage of the analysis is the short-term management of a cloud data center. In particular, a method is proposed to assign VMs to servers by considering communication traffic among VMs. Cloud data centers receive new applications over time and these applications need on-demand resource provisioning. Each application is composed of multiple types of VMs that interact among themselves. A program called scheduler must place each new VM in a server and that impacts the QoS and power consumption. Our method places VMs that communicate among themselves in servers that are close to each other in the network topology, thus reducing communication delay and increasing the throughput available among VMs. Furthermore, the power consumption of each type of server is considered and the most efficient ones are chosen to place the VMs

Network effects in railways

DEFF Research Database (Denmark)

Landex, Alex

2012-01-01

Railway operation is often affected by network effects as a change in one part of the network can influence other parts of the network. Network effects occur because the train runs may be quite long and since the railway system has a high degree of interdependencies as trains cannot cross....../overtake each other everywhere in the network. First this paper describes network effects in general (section 1). In section 2 the network effects for trains and how they can be measured by scheduled waiting time is described. When the trains are affected by network effects the passengers are also affected....... Therefore, sections 3 and 4 describe the network effects for passengers and how they can be measured using passenger delay models. Before the concluding remarks in section 6, section 5 discusses how the operation can be improved by examining network effects in the planning process. © 2012 WIT Press....

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

Science.gov (United States)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

Evaluation and scoring of radiotherapy treatment plans using an artificial neural network

International Nuclear Information System (INIS)

Willoughby, Twyla R.; Starkschall, George; Janjan, Nora A.; Rosen, Isaac I.

1996-01-01

Purpose: The objective of this work was to demonstrate the feasibility of using an artificial neural network to predict the clinical evaluation of radiotherapy treatment plans. Methods and Materials: Approximately 150 treatment plans were developed for 16 patients who received external-beam radiotherapy for soft-tissue sarcomas of the lower extremity. Plans were assigned a figure of merit by a radiation oncologist using a five-point rating scale. Plan scoring was performed by a single physician to ensure consistency in rating. Dose-volume information extracted from a training set of 511 treatment plans on 14 patients was correlated to the physician-generated figure of merit using an artificial neural network. The neural network was tested with a test set of 19 treatment plans on two patients whose plans were not used in the training of the neural net. Results: Physician scoring of treatment plans was consistent to within one point on the rating scale 88% of the time. The neural net reproduced the physician scores in the training set to within one point approximately 90% of the time. It reproduced the physician scores in the test set to within one point approximately 83% of the time. Conclusions: An artificial neural network can be trained to generate a score for a treatment plan that can be correlated to a clinically-based figure of merit. The accuracy of the neural net in scoring plans compares well with the reproducibility of the clinical scoring. The system of radiotherapy treatment plan evaluation using an artificial neural network demonstrates promise as a method for generating a clinically relevant figure of merit

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

Directory of Open Access Journals (Sweden)

Sang-Oh Shim

2017-12-01

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

Cyclic delivery scheduling to customers with different priorities

Directory of Open Access Journals (Sweden)

Katarzyna Zofia Gdowska

2013-12-01

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

Integration of Neural Networks and Cellular Automata for Urban Planning

Institute of Scientific and Technical Information of China (English)

Anthony Gar-on Yeh; LI Xia

2004-01-01

This paper presents a new type of cellular automata (CA) model for the simulation of alternative land development using neural networks for urban planning. CA models can be regarded as a planning tool because they can generate alternative urban growth. Alternative development patterns can be formed by using different sets of parameter values in CA simulation. A critical issue is how to define parameter values for realistic and idealized simulation. This paper demonstrates that neural networks can simplify CA models but generate more plausible results. The simulation is based on a simple three-layer network with an output neuron to generate conversion probability. No transition rules are required for the simulation. Parameter values are automatically obtained from the training of network by using satellite remote sensing data. Original training data can be assessed and modified according to planning objectives. Alternative urban patterns can be easily formulated by using the modified training data sets rather than changing the model.

Network evolution of body plans.

Directory of Open Access Journals (Sweden)

Koichi Fujimoto

Full Text Available One of the major goals in evolutionary developmental biology is to understand the relationship between gene regulatory networks and the diverse morphologies and their functionalities. Are the diversities solely triggered by random events, or are they inevitable outcomes of an interplay between evolving gene networks and natural selection? Segmentation in arthropod embryogenesis represents a well-known example of body plan diversity. Striped patterns of gene expression that lead to the future body segments appear simultaneously or sequentially in long and short germ-band development, respectively. Moreover, a combination of both is found in intermediate germ-band development. Regulatory genes relevant for stripe formation are evolutionarily conserved among arthropods, therefore the differences in the observed traits are thought to have originated from how the genes are wired. To reveal the basic differences in the network structure, we have numerically evolved hundreds of gene regulatory networks that produce striped patterns of gene expression. By analyzing the topologies of the generated networks, we show that the characteristics of stripe formation in long and short germ-band development are determined by Feed-Forward Loops (FFLs and negative Feed-Back Loops (FBLs respectively, and those of intermediate germ-band development are determined by the interconnections between FFL and negative FBL. Network architectures, gene expression patterns and knockout responses exhibited by the artificially evolved networks agree with those reported in the fly Drosophila melanogaster and the beetle Tribolium castaneum. For other arthropod species, principal network architectures that remain largely unknown are predicted. Our results suggest that the emergence of the three modes of body segmentation in arthropods is an inherent property of the evolving networks.

The Simultaneous Vehicle Scheduling and Passenger Service Problem

DEFF Research Database (Denmark)

Petersen, Hanne Løhmann; Larsen, Allan; Madsen, Oli B.G.

modifications of the timetable during the vehicle scheduling phase. This planning approach is referred to as the Simultaneous Vehicle Scheduling and Passenger Service Problem (SVSPSP). The SVSPSP is solved using a large neighbourhood search metaheuristic. The proposed framework is tested on data inspired......Passengers using public transport systems often experience waiting times when transferring between two scheduled services. We propose a planning approach which seeks to obtain a favorable trade-off between the conflicting objectives passenger service and operating cost, by allowing some moderate...

Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

DEFF Research Database (Denmark)

Gamst, M.

2014-01-01

problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the 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 has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...

Plan Generation and Evaluation Using Action Networks

National Research Council Canada - National Science Library

Peot, Mark

2003-01-01

... from potential actions of the plan. Methods used to accomplish these results included the use of Action Networks, and development of a suite of analysis tools in support of the AFRL Campaign Assessment Tool...

A Metaheuristic Scheduler for Time Division Multiplexed Network-on-Chip

DEFF Research Database (Denmark)

Sørensen, Rasmus Bo; Sparsø, Jens; Pedersen, Mark Ruvald

2014-01-01

significant practical implications, is the minimization of the TDM schedule period by over-provisioning bandwidth to connections with the smallest bandwidth requirements. Our results show that this is possible with only negligible impact on the schedule period. We evaluate the scheduler with seven different...... applications from the MCSL NOC benchmark suite. In the special case of all-to-all communication with equal bandwidths on all communication channels, we obtain schedules with a shorter period than reported in previous work....

Threshold Based Opportunistic Scheduling of Secondary Users in Underlay Cognitive Radio Networks

KAUST Repository

Song, Yao

2011-12-01

In underlay cognitive radio networks, secondary users can share the spectrum with primary users as long as the interference caused by the secondary users to primary users is below a certain predetermined threshold. It is reasonable to assume that there is always a large pool of secondary users trying to access the channel, which can be occupied by only one secondary user at a given time. As a result, a multi-user scheduling problem arises among the secondary users. In this thesis, by manipulating basic schemes based on selective multi-user diversity, normalized thresholding, transmission power control, and opportunistic round robin, we propose and analyze eight scheduling schemes of secondary users in an underlay cognitive radio set-up. The system performance of these schemes is quantified by using various performance metrics such as the average system capacity, normalized average feedback load, scheduling outage probability, and system fairness of access. In our proposed schemes, the best user out of all the secondary users in the system is picked to transmit at each given time slot in order to maximize the average system capacity. Two thresholds are used in the two rounds of the selection process to determine the best user. The first threshold is raised by the power constraint from the primary user. The second threshold, which can be adjusted by us, is introduced to reduce the feedback load. The overall system performance is therefore dependent on the choice of these two thresholds and the number of users in the system given the channel conditions for all the users. In this thesis, by deriving analytical formulas and presenting numerical examples, we try to provide insights of the relationship between the performance metrics and the involved parameters including two selection thresholds and the number of active users in the system, in an effort to maximize the average system capacity as well as satisfy the requirements of scheduling outage probability and

FLOWSHOP SCHEDULING USING A NETWORK APPROACH ...

African Journals Online (AJOL)

eobe

time when the last job completes on the last machine. The objective ... more jobs in a permutation flow shop scheduling problem ... processing time of a job on a machine is zero, it ..... hybrid flow shops with sequence dependent setup times ...

Operations plan for the Regional Seismic Test Network

International Nuclear Information System (INIS)

1981-01-01

The Regional Seismic Test Network program was established to provide a capability for detection of extremely sensitive earth movements. Seismic signals from both natural and man-made earth motions will be analyzed with the ultimate objective of accurately locating underground nuclear explosions. The Sandia National Laboratories, Albuquerque, has designed an unattended seismic station capable of recording seismic information received at the location of the seismometers installed as part of that specific station. A network of stations is required to increase the capability of determining the source of the seismic signal and the location of the source. Current plans are to establish a five-station seismic network in the United States and Canada. The Department of Energy, Nevada Operations Office, has been assigned the responsibility for deploying, installing, and operating these remote stations. This Operation Plan provides the basic information and tasking to accomplish this assignment

Planning of optimal electricity and gas distribution networks; Planung von optimalen Strom- und Gasverteilungsnetzen

Energy Technology Data Exchange (ETDEWEB)

Berg, Andreas; Hinueber, Gerd; Moser, Albert [RWTH Aachen (DE). Inst. fuer Elektrische Anlagen und Energiewirtschaft (IAEW)

2009-12-15

Framework conditions for the planning of energy networks are changing under the influence of European energy policy, incentive regulation and the politically motivated promotion of new technologies such as electromobility or intelligent metering. The future use of information and communication technologies in energy networks will create new degrees of freedom. This will necessitate changes in the way in which gas and electricity networks have been planned in the past. Especially computer-assisted methods for objectifying planning decisions are moving into the focus of network operators as a valuable network development tool.

NASA deep space network operations planning and preparation

Science.gov (United States)

Jensen, W. N.

1982-01-01

The responsibilities and structural organization of the Operations Planning Group of NASA Deep Space Network (DSN) Operations are outlined. The Operations Planning group establishes an early interface with a user's planning organization to educate the user on DSN capabilities and limitations for deep space tracking support. A team of one or two individuals works through all phases of the spacecraft launch and also provides planning and preparation for specific events such as planetary encounters. Coordinating interface is also provided for nonflight projects such as radio astronomy and VLBI experiments. The group is divided into a Long Range Support Planning element and a Near Term Operations Coordination element.

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1997-01-01

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

Computing Bounds on Resource Levels for Flexible Plans

Science.gov (United States)

Muscvettola, Nicola; Rijsman, David

2009-01-01

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow

Energy efficient distributed cluster head scheduling scheme for two tiered wireless sensor network

Directory of Open Access Journals (Sweden)

G. Kannan

2015-07-01

Full Text Available Wireless Sensor Network (WSN provides a significant contribution in the emerging fields such as ambient intelligence and ubiquitous computing. In WSN, optimization and load balancing of network resources are critical concern to provide the intelligence for long duration. Since clustering the sensor nodes can significantly enhance overall system scalability and energy efficiency this paper presents a distributed cluster head scheduling (DCHS algorithm to achieve the network longevity in WSN. The major novelty of this work is that the network is divided into primary and secondary tiers based on received signal strength indication of sensor nodes from the base station. The proposed DCHS supports for two tier WSN architecture and gives suggestion to elect the cluster head nodes and gateway nodes for both primary and secondary tiers. The DCHS mechanism satisfies an ideal distribution of the cluster head among the sensor nodes and avoids frequent selection of cluster head, based on Received Signal Strength Indication (RSSI and residual energy level of the sensor nodes. Since the RSSI is the key parameter for this paper, the practical experiment was conducted to measure RSSI value by using MSP430F149 processor and CC2500 transceiver. The measured RSSI values were given input to the event based simulator to test the DCHS mechanism. The real time experimental study validated the proposed scheme for various scenarios.

Multiobjective Joint Optimization of Production Scheduling and Maintenance Planning in the Flexible Job-Shop Problem

Directory of Open Access Journals (Sweden)

Jianfei Ye

2015-01-01

Full Text Available In order to solve the joint optimization of production scheduling and maintenance planning problem in the flexible job-shop, a multiobjective joint optimization model considering the maximum completion time and maintenance costs per unit time is established based on the concept of flexible job-shop and preventive maintenance. A weighted sum method is adopted to eliminate the index dimension. In addition, a double-coded genetic algorithm is designed according to the problem characteristics. The best result under the circumstances of joint decision-making is obtained through multiple simulation experiments, which proves the validity of the algorithm. We can prove the superiority of joint optimization model by comparing the result of joint decision-making project with the result of independent decision-making project under fixed preventive maintenance period. This study will enrich and expand the theoretical framework and analytical methods of this problem; it provides a scientific decision analysis method for enterprise to make production plan and maintenance plan.

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.

Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure

Science.gov (United States)

Matyska, Ludek; Ruda, Miroslav; Toth, Simon

For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.

Engineering schedule control of nuclear power project planning and management

International Nuclear Information System (INIS)

Meng Hao

2014-01-01

Nuclear power design is the important part of project management of nuclear power project, it is the way to control the project organization, design schedule, design progress, design quality and cost control. The good schedule system and control is the key to the success for the project. It is also analyzed the problem during the project, by using some theory and analyze the project structure, design schedule management, IED and document management and interface management propose some new idea for better improve the design management to finally better improve the management quality and efficiency. (author)

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

Linking Climate Risk, Policy Networks and Adaptation Planning in Public Lands

Science.gov (United States)

Lubell, M.; Schwartz, M.; Peters, C.

2014-12-01

Federal public land management agencies in the United States have engaged a variety of planning efforts to address climate adaptation. A major goal of these efforts is to build policy networks that enable land managers to access information and expertise needed for responding to local climate risks. This paper investigates whether the perceived and modeled climate risk faced by different land managers is leading to larger networks or more participating in climate adaptation. In theory, the benefits of climate planning networks are larger when land managers are facing more potential changes. The basic hypothesis is tested with a survey of public land managers from hundreds of local and regional public lands management units in the Southwestern United States, as well as other stakeholders involved with climate adaptation planning. All survey respondents report their perceptions of climate risk along a variety of dimensions, as well as their participation in climate adaptation planning and information sharing networks. For a subset of respondents, we have spatially explicity GIS data about their location, which will be linked with downscaled climate model data. With the focus on climate change, the analysis is a subset of the overall idea of linking social and ecological systems.

Dynamic Vehicle Scheduling for Working Service Network with Dual Demands

Directory of Open Access Journals (Sweden)

Bing Li

2017-01-01

Full Text Available This study aims to develop some models to aid in making decisions on the combined fleet size and vehicle assignment in working service network where the demands include two types (minimum demands and maximum demands, and vehicles themselves can act like a facility to provide services when they are stationary at one location. This type of problem is named as the dynamic working vehicle scheduling with dual demands (DWVS-DD and formulated as a mixed integer programming (MIP. Instead of a large integer program, the problem is decomposed into small local problems that are guided by preset control parameters. The approach for preset control parameters is given. By introducing them into the MIP formulation, the model is reformulated as a piecewise form. Further, a piecewise method by updating preset control parameters is proposed for solving the reformulated model. Numerical experiments show that the proposed method produces better solution within reasonable computing time.

Integrated production-distribution planning optimization models: A review in collaborative networks context

Directory of Open Access Journals (Sweden)

Beatriz Andres

2017-01-01

Full Text Available Researchers in the area of collaborative networks are more and more aware of proposing collaborative approaches to address planning processes, due to the advantages associated when enterprises perform integrated planning models. Collaborative production-distribution planning, among the supply network actors, is considered a proper mechanism to support enterprises on dealing with uncertainties and dynamicity associated to the current markets. Enterprises, and especially SMEs, should be able to overcome the continuous changes of the market by increasing their agility. Carrying out collaborative planning allows enterprises to enhance their readiness and agility for facing the market turbulences. However, SMEs have limited access when incorporating optimization tools to deal with collaborative planning, reducing their ability to respond to the competition. The problem to solve is to provide SMEs affordable solutions to support collaborative planning. In this regard, new optimisation algorithms are required in order to improve the collaboration within the supply network partners. As part of the H2020 Cloud Collaborative Manufacturing Networks (C2NET research project, this paper presents a study on integrated production and distribution plans. The main objective of the research is to identify gaps in current optimization models, proposed to address integrated planning, taking into account the requirements and needs of the industry. Thus, the needs of the companies belonging to the industrial pilots, defined in the C2NET project, are identified; analysing how these needs are covered by the optimization models proposed in the literature, to deal with the integrated production-distribution planning.

Network planning study of the metro-optical-network-oriented 3G application

Science.gov (United States)

Gong, Qian; Xu, Rong; Lin, Jin Tong

2005-02-01

To compare with the 2G mobile communication, 3G technologies can supply the perfect service scope and performance. 3G is the trend of the mobile communication. So now to build the transmission network, it is needed to consider how the transmission network to support the 3G applications. For the 3G network architecture, it include the 2 part: Utran access network and core network. So the metro optical network should consider how to build the network to adapt the 3G applications. Include the metro core and access layer. In the metro core, we should consider the network should evolved towards the Mesh architecture with ASON function to realize the fast protection and restoration, quick end-to-end service provision, and high capacity cross-connect matrix etc. In the access layer, the network should have the ability to access the 3G services such as ATM interface with IMA function. In addition, the traffic grooming should be provided to improve the bandwidth utility. In this paper, first we present the MCC network situation, the network planning model will be introduced. Then we present the topology architecture, node capacity and traffic forecast. At last, based on our analysis, we will give a total solution to MCC to build their metro optical network toward to the mesh network with the consideration of 3G services.

Environmental monitoring master sampling schedule, January--December 1990

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1990-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 1990 for the Environment Surveillance and Ground-Water 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. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs. This schedule includes ground-water sampling performed by PNL for environmental surveillance of the Hanford Site.

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

Scheduling of House Development Projects with CPM and PERT Method for Time Efficiency (Case Study: House Type 36)

Science.gov (United States)

Kholil, Muhammad; Nurul Alfa, Bonitasari; Hariadi, Madjumsyah

2018-04-01

Network planning is one of the management techniques used to plan and control the implementation of a project, which shows the relationship between activities. The objective of this research is to arrange network planning on house construction project on CV. XYZ and to know the role of network planning in increasing the efficiency of time so that can be obtained the optimal project completion period. This research uses descriptive method, where the data collected by direct observation to the company, interview, and literature study. The result of this research is optimal time planning in project work. Based on the results of the research, it can be concluded that the use of the both methods in scheduling of house construction project gives very significant effect on the completion time of the project. The company’s CPM (Critical Path Method) method can complete the project with 131 days, PERT (Program Evaluation Review and Technique) Method takes 136 days. Based on PERT calculation obtained Z = -0.66 or 0,2546 (from normal distribution table), and also obtained the value of probability or probability is 74,54%. This means that the possibility of house construction project activities can be completed on time is high enough. While without using both methods the project completion time takes 173 days. So using the CPM method, the company can save time up to 42 days and has time efficiency by using network planning.

A continuous-time control model on production planning network ...

African Journals Online (AJOL)

A continuous-time control model on production planning network. DEA Omorogbe, MIU Okunsebor. Abstract. In this paper, we give a slightly detailed review of Graves and Hollywood model on constant inventory tactical planning model for a job shop. The limitations of this model are pointed out and a continuous time ...

On Planning of FTTH Access Networks with and without Redundancy

DEFF Research Database (Denmark)

Riaz, M. Tahir; Haraldsson, Gustav; Gutierrez Lopez, Jose Manuel

2010-01-01

This paper presents a planning analysis of FTTH access network with and without redundancy. Traditionally, access networks are planned only without redundancy, which is mainly due to lowering the cost of deployment. As fiber optics provide a huge amount of capacity, more and more services are being...... offered on a single fiber connection. As a single point of failure in fiber connection can cause multiple service deprivation therefore redundancy is very crucial. In this work, an automated planning model was used to test different scenarios of implementation. A cost estimation is presented in terms...... of digging and amount of fiber used. Three topologies, including the traditional one “tree topology”, were test with combination of various passive optical technologies....

Pricing and Capacity Planning Problems in Energy Transmission Networks

DEFF Research Database (Denmark)

Villumsen, Jonas Christoffer

strategy. In the Nordic electricity system a market with zonal prices is adopted. We consider the problem of designing zones in an optimal way explicitly considering uncertainty. Finally, we formulate the integrated problem of pipeline capacity expansion planning and transmission pricing in natural gas...... necessitates a radical change in the way we plan and operate energy systems. Another paradigm change which began in the 1990’s for electricity systems is that of deregulation. This has led to a variety of different market structures implemented across the world. In this thesis we discuss capacity planning...... and transmission pricing problems in energy transmission networks. Although the modelling framework applies to energy networks in general, most of the applications discussed concern the transmission of electricity. A number of the problems presented involves transmission switching, which allows the operator...

Capacity planning for Carrier Ethernet LTE backhaul networks

DEFF Research Database (Denmark)

Checko, Aleksandra; Ellegaard, Lars; Berger, Michael Stübert

2012-01-01

With the introduction of LTE networks operators need to plan a new, IP-based mobile backhaul. In this paper, we provide recommendation on dimensioning LTE backhaul networks links using three methods: delay-, dimensioning formula- and overbooking factor-based. Results are obtained from OPNET simul...... and verified. Simulation in this work proves that Carrier Ethernet, one of the candidate technologies for mobile backhaul, protects the network from users that want to flood the network with their data and manages to keep the delay experienced by other users low....... simulations with traffic model based on traffic forecast for 2015. A delay-based approach gives recommended bandwidth for expected number of users. A dimensioning formula is proposed to calculate link bandwidth when mean value of aggregated traffic in the network is known. An overbooking factor is calculated...

Algorithms for Scheduling and Network Problems

Science.gov (United States)

1991-09-01

time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

Arizona TeleMedicine Network: Engineering Master Plan.

Science.gov (United States)

Atlantic Research Corp., Alexandria, VA.

As the planning document for establishing a statewide health communications system initially servicing the Papago, San Carlos and White Mountain Apache, Navajo, and Hopi reservations, this document prescribes the communications services to be provided by the Arizona TeleMedicine Network. Specifications include: (1) communications services for each…

Methods to model and predict the ViewRay treatment deliveries to aid patient scheduling and treatment planning.

Science.gov (United States)

Liu, Shi; Wu, Yu; Wooten, H Omar; Green, Olga; Archer, Brent; Li, Harold; Yang, Deshan

2016-03-08

A software tool is developed, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance image-guided radiation therapy (MR-IGRT) delivery system. This tool is necessary for managing patient treatment scheduling in our clinic. The predicted treatment delivery time and the assessment of plan complexities could also be useful to aid treatment planning. A patient's total treatment delivery time, not including time required for localization, is modeled as the sum of four components: 1) the treatment initialization time; 2) the total beam-on time; 3) the gantry rotation time; and 4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected dose rate. To predict the remain-ing components, we retrospectively analyzed the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, linear regression is applied to predict the gantry rotation time. The MLC motion time is calculated using the leaves delay modeling method and the leaf motion speed. A quantitative analysis was performed to understand the correlation between the total treatment time and the plan complexity. The proposed algorithm is able to predict the ViewRay treatment delivery time with the average prediction error 0.22min or 1.82%, and the maximal prediction error 0.89 min or 7.88%. The analysis has shown the correlation between the plan modulation (PM) factor and the total treatment delivery time, as well as the treatment delivery duty cycle. A possibility has been identified to significantly reduce MLC motion time by optimizing the positions of closed MLC pairs. The accuracy of

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

An optimization planning technique for Suez Canal Network in Egypt

Energy Technology Data Exchange (ETDEWEB)

Abou El-Ela, A.A.; El-Zeftawy, A.A.; Allam, S.M.; Atta, Gasir M. [Electrical Engineering Dept., Faculty of Eng., Shebin El-Kom (Egypt)

2010-02-15

This paper introduces a proposed optimization technique POT for predicting the peak load demand and planning of transmission line systems. Many of traditional methods have been presented for long-term load forecasting of electrical power systems. But, the results of these methods are approximated. Therefore, the artificial neural network (ANN) technique for long-term peak load forecasting is modified and discussed as a modern technique in long-term load forecasting. The modified technique is applied on the Egyptian electrical network dependent on its historical data to predict the electrical peak load demand forecasting up to year 2017. This technique is compared with extrapolation of trend curves as a traditional method. The POT is applied also to obtain the optimal planning of transmission lines for the 220 kV of Suez Canal Network (SCN) using the ANN technique. The minimization of the transmission network costs are considered as an objective function, while the transmission lines (TL) planning constraints are satisfied. Zafarana site on the Red Sea coast is considered as an optimal site for installing big wind farm (WF) units in Egypt. So, the POT is applied to plan both the peak load and the electrical transmission of SCN with and without considering WF to develop the impact of WF units on the electrical transmission system of Egypt, considering the reliability constraints which were taken as a separate model in the previous techniques. The application on SCN shows the capability and the efficiently of the proposed techniques to obtain the predicting peak load demand and the optimal planning of transmission lines of SCN up to year 2017. (author)

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